About the Execution of ITS-Tools for BusinessProcesses-PT-11
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15718.260 | 190942.00 | 231841.00 | 609.10 | TFTTTFFFTFFTFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2020-input.r021-oct2-158897699200531.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BusinessProcesses-PT-11, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897699200531
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 312K
-rw-r--r-- 1 mcc users 3.2K Mar 26 02:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 26 02:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 22:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 22:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 25 17:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 25 17:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 14:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 25 17:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 141K Mar 24 05:37 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1589252803568
[2020-05-12 03:06:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-12 03:06:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 03:06:45] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2020-05-12 03:06:45] [INFO ] Transformed 567 places.
[2020-05-12 03:06:45] [INFO ] Transformed 508 transitions.
[2020-05-12 03:06:45] [INFO ] Found NUPN structural information;
[2020-05-12 03:06:45] [INFO ] Parsed PT model containing 567 places and 508 transitions in 121 ms.
Deduced a syphon composed of 7 places in 6 ms
Reduce places removed 7 places and 7 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 41 ms.
Incomplete random walk after 100000 steps, including 749 resets, run finished after 329 ms. (steps per millisecond=303 ) properties seen :[1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0]
// Phase 1: matrix 501 rows 560 cols
[2020-05-12 03:06:46] [INFO ] Computed 95 place invariants in 19 ms
[2020-05-12 03:06:46] [INFO ] [Real]Absence check using 53 positive place invariants in 65 ms returned sat
[2020-05-12 03:06:46] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 18 ms returned sat
[2020-05-12 03:06:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:06:47] [INFO ] [Real]Absence check using state equation in 657 ms returned sat
[2020-05-12 03:06:47] [INFO ] Deduced a trap composed of 14 places in 272 ms
[2020-05-12 03:06:49] [INFO ] Deduced a trap composed of 12 places in 2287 ms
[2020-05-12 03:06:50] [INFO ] Deduced a trap composed of 12 places in 674 ms
[2020-05-12 03:06:50] [INFO ] Deduced a trap composed of 97 places in 341 ms
[2020-05-12 03:06:51] [INFO ] Deduced a trap composed of 21 places in 266 ms
[2020-05-12 03:06:52] [INFO ] Deduced a trap composed of 19 places in 1293 ms
[2020-05-12 03:06:52] [INFO ] Deduced a trap composed of 29 places in 215 ms
[2020-05-12 03:06:52] [INFO ] Deduced a trap composed of 30 places in 167 ms
[2020-05-12 03:06:53] [INFO ] Deduced a trap composed of 22 places in 184 ms
[2020-05-12 03:06:53] [INFO ] Deduced a trap composed of 37 places in 202 ms
[2020-05-12 03:06:53] [INFO ] Deduced a trap composed of 27 places in 207 ms
[2020-05-12 03:06:53] [INFO ] Deduced a trap composed of 24 places in 169 ms
[2020-05-12 03:06:54] [INFO ] Deduced a trap composed of 20 places in 593 ms
[2020-05-12 03:06:54] [INFO ] Deduced a trap composed of 34 places in 292 ms
[2020-05-12 03:06:54] [INFO ] Deduced a trap composed of 28 places in 169 ms
[2020-05-12 03:06:55] [INFO ] Deduced a trap composed of 23 places in 186 ms
[2020-05-12 03:06:55] [INFO ] Deduced a trap composed of 23 places in 176 ms
[2020-05-12 03:06:55] [INFO ] Deduced a trap composed of 31 places in 148 ms
[2020-05-12 03:06:55] [INFO ] Deduced a trap composed of 30 places in 174 ms
[2020-05-12 03:06:55] [INFO ] Deduced a trap composed of 25 places in 139 ms
[2020-05-12 03:06:56] [INFO ] Deduced a trap composed of 28 places in 142 ms
[2020-05-12 03:06:56] [INFO ] Deduced a trap composed of 15 places in 312 ms
[2020-05-12 03:06:56] [INFO ] Deduced a trap composed of 20 places in 339 ms
[2020-05-12 03:06:57] [INFO ] Deduced a trap composed of 37 places in 340 ms
[2020-05-12 03:06:57] [INFO ] Deduced a trap composed of 20 places in 157 ms
[2020-05-12 03:06:59] [INFO ] Deduced a trap composed of 40 places in 2259 ms
[2020-05-12 03:06:59] [INFO ] Deduced a trap composed of 42 places in 178 ms
[2020-05-12 03:06:59] [INFO ] Deduced a trap composed of 39 places in 156 ms
[2020-05-12 03:07:00] [INFO ] Deduced a trap composed of 44 places in 173 ms
[2020-05-12 03:07:00] [INFO ] Deduced a trap composed of 119 places in 192 ms
[2020-05-12 03:07:00] [INFO ] Deduced a trap composed of 116 places in 178 ms
[2020-05-12 03:07:00] [INFO ] Deduced a trap composed of 118 places in 187 ms
[2020-05-12 03:07:00] [INFO ] Deduced a trap composed of 118 places in 165 ms
[2020-05-12 03:07:01] [INFO ] Deduced a trap composed of 117 places in 261 ms
[2020-05-12 03:07:01] [INFO ] Deduced a trap composed of 23 places in 137 ms
[2020-05-12 03:07:01] [INFO ] Deduced a trap composed of 116 places in 144 ms
[2020-05-12 03:07:01] [INFO ] Deduced a trap composed of 22 places in 141 ms
[2020-05-12 03:07:01] [INFO ] Deduced a trap composed of 11 places in 135 ms
[2020-05-12 03:07:02] [INFO ] Deduced a trap composed of 114 places in 136 ms
[2020-05-12 03:07:02] [INFO ] Deduced a trap composed of 120 places in 143 ms
[2020-05-12 03:07:02] [INFO ] Deduced a trap composed of 123 places in 136 ms
[2020-05-12 03:07:02] [INFO ] Deduced a trap composed of 25 places in 145 ms
[2020-05-12 03:07:02] [INFO ] Deduced a trap composed of 33 places in 167 ms
[2020-05-12 03:07:02] [INFO ] Deduced a trap composed of 36 places in 141 ms
[2020-05-12 03:07:03] [INFO ] Deduced a trap composed of 17 places in 147 ms
[2020-05-12 03:07:03] [INFO ] Deduced a trap composed of 18 places in 140 ms
[2020-05-12 03:07:03] [INFO ] Deduced a trap composed of 21 places in 346 ms
[2020-05-12 03:07:03] [INFO ] Deduced a trap composed of 36 places in 165 ms
[2020-05-12 03:07:03] [INFO ] Deduced a trap composed of 35 places in 157 ms
[2020-05-12 03:07:04] [INFO ] Deduced a trap composed of 22 places in 172 ms
[2020-05-12 03:07:04] [INFO ] Deduced a trap composed of 106 places in 150 ms
[2020-05-12 03:07:04] [INFO ] Deduced a trap composed of 28 places in 155 ms
[2020-05-12 03:07:04] [INFO ] Deduced a trap composed of 117 places in 161 ms
[2020-05-12 03:07:04] [INFO ] Deduced a trap composed of 42 places in 109 ms
[2020-05-12 03:07:05] [INFO ] Deduced a trap composed of 26 places in 164 ms
[2020-05-12 03:07:05] [INFO ] Deduced a trap composed of 119 places in 142 ms
[2020-05-12 03:07:05] [INFO ] Deduced a trap composed of 29 places in 124 ms
[2020-05-12 03:07:05] [INFO ] Deduced a trap composed of 40 places in 201 ms
[2020-05-12 03:07:05] [INFO ] Deduced a trap composed of 43 places in 127 ms
[2020-05-12 03:07:05] [INFO ] Deduced a trap composed of 55 places in 160 ms
[2020-05-12 03:07:06] [INFO ] Deduced a trap composed of 120 places in 132 ms
[2020-05-12 03:07:06] [INFO ] Deduced a trap composed of 125 places in 153 ms
[2020-05-12 03:07:06] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s28 s29 s30 s34 s35 s38 s39 s42 s43 s44 s45 s63 s65 s67 s69 s75 s78 s79 s80 s81 s85 s94 s100 s106 s126 s127 s137 s140 s141 s143 s144 s146 s147 s157 s158 s159 s163 s164 s165 s195 s196 s197 s201 s202 s203 s215 s216 s228 s231 s274 s276 s280 s285 s290 s294 s296 s300 s305 s310 s315 s325 s330 s335 s350 s355 s360 s369 s374 s384 s394 s398 s399 s400 s401 s402 s403 s404 s405 s406 s407 s408 s409 s410 s413 s414 s423 s424 s425 s426 s429 s430 s439 s440 s441 s452 s453 s454 s455 s456 s457 s466 s467 s476 s477 s487 s488 s491 s492 s495 s496 s501 s502 s507 s508 s509 s510 s515 s516 s517 s518 s521 s557) 0)") while checking expression at index 0
[2020-05-12 03:07:06] [INFO ] [Real]Absence check using 53 positive place invariants in 34 ms returned sat
[2020-05-12 03:07:06] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 21 ms returned sat
[2020-05-12 03:07:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:07:07] [INFO ] [Real]Absence check using state equation in 610 ms returned sat
[2020-05-12 03:07:07] [INFO ] Deduced a trap composed of 11 places in 135 ms
[2020-05-12 03:07:07] [INFO ] Deduced a trap composed of 12 places in 151 ms
[2020-05-12 03:07:07] [INFO ] Deduced a trap composed of 18 places in 184 ms
[2020-05-12 03:07:07] [INFO ] Deduced a trap composed of 17 places in 152 ms
[2020-05-12 03:07:07] [INFO ] Deduced a trap composed of 18 places in 137 ms
[2020-05-12 03:07:08] [INFO ] Deduced a trap composed of 20 places in 134 ms
[2020-05-12 03:07:08] [INFO ] Deduced a trap composed of 119 places in 250 ms
[2020-05-12 03:07:08] [INFO ] Deduced a trap composed of 97 places in 134 ms
[2020-05-12 03:07:08] [INFO ] Deduced a trap composed of 18 places in 152 ms
[2020-05-12 03:07:08] [INFO ] Deduced a trap composed of 21 places in 126 ms
[2020-05-12 03:07:08] [INFO ] Deduced a trap composed of 30 places in 127 ms
[2020-05-12 03:07:09] [INFO ] Deduced a trap composed of 17 places in 124 ms
[2020-05-12 03:07:09] [INFO ] Deduced a trap composed of 23 places in 126 ms
[2020-05-12 03:07:09] [INFO ] Deduced a trap composed of 19 places in 124 ms
[2020-05-12 03:07:09] [INFO ] Deduced a trap composed of 21 places in 149 ms
[2020-05-12 03:07:09] [INFO ] Deduced a trap composed of 18 places in 142 ms
[2020-05-12 03:07:09] [INFO ] Deduced a trap composed of 14 places in 175 ms
[2020-05-12 03:07:10] [INFO ] Deduced a trap composed of 18 places in 142 ms
[2020-05-12 03:07:10] [INFO ] Deduced a trap composed of 23 places in 160 ms
[2020-05-12 03:07:10] [INFO ] Deduced a trap composed of 22 places in 151 ms
[2020-05-12 03:07:10] [INFO ] Deduced a trap composed of 28 places in 131 ms
[2020-05-12 03:07:10] [INFO ] Deduced a trap composed of 103 places in 130 ms
[2020-05-12 03:07:10] [INFO ] Deduced a trap composed of 96 places in 125 ms
[2020-05-12 03:07:10] [INFO ] Deduced a trap composed of 22 places in 118 ms
[2020-05-12 03:07:11] [INFO ] Deduced a trap composed of 24 places in 37 ms
[2020-05-12 03:07:11] [INFO ] Deduced a trap composed of 17 places in 37 ms
[2020-05-12 03:07:11] [INFO ] Deduced a trap composed of 21 places in 96 ms
[2020-05-12 03:07:11] [INFO ] Deduced a trap composed of 26 places in 54 ms
[2020-05-12 03:07:11] [INFO ] Deduced a trap composed of 25 places in 48 ms
[2020-05-12 03:07:11] [INFO ] Deduced a trap composed of 41 places in 48 ms
[2020-05-12 03:07:11] [INFO ] Deduced a trap composed of 31 places in 55 ms
[2020-05-12 03:07:11] [INFO ] Deduced a trap composed of 26 places in 38 ms
[2020-05-12 03:07:11] [INFO ] Deduced a trap composed of 37 places in 36 ms
[2020-05-12 03:07:11] [INFO ] Deduced a trap composed of 20 places in 38 ms
[2020-05-12 03:07:11] [INFO ] Deduced a trap composed of 38 places in 37 ms
[2020-05-12 03:07:11] [INFO ] Deduced a trap composed of 28 places in 34 ms
[2020-05-12 03:07:11] [INFO ] Deduced a trap composed of 21 places in 45 ms
[2020-05-12 03:07:11] [INFO ] Deduced a trap composed of 40 places in 33 ms
[2020-05-12 03:07:11] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 4893 ms
[2020-05-12 03:07:11] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:07:12] [INFO ] [Nat]Absence check using 53 positive place invariants in 57 ms returned sat
[2020-05-12 03:07:12] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 20 ms returned sat
[2020-05-12 03:07:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:07:12] [INFO ] [Nat]Absence check using state equation in 596 ms returned sat
[2020-05-12 03:07:12] [INFO ] Deduced a trap composed of 12 places in 248 ms
[2020-05-12 03:07:13] [INFO ] Deduced a trap composed of 22 places in 269 ms
[2020-05-12 03:07:13] [INFO ] Deduced a trap composed of 21 places in 140 ms
[2020-05-12 03:07:13] [INFO ] Deduced a trap composed of 14 places in 138 ms
[2020-05-12 03:07:13] [INFO ] Deduced a trap composed of 20 places in 152 ms
[2020-05-12 03:07:13] [INFO ] Deduced a trap composed of 19 places in 154 ms
[2020-05-12 03:07:14] [INFO ] Deduced a trap composed of 23 places in 132 ms
[2020-05-12 03:07:14] [INFO ] Deduced a trap composed of 18 places in 129 ms
[2020-05-12 03:07:14] [INFO ] Deduced a trap composed of 21 places in 151 ms
[2020-05-12 03:07:14] [INFO ] Deduced a trap composed of 16 places in 282 ms
[2020-05-12 03:07:14] [INFO ] Deduced a trap composed of 18 places in 202 ms
[2020-05-12 03:07:15] [INFO ] Deduced a trap composed of 102 places in 144 ms
[2020-05-12 03:07:15] [INFO ] Deduced a trap composed of 26 places in 174 ms
[2020-05-12 03:07:15] [INFO ] Deduced a trap composed of 22 places in 121 ms
[2020-05-12 03:07:15] [INFO ] Deduced a trap composed of 23 places in 46 ms
[2020-05-12 03:07:15] [INFO ] Deduced a trap composed of 39 places in 44 ms
[2020-05-12 03:07:15] [INFO ] Deduced a trap composed of 22 places in 103 ms
[2020-05-12 03:07:15] [INFO ] Deduced a trap composed of 26 places in 36 ms
[2020-05-12 03:07:15] [INFO ] Deduced a trap composed of 18 places in 32 ms
[2020-05-12 03:07:15] [INFO ] Deduced a trap composed of 25 places in 32 ms
[2020-05-12 03:07:15] [INFO ] Deduced a trap composed of 23 places in 32 ms
[2020-05-12 03:07:15] [INFO ] Deduced a trap composed of 23 places in 21 ms
[2020-05-12 03:07:16] [INFO ] Deduced a trap composed of 24 places in 54 ms
[2020-05-12 03:07:16] [INFO ] Deduced a trap composed of 27 places in 38 ms
[2020-05-12 03:07:16] [INFO ] Deduced a trap composed of 24 places in 35 ms
[2020-05-12 03:07:16] [INFO ] Deduced a trap composed of 19 places in 25 ms
[2020-05-12 03:07:16] [INFO ] Deduced a trap composed of 26 places in 24 ms
[2020-05-12 03:07:16] [INFO ] Deduced a trap composed of 11 places in 23 ms
[2020-05-12 03:07:16] [INFO ] Deduced a trap composed of 19 places in 22 ms
[2020-05-12 03:07:16] [INFO ] Deduced a trap composed of 20 places in 20 ms
[2020-05-12 03:07:16] [INFO ] Deduced a trap composed of 25 places in 23 ms
[2020-05-12 03:07:16] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 3669 ms
[2020-05-12 03:07:16] [INFO ] Computed and/alt/rep : 500/2079/500 causal constraints in 24 ms.
[2020-05-12 03:07:18] [INFO ] Added : 279 causal constraints over 56 iterations in 2062 ms. Result :sat
[2020-05-12 03:07:18] [INFO ] Deduced a trap composed of 46 places in 49 ms
[2020-05-12 03:07:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2020-05-12 03:07:18] [INFO ] [Real]Absence check using 53 positive place invariants in 34 ms returned sat
[2020-05-12 03:07:18] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 19 ms returned sat
[2020-05-12 03:07:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:07:19] [INFO ] [Real]Absence check using state equation in 591 ms returned sat
[2020-05-12 03:07:19] [INFO ] Deduced a trap composed of 17 places in 231 ms
[2020-05-12 03:07:19] [INFO ] Deduced a trap composed of 28 places in 186 ms
[2020-05-12 03:07:19] [INFO ] Deduced a trap composed of 119 places in 157 ms
[2020-05-12 03:07:20] [INFO ] Deduced a trap composed of 30 places in 146 ms
[2020-05-12 03:07:20] [INFO ] Deduced a trap composed of 33 places in 141 ms
[2020-05-12 03:07:20] [INFO ] Deduced a trap composed of 107 places in 152 ms
[2020-05-12 03:07:20] [INFO ] Deduced a trap composed of 12 places in 173 ms
[2020-05-12 03:07:20] [INFO ] Deduced a trap composed of 101 places in 190 ms
[2020-05-12 03:07:20] [INFO ] Deduced a trap composed of 22 places in 178 ms
[2020-05-12 03:07:21] [INFO ] Deduced a trap composed of 12 places in 136 ms
[2020-05-12 03:07:22] [INFO ] Deduced a trap composed of 20 places in 1781 ms
[2020-05-12 03:07:23] [INFO ] Deduced a trap composed of 30 places in 686 ms
[2020-05-12 03:07:24] [INFO ] Deduced a trap composed of 18 places in 382 ms
[2020-05-12 03:07:24] [INFO ] Deduced a trap composed of 19 places in 161 ms
[2020-05-12 03:07:24] [INFO ] Deduced a trap composed of 120 places in 165 ms
[2020-05-12 03:07:24] [INFO ] Deduced a trap composed of 21 places in 175 ms
[2020-05-12 03:07:24] [INFO ] Deduced a trap composed of 35 places in 156 ms
[2020-05-12 03:07:24] [INFO ] Deduced a trap composed of 20 places in 163 ms
[2020-05-12 03:07:25] [INFO ] Deduced a trap composed of 16 places in 196 ms
[2020-05-12 03:07:25] [INFO ] Deduced a trap composed of 23 places in 159 ms
[2020-05-12 03:07:25] [INFO ] Deduced a trap composed of 23 places in 166 ms
[2020-05-12 03:07:25] [INFO ] Deduced a trap composed of 26 places in 146 ms
[2020-05-12 03:07:25] [INFO ] Deduced a trap composed of 33 places in 161 ms
[2020-05-12 03:07:26] [INFO ] Deduced a trap composed of 28 places in 165 ms
[2020-05-12 03:07:26] [INFO ] Deduced a trap composed of 104 places in 143 ms
[2020-05-12 03:07:26] [INFO ] Deduced a trap composed of 23 places in 165 ms
[2020-05-12 03:07:26] [INFO ] Deduced a trap composed of 30 places in 167 ms
[2020-05-12 03:07:26] [INFO ] Deduced a trap composed of 37 places in 138 ms
[2020-05-12 03:07:27] [INFO ] Deduced a trap composed of 23 places in 137 ms
[2020-05-12 03:07:27] [INFO ] Deduced a trap composed of 44 places in 159 ms
[2020-05-12 03:07:27] [INFO ] Deduced a trap composed of 18 places in 158 ms
[2020-05-12 03:07:27] [INFO ] Deduced a trap composed of 117 places in 170 ms
[2020-05-12 03:07:27] [INFO ] Deduced a trap composed of 20 places in 152 ms
[2020-05-12 03:07:27] [INFO ] Deduced a trap composed of 32 places in 165 ms
[2020-05-12 03:07:28] [INFO ] Deduced a trap composed of 31 places in 158 ms
[2020-05-12 03:07:28] [INFO ] Deduced a trap composed of 30 places in 155 ms
[2020-05-12 03:07:28] [INFO ] Deduced a trap composed of 38 places in 163 ms
[2020-05-12 03:07:28] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 9252 ms
[2020-05-12 03:07:28] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:07:28] [INFO ] [Nat]Absence check using 53 positive place invariants in 38 ms returned sat
[2020-05-12 03:07:28] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 19 ms returned sat
[2020-05-12 03:07:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:07:29] [INFO ] [Nat]Absence check using state equation in 600 ms returned sat
[2020-05-12 03:07:29] [INFO ] Deduced a trap composed of 17 places in 147 ms
[2020-05-12 03:07:29] [INFO ] Deduced a trap composed of 22 places in 151 ms
[2020-05-12 03:07:29] [INFO ] Deduced a trap composed of 103 places in 181 ms
[2020-05-12 03:07:29] [INFO ] Deduced a trap composed of 12 places in 176 ms
[2020-05-12 03:07:30] [INFO ] Deduced a trap composed of 16 places in 180 ms
[2020-05-12 03:07:30] [INFO ] Deduced a trap composed of 12 places in 192 ms
[2020-05-12 03:07:30] [INFO ] Deduced a trap composed of 26 places in 189 ms
[2020-05-12 03:07:30] [INFO ] Deduced a trap composed of 17 places in 173 ms
[2020-05-12 03:07:30] [INFO ] Deduced a trap composed of 19 places in 172 ms
[2020-05-12 03:07:31] [INFO ] Deduced a trap composed of 109 places in 164 ms
[2020-05-12 03:07:31] [INFO ] Deduced a trap composed of 20 places in 145 ms
[2020-05-12 03:07:31] [INFO ] Deduced a trap composed of 21 places in 142 ms
[2020-05-12 03:07:31] [INFO ] Deduced a trap composed of 124 places in 146 ms
[2020-05-12 03:07:31] [INFO ] Deduced a trap composed of 119 places in 138 ms
[2020-05-12 03:07:31] [INFO ] Deduced a trap composed of 115 places in 129 ms
[2020-05-12 03:07:32] [INFO ] Deduced a trap composed of 27 places in 137 ms
[2020-05-12 03:07:32] [INFO ] Deduced a trap composed of 27 places in 136 ms
[2020-05-12 03:07:32] [INFO ] Deduced a trap composed of 17 places in 152 ms
[2020-05-12 03:07:32] [INFO ] Deduced a trap composed of 98 places in 186 ms
[2020-05-12 03:07:32] [INFO ] Deduced a trap composed of 22 places in 145 ms
[2020-05-12 03:07:33] [INFO ] Deduced a trap composed of 102 places in 143 ms
[2020-05-12 03:07:33] [INFO ] Deduced a trap composed of 21 places in 161 ms
[2020-05-12 03:07:33] [INFO ] Deduced a trap composed of 21 places in 158 ms
[2020-05-12 03:07:33] [INFO ] Deduced a trap composed of 98 places in 159 ms
[2020-05-12 03:07:33] [INFO ] Deduced a trap composed of 107 places in 156 ms
[2020-05-12 03:07:34] [INFO ] Deduced a trap composed of 26 places in 127 ms
[2020-05-12 03:07:34] [INFO ] Deduced a trap composed of 29 places in 130 ms
[2020-05-12 03:07:34] [INFO ] Deduced a trap composed of 31 places in 129 ms
[2020-05-12 03:07:34] [INFO ] Deduced a trap composed of 102 places in 126 ms
[2020-05-12 03:07:34] [INFO ] Deduced a trap composed of 105 places in 140 ms
[2020-05-12 03:07:34] [INFO ] Deduced a trap composed of 24 places in 72 ms
[2020-05-12 03:07:34] [INFO ] Deduced a trap composed of 36 places in 63 ms
[2020-05-12 03:07:34] [INFO ] Deduced a trap composed of 26 places in 72 ms
[2020-05-12 03:07:34] [INFO ] Deduced a trap composed of 31 places in 66 ms
[2020-05-12 03:07:35] [INFO ] Deduced a trap composed of 34 places in 69 ms
[2020-05-12 03:07:35] [INFO ] Deduced a trap composed of 31 places in 133 ms
[2020-05-12 03:07:35] [INFO ] Deduced a trap composed of 30 places in 129 ms
[2020-05-12 03:07:35] [INFO ] Deduced a trap composed of 28 places in 133 ms
[2020-05-12 03:07:35] [INFO ] Deduced a trap composed of 36 places in 120 ms
[2020-05-12 03:07:35] [INFO ] Deduced a trap composed of 35 places in 121 ms
[2020-05-12 03:07:35] [INFO ] Deduced a trap composed of 37 places in 128 ms
[2020-05-12 03:07:36] [INFO ] Deduced a trap composed of 41 places in 66 ms
[2020-05-12 03:07:36] [INFO ] Deduced a trap composed of 44 places in 125 ms
[2020-05-12 03:07:36] [INFO ] Deduced a trap composed of 34 places in 126 ms
[2020-05-12 03:07:36] [INFO ] Deduced a trap composed of 26 places in 126 ms
[2020-05-12 03:07:36] [INFO ] Deduced a trap composed of 100 places in 121 ms
[2020-05-12 03:07:36] [INFO ] Deduced a trap composed of 38 places in 118 ms
[2020-05-12 03:07:37] [INFO ] Deduced a trap composed of 36 places in 255 ms
[2020-05-12 03:07:37] [INFO ] Deduced a trap composed of 105 places in 121 ms
[2020-05-12 03:07:37] [INFO ] Deduced a trap composed of 23 places in 64 ms
[2020-05-12 03:07:37] [INFO ] Deduced a trap composed of 44 places in 52 ms
[2020-05-12 03:07:37] [INFO ] Deduced a trap composed of 39 places in 44 ms
[2020-05-12 03:07:37] [INFO ] Deduced a trap composed of 33 places in 59 ms
[2020-05-12 03:07:37] [INFO ] Deduced a trap composed of 37 places in 61 ms
[2020-05-12 03:07:37] [INFO ] Deduced a trap composed of 40 places in 58 ms
[2020-05-12 03:07:37] [INFO ] Deduced a trap composed of 41 places in 56 ms
[2020-05-12 03:07:37] [INFO ] Trap strengthening (SAT) tested/added 57/56 trap constraints in 8515 ms
[2020-05-12 03:07:37] [INFO ] Computed and/alt/rep : 500/2079/500 causal constraints in 24 ms.
[2020-05-12 03:07:40] [INFO ] Added : 330 causal constraints over 66 iterations in 2741 ms. Result :sat
[2020-05-12 03:07:40] [INFO ] Deduced a trap composed of 124 places in 137 ms
[2020-05-12 03:07:40] [INFO ] Deduced a trap composed of 135 places in 150 ms
[2020-05-12 03:07:41] [INFO ] Deduced a trap composed of 133 places in 112 ms
[2020-05-12 03:07:41] [INFO ] Deduced a trap composed of 133 places in 135 ms
[2020-05-12 03:07:41] [INFO ] Deduced a trap composed of 129 places in 111 ms
[2020-05-12 03:07:41] [INFO ] Deduced a trap composed of 130 places in 140 ms
[2020-05-12 03:07:41] [INFO ] Deduced a trap composed of 131 places in 105 ms
[2020-05-12 03:07:41] [INFO ] Deduced a trap composed of 42 places in 104 ms
[2020-05-12 03:07:42] [INFO ] Deduced a trap composed of 132 places in 145 ms
[2020-05-12 03:07:42] [INFO ] Deduced a trap composed of 124 places in 119 ms
[2020-05-12 03:07:42] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1870 ms
[2020-05-12 03:07:42] [INFO ] [Real]Absence check using 53 positive place invariants in 29 ms returned sat
[2020-05-12 03:07:42] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 19 ms returned sat
[2020-05-12 03:07:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:07:43] [INFO ] [Real]Absence check using state equation in 654 ms returned sat
[2020-05-12 03:07:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:07:43] [INFO ] [Nat]Absence check using 53 positive place invariants in 55 ms returned sat
[2020-05-12 03:07:43] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 18 ms returned sat
[2020-05-12 03:07:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:07:43] [INFO ] [Nat]Absence check using state equation in 581 ms returned sat
[2020-05-12 03:07:43] [INFO ] Deduced a trap composed of 94 places in 155 ms
[2020-05-12 03:07:44] [INFO ] Deduced a trap composed of 19 places in 132 ms
[2020-05-12 03:07:44] [INFO ] Deduced a trap composed of 21 places in 138 ms
[2020-05-12 03:07:44] [INFO ] Deduced a trap composed of 23 places in 132 ms
[2020-05-12 03:07:44] [INFO ] Deduced a trap composed of 11 places in 137 ms
[2020-05-12 03:07:44] [INFO ] Deduced a trap composed of 13 places in 133 ms
[2020-05-12 03:07:44] [INFO ] Deduced a trap composed of 31 places in 130 ms
[2020-05-12 03:07:45] [INFO ] Deduced a trap composed of 34 places in 139 ms
[2020-05-12 03:07:45] [INFO ] Deduced a trap composed of 16 places in 144 ms
[2020-05-12 03:07:45] [INFO ] Deduced a trap composed of 22 places in 126 ms
[2020-05-12 03:07:45] [INFO ] Deduced a trap composed of 17 places in 137 ms
[2020-05-12 03:07:45] [INFO ] Deduced a trap composed of 20 places in 133 ms
[2020-05-12 03:07:45] [INFO ] Deduced a trap composed of 24 places in 128 ms
[2020-05-12 03:07:45] [INFO ] Deduced a trap composed of 15 places in 143 ms
[2020-05-12 03:07:46] [INFO ] Deduced a trap composed of 28 places in 150 ms
[2020-05-12 03:07:46] [INFO ] Deduced a trap composed of 112 places in 156 ms
[2020-05-12 03:07:46] [INFO ] Deduced a trap composed of 20 places in 111 ms
[2020-05-12 03:07:46] [INFO ] Deduced a trap composed of 22 places in 121 ms
[2020-05-12 03:07:46] [INFO ] Deduced a trap composed of 36 places in 158 ms
[2020-05-12 03:07:46] [INFO ] Deduced a trap composed of 40 places in 121 ms
[2020-05-12 03:07:47] [INFO ] Deduced a trap composed of 31 places in 144 ms
[2020-05-12 03:07:47] [INFO ] Deduced a trap composed of 102 places in 153 ms
[2020-05-12 03:07:47] [INFO ] Deduced a trap composed of 36 places in 121 ms
[2020-05-12 03:07:47] [INFO ] Deduced a trap composed of 34 places in 146 ms
[2020-05-12 03:07:47] [INFO ] Deduced a trap composed of 99 places in 122 ms
[2020-05-12 03:07:47] [INFO ] Deduced a trap composed of 40 places in 137 ms
[2020-05-12 03:07:47] [INFO ] Deduced a trap composed of 13 places in 151 ms
[2020-05-12 03:07:48] [INFO ] Deduced a trap composed of 18 places in 133 ms
[2020-05-12 03:07:48] [INFO ] Deduced a trap composed of 96 places in 135 ms
[2020-05-12 03:07:48] [INFO ] Deduced a trap composed of 35 places in 134 ms
[2020-05-12 03:07:48] [INFO ] Deduced a trap composed of 110 places in 144 ms
[2020-05-12 03:07:48] [INFO ] Deduced a trap composed of 27 places in 136 ms
[2020-05-12 03:07:48] [INFO ] Deduced a trap composed of 11 places in 136 ms
[2020-05-12 03:07:49] [INFO ] Deduced a trap composed of 37 places in 133 ms
[2020-05-12 03:07:49] [INFO ] Deduced a trap composed of 97 places in 127 ms
[2020-05-12 03:07:49] [INFO ] Deduced a trap composed of 43 places in 149 ms
[2020-05-12 03:07:49] [INFO ] Deduced a trap composed of 43 places in 133 ms
[2020-05-12 03:07:49] [INFO ] Deduced a trap composed of 33 places in 134 ms
[2020-05-12 03:07:49] [INFO ] Deduced a trap composed of 108 places in 145 ms
[2020-05-12 03:07:49] [INFO ] Deduced a trap composed of 25 places in 125 ms
[2020-05-12 03:07:50] [INFO ] Deduced a trap composed of 47 places in 119 ms
[2020-05-12 03:07:50] [INFO ] Deduced a trap composed of 100 places in 124 ms
[2020-05-12 03:07:50] [INFO ] Deduced a trap composed of 108 places in 122 ms
[2020-05-12 03:07:50] [INFO ] Deduced a trap composed of 100 places in 118 ms
[2020-05-12 03:07:50] [INFO ] Deduced a trap composed of 32 places in 137 ms
[2020-05-12 03:07:50] [INFO ] Deduced a trap composed of 104 places in 121 ms
[2020-05-12 03:07:50] [INFO ] Deduced a trap composed of 110 places in 143 ms
[2020-05-12 03:07:51] [INFO ] Deduced a trap composed of 22 places in 129 ms
[2020-05-12 03:07:51] [INFO ] Deduced a trap composed of 40 places in 110 ms
[2020-05-12 03:07:51] [INFO ] Deduced a trap composed of 42 places in 192 ms
[2020-05-12 03:07:51] [INFO ] Deduced a trap composed of 40 places in 141 ms
[2020-05-12 03:07:51] [INFO ] Deduced a trap composed of 107 places in 128 ms
[2020-05-12 03:07:51] [INFO ] Deduced a trap composed of 32 places in 129 ms
[2020-05-12 03:07:52] [INFO ] Deduced a trap composed of 31 places in 131 ms
[2020-05-12 03:07:52] [INFO ] Deduced a trap composed of 33 places in 110 ms
[2020-05-12 03:07:52] [INFO ] Deduced a trap composed of 111 places in 114 ms
[2020-05-12 03:07:52] [INFO ] Deduced a trap composed of 39 places in 120 ms
[2020-05-12 03:07:52] [INFO ] Deduced a trap composed of 45 places in 144 ms
[2020-05-12 03:07:52] [INFO ] Deduced a trap composed of 110 places in 103 ms
[2020-05-12 03:07:52] [INFO ] Deduced a trap composed of 107 places in 119 ms
[2020-05-12 03:07:52] [INFO ] Deduced a trap composed of 41 places in 113 ms
[2020-05-12 03:07:53] [INFO ] Deduced a trap composed of 102 places in 109 ms
[2020-05-12 03:07:53] [INFO ] Deduced a trap composed of 103 places in 106 ms
[2020-05-12 03:07:53] [INFO ] Deduced a trap composed of 108 places in 116 ms
[2020-05-12 03:07:53] [INFO ] Deduced a trap composed of 37 places in 112 ms
[2020-05-12 03:07:53] [INFO ] Deduced a trap composed of 29 places in 94 ms
[2020-05-12 03:07:53] [INFO ] Deduced a trap composed of 111 places in 96 ms
[2020-05-12 03:07:53] [INFO ] Deduced a trap composed of 26 places in 108 ms
[2020-05-12 03:07:53] [INFO ] Deduced a trap composed of 25 places in 72 ms
[2020-05-12 03:07:54] [INFO ] Deduced a trap composed of 48 places in 66 ms
[2020-05-12 03:07:54] [INFO ] Deduced a trap composed of 58 places in 57 ms
[2020-05-12 03:07:54] [INFO ] Deduced a trap composed of 41 places in 66 ms
[2020-05-12 03:07:54] [INFO ] Deduced a trap composed of 47 places in 53 ms
[2020-05-12 03:07:54] [INFO ] Deduced a trap composed of 46 places in 45 ms
[2020-05-12 03:07:54] [INFO ] Trap strengthening (SAT) tested/added 75/74 trap constraints in 10534 ms
[2020-05-12 03:07:54] [INFO ] Computed and/alt/rep : 500/2079/500 causal constraints in 23 ms.
[2020-05-12 03:07:57] [INFO ] Added : 338 causal constraints over 68 iterations in 2886 ms. Result :sat
[2020-05-12 03:07:57] [INFO ] Deduced a trap composed of 133 places in 181 ms
[2020-05-12 03:07:57] [INFO ] Deduced a trap composed of 128 places in 146 ms
[2020-05-12 03:07:57] [INFO ] Deduced a trap composed of 132 places in 116 ms
[2020-05-12 03:07:58] [INFO ] Deduced a trap composed of 131 places in 125 ms
[2020-05-12 03:07:58] [INFO ] Deduced a trap composed of 125 places in 126 ms
[2020-05-12 03:07:58] [INFO ] Deduced a trap composed of 129 places in 136 ms
[2020-05-12 03:07:58] [INFO ] Deduced a trap composed of 119 places in 133 ms
[2020-05-12 03:07:58] [INFO ] Deduced a trap composed of 125 places in 121 ms
[2020-05-12 03:07:59] [INFO ] Deduced a trap composed of 121 places in 128 ms
[2020-05-12 03:07:59] [INFO ] Deduced a trap composed of 127 places in 120 ms
[2020-05-12 03:07:59] [INFO ] Deduced a trap composed of 125 places in 136 ms
[2020-05-12 03:07:59] [INFO ] Deduced a trap composed of 128 places in 124 ms
[2020-05-12 03:07:59] [INFO ] Deduced a trap composed of 134 places in 126 ms
[2020-05-12 03:08:00] [INFO ] Deduced a trap composed of 118 places in 135 ms
[2020-05-12 03:08:00] [INFO ] Deduced a trap composed of 126 places in 131 ms
[2020-05-12 03:08:00] [INFO ] Deduced a trap composed of 123 places in 123 ms
[2020-05-12 03:08:00] [INFO ] Deduced a trap composed of 124 places in 110 ms
[2020-05-12 03:08:00] [INFO ] Deduced a trap composed of 139 places in 114 ms
[2020-05-12 03:08:00] [INFO ] Deduced a trap composed of 131 places in 120 ms
[2020-05-12 03:08:01] [INFO ] Deduced a trap composed of 129 places in 124 ms
[2020-05-12 03:08:01] [INFO ] Deduced a trap composed of 136 places in 114 ms
[2020-05-12 03:08:01] [INFO ] Deduced a trap composed of 132 places in 133 ms
[2020-05-12 03:08:01] [INFO ] Deduced a trap composed of 122 places in 119 ms
[2020-05-12 03:08:01] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 4693 ms
[2020-05-12 03:08:02] [INFO ] [Real]Absence check using 53 positive place invariants in 49 ms returned sat
[2020-05-12 03:08:02] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 18 ms returned sat
[2020-05-12 03:08:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:08:02] [INFO ] [Real]Absence check using state equation in 608 ms returned sat
[2020-05-12 03:08:02] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:08:02] [INFO ] [Nat]Absence check using 53 positive place invariants in 73 ms returned sat
[2020-05-12 03:08:02] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 25 ms returned sat
[2020-05-12 03:08:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:08:03] [INFO ] [Nat]Absence check using state equation in 557 ms returned sat
[2020-05-12 03:08:03] [INFO ] Deduced a trap composed of 22 places in 193 ms
[2020-05-12 03:08:03] [INFO ] Deduced a trap composed of 11 places in 146 ms
[2020-05-12 03:08:03] [INFO ] Deduced a trap composed of 12 places in 181 ms
[2020-05-12 03:08:04] [INFO ] Deduced a trap composed of 101 places in 156 ms
[2020-05-12 03:08:04] [INFO ] Deduced a trap composed of 23 places in 139 ms
[2020-05-12 03:08:04] [INFO ] Deduced a trap composed of 27 places in 167 ms
[2020-05-12 03:08:04] [INFO ] Deduced a trap composed of 26 places in 144 ms
[2020-05-12 03:08:04] [INFO ] Deduced a trap composed of 30 places in 164 ms
[2020-05-12 03:08:04] [INFO ] Deduced a trap composed of 106 places in 141 ms
[2020-05-12 03:08:05] [INFO ] Deduced a trap composed of 29 places in 127 ms
[2020-05-12 03:08:05] [INFO ] Deduced a trap composed of 40 places in 128 ms
[2020-05-12 03:08:05] [INFO ] Deduced a trap composed of 110 places in 142 ms
[2020-05-12 03:08:05] [INFO ] Deduced a trap composed of 28 places in 152 ms
[2020-05-12 03:08:05] [INFO ] Deduced a trap composed of 22 places in 138 ms
[2020-05-12 03:08:05] [INFO ] Deduced a trap composed of 38 places in 128 ms
[2020-05-12 03:08:06] [INFO ] Deduced a trap composed of 26 places in 117 ms
[2020-05-12 03:08:06] [INFO ] Deduced a trap composed of 25 places in 60 ms
[2020-05-12 03:08:06] [INFO ] Deduced a trap composed of 28 places in 85 ms
[2020-05-12 03:08:06] [INFO ] Deduced a trap composed of 20 places in 45 ms
[2020-05-12 03:08:06] [INFO ] Deduced a trap composed of 35 places in 46 ms
[2020-05-12 03:08:06] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2972 ms
[2020-05-12 03:08:06] [INFO ] Computed and/alt/rep : 500/2079/500 causal constraints in 23 ms.
[2020-05-12 03:08:08] [INFO ] Added : 309 causal constraints over 63 iterations in 2268 ms. Result :sat
[2020-05-12 03:08:08] [INFO ] [Real]Absence check using 53 positive place invariants in 54 ms returned sat
[2020-05-12 03:08:08] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 18 ms returned sat
[2020-05-12 03:08:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:08:09] [INFO ] [Real]Absence check using state equation in 600 ms returned sat
[2020-05-12 03:08:09] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:08:09] [INFO ] [Nat]Absence check using 53 positive place invariants in 62 ms returned sat
[2020-05-12 03:08:09] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 18 ms returned sat
[2020-05-12 03:08:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:08:10] [INFO ] [Nat]Absence check using state equation in 598 ms returned sat
[2020-05-12 03:08:10] [INFO ] Deduced a trap composed of 16 places in 161 ms
[2020-05-12 03:08:10] [INFO ] Deduced a trap composed of 14 places in 163 ms
[2020-05-12 03:08:10] [INFO ] Deduced a trap composed of 14 places in 145 ms
[2020-05-12 03:08:10] [INFO ] Deduced a trap composed of 12 places in 175 ms
[2020-05-12 03:08:11] [INFO ] Deduced a trap composed of 21 places in 156 ms
[2020-05-12 03:08:11] [INFO ] Deduced a trap composed of 20 places in 150 ms
[2020-05-12 03:08:11] [INFO ] Deduced a trap composed of 25 places in 141 ms
[2020-05-12 03:08:11] [INFO ] Deduced a trap composed of 21 places in 149 ms
[2020-05-12 03:08:11] [INFO ] Deduced a trap composed of 11 places in 148 ms
[2020-05-12 03:08:11] [INFO ] Deduced a trap composed of 28 places in 160 ms
[2020-05-12 03:08:12] [INFO ] Deduced a trap composed of 103 places in 165 ms
[2020-05-12 03:08:12] [INFO ] Deduced a trap composed of 23 places in 163 ms
[2020-05-12 03:08:12] [INFO ] Deduced a trap composed of 22 places in 171 ms
[2020-05-12 03:08:12] [INFO ] Deduced a trap composed of 22 places in 163 ms
[2020-05-12 03:08:12] [INFO ] Deduced a trap composed of 44 places in 163 ms
[2020-05-12 03:08:13] [INFO ] Deduced a trap composed of 17 places in 158 ms
[2020-05-12 03:08:13] [INFO ] Deduced a trap composed of 29 places in 191 ms
[2020-05-12 03:08:13] [INFO ] Deduced a trap composed of 21 places in 135 ms
[2020-05-12 03:08:13] [INFO ] Deduced a trap composed of 33 places in 146 ms
[2020-05-12 03:08:13] [INFO ] Deduced a trap composed of 129 places in 152 ms
[2020-05-12 03:08:13] [INFO ] Deduced a trap composed of 24 places in 153 ms
[2020-05-12 03:08:14] [INFO ] Deduced a trap composed of 104 places in 172 ms
[2020-05-12 03:08:14] [INFO ] Deduced a trap composed of 35 places in 135 ms
[2020-05-12 03:08:14] [INFO ] Deduced a trap composed of 35 places in 139 ms
[2020-05-12 03:08:14] [INFO ] Deduced a trap composed of 22 places in 139 ms
[2020-05-12 03:08:14] [INFO ] Deduced a trap composed of 22 places in 156 ms
[2020-05-12 03:08:14] [INFO ] Deduced a trap composed of 31 places in 133 ms
[2020-05-12 03:08:15] [INFO ] Deduced a trap composed of 38 places in 142 ms
[2020-05-12 03:08:15] [INFO ] Deduced a trap composed of 21 places in 158 ms
[2020-05-12 03:08:15] [INFO ] Deduced a trap composed of 12 places in 141 ms
[2020-05-12 03:08:15] [INFO ] Deduced a trap composed of 30 places in 151 ms
[2020-05-12 03:08:15] [INFO ] Deduced a trap composed of 27 places in 145 ms
[2020-05-12 03:08:15] [INFO ] Deduced a trap composed of 32 places in 147 ms
[2020-05-12 03:08:16] [INFO ] Deduced a trap composed of 27 places in 157 ms
[2020-05-12 03:08:16] [INFO ] Deduced a trap composed of 25 places in 150 ms
[2020-05-12 03:08:16] [INFO ] Deduced a trap composed of 105 places in 136 ms
[2020-05-12 03:08:16] [INFO ] Deduced a trap composed of 27 places in 120 ms
[2020-05-12 03:08:16] [INFO ] Deduced a trap composed of 32 places in 127 ms
[2020-05-12 03:08:16] [INFO ] Deduced a trap composed of 36 places in 142 ms
[2020-05-12 03:08:16] [INFO ] Deduced a trap composed of 29 places in 136 ms
[2020-05-12 03:08:17] [INFO ] Deduced a trap composed of 28 places in 179 ms
[2020-05-12 03:08:17] [INFO ] Deduced a trap composed of 26 places in 140 ms
[2020-05-12 03:08:17] [INFO ] Deduced a trap composed of 43 places in 145 ms
[2020-05-12 03:08:17] [INFO ] Deduced a trap composed of 73 places in 140 ms
[2020-05-12 03:08:17] [INFO ] Deduced a trap composed of 69 places in 134 ms
[2020-05-12 03:08:17] [INFO ] Deduced a trap composed of 122 places in 139 ms
[2020-05-12 03:08:18] [INFO ] Deduced a trap composed of 122 places in 121 ms
[2020-05-12 03:08:18] [INFO ] Deduced a trap composed of 129 places in 133 ms
[2020-05-12 03:08:18] [INFO ] Deduced a trap composed of 145 places in 139 ms
[2020-05-12 03:08:18] [INFO ] Deduced a trap composed of 127 places in 152 ms
[2020-05-12 03:08:18] [INFO ] Deduced a trap composed of 127 places in 151 ms
[2020-05-12 03:08:18] [INFO ] Deduced a trap composed of 123 places in 151 ms
[2020-05-12 03:08:19] [INFO ] Deduced a trap composed of 130 places in 142 ms
[2020-05-12 03:08:19] [INFO ] Deduced a trap composed of 132 places in 146 ms
[2020-05-12 03:08:19] [INFO ] Deduced a trap composed of 46 places in 134 ms
[2020-05-12 03:08:19] [INFO ] Deduced a trap composed of 36 places in 151 ms
[2020-05-12 03:08:19] [INFO ] Deduced a trap composed of 65 places in 162 ms
[2020-05-12 03:08:19] [INFO ] Deduced a trap composed of 69 places in 131 ms
[2020-05-12 03:08:20] [INFO ] Deduced a trap composed of 125 places in 132 ms
[2020-05-12 03:08:20] [INFO ] Deduced a trap composed of 125 places in 156 ms
[2020-05-12 03:08:20] [INFO ] Deduced a trap composed of 127 places in 129 ms
[2020-05-12 03:08:20] [INFO ] Deduced a trap composed of 129 places in 132 ms
[2020-05-12 03:08:20] [INFO ] Deduced a trap composed of 62 places in 132 ms
[2020-05-12 03:08:20] [INFO ] Deduced a trap composed of 123 places in 136 ms
[2020-05-12 03:08:20] [INFO ] Deduced a trap composed of 128 places in 129 ms
[2020-05-12 03:08:21] [INFO ] Deduced a trap composed of 69 places in 147 ms
[2020-05-12 03:08:21] [INFO ] Deduced a trap composed of 139 places in 137 ms
[2020-05-12 03:08:21] [INFO ] Deduced a trap composed of 68 places in 126 ms
[2020-05-12 03:08:21] [INFO ] Deduced a trap composed of 143 places in 149 ms
[2020-05-12 03:08:21] [INFO ] Deduced a trap composed of 127 places in 125 ms
[2020-05-12 03:08:21] [INFO ] Deduced a trap composed of 134 places in 124 ms
[2020-05-12 03:08:22] [INFO ] Deduced a trap composed of 124 places in 138 ms
[2020-05-12 03:08:22] [INFO ] Deduced a trap composed of 55 places in 148 ms
[2020-05-12 03:08:22] [INFO ] Deduced a trap composed of 127 places in 131 ms
[2020-05-12 03:08:22] [INFO ] Deduced a trap composed of 128 places in 152 ms
[2020-05-12 03:08:22] [INFO ] Deduced a trap composed of 127 places in 131 ms
[2020-05-12 03:08:22] [INFO ] Deduced a trap composed of 139 places in 124 ms
[2020-05-12 03:08:23] [INFO ] Deduced a trap composed of 139 places in 133 ms
[2020-05-12 03:08:23] [INFO ] Deduced a trap composed of 133 places in 137 ms
[2020-05-12 03:08:23] [INFO ] Deduced a trap composed of 137 places in 145 ms
[2020-05-12 03:08:23] [INFO ] Deduced a trap composed of 47 places in 144 ms
[2020-05-12 03:08:23] [INFO ] Deduced a trap composed of 125 places in 140 ms
[2020-05-12 03:08:23] [INFO ] Deduced a trap composed of 121 places in 144 ms
[2020-05-12 03:08:24] [INFO ] Deduced a trap composed of 123 places in 167 ms
[2020-05-12 03:08:24] [INFO ] Deduced a trap composed of 128 places in 146 ms
[2020-05-12 03:08:24] [INFO ] Deduced a trap composed of 121 places in 139 ms
[2020-05-12 03:08:24] [INFO ] Deduced a trap composed of 127 places in 147 ms
[2020-05-12 03:08:24] [INFO ] Deduced a trap composed of 134 places in 142 ms
[2020-05-12 03:08:24] [INFO ] Deduced a trap composed of 133 places in 149 ms
[2020-05-12 03:08:25] [INFO ] Deduced a trap composed of 138 places in 123 ms
[2020-05-12 03:08:25] [INFO ] Deduced a trap composed of 137 places in 139 ms
[2020-05-12 03:08:25] [INFO ] Deduced a trap composed of 142 places in 132 ms
[2020-05-12 03:08:25] [INFO ] Deduced a trap composed of 139 places in 146 ms
[2020-05-12 03:08:25] [INFO ] Deduced a trap composed of 141 places in 141 ms
[2020-05-12 03:08:25] [INFO ] Deduced a trap composed of 123 places in 230 ms
[2020-05-12 03:08:26] [INFO ] Deduced a trap composed of 127 places in 169 ms
[2020-05-12 03:08:26] [INFO ] Deduced a trap composed of 139 places in 147 ms
[2020-05-12 03:08:26] [INFO ] Deduced a trap composed of 145 places in 128 ms
[2020-05-12 03:08:26] [INFO ] Deduced a trap composed of 124 places in 130 ms
[2020-05-12 03:08:26] [INFO ] Deduced a trap composed of 29 places in 131 ms
[2020-05-12 03:08:26] [INFO ] Deduced a trap composed of 124 places in 132 ms
[2020-05-12 03:08:27] [INFO ] Deduced a trap composed of 130 places in 129 ms
[2020-05-12 03:08:27] [INFO ] Deduced a trap composed of 132 places in 136 ms
[2020-05-12 03:08:27] [INFO ] Deduced a trap composed of 136 places in 141 ms
[2020-05-12 03:08:27] [INFO ] Deduced a trap composed of 135 places in 122 ms
[2020-05-12 03:08:27] [INFO ] Deduced a trap composed of 143 places in 143 ms
[2020-05-12 03:08:27] [INFO ] Deduced a trap composed of 29 places in 140 ms
[2020-05-12 03:08:28] [INFO ] Deduced a trap composed of 19 places in 153 ms
[2020-05-12 03:08:28] [INFO ] Deduced a trap composed of 20 places in 138 ms
[2020-05-12 03:08:28] [INFO ] Deduced a trap composed of 25 places in 118 ms
[2020-05-12 03:08:28] [INFO ] Deduced a trap composed of 115 places in 152 ms
[2020-05-12 03:08:28] [INFO ] Deduced a trap composed of 21 places in 122 ms
[2020-05-12 03:08:28] [INFO ] Deduced a trap composed of 116 places in 115 ms
[2020-05-12 03:08:28] [INFO ] Deduced a trap composed of 121 places in 112 ms
[2020-05-12 03:08:29] [INFO ] Deduced a trap composed of 26 places in 113 ms
[2020-05-12 03:08:29] [INFO ] Deduced a trap composed of 117 places in 112 ms
[2020-05-12 03:08:29] [INFO ] Deduced a trap composed of 130 places in 120 ms
[2020-05-12 03:08:29] [INFO ] Deduced a trap composed of 123 places in 134 ms
[2020-05-12 03:08:29] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s28 s29 s30 s58 s59 s60 s61 s62 s63 s65 s67 s69 s75 s88 s89 s90 s91 s97 s103 s137 s140 s141 s146 s147 s157 s158 s159 s201 s202 s203 s220 s221 s222 s261 s275 s285 s295 s300 s305 s310 s315 s320 s325 s330 s345 s360 s364 s369 s374 s379 s389 s394 s397 s398 s401 s402 s403 s404 s405 s406 s407 s408 s409 s410 s411 s412 s413 s414 s417 s418 s419 s420 s421 s422 s425 s426 s427 s428 s431 s441 s445 s446 s447 s448 s449 s452 s453 s456 s457 s462 s463 s466 s467 s470 s471 s476 s477 s478 s479 s484 s485 s487 s488 s489 s490 s491 s492 s495 s496 s499 s500 s507 s508 s511 s512 s513 s514 s521 s530 s531 s550 s554) 0)") while checking expression at index 5
[2020-05-12 03:08:29] [INFO ] [Real]Absence check using 53 positive place invariants in 32 ms returned sat
[2020-05-12 03:08:29] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 20 ms returned sat
[2020-05-12 03:08:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:08:30] [INFO ] [Real]Absence check using state equation in 632 ms returned sat
[2020-05-12 03:08:30] [INFO ] Deduced a trap composed of 15 places in 140 ms
[2020-05-12 03:08:30] [INFO ] Deduced a trap composed of 12 places in 153 ms
[2020-05-12 03:08:30] [INFO ] Deduced a trap composed of 106 places in 139 ms
[2020-05-12 03:08:30] [INFO ] Deduced a trap composed of 23 places in 141 ms
[2020-05-12 03:08:31] [INFO ] Deduced a trap composed of 28 places in 164 ms
[2020-05-12 03:08:31] [INFO ] Deduced a trap composed of 20 places in 143 ms
[2020-05-12 03:08:31] [INFO ] Deduced a trap composed of 105 places in 162 ms
[2020-05-12 03:08:31] [INFO ] Deduced a trap composed of 14 places in 157 ms
[2020-05-12 03:08:31] [INFO ] Deduced a trap composed of 11 places in 159 ms
[2020-05-12 03:08:32] [INFO ] Deduced a trap composed of 105 places in 161 ms
[2020-05-12 03:08:32] [INFO ] Deduced a trap composed of 103 places in 160 ms
[2020-05-12 03:08:32] [INFO ] Deduced a trap composed of 116 places in 158 ms
[2020-05-12 03:08:32] [INFO ] Deduced a trap composed of 45 places in 156 ms
[2020-05-12 03:08:32] [INFO ] Deduced a trap composed of 24 places in 179 ms
[2020-05-12 03:08:32] [INFO ] Deduced a trap composed of 24 places in 167 ms
[2020-05-12 03:08:33] [INFO ] Deduced a trap composed of 16 places in 179 ms
[2020-05-12 03:08:33] [INFO ] Deduced a trap composed of 29 places in 153 ms
[2020-05-12 03:08:33] [INFO ] Deduced a trap composed of 41 places in 132 ms
[2020-05-12 03:08:33] [INFO ] Deduced a trap composed of 136 places in 149 ms
[2020-05-12 03:08:33] [INFO ] Deduced a trap composed of 31 places in 165 ms
[2020-05-12 03:08:34] [INFO ] Deduced a trap composed of 120 places in 146 ms
[2020-05-12 03:08:34] [INFO ] Deduced a trap composed of 134 places in 150 ms
[2020-05-12 03:08:34] [INFO ] Deduced a trap composed of 128 places in 146 ms
[2020-05-12 03:08:34] [INFO ] Deduced a trap composed of 27 places in 163 ms
[2020-05-12 03:08:34] [INFO ] Deduced a trap composed of 129 places in 179 ms
[2020-05-12 03:08:34] [INFO ] Deduced a trap composed of 123 places in 178 ms
[2020-05-12 03:08:35] [INFO ] Deduced a trap composed of 47 places in 90 ms
[2020-05-12 03:08:35] [INFO ] Deduced a trap composed of 28 places in 148 ms
[2020-05-12 03:08:35] [INFO ] Deduced a trap composed of 29 places in 32 ms
[2020-05-12 03:08:35] [INFO ] Deduced a trap composed of 136 places in 171 ms
[2020-05-12 03:08:35] [INFO ] Deduced a trap composed of 124 places in 157 ms
[2020-05-12 03:08:35] [INFO ] Deduced a trap composed of 128 places in 146 ms
[2020-05-12 03:08:36] [INFO ] Deduced a trap composed of 131 places in 157 ms
[2020-05-12 03:08:36] [INFO ] Deduced a trap composed of 128 places in 153 ms
[2020-05-12 03:08:36] [INFO ] Deduced a trap composed of 136 places in 143 ms
[2020-05-12 03:08:36] [INFO ] Deduced a trap composed of 135 places in 133 ms
[2020-05-12 03:08:36] [INFO ] Deduced a trap composed of 125 places in 121 ms
[2020-05-12 03:08:36] [INFO ] Deduced a trap composed of 125 places in 146 ms
[2020-05-12 03:08:36] [INFO ] Deduced a trap composed of 114 places in 124 ms
[2020-05-12 03:08:37] [INFO ] Deduced a trap composed of 128 places in 128 ms
[2020-05-12 03:08:37] [INFO ] Deduced a trap composed of 120 places in 134 ms
[2020-05-12 03:08:37] [INFO ] Deduced a trap composed of 121 places in 120 ms
[2020-05-12 03:08:37] [INFO ] Deduced a trap composed of 121 places in 143 ms
[2020-05-12 03:08:37] [INFO ] Deduced a trap composed of 123 places in 133 ms
[2020-05-12 03:08:37] [INFO ] Deduced a trap composed of 125 places in 153 ms
[2020-05-12 03:08:38] [INFO ] Deduced a trap composed of 121 places in 152 ms
[2020-05-12 03:08:38] [INFO ] Trap strengthening (SAT) tested/added 47/46 trap constraints in 7846 ms
[2020-05-12 03:08:38] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:08:38] [INFO ] [Nat]Absence check using 53 positive place invariants in 38 ms returned sat
[2020-05-12 03:08:38] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 19 ms returned sat
[2020-05-12 03:08:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:08:38] [INFO ] [Nat]Absence check using state equation in 567 ms returned sat
[2020-05-12 03:08:39] [INFO ] Deduced a trap composed of 21 places in 178 ms
[2020-05-12 03:08:39] [INFO ] Deduced a trap composed of 17 places in 165 ms
[2020-05-12 03:08:39] [INFO ] Deduced a trap composed of 14 places in 168 ms
[2020-05-12 03:08:39] [INFO ] Deduced a trap composed of 12 places in 229 ms
[2020-05-12 03:08:40] [INFO ] Deduced a trap composed of 106 places in 311 ms
[2020-05-12 03:08:40] [INFO ] Deduced a trap composed of 104 places in 326 ms
[2020-05-12 03:08:40] [INFO ] Deduced a trap composed of 24 places in 149 ms
[2020-05-12 03:08:40] [INFO ] Deduced a trap composed of 12 places in 140 ms
[2020-05-12 03:08:40] [INFO ] Deduced a trap composed of 25 places in 135 ms
[2020-05-12 03:08:40] [INFO ] Deduced a trap composed of 14 places in 135 ms
[2020-05-12 03:08:41] [INFO ] Deduced a trap composed of 28 places in 138 ms
[2020-05-12 03:08:41] [INFO ] Deduced a trap composed of 104 places in 148 ms
[2020-05-12 03:08:41] [INFO ] Deduced a trap composed of 39 places in 149 ms
[2020-05-12 03:08:41] [INFO ] Deduced a trap composed of 27 places in 148 ms
[2020-05-12 03:08:41] [INFO ] Deduced a trap composed of 46 places in 147 ms
[2020-05-12 03:08:41] [INFO ] Deduced a trap composed of 26 places in 92 ms
[2020-05-12 03:08:42] [INFO ] Deduced a trap composed of 50 places in 85 ms
[2020-05-12 03:08:42] [INFO ] Deduced a trap composed of 32 places in 84 ms
[2020-05-12 03:08:42] [INFO ] Deduced a trap composed of 38 places in 92 ms
[2020-05-12 03:08:42] [INFO ] Deduced a trap composed of 23 places in 89 ms
[2020-05-12 03:08:42] [INFO ] Deduced a trap composed of 64 places in 82 ms
[2020-05-12 03:08:42] [INFO ] Deduced a trap composed of 40 places in 81 ms
[2020-05-12 03:08:42] [INFO ] Deduced a trap composed of 60 places in 82 ms
[2020-05-12 03:08:42] [INFO ] Deduced a trap composed of 60 places in 92 ms
[2020-05-12 03:08:42] [INFO ] Deduced a trap composed of 46 places in 52 ms
[2020-05-12 03:08:42] [INFO ] Deduced a trap composed of 131 places in 141 ms
[2020-05-12 03:08:43] [INFO ] Deduced a trap composed of 133 places in 140 ms
[2020-05-12 03:08:43] [INFO ] Deduced a trap composed of 132 places in 131 ms
[2020-05-12 03:08:43] [INFO ] Deduced a trap composed of 26 places in 46 ms
[2020-05-12 03:08:43] [INFO ] Deduced a trap composed of 42 places in 86 ms
[2020-05-12 03:08:43] [INFO ] Deduced a trap composed of 70 places in 90 ms
[2020-05-12 03:08:43] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 4748 ms
[2020-05-12 03:08:43] [INFO ] Computed and/alt/rep : 500/2079/500 causal constraints in 21 ms.
[2020-05-12 03:08:47] [INFO ] Added : 344 causal constraints over 69 iterations in 3407 ms. Result :sat
[2020-05-12 03:08:47] [INFO ] Deduced a trap composed of 127 places in 135 ms
[2020-05-12 03:08:47] [INFO ] Deduced a trap composed of 126 places in 153 ms
[2020-05-12 03:08:47] [INFO ] Deduced a trap composed of 128 places in 174 ms
[2020-05-12 03:08:47] [INFO ] Deduced a trap composed of 126 places in 137 ms
[2020-05-12 03:08:48] [INFO ] Deduced a trap composed of 116 places in 149 ms
[2020-05-12 03:08:48] [INFO ] Deduced a trap composed of 123 places in 118 ms
[2020-05-12 03:08:48] [INFO ] Deduced a trap composed of 122 places in 141 ms
[2020-05-12 03:08:48] [INFO ] Deduced a trap composed of 127 places in 133 ms
[2020-05-12 03:08:48] [INFO ] Deduced a trap composed of 127 places in 117 ms
[2020-05-12 03:08:49] [INFO ] Deduced a trap composed of 120 places in 139 ms
[2020-05-12 03:08:49] [INFO ] Deduced a trap composed of 116 places in 152 ms
[2020-05-12 03:08:49] [INFO ] Deduced a trap composed of 133 places in 138 ms
[2020-05-12 03:08:49] [INFO ] Deduced a trap composed of 128 places in 150 ms
[2020-05-12 03:08:50] [INFO ] Deduced a trap composed of 130 places in 146 ms
[2020-05-12 03:08:50] [INFO ] Deduced a trap composed of 122 places in 109 ms
[2020-05-12 03:08:50] [INFO ] Deduced a trap composed of 127 places in 110 ms
[2020-05-12 03:08:50] [INFO ] Deduced a trap composed of 118 places in 114 ms
[2020-05-12 03:08:50] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 3733 ms
[2020-05-12 03:08:51] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-05-12 03:08:51] [INFO ] Flatten gal took : 136 ms
[2020-05-12 03:08:51] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-05-12 03:08:51] [INFO ] Flatten gal took : 42 ms
FORMULA BusinessProcesses-PT-11-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-12 03:08:51] [INFO ] Applying decomposition
[2020-05-12 03:08:51] [INFO ] Flatten gal took : 47 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph9280102271834190979.txt, -o, /tmp/graph9280102271834190979.bin, -w, /tmp/graph9280102271834190979.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph9280102271834190979.bin, -l, -1, -v, -w, /tmp/graph9280102271834190979.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-12 03:08:51] [INFO ] Decomposing Gal with order
[2020-05-12 03:08:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-12 03:08:51] [INFO ] Removed a total of 260 redundant transitions.
[2020-05-12 03:08:52] [INFO ] Flatten gal took : 227 ms
[2020-05-12 03:08:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 25 ms.
[2020-05-12 03:08:52] [INFO ] Time to serialize gal into /home/mcc/execution/CTLCardinality.pnml.gal : 40 ms
[2020-05-12 03:08:52] [INFO ] Time to serialize properties into /home/mcc/execution/CTLCardinality.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLCardinality.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLCardinality.ctl], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLCardinality.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLCardinality.ctl
No direction supplied, using forward translation only.
Parsed 10 CTL formulae.
built 60 ordering constraints for composite.
built 20 ordering constraints for composite.
built 15 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 20 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 17 ordering constraints for composite.
built 18 ordering constraints for composite.
built 16 ordering constraints for composite.
built 4 ordering constraints for composite.
built 22 ordering constraints for composite.
built 16 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 12 ordering constraints for composite.
built 21 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 11 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 56 ordering constraints for composite.
built 23 ordering constraints for composite.
built 45 ordering constraints for composite.
built 23 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 24 ordering constraints for composite.
built 15 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 7 ordering constraints for composite.
built 41 ordering constraints for composite.
built 71 ordering constraints for composite.
built 16 ordering constraints for composite.
built 16 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 20 ordering constraints for composite.
built 19 ordering constraints for composite.
built 6 ordering constraints for composite.
built 23 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 8 ordering constraints for composite.
built 15 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
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,7.18189e+22,4.58106,143264,11849,60,215853,967,1282,592566,66,3491,0
Converting to forward existential form...Done !
original formula: EF(!(AX(((i17.u195.p501==0)||(i5.i1.u133.p353==1)))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(((i17.u195.p501==0)||(i5.i1.u133.p353==1))))] != FALSE
(forward)formula 0,1,5.38251,143264,1,0,215853,967,1931,592566,97,3491,249096
FORMULA BusinessProcesses-PT-11-CTLCardinality-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: EF((i0.i0.u50.p132==1))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (i0.i0.u50.p132==1))] != FALSE
(forward)formula 1,1,5.39353,143264,1,0,215853,967,1934,592566,97,3491,256842
FORMULA BusinessProcesses-PT-11-CTLCardinality-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: EG(EF((i5.i1.u133.p349==1)))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (i5.i1.u133.p349==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t76, t78, t80, t254, t260, t278, t290, t298, t310, t320, t328, t331, t354, i0.i0.t302, i0.i0.u49.t313, i0.i0.u51.t309, i0.i2.t193, i0.i2.u123.t194, i1.t366, i1.i0.t364, i1.i0.u11.t379, i1.i1.t369, i1.i1.t371, i1.i1.t373, i1.i1.t375, i2.t314, i2.i0.u44.t323, i2.i1.t317, i2.i1.u46.t319, i2.i2.t201, i2.i2.u119.t202, i3.i0.t282, i3.i0.u60.t293, i3.i0.u62.t289, i3.i2.t169, i3.i2.u134.t170, i4.i0.t250, i4.i0.t264, i4.i0.u74.t267, i4.i0.u81.t253, i4.i1.u84.t246, i5.i0.t294, i5.i0.u56.t301, i5.i0.u58.t297, i5.i1.t173, i5.i1.u132.t174, i6.i0.t358, i6.i0.u9.t382, i6.i0.u19.t361, i6.i2.t233, i6.i2.u102.t234, i7.t335, i7.i0.t240, i7.i0.u100.t241, i7.i1.t221, i7.i1.t333, i7.i1.u23.t339, i7.i1.u23.t343, i7.i1.u23.t347, i7.i1.u23.t353, i7.i1.u108.t222, i8.t217, i8.u110.t218, i9.i0.t229, i9.i0.u105.t230, i9.i1.t225, i9.i1.u107.t226, i9.i3.t213, i9.i3.u113.t214, i9.i4.t209, i9.i4.u115.t210, i9.i5.t205, i9.i5.u117.t206, i10.t324, i10.u21.t357, i10.u42.t327, i11.i2.t197, i11.i2.u121.t198, i11.i3.t189, i11.i3.u124.t190, i11.i4.t185, i11.i4.u127.t186, i11.i5.t181, i11.i5.u128.t182, i11.i6.t165, i11.i6.u137.t166, i12.t177, i12.u130.t178, i13.t274, i13.u68.t281, i13.u70.t277, i14.i0.u72.t271, i14.i2.t161, i14.i2.u138.t162, i14.i3.t153, i14.i3.u142.t154, i15.i0.u76.t263, i15.i1.t149, i15.i1.u143.t150, i15.i2.t145, i15.i2.u145.t146, i16.i0.t257, i16.i0.u78.t259, i16.i1.t141, i16.i1.u148.t142, i16.i2.t137, i16.i2.u150.t138, i16.i3.t133, i16.i3.u151.t134, i17.t127, i17.t120, i17.t115, i17.t113, i17.t110, i17.t108, i17.t106, i17.t104, i17.t101, i17.t73, i17.t70, i17.t67, i17.t65, i17.t62, i17.t59, i17.t57, i17.t55, i17.t53, i17.t50, i17.t47, i17.t37, i17.t34, i17.t31, i17.t28, i17.t25, i17.t22, i17.t20, i17.t17, i17.t14, i17.u209.t12, i17.u209.t44, i17.u209.t84, i17.u209.t88, i17.u209.t92, i17.u209.t98, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/321/144/501
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 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 an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found a local 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
(forward)formula 2,1,27.3499,785632,1,0,1.55427e+06,967,8671,2.87586e+06,349,3491,3169686
FORMULA BusinessProcesses-PT-11-CTLCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: EF((i15.i0.u202.p514==1))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (i15.i0.u202.p514==1))] != FALSE
(forward)formula 3,1,27.3508,785896,1,0,1.55427e+06,967,8674,2.87592e+06,349,3491,3169727
FORMULA BusinessProcesses-PT-11-CTLCardinality-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: !(E(((i17.u156.p416==0)||(i13.u194.p498==1)) U (i14.i0.u198.p507==1)))
=> equivalent forward existential formula: [(FwdU(Init,((i17.u156.p416==0)||(i13.u194.p498==1))) * (i14.i0.u198.p507==1))] = FALSE
(forward)formula 4,0,29.5943,853992,1,0,1.65093e+06,967,9447,3.2169e+06,369,3491,3519128
FORMULA BusinessProcesses-PT-11-CTLCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: E(AX(((i9.i3.u112.p303==0)||(i3.i2.u135.p354==1))) U (i8.u172.p452==1))
=> equivalent forward existential formula: [(FwdU(Init,!(EX(!(((i9.i3.u112.p303==0)||(i3.i2.u135.p354==1)))))) * (i8.u172.p452==1))] != FALSE
(forward)formula 5,0,61.6654,1473636,1,0,2.87812e+06,967,9548,5.5996e+06,369,3491,5161015
FORMULA BusinessProcesses-PT-11-CTLCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: AG(((i11.i3.u124.p332==0)||(i11.i2.u120.p323==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(((i11.i3.u124.p332==0)||(i11.i2.u120.p323==1))))] = FALSE
(forward)formula 6,0,61.7095,1475220,1,0,2.88064e+06,967,9559,5.61004e+06,370,3491,5162587
FORMULA BusinessProcesses-PT-11-CTLCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: AG(((i8.u110.p296==0)||(i0.i1.u54.p144==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(((i8.u110.p296==0)||(i0.i1.u54.p144==1))))] = FALSE
(forward)formula 7,0,61.7399,1476276,1,0,2.88098e+06,967,9567,5.6135e+06,371,3491,5170592
FORMULA BusinessProcesses-PT-11-CTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: E(AF(((i7.i0.u170.p448==0)||(i3.i2.u134.p357==1))) U ((((i17.u183.p475!=0)&&(i2.i2.u118.p318!=1))&&(i7.i1.u23.p66!=0))&&(i15.i1.u143.p380!=1)))
=> equivalent forward existential formula: [(FwdU(Init,!(EG(!(((i7.i0.u170.p448==0)||(i3.i2.u134.p357==1)))))) * ((((i17.u183.p475!=0)&&(i2.i2.u118.p318!=1))&&(i7.i1.u23.p66!=0))&&(i15.i1.u143.p380!=1)))] != FALSE
(forward)formula 8,0,61.7418,1476540,1,0,2.88099e+06,967,9589,5.61352e+06,375,3491,5171079
FORMULA BusinessProcesses-PT-11-CTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: !(EF((i9.i0.u105.p280==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (i9.i0.u105.p280==1))] = FALSE
(forward)formula 9,0,61.7506,1476804,1,0,2.88124e+06,967,9591,5.61412e+06,375,3491,5174408
FORMULA BusinessProcesses-PT-11-CTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
BK_STOP 1589252994510
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
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-11"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-11, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r021-oct2-158897699200531"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-11.tgz
mv BusinessProcesses-PT-11 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;