fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r021-oct2-158897699200545
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for BusinessProcesses-PT-13

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15731.540 3600000.00 3774900.00 210909.10 TT????TFFF?TFTF? 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-158897699200545.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-13, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897699200545
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 316K
-rw-r--r-- 1 mcc users 3.2K Mar 26 02:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 26 02:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 25 22:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 22:45 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.2K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 25 17:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 25 17:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K 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 148K 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-13-00
FORMULA_NAME BusinessProcesses-PT-13-01
FORMULA_NAME BusinessProcesses-PT-13-02
FORMULA_NAME BusinessProcesses-PT-13-03
FORMULA_NAME BusinessProcesses-PT-13-04
FORMULA_NAME BusinessProcesses-PT-13-05
FORMULA_NAME BusinessProcesses-PT-13-06
FORMULA_NAME BusinessProcesses-PT-13-07
FORMULA_NAME BusinessProcesses-PT-13-08
FORMULA_NAME BusinessProcesses-PT-13-09
FORMULA_NAME BusinessProcesses-PT-13-10
FORMULA_NAME BusinessProcesses-PT-13-11
FORMULA_NAME BusinessProcesses-PT-13-12
FORMULA_NAME BusinessProcesses-PT-13-13
FORMULA_NAME BusinessProcesses-PT-13-14
FORMULA_NAME BusinessProcesses-PT-13-15

=== Now, execution of the tool begins

BK_START 1589253781404

