About the Execution of ITS-Tools for BusinessProcesses-PT-17
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16240.508 | 3600000.00 | 3426185.00 | 201547.10 | ?????????T?????T | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2021-input.r026-tajo-162038143900450.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-17, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-tajo-162038143900450
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 81K 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.2K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 23 03:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 23 03:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 12:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 22 12:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.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 161K 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-17-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-17-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1620765757040
Running Version 0
[2021-05-11 20:42:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-11 20:42:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-11 20:42:39] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2021-05-11 20:42:39] [INFO ] Transformed 650 places.
[2021-05-11 20:42:39] [INFO ] Transformed 580 transitions.
[2021-05-11 20:42:39] [INFO ] Found NUPN structural information;
[2021-05-11 20:42:39] [INFO ] Parsed PT model containing 650 places and 580 transitions in 155 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Deduced a syphon composed of 4 places in 10 ms
Reduce places removed 4 places and 4 transitions.
Support contains 429 out of 646 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 646/646 places, 576/576 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 643 transition count 576
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 25 place count 621 transition count 554
Iterating global reduction 1 with 22 rules applied. Total rules applied 47 place count 621 transition count 554
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 55 place count 613 transition count 546
Iterating global reduction 1 with 8 rules applied. Total rules applied 63 place count 613 transition count 546
Applied a total of 63 rules in 84 ms. Remains 613 /646 variables (removed 33) and now considering 546/576 (removed 30) transitions.
// Phase 1: matrix 546 rows 613 cols
[2021-05-11 20:42:40] [INFO ] Computed 105 place invariants in 65 ms
[2021-05-11 20:42:40] [INFO ] Implicit Places using invariants in 437 ms returned []
// Phase 1: matrix 546 rows 613 cols
[2021-05-11 20:42:40] [INFO ] Computed 105 place invariants in 7 ms
[2021-05-11 20:42:40] [INFO ] Implicit Places using invariants and state equation in 511 ms returned []
Implicit Place search using SMT with State Equation took 975 ms to find 0 implicit places.
// Phase 1: matrix 546 rows 613 cols
[2021-05-11 20:42:40] [INFO ] Computed 105 place invariants in 11 ms
[2021-05-11 20:42:41] [INFO ] Dead Transitions using invariants and state equation in 332 ms returned []
Finished structural reductions, in 1 iterations. Remains : 613/646 places, 546/576 transitions.
[2021-05-11 20:42:41] [INFO ] Flatten gal took : 66 ms
[2021-05-11 20:42:41] [INFO ] Flatten gal took : 49 ms
[2021-05-11 20:42:41] [INFO ] Input system was already deterministic with 546 transitions.
Incomplete random walk after 100000 steps, including 660 resets, run finished after 481 ms. (steps per millisecond=207 ) properties (out of 78) seen :67
Running SMT prover for 11 properties.
// Phase 1: matrix 546 rows 613 cols
[2021-05-11 20:42:42] [INFO ] Computed 105 place invariants in 3 ms
[2021-05-11 20:42:42] [INFO ] [Real]Absence check using 61 positive place invariants in 23 ms returned sat
[2021-05-11 20:42:42] [INFO ] [Real]Absence check using 61 positive and 44 generalized place invariants in 17 ms returned sat
[2021-05-11 20:42:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:42:42] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2021-05-11 20:42:42] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 14 ms to minimize.
[2021-05-11 20:42:42] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 1 ms to minimize.
[2021-05-11 20:42:43] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2021-05-11 20:42:43] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2021-05-11 20:42:43] [INFO ] Deduced a trap composed of 48 places in 121 ms of which 0 ms to minimize.
[2021-05-11 20:42:43] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 0 ms to minimize.
[2021-05-11 20:42:43] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 10 ms to minimize.
[2021-05-11 20:42:43] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 0 ms to minimize.
[2021-05-11 20:42:43] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 0 ms to minimize.
[2021-05-11 20:42:43] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 0 ms to minimize.
[2021-05-11 20:42:43] [INFO ] Deduced a trap composed of 36 places in 97 ms of which 0 ms to minimize.
[2021-05-11 20:42:43] [INFO ] Deduced a trap composed of 45 places in 36 ms of which 1 ms to minimize.
[2021-05-11 20:42:43] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 0 ms to minimize.
[2021-05-11 20:42:44] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1343 ms
[2021-05-11 20:42:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:42:44] [INFO ] [Nat]Absence check using 61 positive place invariants in 69 ms returned sat
[2021-05-11 20:42:44] [INFO ] [Nat]Absence check using 61 positive and 44 generalized place invariants in 18 ms returned sat
[2021-05-11 20:42:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 20:42:44] [INFO ] [Nat]Absence check using state equation in 199 ms returned sat
[2021-05-11 20:42:44] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 1 ms to minimize.
[2021-05-11 20:42:44] [INFO ] Deduced a trap composed of 18 places in 168 ms of which 1 ms to minimize.
[2021-05-11 20:42:44] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 0 ms to minimize.
[2021-05-11 20:42:44] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 0 ms to minimize.
[2021-05-11 20:42:44] [INFO ] Deduced a trap composed of 48 places in 39 ms of which 0 ms to minimize.
[2021-05-11 20:42:44] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2021-05-11 20:42:45] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2021-05-11 20:42:45] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 0 ms to minimize.
[2021-05-11 20:42:45] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 0 ms to minimize.
[2021-05-11 20:42:45] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2021-05-11 20:42:45] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2021-05-11 20:42:45] [INFO ] Deduced a trap composed of 45 places in 37 ms of which 0 ms to minimize.
[2021-05-11 20:42:45] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 0 ms to minimize.
[2021-05-11 20:42:45] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1077 ms
[2021-05-11 20:42:45] [INFO ] Computed and/alt/rep : 508/848/508 causal constraints (skipped 37 transitions) in 29 ms.
[2021-05-11 20:42:47] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 0 ms to minimize.
[2021-05-11 20:42:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2021-05-11 20:42:47] [INFO ] Added : 304 causal constraints over 62 iterations in 2306 ms. Result :sat
[2021-05-11 20:42:47] [INFO ] [Real]Absence check using 61 positive place invariants in 26 ms returned sat
[2021-05-11 20:42:47] [INFO ] [Real]Absence check using 61 positive and 44 generalized place invariants in 17 ms returned sat
[2021-05-11 20:42:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:42:48] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2021-05-11 20:42:48] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 1 ms to minimize.
[2021-05-11 20:42:48] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
[2021-05-11 20:42:48] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 0 ms to minimize.
[2021-05-11 20:42:48] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 0 ms to minimize.
[2021-05-11 20:42:48] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 0 ms to minimize.
[2021-05-11 20:42:48] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2021-05-11 20:42:48] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2021-05-11 20:42:48] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 4 ms to minimize.
[2021-05-11 20:42:48] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 0 ms to minimize.
[2021-05-11 20:42:48] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 0 ms to minimize.
[2021-05-11 20:42:48] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 849 ms
[2021-05-11 20:42:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:42:49] [INFO ] [Nat]Absence check using 61 positive place invariants in 16 ms returned sat
[2021-05-11 20:42:49] [INFO ] [Nat]Absence check using 61 positive and 44 generalized place invariants in 10 ms returned sat
[2021-05-11 20:42:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 20:42:49] [INFO ] [Nat]Absence check using state equation in 182 ms returned sat
[2021-05-11 20:42:49] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 0 ms to minimize.
[2021-05-11 20:42:49] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2021-05-11 20:42:49] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 0 ms to minimize.
[2021-05-11 20:42:49] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2021-05-11 20:42:49] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2021-05-11 20:42:49] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2021-05-11 20:42:49] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 0 ms to minimize.
[2021-05-11 20:42:49] [INFO ] Deduced a trap composed of 39 places in 27 ms of which 0 ms to minimize.
[2021-05-11 20:42:49] [INFO ] Deduced a trap composed of 32 places in 16 ms of which 0 ms to minimize.
[2021-05-11 20:42:49] [INFO ] Deduced a trap composed of 36 places in 25 ms of which 0 ms to minimize.
[2021-05-11 20:42:49] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 541 ms
[2021-05-11 20:42:49] [INFO ] Computed and/alt/rep : 508/848/508 causal constraints (skipped 37 transitions) in 23 ms.
[2021-05-11 20:42:51] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 1 ms to minimize.
[2021-05-11 20:42:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2021-05-11 20:42:51] [INFO ] Added : 305 causal constraints over 63 iterations in 2219 ms. Result :sat
[2021-05-11 20:42:52] [INFO ] [Real]Absence check using 61 positive place invariants in 20 ms returned sat
[2021-05-11 20:42:52] [INFO ] [Real]Absence check using 61 positive and 44 generalized place invariants in 13 ms returned sat
[2021-05-11 20:42:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:42:52] [INFO ] [Real]Absence check using state equation in 227 ms returned sat
[2021-05-11 20:42:52] [INFO ] Deduced a trap composed of 25 places in 157 ms of which 0 ms to minimize.
[2021-05-11 20:42:52] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 0 ms to minimize.
[2021-05-11 20:42:52] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 1 ms to minimize.
[2021-05-11 20:42:52] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 0 ms to minimize.
[2021-05-11 20:42:53] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 1 ms to minimize.
[2021-05-11 20:42:53] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 0 ms to minimize.
[2021-05-11 20:42:53] [INFO ] Deduced a trap composed of 25 places in 144 ms of which 1 ms to minimize.
[2021-05-11 20:42:53] [INFO ] Deduced a trap composed of 52 places in 129 ms of which 0 ms to minimize.
[2021-05-11 20:42:53] [INFO ] Deduced a trap composed of 20 places in 138 ms of which 5 ms to minimize.
[2021-05-11 20:42:53] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 0 ms to minimize.
[2021-05-11 20:42:54] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 0 ms to minimize.
[2021-05-11 20:42:54] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 0 ms to minimize.
[2021-05-11 20:42:54] [INFO ] Deduced a trap composed of 134 places in 135 ms of which 1 ms to minimize.
[2021-05-11 20:42:54] [INFO ] Deduced a trap composed of 136 places in 102 ms of which 0 ms to minimize.
[2021-05-11 20:42:54] [INFO ] Deduced a trap composed of 44 places in 115 ms of which 0 ms to minimize.
[2021-05-11 20:42:54] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 1 ms to minimize.
[2021-05-11 20:42:54] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 1 ms to minimize.
[2021-05-11 20:42:54] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 0 ms to minimize.
[2021-05-11 20:42:55] [INFO ] Deduced a trap composed of 44 places in 98 ms of which 2 ms to minimize.
[2021-05-11 20:42:55] [INFO ] Deduced a trap composed of 135 places in 105 ms of which 1 ms to minimize.
[2021-05-11 20:42:55] [INFO ] Deduced a trap composed of 135 places in 105 ms of which 3 ms to minimize.
[2021-05-11 20:42:55] [INFO ] Deduced a trap composed of 138 places in 100 ms of which 1 ms to minimize.
[2021-05-11 20:42:55] [INFO ] Deduced a trap composed of 128 places in 104 ms of which 0 ms to minimize.
[2021-05-11 20:42:55] [INFO ] Deduced a trap composed of 146 places in 100 ms of which 0 ms to minimize.
[2021-05-11 20:42:55] [INFO ] Deduced a trap composed of 147 places in 98 ms of which 1 ms to minimize.
[2021-05-11 20:42:55] [INFO ] Deduced a trap composed of 147 places in 101 ms of which 0 ms to minimize.
[2021-05-11 20:42:56] [INFO ] Deduced a trap composed of 164 places in 101 ms of which 0 ms to minimize.
[2021-05-11 20:42:56] [INFO ] Deduced a trap composed of 143 places in 100 ms of which 1 ms to minimize.
[2021-05-11 20:42:56] [INFO ] Deduced a trap composed of 138 places in 98 ms of which 1 ms to minimize.
[2021-05-11 20:42:56] [INFO ] Deduced a trap composed of 147 places in 104 ms of which 0 ms to minimize.
[2021-05-11 20:42:56] [INFO ] Deduced a trap composed of 136 places in 98 ms of which 1 ms to minimize.
[2021-05-11 20:42:56] [INFO ] Deduced a trap composed of 146 places in 133 ms of which 1 ms to minimize.
[2021-05-11 20:42:56] [INFO ] Deduced a trap composed of 152 places in 132 ms of which 10 ms to minimize.
[2021-05-11 20:42:56] [INFO ] Deduced a trap composed of 131 places in 104 ms of which 1 ms to minimize.
[2021-05-11 20:42:57] [INFO ] Deduced a trap composed of 158 places in 99 ms of which 0 ms to minimize.
[2021-05-11 20:42:57] [INFO ] Deduced a trap composed of 141 places in 107 ms of which 0 ms to minimize.
[2021-05-11 20:42:57] [INFO ] Deduced a trap composed of 147 places in 100 ms of which 1 ms to minimize.
[2021-05-11 20:42:57] [INFO ] Deduced a trap composed of 137 places in 97 ms of which 0 ms to minimize.
[2021-05-11 20:42:57] [INFO ] Deduced a trap composed of 131 places in 100 ms of which 0 ms to minimize.
[2021-05-11 20:42:57] [INFO ] Deduced a trap composed of 128 places in 99 ms of which 0 ms to minimize.
[2021-05-11 20:42:57] [INFO ] Trap strengthening (SAT) tested/added 41/40 trap constraints in 5414 ms
[2021-05-11 20:42:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:42:57] [INFO ] [Nat]Absence check using 61 positive place invariants in 16 ms returned sat
[2021-05-11 20:42:57] [INFO ] [Nat]Absence check using 61 positive and 44 generalized place invariants in 11 ms returned sat
[2021-05-11 20:42:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 20:42:57] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
[2021-05-11 20:42:58] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 0 ms to minimize.
[2021-05-11 20:42:58] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 0 ms to minimize.
[2021-05-11 20:42:58] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 1 ms to minimize.
[2021-05-11 20:42:58] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 1 ms to minimize.
[2021-05-11 20:42:58] [INFO ] Deduced a trap composed of 49 places in 104 ms of which 1 ms to minimize.
[2021-05-11 20:42:58] [INFO ] Deduced a trap composed of 52 places in 98 ms of which 1 ms to minimize.
[2021-05-11 20:42:58] [INFO ] Deduced a trap composed of 172 places in 96 ms of which 1 ms to minimize.
[2021-05-11 20:42:58] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 909 ms
[2021-05-11 20:42:58] [INFO ] Computed and/alt/rep : 508/848/508 causal constraints (skipped 37 transitions) in 24 ms.
[2021-05-11 20:43:00] [INFO ] Added : 345 causal constraints over 69 iterations in 1717 ms. Result :sat
[2021-05-11 20:43:00] [INFO ] [Real]Absence check using 61 positive place invariants in 16 ms returned sat
[2021-05-11 20:43:00] [INFO ] [Real]Absence check using 61 positive and 44 generalized place invariants in 21 ms returned sat
[2021-05-11 20:43:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:43:00] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2021-05-11 20:43:01] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 1 ms to minimize.
[2021-05-11 20:43:01] [INFO ] Deduced a trap composed of 19 places in 159 ms of which 0 ms to minimize.
[2021-05-11 20:43:01] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 0 ms to minimize.
[2021-05-11 20:43:01] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 0 ms to minimize.
[2021-05-11 20:43:01] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 1 ms to minimize.
[2021-05-11 20:43:01] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 1 ms to minimize.
[2021-05-11 20:43:01] [INFO ] Deduced a trap composed of 120 places in 94 ms of which 1 ms to minimize.
[2021-05-11 20:43:01] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 0 ms to minimize.
[2021-05-11 20:43:01] [INFO ] Deduced a trap composed of 56 places in 99 ms of which 1 ms to minimize.
[2021-05-11 20:43:02] [INFO ] Deduced a trap composed of 75 places in 83 ms of which 0 ms to minimize.
[2021-05-11 20:43:02] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 0 ms to minimize.
[2021-05-11 20:43:02] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 0 ms to minimize.
[2021-05-11 20:43:02] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 0 ms to minimize.
[2021-05-11 20:43:02] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 0 ms to minimize.
[2021-05-11 20:43:02] [INFO ] Deduced a trap composed of 52 places in 52 ms of which 1 ms to minimize.
[2021-05-11 20:43:02] [INFO ] Deduced a trap composed of 54 places in 52 ms of which 0 ms to minimize.
[2021-05-11 20:43:02] [INFO ] Deduced a trap composed of 26 places in 152 ms of which 0 ms to minimize.
[2021-05-11 20:43:02] [INFO ] Deduced a trap composed of 70 places in 58 ms of which 1 ms to minimize.
[2021-05-11 20:43:02] [INFO ] Deduced a trap composed of 77 places in 73 ms of which 0 ms to minimize.
[2021-05-11 20:43:02] [INFO ] Deduced a trap composed of 34 places in 25 ms of which 0 ms to minimize.
[2021-05-11 20:43:02] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2050 ms
[2021-05-11 20:43:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:43:03] [INFO ] [Nat]Absence check using 61 positive place invariants in 22 ms returned sat
[2021-05-11 20:43:03] [INFO ] [Nat]Absence check using 61 positive and 44 generalized place invariants in 16 ms returned sat
[2021-05-11 20:43:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 20:43:03] [INFO ] [Nat]Absence check using state equation in 217 ms returned sat
[2021-05-11 20:43:03] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 0 ms to minimize.
[2021-05-11 20:43:03] [INFO ] Deduced a trap composed of 126 places in 104 ms of which 0 ms to minimize.
[2021-05-11 20:43:03] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 0 ms to minimize.
[2021-05-11 20:43:03] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 0 ms to minimize.
[2021-05-11 20:43:03] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 0 ms to minimize.
[2021-05-11 20:43:03] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 0 ms to minimize.
[2021-05-11 20:43:04] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 0 ms to minimize.
[2021-05-11 20:43:04] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 0 ms to minimize.
[2021-05-11 20:43:04] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 1 ms to minimize.
[2021-05-11 20:43:04] [INFO ] Deduced a trap composed of 117 places in 94 ms of which 0 ms to minimize.
[2021-05-11 20:43:04] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2021-05-11 20:43:04] [INFO ] Deduced a trap composed of 129 places in 89 ms of which 0 ms to minimize.
[2021-05-11 20:43:04] [INFO ] Deduced a trap composed of 118 places in 85 ms of which 0 ms to minimize.
[2021-05-11 20:43:04] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 0 ms to minimize.
[2021-05-11 20:43:04] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 1 ms to minimize.
[2021-05-11 20:43:05] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 0 ms to minimize.
[2021-05-11 20:43:05] [INFO ] Deduced a trap composed of 127 places in 88 ms of which 0 ms to minimize.
[2021-05-11 20:43:05] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 1 ms to minimize.
[2021-05-11 20:43:05] [INFO ] Deduced a trap composed of 42 places in 95 ms of which 1 ms to minimize.
[2021-05-11 20:43:05] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 0 ms to minimize.
[2021-05-11 20:43:05] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 0 ms to minimize.
[2021-05-11 20:43:05] [INFO ] Deduced a trap composed of 50 places in 103 ms of which 0 ms to minimize.
[2021-05-11 20:43:05] [INFO ] Deduced a trap composed of 120 places in 94 ms of which 0 ms to minimize.
[2021-05-11 20:43:05] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 0 ms to minimize.
[2021-05-11 20:43:06] [INFO ] Deduced a trap composed of 134 places in 106 ms of which 1 ms to minimize.
[2021-05-11 20:43:06] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 1 ms to minimize.
[2021-05-11 20:43:06] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 1 ms to minimize.
[2021-05-11 20:43:06] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 1 ms to minimize.
[2021-05-11 20:43:06] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 0 ms to minimize.
[2021-05-11 20:43:06] [INFO ] Deduced a trap composed of 119 places in 80 ms of which 1 ms to minimize.
[2021-05-11 20:43:06] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 1 ms to minimize.
[2021-05-11 20:43:06] [INFO ] Deduced a trap composed of 131 places in 85 ms of which 0 ms to minimize.
[2021-05-11 20:43:06] [INFO ] Deduced a trap composed of 140 places in 82 ms of which 0 ms to minimize.
[2021-05-11 20:43:07] [INFO ] Deduced a trap composed of 139 places in 81 ms of which 1 ms to minimize.
[2021-05-11 20:43:07] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 0 ms to minimize.
[2021-05-11 20:43:07] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2021-05-11 20:43:07] [INFO ] Deduced a trap composed of 133 places in 92 ms of which 0 ms to minimize.
[2021-05-11 20:43:07] [INFO ] Deduced a trap composed of 137 places in 120 ms of which 1 ms to minimize.
[2021-05-11 20:43:07] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 0 ms to minimize.
[2021-05-11 20:43:07] [INFO ] Deduced a trap composed of 133 places in 85 ms of which 0 ms to minimize.
[2021-05-11 20:43:07] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 1 ms to minimize.
[2021-05-11 20:43:07] [INFO ] Deduced a trap composed of 123 places in 82 ms of which 0 ms to minimize.
[2021-05-11 20:43:07] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 0 ms to minimize.
[2021-05-11 20:43:08] [INFO ] Deduced a trap composed of 46 places in 78 ms of which 0 ms to minimize.
[2021-05-11 20:43:08] [INFO ] Deduced a trap composed of 130 places in 83 ms of which 0 ms to minimize.
[2021-05-11 20:43:08] [INFO ] Deduced a trap composed of 111 places in 82 ms of which 1 ms to minimize.
[2021-05-11 20:43:08] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 0 ms to minimize.
[2021-05-11 20:43:08] [INFO ] Deduced a trap composed of 126 places in 82 ms of which 1 ms to minimize.
[2021-05-11 20:43:08] [INFO ] Deduced a trap composed of 131 places in 81 ms of which 1 ms to minimize.
[2021-05-11 20:43:08] [INFO ] Deduced a trap composed of 141 places in 83 ms of which 0 ms to minimize.
[2021-05-11 20:43:08] [INFO ] Deduced a trap composed of 143 places in 83 ms of which 1 ms to minimize.
[2021-05-11 20:43:08] [INFO ] Deduced a trap composed of 136 places in 95 ms of which 0 ms to minimize.
[2021-05-11 20:43:09] [INFO ] Deduced a trap composed of 141 places in 121 ms of which 0 ms to minimize.
[2021-05-11 20:43:09] [INFO ] Deduced a trap composed of 52 places in 97 ms of which 1 ms to minimize.
[2021-05-11 20:43:09] [INFO ] Deduced a trap composed of 131 places in 95 ms of which 1 ms to minimize.
[2021-05-11 20:43:09] [INFO ] Deduced a trap composed of 142 places in 101 ms of which 0 ms to minimize.
[2021-05-11 20:43:09] [INFO ] Deduced a trap composed of 137 places in 93 ms of which 0 ms to minimize.
[2021-05-11 20:43:09] [INFO ] Deduced a trap composed of 143 places in 95 ms of which 0 ms to minimize.
[2021-05-11 20:43:09] [INFO ] Deduced a trap composed of 143 places in 100 ms of which 0 ms to minimize.
[2021-05-11 20:43:09] [INFO ] Deduced a trap composed of 138 places in 103 ms of which 0 ms to minimize.
[2021-05-11 20:43:10] [INFO ] Deduced a trap composed of 138 places in 96 ms of which 0 ms to minimize.
[2021-05-11 20:43:10] [INFO ] Deduced a trap composed of 150 places in 96 ms of which 0 ms to minimize.
[2021-05-11 20:43:10] [INFO ] Deduced a trap composed of 143 places in 103 ms of which 0 ms to minimize.
[2021-05-11 20:43:10] [INFO ] Deduced a trap composed of 146 places in 100 ms of which 1 ms to minimize.
[2021-05-11 20:43:10] [INFO ] Deduced a trap composed of 157 places in 96 ms of which 0 ms to minimize.
[2021-05-11 20:43:10] [INFO ] Deduced a trap composed of 142 places in 95 ms of which 0 ms to minimize.
[2021-05-11 20:43:10] [INFO ] Deduced a trap composed of 136 places in 108 ms of which 0 ms to minimize.
[2021-05-11 20:43:10] [INFO ] Deduced a trap composed of 143 places in 96 ms of which 0 ms to minimize.
[2021-05-11 20:43:11] [INFO ] Deduced a trap composed of 149 places in 94 ms of which 0 ms to minimize.
[2021-05-11 20:43:11] [INFO ] Deduced a trap composed of 138 places in 95 ms of which 1 ms to minimize.
[2021-05-11 20:43:11] [INFO ] Deduced a trap composed of 131 places in 91 ms of which 1 ms to minimize.
[2021-05-11 20:43:11] [INFO ] Deduced a trap composed of 148 places in 91 ms of which 1 ms to minimize.
[2021-05-11 20:43:11] [INFO ] Deduced a trap composed of 138 places in 89 ms of which 1 ms to minimize.
[2021-05-11 20:43:11] [INFO ] Deduced a trap composed of 154 places in 95 ms of which 1 ms to minimize.
[2021-05-11 20:43:11] [INFO ] Deduced a trap composed of 144 places in 109 ms of which 1 ms to minimize.
[2021-05-11 20:43:11] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 1 ms to minimize.
[2021-05-11 20:43:11] [INFO ] Deduced a trap composed of 138 places in 96 ms of which 1 ms to minimize.
[2021-05-11 20:43:12] [INFO ] Deduced a trap composed of 137 places in 97 ms of which 0 ms to minimize.
[2021-05-11 20:43:12] [INFO ] Deduced a trap composed of 160 places in 109 ms of which 0 ms to minimize.
[2021-05-11 20:43:12] [INFO ] Deduced a trap composed of 147 places in 115 ms of which 1 ms to minimize.
[2021-05-11 20:43:12] [INFO ] Deduced a trap composed of 145 places in 103 ms of which 0 ms to minimize.
[2021-05-11 20:43:12] [INFO ] Deduced a trap composed of 135 places in 94 ms of which 0 ms to minimize.
[2021-05-11 20:43:12] [INFO ] Trap strengthening (SAT) tested/added 83/82 trap constraints in 9361 ms
[2021-05-11 20:43:12] [INFO ] Computed and/alt/rep : 508/848/508 causal constraints (skipped 37 transitions) in 54 ms.
[2021-05-11 20:43:15] [INFO ] Deduced a trap composed of 134 places in 129 ms of which 1 ms to minimize.
[2021-05-11 20:43:15] [INFO ] Deduced a trap composed of 136 places in 121 ms of which 1 ms to minimize.
[2021-05-11 20:43:15] [INFO ] Deduced a trap composed of 128 places in 128 ms of which 0 ms to minimize.
[2021-05-11 20:43:15] [INFO ] Deduced a trap composed of 133 places in 110 ms of which 1 ms to minimize.
[2021-05-11 20:43:16] [INFO ] Deduced a trap composed of 145 places in 157 ms of which 0 ms to minimize.
[2021-05-11 20:43:16] [INFO ] Deduced a trap composed of 140 places in 118 ms of which 1 ms to minimize.
[2021-05-11 20:43:16] [INFO ] Deduced a trap composed of 142 places in 86 ms of which 1 ms to minimize.
[2021-05-11 20:43:16] [INFO ] Deduced a trap composed of 136 places in 135 ms of which 0 ms to minimize.
[2021-05-11 20:43:16] [INFO ] Deduced a trap composed of 136 places in 130 ms of which 1 ms to minimize.
[2021-05-11 20:43:16] [INFO ] Deduced a trap composed of 128 places in 144 ms of which 0 ms to minimize.
[2021-05-11 20:43:17] [INFO ] Deduced a trap composed of 130 places in 107 ms of which 0 ms to minimize.
[2021-05-11 20:43:17] [INFO ] Deduced a trap composed of 148 places in 107 ms of which 0 ms to minimize.
[2021-05-11 20:43:17] [INFO ] Deduced a trap composed of 133 places in 117 ms of which 1 ms to minimize.
[2021-05-11 20:43:17] [INFO ] Deduced a trap composed of 136 places in 113 ms of which 0 ms to minimize.
[2021-05-11 20:43:17] [INFO ] Deduced a trap composed of 148 places in 122 ms of which 0 ms to minimize.
[2021-05-11 20:43:17] [INFO ] Deduced a trap composed of 145 places in 135 ms of which 1 ms to minimize.
[2021-05-11 20:43:18] [INFO ] Deduced a trap composed of 143 places in 137 ms of which 0 ms to minimize.
[2021-05-11 20:43:18] [INFO ] Deduced a trap composed of 143 places in 142 ms of which 1 ms to minimize.
[2021-05-11 20:43:18] [INFO ] Deduced a trap composed of 145 places in 99 ms of which 0 ms to minimize.
[2021-05-11 20:43:18] [INFO ] Deduced a trap composed of 149 places in 150 ms of which 0 ms to minimize.
[2021-05-11 20:43:18] [INFO ] Deduced a trap composed of 139 places in 138 ms of which 1 ms to minimize.
[2021-05-11 20:43:19] [INFO ] Deduced a trap composed of 143 places in 134 ms of which 0 ms to minimize.
[2021-05-11 20:43:19] [INFO ] Deduced a trap composed of 114 places in 152 ms of which 0 ms to minimize.
[2021-05-11 20:43:19] [INFO ] Deduced a trap composed of 110 places in 146 ms of which 1 ms to minimize.
[2021-05-11 20:43:20] [INFO ] Deduced a trap composed of 134 places in 124 ms of which 0 ms to minimize.
[2021-05-11 20:43:20] [INFO ] Deduced a trap composed of 127 places in 118 ms of which 1 ms to minimize.
[2021-05-11 20:43:20] [INFO ] Deduced a trap composed of 142 places in 143 ms of which 0 ms to minimize.
[2021-05-11 20:43:20] [INFO ] Deduced a trap composed of 127 places in 112 ms of which 1 ms to minimize.
[2021-05-11 20:43:20] [INFO ] Deduced a trap composed of 134 places in 97 ms of which 1 ms to minimize.
[2021-05-11 20:43:20] [INFO ] Deduced a trap composed of 128 places in 137 ms of which 1 ms to minimize.
[2021-05-11 20:43:21] [INFO ] Deduced a trap composed of 127 places in 103 ms of which 0 ms to minimize.
[2021-05-11 20:43:21] [INFO ] Deduced a trap composed of 138 places in 92 ms of which 0 ms to minimize.
[2021-05-11 20:43:21] [INFO ] Deduced a trap composed of 142 places in 106 ms of which 0 ms to minimize.
[2021-05-11 20:43:21] [INFO ] Deduced a trap composed of 134 places in 105 ms of which 0 ms to minimize.
[2021-05-11 20:43:21] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 6654 ms
[2021-05-11 20:43:21] [INFO ] Added : 377 causal constraints over 77 iterations in 9235 ms. Result :sat
[2021-05-11 20:43:21] [INFO ] [Real]Absence check using 61 positive place invariants in 17 ms returned sat
[2021-05-11 20:43:21] [INFO ] [Real]Absence check using 61 positive and 44 generalized place invariants in 14 ms returned sat
[2021-05-11 20:43:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:43:22] [INFO ] [Real]Absence check using state equation in 217 ms returned sat
[2021-05-11 20:43:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:43:22] [INFO ] [Nat]Absence check using 61 positive place invariants in 19 ms returned sat
[2021-05-11 20:43:22] [INFO ] [Nat]Absence check using 61 positive and 44 generalized place invariants in 20 ms returned sat
[2021-05-11 20:43:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 20:43:22] [INFO ] [Nat]Absence check using state equation in 244 ms returned sat
[2021-05-11 20:43:22] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 2 ms to minimize.
[2021-05-11 20:43:22] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2021-05-11 20:43:22] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 0 ms to minimize.
[2021-05-11 20:43:22] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 0 ms to minimize.
[2021-05-11 20:43:22] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 0 ms to minimize.
[2021-05-11 20:43:22] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 0 ms to minimize.
[2021-05-11 20:43:23] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 0 ms to minimize.
[2021-05-11 20:43:23] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 0 ms to minimize.
[2021-05-11 20:43:23] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 0 ms to minimize.
[2021-05-11 20:43:23] [INFO ] Deduced a trap composed of 62 places in 56 ms of which 0 ms to minimize.
[2021-05-11 20:43:23] [INFO ] Deduced a trap composed of 32 places in 25 ms of which 1 ms to minimize.
[2021-05-11 20:43:23] [INFO ] Deduced a trap composed of 43 places in 27 ms of which 1 ms to minimize.
[2021-05-11 20:43:23] [INFO ] Deduced a trap composed of 34 places in 13 ms of which 0 ms to minimize.
[2021-05-11 20:43:23] [INFO ] Deduced a trap composed of 66 places in 42 ms of which 0 ms to minimize.
[2021-05-11 20:43:23] [INFO ] Deduced a trap composed of 55 places in 41 ms of which 0 ms to minimize.
[2021-05-11 20:43:23] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1014 ms
[2021-05-11 20:43:23] [INFO ] Computed and/alt/rep : 508/848/508 causal constraints (skipped 37 transitions) in 26 ms.
[2021-05-11 20:43:25] [INFO ] Deduced a trap composed of 127 places in 100 ms of which 0 ms to minimize.
[2021-05-11 20:43:25] [INFO ] Deduced a trap composed of 139 places in 121 ms of which 2 ms to minimize.
[2021-05-11 20:43:25] [INFO ] Deduced a trap composed of 129 places in 106 ms of which 1 ms to minimize.
[2021-05-11 20:43:25] [INFO ] Deduced a trap composed of 135 places in 124 ms of which 0 ms to minimize.
[2021-05-11 20:43:26] [INFO ] Deduced a trap composed of 144 places in 109 ms of which 0 ms to minimize.
[2021-05-11 20:43:26] [INFO ] Deduced a trap composed of 149 places in 110 ms of which 0 ms to minimize.
[2021-05-11 20:43:26] [INFO ] Deduced a trap composed of 130 places in 96 ms of which 1 ms to minimize.
[2021-05-11 20:43:26] [INFO ] Deduced a trap composed of 134 places in 97 ms of which 1 ms to minimize.
[2021-05-11 20:43:26] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1204 ms
[2021-05-11 20:43:26] [INFO ] Added : 357 causal constraints over 72 iterations in 3092 ms. Result :sat
[2021-05-11 20:43:26] [INFO ] [Real]Absence check using 61 positive place invariants in 15 ms returned sat
[2021-05-11 20:43:26] [INFO ] [Real]Absence check using 61 positive and 44 generalized place invariants in 12 ms returned sat
[2021-05-11 20:43:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:43:26] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2021-05-11 20:43:27] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 0 ms to minimize.
[2021-05-11 20:43:27] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 3 ms to minimize.
[2021-05-11 20:43:27] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 0 ms to minimize.
[2021-05-11 20:43:27] [INFO ] Deduced a trap composed of 117 places in 98 ms of which 0 ms to minimize.
[2021-05-11 20:43:27] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 1 ms to minimize.
[2021-05-11 20:43:27] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 0 ms to minimize.
[2021-05-11 20:43:27] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 0 ms to minimize.
[2021-05-11 20:43:27] [INFO ] Deduced a trap composed of 8 places in 97 ms of which 0 ms to minimize.
[2021-05-11 20:43:27] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 0 ms to minimize.
[2021-05-11 20:43:28] [INFO ] Deduced a trap composed of 139 places in 94 ms of which 1 ms to minimize.
[2021-05-11 20:43:28] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 0 ms to minimize.
[2021-05-11 20:43:28] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 0 ms to minimize.
[2021-05-11 20:43:28] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 0 ms to minimize.
[2021-05-11 20:43:28] [INFO ] Deduced a trap composed of 120 places in 97 ms of which 1 ms to minimize.
[2021-05-11 20:43:28] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 1 ms to minimize.
[2021-05-11 20:43:28] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 1 ms to minimize.
[2021-05-11 20:43:28] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 1 ms to minimize.
[2021-05-11 20:43:28] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 0 ms to minimize.
[2021-05-11 20:43:29] [INFO ] Deduced a trap composed of 127 places in 93 ms of which 1 ms to minimize.
[2021-05-11 20:43:29] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 0 ms to minimize.
[2021-05-11 20:43:29] [INFO ] Deduced a trap composed of 122 places in 89 ms of which 0 ms to minimize.
[2021-05-11 20:43:29] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 0 ms to minimize.
[2021-05-11 20:43:29] [INFO ] Deduced a trap composed of 40 places in 91 ms of which 0 ms to minimize.
[2021-05-11 20:43:29] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 0 ms to minimize.
[2021-05-11 20:43:29] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 0 ms to minimize.
[2021-05-11 20:43:29] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 1 ms to minimize.
[2021-05-11 20:43:29] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 0 ms to minimize.
[2021-05-11 20:43:30] [INFO ] Deduced a trap composed of 35 places in 89 ms of which 0 ms to minimize.
[2021-05-11 20:43:30] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 1 ms to minimize.
[2021-05-11 20:43:30] [INFO ] Deduced a trap composed of 123 places in 89 ms of which 1 ms to minimize.
[2021-05-11 20:43:30] [INFO ] Deduced a trap composed of 117 places in 90 ms of which 1 ms to minimize.
[2021-05-11 20:43:30] [INFO ] Deduced a trap composed of 133 places in 88 ms of which 1 ms to minimize.
[2021-05-11 20:43:30] [INFO ] Deduced a trap composed of 118 places in 86 ms of which 1 ms to minimize.
[2021-05-11 20:43:30] [INFO ] Deduced a trap composed of 139 places in 95 ms of which 0 ms to minimize.
[2021-05-11 20:43:30] [INFO ] Deduced a trap composed of 119 places in 91 ms of which 1 ms to minimize.
[2021-05-11 20:43:30] [INFO ] Deduced a trap composed of 136 places in 90 ms of which 1 ms to minimize.
[2021-05-11 20:43:31] [INFO ] Deduced a trap composed of 137 places in 91 ms of which 1 ms to minimize.
[2021-05-11 20:43:31] [INFO ] Deduced a trap composed of 142 places in 93 ms of which 1 ms to minimize.
[2021-05-11 20:43:31] [INFO ] Deduced a trap composed of 137 places in 94 ms of which 0 ms to minimize.
[2021-05-11 20:43:31] [INFO ] Deduced a trap composed of 148 places in 106 ms of which 1 ms to minimize.
[2021-05-11 20:43:31] [INFO ] Deduced a trap composed of 130 places in 92 ms of which 0 ms to minimize.
[2021-05-11 20:43:31] [INFO ] Deduced a trap composed of 139 places in 89 ms of which 0 ms to minimize.
[2021-05-11 20:43:31] [INFO ] Deduced a trap composed of 140 places in 88 ms of which 1 ms to minimize.
[2021-05-11 20:43:31] [INFO ] Deduced a trap composed of 125 places in 101 ms of which 0 ms to minimize.
[2021-05-11 20:43:31] [INFO ] Deduced a trap composed of 154 places in 86 ms of which 0 ms to minimize.
[2021-05-11 20:43:32] [INFO ] Deduced a trap composed of 130 places in 85 ms of which 1 ms to minimize.
[2021-05-11 20:43:32] [INFO ] Deduced a trap composed of 132 places in 92 ms of which 1 ms to minimize.
[2021-05-11 20:43:32] [INFO ] Deduced a trap composed of 125 places in 95 ms of which 0 ms to minimize.
[2021-05-11 20:43:32] [INFO ] Deduced a trap composed of 116 places in 84 ms of which 1 ms to minimize.
[2021-05-11 20:43:32] [INFO ] Deduced a trap composed of 114 places in 84 ms of which 0 ms to minimize.
[2021-05-11 20:43:32] [INFO ] Deduced a trap composed of 116 places in 88 ms of which 0 ms to minimize.
[2021-05-11 20:43:32] [INFO ] Deduced a trap composed of 120 places in 84 ms of which 1 ms to minimize.
[2021-05-11 20:43:32] [INFO ] Deduced a trap composed of 137 places in 87 ms of which 0 ms to minimize.
[2021-05-11 20:43:32] [INFO ] Deduced a trap composed of 154 places in 90 ms of which 0 ms to minimize.
[2021-05-11 20:43:33] [INFO ] Deduced a trap composed of 143 places in 85 ms of which 1 ms to minimize.
[2021-05-11 20:43:33] [INFO ] Deduced a trap composed of 135 places in 85 ms of which 1 ms to minimize.
[2021-05-11 20:43:33] [INFO ] Deduced a trap composed of 130 places in 83 ms of which 1 ms to minimize.
[2021-05-11 20:43:33] [INFO ] Deduced a trap composed of 136 places in 88 ms of which 0 ms to minimize.
[2021-05-11 20:43:33] [INFO ] Deduced a trap composed of 141 places in 84 ms of which 0 ms to minimize.
[2021-05-11 20:43:33] [INFO ] Deduced a trap composed of 142 places in 87 ms of which 0 ms to minimize.
[2021-05-11 20:43:33] [INFO ] Deduced a trap composed of 140 places in 82 ms of which 0 ms to minimize.
[2021-05-11 20:43:33] [INFO ] Deduced a trap composed of 127 places in 82 ms of which 0 ms to minimize.
[2021-05-11 20:43:33] [INFO ] Deduced a trap composed of 142 places in 85 ms of which 1 ms to minimize.
[2021-05-11 20:43:34] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 0 ms to minimize.
[2021-05-11 20:43:34] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 0 ms to minimize.
[2021-05-11 20:43:34] [INFO ] Deduced a trap composed of 136 places in 85 ms of which 0 ms to minimize.
[2021-05-11 20:43:34] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 1 ms to minimize.
[2021-05-11 20:43:34] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 1 ms to minimize.
[2021-05-11 20:43:34] [INFO ] Deduced a trap composed of 144 places in 84 ms of which 0 ms to minimize.
[2021-05-11 20:43:34] [INFO ] Deduced a trap composed of 149 places in 127 ms of which 1 ms to minimize.
[2021-05-11 20:43:34] [INFO ] Deduced a trap composed of 148 places in 84 ms of which 1 ms to minimize.
[2021-05-11 20:43:34] [INFO ] Deduced a trap composed of 130 places in 81 ms of which 0 ms to minimize.
[2021-05-11 20:43:35] [INFO ] Deduced a trap composed of 144 places in 94 ms of which 1 ms to minimize.
[2021-05-11 20:43:35] [INFO ] Deduced a trap composed of 146 places in 93 ms of which 0 ms to minimize.
[2021-05-11 20:43:35] [INFO ] Deduced a trap composed of 143 places in 107 ms of which 0 ms to minimize.
[2021-05-11 20:43:35] [INFO ] Deduced a trap composed of 133 places in 86 ms of which 0 ms to minimize.
[2021-05-11 20:43:35] [INFO ] Deduced a trap composed of 131 places in 86 ms of which 0 ms to minimize.
[2021-05-11 20:43:35] [INFO ] Deduced a trap composed of 119 places in 81 ms of which 1 ms to minimize.
[2021-05-11 20:43:35] [INFO ] Deduced a trap composed of 136 places in 97 ms of which 0 ms to minimize.
[2021-05-11 20:43:35] [INFO ] Deduced a trap composed of 115 places in 104 ms of which 0 ms to minimize.
[2021-05-11 20:43:35] [INFO ] Deduced a trap composed of 147 places in 90 ms of which 0 ms to minimize.
[2021-05-11 20:43:36] [INFO ] Deduced a trap composed of 135 places in 88 ms of which 1 ms to minimize.
[2021-05-11 20:43:36] [INFO ] Deduced a trap composed of 136 places in 85 ms of which 0 ms to minimize.
[2021-05-11 20:43:36] [INFO ] Deduced a trap composed of 130 places in 86 ms of which 1 ms to minimize.
[2021-05-11 20:43:36] [INFO ] Deduced a trap composed of 135 places in 87 ms of which 1 ms to minimize.
[2021-05-11 20:43:36] [INFO ] Deduced a trap composed of 124 places in 94 ms of which 1 ms to minimize.
[2021-05-11 20:43:36] [INFO ] Deduced a trap composed of 123 places in 86 ms of which 0 ms to minimize.
[2021-05-11 20:43:36] [INFO ] Deduced a trap composed of 126 places in 85 ms of which 1 ms to minimize.
[2021-05-11 20:43:36] [INFO ] Deduced a trap composed of 116 places in 84 ms of which 0 ms to minimize.
[2021-05-11 20:43:36] [INFO ] Deduced a trap composed of 138 places in 85 ms of which 0 ms to minimize.
[2021-05-11 20:43:37] [INFO ] Deduced a trap composed of 139 places in 86 ms of which 0 ms to minimize.
[2021-05-11 20:43:37] [INFO ] Deduced a trap composed of 136 places in 87 ms of which 0 ms to minimize.
[2021-05-11 20:43:37] [INFO ] Deduced a trap composed of 133 places in 87 ms of which 1 ms to minimize.
[2021-05-11 20:43:37] [INFO ] Deduced a trap composed of 150 places in 91 ms of which 1 ms to minimize.
[2021-05-11 20:43:37] [INFO ] Deduced a trap composed of 140 places in 85 ms of which 0 ms to minimize.
[2021-05-11 20:43:37] [INFO ] Deduced a trap composed of 134 places in 82 ms of which 0 ms to minimize.
[2021-05-11 20:43:37] [INFO ] Deduced a trap composed of 130 places in 84 ms of which 0 ms to minimize.
[2021-05-11 20:43:37] [INFO ] Deduced a trap composed of 151 places in 87 ms of which 0 ms to minimize.
[2021-05-11 20:43:37] [INFO ] Deduced a trap composed of 127 places in 85 ms of which 0 ms to minimize.
[2021-05-11 20:43:38] [INFO ] Deduced a trap composed of 129 places in 92 ms of which 1 ms to minimize.
[2021-05-11 20:43:38] [INFO ] Deduced a trap composed of 119 places in 87 ms of which 0 ms to minimize.
[2021-05-11 20:43:38] [INFO ] Deduced a trap composed of 134 places in 82 ms of which 0 ms to minimize.
[2021-05-11 20:43:38] [INFO ] Deduced a trap composed of 118 places in 79 ms of which 0 ms to minimize.
[2021-05-11 20:43:38] [INFO ] Deduced a trap composed of 143 places in 81 ms of which 1 ms to minimize.
[2021-05-11 20:43:38] [INFO ] Deduced a trap composed of 136 places in 84 ms of which 0 ms to minimize.
[2021-05-11 20:43:38] [INFO ] Deduced a trap composed of 138 places in 82 ms of which 0 ms to minimize.
[2021-05-11 20:43:38] [INFO ] Deduced a trap composed of 145 places in 85 ms of which 0 ms to minimize.
[2021-05-11 20:43:38] [INFO ] Deduced a trap composed of 42 places in 84 ms of which 0 ms to minimize.
[2021-05-11 20:43:38] [INFO ] Deduced a trap composed of 136 places in 90 ms of which 0 ms to minimize.
[2021-05-11 20:43:39] [INFO ] Deduced a trap composed of 136 places in 84 ms of which 1 ms to minimize.
[2021-05-11 20:43:39] [INFO ] Deduced a trap composed of 138 places in 89 ms of which 1 ms to minimize.
[2021-05-11 20:43:39] [INFO ] Deduced a trap composed of 139 places in 84 ms of which 1 ms to minimize.
[2021-05-11 20:43:39] [INFO ] Deduced a trap composed of 141 places in 92 ms of which 0 ms to minimize.
[2021-05-11 20:43:39] [INFO ] Deduced a trap composed of 126 places in 76 ms of which 0 ms to minimize.
[2021-05-11 20:43:39] [INFO ] Deduced a trap composed of 152 places in 79 ms of which 1 ms to minimize.
[2021-05-11 20:43:39] [INFO ] Deduced a trap composed of 141 places in 88 ms of which 1 ms to minimize.
[2021-05-11 20:43:39] [INFO ] Deduced a trap composed of 136 places in 79 ms of which 1 ms to minimize.
[2021-05-11 20:43:39] [INFO ] Deduced a trap composed of 139 places in 79 ms of which 1 ms to minimize.
[2021-05-11 20:43:39] [INFO ] Deduced a trap composed of 140 places in 84 ms of which 0 ms to minimize.
[2021-05-11 20:43:40] [INFO ] Deduced a trap composed of 130 places in 81 ms of which 1 ms to minimize.
[2021-05-11 20:43:40] [INFO ] Deduced a trap composed of 148 places in 79 ms of which 1 ms to minimize.
[2021-05-11 20:43:40] [INFO ] Deduced a trap composed of 140 places in 79 ms of which 0 ms to minimize.
[2021-05-11 20:43:40] [INFO ] Deduced a trap composed of 135 places in 80 ms of which 0 ms to minimize.
[2021-05-11 20:43:40] [INFO ] Deduced a trap composed of 143 places in 91 ms of which 1 ms to minimize.
[2021-05-11 20:43:40] [INFO ] Deduced a trap composed of 141 places in 83 ms of which 0 ms to minimize.
[2021-05-11 20:43:40] [INFO ] Deduced a trap composed of 139 places in 82 ms of which 0 ms to minimize.
[2021-05-11 20:43:40] [INFO ] Deduced a trap composed of 143 places in 80 ms of which 0 ms to minimize.
[2021-05-11 20:43:40] [INFO ] Deduced a trap composed of 138 places in 79 ms of which 0 ms to minimize.
[2021-05-11 20:43:41] [INFO ] Deduced a trap composed of 141 places in 79 ms of which 1 ms to minimize.
[2021-05-11 20:43:41] [INFO ] Deduced a trap composed of 135 places in 78 ms of which 0 ms to minimize.
[2021-05-11 20:43:41] [INFO ] Deduced a trap composed of 157 places in 76 ms of which 1 ms to minimize.
[2021-05-11 20:43:41] [INFO ] Deduced a trap composed of 129 places in 84 ms of which 0 ms to minimize.
[2021-05-11 20:43:41] [INFO ] Deduced a trap composed of 137 places in 85 ms of which 0 ms to minimize.
[2021-05-11 20:43:41] [INFO ] Deduced a trap composed of 114 places in 78 ms of which 1 ms to minimize.
[2021-05-11 20:43:41] [INFO ] Deduced a trap composed of 139 places in 77 ms of which 1 ms to minimize.
[2021-05-11 20:43:41] [INFO ] Deduced a trap composed of 128 places in 90 ms of which 0 ms to minimize.
[2021-05-11 20:43:41] [INFO ] Deduced a trap composed of 137 places in 80 ms of which 1 ms to minimize.
[2021-05-11 20:43:41] [INFO ] Deduced a trap composed of 147 places in 83 ms of which 1 ms to minimize.
[2021-05-11 20:43:42] [INFO ] Deduced a trap composed of 139 places in 107 ms of which 0 ms to minimize.
[2021-05-11 20:43:42] [INFO ] Deduced a trap composed of 128 places in 83 ms of which 0 ms to minimize.
[2021-05-11 20:43:42] [INFO ] Deduced a trap composed of 133 places in 78 ms of which 1 ms to minimize.
[2021-05-11 20:43:42] [INFO ] Deduced a trap composed of 144 places in 94 ms of which 0 ms to minimize.
[2021-05-11 20:43:42] [INFO ] Deduced a trap composed of 139 places in 79 ms of which 0 ms to minimize.
[2021-05-11 20:43:42] [INFO ] Deduced a trap composed of 138 places in 81 ms of which 0 ms to minimize.
[2021-05-11 20:43:42] [INFO ] Deduced a trap composed of 148 places in 94 ms of which 0 ms to minimize.
[2021-05-11 20:43:42] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 0 ms to minimize.
[2021-05-11 20:43:42] [INFO ] Deduced a trap composed of 141 places in 77 ms of which 0 ms to minimize.
[2021-05-11 20:43:43] [INFO ] Deduced a trap composed of 43 places in 78 ms of which 1 ms to minimize.
[2021-05-11 20:43:43] [INFO ] Deduced a trap composed of 159 places in 88 ms of which 0 ms to minimize.
[2021-05-11 20:43:43] [INFO ] Deduced a trap composed of 150 places in 75 ms of which 0 ms to minimize.
[2021-05-11 20:43:43] [INFO ] Deduced a trap composed of 145 places in 80 ms of which 1 ms to minimize.
[2021-05-11 20:43:43] [INFO ] Deduced a trap composed of 137 places in 76 ms of which 0 ms to minimize.
[2021-05-11 20:43:43] [INFO ] Deduced a trap composed of 135 places in 84 ms of which 0 ms to minimize.
[2021-05-11 20:43:43] [INFO ] Deduced a trap composed of 141 places in 84 ms of which 0 ms to minimize.
[2021-05-11 20:43:43] [INFO ] Deduced a trap composed of 130 places in 85 ms of which 1 ms to minimize.
[2021-05-11 20:43:43] [INFO ] Deduced a trap composed of 131 places in 84 ms of which 1 ms to minimize.
[2021-05-11 20:43:43] [INFO ] Deduced a trap composed of 149 places in 85 ms of which 1 ms to minimize.
[2021-05-11 20:43:44] [INFO ] Deduced a trap composed of 145 places in 91 ms of which 1 ms to minimize.
[2021-05-11 20:43:44] [INFO ] Deduced a trap composed of 146 places in 90 ms of which 0 ms to minimize.
[2021-05-11 20:43:44] [INFO ] Deduced a trap composed of 138 places in 90 ms of which 1 ms to minimize.
[2021-05-11 20:43:44] [INFO ] Deduced a trap composed of 137 places in 89 ms of which 0 ms to minimize.
[2021-05-11 20:43:44] [INFO ] Deduced a trap composed of 140 places in 90 ms of which 1 ms to minimize.
[2021-05-11 20:43:44] [INFO ] Deduced a trap composed of 133 places in 88 ms of which 1 ms to minimize.
[2021-05-11 20:43:44] [INFO ] Deduced a trap composed of 133 places in 86 ms of which 0 ms to minimize.
[2021-05-11 20:43:44] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 0 ms to minimize.
[2021-05-11 20:43:45] [INFO ] Deduced a trap composed of 142 places in 84 ms of which 0 ms to minimize.
[2021-05-11 20:43:45] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 0 ms to minimize.
[2021-05-11 20:43:45] [INFO ] Deduced a trap composed of 131 places in 89 ms of which 0 ms to minimize.
[2021-05-11 20:43:45] [INFO ] Deduced a trap composed of 129 places in 118 ms of which 0 ms to minimize.
[2021-05-11 20:43:45] [INFO ] Deduced a trap composed of 140 places in 93 ms of which 1 ms to minimize.
[2021-05-11 20:43:45] [INFO ] Deduced a trap composed of 134 places in 86 ms of which 0 ms to minimize.
[2021-05-11 20:43:45] [INFO ] Deduced a trap composed of 132 places in 86 ms of which 1 ms to minimize.
[2021-05-11 20:43:45] [INFO ] Deduced a trap composed of 135 places in 85 ms of which 0 ms to minimize.
[2021-05-11 20:43:45] [INFO ] Deduced a trap composed of 123 places in 86 ms of which 1 ms to minimize.
[2021-05-11 20:43:46] [INFO ] Deduced a trap composed of 135 places in 85 ms of which 0 ms to minimize.
[2021-05-11 20:43:46] [INFO ] Deduced a trap composed of 114 places in 127 ms of which 0 ms to minimize.
[2021-05-11 20:43:46] [INFO ] Deduced a trap composed of 118 places in 92 ms of which 0 ms to minimize.
[2021-05-11 20:43:46] [INFO ] Deduced a trap composed of 135 places in 90 ms of which 1 ms to minimize.
[2021-05-11 20:43:46] [INFO ] Deduced a trap composed of 151 places in 84 ms of which 1 ms to minimize.
[2021-05-11 20:43:46] [INFO ] Deduced a trap composed of 144 places in 138 ms of which 0 ms to minimize.
[2021-05-11 20:43:46] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
[2021-05-11 20:43:46] [INFO ] [Real]Absence check using 61 positive place invariants in 20 ms returned sat
[2021-05-11 20:43:46] [INFO ] [Real]Absence check using 61 positive and 44 generalized place invariants in 15 ms returned sat
[2021-05-11 20:43:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:43:47] [INFO ] [Real]Absence check using state equation in 262 ms returned sat
[2021-05-11 20:43:47] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2021-05-11 20:43:47] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 1 ms to minimize.
[2021-05-11 20:43:47] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 0 ms to minimize.
[2021-05-11 20:43:47] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 1 ms to minimize.
[2021-05-11 20:43:47] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 0 ms to minimize.
[2021-05-11 20:43:47] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2021-05-11 20:43:47] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 0 ms to minimize.
[2021-05-11 20:43:47] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 0 ms to minimize.
[2021-05-11 20:43:47] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 1 ms to minimize.
[2021-05-11 20:43:47] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 0 ms to minimize.
[2021-05-11 20:43:47] [INFO ] Deduced a trap composed of 42 places in 61 ms of which 0 ms to minimize.
[2021-05-11 20:43:47] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 1 ms to minimize.
[2021-05-11 20:43:48] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 0 ms to minimize.
[2021-05-11 20:43:48] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 0 ms to minimize.
[2021-05-11 20:43:48] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 1 ms to minimize.
[2021-05-11 20:43:48] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2021-05-11 20:43:48] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 0 ms to minimize.
[2021-05-11 20:43:48] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 0 ms to minimize.
[2021-05-11 20:43:48] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 0 ms to minimize.
[2021-05-11 20:43:48] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
[2021-05-11 20:43:48] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 0 ms to minimize.
[2021-05-11 20:43:48] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 0 ms to minimize.
[2021-05-11 20:43:48] [INFO ] Deduced a trap composed of 42 places in 56 ms of which 0 ms to minimize.
[2021-05-11 20:43:48] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 0 ms to minimize.
[2021-05-11 20:43:48] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 0 ms to minimize.
[2021-05-11 20:43:48] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 1918 ms
[2021-05-11 20:43:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:43:49] [INFO ] [Nat]Absence check using 61 positive place invariants in 18 ms returned sat
[2021-05-11 20:43:49] [INFO ] [Nat]Absence check using 61 positive and 44 generalized place invariants in 14 ms returned sat
[2021-05-11 20:43:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 20:43:49] [INFO ] [Nat]Absence check using state equation in 195 ms returned sat
[2021-05-11 20:43:49] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 0 ms to minimize.
[2021-05-11 20:43:49] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 1 ms to minimize.
[2021-05-11 20:43:49] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 0 ms to minimize.
[2021-05-11 20:43:49] [INFO ] Deduced a trap composed of 143 places in 130 ms of which 0 ms to minimize.
[2021-05-11 20:43:50] [INFO ] Deduced a trap composed of 20 places in 164 ms of which 1 ms to minimize.
[2021-05-11 20:43:50] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 1 ms to minimize.
[2021-05-11 20:43:50] [INFO ] Deduced a trap composed of 30 places in 163 ms of which 0 ms to minimize.
[2021-05-11 20:43:50] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 1 ms to minimize.
[2021-05-11 20:43:50] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 0 ms to minimize.
[2021-05-11 20:43:50] [INFO ] Deduced a trap composed of 29 places in 129 ms of which 1 ms to minimize.
[2021-05-11 20:43:50] [INFO ] Deduced a trap composed of 142 places in 113 ms of which 1 ms to minimize.
[2021-05-11 20:43:51] [INFO ] Deduced a trap composed of 148 places in 126 ms of which 1 ms to minimize.
[2021-05-11 20:43:51] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 0 ms to minimize.
[2021-05-11 20:43:51] [INFO ] Deduced a trap composed of 137 places in 104 ms of which 0 ms to minimize.
[2021-05-11 20:43:51] [INFO ] Deduced a trap composed of 31 places in 160 ms of which 0 ms to minimize.
[2021-05-11 20:43:51] [INFO ] Deduced a trap composed of 43 places in 157 ms of which 1 ms to minimize.
[2021-05-11 20:43:51] [INFO ] Deduced a trap composed of 42 places in 125 ms of which 1 ms to minimize.
[2021-05-11 20:43:51] [INFO ] Deduced a trap composed of 144 places in 108 ms of which 0 ms to minimize.
[2021-05-11 20:43:52] [INFO ] Deduced a trap composed of 145 places in 103 ms of which 0 ms to minimize.
[2021-05-11 20:43:52] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 0 ms to minimize.
[2021-05-11 20:43:52] [INFO ] Deduced a trap composed of 45 places in 114 ms of which 0 ms to minimize.
[2021-05-11 20:43:52] [INFO ] Deduced a trap composed of 40 places in 113 ms of which 0 ms to minimize.
[2021-05-11 20:43:52] [INFO ] Deduced a trap composed of 152 places in 103 ms of which 1 ms to minimize.
[2021-05-11 20:43:52] [INFO ] Deduced a trap composed of 47 places in 105 ms of which 1 ms to minimize.
[2021-05-11 20:43:52] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 1 ms to minimize.
[2021-05-11 20:43:52] [INFO ] Deduced a trap composed of 45 places in 104 ms of which 0 ms to minimize.
[2021-05-11 20:43:53] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 1 ms to minimize.
[2021-05-11 20:43:53] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 0 ms to minimize.
[2021-05-11 20:43:53] [INFO ] Deduced a trap composed of 41 places in 131 ms of which 1 ms to minimize.
[2021-05-11 20:43:53] [INFO ] Deduced a trap composed of 43 places in 97 ms of which 0 ms to minimize.
[2021-05-11 20:43:53] [INFO ] Deduced a trap composed of 42 places in 100 ms of which 0 ms to minimize.
[2021-05-11 20:43:53] [INFO ] Deduced a trap composed of 49 places in 102 ms of which 1 ms to minimize.
[2021-05-11 20:43:53] [INFO ] Deduced a trap composed of 70 places in 104 ms of which 1 ms to minimize.
[2021-05-11 20:43:53] [INFO ] Deduced a trap composed of 48 places in 108 ms of which 1 ms to minimize.
[2021-05-11 20:43:54] [INFO ] Deduced a trap composed of 42 places in 143 ms of which 1 ms to minimize.
[2021-05-11 20:43:54] [INFO ] Deduced a trap composed of 143 places in 106 ms of which 1 ms to minimize.
[2021-05-11 20:43:54] [INFO ] Deduced a trap composed of 142 places in 101 ms of which 1 ms to minimize.
[2021-05-11 20:43:54] [INFO ] Deduced a trap composed of 150 places in 140 ms of which 0 ms to minimize.
[2021-05-11 20:43:54] [INFO ] Deduced a trap composed of 38 places in 154 ms of which 1 ms to minimize.
[2021-05-11 20:43:54] [INFO ] Deduced a trap composed of 144 places in 128 ms of which 0 ms to minimize.
[2021-05-11 20:43:54] [INFO ] Deduced a trap composed of 130 places in 117 ms of which 0 ms to minimize.
[2021-05-11 20:43:55] [INFO ] Deduced a trap composed of 144 places in 169 ms of which 1 ms to minimize.
[2021-05-11 20:43:55] [INFO ] Deduced a trap composed of 134 places in 117 ms of which 0 ms to minimize.
[2021-05-11 20:43:55] [INFO ] Deduced a trap composed of 133 places in 133 ms of which 0 ms to minimize.
[2021-05-11 20:43:55] [INFO ] Deduced a trap composed of 139 places in 129 ms of which 0 ms to minimize.
[2021-05-11 20:43:55] [INFO ] Deduced a trap composed of 150 places in 112 ms of which 0 ms to minimize.
[2021-05-11 20:43:55] [INFO ] Deduced a trap composed of 154 places in 113 ms of which 0 ms to minimize.
[2021-05-11 20:43:55] [INFO ] Deduced a trap composed of 142 places in 105 ms of which 1 ms to minimize.
[2021-05-11 20:43:56] [INFO ] Deduced a trap composed of 131 places in 102 ms of which 1 ms to minimize.
[2021-05-11 20:43:56] [INFO ] Deduced a trap composed of 131 places in 123 ms of which 1 ms to minimize.
[2021-05-11 20:43:56] [INFO ] Deduced a trap composed of 144 places in 178 ms of which 0 ms to minimize.
[2021-05-11 20:43:56] [INFO ] Deduced a trap composed of 140 places in 120 ms of which 0 ms to minimize.
[2021-05-11 20:43:56] [INFO ] Deduced a trap composed of 141 places in 123 ms of which 1 ms to minimize.
[2021-05-11 20:43:56] [INFO ] Deduced a trap composed of 142 places in 116 ms of which 0 ms to minimize.
[2021-05-11 20:43:56] [INFO ] Deduced a trap composed of 34 places in 121 ms of which 1 ms to minimize.
[2021-05-11 20:43:57] [INFO ] Deduced a trap composed of 30 places in 153 ms of which 1 ms to minimize.
[2021-05-11 20:43:57] [INFO ] Deduced a trap composed of 54 places in 84 ms of which 0 ms to minimize.
[2021-05-11 20:43:57] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 1 ms to minimize.
[2021-05-11 20:43:57] [INFO ] Deduced a trap composed of 57 places in 63 ms of which 0 ms to minimize.
[2021-05-11 20:43:57] [INFO ] Deduced a trap composed of 60 places in 63 ms of which 0 ms to minimize.
[2021-05-11 20:43:57] [INFO ] Deduced a trap composed of 53 places in 99 ms of which 1 ms to minimize.
[2021-05-11 20:43:57] [INFO ] Deduced a trap composed of 63 places in 67 ms of which 0 ms to minimize.
[2021-05-11 20:43:57] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 0 ms to minimize.
[2021-05-11 20:43:57] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 0 ms to minimize.
[2021-05-11 20:43:58] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 0 ms to minimize.
[2021-05-11 20:43:58] [INFO ] Deduced a trap composed of 70 places in 69 ms of which 1 ms to minimize.
[2021-05-11 20:43:58] [INFO ] Trap strengthening (SAT) tested/added 67/66 trap constraints in 8862 ms
[2021-05-11 20:43:58] [INFO ] Computed and/alt/rep : 508/848/508 causal constraints (skipped 37 transitions) in 26 ms.
[2021-05-11 20:44:00] [INFO ] Deduced a trap composed of 138 places in 104 ms of which 0 ms to minimize.
[2021-05-11 20:44:00] [INFO ] Deduced a trap composed of 138 places in 108 ms of which 0 ms to minimize.
[2021-05-11 20:44:00] [INFO ] Deduced a trap composed of 136 places in 98 ms of which 1 ms to minimize.
[2021-05-11 20:44:00] [INFO ] Deduced a trap composed of 149 places in 89 ms of which 0 ms to minimize.
[2021-05-11 20:44:00] [INFO ] Deduced a trap composed of 145 places in 89 ms of which 0 ms to minimize.
[2021-05-11 20:44:01] [INFO ] Deduced a trap composed of 129 places in 86 ms of which 1 ms to minimize.
[2021-05-11 20:44:01] [INFO ] Deduced a trap composed of 140 places in 104 ms of which 1 ms to minimize.
[2021-05-11 20:44:01] [INFO ] Deduced a trap composed of 144 places in 103 ms of which 1 ms to minimize.
[2021-05-11 20:44:01] [INFO ] Deduced a trap composed of 149 places in 101 ms of which 1 ms to minimize.
[2021-05-11 20:44:01] [INFO ] Deduced a trap composed of 141 places in 95 ms of which 0 ms to minimize.
[2021-05-11 20:44:01] [INFO ] Deduced a trap composed of 147 places in 108 ms of which 0 ms to minimize.
[2021-05-11 20:44:01] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1630 ms
[2021-05-11 20:44:02] [INFO ] Added : 385 causal constraints over 77 iterations in 3941 ms. Result :sat
[2021-05-11 20:44:02] [INFO ] [Real]Absence check using 61 positive place invariants in 18 ms returned sat
[2021-05-11 20:44:02] [INFO ] [Real]Absence check using 61 positive and 44 generalized place invariants in 14 ms returned sat
[2021-05-11 20:44:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:44:02] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2021-05-11 20:44:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:44:02] [INFO ] [Nat]Absence check using 61 positive place invariants in 29 ms returned sat
[2021-05-11 20:44:02] [INFO ] [Nat]Absence check using 61 positive and 44 generalized place invariants in 11 ms returned sat
[2021-05-11 20:44:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 20:44:02] [INFO ] [Nat]Absence check using state equation in 184 ms returned sat
[2021-05-11 20:44:02] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 0 ms to minimize.
[2021-05-11 20:44:02] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 0 ms to minimize.
[2021-05-11 20:44:03] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 0 ms to minimize.
[2021-05-11 20:44:03] [INFO ] Deduced a trap composed of 134 places in 130 ms of which 0 ms to minimize.
[2021-05-11 20:44:03] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 0 ms to minimize.
[2021-05-11 20:44:03] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 1 ms to minimize.
[2021-05-11 20:44:03] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
[2021-05-11 20:44:03] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 1 ms to minimize.
[2021-05-11 20:44:03] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 0 ms to minimize.
[2021-05-11 20:44:03] [INFO ] Deduced a trap composed of 50 places in 129 ms of which 1 ms to minimize.
[2021-05-11 20:44:04] [INFO ] Deduced a trap composed of 75 places in 122 ms of which 0 ms to minimize.
[2021-05-11 20:44:04] [INFO ] Deduced a trap composed of 131 places in 124 ms of which 0 ms to minimize.
[2021-05-11 20:44:04] [INFO ] Deduced a trap composed of 140 places in 105 ms of which 1 ms to minimize.
[2021-05-11 20:44:04] [INFO ] Deduced a trap composed of 141 places in 107 ms of which 1 ms to minimize.
[2021-05-11 20:44:04] [INFO ] Deduced a trap composed of 136 places in 143 ms of which 0 ms to minimize.
[2021-05-11 20:44:04] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 0 ms to minimize.
[2021-05-11 20:44:04] [INFO ] Deduced a trap composed of 57 places in 49 ms of which 0 ms to minimize.
[2021-05-11 20:44:04] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2127 ms
[2021-05-11 20:44:04] [INFO ] Computed and/alt/rep : 508/848/508 causal constraints (skipped 37 transitions) in 36 ms.
[2021-05-11 20:44:06] [INFO ] Added : 350 causal constraints over 71 iterations in 2050 ms. Result :sat
[2021-05-11 20:44:06] [INFO ] [Real]Absence check using 61 positive place invariants in 26 ms returned sat
[2021-05-11 20:44:06] [INFO ] [Real]Absence check using 61 positive and 44 generalized place invariants in 20 ms returned sat
[2021-05-11 20:44:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:44:07] [INFO ] [Real]Absence check using state equation in 337 ms returned sat
[2021-05-11 20:44:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:44:07] [INFO ] [Nat]Absence check using 61 positive place invariants in 20 ms returned sat
[2021-05-11 20:44:07] [INFO ] [Nat]Absence check using 61 positive and 44 generalized place invariants in 15 ms returned sat
[2021-05-11 20:44:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 20:44:07] [INFO ] [Nat]Absence check using state equation in 192 ms returned sat
[2021-05-11 20:44:07] [INFO ] Deduced a trap composed of 11 places in 166 ms of which 1 ms to minimize.
[2021-05-11 20:44:07] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 0 ms to minimize.
[2021-05-11 20:44:08] [INFO ] Deduced a trap composed of 33 places in 135 ms of which 0 ms to minimize.
[2021-05-11 20:44:08] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 1 ms to minimize.
[2021-05-11 20:44:08] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 0 ms to minimize.
[2021-05-11 20:44:08] [INFO ] Deduced a trap composed of 140 places in 112 ms of which 0 ms to minimize.
[2021-05-11 20:44:08] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 1 ms to minimize.
[2021-05-11 20:44:08] [INFO ] Deduced a trap composed of 114 places in 110 ms of which 1 ms to minimize.
[2021-05-11 20:44:08] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 0 ms to minimize.
[2021-05-11 20:44:09] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 0 ms to minimize.
[2021-05-11 20:44:09] [INFO ] Deduced a trap composed of 112 places in 104 ms of which 1 ms to minimize.
[2021-05-11 20:44:09] [INFO ] Deduced a trap composed of 48 places in 103 ms of which 1 ms to minimize.
[2021-05-11 20:44:09] [INFO ] Deduced a trap composed of 136 places in 98 ms of which 0 ms to minimize.
[2021-05-11 20:44:09] [INFO ] Deduced a trap composed of 133 places in 99 ms of which 0 ms to minimize.
[2021-05-11 20:44:09] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 0 ms to minimize.
[2021-05-11 20:44:09] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 0 ms to minimize.
[2021-05-11 20:44:09] [INFO ] Deduced a trap composed of 147 places in 100 ms of which 0 ms to minimize.
[2021-05-11 20:44:09] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 0 ms to minimize.
[2021-05-11 20:44:10] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 1 ms to minimize.
[2021-05-11 20:44:10] [INFO ] Deduced a trap composed of 147 places in 96 ms of which 1 ms to minimize.
[2021-05-11 20:44:10] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 1 ms to minimize.
[2021-05-11 20:44:10] [INFO ] Deduced a trap composed of 46 places in 95 ms of which 0 ms to minimize.
[2021-05-11 20:44:10] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 0 ms to minimize.
[2021-05-11 20:44:10] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 0 ms to minimize.
[2021-05-11 20:44:10] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
[2021-05-11 20:44:10] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 0 ms to minimize.
[2021-05-11 20:44:10] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2021-05-11 20:44:10] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 0 ms to minimize.
[2021-05-11 20:44:10] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2021-05-11 20:44:10] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 3244 ms
[2021-05-11 20:44:10] [INFO ] Computed and/alt/rep : 508/848/508 causal constraints (skipped 37 transitions) in 29 ms.
[2021-05-11 20:44:12] [INFO ] Added : 269 causal constraints over 54 iterations in 1699 ms. Result :sat
[2021-05-11 20:44:12] [INFO ] [Real]Absence check using 61 positive place invariants in 25 ms returned sat
[2021-05-11 20:44:12] [INFO ] [Real]Absence check using 61 positive and 44 generalized place invariants in 25 ms returned sat
[2021-05-11 20:44:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:44:12] [INFO ] [Real]Absence check using state equation in 228 ms returned sat
[2021-05-11 20:44:13] [INFO ] Deduced a trap composed of 119 places in 136 ms of which 0 ms to minimize.
[2021-05-11 20:44:13] [INFO ] Deduced a trap composed of 8 places in 154 ms of which 1 ms to minimize.
[2021-05-11 20:44:13] [INFO ] Deduced a trap composed of 18 places in 137 ms of which 0 ms to minimize.
[2021-05-11 20:44:13] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 1 ms to minimize.
[2021-05-11 20:44:13] [INFO ] Deduced a trap composed of 44 places in 130 ms of which 0 ms to minimize.
[2021-05-11 20:44:13] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 0 ms to minimize.
[2021-05-11 20:44:14] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 1 ms to minimize.
[2021-05-11 20:44:14] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 0 ms to minimize.
[2021-05-11 20:44:14] [INFO ] Deduced a trap composed of 33 places in 113 ms of which 0 ms to minimize.
[2021-05-11 20:44:14] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 0 ms to minimize.
[2021-05-11 20:44:14] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 0 ms to minimize.
[2021-05-11 20:44:14] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 1 ms to minimize.
[2021-05-11 20:44:14] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 1 ms to minimize.
[2021-05-11 20:44:14] [INFO ] Deduced a trap composed of 118 places in 101 ms of which 0 ms to minimize.
[2021-05-11 20:44:15] [INFO ] Deduced a trap composed of 40 places in 106 ms of which 1 ms to minimize.
[2021-05-11 20:44:15] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 1 ms to minimize.
[2021-05-11 20:44:15] [INFO ] Deduced a trap composed of 126 places in 99 ms of which 1 ms to minimize.
[2021-05-11 20:44:15] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 1 ms to minimize.
[2021-05-11 20:44:15] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 0 ms to minimize.
[2021-05-11 20:44:15] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 0 ms to minimize.
[2021-05-11 20:44:15] [INFO ] Deduced a trap composed of 20 places in 137 ms of which 1 ms to minimize.
[2021-05-11 20:44:15] [INFO ] Deduced a trap composed of 123 places in 103 ms of which 1 ms to minimize.
[2021-05-11 20:44:16] [INFO ] Deduced a trap composed of 48 places in 121 ms of which 1 ms to minimize.
[2021-05-11 20:44:16] [INFO ] Deduced a trap composed of 45 places in 116 ms of which 0 ms to minimize.
[2021-05-11 20:44:16] [INFO ] Deduced a trap composed of 42 places in 135 ms of which 1 ms to minimize.
[2021-05-11 20:44:16] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 1 ms to minimize.
[2021-05-11 20:44:16] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 0 ms to minimize.
[2021-05-11 20:44:16] [INFO ] Deduced a trap composed of 42 places in 104 ms of which 1 ms to minimize.
[2021-05-11 20:44:16] [INFO ] Deduced a trap composed of 37 places in 122 ms of which 1 ms to minimize.
[2021-05-11 20:44:17] [INFO ] Deduced a trap composed of 127 places in 112 ms of which 0 ms to minimize.
[2021-05-11 20:44:17] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 0 ms to minimize.
[2021-05-11 20:44:17] [INFO ] Deduced a trap composed of 140 places in 119 ms of which 0 ms to minimize.
[2021-05-11 20:44:17] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 1 ms to minimize.
[2021-05-11 20:44:17] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 1 ms to minimize.
[2021-05-11 20:44:17] [INFO ] Deduced a trap composed of 49 places in 95 ms of which 0 ms to minimize.
[2021-05-11 20:44:17] [INFO ] Deduced a trap composed of 43 places in 104 ms of which 1 ms to minimize.
[2021-05-11 20:44:17] [INFO ] Deduced a trap composed of 54 places in 103 ms of which 0 ms to minimize.
[2021-05-11 20:44:18] [INFO ] Deduced a trap composed of 30 places in 133 ms of which 1 ms to minimize.
[2021-05-11 20:44:18] [INFO ] Deduced a trap composed of 53 places in 108 ms of which 0 ms to minimize.
[2021-05-11 20:44:18] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 1 ms to minimize.
[2021-05-11 20:44:18] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 0 ms to minimize.
[2021-05-11 20:44:18] [INFO ] Deduced a trap composed of 133 places in 96 ms of which 1 ms to minimize.
[2021-05-11 20:44:18] [INFO ] Deduced a trap composed of 46 places in 109 ms of which 1 ms to minimize.
[2021-05-11 20:44:18] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 0 ms to minimize.
[2021-05-11 20:44:18] [INFO ] Deduced a trap composed of 51 places in 99 ms of which 1 ms to minimize.
[2021-05-11 20:44:19] [INFO ] Deduced a trap composed of 44 places in 112 ms of which 1 ms to minimize.
[2021-05-11 20:44:19] [INFO ] Deduced a trap composed of 118 places in 113 ms of which 0 ms to minimize.
[2021-05-11 20:44:19] [INFO ] Deduced a trap composed of 40 places in 141 ms of which 1 ms to minimize.
[2021-05-11 20:44:19] [INFO ] Deduced a trap composed of 36 places in 134 ms of which 0 ms to minimize.
[2021-05-11 20:44:19] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 1 ms to minimize.
[2021-05-11 20:44:19] [INFO ] Deduced a trap composed of 52 places in 118 ms of which 0 ms to minimize.
[2021-05-11 20:44:19] [INFO ] Deduced a trap composed of 53 places in 111 ms of which 1 ms to minimize.
[2021-05-11 20:44:20] [INFO ] Deduced a trap composed of 132 places in 120 ms of which 1 ms to minimize.
[2021-05-11 20:44:20] [INFO ] Deduced a trap composed of 151 places in 139 ms of which 0 ms to minimize.
[2021-05-11 20:44:20] [INFO ] Deduced a trap composed of 121 places in 128 ms of which 1 ms to minimize.
[2021-05-11 20:44:20] [INFO ] Deduced a trap composed of 116 places in 124 ms of which 0 ms to minimize.
[2021-05-11 20:44:20] [INFO ] Deduced a trap composed of 148 places in 127 ms of which 0 ms to minimize.
[2021-05-11 20:44:20] [INFO ] Deduced a trap composed of 141 places in 111 ms of which 1 ms to minimize.
[2021-05-11 20:44:20] [INFO ] Deduced a trap composed of 137 places in 107 ms of which 0 ms to minimize.
[2021-05-11 20:44:21] [INFO ] Deduced a trap composed of 120 places in 94 ms of which 0 ms to minimize.
[2021-05-11 20:44:21] [INFO ] Deduced a trap composed of 136 places in 94 ms of which 1 ms to minimize.
[2021-05-11 20:44:21] [INFO ] Deduced a trap composed of 129 places in 93 ms of which 0 ms to minimize.
[2021-05-11 20:44:21] [INFO ] Deduced a trap composed of 123 places in 91 ms of which 0 ms to minimize.
[2021-05-11 20:44:21] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 1 ms to minimize.
[2021-05-11 20:44:21] [INFO ] Deduced a trap composed of 116 places in 83 ms of which 0 ms to minimize.
[2021-05-11 20:44:21] [INFO ] Deduced a trap composed of 121 places in 81 ms of which 1 ms to minimize.
[2021-05-11 20:44:21] [INFO ] Deduced a trap composed of 119 places in 83 ms of which 1 ms to minimize.
[2021-05-11 20:44:21] [INFO ] Deduced a trap composed of 119 places in 81 ms of which 0 ms to minimize.
[2021-05-11 20:44:21] [INFO ] Deduced a trap composed of 115 places in 85 ms of which 0 ms to minimize.
[2021-05-11 20:44:22] [INFO ] Deduced a trap composed of 150 places in 87 ms of which 0 ms to minimize.
[2021-05-11 20:44:22] [INFO ] Deduced a trap composed of 126 places in 85 ms of which 0 ms to minimize.
[2021-05-11 20:44:22] [INFO ] Deduced a trap composed of 123 places in 77 ms of which 1 ms to minimize.
[2021-05-11 20:44:22] [INFO ] Deduced a trap composed of 123 places in 87 ms of which 1 ms to minimize.
[2021-05-11 20:44:22] [INFO ] Deduced a trap composed of 124 places in 80 ms of which 0 ms to minimize.
[2021-05-11 20:44:22] [INFO ] Deduced a trap composed of 125 places in 77 ms of which 1 ms to minimize.
[2021-05-11 20:44:22] [INFO ] Deduced a trap composed of 120 places in 81 ms of which 0 ms to minimize.
[2021-05-11 20:44:22] [INFO ] Deduced a trap composed of 127 places in 79 ms of which 1 ms to minimize.
[2021-05-11 20:44:22] [INFO ] Deduced a trap composed of 119 places in 79 ms of which 0 ms to minimize.
[2021-05-11 20:44:22] [INFO ] Deduced a trap composed of 134 places in 84 ms of which 0 ms to minimize.
[2021-05-11 20:44:23] [INFO ] Deduced a trap composed of 132 places in 87 ms of which 0 ms to minimize.
[2021-05-11 20:44:23] [INFO ] Deduced a trap composed of 140 places in 82 ms of which 1 ms to minimize.
[2021-05-11 20:44:23] [INFO ] Deduced a trap composed of 138 places in 91 ms of which 0 ms to minimize.
[2021-05-11 20:44:23] [INFO ] Deduced a trap composed of 138 places in 81 ms of which 0 ms to minimize.
[2021-05-11 20:44:23] [INFO ] Deduced a trap composed of 137 places in 86 ms of which 1 ms to minimize.
[2021-05-11 20:44:23] [INFO ] Deduced a trap composed of 134 places in 113 ms of which 1 ms to minimize.
[2021-05-11 20:44:23] [INFO ] Deduced a trap composed of 138 places in 95 ms of which 0 ms to minimize.
[2021-05-11 20:44:23] [INFO ] Deduced a trap composed of 167 places in 82 ms of which 0 ms to minimize.
[2021-05-11 20:44:23] [INFO ] Deduced a trap composed of 141 places in 86 ms of which 1 ms to minimize.
[2021-05-11 20:44:24] [INFO ] Deduced a trap composed of 134 places in 92 ms of which 0 ms to minimize.
[2021-05-11 20:44:24] [INFO ] Deduced a trap composed of 138 places in 81 ms of which 0 ms to minimize.
[2021-05-11 20:44:24] [INFO ] Deduced a trap composed of 151 places in 87 ms of which 1 ms to minimize.
[2021-05-11 20:44:24] [INFO ] Deduced a trap composed of 141 places in 104 ms of which 1 ms to minimize.
[2021-05-11 20:44:24] [INFO ] Deduced a trap composed of 140 places in 79 ms of which 0 ms to minimize.
[2021-05-11 20:44:24] [INFO ] Deduced a trap composed of 129 places in 81 ms of which 1 ms to minimize.
[2021-05-11 20:44:24] [INFO ] Deduced a trap composed of 140 places in 84 ms of which 0 ms to minimize.
[2021-05-11 20:44:24] [INFO ] Deduced a trap composed of 135 places in 83 ms of which 0 ms to minimize.
[2021-05-11 20:44:24] [INFO ] Deduced a trap composed of 131 places in 82 ms of which 0 ms to minimize.
[2021-05-11 20:44:25] [INFO ] Deduced a trap composed of 147 places in 80 ms of which 1 ms to minimize.
[2021-05-11 20:44:25] [INFO ] Deduced a trap composed of 145 places in 83 ms of which 0 ms to minimize.
[2021-05-11 20:44:25] [INFO ] Deduced a trap composed of 132 places in 85 ms of which 0 ms to minimize.
[2021-05-11 20:44:25] [INFO ] Deduced a trap composed of 137 places in 89 ms of which 0 ms to minimize.
[2021-05-11 20:44:25] [INFO ] Deduced a trap composed of 142 places in 83 ms of which 1 ms to minimize.
[2021-05-11 20:44:25] [INFO ] Deduced a trap composed of 150 places in 86 ms of which 1 ms to minimize.
[2021-05-11 20:44:25] [INFO ] Deduced a trap composed of 151 places in 98 ms of which 1 ms to minimize.
[2021-05-11 20:44:25] [INFO ] Deduced a trap composed of 143 places in 100 ms of which 1 ms to minimize.
[2021-05-11 20:44:26] [INFO ] Deduced a trap composed of 140 places in 131 ms of which 1 ms to minimize.
[2021-05-11 20:44:26] [INFO ] Deduced a trap composed of 52 places in 142 ms of which 0 ms to minimize.
[2021-05-11 20:44:26] [INFO ] Deduced a trap composed of 55 places in 121 ms of which 0 ms to minimize.
[2021-05-11 20:44:26] [INFO ] Deduced a trap composed of 158 places in 134 ms of which 1 ms to minimize.
[2021-05-11 20:44:26] [INFO ] Deduced a trap composed of 145 places in 111 ms of which 0 ms to minimize.
[2021-05-11 20:44:26] [INFO ] Deduced a trap composed of 152 places in 109 ms of which 0 ms to minimize.
[2021-05-11 20:44:26] [INFO ] Deduced a trap composed of 136 places in 137 ms of which 1 ms to minimize.
[2021-05-11 20:44:27] [INFO ] Deduced a trap composed of 146 places in 120 ms of which 1 ms to minimize.
[2021-05-11 20:44:27] [INFO ] Deduced a trap composed of 162 places in 124 ms of which 0 ms to minimize.
[2021-05-11 20:44:27] [INFO ] Deduced a trap composed of 156 places in 123 ms of which 1 ms to minimize.
[2021-05-11 20:44:27] [INFO ] Deduced a trap composed of 147 places in 108 ms of which 1 ms to minimize.
[2021-05-11 20:44:27] [INFO ] Deduced a trap composed of 137 places in 105 ms of which 1 ms to minimize.
[2021-05-11 20:44:27] [INFO ] Deduced a trap composed of 143 places in 107 ms of which 1 ms to minimize.
[2021-05-11 20:44:27] [INFO ] Deduced a trap composed of 145 places in 109 ms of which 0 ms to minimize.
[2021-05-11 20:44:28] [INFO ] Deduced a trap composed of 159 places in 132 ms of which 0 ms to minimize.
[2021-05-11 20:44:28] [INFO ] Deduced a trap composed of 152 places in 101 ms of which 0 ms to minimize.
[2021-05-11 20:44:28] [INFO ] Deduced a trap composed of 152 places in 123 ms of which 0 ms to minimize.
[2021-05-11 20:44:28] [INFO ] Deduced a trap composed of 148 places in 122 ms of which 0 ms to minimize.
[2021-05-11 20:44:28] [INFO ] Deduced a trap composed of 152 places in 118 ms of which 0 ms to minimize.
[2021-05-11 20:44:28] [INFO ] Deduced a trap composed of 136 places in 106 ms of which 0 ms to minimize.
[2021-05-11 20:44:28] [INFO ] Deduced a trap composed of 137 places in 119 ms of which 1 ms to minimize.
[2021-05-11 20:44:29] [INFO ] Deduced a trap composed of 154 places in 108 ms of which 1 ms to minimize.
[2021-05-11 20:44:29] [INFO ] Deduced a trap composed of 156 places in 114 ms of which 0 ms to minimize.
[2021-05-11 20:44:29] [INFO ] Deduced a trap composed of 143 places in 107 ms of which 0 ms to minimize.
[2021-05-11 20:44:29] [INFO ] Deduced a trap composed of 146 places in 91 ms of which 0 ms to minimize.
[2021-05-11 20:44:29] [INFO ] Deduced a trap composed of 136 places in 103 ms of which 0 ms to minimize.
[2021-05-11 20:44:29] [INFO ] Deduced a trap composed of 140 places in 105 ms of which 1 ms to minimize.
[2021-05-11 20:44:29] [INFO ] Deduced a trap composed of 144 places in 107 ms of which 0 ms to minimize.
[2021-05-11 20:44:29] [INFO ] Deduced a trap composed of 156 places in 86 ms of which 1 ms to minimize.
[2021-05-11 20:44:30] [INFO ] Deduced a trap composed of 134 places in 89 ms of which 0 ms to minimize.
[2021-05-11 20:44:30] [INFO ] Deduced a trap composed of 139 places in 101 ms of which 0 ms to minimize.
[2021-05-11 20:44:30] [INFO ] Deduced a trap composed of 139 places in 105 ms of which 0 ms to minimize.
[2021-05-11 20:44:30] [INFO ] Deduced a trap composed of 136 places in 99 ms of which 0 ms to minimize.
[2021-05-11 20:44:30] [INFO ] Deduced a trap composed of 137 places in 96 ms of which 0 ms to minimize.
[2021-05-11 20:44:30] [INFO ] Deduced a trap composed of 133 places in 93 ms of which 1 ms to minimize.
[2021-05-11 20:44:30] [INFO ] Deduced a trap composed of 148 places in 101 ms of which 0 ms to minimize.
[2021-05-11 20:44:30] [INFO ] Deduced a trap composed of 145 places in 102 ms of which 1 ms to minimize.
[2021-05-11 20:44:31] [INFO ] Deduced a trap composed of 142 places in 82 ms of which 0 ms to minimize.
[2021-05-11 20:44:31] [INFO ] Deduced a trap composed of 129 places in 78 ms of which 1 ms to minimize.
[2021-05-11 20:44:31] [INFO ] Deduced a trap composed of 159 places in 80 ms of which 0 ms to minimize.
[2021-05-11 20:44:31] [INFO ] Deduced a trap composed of 144 places in 96 ms of which 0 ms to minimize.
[2021-05-11 20:44:31] [INFO ] Deduced a trap composed of 141 places in 86 ms of which 0 ms to minimize.
[2021-05-11 20:44:31] [INFO ] Deduced a trap composed of 141 places in 83 ms of which 1 ms to minimize.
[2021-05-11 20:44:31] [INFO ] Deduced a trap composed of 141 places in 86 ms of which 0 ms to minimize.
[2021-05-11 20:44:31] [INFO ] Deduced a trap composed of 150 places in 135 ms of which 1 ms to minimize.
[2021-05-11 20:44:32] [INFO ] Deduced a trap composed of 148 places in 132 ms of which 1 ms to minimize.
[2021-05-11 20:44:32] [INFO ] Deduced a trap composed of 152 places in 110 ms of which 1 ms to minimize.
[2021-05-11 20:44:32] [INFO ] Deduced a trap composed of 149 places in 109 ms of which 0 ms to minimize.
[2021-05-11 20:44:32] [INFO ] Deduced a trap composed of 143 places in 103 ms of which 0 ms to minimize.
[2021-05-11 20:44:32] [INFO ] Deduced a trap composed of 150 places in 108 ms of which 1 ms to minimize.
[2021-05-11 20:44:32] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 9
[2021-05-11 20:44:32] [INFO ] [Real]Absence check using 61 positive place invariants in 19 ms returned sat
[2021-05-11 20:44:32] [INFO ] [Real]Absence check using 61 positive and 44 generalized place invariants in 14 ms returned sat
[2021-05-11 20:44:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:44:32] [INFO ] [Real]Absence check using state equation in 173 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 84 place count 612 transition count 461
Reduce places removed 84 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 89 rules applied. Total rules applied 173 place count 528 transition count 456
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 178 place count 523 transition count 456
Performed 121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 121 Pre rules applied. Total rules applied 178 place count 523 transition count 335
Deduced a syphon composed of 121 places in 0 ms
Ensure Unique test removed 19 places
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 3 with 261 rules applied. Total rules applied 439 place count 383 transition count 335
Discarding 68 places :
Symmetric choice reduction at 3 with 68 rule applications. Total rules 507 place count 315 transition count 267
Iterating global reduction 3 with 68 rules applied. Total rules applied 575 place count 315 transition count 267
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 575 place count 315 transition count 262
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 586 place count 309 transition count 262
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 94
Deduced a syphon composed of 94 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 191 rules applied. Total rules applied 777 place count 212 transition count 168
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 779 place count 211 transition count 172
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 785 place count 211 transition count 172
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 786 place count 210 transition count 171
Applied a total of 786 rules in 105 ms. Remains 210 /613 variables (removed 403) and now considering 171/546 (removed 375) transitions.
[2021-05-11 20:44:33] [INFO ] Flatten gal took : 12 ms
[2021-05-11 20:44:33] [INFO ] Flatten gal took : 12 ms
[2021-05-11 20:44:33] [INFO ] Input system was already deterministic with 171 transitions.
[2021-05-11 20:44:33] [INFO ] Flatten gal took : 11 ms
[2021-05-11 20:44:33] [INFO ] Flatten gal took : 20 ms
[2021-05-11 20:44:33] [INFO ] Time to serialize gal into /tmp/CTLFireability10217073101158423505.gal : 13 ms
[2021-05-11 20:44:33] [INFO ] Time to serialize properties into /tmp/CTLFireability7993220566956559259.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/CTLFireability10217073101158423505.gal, -t, CGAL, -ctl, /tmp/CTLFireability7993220566956559259.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/CTLFireability10217073101158423505.gal -t CGAL -ctl /tmp/CTLFireability7993220566956559259.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.12307e+06,0.550666,28672,2,14540,5,76941,6,0,1010,64731,0
Converting to forward existential form...Done !
original formula: (A(((p357==1)||(p497==1)) U ((((((((((p262==0)&&(((p143==0)||(p366==0))||(p542==0)))&&(p52==0))&&(p6==0))&&(p448==0))&&((p623==0)||(p626==0)))&&(((p137==0)||(p356==0))||(p537==0)))&&(p476==0))&&(p11==0))&&(p646==0))) * E(((((p373==0)&&(((p134==0)||(p351==0))||(p625==0)))&&(((p137==0)||(p356==0))||(p637==0)))&&(p156==0)) U (((p353==1)||(p275==1))||(((p248==1)&&(p460==1))&&(p611==1)))))
=> equivalent forward existential formula: [(FwdU((Init * !((E(!(((((((((((p262==0)&&(((p143==0)||(p366==0))||(p542==0)))&&(p52==0))&&(p6==0))&&(p448==0))&&((p623==0)||(p626==0)))&&(((p137==0)||(p356==0))||(p537==0)))&&(p476==0))&&(p11==0))&&(p646==0))) U (!(((p357==1)||(p497==1))) * !(((((((((((p262==0)&&(((p143==0)||(p366==0))||(p542==0)))&&(p52==0))&&(p6==0))&&(p448==0))&&((p623==0)||(p626==0)))&&(((p137==0)||(p356==0))||(p537==0)))&&(p476==0))&&(p11==0))&&(p646==0))))) + EG(!(((((((((((p262==0)&&(((p143==0)||(p366==0))||(p542==0)))&&(p52==0))&&(p6==0))&&(p448==0))&&((p623==0)||(p626==0)))&&(((p137==0)||(p356==0))||(p537==0)))&&(p476==0))&&(p11==0))&&(p646==0))))))),((((p373==0)&&(((p134==0)||(p351==0))||(p625==0)))&&(((p137==0)||(p356==0))||(p637==0)))&&(p156==0))) * (((p353==1)||(p275==1))||(((p248==1)&&(p460==1))&&(p611==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t11, t12, t13, t16, t61, t62, t63, t64, t65, t66, t67, t68, t69, t70, t71, t73, t74, t81, t82, t83, t84, t98, t102, t104, t113, t122, t125, t128, t138, t153, t154, t155, t156, t157, t158, t161, t162, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/97/38/171
Hit Full ! (commute/partial/dont) 129/33/42
(forward)formula 0,1,15.2947,472640,1,0,373,2.34153e+06,341,164,7845,1.75126e+06,426
FORMULA BusinessProcesses-PT-17-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Graph (trivial) has 331 edges and 613 vertex of which 7 / 613 are part of one of the 1 SCC in 13 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 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 119 place count 606 transition count 420
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 237 place count 488 transition count 420
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 237 place count 488 transition count 324
Deduced a syphon composed of 96 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 210 rules applied. Total rules applied 447 place count 374 transition count 324
Discarding 70 places :
Symmetric choice reduction at 2 with 70 rule applications. Total rules 517 place count 304 transition count 254
Iterating global reduction 2 with 70 rules applied. Total rules applied 587 place count 304 transition count 254
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 587 place count 304 transition count 247
Deduced a syphon composed of 7 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 15 rules applied. Total rules applied 602 place count 296 transition count 247
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Deduced a syphon composed of 102 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 2 with 207 rules applied. Total rules applied 809 place count 191 transition count 145
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 813 place count 189 transition count 148
Applied a total of 813 rules in 73 ms. Remains 189 /613 variables (removed 424) and now considering 148/546 (removed 398) transitions.
[2021-05-11 20:44:48] [INFO ] Flatten gal took : 10 ms
[2021-05-11 20:44:48] [INFO ] Flatten gal took : 10 ms
[2021-05-11 20:44:48] [INFO ] Input system was already deterministic with 148 transitions.
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
FORMULA BusinessProcesses-PT-17-CTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2021-05-11 20:44:48] [INFO ] Flatten gal took : 22 ms
[2021-05-11 20:44:48] [INFO ] Flatten gal took : 21 ms
[2021-05-11 20:44:48] [INFO ] Applying decomposition
[2021-05-11 20:44:48] [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/graph4769078498233995240.txt, -o, /tmp/graph4769078498233995240.bin, -w, /tmp/graph4769078498233995240.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/graph4769078498233995240.bin, -l, -1, -v, -w, /tmp/graph4769078498233995240.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-11 20:44:49] [INFO ] Decomposing Gal with order
[2021-05-11 20:44:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 20:44:49] [INFO ] Removed a total of 268 redundant transitions.
[2021-05-11 20:44:49] [INFO ] Flatten gal took : 107 ms
[2021-05-11 20:44:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 14 ms.
[2021-05-11 20:44:49] [INFO ] Time to serialize gal into /tmp/CTLFireability3738252172462815632.gal : 14 ms
[2021-05-11 20:44:49] [INFO ] Time to serialize properties into /tmp/CTLFireability13340939818532722058.ctl : 6 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/CTLFireability3738252172462815632.gal, -t, CGAL, -ctl, /tmp/CTLFireability13340939818532722058.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/CTLFireability3738252172462815632.gal -t CGAL -ctl /tmp/CTLFireability13340939818532722058.ctl
No direction supplied, using forward translation only.
Parsed 14 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.63932e+26,10.1336,276808,15293,111,449060,1300,1282,1.35813e+06,91,3783,0
Converting to forward existential form...Done !
original formula: ((EF(((((((i11.u8.p17==1)||(((i12.u45.p109==1)&&(i12.u134.p356==1))&&(i12.u134.p537==1)))||(i12.u55.p139==1))||(((i11.u63.p159==1)&&(i8.i0.i4.u147.p385==1))&&(i18.u227.p611==1))) * ((AG(((((((i6.u154.p404==1)||(((i7.u84.p217==1)&&(i15.u168.p440==1))&&(i18.u227.p611==1)))||(i9.u126.p334==1))||(i18.u217.p579==1))||(i1.u23.p58==1))||(i7.u218.p582==1))) * (A(((i10.i0.i0.u19.p48==1)||(i12.u198.p529==1)) U (((((((i10.i0.i4.u118.p309==1)||(i17.u174.p584==1))||(i6.u153.p403==1))||(i18.u214.p573==1))||(i10.i0.i2.u112.p297==1))||(i14.i0.i1.u67.p172==1))||(i18.u187.p504==1))) + AF((i6.u71.p184==1)))) + A(((i2.u30.p71==1)||(((i10.i1.i0.u16.p36==1)&&(i8.i0.i2.u142.p375==1))&&(i18.u227.p611==1))) U (((((((((i17.u175.p469==0)&&(((i16.u92.p241==0)||(i0.u172.p455==0))||(i18.u227.p611==0)))&&(i18.u206.p555==0))&&(((i12.u42.p137==0)||(i12.u134.p356==0))||(i12.u197.p637==0)))&&(((i3.u34.p80==0)||(i12.u132.p350==0))||(i18.u227.p611==0)))&&(i18.u227.p463==0))&&(i6.u72.p186==0))&&(((i10.i1.i0.u17.p41==0)||(i10.i1.i1.u119.p316==0))||(i10.i1.i0.u182.p490==0)))&&(i18.u181.p489==0))))) * A(A(EX((((((i18.u180.p487==1)||(((i4.u77.p208==1)&&(i4.u158.p416==1))&&(i4.u216.p647==1)))||((i12.u46.p110==1)&&(i12.u200.p538==1)))||(i18.u208.p558==1))||(((i12.u42.p134==1)&&(i12.u132.p351==1))&&(i12.u197.p634==1)))) U ((((((((i9.u111.p293==0)&&(i0.u172.p453==0))&&(i14.i1.i1.u148.p388==0))&&(((i12.u45.p109==0)||(i12.u134.p356==0))||(i12.u195.p619==0)))&&(i15.u165.p437==0))&&((i2.u27.p75==0)||(i18.u176.p474==0)))&&(i6.u155.p412==0))&&(((i14.i0.i0.u65.p176==0)||(i6.u151.p400==0))||(i18.u227.p611==0)))) U AG(AF((((((i13.u57.p145==1)||(i14.i0.i0.u65.p165==1))||(((i12.u40.p125==1)&&(i12.u132.p351==1))&&(i12.u228.p616==1)))||(((i10.i1.i0.u16.p36==1)&&(i8.i0.i2.u142.p375==1))&&(i18.u227.p611==1)))||(i2.u32.p77==1))))))) * !(AX((AF((((((i0.u1.p2==0)&&(i6.u102.p273==0))&&(((i12.u41.p131==0)||(i12.u134.p356==0))||(i12.u234.p631==0)))&&(i12.u45.p107==0))&&(i6.u73.p190==0))) * (((((((((i18.u180.p486==1)||(((i13.u57.p143==1)&&(i13.u138.p366==1))&&(i13.u202.p542==1)))||(i4.u157.p417==1))||(i16.u3.p7==1))||(i18.u208.p559==1))||(i6.u72.p187==1))||(((i0.u94.p248==1)&&(i0.u173.p460==1))&&(i18.u227.p611==1)))||(i12.u199.p533==1))||(((i3.u37.p89==1)&&(i9.u131.p346==1))&&(i3.u194.p519==1))))))) * ((EF(((((((((i6.u213.p571==1)||(i6.u70.p181==1))||(i18.u210.p562==1))||(i15.u167.p442==1))||(((i12.u44.p106==1)&&(i12.u132.p351==1))&&(i12.u196.p625==1)))||(i6.u73.p190==1))||(i10.i0.i0.u18.p44==1))||(((i10.i0.i0.u18.p43==1)&&(i10.i0.i4.u118.p310==1))&&(i18.u227.p611==1)))) + EX((((((((i6.u213.p571==1)||(i16.u93.p247==1))||(i14.i0.i0.u65.p167==1))||(i14.i0.i0.u65.p165==1))||(i2.u27.p76==1))||(i14.i1.i0.u150.p393==1))&&((((i12.u42.p137==1)&&(i12.u134.p356==1))&&(i12.u197.p637==1))||(i10.i0.i0.u12.p28==1))))) + AF(((i13.u139.p363==1)||(i18.u181.p488==1)))))
=> equivalent forward existential formula: (([(Init * !(E(TRUE U ((((((i11.u8.p17==1)||(((i12.u45.p109==1)&&(i12.u134.p356==1))&&(i12.u134.p537==1)))||(i12.u55.p139==1))||(((i11.u63.p159==1)&&(i8.i0.i4.u147.p385==1))&&(i18.u227.p611==1))) * ((!(E(TRUE U !(((((((i6.u154.p404==1)||(((i7.u84.p217==1)&&(i15.u168.p440==1))&&(i18.u227.p611==1)))||(i9.u126.p334==1))||(i18.u217.p579==1))||(i1.u23.p58==1))||(i7.u218.p582==1))))) * (!((E(!((((((((i10.i0.i4.u118.p309==1)||(i17.u174.p584==1))||(i6.u153.p403==1))||(i18.u214.p573==1))||(i10.i0.i2.u112.p297==1))||(i14.i0.i1.u67.p172==1))||(i18.u187.p504==1))) U (!(((i10.i0.i0.u19.p48==1)||(i12.u198.p529==1))) * !((((((((i10.i0.i4.u118.p309==1)||(i17.u174.p584==1))||(i6.u153.p403==1))||(i18.u214.p573==1))||(i10.i0.i2.u112.p297==1))||(i14.i0.i1.u67.p172==1))||(i18.u187.p504==1))))) + EG(!((((((((i10.i0.i4.u118.p309==1)||(i17.u174.p584==1))||(i6.u153.p403==1))||(i18.u214.p573==1))||(i10.i0.i2.u112.p297==1))||(i14.i0.i1.u67.p172==1))||(i18.u187.p504==1)))))) + !(EG(!((i6.u71.p184==1)))))) + !((E(!((((((((((i17.u175.p469==0)&&(((i16.u92.p241==0)||(i0.u172.p455==0))||(i18.u227.p611==0)))&&(i18.u206.p555==0))&&(((i12.u42.p137==0)||(i12.u134.p356==0))||(i12.u197.p637==0)))&&(((i3.u34.p80==0)||(i12.u132.p350==0))||(i18.u227.p611==0)))&&(i18.u227.p463==0))&&(i6.u72.p186==0))&&(((i10.i1.i0.u17.p41==0)||(i10.i1.i1.u119.p316==0))||(i10.i1.i0.u182.p490==0)))&&(i18.u181.p489==0))) U (!(((i2.u30.p71==1)||(((i10.i1.i0.u16.p36==1)&&(i8.i0.i2.u142.p375==1))&&(i18.u227.p611==1)))) * !((((((((((i17.u175.p469==0)&&(((i16.u92.p241==0)||(i0.u172.p455==0))||(i18.u227.p611==0)))&&(i18.u206.p555==0))&&(((i12.u42.p137==0)||(i12.u134.p356==0))||(i12.u197.p637==0)))&&(((i3.u34.p80==0)||(i12.u132.p350==0))||(i18.u227.p611==0)))&&(i18.u227.p463==0))&&(i6.u72.p186==0))&&(((i10.i1.i0.u17.p41==0)||(i10.i1.i1.u119.p316==0))||(i10.i1.i0.u182.p490==0)))&&(i18.u181.p489==0))))) + EG(!((((((((((i17.u175.p469==0)&&(((i16.u92.p241==0)||(i0.u172.p455==0))||(i18.u227.p611==0)))&&(i18.u206.p555==0))&&(((i12.u42.p137==0)||(i12.u134.p356==0))||(i12.u197.p637==0)))&&(((i3.u34.p80==0)||(i12.u132.p350==0))||(i18.u227.p611==0)))&&(i18.u227.p463==0))&&(i6.u72.p186==0))&&(((i10.i1.i0.u17.p41==0)||(i10.i1.i1.u119.p316==0))||(i10.i1.i0.u182.p490==0)))&&(i18.u181.p489==0)))))))) * !((E(!(!(E(TRUE U !(!(EG(!((((((i13.u57.p145==1)||(i14.i0.i0.u65.p165==1))||(((i12.u40.p125==1)&&(i12.u132.p351==1))&&(i12.u228.p616==1)))||(((i10.i1.i0.u16.p36==1)&&(i8.i0.i2.u142.p375==1))&&(i18.u227.p611==1)))||(i2.u32.p77==1))))))))) U (!(!((E(!(((((((((i9.u111.p293==0)&&(i0.u172.p453==0))&&(i14.i1.i1.u148.p388==0))&&(((i12.u45.p109==0)||(i12.u134.p356==0))||(i12.u195.p619==0)))&&(i15.u165.p437==0))&&((i2.u27.p75==0)||(i18.u176.p474==0)))&&(i6.u155.p412==0))&&(((i14.i0.i0.u65.p176==0)||(i6.u151.p400==0))||(i18.u227.p611==0)))) U (!(EX((((((i18.u180.p487==1)||(((i4.u77.p208==1)&&(i4.u158.p416==1))&&(i4.u216.p647==1)))||((i12.u46.p110==1)&&(i12.u200.p538==1)))||(i18.u208.p558==1))||(((i12.u42.p134==1)&&(i12.u132.p351==1))&&(i12.u197.p634==1))))) * !(((((((((i9.u111.p293==0)&&(i0.u172.p453==0))&&(i14.i1.i1.u148.p388==0))&&(((i12.u45.p109==0)||(i12.u134.p356==0))||(i12.u195.p619==0)))&&(i15.u165.p437==0))&&((i2.u27.p75==0)||(i18.u176.p474==0)))&&(i6.u155.p412==0))&&(((i14.i0.i0.u65.p176==0)||(i6.u151.p400==0))||(i18.u227.p611==0)))))) + EG(!(((((((((i9.u111.p293==0)&&(i0.u172.p453==0))&&(i14.i1.i1.u148.p388==0))&&(((i12.u45.p109==0)||(i12.u134.p356==0))||(i12.u195.p619==0)))&&(i15.u165.p437==0))&&((i2.u27.p75==0)||(i18.u176.p474==0)))&&(i6.u155.p412==0))&&(((i14.i0.i0.u65.p176==0)||(i6.u151.p400==0))||(i18.u227.p611==0)))))))) * !(!(E(TRUE U !(!(EG(!((((((i13.u57.p145==1)||(i14.i0.i0.u65.p165==1))||(((i12.u40.p125==1)&&(i12.u132.p351==1))&&(i12.u228.p616==1)))||(((i10.i1.i0.u16.p36==1)&&(i8.i0.i2.u142.p375==1))&&(i18.u227.p611==1)))||(i2.u32.p77==1))))))))))) + EG(!(!(E(TRUE U !(!(EG(!((((((i13.u57.p145==1)||(i14.i0.i0.u65.p165==1))||(((i12.u40.p125==1)&&(i12.u132.p351==1))&&(i12.u228.p616==1)))||(((i10.i1.i0.u16.p36==1)&&(i8.i0.i2.u142.p375==1))&&(i18.u227.p611==1)))||(i2.u32.p77==1))))))))))))))))] = FALSE * [(Init * !(EX(!((!(EG(!((((((i0.u1.p2==0)&&(i6.u102.p273==0))&&(((i12.u41.p131==0)||(i12.u134.p356==0))||(i12.u234.p631==0)))&&(i12.u45.p107==0))&&(i6.u73.p190==0))))) * (((((((((i18.u180.p486==1)||(((i13.u57.p143==1)&&(i13.u138.p366==1))&&(i13.u202.p542==1)))||(i4.u157.p417==1))||(i16.u3.p7==1))||(i18.u208.p559==1))||(i6.u72.p187==1))||(((i0.u94.p248==1)&&(i0.u173.p460==1))&&(i18.u227.p611==1)))||(i12.u199.p533==1))||(((i3.u37.p89==1)&&(i9.u131.p346==1))&&(i3.u194.p519==1))))))))] = FALSE) * [FwdG((Init * !((E(TRUE U ((((((((i6.u213.p571==1)||(i6.u70.p181==1))||(i18.u210.p562==1))||(i15.u167.p442==1))||(((i12.u44.p106==1)&&(i12.u132.p351==1))&&(i12.u196.p625==1)))||(i6.u73.p190==1))||(i10.i0.i0.u18.p44==1))||(((i10.i0.i0.u18.p43==1)&&(i10.i0.i4.u118.p310==1))&&(i18.u227.p611==1)))) + EX((((((((i6.u213.p571==1)||(i16.u93.p247==1))||(i14.i0.i0.u65.p167==1))||(i14.i0.i0.u65.p165==1))||(i2.u27.p76==1))||(i14.i1.i0.u150.p393==1))&&((((i12.u42.p137==1)&&(i12.u134.p356==1))&&(i12.u197.p637==1))||(i10.i0.i0.u12.p28==1))))))),!(((i13.u139.p363==1)||(i18.u181.p488==1))))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions t9, t64, t261, t391, i0.u172.t133, i0.u173.t130, i0.u94.t264, i0.u98.t256, i0.u96.t259, i1.t396, i1.t387, i1.t98, i1.u22.t392, i1.u21.t394, i1.u23.t390, i1.u185.t101, i2.t386, i2.t382, i2.t380, i2.t378, i2.t376, i2.t373, i2.t371, i3.u34.t368, i3.u36.t364, i4.t164, i4.u76.t296, i4.u158.t165, i5.t156, i5.u86.t280, i5.u161.t157, i6.t176, i6.t172, i6.t168, i6.u70.t308, i6.u72.t304, i6.u151.t177, i6.u154.t173, i6.u156.t169, i7.t281, i7.t160, i7.u74.t300, i7.u82.t288, i7.u84.t284, i7.u160.t161, i8.i0.i1.t207, i8.i0.i1.u136.t208, i8.i0.i2.t195, i8.i0.i2.u142.t196, i8.i0.i3.t191, i8.i0.i3.u144.t192, i8.i0.i4.t187, i8.i0.i4.u147.t188, i8.i1.i0.t324, i8.i1.i0.u60.t326, i8.i1.i1.t199, i8.i1.i1.u140.t200, i9.t238, i9.t227, i9.t223, i9.t219, i9.u122.t239, i9.u126.t228, i9.u129.t224, i9.u131.t220, i10.t401, i10.i0.i0.u14.t407, i10.i0.i0.u18.t400, i10.i0.i1.t409, i10.i0.i1.u15.t405, i10.i0.i2.t253, i10.i0.i2.u114.t254, i10.i0.i3.t250, i10.i0.i3.u115.t251, i10.i0.i4.t246, i10.i0.i4.u118.t247, i10.i0.i5.t111, i10.i0.i5.u178.t113, i10.i1.i0.u16.t404, i10.i1.i1.t242, i10.i1.i1.u119.t243, i11.u58.t330, i11.u63.t320, i12.t342, i12.t340, i12.t338, i12.t234, i12.t215, i12.t211, i12.u38.t346, i12.u38.t350, i12.u38.t354, i12.u38.t360, i12.u123.t235, i12.u132.t216, i12.u134.t212, i13.t203, i13.u56.t334, i13.u138.t204, i14.i0.i0.u65.t316, i14.i1.i0.u150.t179, i14.i1.i1.t183, i14.i1.i1.u149.t184, i15.t152, i15.t148, i15.t144, i15.u164.t153, i15.u166.t149, i15.u168.t145, i16.t273, i16.t269, i16.t265, i16.t137, i16.u88.t276, i16.u90.t272, i16.u92.t268, i16.u169.t140, i16.u171.t138, i17.u174.t17, i17.u174.t19, i17.u174.t24, i17.u174.t26, i17.u174.t41, i17.u174.t58, i17.u174.t99, i17.u174.t119, i17.u174.t125, i18.t115, i18.t109, i18.t107, i18.t104, i18.t96, i18.t93, i18.t91, i18.t89, i18.t86, i18.t61, i18.t56, i18.t53, i18.t50, i18.t48, i18.t46, i18.t44, i18.t39, i18.t29, i18.t22, i18.t14, i18.u227.t12, i18.u227.t36, i18.u227.t73, i18.u227.t77, i18.u227.t83, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/357/152/545
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 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Detected timeout of ITS tools.
[2021-05-11 21:05:32] [INFO ] Applying decomposition
[2021-05-11 21:05:32] [INFO ] Flatten gal took : 38 ms
[2021-05-11 21:05:32] [INFO ] Decomposing Gal with order
[2021-05-11 21:05:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 21:05:32] [INFO ] Removed a total of 119 redundant transitions.
[2021-05-11 21:05:32] [INFO ] Flatten gal took : 56 ms
[2021-05-11 21:05:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 136 labels/synchronizations in 121 ms.
[2021-05-11 21:05:33] [INFO ] Time to serialize gal into /tmp/CTLFireability8492662134805538398.gal : 13 ms
[2021-05-11 21:05:33] [INFO ] Time to serialize properties into /tmp/CTLFireability3072606942366953290.ctl : 8 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/CTLFireability8492662134805538398.gal, -t, CGAL, -ctl, /tmp/CTLFireability3072606942366953290.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/CTLFireability8492662134805538398.gal -t CGAL -ctl /tmp/CTLFireability3072606942366953290.ctl
No direction supplied, using forward translation only.
Parsed 14 CTL formulae.
Detected timeout of ITS tools.
[2021-05-11 21:26:18] [INFO ] Flatten gal took : 251 ms
[2021-05-11 21:26:18] [INFO ] Input system was already deterministic with 546 transitions.
[2021-05-11 21:26:19] [INFO ] Transformed 613 places.
[2021-05-11 21:26:19] [INFO ] Transformed 546 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-11 21:26:49] [INFO ] Time to serialize gal into /tmp/CTLFireability17842494322014737657.gal : 11 ms
[2021-05-11 21:26:49] [INFO ] Time to serialize properties into /tmp/CTLFireability2387722634507964675.ctl : 13 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/CTLFireability17842494322014737657.gal, -t, CGAL, -ctl, /tmp/CTLFireability2387722634507964675.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/CTLFireability17842494322014737657.gal -t CGAL -ctl /tmp/CTLFireability2387722634507964675.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 14 CTL formulae.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-17"
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-17, 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-162038143900450"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-17.tgz
mv BusinessProcesses-PT-17 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;