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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-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 8.1K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K 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.8K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 22 12:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 146K 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-12-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1620762181558

Running Version 0
[2021-05-11 19:43:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-11 19:43:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-11 19:43:03] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2021-05-11 19:43:03] [INFO ] Transformed 586 places.
[2021-05-11 19:43:03] [INFO ] Transformed 525 transitions.
[2021-05-11 19:43:03] [INFO ] Found NUPN structural information;
[2021-05-11 19:43:03] [INFO ] Parsed PT model containing 586 places and 525 transitions in 140 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
[2021-05-11 19:43:03] [INFO ] Reduced 1 identical enabling conditions.
Deduced a syphon composed of 4 places in 12 ms
Reduce places removed 4 places and 4 transitions.
Support contains 390 out of 582 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 582/582 places, 521/521 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 579 transition count 521
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 29 place count 553 transition count 495
Iterating global reduction 1 with 26 rules applied. Total rules applied 55 place count 553 transition count 495
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 60 place count 548 transition count 490
Iterating global reduction 1 with 5 rules applied. Total rules applied 65 place count 548 transition count 490
Applied a total of 65 rules in 68 ms. Remains 548 /582 variables (removed 34) and now considering 490/521 (removed 31) transitions.
// Phase 1: matrix 490 rows 548 cols
[2021-05-11 19:43:03] [INFO ] Computed 95 place invariants in 31 ms
[2021-05-11 19:43:03] [INFO ] Implicit Places using invariants in 261 ms returned []
// Phase 1: matrix 490 rows 548 cols
[2021-05-11 19:43:03] [INFO ] Computed 95 place invariants in 14 ms
[2021-05-11 19:43:04] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 627 ms to find 0 implicit places.
// Phase 1: matrix 490 rows 548 cols
[2021-05-11 19:43:04] [INFO ] Computed 95 place invariants in 22 ms
[2021-05-11 19:43:04] [INFO ] Dead Transitions using invariants and state equation in 292 ms returned []
Finished structural reductions, in 1 iterations. Remains : 548/582 places, 490/521 transitions.
[2021-05-11 19:43:04] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-11 19:43:04] [INFO ] Flatten gal took : 65 ms
FORMULA BusinessProcesses-PT-12-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-11 19:43:04] [INFO ] Flatten gal took : 31 ms
[2021-05-11 19:43:04] [INFO ] Input system was already deterministic with 490 transitions.
Incomplete random walk after 100000 steps, including 727 resets, run finished after 480 ms. (steps per millisecond=208 ) properties (out of 69) seen :56
Running SMT prover for 13 properties.
// Phase 1: matrix 490 rows 548 cols
[2021-05-11 19:43:05] [INFO ] Computed 95 place invariants in 11 ms
[2021-05-11 19:43:05] [INFO ] [Real]Absence check using 58 positive place invariants in 28 ms returned sat
[2021-05-11 19:43:05] [INFO ] [Real]Absence check using 58 positive and 37 generalized place invariants in 10 ms returned sat
[2021-05-11 19:43:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 19:43:05] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2021-05-11 19:43:05] [INFO ] Computed and/alt/rep : 456/757/456 causal constraints (skipped 33 transitions) in 37 ms.
[2021-05-11 19:43:06] [INFO ] Added : 97 causal constraints over 20 iterations in 572 ms. Result :sat
[2021-05-11 19:43:06] [INFO ] [Real]Absence check using 58 positive place invariants in 15 ms returned sat
[2021-05-11 19:43:06] [INFO ] [Real]Absence check using 58 positive and 37 generalized place invariants in 6 ms returned sat
[2021-05-11 19:43:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 19:43:06] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2021-05-11 19:43:06] [INFO ] Deduced a trap composed of 12 places in 184 ms of which 6 ms to minimize.
[2021-05-11 19:43:06] [INFO ] Deduced a trap composed of 114 places in 137 ms of which 1 ms to minimize.
[2021-05-11 19:43:07] [INFO ] Deduced a trap composed of 108 places in 230 ms of which 14 ms to minimize.
[2021-05-11 19:43:07] [INFO ] Deduced a trap composed of 21 places in 204 ms of which 1 ms to minimize.
[2021-05-11 19:43:07] [INFO ] Deduced a trap composed of 36 places in 228 ms of which 1 ms to minimize.
[2021-05-11 19:43:07] [INFO ] Deduced a trap composed of 43 places in 175 ms of which 0 ms to minimize.
[2021-05-11 19:43:08] [INFO ] Deduced a trap composed of 114 places in 225 ms of which 1 ms to minimize.
[2021-05-11 19:43:08] [INFO ] Deduced a trap composed of 105 places in 163 ms of which 1 ms to minimize.
[2021-05-11 19:43:08] [INFO ] Deduced a trap composed of 24 places in 167 ms of which 1 ms to minimize.
[2021-05-11 19:43:08] [INFO ] Deduced a trap composed of 35 places in 103 ms of which 1 ms to minimize.
[2021-05-11 19:43:08] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 0 ms to minimize.
[2021-05-11 19:43:08] [INFO ] Deduced a trap composed of 17 places in 127 ms of which 1 ms to minimize.
[2021-05-11 19:43:09] [INFO ] Deduced a trap composed of 41 places in 150 ms of which 1 ms to minimize.
[2021-05-11 19:43:09] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 0 ms to minimize.
[2021-05-11 19:43:09] [INFO ] Deduced a trap composed of 115 places in 93 ms of which 1 ms to minimize.
[2021-05-11 19:43:09] [INFO ] Deduced a trap composed of 51 places in 158 ms of which 1 ms to minimize.
[2021-05-11 19:43:09] [INFO ] Deduced a trap composed of 45 places in 102 ms of which 0 ms to minimize.
[2021-05-11 19:43:10] [INFO ] Deduced a trap composed of 108 places in 440 ms of which 0 ms to minimize.
[2021-05-11 19:43:10] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 1 ms to minimize.
[2021-05-11 19:43:10] [INFO ] Deduced a trap composed of 32 places in 130 ms of which 1 ms to minimize.
[2021-05-11 19:43:10] [INFO ] Deduced a trap composed of 129 places in 134 ms of which 0 ms to minimize.
[2021-05-11 19:43:10] [INFO ] Deduced a trap composed of 30 places in 128 ms of which 1 ms to minimize.
[2021-05-11 19:43:10] [INFO ] Deduced a trap composed of 28 places in 188 ms of which 0 ms to minimize.
[2021-05-11 19:43:10] [INFO ] Deduced a trap composed of 38 places in 114 ms of which 13 ms to minimize.
[2021-05-11 19:43:11] [INFO ] Deduced a trap composed of 51 places in 103 ms of which 1 ms to minimize.
[2021-05-11 19:43:11] [INFO ] Deduced a trap composed of 49 places in 51 ms of which 1 ms to minimize.
[2021-05-11 19:43:11] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 4766 ms
[2021-05-11 19:43:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 19:43:11] [INFO ] [Nat]Absence check using 58 positive place invariants in 16 ms returned sat
[2021-05-11 19:43:11] [INFO ] [Nat]Absence check using 58 positive and 37 generalized place invariants in 10 ms returned sat
[2021-05-11 19:43:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 19:43:11] [INFO ] [Nat]Absence check using state equation in 196 ms returned sat
[2021-05-11 19:43:11] [INFO ] Deduced a trap composed of 12 places in 196 ms of which 1 ms to minimize.
[2021-05-11 19:43:11] [INFO ] Deduced a trap composed of 114 places in 115 ms of which 0 ms to minimize.
[2021-05-11 19:43:11] [INFO ] Deduced a trap composed of 108 places in 107 ms of which 0 ms to minimize.
[2021-05-11 19:43:12] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 0 ms to minimize.
[2021-05-11 19:43:12] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 0 ms to minimize.
[2021-05-11 19:43:12] [INFO ] Deduced a trap composed of 43 places in 150 ms of which 0 ms to minimize.
[2021-05-11 19:43:12] [INFO ] Deduced a trap composed of 114 places in 144 ms of which 0 ms to minimize.
[2021-05-11 19:43:12] [INFO ] Deduced a trap composed of 105 places in 171 ms of which 1 ms to minimize.
[2021-05-11 19:43:12] [INFO ] Deduced a trap composed of 24 places in 158 ms of which 4 ms to minimize.
[2021-05-11 19:43:13] [INFO ] Deduced a trap composed of 35 places in 195 ms of which 1 ms to minimize.
[2021-05-11 19:43:13] [INFO ] Deduced a trap composed of 25 places in 145 ms of which 1 ms to minimize.
[2021-05-11 19:43:13] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 0 ms to minimize.
[2021-05-11 19:43:13] [INFO ] Deduced a trap composed of 41 places in 240 ms of which 2 ms to minimize.
[2021-05-11 19:43:13] [INFO ] Deduced a trap composed of 32 places in 179 ms of which 1 ms to minimize.
[2021-05-11 19:43:14] [INFO ] Deduced a trap composed of 115 places in 291 ms of which 1 ms to minimize.
[2021-05-11 19:43:14] [INFO ] Deduced a trap composed of 51 places in 135 ms of which 1 ms to minimize.
[2021-05-11 19:43:14] [INFO ] Deduced a trap composed of 45 places in 161 ms of which 1 ms to minimize.
[2021-05-11 19:43:14] [INFO ] Deduced a trap composed of 108 places in 150 ms of which 1 ms to minimize.
[2021-05-11 19:43:14] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 1 ms to minimize.
[2021-05-11 19:43:15] [INFO ] Deduced a trap composed of 32 places in 124 ms of which 0 ms to minimize.
[2021-05-11 19:43:15] [INFO ] Deduced a trap composed of 129 places in 116 ms of which 1 ms to minimize.
[2021-05-11 19:43:15] [INFO ] Deduced a trap composed of 26 places in 151 ms of which 0 ms to minimize.
[2021-05-11 19:43:15] [INFO ] Deduced a trap composed of 27 places in 208 ms of which 0 ms to minimize.
[2021-05-11 19:43:15] [INFO ] Deduced a trap composed of 128 places in 139 ms of which 0 ms to minimize.
[2021-05-11 19:43:16] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 1 ms to minimize.
[2021-05-11 19:43:16] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 1 ms to minimize.
[2021-05-11 19:43:16] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 1 ms to minimize.
[2021-05-11 19:43:16] [INFO ] Deduced a trap composed of 108 places in 115 ms of which 1 ms to minimize.
[2021-05-11 19:43:16] [INFO ] Deduced a trap composed of 54 places in 103 ms of which 1 ms to minimize.
[2021-05-11 19:43:16] [INFO ] Deduced a trap composed of 110 places in 105 ms of which 0 ms to minimize.
[2021-05-11 19:43:16] [INFO ] Deduced a trap composed of 113 places in 139 ms of which 5 ms to minimize.
[2021-05-11 19:43:16] [INFO ] Deduced a trap composed of 102 places in 108 ms of which 1 ms to minimize.
[2021-05-11 19:43:17] [INFO ] Deduced a trap composed of 110 places in 135 ms of which 1 ms to minimize.
[2021-05-11 19:43:17] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 0 ms to minimize.
[2021-05-11 19:43:17] [INFO ] Deduced a trap composed of 125 places in 106 ms of which 0 ms to minimize.
[2021-05-11 19:43:17] [INFO ] Deduced a trap composed of 120 places in 229 ms of which 2 ms to minimize.
[2021-05-11 19:43:17] [INFO ] Deduced a trap composed of 47 places in 176 ms of which 1 ms to minimize.
[2021-05-11 19:43:18] [INFO ] Deduced a trap composed of 30 places in 157 ms of which 0 ms to minimize.
[2021-05-11 19:43:18] [INFO ] Deduced a trap composed of 25 places in 175 ms of which 0 ms to minimize.
[2021-05-11 19:43:18] [INFO ] Deduced a trap composed of 134 places in 119 ms of which 0 ms to minimize.
[2021-05-11 19:43:18] [INFO ] Deduced a trap composed of 40 places in 225 ms of which 3 ms to minimize.
[2021-05-11 19:43:18] [INFO ] Deduced a trap composed of 125 places in 138 ms of which 3 ms to minimize.
[2021-05-11 19:43:19] [INFO ] Deduced a trap composed of 49 places in 126 ms of which 4 ms to minimize.
[2021-05-11 19:43:19] [INFO ] Deduced a trap composed of 131 places in 120 ms of which 1 ms to minimize.
[2021-05-11 19:43:19] [INFO ] Deduced a trap composed of 120 places in 121 ms of which 0 ms to minimize.
[2021-05-11 19:43:19] [INFO ] Deduced a trap composed of 135 places in 134 ms of which 1 ms to minimize.
[2021-05-11 19:43:19] [INFO ] Deduced a trap composed of 135 places in 121 ms of which 0 ms to minimize.
[2021-05-11 19:43:19] [INFO ] Trap strengthening (SAT) tested/added 48/47 trap constraints in 8211 ms
[2021-05-11 19:43:19] [INFO ] Computed and/alt/rep : 456/757/456 causal constraints (skipped 33 transitions) in 27 ms.
[2021-05-11 19:43:22] [INFO ] Deduced a trap composed of 124 places in 161 ms of which 1 ms to minimize.
[2021-05-11 19:43:22] [INFO ] Deduced a trap composed of 118 places in 159 ms of which 0 ms to minimize.
[2021-05-11 19:43:22] [INFO ] Deduced a trap composed of 132 places in 135 ms of which 1 ms to minimize.
[2021-05-11 19:43:22] [INFO ] Deduced a trap composed of 120 places in 142 ms of which 0 ms to minimize.
[2021-05-11 19:43:22] [INFO ] Deduced a trap composed of 114 places in 119 ms of which 1 ms to minimize.
[2021-05-11 19:43:23] [INFO ] Deduced a trap composed of 130 places in 156 ms of which 1 ms to minimize.
[2021-05-11 19:43:23] [INFO ] Deduced a trap composed of 117 places in 144 ms of which 0 ms to minimize.
[2021-05-11 19:43:23] [INFO ] Deduced a trap composed of 114 places in 174 ms of which 11 ms to minimize.
[2021-05-11 19:43:23] [INFO ] Deduced a trap composed of 120 places in 135 ms of which 1 ms to minimize.
[2021-05-11 19:43:23] [INFO ] Deduced a trap composed of 118 places in 121 ms of which 0 ms to minimize.
[2021-05-11 19:43:24] [INFO ] Deduced a trap composed of 131 places in 141 ms of which 0 ms to minimize.
[2021-05-11 19:43:24] [INFO ] Deduced a trap composed of 117 places in 131 ms of which 1 ms to minimize.
[2021-05-11 19:43:24] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2659 ms
[2021-05-11 19:43:24] [INFO ] Added : 313 causal constraints over 64 iterations in 5002 ms. Result :sat
[2021-05-11 19:43:24] [INFO ] [Real]Absence check using 58 positive place invariants in 28 ms returned sat
[2021-05-11 19:43:24] [INFO ] [Real]Absence check using 58 positive and 37 generalized place invariants in 10 ms returned sat
[2021-05-11 19:43:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 19:43:25] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2021-05-11 19:43:25] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 0 ms to minimize.
[2021-05-11 19:43:25] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 0 ms to minimize.
[2021-05-11 19:43:25] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 0 ms to minimize.
[2021-05-11 19:43:25] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 0 ms to minimize.
[2021-05-11 19:43:25] [INFO ] Deduced a trap composed of 118 places in 96 ms of which 0 ms to minimize.
[2021-05-11 19:43:25] [INFO ] Deduced a trap composed of 116 places in 92 ms of which 1 ms to minimize.
[2021-05-11 19:43:25] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 0 ms to minimize.
[2021-05-11 19:43:26] [INFO ] Deduced a trap composed of 114 places in 91 ms of which 0 ms to minimize.
[2021-05-11 19:43:26] [INFO ] Deduced a trap composed of 119 places in 156 ms of which 1 ms to minimize.
[2021-05-11 19:43:26] [INFO ] Deduced a trap composed of 120 places in 110 ms of which 0 ms to minimize.
[2021-05-11 19:43:26] [INFO ] Deduced a trap composed of 38 places in 117 ms of which 0 ms to minimize.
[2021-05-11 19:43:26] [INFO ] Deduced a trap composed of 33 places in 120 ms of which 1 ms to minimize.
[2021-05-11 19:43:26] [INFO ] Deduced a trap composed of 53 places in 121 ms of which 0 ms to minimize.
[2021-05-11 19:43:26] [INFO ] Deduced a trap composed of 118 places in 101 ms of which 1 ms to minimize.
[2021-05-11 19:43:27] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 0 ms to minimize.
[2021-05-11 19:43:27] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 1 ms to minimize.
[2021-05-11 19:43:27] [INFO ] Deduced a trap composed of 38 places in 107 ms of which 1 ms to minimize.
[2021-05-11 19:43:27] [INFO ] Deduced a trap composed of 42 places in 91 ms of which 1 ms to minimize.
[2021-05-11 19:43:27] [INFO ] Deduced a trap composed of 114 places in 117 ms of which 0 ms to minimize.
[2021-05-11 19:43:27] [INFO ] Deduced a trap composed of 104 places in 121 ms of which 1 ms to minimize.
[2021-05-11 19:43:27] [INFO ] Deduced a trap composed of 111 places in 114 ms of which 0 ms to minimize.
[2021-05-11 19:43:27] [INFO ] Deduced a trap composed of 50 places in 106 ms of which 0 ms to minimize.
[2021-05-11 19:43:28] [INFO ] Deduced a trap composed of 112 places in 87 ms of which 0 ms to minimize.
[2021-05-11 19:43:28] [INFO ] Deduced a trap composed of 115 places in 86 ms of which 0 ms to minimize.
[2021-05-11 19:43:28] [INFO ] Deduced a trap composed of 114 places in 107 ms of which 0 ms to minimize.
[2021-05-11 19:43:28] [INFO ] Deduced a trap composed of 116 places in 112 ms of which 1 ms to minimize.
[2021-05-11 19:43:28] [INFO ] Deduced a trap composed of 50 places in 92 ms of which 1 ms to minimize.
[2021-05-11 19:43:28] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 0 ms to minimize.
[2021-05-11 19:43:28] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 0 ms to minimize.
[2021-05-11 19:43:28] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 0 ms to minimize.
[2021-05-11 19:43:28] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 1 ms to minimize.
[2021-05-11 19:43:29] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 0 ms to minimize.
[2021-05-11 19:43:29] [INFO ] Deduced a trap composed of 101 places in 83 ms of which 0 ms to minimize.
[2021-05-11 19:43:29] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 0 ms to minimize.
[2021-05-11 19:43:29] [INFO ] Deduced a trap composed of 53 places in 100 ms of which 0 ms to minimize.
[2021-05-11 19:43:29] [INFO ] Deduced a trap composed of 111 places in 87 ms of which 0 ms to minimize.
[2021-05-11 19:43:29] [INFO ] Deduced a trap composed of 53 places in 96 ms of which 1 ms to minimize.
[2021-05-11 19:43:29] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 0 ms to minimize.
[2021-05-11 19:43:29] [INFO ] Deduced a trap composed of 120 places in 98 ms of which 1 ms to minimize.
[2021-05-11 19:43:29] [INFO ] Deduced a trap composed of 116 places in 83 ms of which 0 ms to minimize.
[2021-05-11 19:43:30] [INFO ] Deduced a trap composed of 114 places in 85 ms of which 0 ms to minimize.
[2021-05-11 19:43:30] [INFO ] Deduced a trap composed of 119 places in 86 ms of which 0 ms to minimize.
[2021-05-11 19:43:30] [INFO ] Deduced a trap composed of 58 places in 84 ms of which 0 ms to minimize.
[2021-05-11 19:43:30] [INFO ] Deduced a trap composed of 52 places in 86 ms of which 0 ms to minimize.
[2021-05-11 19:43:30] [INFO ] Deduced a trap composed of 43 places in 84 ms of which 0 ms to minimize.
[2021-05-11 19:43:30] [INFO ] Deduced a trap composed of 55 places in 84 ms of which 0 ms to minimize.
[2021-05-11 19:43:30] [INFO ] Deduced a trap composed of 54 places in 85 ms of which 1 ms to minimize.
[2021-05-11 19:43:30] [INFO ] Deduced a trap composed of 115 places in 86 ms of which 0 ms to minimize.
[2021-05-11 19:43:30] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 0 ms to minimize.
[2021-05-11 19:43:30] [INFO ] Deduced a trap composed of 47 places in 81 ms of which 0 ms to minimize.
[2021-05-11 19:43:31] [INFO ] Deduced a trap composed of 51 places in 80 ms of which 0 ms to minimize.
[2021-05-11 19:43:31] [INFO ] Deduced a trap composed of 125 places in 88 ms of which 0 ms to minimize.
[2021-05-11 19:43:31] [INFO ] Deduced a trap composed of 128 places in 140 ms of which 1 ms to minimize.
[2021-05-11 19:43:31] [INFO ] Deduced a trap composed of 125 places in 89 ms of which 0 ms to minimize.
[2021-05-11 19:43:31] [INFO ] Deduced a trap composed of 121 places in 107 ms of which 1 ms to minimize.
[2021-05-11 19:43:31] [INFO ] Deduced a trap composed of 113 places in 90 ms of which 0 ms to minimize.
[2021-05-11 19:43:31] [INFO ] Deduced a trap composed of 126 places in 86 ms of which 0 ms to minimize.
[2021-05-11 19:43:31] [INFO ] Deduced a trap composed of 127 places in 90 ms of which 0 ms to minimize.
[2021-05-11 19:43:31] [INFO ] Deduced a trap composed of 123 places in 73 ms of which 1 ms to minimize.
[2021-05-11 19:43:32] [INFO ] Deduced a trap composed of 130 places in 85 ms of which 0 ms to minimize.
[2021-05-11 19:43:32] [INFO ] Deduced a trap composed of 120 places in 123 ms of which 1 ms to minimize.
[2021-05-11 19:43:32] [INFO ] Deduced a trap composed of 123 places in 97 ms of which 1 ms to minimize.
[2021-05-11 19:43:32] [INFO ] Deduced a trap composed of 117 places in 147 ms of which 1 ms to minimize.
[2021-05-11 19:43:32] [INFO ] Trap strengthening (SAT) tested/added 64/63 trap constraints in 7458 ms
[2021-05-11 19:43:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 19:43:32] [INFO ] [Nat]Absence check using 58 positive place invariants in 21 ms returned sat
[2021-05-11 19:43:32] [INFO ] [Nat]Absence check using 58 positive and 37 generalized place invariants in 8 ms returned sat
[2021-05-11 19:43:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 19:43:32] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2021-05-11 19:43:32] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2021-05-11 19:43:32] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 0 ms to minimize.
[2021-05-11 19:43:33] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2021-05-11 19:43:33] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2021-05-11 19:43:33] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 0 ms to minimize.
[2021-05-11 19:43:33] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 0 ms to minimize.
[2021-05-11 19:43:33] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 1 ms to minimize.
[2021-05-11 19:43:33] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 0 ms to minimize.
[2021-05-11 19:43:33] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 1 ms to minimize.
[2021-05-11 19:43:33] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 0 ms to minimize.
[2021-05-11 19:43:33] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 0 ms to minimize.
[2021-05-11 19:43:33] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 0 ms to minimize.
[2021-05-11 19:43:33] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 0 ms to minimize.
[2021-05-11 19:43:33] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 1 ms to minimize.
[2021-05-11 19:43:34] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 0 ms to minimize.
[2021-05-11 19:43:34] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 1 ms to minimize.
[2021-05-11 19:43:34] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2021-05-11 19:43:34] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 0 ms to minimize.
[2021-05-11 19:43:34] [INFO ] Deduced a trap composed of 51 places in 61 ms of which 0 ms to minimize.
[2021-05-11 19:43:34] [INFO ] Deduced a trap composed of 53 places in 80 ms of which 0 ms to minimize.
[2021-05-11 19:43:34] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 1651 ms
[2021-05-11 19:43:34] [INFO ] Computed and/alt/rep : 456/757/456 causal constraints (skipped 33 transitions) in 20 ms.
[2021-05-11 19:43:35] [INFO ] Added : 231 causal constraints over 47 iterations in 967 ms. Result :sat
[2021-05-11 19:43:35] [INFO ] [Real]Absence check using 58 positive place invariants in 24 ms returned sat
[2021-05-11 19:43:35] [INFO ] [Real]Absence check using 58 positive and 37 generalized place invariants in 3 ms returned unsat
[2021-05-11 19:43:35] [INFO ] [Real]Absence check using 58 positive place invariants in 25 ms returned sat
[2021-05-11 19:43:35] [INFO ] [Real]Absence check using 58 positive and 37 generalized place invariants in 10 ms returned sat
[2021-05-11 19:43:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 19:43:35] [INFO ] [Real]Absence check using state equation in 220 ms returned sat
[2021-05-11 19:43:35] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 0 ms to minimize.
[2021-05-11 19:43:36] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 0 ms to minimize.
[2021-05-11 19:43:36] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 0 ms to minimize.
[2021-05-11 19:43:36] [INFO ] Deduced a trap composed of 26 places in 139 ms of which 0 ms to minimize.
[2021-05-11 19:43:36] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 1 ms to minimize.
[2021-05-11 19:43:36] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 0 ms to minimize.
[2021-05-11 19:43:36] [INFO ] Deduced a trap composed of 114 places in 91 ms of which 0 ms to minimize.
[2021-05-11 19:43:36] [INFO ] Deduced a trap composed of 45 places in 89 ms of which 0 ms to minimize.
[2021-05-11 19:43:36] [INFO ] Deduced a trap composed of 38 places in 136 ms of which 0 ms to minimize.
[2021-05-11 19:43:37] [INFO ] Deduced a trap composed of 102 places in 95 ms of which 1 ms to minimize.
[2021-05-11 19:43:37] [INFO ] Deduced a trap composed of 112 places in 110 ms of which 0 ms to minimize.
[2021-05-11 19:43:37] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 0 ms to minimize.
[2021-05-11 19:43:37] [INFO ] Deduced a trap composed of 18 places in 126 ms of which 0 ms to minimize.
[2021-05-11 19:43:37] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 0 ms to minimize.
[2021-05-11 19:43:37] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 1 ms to minimize.
[2021-05-11 19:43:37] [INFO ] Deduced a trap composed of 116 places in 99 ms of which 0 ms to minimize.
[2021-05-11 19:43:37] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 1 ms to minimize.
[2021-05-11 19:43:37] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 0 ms to minimize.
[2021-05-11 19:43:38] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 0 ms to minimize.
[2021-05-11 19:43:38] [INFO ] Deduced a trap composed of 101 places in 112 ms of which 1 ms to minimize.
[2021-05-11 19:43:38] [INFO ] Deduced a trap composed of 120 places in 90 ms of which 1 ms to minimize.
[2021-05-11 19:43:38] [INFO ] Deduced a trap composed of 113 places in 94 ms of which 1 ms to minimize.
[2021-05-11 19:43:38] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 0 ms to minimize.
[2021-05-11 19:43:38] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 0 ms to minimize.
[2021-05-11 19:43:38] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 0 ms to minimize.
[2021-05-11 19:43:38] [INFO ] Deduced a trap composed of 51 places in 89 ms of which 0 ms to minimize.
[2021-05-11 19:43:38] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 0 ms to minimize.
[2021-05-11 19:43:38] [INFO ] Deduced a trap composed of 118 places in 85 ms of which 1 ms to minimize.
[2021-05-11 19:43:39] [INFO ] Deduced a trap composed of 53 places in 86 ms of which 0 ms to minimize.
[2021-05-11 19:43:39] [INFO ] Deduced a trap composed of 59 places in 82 ms of which 0 ms to minimize.
[2021-05-11 19:43:39] [INFO ] Deduced a trap composed of 112 places in 84 ms of which 0 ms to minimize.
[2021-05-11 19:43:39] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 1 ms to minimize.
[2021-05-11 19:43:39] [INFO ] Deduced a trap composed of 101 places in 81 ms of which 1 ms to minimize.
[2021-05-11 19:43:39] [INFO ] Deduced a trap composed of 118 places in 81 ms of which 0 ms to minimize.
[2021-05-11 19:43:39] [INFO ] Deduced a trap composed of 116 places in 82 ms of which 1 ms to minimize.
[2021-05-11 19:43:39] [INFO ] Deduced a trap composed of 55 places in 105 ms of which 1 ms to minimize.
[2021-05-11 19:43:39] [INFO ] Deduced a trap composed of 48 places in 97 ms of which 1 ms to minimize.
[2021-05-11 19:43:40] [INFO ] Deduced a trap composed of 124 places in 108 ms of which 1 ms to minimize.
[2021-05-11 19:43:40] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 4184 ms
[2021-05-11 19:43:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 19:43:40] [INFO ] [Nat]Absence check using 58 positive place invariants in 20 ms returned sat
[2021-05-11 19:43:40] [INFO ] [Nat]Absence check using 58 positive and 37 generalized place invariants in 9 ms returned sat
[2021-05-11 19:43:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 19:43:40] [INFO ] [Nat]Absence check using state equation in 192 ms returned sat
[2021-05-11 19:43:40] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 0 ms to minimize.
[2021-05-11 19:43:40] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 1 ms to minimize.
[2021-05-11 19:43:40] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 0 ms to minimize.
[2021-05-11 19:43:40] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 0 ms to minimize.
[2021-05-11 19:43:40] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 1 ms to minimize.
[2021-05-11 19:43:41] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 1 ms to minimize.
[2021-05-11 19:43:41] [INFO ] Deduced a trap composed of 114 places in 80 ms of which 0 ms to minimize.
[2021-05-11 19:43:41] [INFO ] Deduced a trap composed of 45 places in 81 ms of which 0 ms to minimize.
[2021-05-11 19:43:41] [INFO ] Deduced a trap composed of 38 places in 102 ms of which 0 ms to minimize.
[2021-05-11 19:43:41] [INFO ] Deduced a trap composed of 102 places in 95 ms of which 0 ms to minimize.
[2021-05-11 19:43:41] [INFO ] Deduced a trap composed of 112 places in 80 ms of which 1 ms to minimize.
[2021-05-11 19:43:41] [INFO ] Deduced a trap composed of 38 places in 130 ms of which 0 ms to minimize.
[2021-05-11 19:43:41] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 1 ms to minimize.
[2021-05-11 19:43:42] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 0 ms to minimize.
[2021-05-11 19:43:42] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 0 ms to minimize.
[2021-05-11 19:43:42] [INFO ] Deduced a trap composed of 116 places in 87 ms of which 1 ms to minimize.
[2021-05-11 19:43:42] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
[2021-05-11 19:43:42] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 1 ms to minimize.
[2021-05-11 19:43:42] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 0 ms to minimize.
[2021-05-11 19:43:42] [INFO ] Deduced a trap composed of 101 places in 86 ms of which 1 ms to minimize.
[2021-05-11 19:43:42] [INFO ] Deduced a trap composed of 120 places in 83 ms of which 0 ms to minimize.
[2021-05-11 19:43:42] [INFO ] Deduced a trap composed of 113 places in 115 ms of which 1 ms to minimize.
[2021-05-11 19:43:43] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 0 ms to minimize.
[2021-05-11 19:43:43] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 0 ms to minimize.
[2021-05-11 19:43:43] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 1 ms to minimize.
[2021-05-11 19:43:43] [INFO ] Deduced a trap composed of 51 places in 110 ms of which 2 ms to minimize.
[2021-05-11 19:43:43] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 0 ms to minimize.
[2021-05-11 19:43:43] [INFO ] Deduced a trap composed of 118 places in 94 ms of which 0 ms to minimize.
[2021-05-11 19:43:43] [INFO ] Deduced a trap composed of 53 places in 106 ms of which 0 ms to minimize.
[2021-05-11 19:43:43] [INFO ] Deduced a trap composed of 59 places in 122 ms of which 0 ms to minimize.
[2021-05-11 19:43:44] [INFO ] Deduced a trap composed of 112 places in 114 ms of which 1 ms to minimize.
[2021-05-11 19:43:44] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 1 ms to minimize.
[2021-05-11 19:43:44] [INFO ] Deduced a trap composed of 101 places in 131 ms of which 1 ms to minimize.
[2021-05-11 19:43:44] [INFO ] Deduced a trap composed of 118 places in 119 ms of which 0 ms to minimize.
[2021-05-11 19:43:44] [INFO ] Deduced a trap composed of 116 places in 107 ms of which 0 ms to minimize.
[2021-05-11 19:43:44] [INFO ] Deduced a trap composed of 55 places in 114 ms of which 12 ms to minimize.
[2021-05-11 19:43:44] [INFO ] Deduced a trap composed of 48 places in 66 ms of which 0 ms to minimize.
[2021-05-11 19:43:45] [INFO ] Deduced a trap composed of 131 places in 114 ms of which 1 ms to minimize.
[2021-05-11 19:43:45] [INFO ] Deduced a trap composed of 118 places in 133 ms of which 1 ms to minimize.
[2021-05-11 19:43:45] [INFO ] Deduced a trap composed of 128 places in 97 ms of which 0 ms to minimize.
[2021-05-11 19:43:45] [INFO ] Deduced a trap composed of 119 places in 110 ms of which 0 ms to minimize.
[2021-05-11 19:43:45] [INFO ] Deduced a trap composed of 112 places in 109 ms of which 2 ms to minimize.
[2021-05-11 19:43:45] [INFO ] Deduced a trap composed of 106 places in 144 ms of which 2 ms to minimize.
[2021-05-11 19:43:45] [INFO ] Deduced a trap composed of 101 places in 119 ms of which 0 ms to minimize.
[2021-05-11 19:43:45] [INFO ] Deduced a trap composed of 99 places in 96 ms of which 1 ms to minimize.
[2021-05-11 19:43:46] [INFO ] Deduced a trap composed of 126 places in 91 ms of which 0 ms to minimize.
[2021-05-11 19:43:46] [INFO ] Deduced a trap composed of 121 places in 77 ms of which 0 ms to minimize.
[2021-05-11 19:43:46] [INFO ] Deduced a trap composed of 127 places in 107 ms of which 0 ms to minimize.
[2021-05-11 19:43:46] [INFO ] Deduced a trap composed of 125 places in 144 ms of which 1 ms to minimize.
[2021-05-11 19:43:46] [INFO ] Trap strengthening (SAT) tested/added 50/49 trap constraints in 6202 ms
[2021-05-11 19:43:46] [INFO ] Computed and/alt/rep : 456/757/456 causal constraints (skipped 33 transitions) in 29 ms.
[2021-05-11 19:43:48] [INFO ] Deduced a trap composed of 132 places in 137 ms of which 4 ms to minimize.
[2021-05-11 19:43:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 206 ms
[2021-05-11 19:43:48] [INFO ] Added : 319 causal constraints over 64 iterations in 1924 ms. Result :sat
[2021-05-11 19:43:48] [INFO ] [Real]Absence check using 58 positive place invariants in 13 ms returned unsat
[2021-05-11 19:43:48] [INFO ] [Real]Absence check using 58 positive place invariants in 23 ms returned sat
[2021-05-11 19:43:48] [INFO ] [Real]Absence check using 58 positive and 37 generalized place invariants in 10 ms returned sat
[2021-05-11 19:43:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 19:43:48] [INFO ] [Real]Absence check using state equation in 154 ms returned unsat
[2021-05-11 19:43:48] [INFO ] [Real]Absence check using 58 positive place invariants in 19 ms returned sat
[2021-05-11 19:43:48] [INFO ] [Real]Absence check using 58 positive and 37 generalized place invariants in 8 ms returned sat
[2021-05-11 19:43:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 19:43:49] [INFO ] [Real]Absence check using state equation in 165 ms returned unsat
[2021-05-11 19:43:49] [INFO ] [Real]Absence check using 58 positive place invariants in 20 ms returned sat
[2021-05-11 19:43:49] [INFO ] [Real]Absence check using 58 positive and 37 generalized place invariants in 9 ms returned sat
[2021-05-11 19:43:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 19:43:49] [INFO ] [Real]Absence check using state equation in 216 ms returned sat
[2021-05-11 19:43:49] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 1 ms to minimize.
[2021-05-11 19:43:49] [INFO ] Deduced a trap composed of 118 places in 136 ms of which 1 ms to minimize.
[2021-05-11 19:43:49] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 0 ms to minimize.
[2021-05-11 19:43:49] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 0 ms to minimize.
[2021-05-11 19:43:50] [INFO ] Deduced a trap composed of 48 places in 85 ms of which 1 ms to minimize.
[2021-05-11 19:43:50] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 1 ms to minimize.
[2021-05-11 19:43:50] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 1 ms to minimize.
[2021-05-11 19:43:50] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 1 ms to minimize.
[2021-05-11 19:43:50] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 0 ms to minimize.
[2021-05-11 19:43:50] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 0 ms to minimize.
[2021-05-11 19:43:50] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 0 ms to minimize.
[2021-05-11 19:43:50] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 0 ms to minimize.
[2021-05-11 19:43:50] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 1 ms to minimize.
[2021-05-11 19:43:50] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 0 ms to minimize.
[2021-05-11 19:43:51] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 1 ms to minimize.
[2021-05-11 19:43:51] [INFO ] Deduced a trap composed of 113 places in 102 ms of which 0 ms to minimize.
[2021-05-11 19:43:51] [INFO ] Deduced a trap composed of 122 places in 84 ms of which 1 ms to minimize.
[2021-05-11 19:43:51] [INFO ] Deduced a trap composed of 100 places in 99 ms of which 1 ms to minimize.
[2021-05-11 19:43:51] [INFO ] Deduced a trap composed of 105 places in 101 ms of which 0 ms to minimize.
[2021-05-11 19:43:51] [INFO ] Deduced a trap composed of 102 places in 96 ms of which 1 ms to minimize.
[2021-05-11 19:43:51] [INFO ] Deduced a trap composed of 104 places in 84 ms of which 0 ms to minimize.
[2021-05-11 19:43:51] [INFO ] Deduced a trap composed of 50 places in 101 ms of which 1 ms to minimize.
[2021-05-11 19:43:51] [INFO ] Deduced a trap composed of 58 places in 84 ms of which 1 ms to minimize.
[2021-05-11 19:43:52] [INFO ] Deduced a trap composed of 118 places in 97 ms of which 0 ms to minimize.
[2021-05-11 19:43:52] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 1 ms to minimize.
[2021-05-11 19:43:52] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 0 ms to minimize.
[2021-05-11 19:43:52] [INFO ] Deduced a trap composed of 119 places in 96 ms of which 0 ms to minimize.
[2021-05-11 19:43:52] [INFO ] Deduced a trap composed of 52 places in 81 ms of which 0 ms to minimize.
[2021-05-11 19:43:52] [INFO ] Deduced a trap composed of 52 places in 84 ms of which 0 ms to minimize.
[2021-05-11 19:43:52] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 0 ms to minimize.
[2021-05-11 19:43:52] [INFO ] Deduced a trap composed of 113 places in 80 ms of which 0 ms to minimize.
[2021-05-11 19:43:52] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 0 ms to minimize.
[2021-05-11 19:43:53] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 0 ms to minimize.
[2021-05-11 19:43:53] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 0 ms to minimize.
[2021-05-11 19:43:53] [INFO ] Deduced a trap composed of 55 places in 92 ms of which 0 ms to minimize.
[2021-05-11 19:43:53] [INFO ] Deduced a trap composed of 116 places in 137 ms of which 0 ms to minimize.
[2021-05-11 19:43:53] [INFO ] Deduced a trap composed of 121 places in 115 ms of which 0 ms to minimize.
[2021-05-11 19:43:53] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 0 ms to minimize.
[2021-05-11 19:43:53] [INFO ] Deduced a trap composed of 122 places in 115 ms of which 0 ms to minimize.
[2021-05-11 19:43:53] [INFO ] Deduced a trap composed of 110 places in 93 ms of which 0 ms to minimize.
[2021-05-11 19:43:54] [INFO ] Deduced a trap composed of 51 places in 92 ms of which 1 ms to minimize.
[2021-05-11 19:43:54] [INFO ] Deduced a trap composed of 53 places in 146 ms of which 0 ms to minimize.
[2021-05-11 19:43:54] [INFO ] Deduced a trap composed of 49 places in 95 ms of which 0 ms to minimize.
[2021-05-11 19:43:54] [INFO ] Deduced a trap composed of 60 places in 96 ms of which 1 ms to minimize.
[2021-05-11 19:43:54] [INFO ] Deduced a trap composed of 110 places in 95 ms of which 0 ms to minimize.
[2021-05-11 19:43:54] [INFO ] Deduced a trap composed of 35 places in 148 ms of which 2 ms to minimize.
[2021-05-11 19:43:54] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 1 ms to minimize.
[2021-05-11 19:43:54] [INFO ] Deduced a trap composed of 113 places in 94 ms of which 0 ms to minimize.
[2021-05-11 19:43:55] [INFO ] Deduced a trap composed of 104 places in 101 ms of which 1 ms to minimize.
[2021-05-11 19:43:55] [INFO ] Deduced a trap composed of 61 places in 95 ms of which 0 ms to minimize.
[2021-05-11 19:43:55] [INFO ] Deduced a trap composed of 42 places in 94 ms of which 1 ms to minimize.
[2021-05-11 19:43:55] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 0 ms to minimize.
[2021-05-11 19:43:55] [INFO ] Deduced a trap composed of 113 places in 111 ms of which 0 ms to minimize.
[2021-05-11 19:43:55] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 1 ms to minimize.
[2021-05-11 19:43:55] [INFO ] Deduced a trap composed of 46 places in 116 ms of which 1 ms to minimize.
[2021-05-11 19:43:55] [INFO ] Deduced a trap composed of 40 places in 107 ms of which 1 ms to minimize.
[2021-05-11 19:43:56] [INFO ] Deduced a trap composed of 66 places in 89 ms of which 0 ms to minimize.
[2021-05-11 19:43:56] [INFO ] Deduced a trap composed of 102 places in 128 ms of which 1 ms to minimize.
[2021-05-11 19:43:56] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 0 ms to minimize.
[2021-05-11 19:43:56] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 1 ms to minimize.
[2021-05-11 19:43:56] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 1 ms to minimize.
[2021-05-11 19:43:56] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 0 ms to minimize.
[2021-05-11 19:43:56] [INFO ] Deduced a trap composed of 66 places in 63 ms of which 0 ms to minimize.
[2021-05-11 19:43:56] [INFO ] Deduced a trap composed of 64 places in 85 ms of which 1 ms to minimize.
[2021-05-11 19:43:56] [INFO ] Deduced a trap composed of 75 places in 74 ms of which 0 ms to minimize.
[2021-05-11 19:43:56] [INFO ] Deduced a trap composed of 80 places in 73 ms of which 1 ms to minimize.
[2021-05-11 19:43:57] [INFO ] Deduced a trap composed of 87 places in 85 ms of which 1 ms to minimize.
[2021-05-11 19:43:57] [INFO ] Deduced a trap composed of 58 places in 71 ms of which 1 ms to minimize.
[2021-05-11 19:43:57] [INFO ] Deduced a trap composed of 47 places in 70 ms of which 0 ms to minimize.
[2021-05-11 19:43:57] [INFO ] Deduced a trap composed of 51 places in 85 ms of which 0 ms to minimize.
[2021-05-11 19:43:57] [INFO ] Deduced a trap composed of 74 places in 82 ms of which 0 ms to minimize.
[2021-05-11 19:43:57] [INFO ] Trap strengthening (SAT) tested/added 72/71 trap constraints in 8034 ms
[2021-05-11 19:43:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 19:43:57] [INFO ] [Nat]Absence check using 58 positive place invariants in 20 ms returned sat
[2021-05-11 19:43:57] [INFO ] [Nat]Absence check using 58 positive and 37 generalized place invariants in 8 ms returned sat
[2021-05-11 19:43:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 19:43:57] [INFO ] [Nat]Absence check using state equation in 208 ms returned sat
[2021-05-11 19:43:57] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 1 ms to minimize.
[2021-05-11 19:43:58] [INFO ] Deduced a trap composed of 118 places in 106 ms of which 1 ms to minimize.
[2021-05-11 19:43:58] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 1 ms to minimize.
[2021-05-11 19:43:58] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 0 ms to minimize.
[2021-05-11 19:43:58] [INFO ] Deduced a trap composed of 48 places in 77 ms of which 0 ms to minimize.
[2021-05-11 19:43:58] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 1 ms to minimize.
[2021-05-11 19:43:58] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 0 ms to minimize.
[2021-05-11 19:43:58] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 0 ms to minimize.
[2021-05-11 19:43:58] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 1 ms to minimize.
[2021-05-11 19:43:58] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 1 ms to minimize.
[2021-05-11 19:43:58] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 0 ms to minimize.
[2021-05-11 19:43:58] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 1 ms to minimize.
[2021-05-11 19:43:59] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 0 ms to minimize.
[2021-05-11 19:43:59] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 0 ms to minimize.
[2021-05-11 19:43:59] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 1 ms to minimize.
[2021-05-11 19:43:59] [INFO ] Deduced a trap composed of 113 places in 98 ms of which 0 ms to minimize.
[2021-05-11 19:43:59] [INFO ] Deduced a trap composed of 122 places in 96 ms of which 0 ms to minimize.
[2021-05-11 19:43:59] [INFO ] Deduced a trap composed of 100 places in 101 ms of which 1 ms to minimize.
[2021-05-11 19:43:59] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 0 ms to minimize.
[2021-05-11 19:43:59] [INFO ] Deduced a trap composed of 44 places in 117 ms of which 0 ms to minimize.
[2021-05-11 19:43:59] [INFO ] Deduced a trap composed of 99 places in 118 ms of which 1 ms to minimize.
[2021-05-11 19:44:00] [INFO ] Deduced a trap composed of 52 places in 107 ms of which 0 ms to minimize.
[2021-05-11 19:44:00] [INFO ] Deduced a trap composed of 106 places in 142 ms of which 1 ms to minimize.
[2021-05-11 19:44:00] [INFO ] Deduced a trap composed of 98 places in 99 ms of which 1 ms to minimize.
[2021-05-11 19:44:00] [INFO ] Deduced a trap composed of 107 places in 96 ms of which 1 ms to minimize.
[2021-05-11 19:44:00] [INFO ] Deduced a trap composed of 102 places in 94 ms of which 0 ms to minimize.
[2021-05-11 19:44:00] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 0 ms to minimize.
[2021-05-11 19:44:00] [INFO ] Deduced a trap composed of 134 places in 111 ms of which 1 ms to minimize.
[2021-05-11 19:44:00] [INFO ] Deduced a trap composed of 101 places in 107 ms of which 1 ms to minimize.
[2021-05-11 19:44:01] [INFO ] Deduced a trap composed of 98 places in 109 ms of which 1 ms to minimize.
[2021-05-11 19:44:01] [INFO ] Deduced a trap composed of 53 places in 124 ms of which 1 ms to minimize.
[2021-05-11 19:44:01] [INFO ] Deduced a trap composed of 106 places in 111 ms of which 1 ms to minimize.
[2021-05-11 19:44:01] [INFO ] Deduced a trap composed of 108 places in 113 ms of which 1 ms to minimize.
[2021-05-11 19:44:01] [INFO ] Deduced a trap composed of 50 places in 112 ms of which 1 ms to minimize.
[2021-05-11 19:44:01] [INFO ] Deduced a trap composed of 101 places in 115 ms of which 1 ms to minimize.
[2021-05-11 19:44:01] [INFO ] Deduced a trap composed of 34 places in 135 ms of which 1 ms to minimize.
[2021-05-11 19:44:02] [INFO ] Deduced a trap composed of 43 places in 127 ms of which 1 ms to minimize.
[2021-05-11 19:44:02] [INFO ] Deduced a trap composed of 63 places in 121 ms of which 1 ms to minimize.
[2021-05-11 19:44:02] [INFO ] Deduced a trap composed of 115 places in 114 ms of which 1 ms to minimize.
[2021-05-11 19:44:02] [INFO ] Deduced a trap composed of 61 places in 106 ms of which 0 ms to minimize.
[2021-05-11 19:44:02] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 0 ms to minimize.
[2021-05-11 19:44:02] [INFO ] Deduced a trap composed of 69 places in 114 ms of which 0 ms to minimize.
[2021-05-11 19:44:02] [INFO ] Deduced a trap composed of 126 places in 143 ms of which 1 ms to minimize.
[2021-05-11 19:44:02] [INFO ] Deduced a trap composed of 126 places in 119 ms of which 0 ms to minimize.
[2021-05-11 19:44:03] [INFO ] Deduced a trap composed of 107 places in 132 ms of which 0 ms to minimize.
[2021-05-11 19:44:03] [INFO ] Deduced a trap composed of 125 places in 131 ms of which 0 ms to minimize.
[2021-05-11 19:44:03] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2021-05-11 19:44:03] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 0 ms to minimize.
[2021-05-11 19:44:03] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2021-05-11 19:44:03] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
[2021-05-11 19:44:03] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
[2021-05-11 19:44:03] [INFO ] Trap strengthening (SAT) tested/added 52/51 trap constraints in 5872 ms
[2021-05-11 19:44:03] [INFO ] Computed and/alt/rep : 456/757/456 causal constraints (skipped 33 transitions) in 43 ms.
[2021-05-11 19:44:05] [INFO ] Added : 312 causal constraints over 63 iterations in 2005 ms. Result :sat
[2021-05-11 19:44:05] [INFO ] [Real]Absence check using 58 positive place invariants in 15 ms returned sat
[2021-05-11 19:44:05] [INFO ] [Real]Absence check using 58 positive and 37 generalized place invariants in 7 ms returned sat
[2021-05-11 19:44:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 19:44:05] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2021-05-11 19:44:05] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2021-05-11 19:44:06] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2021-05-11 19:44:06] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2021-05-11 19:44:06] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 0 ms to minimize.
[2021-05-11 19:44:06] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 0 ms to minimize.
[2021-05-11 19:44:06] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 1 ms to minimize.
[2021-05-11 19:44:06] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 1 ms to minimize.
[2021-05-11 19:44:06] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 0 ms to minimize.
[2021-05-11 19:44:06] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 0 ms to minimize.
[2021-05-11 19:44:06] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2021-05-11 19:44:06] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2021-05-11 19:44:06] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
[2021-05-11 19:44:06] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 984 ms
[2021-05-11 19:44:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 19:44:07] [INFO ] [Nat]Absence check using 58 positive place invariants in 24 ms returned sat
[2021-05-11 19:44:07] [INFO ] [Nat]Absence check using 58 positive and 37 generalized place invariants in 11 ms returned sat
[2021-05-11 19:44:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 19:44:07] [INFO ] [Nat]Absence check using state equation in 302 ms returned sat
[2021-05-11 19:44:07] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 1 ms to minimize.
[2021-05-11 19:44:07] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2021-05-11 19:44:07] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 1 ms to minimize.
[2021-05-11 19:44:07] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 1 ms to minimize.
[2021-05-11 19:44:07] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 0 ms to minimize.
[2021-05-11 19:44:07] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 0 ms to minimize.
[2021-05-11 19:44:08] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 1 ms to minimize.
[2021-05-11 19:44:08] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 0 ms to minimize.
[2021-05-11 19:44:08] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 0 ms to minimize.
[2021-05-11 19:44:08] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 0 ms to minimize.
[2021-05-11 19:44:08] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 0 ms to minimize.
[2021-05-11 19:44:08] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 0 ms to minimize.
[2021-05-11 19:44:08] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 0 ms to minimize.
[2021-05-11 19:44:08] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2021-05-11 19:44:08] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2021-05-11 19:44:08] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2021-05-11 19:44:08] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1414 ms
[2021-05-11 19:44:08] [INFO ] Computed and/alt/rep : 456/757/456 causal constraints (skipped 33 transitions) in 29 ms.
[2021-05-11 19:44:10] [INFO ] Added : 230 causal constraints over 46 iterations in 1266 ms. Result :sat
[2021-05-11 19:44:10] [INFO ] [Real]Absence check using 58 positive place invariants in 23 ms returned sat
[2021-05-11 19:44:10] [INFO ] [Real]Absence check using 58 positive and 37 generalized place invariants in 10 ms returned sat
[2021-05-11 19:44:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 19:44:10] [INFO ] [Real]Absence check using state equation in 239 ms returned sat
[2021-05-11 19:44:10] [INFO ] Deduced a trap composed of 18 places in 141 ms of which 1 ms to minimize.
[2021-05-11 19:44:10] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 1 ms to minimize.
[2021-05-11 19:44:10] [INFO ] Deduced a trap composed of 39 places in 99 ms of which 1 ms to minimize.
[2021-05-11 19:44:10] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 1 ms to minimize.
[2021-05-11 19:44:11] [INFO ] Deduced a trap composed of 47 places in 98 ms of which 0 ms to minimize.
[2021-05-11 19:44:11] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 0 ms to minimize.
[2021-05-11 19:44:11] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 0 ms to minimize.
[2021-05-11 19:44:11] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 0 ms to minimize.
[2021-05-11 19:44:11] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 0 ms to minimize.
[2021-05-11 19:44:11] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2021-05-11 19:44:11] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 0 ms to minimize.
[2021-05-11 19:44:11] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 0 ms to minimize.
[2021-05-11 19:44:11] [INFO ] Deduced a trap composed of 52 places in 67 ms of which 1 ms to minimize.
[2021-05-11 19:44:11] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 1 ms to minimize.
[2021-05-11 19:44:11] [INFO ] Deduced a trap composed of 41 places in 102 ms of which 1 ms to minimize.
[2021-05-11 19:44:12] [INFO ] Deduced a trap composed of 47 places in 104 ms of which 1 ms to minimize.
[2021-05-11 19:44:12] [INFO ] Deduced a trap composed of 51 places in 114 ms of which 1 ms to minimize.
[2021-05-11 19:44:12] [INFO ] Deduced a trap composed of 105 places in 107 ms of which 0 ms to minimize.
[2021-05-11 19:44:12] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2021-05-11 19:44:12] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2021-05-11 19:44:12] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 0 ms to minimize.
[2021-05-11 19:44:12] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 1 ms to minimize.
[2021-05-11 19:44:12] [INFO ] Deduced a trap composed of 104 places in 97 ms of which 0 ms to minimize.
[2021-05-11 19:44:12] [INFO ] Deduced a trap composed of 109 places in 104 ms of which 1 ms to minimize.
[2021-05-11 19:44:13] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
[2021-05-11 19:44:13] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 0 ms to minimize.
[2021-05-11 19:44:13] [INFO ] Deduced a trap composed of 53 places in 68 ms of which 1 ms to minimize.
[2021-05-11 19:44:13] [INFO ] Deduced a trap composed of 48 places in 67 ms of which 1 ms to minimize.
[2021-05-11 19:44:13] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2021-05-11 19:44:13] [INFO ] Deduced a trap composed of 54 places in 71 ms of which 0 ms to minimize.
[2021-05-11 19:44:13] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 3177 ms
[2021-05-11 19:44:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 19:44:13] [INFO ] [Nat]Absence check using 58 positive place invariants in 16 ms returned sat
[2021-05-11 19:44:13] [INFO ] [Nat]Absence check using 58 positive and 37 generalized place invariants in 7 ms returned sat
[2021-05-11 19:44:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 19:44:13] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2021-05-11 19:44:13] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 1 ms to minimize.
[2021-05-11 19:44:14] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 0 ms to minimize.
[2021-05-11 19:44:14] [INFO ] Deduced a trap composed of 39 places in 133 ms of which 1 ms to minimize.
[2021-05-11 19:44:14] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 1 ms to minimize.
[2021-05-11 19:44:14] [INFO ] Deduced a trap composed of 47 places in 95 ms of which 0 ms to minimize.
[2021-05-11 19:44:14] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 1 ms to minimize.
[2021-05-11 19:44:14] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2021-05-11 19:44:14] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 0 ms to minimize.
[2021-05-11 19:44:14] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 0 ms to minimize.
[2021-05-11 19:44:14] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 0 ms to minimize.
[2021-05-11 19:44:14] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 0 ms to minimize.
[2021-05-11 19:44:15] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 0 ms to minimize.
[2021-05-11 19:44:15] [INFO ] Deduced a trap composed of 52 places in 68 ms of which 0 ms to minimize.
[2021-05-11 19:44:15] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 1 ms to minimize.
[2021-05-11 19:44:15] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 0 ms to minimize.
[2021-05-11 19:44:15] [INFO ] Deduced a trap composed of 47 places in 94 ms of which 0 ms to minimize.
[2021-05-11 19:44:15] [INFO ] Deduced a trap composed of 51 places in 93 ms of which 0 ms to minimize.
[2021-05-11 19:44:15] [INFO ] Deduced a trap composed of 105 places in 96 ms of which 0 ms to minimize.
[2021-05-11 19:44:15] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 0 ms to minimize.
[2021-05-11 19:44:15] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2021-05-11 19:44:15] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
[2021-05-11 19:44:15] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 1 ms to minimize.
[2021-05-11 19:44:16] [INFO ] Deduced a trap composed of 104 places in 95 ms of which 0 ms to minimize.
[2021-05-11 19:44:16] [INFO ] Deduced a trap composed of 109 places in 93 ms of which 0 ms to minimize.
[2021-05-11 19:44:16] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2021-05-11 19:44:16] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 0 ms to minimize.
[2021-05-11 19:44:16] [INFO ] Deduced a trap composed of 53 places in 63 ms of which 1 ms to minimize.
[2021-05-11 19:44:16] [INFO ] Deduced a trap composed of 48 places in 60 ms of which 0 ms to minimize.
[2021-05-11 19:44:16] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 0 ms to minimize.
[2021-05-11 19:44:16] [INFO ] Deduced a trap composed of 54 places in 62 ms of which 0 ms to minimize.
[2021-05-11 19:44:16] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 2747 ms
[2021-05-11 19:44:16] [INFO ] Computed and/alt/rep : 456/757/456 causal constraints (skipped 33 transitions) in 19 ms.
[2021-05-11 19:44:17] [INFO ] Added : 262 causal constraints over 53 iterations in 1117 ms. Result :sat
[2021-05-11 19:44:17] [INFO ] [Real]Absence check using 58 positive place invariants in 25 ms returned sat
[2021-05-11 19:44:17] [INFO ] [Real]Absence check using 58 positive and 37 generalized place invariants in 13 ms returned sat
[2021-05-11 19:44:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 19:44:18] [INFO ] [Real]Absence check using state equation in 269 ms returned sat
[2021-05-11 19:44:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 19:44:18] [INFO ] [Nat]Absence check using 58 positive place invariants in 15 ms returned sat
[2021-05-11 19:44:18] [INFO ] [Nat]Absence check using 58 positive and 37 generalized place invariants in 8 ms returned sat
[2021-05-11 19:44:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 19:44:18] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2021-05-11 19:44:18] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 0 ms to minimize.
[2021-05-11 19:44:18] [INFO ] Deduced a trap composed of 114 places in 99 ms of which 1 ms to minimize.
[2021-05-11 19:44:18] [INFO ] Deduced a trap composed of 109 places in 117 ms of which 0 ms to minimize.
[2021-05-11 19:44:18] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 0 ms to minimize.
[2021-05-11 19:44:18] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 0 ms to minimize.
[2021-05-11 19:44:19] [INFO ] Deduced a trap composed of 47 places in 98 ms of which 0 ms to minimize.
[2021-05-11 19:44:19] [INFO ] Deduced a trap composed of 104 places in 98 ms of which 1 ms to minimize.
[2021-05-11 19:44:19] [INFO ] Deduced a trap composed of 110 places in 98 ms of which 0 ms to minimize.
[2021-05-11 19:44:19] [INFO ] Deduced a trap composed of 130 places in 97 ms of which 1 ms to minimize.
[2021-05-11 19:44:19] [INFO ] Deduced a trap composed of 112 places in 99 ms of which 0 ms to minimize.
[2021-05-11 19:44:19] [INFO ] Deduced a trap composed of 110 places in 98 ms of which 0 ms to minimize.
[2021-05-11 19:44:19] [INFO ] Deduced a trap composed of 112 places in 100 ms of which 0 ms to minimize.
[2021-05-11 19:44:19] [INFO ] Deduced a trap composed of 116 places in 98 ms of which 0 ms to minimize.
[2021-05-11 19:44:19] [INFO ] Deduced a trap composed of 126 places in 103 ms of which 1 ms to minimize.
[2021-05-11 19:44:20] [INFO ] Deduced a trap composed of 127 places in 102 ms of which 1 ms to minimize.
[2021-05-11 19:44:20] [INFO ] Deduced a trap composed of 117 places in 144 ms of which 1 ms to minimize.
[2021-05-11 19:44:20] [INFO ] Deduced a trap composed of 125 places in 104 ms of which 0 ms to minimize.
[2021-05-11 19:44:20] [INFO ] Deduced a trap composed of 122 places in 106 ms of which 0 ms to minimize.
[2021-05-11 19:44:20] [INFO ] Deduced a trap composed of 128 places in 97 ms of which 1 ms to minimize.
[2021-05-11 19:44:20] [INFO ] Deduced a trap composed of 107 places in 97 ms of which 0 ms to minimize.
[2021-05-11 19:44:20] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 1 ms to minimize.
[2021-05-11 19:44:20] [INFO ] Deduced a trap composed of 100 places in 103 ms of which 0 ms to minimize.
[2021-05-11 19:44:21] [INFO ] Deduced a trap composed of 117 places in 99 ms of which 0 ms to minimize.
[2021-05-11 19:44:21] [INFO ] Deduced a trap composed of 129 places in 98 ms of which 0 ms to minimize.
[2021-05-11 19:44:21] [INFO ] Deduced a trap composed of 107 places in 96 ms of which 0 ms to minimize.
[2021-05-11 19:44:21] [INFO ] Deduced a trap composed of 45 places in 96 ms of which 0 ms to minimize.
[2021-05-11 19:44:21] [INFO ] Deduced a trap composed of 122 places in 96 ms of which 1 ms to minimize.
[2021-05-11 19:44:21] [INFO ] Deduced a trap composed of 122 places in 96 ms of which 0 ms to minimize.
[2021-05-11 19:44:21] [INFO ] Deduced a trap composed of 44 places in 100 ms of which 0 ms to minimize.
[2021-05-11 19:44:21] [INFO ] Deduced a trap composed of 129 places in 118 ms of which 0 ms to minimize.
[2021-05-11 19:44:22] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 0 ms to minimize.
[2021-05-11 19:44:22] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 0 ms to minimize.
[2021-05-11 19:44:22] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 1 ms to minimize.
[2021-05-11 19:44:22] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 0 ms to minimize.
[2021-05-11 19:44:22] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 0 ms to minimize.
[2021-05-11 19:44:22] [INFO ] Deduced a trap composed of 131 places in 97 ms of which 0 ms to minimize.
[2021-05-11 19:44:22] [INFO ] Deduced a trap composed of 110 places in 98 ms of which 0 ms to minimize.
[2021-05-11 19:44:22] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 0 ms to minimize.
[2021-05-11 19:44:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 38 trap constraints in 4498 ms
[2021-05-11 19:44:22] [INFO ] [Real]Absence check using 58 positive place invariants in 13 ms returned sat
[2021-05-11 19:44:22] [INFO ] [Real]Absence check using 58 positive and 37 generalized place invariants in 6 ms returned sat
[2021-05-11 19:44:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 19:44:23] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2021-05-11 19:44:23] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 0 ms to minimize.
[2021-05-11 19:44:23] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 0 ms to minimize.
[2021-05-11 19:44:23] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 1 ms to minimize.
[2021-05-11 19:44:23] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 0 ms to minimize.
[2021-05-11 19:44:23] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 0 ms to minimize.
[2021-05-11 19:44:23] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 1 ms to minimize.
[2021-05-11 19:44:23] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 0 ms to minimize.
[2021-05-11 19:44:23] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 0 ms to minimize.
[2021-05-11 19:44:24] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 1 ms to minimize.
[2021-05-11 19:44:24] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 1 ms to minimize.
[2021-05-11 19:44:24] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 0 ms to minimize.
[2021-05-11 19:44:24] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 0 ms to minimize.
[2021-05-11 19:44:24] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 0 ms to minimize.
[2021-05-11 19:44:24] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 0 ms to minimize.
[2021-05-11 19:44:24] [INFO ] Deduced a trap composed of 112 places in 141 ms of which 0 ms to minimize.
[2021-05-11 19:44:24] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 0 ms to minimize.
[2021-05-11 19:44:25] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 0 ms to minimize.
[2021-05-11 19:44:25] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 0 ms to minimize.
[2021-05-11 19:44:25] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 0 ms to minimize.
[2021-05-11 19:44:25] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 0 ms to minimize.
[2021-05-11 19:44:25] [INFO ] Deduced a trap composed of 45 places in 97 ms of which 0 ms to minimize.
[2021-05-11 19:44:25] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 0 ms to minimize.
[2021-05-11 19:44:25] [INFO ] Deduced a trap composed of 110 places in 102 ms of which 0 ms to minimize.
[2021-05-11 19:44:25] [INFO ] Deduced a trap composed of 109 places in 106 ms of which 0 ms to minimize.
[2021-05-11 19:44:25] [INFO ] Deduced a trap composed of 46 places in 100 ms of which 1 ms to minimize.
[2021-05-11 19:44:26] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 0 ms to minimize.
[2021-05-11 19:44:26] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 0 ms to minimize.
[2021-05-11 19:44:26] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 0 ms to minimize.
[2021-05-11 19:44:26] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 0 ms to minimize.
[2021-05-11 19:44:26] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 1 ms to minimize.
[2021-05-11 19:44:26] [INFO ] Deduced a trap composed of 104 places in 90 ms of which 0 ms to minimize.
[2021-05-11 19:44:26] [INFO ] Deduced a trap composed of 106 places in 89 ms of which 0 ms to minimize.
[2021-05-11 19:44:26] [INFO ] Deduced a trap composed of 66 places in 77 ms of which 1 ms to minimize.
[2021-05-11 19:44:26] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 0 ms to minimize.
[2021-05-11 19:44:26] [INFO ] Deduced a trap composed of 53 places in 58 ms of which 0 ms to minimize.
[2021-05-11 19:44:26] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2021-05-11 19:44:27] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 1 ms to minimize.
[2021-05-11 19:44:27] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 0 ms to minimize.
[2021-05-11 19:44:27] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 0 ms to minimize.
[2021-05-11 19:44:27] [INFO ] Deduced a trap composed of 60 places in 55 ms of which 0 ms to minimize.
[2021-05-11 19:44:27] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 0 ms to minimize.
[2021-05-11 19:44:27] [INFO ] Deduced a trap composed of 68 places in 55 ms of which 1 ms to minimize.
[2021-05-11 19:44:27] [INFO ] Deduced a trap composed of 54 places in 53 ms of which 0 ms to minimize.
[2021-05-11 19:44:27] [INFO ] Deduced a trap composed of 52 places in 35 ms of which 1 ms to minimize.
[2021-05-11 19:44:27] [INFO ] Deduced a trap composed of 109 places in 130 ms of which 1 ms to minimize.
[2021-05-11 19:44:27] [INFO ] Trap strengthening (SAT) tested/added 46/45 trap constraints in 4669 ms
[2021-05-11 19:44:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 19:44:27] [INFO ] [Nat]Absence check using 58 positive place invariants in 14 ms returned sat
[2021-05-11 19:44:27] [INFO ] [Nat]Absence check using 58 positive and 37 generalized place invariants in 6 ms returned sat
[2021-05-11 19:44:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 19:44:27] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2021-05-11 19:44:28] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 0 ms to minimize.
[2021-05-11 19:44:28] [INFO ] Deduced a trap composed of 42 places in 167 ms of which 1 ms to minimize.
[2021-05-11 19:44:28] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 0 ms to minimize.
[2021-05-11 19:44:28] [INFO ] Deduced a trap composed of 20 places in 137 ms of which 1 ms to minimize.
[2021-05-11 19:44:28] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 1 ms to minimize.
[2021-05-11 19:44:28] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 0 ms to minimize.
[2021-05-11 19:44:28] [INFO ] Deduced a trap composed of 26 places in 122 ms of which 1 ms to minimize.
[2021-05-11 19:44:29] [INFO ] Deduced a trap composed of 18 places in 140 ms of which 0 ms to minimize.
[2021-05-11 19:44:29] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 0 ms to minimize.
[2021-05-11 19:44:29] [INFO ] Deduced a trap composed of 17 places in 137 ms of which 1 ms to minimize.
[2021-05-11 19:44:29] [INFO ] Deduced a trap composed of 25 places in 120 ms of which 0 ms to minimize.
[2021-05-11 19:44:29] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 0 ms to minimize.
[2021-05-11 19:44:29] [INFO ] Deduced a trap composed of 26 places in 122 ms of which 0 ms to minimize.
[2021-05-11 19:44:29] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 0 ms to minimize.
[2021-05-11 19:44:30] [INFO ] Deduced a trap composed of 112 places in 148 ms of which 0 ms to minimize.
[2021-05-11 19:44:30] [INFO ] Deduced a trap composed of 36 places in 118 ms of which 1 ms to minimize.
[2021-05-11 19:44:30] [INFO ] Deduced a trap composed of 21 places in 140 ms of which 1 ms to minimize.
[2021-05-11 19:44:30] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 0 ms to minimize.
[2021-05-11 19:44:30] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 1 ms to minimize.
[2021-05-11 19:44:30] [INFO ] Deduced a trap composed of 38 places in 127 ms of which 1 ms to minimize.
[2021-05-11 19:44:30] [INFO ] Deduced a trap composed of 45 places in 94 ms of which 0 ms to minimize.
[2021-05-11 19:44:30] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 0 ms to minimize.
[2021-05-11 19:44:31] [INFO ] Deduced a trap composed of 110 places in 159 ms of which 1 ms to minimize.
[2021-05-11 19:44:31] [INFO ] Deduced a trap composed of 109 places in 125 ms of which 1 ms to minimize.
[2021-05-11 19:44:31] [INFO ] Deduced a trap composed of 46 places in 113 ms of which 0 ms to minimize.
[2021-05-11 19:44:31] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 0 ms to minimize.
[2021-05-11 19:44:31] [INFO ] Deduced a trap composed of 29 places in 146 ms of which 0 ms to minimize.
[2021-05-11 19:44:31] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 1 ms to minimize.
[2021-05-11 19:44:31] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 0 ms to minimize.
[2021-05-11 19:44:32] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 1 ms to minimize.
[2021-05-11 19:44:32] [INFO ] Deduced a trap composed of 104 places in 103 ms of which 0 ms to minimize.
[2021-05-11 19:44:32] [INFO ] Deduced a trap composed of 106 places in 104 ms of which 0 ms to minimize.
[2021-05-11 19:44:32] [INFO ] Deduced a trap composed of 66 places in 69 ms of which 0 ms to minimize.
[2021-05-11 19:44:32] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 0 ms to minimize.
[2021-05-11 19:44:32] [INFO ] Deduced a trap composed of 53 places in 71 ms of which 0 ms to minimize.
[2021-05-11 19:44:32] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2021-05-11 19:44:32] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 0 ms to minimize.
[2021-05-11 19:44:32] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 0 ms to minimize.
[2021-05-11 19:44:32] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2021-05-11 19:44:33] [INFO ] Deduced a trap composed of 60 places in 53 ms of which 1 ms to minimize.
[2021-05-11 19:44:33] [INFO ] Deduced a trap composed of 50 places in 45 ms of which 0 ms to minimize.
[2021-05-11 19:44:33] [INFO ] Deduced a trap composed of 68 places in 47 ms of which 0 ms to minimize.
[2021-05-11 19:44:33] [INFO ] Deduced a trap composed of 54 places in 44 ms of which 1 ms to minimize.
[2021-05-11 19:44:33] [INFO ] Deduced a trap composed of 52 places in 41 ms of which 0 ms to minimize.
[2021-05-11 19:44:33] [INFO ] Deduced a trap composed of 109 places in 89 ms of which 0 ms to minimize.
[2021-05-11 19:44:33] [INFO ] Trap strengthening (SAT) tested/added 46/45 trap constraints in 5536 ms
[2021-05-11 19:44:33] [INFO ] Computed and/alt/rep : 456/757/456 causal constraints (skipped 33 transitions) in 23 ms.
[2021-05-11 19:44:34] [INFO ] Added : 291 causal constraints over 59 iterations in 1437 ms. Result :sat
Successfully simplified 5 atomic propositions for a total of 15 simplifications.
Graph (trivial) has 266 edges and 548 vertex of which 4 / 548 are part of one of the 1 SCC in 25 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 87 rules applied. Total rules applied 88 place count 544 transition count 399
Reduce places removed 87 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 90 rules applied. Total rules applied 178 place count 457 transition count 396
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 181 place count 454 transition count 396
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 95 Pre rules applied. Total rules applied 181 place count 454 transition count 301
Deduced a syphon composed of 95 places in 2 ms
Ensure Unique test removed 15 places
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 205 rules applied. Total rules applied 386 place count 344 transition count 301
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 444 place count 286 transition count 243
Iterating global reduction 3 with 58 rules applied. Total rules applied 502 place count 286 transition count 243
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 0 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 3 with 174 rules applied. Total rules applied 676 place count 199 transition count 156
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 677 place count 199 transition count 156
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 678 place count 198 transition count 155
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 679 place count 197 transition count 155
Applied a total of 679 rules in 237 ms. Remains 197 /548 variables (removed 351) and now considering 155/490 (removed 335) transitions.
[2021-05-11 19:44:35] [INFO ] Flatten gal took : 15 ms
[2021-05-11 19:44:35] [INFO ] Flatten gal took : 12 ms
[2021-05-11 19:44:35] [INFO ] Input system was already deterministic with 155 transitions.
[2021-05-11 19:44:35] [INFO ] Flatten gal took : 12 ms
[2021-05-11 19:44:35] [INFO ] Flatten gal took : 12 ms
[2021-05-11 19:44:35] [INFO ] Time to serialize gal into /tmp/CTLFireability12410847800686411185.gal : 31 ms
[2021-05-11 19:44:35] [INFO ] Time to serialize properties into /tmp/CTLFireability15338415135400563261.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/CTLFireability12410847800686411185.gal, -t, CGAL, -ctl, /tmp/CTLFireability15338415135400563261.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/CTLFireability12410847800686411185.gal -t CGAL -ctl /tmp/CTLFireability15338415135400563261.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.37229e+06,0.139307,10040,2,3986,5,18908,6,0,943,16096,0