[2020-05-12 03:23:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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:23:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 03:23:02] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2020-05-12 03:23:02] [INFO ] Transformed 593 places.
[2020-05-12 03:23:02] [INFO ] Transformed 536 transitions.
[2020-05-12 03:23:02] [INFO ] Found NUPN structural information;
[2020-05-12 03:23:02] [INFO ] Parsed PT model containing 593 places and 536 transitions in 117 ms.
Deduced a syphon composed of 8 places in 7 ms
Reduce places removed 8 places and 8 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 720 resets, run finished after 255 ms. (steps per millisecond=392 ) properties seen :[0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1]
// Phase 1: matrix 528 rows 585 cols
[2020-05-12 03:23:03] [INFO ] Computed 95 place invariants in 23 ms
[2020-05-12 03:23:03] [INFO ] [Real]Absence check using 57 positive place invariants in 47 ms returned sat
[2020-05-12 03:23:03] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 20 ms returned sat
[2020-05-12 03:23:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:23:04] [INFO ] [Real]Absence check using state equation in 698 ms returned sat
[2020-05-12 03:23:04] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:23:04] [INFO ] [Nat]Absence check using 57 positive place invariants in 81 ms returned sat
[2020-05-12 03:23:04] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 25 ms returned sat
[2020-05-12 03:23:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:23:04] [INFO ] [Nat]Absence check using state equation in 621 ms returned sat
[2020-05-12 03:23:05] [INFO ] Deduced a trap composed of 8 places in 232 ms
[2020-05-12 03:23:05] [INFO ] Deduced a trap composed of 124 places in 192 ms
[2020-05-12 03:23:05] [INFO ] Deduced a trap composed of 14 places in 215 ms
[2020-05-12 03:23:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 763 ms
[2020-05-12 03:23:05] [INFO ] Computed and/alt/rep : 527/2262/527 causal constraints in 44 ms.
[2020-05-12 03:23:08] [INFO ] Added : 246 causal constraints over 50 iterations in 2584 ms. Result :sat
[2020-05-12 03:23:08] [INFO ] [Real]Absence check using 57 positive place invariants in 107 ms returned sat
[2020-05-12 03:23:08] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 17 ms returned sat
[2020-05-12 03:23:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:23:09] [INFO ] [Real]Absence check using state equation in 678 ms returned sat
[2020-05-12 03:23:09] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:23:09] [INFO ] [Nat]Absence check using 57 positive place invariants in 61 ms returned sat
[2020-05-12 03:23:09] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 19 ms returned sat
[2020-05-12 03:23:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:23:10] [INFO ] [Nat]Absence check using state equation in 662 ms returned sat
[2020-05-12 03:23:10] [INFO ] Deduced a trap composed of 15 places in 171 ms
[2020-05-12 03:23:10] [INFO ] Deduced a trap composed of 24 places in 148 ms
[2020-05-12 03:23:10] [INFO ] Deduced a trap composed of 16 places in 145 ms
[2020-05-12 03:23:10] [INFO ] Deduced a trap composed of 11 places in 169 ms
[2020-05-12 03:23:11] [INFO ] Deduced a trap composed of 14 places in 233 ms
[2020-05-12 03:23:11] [INFO ] Deduced a trap composed of 125 places in 353 ms
[2020-05-12 03:23:11] [INFO ] Deduced a trap composed of 120 places in 156 ms
[2020-05-12 03:23:11] [INFO ] Deduced a trap composed of 126 places in 140 ms
[2020-05-12 03:23:12] [INFO ] Deduced a trap composed of 121 places in 393 ms
[2020-05-12 03:23:12] [INFO ] Deduced a trap composed of 17 places in 331 ms
[2020-05-12 03:23:12] [INFO ] Deduced a trap composed of 126 places in 294 ms
[2020-05-12 03:23:13] [INFO ] Deduced a trap composed of 127 places in 237 ms
[2020-05-12 03:23:13] [INFO ] Deduced a trap composed of 123 places in 160 ms
[2020-05-12 03:23:13] [INFO ] Deduced a trap composed of 126 places in 168 ms
[2020-05-12 03:23:13] [INFO ] Deduced a trap composed of 131 places in 136 ms
[2020-05-12 03:23:13] [INFO ] Deduced a trap composed of 36 places in 148 ms
[2020-05-12 03:23:14] [INFO ] Deduced a trap composed of 116 places in 252 ms
[2020-05-12 03:23:14] [INFO ] Deduced a trap composed of 131 places in 304 ms
[2020-05-12 03:23:14] [INFO ] Deduced a trap composed of 123 places in 143 ms
[2020-05-12 03:23:14] [INFO ] Deduced a trap composed of 123 places in 142 ms
[2020-05-12 03:23:14] [INFO ] Deduced a trap composed of 131 places in 142 ms
[2020-05-12 03:23:15] [INFO ] Deduced a trap composed of 140 places in 142 ms
[2020-05-12 03:23:15] [INFO ] Deduced a trap composed of 131 places in 134 ms
[2020-05-12 03:23:15] [INFO ] Deduced a trap composed of 131 places in 125 ms
[2020-05-12 03:23:15] [INFO ] Deduced a trap composed of 135 places in 145 ms
[2020-05-12 03:23:15] [INFO ] Deduced a trap composed of 125 places in 139 ms
[2020-05-12 03:23:15] [INFO ] Deduced a trap composed of 130 places in 142 ms
[2020-05-12 03:23:16] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 5983 ms
[2020-05-12 03:23:16] [INFO ] Computed and/alt/rep : 527/2262/527 causal constraints in 31 ms.
[2020-05-12 03:23:17] [INFO ] Added : 255 causal constraints over 52 iterations in 1929 ms. Result :sat
[2020-05-12 03:23:18] [INFO ] Deduced a trap composed of 125 places in 303 ms
[2020-05-12 03:23:18] [INFO ] Deduced a trap composed of 128 places in 286 ms
[2020-05-12 03:23:18] [INFO ] Deduced a trap composed of 126 places in 155 ms
[2020-05-12 03:23:19] [INFO ] Deduced a trap composed of 134 places in 153 ms
[2020-05-12 03:23:19] [INFO ] Deduced a trap composed of 133 places in 136 ms
[2020-05-12 03:23:19] [INFO ] Deduced a trap composed of 126 places in 310 ms
[2020-05-12 03:23:19] [INFO ] Deduced a trap composed of 134 places in 139 ms
[2020-05-12 03:23:20] [INFO ] Deduced a trap composed of 138 places in 309 ms
[2020-05-12 03:23:20] [INFO ] Deduced a trap composed of 124 places in 163 ms
[2020-05-12 03:23:20] [INFO ] Deduced a trap composed of 125 places in 173 ms
[2020-05-12 03:23:20] [INFO ] Deduced a trap composed of 127 places in 240 ms
[2020-05-12 03:23:21] [INFO ] Deduced a trap composed of 134 places in 133 ms
[2020-05-12 03:23:21] [INFO ] Deduced a trap composed of 128 places in 117 ms
[2020-05-12 03:23:21] [INFO ] Deduced a trap composed of 128 places in 142 ms
[2020-05-12 03:23:21] [INFO ] Deduced a trap composed of 130 places in 129 ms
[2020-05-12 03:23:21] [INFO ] Deduced a trap composed of 127 places in 141 ms
[2020-05-12 03:23:22] [INFO ] Deduced a trap composed of 130 places in 130 ms
[2020-05-12 03:23:22] [INFO ] Deduced a trap composed of 128 places in 136 ms
[2020-05-12 03:23:22] [INFO ] Deduced a trap composed of 131 places in 257 ms
[2020-05-12 03:23:22] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 4595 ms
[2020-05-12 03:23:22] [INFO ] [Real]Absence check using 57 positive place invariants in 33 ms returned sat
[2020-05-12 03:23:22] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 19 ms returned sat
[2020-05-12 03:23:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:23:23] [INFO ] [Real]Absence check using state equation in 660 ms returned sat
[2020-05-12 03:23:23] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:23:23] [INFO ] [Nat]Absence check using 57 positive place invariants in 63 ms returned sat
[2020-05-12 03:23:23] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 17 ms returned sat
[2020-05-12 03:23:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:23:25] [INFO ] [Nat]Absence check using state equation in 1887 ms returned sat
[2020-05-12 03:23:26] [INFO ] Deduced a trap composed of 16 places in 803 ms
[2020-05-12 03:23:26] [INFO ] Deduced a trap composed of 18 places in 102 ms
[2020-05-12 03:23:26] [INFO ] Deduced a trap composed of 16 places in 92 ms
[2020-05-12 03:23:26] [INFO ] Deduced a trap composed of 12 places in 106 ms
[2020-05-12 03:23:26] [INFO ] Deduced a trap composed of 15 places in 91 ms
[2020-05-12 03:23:26] [INFO ] Deduced a trap composed of 28 places in 91 ms
[2020-05-12 03:23:26] [INFO ] Deduced a trap composed of 21 places in 88 ms
[2020-05-12 03:23:27] [INFO ] Deduced a trap composed of 21 places in 90 ms
[2020-05-12 03:23:27] [INFO ] Deduced a trap composed of 27 places in 146 ms
[2020-05-12 03:23:27] [INFO ] Deduced a trap composed of 21 places in 91 ms
[2020-05-12 03:23:27] [INFO ] Deduced a trap composed of 16 places in 90 ms
[2020-05-12 03:23:27] [INFO ] Deduced a trap composed of 42 places in 72 ms
[2020-05-12 03:23:28] [INFO ] Deduced a trap composed of 30 places in 469 ms
[2020-05-12 03:23:28] [INFO ] Deduced a trap composed of 17 places in 79 ms
[2020-05-12 03:23:28] [INFO ] Deduced a trap composed of 35 places in 81 ms
[2020-05-12 03:23:28] [INFO ] Deduced a trap composed of 30 places in 128 ms
[2020-05-12 03:23:28] [INFO ] Deduced a trap composed of 67 places in 82 ms
[2020-05-12 03:23:28] [INFO ] Deduced a trap composed of 65 places in 108 ms
[2020-05-12 03:23:28] [INFO ] Deduced a trap composed of 63 places in 76 ms
[2020-05-12 03:23:28] [INFO ] Deduced a trap composed of 76 places in 166 ms
[2020-05-12 03:23:29] [INFO ] Deduced a trap composed of 69 places in 216 ms
[2020-05-12 03:23:29] [INFO ] Deduced a trap composed of 80 places in 154 ms
[2020-05-12 03:23:29] [INFO ] Deduced a trap composed of 34 places in 113 ms
[2020-05-12 03:23:30] [INFO ] Deduced a trap composed of 32 places in 948 ms
[2020-05-12 03:23:30] [INFO ] Deduced a trap composed of 43 places in 71 ms
[2020-05-12 03:23:31] [INFO ] Deduced a trap composed of 130 places in 487 ms
[2020-05-12 03:23:31] [INFO ] Deduced a trap composed of 27 places in 279 ms
[2020-05-12 03:23:31] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 6067 ms
[2020-05-12 03:23:31] [INFO ] Computed and/alt/rep : 527/2262/527 causal constraints in 29 ms.
[2020-05-12 03:23:34] [INFO ] Added : 255 causal constraints over 51 iterations in 2536 ms. Result :sat
[2020-05-12 03:23:34] [INFO ] Deduced a trap composed of 128 places in 224 ms
[2020-05-12 03:23:34] [INFO ] Deduced a trap composed of 130 places in 158 ms
[2020-05-12 03:23:34] [INFO ] Deduced a trap composed of 128 places in 224 ms
[2020-05-12 03:23:34] [INFO ] Deduced a trap composed of 132 places in 137 ms
[2020-05-12 03:23:35] [INFO ] Deduced a trap composed of 120 places in 168 ms
[2020-05-12 03:23:35] [INFO ] Deduced a trap composed of 133 places in 161 ms
[2020-05-12 03:23:35] [INFO ] Deduced a trap composed of 135 places in 131 ms
[2020-05-12 03:23:35] [INFO ] Deduced a trap composed of 138 places in 119 ms
[2020-05-12 03:23:35] [INFO ] Deduced a trap composed of 131 places in 130 ms
[2020-05-12 03:23:36] [INFO ] Deduced a trap composed of 126 places in 138 ms
[2020-05-12 03:23:36] [INFO ] Deduced a trap composed of 129 places in 141 ms
[2020-05-12 03:23:36] [INFO ] Deduced a trap composed of 131 places in 164 ms
[2020-05-12 03:23:36] [INFO ] Deduced a trap composed of 135 places in 152 ms
[2020-05-12 03:23:36] [INFO ] Deduced a trap composed of 127 places in 153 ms
[2020-05-12 03:23:37] [INFO ] Deduced a trap composed of 136 places in 146 ms
[2020-05-12 03:23:37] [INFO ] Deduced a trap composed of 139 places in 189 ms
[2020-05-12 03:23:37] [INFO ] Deduced a trap composed of 131 places in 136 ms
[2020-05-12 03:23:37] [INFO ] Deduced a trap composed of 136 places in 122 ms
[2020-05-12 03:23:38] [INFO ] Deduced a trap composed of 133 places in 135 ms
[2020-05-12 03:23:38] [INFO ] Deduced a trap composed of 147 places in 134 ms
[2020-05-12 03:23:38] [INFO ] Deduced a trap composed of 126 places in 147 ms
[2020-05-12 03:23:38] [INFO ] Deduced a trap composed of 137 places in 251 ms
[2020-05-12 03:23:38] [INFO ] Deduced a trap composed of 130 places in 126 ms
[2020-05-12 03:23:39] [INFO ] Deduced a trap composed of 129 places in 175 ms
[2020-05-12 03:23:39] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 5275 ms
[2020-05-12 03:23:39] [INFO ] [Real]Absence check using 57 positive place invariants in 34 ms returned sat
[2020-05-12 03:23:39] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 18 ms returned sat
[2020-05-12 03:23:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:23:40] [INFO ] [Real]Absence check using state equation in 652 ms returned sat
[2020-05-12 03:23:40] [INFO ] Deduced a trap composed of 8 places in 288 ms
[2020-05-12 03:23:40] [INFO ] Deduced a trap composed of 128 places in 201 ms
[2020-05-12 03:23:40] [INFO ] Deduced a trap composed of 132 places in 182 ms
[2020-05-12 03:23:41] [INFO ] Deduced a trap composed of 12 places in 174 ms
[2020-05-12 03:23:41] [INFO ] Deduced a trap composed of 13 places in 221 ms
[2020-05-12 03:23:41] [INFO ] Deduced a trap composed of 30 places in 316 ms
[2020-05-12 03:23:41] [INFO ] Deduced a trap composed of 37 places in 163 ms
[2020-05-12 03:23:42] [INFO ] Deduced a trap composed of 16 places in 168 ms
[2020-05-12 03:23:42] [INFO ] Deduced a trap composed of 44 places in 153 ms
[2020-05-12 03:23:42] [INFO ] Deduced a trap composed of 49 places in 317 ms
[2020-05-12 03:23:42] [INFO ] Deduced a trap composed of 38 places in 175 ms
[2020-05-12 03:23:42] [INFO ] Deduced a trap composed of 133 places in 147 ms
[2020-05-12 03:23:43] [INFO ] Deduced a trap composed of 15 places in 155 ms
[2020-05-12 03:23:43] [INFO ] Deduced a trap composed of 48 places in 265 ms
[2020-05-12 03:23:43] [INFO ] Deduced a trap composed of 52 places in 489 ms
[2020-05-12 03:23:44] [INFO ] Deduced a trap composed of 26 places in 176 ms
[2020-05-12 03:23:44] [INFO ] Deduced a trap composed of 46 places in 214 ms
[2020-05-12 03:23:44] [INFO ] Deduced a trap composed of 54 places in 160 ms
[2020-05-12 03:23:45] [INFO ] Deduced a trap composed of 19 places in 874 ms
[2020-05-12 03:23:45] [INFO ] Deduced a trap composed of 22 places in 135 ms
[2020-05-12 03:23:45] [INFO ] Deduced a trap composed of 21 places in 155 ms
[2020-05-12 03:23:46] [INFO ] Deduced a trap composed of 18 places in 141 ms
[2020-05-12 03:23:46] [INFO ] Deduced a trap composed of 16 places in 139 ms
[2020-05-12 03:23:46] [INFO ] Deduced a trap composed of 21 places in 140 ms
[2020-05-12 03:23:46] [INFO ] Deduced a trap composed of 36 places in 617 ms
[2020-05-12 03:23:47] [INFO ] Deduced a trap composed of 40 places in 211 ms
[2020-05-12 03:23:47] [INFO ] Deduced a trap composed of 28 places in 173 ms
[2020-05-12 03:23:47] [INFO ] Deduced a trap composed of 23 places in 284 ms
[2020-05-12 03:23:47] [INFO ] Deduced a trap composed of 33 places in 156 ms
[2020-05-12 03:23:48] [INFO ] Deduced a trap composed of 41 places in 142 ms
[2020-05-12 03:23:48] [INFO ] Deduced a trap composed of 38 places in 131 ms
[2020-05-12 03:23:48] [INFO ] Deduced a trap composed of 50 places in 125 ms
[2020-05-12 03:23:48] [INFO ] Deduced a trap composed of 34 places in 137 ms
[2020-05-12 03:23:48] [INFO ] Deduced a trap composed of 48 places in 191 ms
[2020-05-12 03:23:49] [INFO ] Deduced a trap composed of 55 places in 146 ms
[2020-05-12 03:23:49] [INFO ] Deduced a trap composed of 44 places in 142 ms
[2020-05-12 03:23:49] [INFO ] Deduced a trap composed of 38 places in 208 ms
[2020-05-12 03:23:49] [INFO ] Deduced a trap composed of 48 places in 255 ms
[2020-05-12 03:23:49] [INFO ] Deduced a trap composed of 55 places in 86 ms
[2020-05-12 03:23:49] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 9832 ms
[2020-05-12 03:23:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:23:50] [INFO ] [Nat]Absence check using 57 positive place invariants in 51 ms returned sat
[2020-05-12 03:23:50] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 19 ms returned sat
[2020-05-12 03:23:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:23:50] [INFO ] [Nat]Absence check using state equation in 628 ms returned sat
[2020-05-12 03:23:51] [INFO ] Deduced a trap composed of 11 places in 299 ms
[2020-05-12 03:23:51] [INFO ] Deduced a trap composed of 13 places in 176 ms
[2020-05-12 03:23:51] [INFO ] Deduced a trap composed of 13 places in 165 ms
[2020-05-12 03:23:51] [INFO ] Deduced a trap composed of 21 places in 161 ms
[2020-05-12 03:23:51] [INFO ] Deduced a trap composed of 17 places in 153 ms
[2020-05-12 03:23:51] [INFO ] Deduced a trap composed of 124 places in 165 ms
[2020-05-12 03:23:52] [INFO ] Deduced a trap composed of 38 places in 175 ms
[2020-05-12 03:23:52] [INFO ] Deduced a trap composed of 38 places in 348 ms
[2020-05-12 03:23:52] [INFO ] Deduced a trap composed of 48 places in 217 ms
[2020-05-12 03:23:53] [INFO ] Deduced a trap composed of 41 places in 350 ms
[2020-05-12 03:23:53] [INFO ] Deduced a trap composed of 135 places in 438 ms
[2020-05-12 03:23:54] [INFO ] Deduced a trap composed of 135 places in 599 ms
[2020-05-12 03:23:54] [INFO ] Deduced a trap composed of 131 places in 314 ms
[2020-05-12 03:23:54] [INFO ] Deduced a trap composed of 30 places in 203 ms
[2020-05-12 03:23:55] [INFO ] Deduced a trap composed of 34 places in 162 ms
[2020-05-12 03:23:55] [INFO ] Deduced a trap composed of 49 places in 156 ms
[2020-05-12 03:23:55] [INFO ] Deduced a trap composed of 44 places in 152 ms
[2020-05-12 03:23:55] [INFO ] Deduced a trap composed of 26 places in 139 ms
[2020-05-12 03:23:55] [INFO ] Deduced a trap composed of 51 places in 127 ms
[2020-05-12 03:23:55] [INFO ] Deduced a trap composed of 46 places in 101 ms
[2020-05-12 03:23:55] [INFO ] Deduced a trap composed of 19 places in 128 ms
[2020-05-12 03:23:56] [INFO ] Deduced a trap composed of 23 places in 99 ms
[2020-05-12 03:23:56] [INFO ] Deduced a trap composed of 28 places in 89 ms
[2020-05-12 03:23:56] [INFO ] Deduced a trap composed of 32 places in 78 ms
[2020-05-12 03:23:56] [INFO ] Deduced a trap composed of 16 places in 76 ms
[2020-05-12 03:23:56] [INFO ] Deduced a trap composed of 19 places in 79 ms
[2020-05-12 03:23:56] [INFO ] Deduced a trap composed of 40 places in 72 ms
[2020-05-12 03:23:56] [INFO ] Deduced a trap composed of 22 places in 72 ms
[2020-05-12 03:23:56] [INFO ] Deduced a trap composed of 48 places in 74 ms
[2020-05-12 03:23:56] [INFO ] Deduced a trap composed of 47 places in 74 ms
[2020-05-12 03:23:56] [INFO ] Deduced a trap composed of 34 places in 75 ms
[2020-05-12 03:23:57] [INFO ] Deduced a trap composed of 43 places in 75 ms
[2020-05-12 03:23:57] [INFO ] Deduced a trap composed of 80 places in 73 ms
[2020-05-12 03:23:57] [INFO ] Deduced a trap composed of 50 places in 78 ms
[2020-05-12 03:23:57] [INFO ] Deduced a trap composed of 24 places in 76 ms
[2020-05-12 03:23:57] [INFO ] Deduced a trap composed of 47 places in 73 ms
[2020-05-12 03:23:57] [INFO ] Deduced a trap composed of 46 places in 88 ms
[2020-05-12 03:23:57] [INFO ] Deduced a trap composed of 43 places in 56 ms
[2020-05-12 03:23:57] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 6917 ms
[2020-05-12 03:23:57] [INFO ] Computed and/alt/rep : 527/2262/527 causal constraints in 23 ms.
[2020-05-12 03:24:01] [INFO ] Added : 361 causal constraints over 73 iterations in 3367 ms. Result :sat
[2020-05-12 03:24:01] [INFO ] [Real]Absence check using 57 positive place invariants in 214 ms returned sat
[2020-05-12 03:24:01] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 18 ms returned sat
[2020-05-12 03:24:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:24:02] [INFO ] [Real]Absence check using state equation in 659 ms returned sat
[2020-05-12 03:24:02] [INFO ] Deduced a trap composed of 36 places in 219 ms
[2020-05-12 03:24:02] [INFO ] Deduced a trap composed of 39 places in 229 ms
[2020-05-12 03:24:02] [INFO ] Deduced a trap composed of 41 places in 181 ms
[2020-05-12 03:24:02] [INFO ] Deduced a trap composed of 8 places in 181 ms
[2020-05-12 03:24:03] [INFO ] Deduced a trap composed of 16 places in 169 ms
[2020-05-12 03:24:03] [INFO ] Deduced a trap composed of 15 places in 165 ms
[2020-05-12 03:24:03] [INFO ] Deduced a trap composed of 21 places in 168 ms
[2020-05-12 03:24:03] [INFO ] Deduced a trap composed of 23 places in 162 ms
[2020-05-12 03:24:03] [INFO ] Deduced a trap composed of 21 places in 188 ms
[2020-05-12 03:24:04] [INFO ] Deduced a trap composed of 42 places in 153 ms
[2020-05-12 03:24:04] [INFO ] Deduced a trap composed of 41 places in 155 ms
[2020-05-12 03:24:04] [INFO ] Deduced a trap composed of 128 places in 152 ms
[2020-05-12 03:24:04] [INFO ] Deduced a trap composed of 52 places in 96 ms
[2020-05-12 03:24:04] [INFO ] Deduced a trap composed of 50 places in 135 ms
[2020-05-12 03:24:04] [INFO ] Deduced a trap composed of 20 places in 146 ms
[2020-05-12 03:24:05] [INFO ] Deduced a trap composed of 135 places in 133 ms
[2020-05-12 03:24:05] [INFO ] Deduced a trap composed of 21 places in 168 ms
[2020-05-12 03:24:05] [INFO ] Deduced a trap composed of 44 places in 154 ms
[2020-05-12 03:24:05] [INFO ] Deduced a trap composed of 17 places in 99 ms
[2020-05-12 03:24:05] [INFO ] Deduced a trap composed of 27 places in 133 ms
[2020-05-12 03:24:06] [INFO ] Deduced a trap composed of 44 places in 319 ms
[2020-05-12 03:24:06] [INFO ] Deduced a trap composed of 139 places in 134 ms
[2020-05-12 03:24:06] [INFO ] Deduced a trap composed of 55 places in 163 ms
[2020-05-12 03:24:06] [INFO ] Deduced a trap composed of 132 places in 161 ms
[2020-05-12 03:24:07] [INFO ] Deduced a trap composed of 135 places in 298 ms
[2020-05-12 03:24:07] [INFO ] Deduced a trap composed of 32 places in 134 ms
[2020-05-12 03:24:07] [INFO ] Deduced a trap composed of 38 places in 184 ms
[2020-05-12 03:24:07] [INFO ] Deduced a trap composed of 139 places in 220 ms
[2020-05-12 03:24:07] [INFO ] Deduced a trap composed of 152 places in 122 ms
[2020-05-12 03:24:07] [INFO ] Deduced a trap composed of 140 places in 184 ms
[2020-05-12 03:24:08] [INFO ] Deduced a trap composed of 149 places in 201 ms
[2020-05-12 03:24:08] [INFO ] Deduced a trap composed of 31 places in 146 ms
[2020-05-12 03:24:08] [INFO ] Deduced a trap composed of 32 places in 151 ms
[2020-05-12 03:24:08] [INFO ] Deduced a trap composed of 132 places in 131 ms
[2020-05-12 03:24:09] [INFO ] Deduced a trap composed of 136 places in 253 ms
[2020-05-12 03:24:09] [INFO ] Deduced a trap composed of 141 places in 145 ms
[2020-05-12 03:24:09] [INFO ] Deduced a trap composed of 135 places in 136 ms
[2020-05-12 03:24:09] [INFO ] Deduced a trap composed of 124 places in 155 ms
[2020-05-12 03:24:09] [INFO ] Deduced a trap composed of 136 places in 131 ms
[2020-05-12 03:24:10] [INFO ] Deduced a trap composed of 130 places in 227 ms
[2020-05-12 03:24:10] [INFO ] Deduced a trap composed of 136 places in 284 ms
[2020-05-12 03:24:10] [INFO ] Deduced a trap composed of 138 places in 162 ms
[2020-05-12 03:24:10] [INFO ] Deduced a trap composed of 140 places in 147 ms
[2020-05-12 03:24:11] [INFO ] Deduced a trap composed of 134 places in 221 ms
[2020-05-12 03:24:11] [INFO ] Deduced a trap composed of 130 places in 223 ms
[2020-05-12 03:24:11] [INFO ] Deduced a trap composed of 125 places in 148 ms
[2020-05-12 03:24:11] [INFO ] Deduced a trap composed of 119 places in 156 ms
[2020-05-12 03:24:11] [INFO ] Deduced a trap composed of 123 places in 268 ms
[2020-05-12 03:24:12] [INFO ] Deduced a trap composed of 123 places in 141 ms
[2020-05-12 03:24:12] [INFO ] Deduced a trap composed of 122 places in 203 ms
[2020-05-12 03:24:12] [INFO ] Deduced a trap composed of 136 places in 147 ms
[2020-05-12 03:24:12] [INFO ] Deduced a trap composed of 122 places in 135 ms
[2020-05-12 03:24:13] [INFO ] Deduced a trap composed of 130 places in 322 ms
[2020-05-12 03:24:13] [INFO ] Deduced a trap composed of 131 places in 138 ms
[2020-05-12 03:24:13] [INFO ] Deduced a trap composed of 141 places in 126 ms
[2020-05-12 03:24:13] [INFO ] Deduced a trap composed of 129 places in 122 ms
[2020-05-12 03:24:13] [INFO ] Deduced a trap composed of 129 places in 119 ms
[2020-05-12 03:24:13] [INFO ] Deduced a trap composed of 133 places in 116 ms
[2020-05-12 03:24:13] [INFO ] Deduced a trap composed of 149 places in 140 ms
[2020-05-12 03:24:14] [INFO ] Deduced a trap composed of 138 places in 124 ms
[2020-05-12 03:24:14] [INFO ] Deduced a trap composed of 131 places in 131 ms
[2020-05-12 03:24:14] [INFO ] Deduced a trap composed of 134 places in 211 ms
[2020-05-12 03:24:14] [INFO ] Deduced a trap composed of 134 places in 287 ms
[2020-05-12 03:24:15] [INFO ] Deduced a trap composed of 134 places in 267 ms
[2020-05-12 03:24:15] [INFO ] Deduced a trap composed of 145 places in 264 ms
[2020-05-12 03:24:15] [INFO ] Deduced a trap composed of 132 places in 286 ms
[2020-05-12 03:24:16] [INFO ] Deduced a trap composed of 131 places in 281 ms
[2020-05-12 03:24:16] [INFO ] Deduced a trap composed of 147 places in 144 ms
[2020-05-12 03:24:16] [INFO ] Deduced a trap composed of 141 places in 110 ms
[2020-05-12 03:24:16] [INFO ] Deduced a trap composed of 149 places in 144 ms
[2020-05-12 03:24:16] [INFO ] Deduced a trap composed of 126 places in 144 ms
[2020-05-12 03:24:16] [INFO ] Deduced a trap composed of 132 places in 133 ms
[2020-05-12 03:24:17] [INFO ] Deduced a trap composed of 122 places in 132 ms
[2020-05-12 03:24:17] [INFO ] Deduced a trap composed of 148 places in 132 ms
[2020-05-12 03:24:17] [INFO ] Deduced a trap composed of 130 places in 133 ms
[2020-05-12 03:24:17] [INFO ] Deduced a trap composed of 147 places in 132 ms
[2020-05-12 03:24:17] [INFO ] Deduced a trap composed of 129 places in 149 ms
[2020-05-12 03:24:17] [INFO ] Deduced a trap composed of 134 places in 149 ms
[2020-05-12 03:24:18] [INFO ] Deduced a trap composed of 146 places in 271 ms
[2020-05-12 03:24:18] [INFO ] Deduced a trap composed of 138 places in 151 ms
[2020-05-12 03:24:18] [INFO ] Deduced a trap composed of 147 places in 175 ms
[2020-05-12 03:24:18] [INFO ] Deduced a trap composed of 153 places in 157 ms
[2020-05-12 03:24:19] [INFO ] Deduced a trap composed of 131 places in 161 ms
[2020-05-12 03:24:19] [INFO ] Deduced a trap composed of 138 places in 276 ms
[2020-05-12 03:24:19] [INFO ] Deduced a trap composed of 127 places in 136 ms
[2020-05-12 03:24:19] [INFO ] Deduced a trap composed of 127 places in 309 ms
[2020-05-12 03:24:19] [INFO ] Deduced a trap composed of 126 places in 129 ms
[2020-05-12 03:24:20] [INFO ] Deduced a trap composed of 141 places in 124 ms
[2020-05-12 03:24:20] [INFO ] Deduced a trap composed of 127 places in 116 ms
[2020-05-12 03:24:20] [INFO ] Deduced a trap composed of 127 places in 111 ms
[2020-05-12 03:24:20] [INFO ] Deduced a trap composed of 131 places in 137 ms
[2020-05-12 03:24:20] [INFO ] Deduced a trap composed of 129 places in 141 ms
[2020-05-12 03:24:20] [INFO ] Deduced a trap composed of 146 places in 122 ms
[2020-05-12 03:24:21] [INFO ] Deduced a trap composed of 134 places in 126 ms
[2020-05-12 03:24:21] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-12 03:24:21] [INFO ] Deduced a trap composed of 6 places in 304 ms
[2020-05-12 03:24:21] [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 s3 s4 s228) 0)") while checking expression at index 4
[2020-05-12 03:24:21] [INFO ] [Real]Absence check using 57 positive place invariants in 56 ms returned sat
[2020-05-12 03:24:21] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 34 ms returned sat
[2020-05-12 03:24:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:24:22] [INFO ] [Real]Absence check using state equation in 867 ms returned sat
[2020-05-12 03:24:22] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:24:22] [INFO ] [Nat]Absence check using 57 positive place invariants in 55 ms returned sat
[2020-05-12 03:24:22] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 31 ms returned sat
[2020-05-12 03:24:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:24:23] [INFO ] [Nat]Absence check using state equation in 633 ms returned sat
[2020-05-12 03:24:23] [INFO ] Deduced a trap composed of 13 places in 171 ms
[2020-05-12 03:24:23] [INFO ] Deduced a trap composed of 23 places in 296 ms
[2020-05-12 03:24:23] [INFO ] Deduced a trap composed of 38 places in 168 ms
[2020-05-12 03:24:24] [INFO ] Deduced a trap composed of 13 places in 163 ms
[2020-05-12 03:24:24] [INFO ] Deduced a trap composed of 16 places in 173 ms
[2020-05-12 03:24:24] [INFO ] Deduced a trap composed of 23 places in 163 ms
[2020-05-12 03:24:24] [INFO ] Deduced a trap composed of 14 places in 294 ms
[2020-05-12 03:24:25] [INFO ] Deduced a trap composed of 40 places in 162 ms
[2020-05-12 03:24:25] [INFO ] Deduced a trap composed of 24 places in 162 ms
[2020-05-12 03:24:25] [INFO ] Deduced a trap composed of 17 places in 184 ms
[2020-05-12 03:24:25] [INFO ] Deduced a trap composed of 34 places in 159 ms
[2020-05-12 03:24:25] [INFO ] Deduced a trap composed of 42 places in 143 ms
[2020-05-12 03:24:25] [INFO ] Deduced a trap composed of 42 places in 142 ms
[2020-05-12 03:24:26] [INFO ] Deduced a trap composed of 11 places in 153 ms
[2020-05-12 03:24:26] [INFO ] Deduced a trap composed of 21 places in 157 ms
[2020-05-12 03:24:26] [INFO ] Deduced a trap composed of 122 places in 178 ms
[2020-05-12 03:24:26] [INFO ] Deduced a trap composed of 126 places in 177 ms
[2020-05-12 03:24:26] [INFO ] Deduced a trap composed of 36 places in 151 ms
[2020-05-12 03:24:27] [INFO ] Deduced a trap composed of 35 places in 314 ms
[2020-05-12 03:24:27] [INFO ] Deduced a trap composed of 17 places in 246 ms
[2020-05-12 03:24:27] [INFO ] Deduced a trap composed of 23 places in 172 ms
[2020-05-12 03:24:27] [INFO ] Deduced a trap composed of 16 places in 172 ms
[2020-05-12 03:24:28] [INFO ] Deduced a trap composed of 21 places in 189 ms
[2020-05-12 03:24:28] [INFO ] Deduced a trap composed of 126 places in 208 ms
[2020-05-12 03:24:28] [INFO ] Deduced a trap composed of 45 places in 179 ms
[2020-05-12 03:24:28] [INFO ] Deduced a trap composed of 121 places in 156 ms
[2020-05-12 03:24:28] [INFO ] Deduced a trap composed of 44 places in 259 ms
[2020-05-12 03:24:29] [INFO ] Deduced a trap composed of 23 places in 205 ms
[2020-05-12 03:24:29] [INFO ] Deduced a trap composed of 25 places in 331 ms
[2020-05-12 03:24:29] [INFO ] Deduced a trap composed of 55 places in 168 ms
[2020-05-12 03:24:29] [INFO ] Deduced a trap composed of 21 places in 151 ms
[2020-05-12 03:24:30] [INFO ] Deduced a trap composed of 44 places in 155 ms
[2020-05-12 03:24:30] [INFO ] Deduced a trap composed of 34 places in 165 ms
[2020-05-12 03:24:30] [INFO ] Deduced a trap composed of 139 places in 170 ms
[2020-05-12 03:24:30] [INFO ] Deduced a trap composed of 44 places in 161 ms
[2020-05-12 03:24:31] [INFO ] Deduced a trap composed of 38 places in 325 ms
[2020-05-12 03:24:31] [INFO ] Deduced a trap composed of 124 places in 151 ms
[2020-05-12 03:24:31] [INFO ] Deduced a trap composed of 50 places in 145 ms
[2020-05-12 03:24:31] [INFO ] Deduced a trap composed of 40 places in 184 ms
[2020-05-12 03:24:31] [INFO ] Deduced a trap composed of 133 places in 146 ms
[2020-05-12 03:24:31] [INFO ] Deduced a trap composed of 131 places in 147 ms
[2020-05-12 03:24:32] [INFO ] Deduced a trap composed of 132 places in 146 ms
[2020-05-12 03:24:32] [INFO ] Deduced a trap composed of 135 places in 259 ms
[2020-05-12 03:24:32] [INFO ] Deduced a trap composed of 130 places in 127 ms
[2020-05-12 03:24:32] [INFO ] Deduced a trap composed of 134 places in 143 ms
[2020-05-12 03:24:32] [INFO ] Deduced a trap composed of 140 places in 134 ms
[2020-05-12 03:24:33] [INFO ] Deduced a trap composed of 30 places in 173 ms
[2020-05-12 03:24:33] [INFO ] Deduced a trap composed of 59 places in 139 ms
[2020-05-12 03:24:33] [INFO ] Deduced a trap composed of 134 places in 143 ms
[2020-05-12 03:24:33] [INFO ] Deduced a trap composed of 135 places in 146 ms
[2020-05-12 03:24:33] [INFO ] Deduced a trap composed of 138 places in 135 ms
[2020-05-12 03:24:33] [INFO ] Deduced a trap composed of 146 places in 141 ms
[2020-05-12 03:24:35] [INFO ] Deduced a trap composed of 138 places in 1715 ms
[2020-05-12 03:24:35] [INFO ] Deduced a trap composed of 140 places in 133 ms
[2020-05-12 03:24:36] [INFO ] Deduced a trap composed of 126 places in 165 ms
[2020-05-12 03:24:36] [INFO ] Deduced a trap composed of 143 places in 158 ms
[2020-05-12 03:24:36] [INFO ] Deduced a trap composed of 42 places in 152 ms
[2020-05-12 03:24:36] [INFO ] Deduced a trap composed of 144 places in 131 ms
[2020-05-12 03:24:36] [INFO ] Deduced a trap composed of 136 places in 144 ms
[2020-05-12 03:24:36] [INFO ] Deduced a trap composed of 52 places in 148 ms
[2020-05-12 03:24:37] [INFO ] Deduced a trap composed of 135 places in 147 ms
[2020-05-12 03:24:37] [INFO ] Deduced a trap composed of 137 places in 285 ms
[2020-05-12 03:24:37] [INFO ] Deduced a trap composed of 32 places in 140 ms
[2020-05-12 03:24:37] [INFO ] Deduced a trap composed of 157 places in 134 ms
[2020-05-12 03:24:37] [INFO ] Deduced a trap composed of 133 places in 133 ms
[2020-05-12 03:24:38] [INFO ] Deduced a trap composed of 50 places in 144 ms
[2020-05-12 03:24:38] [INFO ] Deduced a trap composed of 150 places in 182 ms
[2020-05-12 03:24:38] [INFO ] Deduced a trap composed of 141 places in 173 ms
[2020-05-12 03:24:38] [INFO ] Deduced a trap composed of 54 places in 139 ms
[2020-05-12 03:24:38] [INFO ] Deduced a trap composed of 31 places in 157 ms
[2020-05-12 03:24:39] [INFO ] Deduced a trap composed of 34 places in 194 ms
[2020-05-12 03:24:39] [INFO ] Deduced a trap composed of 144 places in 129 ms
[2020-05-12 03:24:39] [INFO ] Deduced a trap composed of 134 places in 214 ms
[2020-05-12 03:24:39] [INFO ] Deduced a trap composed of 38 places in 249 ms
[2020-05-12 03:24:39] [INFO ] Deduced a trap composed of 40 places in 243 ms
[2020-05-12 03:24:40] [INFO ] Deduced a trap composed of 140 places in 238 ms
[2020-05-12 03:24:40] [INFO ] Deduced a trap composed of 134 places in 266 ms
[2020-05-12 03:24:40] [INFO ] Deduced a trap composed of 134 places in 152 ms
[2020-05-12 03:24:40] [INFO ] Deduced a trap composed of 61 places in 235 ms
[2020-05-12 03:24:41] [INFO ] Deduced a trap composed of 140 places in 141 ms
[2020-05-12 03:24:41] [INFO ] Deduced a trap composed of 152 places in 133 ms
[2020-05-12 03:24:41] [INFO ] Deduced a trap composed of 153 places in 124 ms
[2020-05-12 03:24:41] [INFO ] Deduced a trap composed of 150 places in 189 ms
[2020-05-12 03:24:41] [INFO ] Deduced a trap composed of 144 places in 144 ms
[2020-05-12 03:24:42] [INFO ] Deduced a trap composed of 34 places in 156 ms
[2020-05-12 03:24:42] [INFO ] Deduced a trap composed of 140 places in 258 ms
[2020-05-12 03:24:42] [INFO ] Deduced a trap composed of 124 places in 131 ms
[2020-05-12 03:24:42] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-12 03:24:42] [INFO ] Deduced a trap composed of 6 places in 316 ms
[2020-05-12 03:24:42] [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 s3 s4 s228) 0)") while checking expression at index 5
[2020-05-12 03:24:42] [INFO ] [Real]Absence check using 57 positive place invariants in 34 ms returned sat
[2020-05-12 03:24:42] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 18 ms returned sat
[2020-05-12 03:24:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:24:43] [INFO ] [Real]Absence check using state equation in 663 ms returned sat
[2020-05-12 03:24:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:24:43] [INFO ] [Nat]Absence check using 57 positive place invariants in 52 ms returned sat
[2020-05-12 03:24:43] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 18 ms returned sat
[2020-05-12 03:24:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:24:44] [INFO ] [Nat]Absence check using state equation in 647 ms returned sat
[2020-05-12 03:24:44] [INFO ] Deduced a trap composed of 16 places in 158 ms
[2020-05-12 03:24:44] [INFO ] Deduced a trap composed of 20 places in 123 ms
[2020-05-12 03:24:45] [INFO ] Deduced a trap composed of 22 places in 258 ms
[2020-05-12 03:24:45] [INFO ] Deduced a trap composed of 14 places in 272 ms
[2020-05-12 03:24:45] [INFO ] Deduced a trap composed of 118 places in 145 ms
[2020-05-12 03:24:45] [INFO ] Deduced a trap composed of 25 places in 140 ms
[2020-05-12 03:24:45] [INFO ] Deduced a trap composed of 23 places in 152 ms
[2020-05-12 03:24:45] [INFO ] Deduced a trap composed of 116 places in 131 ms
[2020-05-12 03:24:46] [INFO ] Deduced a trap composed of 18 places in 123 ms
[2020-05-12 03:24:46] [INFO ] Deduced a trap composed of 31 places in 123 ms
[2020-05-12 03:24:46] [INFO ] Deduced a trap composed of 29 places in 147 ms
[2020-05-12 03:24:46] [INFO ] Deduced a trap composed of 130 places in 117 ms
[2020-05-12 03:24:46] [INFO ] Deduced a trap composed of 31 places in 113 ms
[2020-05-12 03:24:46] [INFO ] Deduced a trap composed of 38 places in 74 ms
[2020-05-12 03:24:46] [INFO ] Deduced a trap composed of 43 places in 70 ms
[2020-05-12 03:24:46] [INFO ] Deduced a trap composed of 31 places in 66 ms
[2020-05-12 03:24:47] [INFO ] Deduced a trap composed of 37 places in 64 ms
[2020-05-12 03:24:47] [INFO ] Deduced a trap composed of 40 places in 65 ms
[2020-05-12 03:24:47] [INFO ] Deduced a trap composed of 40 places in 72 ms
[2020-05-12 03:24:47] [INFO ] Deduced a trap composed of 16 places in 50 ms
[2020-05-12 03:24:47] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2905 ms
[2020-05-12 03:24:47] [INFO ] Computed and/alt/rep : 527/2262/527 causal constraints in 25 ms.
[2020-05-12 03:24:49] [INFO ] Added : 265 causal constraints over 54 iterations in 2029 ms. Result :sat
[2020-05-12 03:24:49] [INFO ] Deduced a trap composed of 38 places in 113 ms
[2020-05-12 03:24:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 206 ms
[2020-05-12 03:24:49] [INFO ] [Real]Absence check using 57 positive place invariants in 32 ms returned sat
[2020-05-12 03:24:49] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 17 ms returned sat
[2020-05-12 03:24:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:24:50] [INFO ] [Real]Absence check using state equation in 937 ms returned sat
[2020-05-12 03:24:50] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:24:50] [INFO ] [Nat]Absence check using 57 positive place invariants in 20 ms returned unsat
[2020-05-12 03:24:50] [INFO ] [Real]Absence check using 57 positive place invariants in 34 ms returned sat
[2020-05-12 03:24:50] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 19 ms returned sat
[2020-05-12 03:24:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:24:51] [INFO ] [Real]Absence check using state equation in 666 ms returned sat
[2020-05-12 03:24:51] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:24:51] [INFO ] [Nat]Absence check using 57 positive place invariants in 58 ms returned sat
[2020-05-12 03:24:51] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 16 ms returned sat
[2020-05-12 03:24:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:24:52] [INFO ] [Nat]Absence check using state equation in 614 ms returned sat
[2020-05-12 03:24:52] [INFO ] Deduced a trap composed of 16 places in 135 ms
[2020-05-12 03:24:52] [INFO ] Deduced a trap composed of 34 places in 111 ms
[2020-05-12 03:24:52] [INFO ] Deduced a trap composed of 23 places in 104 ms
[2020-05-12 03:24:53] [INFO ] Deduced a trap composed of 25 places in 377 ms
[2020-05-12 03:24:53] [INFO ] Deduced a trap composed of 17 places in 148 ms
[2020-05-12 03:24:53] [INFO ] Deduced a trap composed of 14 places in 103 ms
[2020-05-12 03:24:53] [INFO ] Deduced a trap composed of 15 places in 91 ms
[2020-05-12 03:24:53] [INFO ] Deduced a trap composed of 17 places in 95 ms
[2020-05-12 03:24:53] [INFO ] Deduced a trap composed of 19 places in 89 ms
[2020-05-12 03:24:53] [INFO ] Deduced a trap composed of 17 places in 132 ms
[2020-05-12 03:24:54] [INFO ] Deduced a trap composed of 17 places in 87 ms
[2020-05-12 03:24:54] [INFO ] Deduced a trap composed of 24 places in 86 ms
[2020-05-12 03:24:54] [INFO ] Deduced a trap composed of 35 places in 98 ms
[2020-05-12 03:24:54] [INFO ] Deduced a trap composed of 28 places in 80 ms
[2020-05-12 03:24:54] [INFO ] Deduced a trap composed of 32 places in 98 ms
[2020-05-12 03:24:54] [INFO ] Deduced a trap composed of 21 places in 96 ms
[2020-05-12 03:24:54] [INFO ] Deduced a trap composed of 37 places in 82 ms
[2020-05-12 03:24:54] [INFO ] Deduced a trap composed of 23 places in 84 ms
[2020-05-12 03:24:54] [INFO ] Deduced a trap composed of 42 places in 84 ms
[2020-05-12 03:24:55] [INFO ] Deduced a trap composed of 17 places in 92 ms
[2020-05-12 03:24:55] [INFO ] Deduced a trap composed of 22 places in 96 ms
[2020-05-12 03:24:55] [INFO ] Deduced a trap composed of 33 places in 93 ms
[2020-05-12 03:24:55] [INFO ] Deduced a trap composed of 16 places in 98 ms
[2020-05-12 03:24:55] [INFO ] Deduced a trap composed of 46 places in 96 ms
[2020-05-12 03:24:55] [INFO ] Deduced a trap composed of 47 places in 105 ms
[2020-05-12 03:24:55] [INFO ] Deduced a trap composed of 60 places in 84 ms
[2020-05-12 03:24:55] [INFO ] Deduced a trap composed of 30 places in 82 ms
[2020-05-12 03:24:56] [INFO ] Deduced a trap composed of 56 places in 102 ms
[2020-05-12 03:24:56] [INFO ] Deduced a trap composed of 48 places in 93 ms
[2020-05-12 03:24:56] [INFO ] Deduced a trap composed of 30 places in 82 ms
[2020-05-12 03:24:56] [INFO ] Deduced a trap composed of 33 places in 76 ms
[2020-05-12 03:24:56] [INFO ] Deduced a trap composed of 27 places in 73 ms
[2020-05-12 03:24:56] [INFO ] Deduced a trap composed of 30 places in 65 ms
[2020-05-12 03:24:56] [INFO ] Deduced a trap composed of 58 places in 61 ms
[2020-05-12 03:24:56] [INFO ] Deduced a trap composed of 50 places in 72 ms
[2020-05-12 03:24:56] [INFO ] Deduced a trap composed of 30 places in 60 ms
[2020-05-12 03:24:56] [INFO ] Deduced a trap composed of 32 places in 89 ms
[2020-05-12 03:24:56] [INFO ] Deduced a trap composed of 32 places in 89 ms
[2020-05-12 03:24:57] [INFO ] Deduced a trap composed of 26 places in 99 ms
[2020-05-12 03:24:57] [INFO ] Deduced a trap composed of 34 places in 74 ms
[2020-05-12 03:24:57] [INFO ] Deduced a trap composed of 42 places in 76 ms
[2020-05-12 03:24:57] [INFO ] Deduced a trap composed of 44 places in 68 ms
[2020-05-12 03:24:57] [INFO ] Deduced a trap composed of 36 places in 80 ms
[2020-05-12 03:24:57] [INFO ] Deduced a trap composed of 36 places in 92 ms
[2020-05-12 03:24:57] [INFO ] Deduced a trap composed of 22 places in 72 ms
[2020-05-12 03:24:57] [INFO ] Deduced a trap composed of 48 places in 134 ms
[2020-05-12 03:24:57] [INFO ] Deduced a trap composed of 54 places in 49 ms
[2020-05-12 03:24:58] [INFO ] Deduced a trap composed of 35 places in 129 ms
[2020-05-12 03:24:58] [INFO ] Deduced a trap composed of 54 places in 55 ms
[2020-05-12 03:24:58] [INFO ] Trap strengthening (SAT) tested/added 50/49 trap constraints in 5894 ms
[2020-05-12 03:24:58] [INFO ] Computed and/alt/rep : 527/2262/527 causal constraints in 38 ms.
[2020-05-12 03:25:01] [INFO ] Added : 402 causal constraints over 81 iterations in 3452 ms. Result :sat
[2020-05-12 03:25:01] [INFO ] Deduced a trap composed of 38 places in 131 ms
[2020-05-12 03:25:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 258 ms
[2020-05-12 03:25:02] [INFO ] [Real]Absence check using 57 positive place invariants in 48 ms returned sat
[2020-05-12 03:25:02] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 18 ms returned sat
[2020-05-12 03:25:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:25:02] [INFO ] [Real]Absence check using state equation in 746 ms returned sat
[2020-05-12 03:25:02] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:25:03] [INFO ] [Nat]Absence check using 57 positive place invariants in 33 ms returned unsat
[2020-05-12 03:25:03] [INFO ] [Real]Absence check using 57 positive place invariants in 80 ms returned sat
[2020-05-12 03:25:03] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 17 ms returned sat
[2020-05-12 03:25:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:25:03] [INFO ] [Real]Absence check using state equation in 764 ms returned sat
[2020-05-12 03:25:03] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:25:04] [INFO ] [Nat]Absence check using 57 positive place invariants in 54 ms returned unsat
Successfully simplified 3 atomic propositions for a total of 5 simplifications.
[2020-05-12 03:25:04] [INFO ] Initial state reduction rules for CTL removed 10 formulas.
[2020-05-12 03:25:04] [INFO ] Flatten gal took : 133 ms
FORMULA BusinessProcesses-PT-13-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-12 03:25:04] [INFO ] Flatten gal took : 52 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-12 03:25:04] [INFO ] Applying decomposition
[2020-05-12 03:25:04] [INFO ] Flatten gal took : 27 ms
[2020-05-12 03:25:04] [INFO ] Input system was already deterministic with 528 transitions.
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/graph14529427856364454484.txt, -o, /tmp/graph14529427856364454484.bin, -w, /tmp/graph14529427856364454484.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/graph14529427856364454484.bin, -l, -1, -v, -w, /tmp/graph14529427856364454484.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-12 03:25:04] [INFO ] Decomposing Gal with order
[2020-05-12 03:25:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-12 03:25:05] [INFO ] Removed a total of 272 redundant transitions.
[2020-05-12 03:25:05] [INFO ] Flatten gal took : 92 ms
[2020-05-12 03:25:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 3 labels/synchronizations in 27 ms.
[2020-05-12 03:25:05] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 21 ms
[2020-05-12 03:25:05] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 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-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 528 rows 585 cols
[2020-05-12 03:25:05] [INFO ] Computed 95 place invariants in 12 ms
its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 6 LTL properties
inv : p106 + p107 + p108 - p492 - p493 = 0
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p382 + p383 + p384 + p385 + p386 = 1
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p317 + p318 + p319 + p320 + p321 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p109 + p110 + p117 + p118 + p495 + p496 + p562 = 1
inv : p0 + p1 + p2 + p239 + p240 + p241 + p242 = 1
inv : p575 + p576 + p577 - p578 - p579 - p580 = 0
inv : p0 + p173 + p174 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556 + p557 + p558 + p562 + p563 + p564 + p572 + p573 + p574 + p578 + p579 + p580 + p584 + p585 + p586 + p590 + p591 + p592 = 1
inv : p67 + p68 - p474 - p475 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p119 + p120 + p121 + p499 + p500 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p41 + p42 + p43 + p44 + p45 + p455 + p456 = 1
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p342 + p343 + p344 + p345 + p346 = 1
inv : p100 + p101 + p102 - p488 - p489 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p34 + p37 + p38 + p444 + p445 + p448 + p449 + p450 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p131 + p132 + p133 + p507 + p508 = 1
inv : p206 + p207 + p208 - p542 - p543 = 0
inv : p0 + p1 + p243 + p244 + p245 + p407 + p408 + p409 + p410 + p411 = 1
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p387 + p388 + p389 + p390 + p391 = 1
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p282 + p283 + p284 + p285 + p286 = 1
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p297 + p298 + p299 + p300 + p301 = 1
inv : p565 + p566 + p567 + p568 - p572 - p573 - p574 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p62 + p63 + p64 + p65 + p66 + p474 + p475 = 1
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p357 + p358 + p359 + p360 + p361 = 1
inv : p111 + p112 + p116 - p495 - p496 - p562 = 0
inv : p157 + p161 + p163 + p172 + p182 + p194 + p200 - p522 - p526 - p528 - p537 - p572 - p584 - p590 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p227 = 1
inv : p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p155 + p156 + p158 + p160 + p162 + p163 + p164 + p165 + p167 + p168 + p169 + p170 + p171 + p172 + p177 + p178 + p186 + p187 + p192 + p193 + p200 + p201 + p202 - p422 - p423 - p424 - p425 - p426 - p427 - p428 - p429 - p430 - p431 - p432 - p433 - p434 - p435 - p436 - p437 - p438 - p439 - p440 - p441 - p442 - p443 - p444 - p445 - p446 - p447 - p448 - p449 - p450 - p451 - p452 - p453 - p454 - p455 - p456 - p457 - p458 - p459 - p460 - p461 - p462 - p463 - p464 - p465 - p466 - p467 - p468 - p469 - p470 - p471 - p472 - p473 - p474 - p475 - p476 - p477 - p478 - p479 - p480 - p481 - p482 - p483 - p484 - p485 - p486 - p487 - p488 - p489 - p490 - p491 - p492 - p493 - p494 - p495 - p496 - p497 - p498 - p499 - p500 - p501 - p502 - p503 - p504 - p505 - p506 - p507 - p508 - p509 - p510 - p511 - p512 - p513 - p514 - p515 - p516 - p517 - p518 - p519 - p520 - p521 - p523 - p525 - p527 - p528 - p529 - p530 - p532 - p533 - p534 - p535 - p536 - p537 - p540 - p541 - p542 - p543 - p544 - p545 - p546 - p547 - p548 - p549 - p550 - p551 - p552 - p553 - p554 - p555 - p556 - p557 - p558 - p562 - p563 - p564 - p567 - p568 - p576 - p577 - p582 - p583 - p590 - p591 - p592 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p97 + p98 + p99 + p488 + p489 = 1
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p274 + p275 + p276 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p215 + p216 + p217 + p550 + p551 = 1
inv : p32 + p33 - p442 - p443 = 0
inv : p111 + p112 + p113 - p495 - p496 + p560 + p561 - p562 - p563 - p564 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p69 + p70 + p71 + p72 + p76 + p77 + p78 = 1
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p372 + p373 + p374 + p375 + p376 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p48 + p51 + p52 + p457 + p458 + p461 + p462 + p463 = 1
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p302 + p303 + p304 + p305 + p306 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p143 + p144 + p145 + p515 + p516 = 1
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p377 + p378 + p379 + p380 + p381 = 1
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p287 + p288 + p289 + p290 + p291 = 1
inv : p581 + p582 + p583 - p584 - p585 - p586 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p55 + p56 + p57 + p58 + p59 + p468 + p469 = 1
inv : p157 + p159 + p163 + p169 + p175 + p179 + p188 + p197 - p522 - p524 - p528 - p534 + p570 + p571 - p572 - p573 - p574 - p578 - p587 = 0
inv : p49 + p50 + p53 + p54 - p457 - p458 - p461 - p462 - p463 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 = 1
inv : p35 + p36 + p39 + p40 - p444 - p445 - p448 - p449 - p450 = 0
inv : -p157 - p161 - p163 - p172 - p182 - p191 - p192 - p193 + p195 + p196 - p200 + p522 + p526 + p528 + p537 + p572 + p584 + p590 = 0
inv : p46 + p47 - p455 - p456 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p137 + p138 + p139 + p511 + p512 = 1
inv : p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p155 + p156 + p158 + p160 + p162 + p163 + p164 + p165 + p167 + p168 + p169 + p170 + p171 + p172 + p177 + p178 + p186 + p187 + p192 + p193 + p197 + p198 + p199 - p422 - p423 - p424 - p425 - p426 - p427 - p428 - p429 - p430 - p431 - p432 - p433 - p434 - p435 - p436 - p437 - p438 - p439 - p440 - p441 - p442 - p443 - p444 - p445 - p446 - p447 - p448 - p449 - p450 - p451 - p452 - p453 - p454 - p455 - p456 - p457 - p458 - p459 - p460 - p461 - p462 - p463 - p464 - p465 - p466 - p467 - p468 - p469 - p470 - p471 - p472 - p473 - p474 - p475 - p476 - p477 - p478 - p479 - p480 - p481 - p482 - p483 - p484 - p485 - p486 - p487 - p488 - p489 - p490 - p491 - p492 - p493 - p494 - p495 - p496 - p497 - p498 - p499 - p500 - p501 - p502 - p503 - p504 - p505 - p506 - p507 - p508 - p509 - p510 - p511 - p512 - p513 - p514 - p515 - p516 - p517 - p518 - p519 - p520 - p521 - p523 - p525 - p527 - p528 - p529 - p530 - p532 - p533 - p534 - p535 - p536 - p537 - p540 - p541 - p542 - p543 - p544 - p545 - p546 - p547 - p548 - p549 - p550 - p551 - p552 - p553 - p554 - p555 - p556 - p557 - p558 - p562 - p563 - p564 - p567 - p568 - p576 - p577 - p582 - p583 - p590 - p591 - p592 = 0
inv : p565 + p569 + p570 + p571 - p572 - p573 - p574 = 0
inv : p128 + p129 + p130 - p503 - p504 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p221 + p222 + p223 + p554 + p555 = 1
inv : p218 + p219 + p220 - p550 - p551 = 0
inv : p185 + p186 + p187 - p188 - p189 - p190 = 0
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p307 + p308 + p309 + p310 + p311 = 1
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p347 + p348 + p349 + p350 + p351 = 1
inv : p157 + p159 + p161 + p166 - p177 - p178 + p182 + p183 + p184 - p186 - p187 + p188 + p189 + p190 + p191 - p522 - p524 - p526 - p531 + p567 + p568 - p572 - p573 - p574 + p576 + p577 - p578 - p579 - p580 + p582 + p583 - p584 - p585 - p586 = 0
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p312 + p313 + p314 + p315 + p316 = 1
inv : p0 + p1 + p243 + p244 + p412 + p413 + p414 + p415 + p416 = 1
inv : p0 + p1 + p243 + p417 + p418 + p419 + p420 + p421 = 1
inv : p60 + p61 - p468 - p469 = 0
inv : p0 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538 + p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556 + p557 + p558 + p562 + p563 + p564 + p572 + p573 + p574 + p578 + p579 + p580 + p584 + p585 + p586 + p590 + p591 + p592 = 1
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p367 + p368 + p369 + p370 + p371 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p125 + p126 + p127 + p503 + p504 = 1
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p332 + p333 + p334 + p335 + p336 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p103 + p104 + p105 + p492 + p493 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p149 + p150 + p151 + p519 + p520 = 1
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p327 + p328 + p329 + p330 + p331 = 1
inv : p0 + p1 + p2 + p3 + p4 + p231 = 1
inv : p122 + p123 + p124 - p499 - p500 = 0
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p277 + p279 + p280 + p281 = 1
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p352 + p353 + p354 + p355 + p356 = 1
inv : p0 + p1 + p2 + p3 + p235 + p236 + p237 + p238 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p203 + p204 + p205 + p542 + p543 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p69 + p70 + p71 + p72 + p73 + p77 + p78 - p253 + p255 + p357 + p358 + p360 + p361 - p362 - p363 - p365 - p366 - p367 - p368 - p370 - p371 + p372 + p373 + p375 + p376 + p492 + p493 - p499 - p500 - p560 - p561 + p563 + p564 = 1
inv : p74 + p75 - p77 - p78 + p253 - p255 - p357 - p358 - p360 - p361 + p362 + p363 + p365 + p366 + p367 + p368 + p370 + p371 - p372 - p373 - p375 - p376 - p492 - p493 + p499 + p500 + p560 + p561 - p563 - p564 = 0
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p337 + p338 + p339 + p340 + p341 = 1
inv : p212 + p213 + p214 - p546 - p547 = 0
inv : -p157 - p159 - p163 - p169 + p180 + p181 - p182 - p183 - p184 - p188 - p197 + p522 + p524 + p528 + p534 - p570 - p571 + p572 + p573 + p574 + p578 + p587 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p442 + p443 = 1
inv : p224 + p225 + p226 - p554 - p555 = 0
inv : p175 + p176 + p177 + p178 - p182 - p183 - p184 = 0
inv : p559 + p560 + p561 - p562 - p563 - p564 = 0
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p292 + p293 + p294 + p295 + p296 = 1
inv : p134 + p135 + p136 - p507 - p508 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p209 + p210 + p211 + p546 + p547 = 1
inv : p140 + p141 + p142 - p511 - p512 = 0
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p397 + p398 + p399 + p400 + p401 = 1
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p322 + p323 + p324 + p325 + p326 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p109 + p110 + p114 + p115 + p495 + p496 - p560 - p561 + p562 + p563 + p564 = 1
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p362 + p363 + p364 + p365 + p366 = 1
inv : p587 + p588 + p589 - p590 - p591 - p592 = 0
inv : p146 + p147 + p148 - p515 - p516 = 0
inv : p0 + p1 + p243 + p244 + p245 + p246 + p247 + p248 + p392 + p393 + p394 + p395 + p396 = 1
inv : p152 + p153 + p154 - p519 - p520 = 0
inv : p0 + p1 + p243 + p244 + p245 + p246 + p402 + p403 + p404 + p405 + p406 = 1
Total of 95 invariants.
[2020-05-12 03:25:05] [INFO ] Computed 95 place invariants in 43 ms
Checking formula 0 : !((X((G("((i9.i1.u107.p272==0)||(i0.i1.u87.p227==1))"))U(G("((i6.i1.u98.p253==0)||(i13.i0.u43.p103==1))")))))
Formula 0 simplified : !X(G"((i9.i1.u107.p272==0)||(i0.i1.u87.p227==1))" U G"((i6.i1.u98.p253==0)||(i13.i0.u43.p103==1))")
built 56 ordering constraints for composite.
built 22 ordering constraints for composite.
built 14 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 22 ordering constraints for composite.
built 17 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 17 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 27 ordering constraints for composite.
built 9 ordering constraints for composite.
built 10 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 15 ordering constraints for composite.
built 10 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 19 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 13 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 75 ordering constraints for composite.
built 21 ordering constraints for composite.
built 20 ordering constraints for composite.
built 4 ordering constraints for composite.
built 16 ordering constraints for composite.
built 9 ordering constraints for composite.
built 8 ordering constraints for composite.
built 4 ordering constraints for composite.
built 20 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 9 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 17 ordering constraints for composite.
built 14 ordering constraints for composite.
built 12 ordering constraints for composite.
built 26 ordering constraints for composite.
built 32 ordering constraints for composite.
built 29 ordering constraints for composite.
built 43 ordering constraints for composite.
built 19 ordering constraints for composite.
built 17 ordering constraints for composite.
built 4 ordering constraints for composite.
built 20 ordering constraints for composite.
built 15 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 16 ordering constraints for composite.
[2020-05-12 03:25:06] [INFO ] Proved 585 variables to be positive in 1369 ms
[2020-05-12 03:25:06] [INFO ] Computing symmetric may disable matrix : 528 transitions.
[2020-05-12 03:25:06] [INFO ] Computation of disable matrix completed :0/528 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-12 03:25:06] [INFO ] Computation of Complete disable matrix. took 44 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-12 03:25:06] [INFO ] Computing symmetric may enable matrix : 528 transitions.
[2020-05-12 03:25:06] [INFO ] Computation of Complete enable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-12 03:25:08] [INFO ] Computing symmetric co enabling matrix : 528 transitions.
[2020-05-12 03:25:10] [INFO ] Computation of co-enabling matrix(0/528) took 1337 ms. Total solver calls (SAT/UNSAT): 53(23/30)
[2020-05-12 03:25:14] [INFO ] Computation of co-enabling matrix(2/528) took 5646 ms. Total solver calls (SAT/UNSAT): 344(290/54)
[2020-05-12 03:25:18] [INFO ] Computation of co-enabling matrix(4/528) took 9998 ms. Total solver calls (SAT/UNSAT): 840(786/54)
[2020-05-12 03:25:21] [INFO ] Computation of co-enabling matrix(12/528) took 13062 ms. Total solver calls (SAT/UNSAT): 3081(1270/1811)
[2020-05-12 03:25:25] [INFO ] Computation of co-enabling matrix(24/528) took 16235 ms. Total solver calls (SAT/UNSAT): 5935(1644/4291)
[2020-05-12 03:25:28] [INFO ] Computation of co-enabling matrix(42/528) took 19328 ms. Total solver calls (SAT/UNSAT): 9678(2356/7322)
[2020-05-12 03:25:31] [INFO ] Computation of co-enabling matrix(59/528) took 22333 ms. Total solver calls (SAT/UNSAT): 12825(3186/9639)
[2020-05-12 03:25:34] [INFO ] Computation of co-enabling matrix(72/528) took 25531 ms. Total solver calls (SAT/UNSAT): 15438(3604/11834)
[2020-05-12 03:25:37] [INFO ] Computation of co-enabling matrix(87/528) took 28659 ms. Total solver calls (SAT/UNSAT): 18037(4083/13954)
[2020-05-12 03:25:40] [INFO ] Computation of co-enabling matrix(108/528) took 31796 ms. Total solver calls (SAT/UNSAT): 21549(4658/16891)
[2020-05-12 03:25:44] [INFO ] Computation of co-enabling matrix(125/528) took 35733 ms. Total solver calls (SAT/UNSAT): 24068(5161/18907)
[2020-05-12 03:25:48] [INFO ] Computation of co-enabling matrix(137/528) took 39189 ms. Total solver calls (SAT/UNSAT): 25598(5552/20046)
[2020-05-12 03:25:51] [INFO ] Computation of co-enabling matrix(181/528) took 42210 ms. Total solver calls (SAT/UNSAT): 28368(5785/22583)
[2020-05-12 03:25:54] [INFO ] Computation of co-enabling matrix(261/528) took 45211 ms. Total solver calls (SAT/UNSAT): 30235(6161/24074)
[2020-05-12 03:25:57] [INFO ] Computation of co-enabling matrix(280/528) took 48616 ms. Total solver calls (SAT/UNSAT): 31510(6497/25013)
[2020-05-12 03:26:01] [INFO ] Computation of co-enabling matrix(284/528) took 52468 ms. Total solver calls (SAT/UNSAT): 31873(6770/25103)
[2020-05-12 03:26:04] [INFO ] Computation of co-enabling matrix(287/528) took 55643 ms. Total solver calls (SAT/UNSAT): 32137(7034/25103)
[2020-05-12 03:26:08] [INFO ] Computation of co-enabling matrix(288/528) took 59394 ms. Total solver calls (SAT/UNSAT): 32244(7141/25103)
[2020-05-12 03:26:11] [INFO ] Computation of co-enabling matrix(289/528) took 62702 ms. Total solver calls (SAT/UNSAT): 32325(7222/25103)
[2020-05-12 03:26:14] [INFO ] Computation of co-enabling matrix(291/528) took 65743 ms. Total solver calls (SAT/UNSAT): 32490(7387/25103)
[2020-05-12 03:26:17] [INFO ] Computation of co-enabling matrix(302/528) took 68784 ms. Total solver calls (SAT/UNSAT): 33099(7996/25103)
[2020-05-12 03:26:20] [INFO ] Computation of co-enabling matrix(341/528) took 71815 ms. Total solver calls (SAT/UNSAT): 34265(8249/26016)
[2020-05-12 03:26:23] [INFO ] Computation of co-enabling matrix(419/528) took 74940 ms. Total solver calls (SAT/UNSAT): 35191(8383/26808)
[2020-05-12 03:26:26] [INFO ] Computation of co-enabling matrix(436/528) took 77988 ms. Total solver calls (SAT/UNSAT): 36623(8579/28044)
[2020-05-12 03:26:30] [INFO ] Computation of co-enabling matrix(461/528) took 81378 ms. Total solver calls (SAT/UNSAT): 38040(8931/29109)
[2020-05-12 03:26:33] [INFO ] Computation of co-enabling matrix(489/528) took 84503 ms. Total solver calls (SAT/UNSAT): 38964(9196/29768)
[2020-05-12 03:26:36] [INFO ] Computation of co-enabling matrix(520/528) took 87529 ms. Total solver calls (SAT/UNSAT): 39615(9374/30241)
[2020-05-12 03:26:36] [INFO ] Computation of Finished co-enabling matrix. took 87811 ms. Total solver calls (SAT/UNSAT): 39636(9376/30260)
[2020-05-12 03:26:36] [INFO ] Computing Do-Not-Accords matrix : 528 transitions.
[2020-05-12 03:26:37] [INFO ] Computation of Completed DNA matrix. took 690 ms. Total solver calls (SAT/UNSAT): 257(0/257)
[2020-05-12 03:26:37] [INFO ] Built C files in 92825ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
Compilation finished in 6348 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 66 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, X(([]((LTLAP0==true)))U([]((LTLAP1==true)))), --buchi-type=spotba], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, X(([]((LTLAP0==true)))U([]((LTLAP1==true)))), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, X(([]((LTLAP0==true)))U([]((LTLAP1==true)))), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
Reverse transition relation is NOT exact ! Due to transitions t29, t270, t392, t398, i0.i1.u85.t273, i0.i2.u89.t263, i0.i3.t146, i0.i3.u162.t147, i0.i4.t142, i0.i4.u164.t143, i1.i0.t386, i1.i0.u14.t401, i1.i0.u20.t389, i1.i1.t403, i1.i1.u15.t399, i1.i2.t391, i1.i2.u21.t387, i1.i3.t113, i1.i3.u173.t117, i2.i0.t377, i2.i0.u25.t379, i2.i1.t373, i3.t354, i3.i0.t352, i3.i0.t367, i3.i0.u41.t349, i3.i1.t357, i3.i1.t359, i3.i1.t361, i3.i1.t363, i4.t274, i4.i0.u79.t285, i4.i0.u81.t281, i4.i1.u83.t277, i5.i1.t158, i5.i1.u156.t159, i5.i2.t154, i5.i2.u158.t155, i5.i3.t150, i5.i3.u160.t151, i6.i0.u45.t341, i6.i2.t182, i6.i2.u144.t183, i6.i3.t178, i6.i3.u146.t179, i6.i4.t174, i6.i4.u147.t175, i7.i1.t210, i7.i1.u129.t211, i7.i2.t206, i7.i2.u131.t207, i7.i3.t202, i7.i3.u133.t203, i7.i4.t198, i7.i4.u135.t199, i7.i5.t194, i7.i5.u137.t195, i7.i6.t190, i7.i6.u139.t191, i8.i0.t395, i8.i0.u16.t397, i8.i2.t238, i8.i2.u115.t239, i8.i3.t234, i8.i3.u117.t235, i8.i4.t230, i8.i4.u119.t231, i8.i5.t226, i8.i5.u121.t227, i8.i6.t218, i8.i6.u126.t219, i9.i0.t383, i9.i0.u22.t385, i9.i2.t250, i9.i2.u109.t251, i10.i0.t406, i10.i0.u10.t408, i10.i1.t246, i10.i1.u112.t247, i10.i2.t242, i10.i2.u113.t243, i11.i0.u55.t323, i11.i0.u57.t319, i11.i0.u59.t315, i11.i1.t214, i11.i1.u128.t215, i12.u51.t331, i12.u53.t327, i13.i0.u43.t345, i13.i0.u49.t335, i13.i1.t186, i13.i1.u142.t187, i14.t293, i14.t289, i14.i0.t170, i14.i0.u149.t171, i14.i1.t166, i14.i1.t291, i14.i1.u61.t297, i14.i1.u61.t301, i14.i1.u61.t305, i14.i1.u61.t311, i14.i1.u152.t167, i14.i2.t162, i14.i2.u154.t163, i15.i0.t222, i15.i0.u124.t223, i15.i1.t102, i15.i1.u179.t106, i16.t136, i16.t129, i16.t124, i16.t122, i16.t120, i16.t115, i16.t111, i16.t109, i16.t104, i16.t100, i16.t98, i16.t95, i16.t93, i16.t90, i16.t88, i16.t86, i16.t84, i16.t82, i16.t80, i16.t77, i16.t69, i16.t66, i16.t63, i16.t60, i16.t57, i16.t54, i16.t26, i16.t23, i16.t20, i16.t17, i16.t14, i16.u225.t12, i16.u225.t37, i16.u225.t41, i16.u225.t45, i16.u225.t51, i16.u225.t74, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/344/146/526
Computing Next relation with stutter on 1188 deadlock states
Detected timeout of ITS tools.
[2020-05-12 03:45:45] [INFO ] Applying decomposition
[2020-05-12 03:45:45] [INFO ] Flatten gal took : 67 ms
[2020-05-12 03:45:45] [INFO ] Decomposing Gal with order
[2020-05-12 03:45:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-12 03:45:45] [INFO ] Removed a total of 117 redundant transitions.
[2020-05-12 03:45:46] [INFO ] Flatten gal took : 122 ms
[2020-05-12 03:45:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 63 labels/synchronizations in 64 ms.
[2020-05-12 03:45:46] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 7 ms
[2020-05-12 03:45:46] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 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-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 6 LTL properties
Checking formula 0 : !((X((G("((i0.i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u96.p272==0)||(i0.i0.i0.i0.i0.u63.p227==1))"))U(G("((i0.i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u145.p253==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u38.p103==1))")))))
Formula 0 simplified : !X(G"((i0.i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u96.p272==0)||(i0.i0.i0.i0.i0.u63.p227==1))" U G"((i0.i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u145.p253==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u38.p103==1))")
built 2 ordering constraints for composite.
built 132 ordering constraints for composite.
built 74 ordering constraints for composite.
built 73 ordering constraints for composite.
built 72 ordering constraints for composite.
built 72 ordering constraints for composite.
built 72 ordering constraints for composite.
built 70 ordering constraints for composite.
built 68 ordering constraints for composite.
built 66 ordering constraints for composite.
built 64 ordering constraints for composite.
built 47 ordering constraints for composite.
built 45 ordering constraints for composite.
built 43 ordering constraints for composite.
built 41 ordering constraints for composite.
built 39 ordering constraints for composite.
built 37 ordering constraints for composite.
built 35 ordering constraints for composite.
built 32 ordering constraints for composite.
built 30 ordering constraints for composite.
built 28 ordering constraints for composite.
built 23 ordering constraints for composite.
built 20 ordering constraints for composite.
built 17 ordering constraints for composite.
built 14 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 25 ordering constraints for composite.
built 6 ordering constraints for composite.
built 60 ordering constraints for composite.
built 58 ordering constraints for composite.
built 56 ordering constraints for composite.
built 54 ordering constraints for composite.
built 52 ordering constraints for composite.
built 50 ordering constraints for composite.
built 48 ordering constraints for composite.
built 46 ordering constraints for composite.
built 44 ordering constraints for composite.
built 42 ordering constraints for composite.
built 40 ordering constraints for composite.
built 38 ordering constraints for composite.
built 36 ordering constraints for composite.
built 34 ordering constraints for composite.
built 32 ordering constraints for composite.
built 30 ordering constraints for composite.
built 28 ordering constraints for composite.
built 26 ordering constraints for composite.
built 24 ordering constraints for composite.
built 22 ordering constraints for composite.
built 20 ordering constraints for composite.
built 18 ordering constraints for composite.
built 16 ordering constraints for composite.
built 14 ordering constraints for composite.
built 12 ordering constraints for composite.
built 10 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 81 ordering constraints for composite.
built 6 ordering constraints for composite.
Detected timeout of ITS tools.
[2020-05-12 04:06:28] [INFO ] Flatten gal took : 455 ms
[2020-05-12 04:06:29] [INFO ] Input system was already deterministic with 528 transitions.
[2020-05-12 04:06:29] [INFO ] Transformed 585 places.
[2020-05-12 04:06:29] [INFO ] Transformed 528 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//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//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
[2020-05-12 04:06:59] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 33 ms
[2020-05-12 04:06:59] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 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-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 6 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X((G("((p272==0)||(p227==1))"))U(G("((p253==0)||(p103==1))")))))
Formula 0 simplified : !X(G"((p272==0)||(p227==1))" U G"((p253==0)||(p103==1))")

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-13"
export BK_EXAMINATION="LTLCardinality"
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-13, examination is LTLCardinality"
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-158897699200545"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-13.tgz
mv BusinessProcesses-PT-13 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;