Converting to forward existential form...Done !
original formula: EG((((((E(((((p226==1)||(p554==1))||(p417==1))||(p462==1)) U EF(((((((((((p485==1)||(p177==1))||(p53==1))||(p526==1))||(p464==1))||((p87==1)&&(p474==1)))||(((p114==1)&&(p309==1))&&(p567==1)))||(p202==1))||(((p105==1)&&(p279==1))&&(p549==1)))||(p582==1)))) * (p213==0)) * (p505==0)) * (((p31==0)||(p274==0))||(p436==0))) * ((p87==0)||(p474==0))) * (((p215==0)||(p394==0))||(p533==0))))
=> equivalent forward existential formula: [FwdG(Init,(((((E(((((p226==1)||(p554==1))||(p417==1))||(p462==1)) U E(TRUE U ((((((((((p485==1)||(p177==1))||(p53==1))||(p526==1))||(p464==1))||((p87==1)&&(p474==1)))||(((p114==1)&&(p309==1))&&(p567==1)))||(p202==1))||(((p105==1)&&(p279==1))&&(p549==1)))||(p582==1)))) * (p213==0)) * (p505==0)) * (((p31==0)||(p274==0))||(p436==0))) * ((p87==0)||(p474==0))) * (((p215==0)||(p394==0))||(p533==0))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t17, t19, t66, t69, t72, t73, t74, t75, t76, t94, t95, t96, t97, t98, t121, t122, t123, t131, t134, t135, t136, t149, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/95/24/155
(forward)formula 0,1,2.84394,95012,1,0,318,389307,309,193,6869,339149,377
FORMULA BusinessProcesses-PT-12-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Graph (trivial) has 295 edges and 548 vertex of which 7 / 548 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 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 100 place count 541 transition count 383
Reduce places removed 99 places and 0 transitions.
Iterating post reduction 1 with 99 rules applied. Total rules applied 199 place count 442 transition count 383
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 199 place count 442 transition count 288
Deduced a syphon composed of 95 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 208 rules applied. Total rules applied 407 place count 329 transition count 288
Discarding 58 places :
Symmetric choice reduction at 2 with 58 rule applications. Total rules 465 place count 271 transition count 230
Iterating global reduction 2 with 58 rules applied. Total rules applied 523 place count 271 transition count 230
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 523 place count 271 transition count 226
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 532 place count 266 transition count 226
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 2 with 187 rules applied. Total rules applied 719 place count 171 transition count 134
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 721 place count 170 transition count 138
Applied a total of 721 rules in 43 ms. Remains 170 /548 variables (removed 378) and now considering 138/490 (removed 352) transitions.
[2021-05-11 19:44:38] [INFO ] Flatten gal took : 9 ms
[2021-05-11 19:44:38] [INFO ] Flatten gal took : 9 ms
[2021-05-11 19:44:38] [INFO ] Input system was already deterministic with 138 transitions.
[2021-05-11 19:44:38] [INFO ] Flatten gal took : 22 ms
[2021-05-11 19:44:38] [INFO ] Flatten gal took : 34 ms
[2021-05-11 19:44:38] [INFO ] Time to serialize gal into /tmp/CTLFireability14467577051578089291.gal : 2 ms
[2021-05-11 19:44:38] [INFO ] Time to serialize properties into /tmp/CTLFireability15153213277810022599.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/CTLFireability14467577051578089291.gal, -t, CGAL, -ctl, /tmp/CTLFireability15153213277810022599.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/CTLFireability14467577051578089291.gal -t CGAL -ctl /tmp/CTLFireability15153213277810022599.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,27139,0.262541,10144,2,4765,5,17151,6,0,817,12797,0


Converting to forward existential form...Done !
original formula: AF(AG(EF((((((p352==0)&&(p435==0))&&(p255==0))&&(((p114==0)||(p309==0))||(p573==0)))&&(((p96==0)||(p309==0))||(p567==0))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(E(TRUE U (((((p352==0)&&(p435==0))&&(p255==0))&&(((p114==0)||(p309==0))||(p573==0)))&&(((p96==0)||(p309==0))||(p567==0)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t7, t37, t38, t39, t40, t41, t55, t56, t57, t58, t59, t80, t93, t96, t97, t98, t116, t128, t129, t130, t131, t132, t133, t134, t135, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/76/26/138
(forward)formula 0,1,2.56597,72800,1,0,187,229175,266,92,6703,144763,254
FORMULA BusinessProcesses-PT-12-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Graph (trivial) has 285 edges and 548 vertex of which 7 / 548 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 93 transitions
Trivial Post-agglo rules discarded 93 transitions
Performed 93 trivial Post agglomeration. Transition count delta: 93
Iterating post reduction 0 with 93 rules applied. Total rules applied 94 place count 541 transition count 389
Reduce places removed 93 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 96 rules applied. Total rules applied 190 place count 448 transition count 386
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 193 place count 445 transition count 386
Performed 92 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 92 Pre rules applied. Total rules applied 193 place count 445 transition count 294
Deduced a syphon composed of 92 places in 1 ms
Ensure Unique test removed 15 places
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 3 with 199 rules applied. Total rules applied 392 place count 338 transition count 294
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 450 place count 280 transition count 236
Iterating global reduction 3 with 58 rules applied. Total rules applied 508 place count 280 transition count 236
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 508 place count 280 transition count 233
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 514 place count 277 transition count 233
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 187 rules applied. Total rules applied 701 place count 182 transition count 141
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 703 place count 181 transition count 145
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 704 place count 180 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 705 place count 179 transition count 144
Applied a total of 705 rules in 91 ms. Remains 179 /548 variables (removed 369) and now considering 144/490 (removed 346) transitions.
[2021-05-11 19:44:41] [INFO ] Flatten gal took : 24 ms
[2021-05-11 19:44:41] [INFO ] Flatten gal took : 13 ms
[2021-05-11 19:44:41] [INFO ] Input system was already deterministic with 144 transitions.
[2021-05-11 19:44:41] [INFO ] Flatten gal took : 11 ms
[2021-05-11 19:44:41] [INFO ] Flatten gal took : 10 ms
[2021-05-11 19:44:41] [INFO ] Time to serialize gal into /tmp/CTLFireability16302375738598869308.gal : 3 ms
[2021-05-11 19:44:41] [INFO ] Time to serialize properties into /tmp/CTLFireability16328097309970833435.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/CTLFireability16302375738598869308.gal, -t, CGAL, -ctl, /tmp/CTLFireability16328097309970833435.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/CTLFireability16302375738598869308.gal -t CGAL -ctl /tmp/CTLFireability16328097309970833435.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,177140,0.226877,11428,2,3584,5,28283,6,0,859,17012,0


Converting to forward existential form...Done !
original formula: EG(AG(!(EF((((((((((p503==1)||(p227==1))||(((p134==1)&&(p324==1))&&(p488==1)))||(p84==1))||(((p114==1)&&(p309==1))&&(p555==1)))||(p116==1))||(p433==1))||(p217==1))||(p142==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(!(E(TRUE U (((((((((p503==1)||(p227==1))||(((p134==1)&&(p324==1))&&(p488==1)))||(p84==1))||(((p114==1)&&(p309==1))&&(p555==1)))||(p116==1))||(p433==1))||(p217==1))||(p142==1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t41, t43, t44, t45, t46, t47, t48, t63, t64, t65, t66, t67, t100, t103, t104, t120, t134, t135, t136, t137, t138, t139, t140, t141, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/83/25/144
(forward)formula 0,0,1.98331,61308,1,0,210,230077,278,103,6464,144879,272
FORMULA BusinessProcesses-PT-12-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Reduce places removed 1 places and 1 transitions.
Drop transitions removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 547 transition count 429
Reduce places removed 60 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 66 rules applied. Total rules applied 126 place count 487 transition count 423
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 132 place count 481 transition count 423
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 110 Pre rules applied. Total rules applied 132 place count 481 transition count 313
Deduced a syphon composed of 110 places in 3 ms
Ensure Unique test removed 15 places
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 3 with 235 rules applied. Total rules applied 367 place count 356 transition count 313
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 421 place count 302 transition count 259
Iterating global reduction 3 with 54 rules applied. Total rules applied 475 place count 302 transition count 259
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 475 place count 302 transition count 256
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 482 place count 298 transition count 256
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 147 rules applied. Total rules applied 629 place count 223 transition count 184
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 631 place count 222 transition count 188
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 632 place count 221 transition count 187
Applied a total of 632 rules in 83 ms. Remains 221 /548 variables (removed 327) and now considering 187/490 (removed 303) transitions.
[2021-05-11 19:44:43] [INFO ] Flatten gal took : 14 ms
[2021-05-11 19:44:43] [INFO ] Flatten gal took : 13 ms
[2021-05-11 19:44:43] [INFO ] Input system was already deterministic with 187 transitions.
[2021-05-11 19:44:43] [INFO ] Flatten gal took : 26 ms
[2021-05-11 19:44:43] [INFO ] Flatten gal took : 13 ms
[2021-05-11 19:44:43] [INFO ] Time to serialize gal into /tmp/CTLFireability3978550205269904337.gal : 2 ms
[2021-05-11 19:44:43] [INFO ] Time to serialize properties into /tmp/CTLFireability5109320405939913322.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/CTLFireability3978550205269904337.gal, -t, CGAL, -ctl, /tmp/CTLFireability5109320405939913322.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/CTLFireability3978550205269904337.gal -t CGAL -ctl /tmp/CTLFireability5109320405939913322.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.10196e+08,0.584499,22512,2,12083,5,53020,6,0,1070,58761,0


Converting to forward existential form...Done !
original formula: AG((!(EG(E(((((((((((p310==0)&&(p258==0))&&(p528==0))&&(p9==0))&&(((p156==0)||(p358==0))||(p547==0)))&&(p428==0))&&(p184==0))&&(((p168==0)||(p368==0))||(p547==0)))&&(p532==0))&&(p566==0)) U ((((((((p244==1)||(p128==1))||(((p36==1)&&(p284==1))&&(p441==1)))||(p463==1))||(p241==1))||(((p80==1)&&(p279==1))&&(p558==1)))||(((p108==1)&&(p309==1))&&(p573==1)))||(p237==1))))) + EG(!(A((((((((((p536==0)&&(((p93==0)||(p304==0))||(p561==0)))&&(p144==0))&&(p214==0))&&(((p156==0)||(p358==0))||(p547==0)))&&(p184==0))&&(p459==0))&&(p189==0))&&(p362==0)) U E(((((((((((((p80==1)&&(p279==1))&&(p467==1))||(((p57==1)&&(p303==1))&&(p547==1)))||(((p225==1)&&(p413==1))&&(p547==1)))||((p87==1)&&(p474==1)))||(((p96==1)&&(p309==1))&&(p473==1)))||(p461==1))||(((p99==1)&&(p279==1))&&(p558==1)))||(p345==1))||(p222==1))||(p566==1)) U ((p494==1)||(((p162==1)&&(p363==1))&&(p547==1)))))))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !(EG(!(!((E(!(E(((((((((((((p80==1)&&(p279==1))&&(p467==1))||(((p57==1)&&(p303==1))&&(p547==1)))||(((p225==1)&&(p413==1))&&(p547==1)))||((p87==1)&&(p474==1)))||(((p96==1)&&(p309==1))&&(p473==1)))||(p461==1))||(((p99==1)&&(p279==1))&&(p558==1)))||(p345==1))||(p222==1))||(p566==1)) U ((p494==1)||(((p162==1)&&(p363==1))&&(p547==1))))) U (!((((((((((p536==0)&&(((p93==0)||(p304==0))||(p561==0)))&&(p144==0))&&(p214==0))&&(((p156==0)||(p358==0))||(p547==0)))&&(p184==0))&&(p459==0))&&(p189==0))&&(p362==0))) * !(E(((((((((((((p80==1)&&(p279==1))&&(p467==1))||(((p57==1)&&(p303==1))&&(p547==1)))||(((p225==1)&&(p413==1))&&(p547==1)))||((p87==1)&&(p474==1)))||(((p96==1)&&(p309==1))&&(p473==1)))||(p461==1))||(((p99==1)&&(p279==1))&&(p558==1)))||(p345==1))||(p222==1))||(p566==1)) U ((p494==1)||(((p162==1)&&(p363==1))&&(p547==1))))))) + EG(!(E(((((((((((((p80==1)&&(p279==1))&&(p467==1))||(((p57==1)&&(p303==1))&&(p547==1)))||(((p225==1)&&(p413==1))&&(p547==1)))||((p87==1)&&(p474==1)))||(((p96==1)&&(p309==1))&&(p473==1)))||(p461==1))||(((p99==1)&&(p279==1))&&(p558==1)))||(p345==1))||(p222==1))||(p566==1)) U ((p494==1)||(((p162==1)&&(p363==1))&&(p547==1)))))))))))),E(((((((((((p310==0)&&(p258==0))&&(p528==0))&&(p9==0))&&(((p156==0)||(p358==0))||(p547==0)))&&(p428==0))&&(p184==0))&&(((p168==0)||(p368==0))||(p547==0)))&&(p532==0))&&(p566==0)) U ((((((((p244==1)||(p128==1))||(((p36==1)&&(p284==1))&&(p441==1)))||(p463==1))||(p241==1))||(((p80==1)&&(p279==1))&&(p558==1)))||(((p108==1)&&(p309==1))&&(p573==1)))||(p237==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t8, t10, t12, t18, t19, t22, t24, t25, t27, t29, t31, t92, t93, t96, t97, t98, t100, t101, t102, t103, t104, t105, t106, t107, t108, t109, t120, t124, t125, t126, t127, t142, t147, t149, t164, t165, t166, t175, t176, t181, t182, t183, t184, t185, t186, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/102/49/187
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2021-05-11 19:45:13] [INFO ] Flatten gal took : 9 ms
[2021-05-11 19:45:13] [INFO ] Applying decomposition
[2021-05-11 19:45:13] [INFO ] Flatten gal took : 8 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/graph8716656047523029136.txt, -o, /tmp/graph8716656047523029136.bin, -w, /tmp/graph8716656047523029136.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/graph8716656047523029136.bin, -l, -1, -v, -w, /tmp/graph8716656047523029136.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-11 19:45:13] [INFO ] Decomposing Gal with order
[2021-05-11 19:45:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 19:45:13] [INFO ] Removed a total of 97 redundant transitions.
[2021-05-11 19:45:13] [INFO ] Flatten gal took : 49 ms
[2021-05-11 19:45:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 11 ms.
[2021-05-11 19:45:13] [INFO ] Time to serialize gal into /tmp/CTLFireability4049317621456008027.gal : 4 ms
[2021-05-11 19:45:13] [INFO ] Time to serialize properties into /tmp/CTLFireability2766844804989213225.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/CTLFireability4049317621456008027.gal, -t, CGAL, -ctl, /tmp/CTLFireability2766844804989213225.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/CTLFireability4049317621456008027.gal -t CGAL -ctl /tmp/CTLFireability2766844804989213225.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,3.10196e+08,0.456965,18548,1249,709,21434,8786,733,48168,212,31007,0


Converting to forward existential form...Done !
original formula: AG((!(EG(E(((((((((((i4.u30.p310==0)&&(i5.i0.u38.p258==0))&&(i7.u53.p528==0))&&(i6.i0.u0.p9==0))&&(((i5.i1.u12.p156==0)||(i5.i1.u42.p358==0))||(i7.u53.p547==0)))&&(i7.u54.p428==0))&&(i2.u16.p184==0))&&(((i0.i0.u14.p168==0)||(i2.u44.p368==0))||(i7.u53.p547==0)))&&(i7.u53.p532==0))&&(u25.p566==0)) U ((((((((i6.i1.u23.p244==1)||(i9.i0.u9.p128==1))||(((i1.u4.p36==1)&&(i1.u26.p284==1))&&(i1.u55.p441==1)))||(i7.u53.p463==1))||(i6.i1.u22.p241==1))||(((u25.p80==1)&&(u25.p279==1))&&(u25.p558==1)))||(((i4.u31.p108==1)&&(i4.u31.p309==1))&&(i4.u31.p573==1)))||(i9.i0.u21.p237==1))))) + EG(!(A((((((((((i7.u53.p536==0)&&(((i3.u29.p93==0)||(i3.u29.p304==0))||(i3.u29.p561==0)))&&(i0.i0.u11.p144==0))&&(i6.i1.u18.p214==0))&&(((i5.i1.u12.p156==0)||(i5.i1.u42.p358==0))||(i7.u53.p547==0)))&&(i2.u16.p184==0))&&(i7.u53.p459==0))&&(i10.i0.u17.p189==0))&&(i2.u43.p362==0)) U E(((((((((((((u25.p80==1)&&(u25.p279==1))&&(u25.p467==1))||(((i1.u6.p57==1)&&(i3.u29.p303==1))&&(i7.u53.p547==1)))||(((i6.i1.u20.p225==1)&&(i6.i1.u23.p413==1))&&(i7.u53.p547==1)))||((i3.u8.p87==1)&&(i3.u57.p474==1)))||(((i4.u31.p96==1)&&(i4.u31.p309==1))&&(i4.u31.p473==1)))||(i7.u53.p461==1))||(((u25.p99==1)&&(u25.p279==1))&&(u25.p558==1)))||(i5.i0.u39.p345==1))||(i6.i1.u19.p222==1))||(u25.p566==1)) U ((i7.u61.p494==1)||(((i0.i0.u13.p162==1)&&(i2.u43.p363==1))&&(i7.u53.p547==1)))))))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !(EG(!(!((E(!(E(((((((((((((u25.p80==1)&&(u25.p279==1))&&(u25.p467==1))||(((i1.u6.p57==1)&&(i3.u29.p303==1))&&(i7.u53.p547==1)))||(((i6.i1.u20.p225==1)&&(i6.i1.u23.p413==1))&&(i7.u53.p547==1)))||((i3.u8.p87==1)&&(i3.u57.p474==1)))||(((i4.u31.p96==1)&&(i4.u31.p309==1))&&(i4.u31.p473==1)))||(i7.u53.p461==1))||(((u25.p99==1)&&(u25.p279==1))&&(u25.p558==1)))||(i5.i0.u39.p345==1))||(i6.i1.u19.p222==1))||(u25.p566==1)) U ((i7.u61.p494==1)||(((i0.i0.u13.p162==1)&&(i2.u43.p363==1))&&(i7.u53.p547==1))))) U (!((((((((((i7.u53.p536==0)&&(((i3.u29.p93==0)||(i3.u29.p304==0))||(i3.u29.p561==0)))&&(i0.i0.u11.p144==0))&&(i6.i1.u18.p214==0))&&(((i5.i1.u12.p156==0)||(i5.i1.u42.p358==0))||(i7.u53.p547==0)))&&(i2.u16.p184==0))&&(i7.u53.p459==0))&&(i10.i0.u17.p189==0))&&(i2.u43.p362==0))) * !(E(((((((((((((u25.p80==1)&&(u25.p279==1))&&(u25.p467==1))||(((i1.u6.p57==1)&&(i3.u29.p303==1))&&(i7.u53.p547==1)))||(((i6.i1.u20.p225==1)&&(i6.i1.u23.p413==1))&&(i7.u53.p547==1)))||((i3.u8.p87==1)&&(i3.u57.p474==1)))||(((i4.u31.p96==1)&&(i4.u31.p309==1))&&(i4.u31.p473==1)))||(i7.u53.p461==1))||(((u25.p99==1)&&(u25.p279==1))&&(u25.p558==1)))||(i5.i0.u39.p345==1))||(i6.i1.u19.p222==1))||(u25.p566==1)) U ((i7.u61.p494==1)||(((i0.i0.u13.p162==1)&&(i2.u43.p363==1))&&(i7.u53.p547==1))))))) + EG(!(E(((((((((((((u25.p80==1)&&(u25.p279==1))&&(u25.p467==1))||(((i1.u6.p57==1)&&(i3.u29.p303==1))&&(i7.u53.p547==1)))||(((i6.i1.u20.p225==1)&&(i6.i1.u23.p413==1))&&(i7.u53.p547==1)))||((i3.u8.p87==1)&&(i3.u57.p474==1)))||(((i4.u31.p96==1)&&(i4.u31.p309==1))&&(i4.u31.p473==1)))||(i7.u53.p461==1))||(((u25.p99==1)&&(u25.p279==1))&&(u25.p558==1)))||(i5.i0.u39.p345==1))||(i6.i1.u19.p222==1))||(u25.p566==1)) U ((i7.u61.p494==1)||(((i0.i0.u13.p162==1)&&(i2.u43.p363==1))&&(i7.u53.p547==1)))))))))))),E(((((((((((i4.u30.p310==0)&&(i5.i0.u38.p258==0))&&(i7.u53.p528==0))&&(i6.i0.u0.p9==0))&&(((i5.i1.u12.p156==0)||(i5.i1.u42.p358==0))||(i7.u53.p547==0)))&&(i7.u54.p428==0))&&(i2.u16.p184==0))&&(((i0.i0.u14.p168==0)||(i2.u44.p368==0))||(i7.u53.p547==0)))&&(i7.u53.p532==0))&&(u25.p566==0)) U ((((((((i6.i1.u23.p244==1)||(i9.i0.u9.p128==1))||(((i1.u4.p36==1)&&(i1.u26.p284==1))&&(i1.u55.p441==1)))||(i7.u53.p463==1))||(i6.i1.u22.p241==1))||(((u25.p80==1)&&(u25.p279==1))&&(u25.p558==1)))||(((i4.u31.p108==1)&&(i4.u31.p309==1))&&(i4.u31.p573==1)))||(i9.i0.u21.p237==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t92, t93, t101, t102, t103, t104, t120, t126, t127, t147, t149, t150, t165, t166, t181, t185, i0.i0.u11.t142, i0.i0.u13.t106, i0.i0.u14.t107, i1.u6.t100, i2.t108, i2.u43.t19, i4.t24, i4.u31.t25, i5.i0.u39.t22, i5.i1.u12.t105, i6.t125, i6.i0.u0.t29, i6.i1.u18.t96, i6.i1.u19.t97, i6.i1.u20.t109, i6.i1.u22.t27, i6.i1.u23.t18, i7.t184, i7.t176, i7.t5, i7.u53.t1, i7.u53.t2, i7.u53.t3, i7.u53.t8, i7.u53.t10, i7.u53.t12, i7.u53.t124, i9.i0.u21.t98, i10.i0.u17.t31, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :25/98/45/168
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 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an 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
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 an 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
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an 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
(forward)formula 0,0,8.08301,220100,1,0,365450,17732,3680,1.12026e+06,1842,94466,539949
FORMULA BusinessProcesses-PT-12-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

[2021-05-11 19:45:21] [INFO ] Flatten gal took : 39 ms
[2021-05-11 19:45:22] [INFO ] Flatten gal took : 23 ms
[2021-05-11 19:45:22] [INFO ] Applying decomposition
[2021-05-11 19:45:22] [INFO ] Flatten gal took : 20 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/graph6931518581429175055.txt, -o, /tmp/graph6931518581429175055.bin, -w, /tmp/graph6931518581429175055.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/graph6931518581429175055.bin, -l, -1, -v, -w, /tmp/graph6931518581429175055.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-11 19:45:22] [INFO ] Decomposing Gal with order
[2021-05-11 19:45:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 19:45:22] [INFO ] Removed a total of 251 redundant transitions.
[2021-05-11 19:45:22] [INFO ] Flatten gal took : 85 ms
[2021-05-11 19:45:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2021-05-11 19:45:22] [INFO ] Time to serialize gal into /tmp/CTLFireability12812050384505602269.gal : 17 ms
[2021-05-11 19:45:22] [INFO ] Time to serialize properties into /tmp/CTLFireability6271881432694733152.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/CTLFireability12812050384505602269.gal, -t, CGAL, -ctl, /tmp/CTLFireability6271881432694733152.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/CTLFireability12812050384505602269.gal -t CGAL -ctl /tmp/CTLFireability6271881432694733152.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,5.69002e+23,17.6943,423584,21459,136,606578,959,1117,2.11706e+06,99,3041,0


Converting to forward existential form...Done !
original formula: E((EF(!(EF((((((((((i8.u80.p211==1)||(i17.u1.p2==1))||(((i0.u213.p578==1)&&(i0.u214.p581==1))&&(i0.u215.p584==1)))||(i10.u105.p272==1))||(((i12.u28.p96==1)&&(i12.u115.p309==1))&&(i12.u209.p573==1)))||(i13.u119.p320==1))||(i2.u212.p576==1))||(((i12.u33.p83==1)&&(i12.u114.p304==1))&&(i12.u169.p561==1)))||(i7.u73.p189==1))))) * (EF(EG(AF((((((i18.u161.p438==1)||(i19.u195.p537==1))||(i3.u10.p21==1))||(i12.u211.p575==1))||(((i2.u66.p171==1)&&(i6.i1.i0.u130.p349==1))&&(i2.u185.p510==1)))))) + (!(EX(A((((((i8.u80.p210==1)||(i12.u209.p464==1))||(i9.u135.p365==1))||(i0.u155.p532==1))||(((i12.u36.p90==1)&&(i12.u107.p279==1))&&(i12.u201.p549==1))) U ((i8.u92.p247==1)||(i19.u180.p497==1))))) * (!(AX(((((((((((i19.u190.p523==1)||(i19.u181.p498==1))||((i12.u35.p87==1)&&(i12.u171.p474==1)))||(((i12.u28.p96==1)&&(i12.u115.p309==1))&&(i12.u115.p473==1)))||(i2.u137.p367==1))||(i0.u155.p509==1))||(i0.u158.p428==1))||(i19.u199.p546==1))||(i19.u172.p477==1))||(i12.u32.p78==1)))) + (((((((((i8.u75.p195==0)&&(i17.u151.p407==0))&&(i12.u208.p569==0))&&(i19.u195.p538==0))&&(i16.u196.p540==0))&&(i2.u137.p367==0))&&(i6.i0.i1.u59.p152==0))&&(i9.u94.p251==0))&&(((i12.u36.p90==0)||(i12.u107.p279==0))||(i12.u170.p564==0))))))) U AX((((i8.u76.p199==1) * (((((((!(AF((i19.u172.p476==1))) + (i6.i1.i0.u97.p256==1)) + (i9.u64.p167==1)) + (i12.u42.p107==1)) + (i12.u106.p280==1)) + (i17.u89.p237==1)) + (i10.u102.p267==1)) + (((i15.u62.p159==1)&&(i6.i1.i1.u128.p344==1))&&(i15.u183.p502==1)))) * ((i17.u154.p412==1)||(i0.u158.p429==1)))))
=> equivalent forward existential formula: [(FwdU(Init,(E(TRUE U !(E(TRUE U (((((((((i8.u80.p211==1)||(i17.u1.p2==1))||(((i0.u213.p578==1)&&(i0.u214.p581==1))&&(i0.u215.p584==1)))||(i10.u105.p272==1))||(((i12.u28.p96==1)&&(i12.u115.p309==1))&&(i12.u209.p573==1)))||(i13.u119.p320==1))||(i2.u212.p576==1))||(((i12.u33.p83==1)&&(i12.u114.p304==1))&&(i12.u169.p561==1)))||(i7.u73.p189==1))))) * (E(TRUE U EG(!(EG(!((((((i18.u161.p438==1)||(i19.u195.p537==1))||(i3.u10.p21==1))||(i12.u211.p575==1))||(((i2.u66.p171==1)&&(i6.i1.i0.u130.p349==1))&&(i2.u185.p510==1)))))))) + (!(EX(!((E(!(((i8.u92.p247==1)||(i19.u180.p497==1))) U (!((((((i8.u80.p210==1)||(i12.u209.p464==1))||(i9.u135.p365==1))||(i0.u155.p532==1))||(((i12.u36.p90==1)&&(i12.u107.p279==1))&&(i12.u201.p549==1)))) * !(((i8.u92.p247==1)||(i19.u180.p497==1))))) + EG(!(((i8.u92.p247==1)||(i19.u180.p497==1)))))))) * (!(!(EX(!(((((((((((i19.u190.p523==1)||(i19.u181.p498==1))||((i12.u35.p87==1)&&(i12.u171.p474==1)))||(((i12.u28.p96==1)&&(i12.u115.p309==1))&&(i12.u115.p473==1)))||(i2.u137.p367==1))||(i0.u155.p509==1))||(i0.u158.p428==1))||(i19.u199.p546==1))||(i19.u172.p477==1))||(i12.u32.p78==1)))))) + (((((((((i8.u75.p195==0)&&(i17.u151.p407==0))&&(i12.u208.p569==0))&&(i19.u195.p538==0))&&(i16.u196.p540==0))&&(i2.u137.p367==0))&&(i6.i0.i1.u59.p152==0))&&(i9.u94.p251==0))&&(((i12.u36.p90==0)||(i12.u107.p279==0))||(i12.u170.p564==0)))))))) * !(EX(!((((i8.u76.p199==1) * (((((((!(!(EG(!((i19.u172.p476==1))))) + (i6.i1.i0.u97.p256==1)) + (i9.u64.p167==1)) + (i12.u42.p107==1)) + (i12.u106.p280==1)) + (i17.u89.p237==1)) + (i10.u102.p267==1)) + (((i15.u62.p159==1)&&(i6.i1.i1.u128.p344==1))&&(i15.u183.p502==1)))) * ((i17.u154.p412==1)||(i0.u158.p429==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t230, t234, t252, t354, i0.t10, i0.u155.t21, i0.u155.t23, i0.u155.t41, i0.u155.t43, i0.u155.t57, i0.u155.t58, i0.u155.t88, i0.u155.t91, i0.u155.t92, i0.u155.t98, i0.u155.t112, i1.t244, i1.t240, i1.u77.t251, i1.u79.t247, i1.u81.t243, i2.t152, i2.u63.t275, i2.u65.t271, i2.u67.t267, i2.u137.t153, i3.t362, i3.u14.t358, i3.u13.t360, i3.u24.t338, i3.u26.t334, i4.u15.t357, i5.t349, i5.t347, i5.t345, i5.t342, i5.t341, i5.u17.t353, i5.u19.t348, i6.i0.i0.u56.t287, i6.i1.i0.u130.t167, i6.i1.i1.t171, i6.i1.i1.u128.t172, i7.t148, i7.u73.t259, i7.u139.t149, i8.t140, i8.t130, i8.u75.t255, i8.u145.t136, i8.u146.t133, i8.u144.t141, i8.u147.t131, i9.t164, i9.t160, i9.t156, i9.t144, i9.u131.t165, i9.u133.t161, i9.u136.t157, i9.u141.t145, i10.t222, i10.t212, i10.u113.t204, i10.u105.t223, i10.u109.t213, i11.t208, i11.u112.t209, i12.t316, i12.t312, i12.t309, i12.t219, i12.t198, i12.t3, i12.u107.t220, i12.u29.t320, i12.u29.t324, i12.u29.t330, i12.u33.t310, i12.u114.t201, i12.u115.t199, i13.t194, i13.t190, i13.u47.t305, i13.u49.t301, i13.u117.t195, i13.u120.t191, i14.t295, i14.t186, i14.t182, i14.t175, i14.u51.t297, i14.u125.t178, i14.u122.t187, i14.u123.t183, i14.u127.t176, i15.u54.t291, i15.u61.t279, i16.t239, i16.t126, i16.u84.t237, i16.u149.t127, i17.t122, i17.t118, i17.u86.t233, i17.u90.t225, i17.u88.t228, i17.u151.t123, i17.u154.t119, i18.t97, i18.u160.t100, i19.t107, i19.t102, i19.t95, i19.t90, i19.t86, i19.t64, i19.t61, i19.t55, i19.t52, i19.t50, i19.t48, i19.t46, i19.t33, i19.t29, i19.t26, i19.t20, i19.t17, i19.t14, i19.u200.t69, i19.u200.t73, i19.u200.t77, i19.u200.t83, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/321/133/490
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2021-05-11 19:51:48] [INFO ] Applying decomposition
[2021-05-11 19:51:48] [INFO ] Flatten gal took : 26 ms
[2021-05-11 19:51:48] [INFO ] Decomposing Gal with order
[2021-05-11 19:51:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 19:51:48] [INFO ] Removed a total of 119 redundant transitions.
[2021-05-11 19:51:48] [INFO ] Flatten gal took : 57 ms
[2021-05-11 19:51:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 117 labels/synchronizations in 152 ms.
[2021-05-11 19:51:48] [INFO ] Time to serialize gal into /tmp/CTLFireability10683141300792365750.gal : 8 ms
[2021-05-11 19:51:48] [INFO ] Time to serialize properties into /tmp/CTLFireability12287641771834536873.ctl : 5 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability10683141300792365750.gal, -t, CGAL, -ctl, /tmp/CTLFireability12287641771834536873.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/CTLFireability10683141300792365750.gal -t CGAL -ctl /tmp/CTLFireability12287641771834536873.ctl
No direction supplied, using forward translation only.
Parsed 11 CTL formulae.
Detected timeout of ITS tools.
[2021-05-11 20:12:37] [INFO ] Flatten gal took : 382 ms
[2021-05-11 20:12:38] [INFO ] Input system was already deterministic with 490 transitions.
[2021-05-11 20:12:38] [INFO ] Transformed 548 places.
[2021-05-11 20:12:38] [INFO ] Transformed 490 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-11 20:13:09] [INFO ] Time to serialize gal into /tmp/CTLFireability5217928369066554064.gal : 13 ms
[2021-05-11 20:13:09] [INFO ] Time to serialize properties into /tmp/CTLFireability2385459906932301685.ctl : 25 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/CTLFireability5217928369066554064.gal, -t, CGAL, -ctl, /tmp/CTLFireability2385459906932301685.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/CTLFireability5217928369066554064.gal -t CGAL -ctl /tmp/CTLFireability2385459906932301685.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.
Detected timeout of ITS tools.

BK_STOP 1620765238692

--------------------
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-12"
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-12, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r026-tajo-162038143800410"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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