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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15745.940 258742.00 344814.00 1045.40 FFTFFFFFTFTFFTTF 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-158897699200539.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-12, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897699200539
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 324K
-rw-r--r-- 1 mcc users 3.3K 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.7K Mar 25 22:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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.5K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.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.3K 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 146K 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-12-CTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-12-CTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-12-CTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-12-CTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-12-CTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-12-CTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-12-CTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-12-CTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-12-CTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-12-CTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-12-CTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-12-CTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-12-CTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-12-CTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-12-CTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-12-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1589253357249

[2020-05-12 03:15:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-12 03:15:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 03:15:58] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2020-05-12 03:15:58] [INFO ] Transformed 586 places.
[2020-05-12 03:15:58] [INFO ] Transformed 525 transitions.
[2020-05-12 03:15:58] [INFO ] Found NUPN structural information;
[2020-05-12 03:15:58] [INFO ] Parsed PT model containing 586 places and 525 transitions in 112 ms.
Deduced a syphon composed of 4 places in 6 ms
Reduce places removed 4 places and 4 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 21 ms.
Incomplete random walk after 100000 steps, including 728 resets, run finished after 255 ms. (steps per millisecond=392 ) properties seen :[0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1]
// Phase 1: matrix 521 rows 582 cols
[2020-05-12 03:15:59] [INFO ] Computed 98 place invariants in 21 ms
[2020-05-12 03:15:59] [INFO ] [Real]Absence check using 55 positive place invariants in 41 ms returned sat
[2020-05-12 03:15:59] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 24 ms returned sat
[2020-05-12 03:15:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:16:00] [INFO ] [Real]Absence check using state equation in 690 ms returned sat
[2020-05-12 03:16:00] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:16:00] [INFO ] [Nat]Absence check using 55 positive place invariants in 47 ms returned sat
[2020-05-12 03:16:00] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 19 ms returned sat
[2020-05-12 03:16:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:16:01] [INFO ] [Nat]Absence check using state equation in 683 ms returned sat
[2020-05-12 03:16:01] [INFO ] Deduced a trap composed of 118 places in 397 ms
[2020-05-12 03:16:01] [INFO ] Deduced a trap composed of 108 places in 173 ms
[2020-05-12 03:16:01] [INFO ] Deduced a trap composed of 103 places in 162 ms
[2020-05-12 03:16:02] [INFO ] Deduced a trap composed of 12 places in 171 ms
[2020-05-12 03:16:02] [INFO ] Deduced a trap composed of 26 places in 167 ms
[2020-05-12 03:16:02] [INFO ] Deduced a trap composed of 114 places in 160 ms
[2020-05-12 03:16:02] [INFO ] Deduced a trap composed of 20 places in 156 ms
[2020-05-12 03:16:02] [INFO ] Deduced a trap composed of 27 places in 228 ms
[2020-05-12 03:16:03] [INFO ] Deduced a trap composed of 113 places in 144 ms
[2020-05-12 03:16:03] [INFO ] Deduced a trap composed of 22 places in 162 ms
[2020-05-12 03:16:03] [INFO ] Deduced a trap composed of 115 places in 148 ms
[2020-05-12 03:16:03] [INFO ] Deduced a trap composed of 109 places in 177 ms
[2020-05-12 03:16:03] [INFO ] Deduced a trap composed of 107 places in 131 ms
[2020-05-12 03:16:03] [INFO ] Deduced a trap composed of 46 places in 79 ms
[2020-05-12 03:16:04] [INFO ] Deduced a trap composed of 41 places in 395 ms
[2020-05-12 03:16:04] [INFO ] Deduced a trap composed of 45 places in 93 ms
[2020-05-12 03:16:04] [INFO ] Deduced a trap composed of 44 places in 87 ms
[2020-05-12 03:16:04] [INFO ] Deduced a trap composed of 45 places in 84 ms
[2020-05-12 03:16:04] [INFO ] Deduced a trap composed of 45 places in 90 ms
[2020-05-12 03:16:04] [INFO ] Deduced a trap composed of 52 places in 86 ms
[2020-05-12 03:16:04] [INFO ] Deduced a trap composed of 54 places in 85 ms
[2020-05-12 03:16:05] [INFO ] Deduced a trap composed of 29 places in 82 ms
[2020-05-12 03:16:05] [INFO ] Deduced a trap composed of 47 places in 78 ms
[2020-05-12 03:16:05] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 4150 ms
[2020-05-12 03:16:05] [INFO ] Computed and/alt/rep : 520/2220/520 causal constraints in 40 ms.
[2020-05-12 03:16:07] [INFO ] Added : 320 causal constraints over 64 iterations in 2568 ms. Result :sat
[2020-05-12 03:16:07] [INFO ] [Real]Absence check using 55 positive place invariants in 40 ms returned sat
[2020-05-12 03:16:07] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 22 ms returned sat
[2020-05-12 03:16:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:16:08] [INFO ] [Real]Absence check using state equation in 701 ms returned sat
[2020-05-12 03:16:08] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:16:08] [INFO ] [Nat]Absence check using 55 positive place invariants in 41 ms returned sat
[2020-05-12 03:16:08] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 20 ms returned sat
[2020-05-12 03:16:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:16:09] [INFO ] [Nat]Absence check using state equation in 663 ms returned sat
[2020-05-12 03:16:09] [INFO ] Deduced a trap composed of 16 places in 177 ms
[2020-05-12 03:16:09] [INFO ] Deduced a trap composed of 13 places in 166 ms
[2020-05-12 03:16:10] [INFO ] Deduced a trap composed of 11 places in 350 ms
[2020-05-12 03:16:10] [INFO ] Deduced a trap composed of 18 places in 157 ms
[2020-05-12 03:16:10] [INFO ] Deduced a trap composed of 113 places in 158 ms
[2020-05-12 03:16:10] [INFO ] Deduced a trap composed of 103 places in 157 ms
[2020-05-12 03:16:11] [INFO ] Deduced a trap composed of 15 places in 907 ms
[2020-05-12 03:16:12] [INFO ] Deduced a trap composed of 110 places in 489 ms
[2020-05-12 03:16:12] [INFO ] Deduced a trap composed of 21 places in 155 ms
[2020-05-12 03:16:12] [INFO ] Deduced a trap composed of 19 places in 331 ms
[2020-05-12 03:16:13] [INFO ] Deduced a trap composed of 107 places in 501 ms
[2020-05-12 03:16:13] [INFO ] Deduced a trap composed of 32 places in 157 ms
[2020-05-12 03:16:13] [INFO ] Deduced a trap composed of 21 places in 152 ms
[2020-05-12 03:16:14] [INFO ] Deduced a trap composed of 20 places in 376 ms
[2020-05-12 03:16:14] [INFO ] Deduced a trap composed of 22 places in 563 ms
[2020-05-12 03:16:14] [INFO ] Deduced a trap composed of 22 places in 169 ms
[2020-05-12 03:16:15] [INFO ] Deduced a trap composed of 13 places in 152 ms
[2020-05-12 03:16:17] [INFO ] Deduced a trap composed of 27 places in 2080 ms
[2020-05-12 03:16:17] [INFO ] Deduced a trap composed of 12 places in 406 ms
[2020-05-12 03:16:17] [INFO ] Deduced a trap composed of 27 places in 167 ms
[2020-05-12 03:16:18] [INFO ] Deduced a trap composed of 25 places in 214 ms
[2020-05-12 03:16:18] [INFO ] Deduced a trap composed of 122 places in 149 ms
[2020-05-12 03:16:18] [INFO ] Deduced a trap composed of 25 places in 282 ms
[2020-05-12 03:16:18] [INFO ] Deduced a trap composed of 25 places in 215 ms
[2020-05-12 03:16:18] [INFO ] Deduced a trap composed of 28 places in 168 ms
[2020-05-12 03:16:19] [INFO ] Deduced a trap composed of 32 places in 158 ms
[2020-05-12 03:16:19] [INFO ] Deduced a trap composed of 24 places in 144 ms
[2020-05-12 03:16:19] [INFO ] Deduced a trap composed of 117 places in 135 ms
[2020-05-12 03:16:19] [INFO ] Deduced a trap composed of 112 places in 163 ms
[2020-05-12 03:16:19] [INFO ] Deduced a trap composed of 115 places in 158 ms
[2020-05-12 03:16:20] [INFO ] Deduced a trap composed of 112 places in 315 ms
[2020-05-12 03:16:20] [INFO ] Deduced a trap composed of 114 places in 181 ms
[2020-05-12 03:16:20] [INFO ] Deduced a trap composed of 111 places in 309 ms
[2020-05-12 03:16:20] [INFO ] Deduced a trap composed of 29 places in 208 ms
[2020-05-12 03:16:21] [INFO ] Deduced a trap composed of 46 places in 334 ms
[2020-05-12 03:16:21] [INFO ] Deduced a trap composed of 45 places in 136 ms
[2020-05-12 03:16:21] [INFO ] Deduced a trap composed of 107 places in 154 ms
[2020-05-12 03:16:21] [INFO ] Deduced a trap composed of 18 places in 153 ms
[2020-05-12 03:16:22] [INFO ] Deduced a trap composed of 104 places in 171 ms
[2020-05-12 03:16:22] [INFO ] Deduced a trap composed of 117 places in 127 ms
[2020-05-12 03:16:22] [INFO ] Deduced a trap composed of 132 places in 129 ms
[2020-05-12 03:16:22] [INFO ] Deduced a trap composed of 22 places in 125 ms
[2020-05-12 03:16:22] [INFO ] Deduced a trap composed of 111 places in 125 ms
[2020-05-12 03:16:22] [INFO ] Deduced a trap composed of 22 places in 160 ms
[2020-05-12 03:16:23] [INFO ] Deduced a trap composed of 39 places in 143 ms
[2020-05-12 03:16:23] [INFO ] Deduced a trap composed of 21 places in 128 ms
[2020-05-12 03:16:23] [INFO ] Deduced a trap composed of 29 places in 140 ms
[2020-05-12 03:16:23] [INFO ] Deduced a trap composed of 20 places in 137 ms
[2020-05-12 03:16:23] [INFO ] Deduced a trap composed of 40 places in 147 ms
[2020-05-12 03:16:23] [INFO ] Deduced a trap composed of 45 places in 147 ms
[2020-05-12 03:16:24] [INFO ] Deduced a trap composed of 28 places in 532 ms
[2020-05-12 03:16:24] [INFO ] Deduced a trap composed of 35 places in 247 ms
[2020-05-12 03:16:24] [INFO ] Deduced a trap composed of 42 places in 223 ms
[2020-05-12 03:16:25] [INFO ] Deduced a trap composed of 28 places in 297 ms
[2020-05-12 03:16:25] [INFO ] Deduced a trap composed of 115 places in 132 ms
[2020-05-12 03:16:25] [INFO ] Deduced a trap composed of 112 places in 158 ms
[2020-05-12 03:16:25] [INFO ] Deduced a trap composed of 46 places in 123 ms
[2020-05-12 03:16:25] [INFO ] Deduced a trap composed of 43 places in 145 ms
[2020-05-12 03:16:26] [INFO ] Deduced a trap composed of 44 places in 159 ms
[2020-05-12 03:16:26] [INFO ] Deduced a trap composed of 105 places in 158 ms
[2020-05-12 03:16:26] [INFO ] Deduced a trap composed of 110 places in 139 ms
[2020-05-12 03:16:26] [INFO ] Deduced a trap composed of 109 places in 123 ms
[2020-05-12 03:16:26] [INFO ] Deduced a trap composed of 24 places in 169 ms
[2020-05-12 03:16:26] [INFO ] Deduced a trap composed of 42 places in 125 ms
[2020-05-12 03:16:27] [INFO ] Deduced a trap composed of 48 places in 286 ms
[2020-05-12 03:16:27] [INFO ] Deduced a trap composed of 109 places in 291 ms
[2020-05-12 03:16:27] [INFO ] Deduced a trap composed of 136 places in 167 ms
[2020-05-12 03:16:27] [INFO ] Deduced a trap composed of 123 places in 158 ms
[2020-05-12 03:16:28] [INFO ] Deduced a trap composed of 129 places in 165 ms
[2020-05-12 03:16:28] [INFO ] Deduced a trap composed of 128 places in 162 ms
[2020-05-12 03:16:28] [INFO ] Deduced a trap composed of 120 places in 160 ms
[2020-05-12 03:16:28] [INFO ] Deduced a trap composed of 44 places in 216 ms
[2020-05-12 03:16:28] [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 s27 s28 s31 s32 s165 s166 s167 s223 s224 s236 s239 s270 s348 s349 s350 s359 s369 s374 s379 s384 s389 s394 s399 s404 s409 s509 s510 s513 s514 s517 s518 s521 s522 s525 s526 s529 s530 s539 s540 s572 s576) 0)") while checking expression at index 1
[2020-05-12 03:16:28] [INFO ] [Real]Absence check using 55 positive place invariants in 33 ms returned sat
[2020-05-12 03:16:28] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 21 ms returned sat
[2020-05-12 03:16:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:16:29] [INFO ] [Real]Absence check using state equation in 686 ms returned sat
[2020-05-12 03:16:29] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:16:29] [INFO ] [Nat]Absence check using 55 positive place invariants in 69 ms returned sat
[2020-05-12 03:16:29] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 36 ms returned sat
[2020-05-12 03:16:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:16:30] [INFO ] [Nat]Absence check using state equation in 911 ms returned sat
[2020-05-12 03:16:31] [INFO ] Deduced a trap composed of 22 places in 253 ms
[2020-05-12 03:16:31] [INFO ] Deduced a trap composed of 14 places in 175 ms
[2020-05-12 03:16:31] [INFO ] Deduced a trap composed of 13 places in 182 ms
[2020-05-12 03:16:31] [INFO ] Deduced a trap composed of 16 places in 176 ms
[2020-05-12 03:16:31] [INFO ] Deduced a trap composed of 11 places in 174 ms
[2020-05-12 03:16:32] [INFO ] Deduced a trap composed of 19 places in 193 ms
[2020-05-12 03:16:32] [INFO ] Deduced a trap composed of 11 places in 178 ms
[2020-05-12 03:16:32] [INFO ] Deduced a trap composed of 119 places in 176 ms
[2020-05-12 03:16:32] [INFO ] Deduced a trap composed of 126 places in 168 ms
[2020-05-12 03:16:32] [INFO ] Deduced a trap composed of 45 places in 212 ms
[2020-05-12 03:16:33] [INFO ] Deduced a trap composed of 111 places in 138 ms
[2020-05-12 03:16:33] [INFO ] Deduced a trap composed of 21 places in 138 ms
[2020-05-12 03:16:33] [INFO ] Deduced a trap composed of 34 places in 167 ms
[2020-05-12 03:16:33] [INFO ] Deduced a trap composed of 24 places in 173 ms
[2020-05-12 03:16:33] [INFO ] Deduced a trap composed of 28 places in 173 ms
[2020-05-12 03:16:34] [INFO ] Deduced a trap composed of 108 places in 163 ms
[2020-05-12 03:16:34] [INFO ] Deduced a trap composed of 42 places in 180 ms
[2020-05-12 03:16:34] [INFO ] Deduced a trap composed of 27 places in 166 ms
[2020-05-12 03:16:34] [INFO ] Deduced a trap composed of 39 places in 161 ms
[2020-05-12 03:16:34] [INFO ] Deduced a trap composed of 30 places in 178 ms
[2020-05-12 03:16:35] [INFO ] Deduced a trap composed of 37 places in 159 ms
[2020-05-12 03:16:35] [INFO ] Deduced a trap composed of 42 places in 177 ms
[2020-05-12 03:16:35] [INFO ] Deduced a trap composed of 111 places in 193 ms
[2020-05-12 03:16:35] [INFO ] Deduced a trap composed of 24 places in 163 ms
[2020-05-12 03:16:35] [INFO ] Deduced a trap composed of 30 places in 181 ms
[2020-05-12 03:16:36] [INFO ] Deduced a trap composed of 41 places in 161 ms
[2020-05-12 03:16:36] [INFO ] Deduced a trap composed of 47 places in 162 ms
[2020-05-12 03:16:36] [INFO ] Deduced a trap composed of 113 places in 158 ms
[2020-05-12 03:16:36] [INFO ] Deduced a trap composed of 37 places in 161 ms
[2020-05-12 03:16:36] [INFO ] Deduced a trap composed of 34 places in 282 ms
[2020-05-12 03:16:37] [INFO ] Deduced a trap composed of 139 places in 232 ms
[2020-05-12 03:16:37] [INFO ] Deduced a trap composed of 20 places in 173 ms
[2020-05-12 03:16:37] [INFO ] Deduced a trap composed of 111 places in 472 ms
[2020-05-12 03:16:38] [INFO ] Deduced a trap composed of 16 places in 440 ms
[2020-05-12 03:16:38] [INFO ] Deduced a trap composed of 22 places in 155 ms
[2020-05-12 03:16:38] [INFO ] Deduced a trap composed of 136 places in 170 ms
[2020-05-12 03:16:38] [INFO ] Deduced a trap composed of 132 places in 218 ms
[2020-05-12 03:16:39] [INFO ] Deduced a trap composed of 138 places in 247 ms
[2020-05-12 03:16:40] [INFO ] Deduced a trap composed of 128 places in 1100 ms
[2020-05-12 03:16:41] [INFO ] Deduced a trap composed of 125 places in 612 ms
[2020-05-12 03:16:41] [INFO ] Deduced a trap composed of 131 places in 257 ms
[2020-05-12 03:16:41] [INFO ] Deduced a trap composed of 130 places in 221 ms
[2020-05-12 03:16:41] [INFO ] Deduced a trap composed of 126 places in 180 ms
[2020-05-12 03:16:42] [INFO ] Deduced a trap composed of 128 places in 318 ms
[2020-05-12 03:16:43] [INFO ] Deduced a trap composed of 133 places in 921 ms
[2020-05-12 03:16:43] [INFO ] Deduced a trap composed of 128 places in 297 ms
[2020-05-12 03:16:43] [INFO ] Deduced a trap composed of 134 places in 260 ms
[2020-05-12 03:16:44] [INFO ] Deduced a trap composed of 126 places in 252 ms
[2020-05-12 03:16:44] [INFO ] Deduced a trap composed of 135 places in 305 ms
[2020-05-12 03:16:44] [INFO ] Deduced a trap composed of 139 places in 157 ms
[2020-05-12 03:16:44] [INFO ] Deduced a trap composed of 130 places in 146 ms
[2020-05-12 03:16:44] [INFO ] Deduced a trap composed of 129 places in 145 ms
[2020-05-12 03:16:45] [INFO ] Deduced a trap composed of 139 places in 119 ms
[2020-05-12 03:16:45] [INFO ] Deduced a trap composed of 134 places in 257 ms
[2020-05-12 03:16:45] [INFO ] Deduced a trap composed of 133 places in 122 ms
[2020-05-12 03:16:45] [INFO ] Deduced a trap composed of 127 places in 117 ms
[2020-05-12 03:16:45] [INFO ] Deduced a trap composed of 135 places in 123 ms
[2020-05-12 03:16:45] [INFO ] Deduced a trap composed of 26 places in 125 ms
[2020-05-12 03:16:46] [INFO ] Deduced a trap composed of 28 places in 153 ms
[2020-05-12 03:16:46] [INFO ] Deduced a trap composed of 34 places in 121 ms
[2020-05-12 03:16:46] [INFO ] Deduced a trap composed of 15 places in 119 ms
[2020-05-12 03:16:46] [INFO ] Deduced a trap composed of 22 places in 154 ms
[2020-05-12 03:16:46] [INFO ] Deduced a trap composed of 37 places in 120 ms
[2020-05-12 03:16:46] [INFO ] Deduced a trap composed of 18 places in 129 ms
[2020-05-12 03:16:47] [INFO ] Deduced a trap composed of 26 places in 119 ms
[2020-05-12 03:16:47] [INFO ] Deduced a trap composed of 130 places in 456 ms
[2020-05-12 03:16:47] [INFO ] Deduced a trap composed of 54 places in 196 ms
[2020-05-12 03:16:47] [INFO ] Deduced a trap composed of 127 places in 131 ms
[2020-05-12 03:16:48] [INFO ] Deduced a trap composed of 46 places in 128 ms
[2020-05-12 03:16:48] [INFO ] Deduced a trap composed of 40 places in 130 ms
[2020-05-12 03:16:48] [INFO ] Deduced a trap composed of 25 places in 152 ms
[2020-05-12 03:16:48] [INFO ] Deduced a trap composed of 113 places in 145 ms
[2020-05-12 03:16:48] [INFO ] Deduced a trap composed of 130 places in 130 ms
[2020-05-12 03:16:49] [INFO ] Deduced a trap composed of 50 places in 124 ms
[2020-05-12 03:16:49] [INFO ] Deduced a trap composed of 119 places in 147 ms
[2020-05-12 03:16:49] [INFO ] Deduced a trap composed of 133 places in 132 ms
[2020-05-12 03:16:49] [INFO ] Deduced a trap composed of 44 places in 418 ms
[2020-05-12 03:16:49] [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 s165 s166 s167 s191 s192 s193 s215 s216 s217 s236 s239 s270 s348 s349 s350 s359 s369 s374 s379 s388 s389 s390 s394 s399 s404 s409 s428 s429 s432 s509 s510 s521 s522 s525 s526 s535 s536 s539 s540 s572 s576) 0)") while checking expression at index 2
[2020-05-12 03:16:50] [INFO ] [Real]Absence check using 55 positive place invariants in 209 ms returned sat
[2020-05-12 03:16:50] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 29 ms returned sat
[2020-05-12 03:16:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:16:50] [INFO ] [Real]Absence check using state equation in 652 ms returned sat
[2020-05-12 03:16:51] [INFO ] Deduced a trap composed of 11 places in 182 ms
[2020-05-12 03:16:51] [INFO ] Deduced a trap composed of 13 places in 201 ms
[2020-05-12 03:16:52] [INFO ] Deduced a trap composed of 22 places in 583 ms
[2020-05-12 03:16:52] [INFO ] Deduced a trap composed of 11 places in 323 ms
[2020-05-12 03:16:52] [INFO ] Deduced a trap composed of 14 places in 158 ms
[2020-05-12 03:16:52] [INFO ] Deduced a trap composed of 18 places in 140 ms
[2020-05-12 03:16:53] [INFO ] Deduced a trap composed of 25 places in 492 ms
[2020-05-12 03:16:53] [INFO ] Deduced a trap composed of 30 places in 235 ms
[2020-05-12 03:16:54] [INFO ] Deduced a trap composed of 21 places in 645 ms
[2020-05-12 03:16:54] [INFO ] Deduced a trap composed of 23 places in 206 ms
[2020-05-12 03:16:54] [INFO ] Deduced a trap composed of 21 places in 87 ms
[2020-05-12 03:16:54] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3603 ms
[2020-05-12 03:16:54] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:16:54] [INFO ] [Nat]Absence check using 55 positive place invariants in 188 ms returned sat
[2020-05-12 03:16:55] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 265 ms returned sat
[2020-05-12 03:16:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:16:56] [INFO ] [Nat]Absence check using state equation in 1195 ms returned sat
[2020-05-12 03:16:57] [INFO ] Deduced a trap composed of 11 places in 1220 ms
[2020-05-12 03:16:57] [INFO ] Deduced a trap composed of 15 places in 153 ms
[2020-05-12 03:16:58] [INFO ] Deduced a trap composed of 110 places in 528 ms
[2020-05-12 03:16:58] [INFO ] Deduced a trap composed of 107 places in 150 ms
[2020-05-12 03:16:58] [INFO ] Deduced a trap composed of 106 places in 150 ms
[2020-05-12 03:16:58] [INFO ] Deduced a trap composed of 17 places in 165 ms
[2020-05-12 03:16:59] [INFO ] Deduced a trap composed of 12 places in 165 ms
[2020-05-12 03:16:59] [INFO ] Deduced a trap composed of 21 places in 298 ms
[2020-05-12 03:16:59] [INFO ] Deduced a trap composed of 13 places in 307 ms
[2020-05-12 03:16:59] [INFO ] Deduced a trap composed of 19 places in 276 ms
[2020-05-12 03:17:00] [INFO ] Deduced a trap composed of 11 places in 242 ms
[2020-05-12 03:17:00] [INFO ] Deduced a trap composed of 20 places in 136 ms
[2020-05-12 03:17:00] [INFO ] Deduced a trap composed of 22 places in 105 ms
[2020-05-12 03:17:00] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 4246 ms
[2020-05-12 03:17:00] [INFO ] Computed and/alt/rep : 520/2220/520 causal constraints in 26 ms.
[2020-05-12 03:17:02] [INFO ] Added : 248 causal constraints over 50 iterations in 2155 ms. Result :sat
[2020-05-12 03:17:02] [INFO ] [Real]Absence check using 55 positive place invariants in 82 ms returned sat
[2020-05-12 03:17:02] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 26 ms returned sat
[2020-05-12 03:17:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:17:03] [INFO ] [Real]Absence check using state equation in 688 ms returned sat
[2020-05-12 03:17:03] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:17:03] [INFO ] [Nat]Absence check using 55 positive place invariants in 75 ms returned sat
[2020-05-12 03:17:03] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 23 ms returned sat
[2020-05-12 03:17:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:17:04] [INFO ] [Nat]Absence check using state equation in 671 ms returned sat
[2020-05-12 03:17:04] [INFO ] Deduced a trap composed of 10 places in 165 ms
[2020-05-12 03:17:04] [INFO ] Deduced a trap composed of 15 places in 163 ms
[2020-05-12 03:17:05] [INFO ] Deduced a trap composed of 20 places in 164 ms
[2020-05-12 03:17:06] [INFO ] Deduced a trap composed of 29 places in 928 ms
[2020-05-12 03:17:06] [INFO ] Deduced a trap composed of 14 places in 423 ms
[2020-05-12 03:17:06] [INFO ] Deduced a trap composed of 11 places in 150 ms
[2020-05-12 03:17:06] [INFO ] Deduced a trap composed of 8 places in 125 ms
[2020-05-12 03:17:07] [INFO ] Deduced a trap composed of 17 places in 132 ms
[2020-05-12 03:17:07] [INFO ] Deduced a trap composed of 122 places in 438 ms
[2020-05-12 03:17:08] [INFO ] Deduced a trap composed of 21 places in 550 ms
[2020-05-12 03:17:08] [INFO ] Deduced a trap composed of 38 places in 146 ms
[2020-05-12 03:17:08] [INFO ] Deduced a trap composed of 18 places in 282 ms
[2020-05-12 03:17:08] [INFO ] Deduced a trap composed of 27 places in 259 ms
[2020-05-12 03:17:09] [INFO ] Deduced a trap composed of 26 places in 284 ms
[2020-05-12 03:17:09] [INFO ] Deduced a trap composed of 107 places in 291 ms
[2020-05-12 03:17:09] [INFO ] Deduced a trap composed of 24 places in 160 ms
[2020-05-12 03:17:10] [INFO ] Deduced a trap composed of 102 places in 383 ms
[2020-05-12 03:17:10] [INFO ] Deduced a trap composed of 25 places in 557 ms
[2020-05-12 03:17:10] [INFO ] Deduced a trap composed of 29 places in 256 ms
[2020-05-12 03:17:11] [INFO ] Deduced a trap composed of 24 places in 129 ms
[2020-05-12 03:17:11] [INFO ] Deduced a trap composed of 27 places in 150 ms
[2020-05-12 03:17:11] [INFO ] Deduced a trap composed of 21 places in 122 ms
[2020-05-12 03:17:11] [INFO ] Deduced a trap composed of 112 places in 152 ms
[2020-05-12 03:17:11] [INFO ] Deduced a trap composed of 44 places in 311 ms
[2020-05-12 03:17:12] [INFO ] Deduced a trap composed of 115 places in 241 ms
[2020-05-12 03:17:12] [INFO ] Deduced a trap composed of 33 places in 260 ms
[2020-05-12 03:17:12] [INFO ] Deduced a trap composed of 109 places in 242 ms
[2020-05-12 03:17:12] [INFO ] Deduced a trap composed of 122 places in 151 ms
[2020-05-12 03:17:13] [INFO ] Deduced a trap composed of 31 places in 230 ms
[2020-05-12 03:17:13] [INFO ] Deduced a trap composed of 30 places in 301 ms
[2020-05-12 03:17:13] [INFO ] Deduced a trap composed of 27 places in 225 ms
[2020-05-12 03:17:14] [INFO ] Deduced a trap composed of 104 places in 353 ms
[2020-05-12 03:17:14] [INFO ] Deduced a trap composed of 32 places in 123 ms
[2020-05-12 03:17:14] [INFO ] Deduced a trap composed of 107 places in 172 ms
[2020-05-12 03:17:14] [INFO ] Deduced a trap composed of 111 places in 307 ms
[2020-05-12 03:17:15] [INFO ] Deduced a trap composed of 35 places in 249 ms
[2020-05-12 03:17:15] [INFO ] Deduced a trap composed of 105 places in 130 ms
[2020-05-12 03:17:15] [INFO ] Deduced a trap composed of 31 places in 275 ms
[2020-05-12 03:17:15] [INFO ] Deduced a trap composed of 40 places in 137 ms
[2020-05-12 03:17:15] [INFO ] Deduced a trap composed of 46 places in 128 ms
[2020-05-12 03:17:16] [INFO ] Deduced a trap composed of 39 places in 254 ms
[2020-05-12 03:17:16] [INFO ] Deduced a trap composed of 107 places in 120 ms
[2020-05-12 03:17:16] [INFO ] Deduced a trap composed of 106 places in 117 ms
[2020-05-12 03:17:16] [INFO ] Deduced a trap composed of 36 places in 132 ms
[2020-05-12 03:17:16] [INFO ] Deduced a trap composed of 41 places in 157 ms
[2020-05-12 03:17:16] [INFO ] Deduced a trap composed of 54 places in 119 ms
[2020-05-12 03:17:17] [INFO ] Deduced a trap composed of 39 places in 122 ms
[2020-05-12 03:17:17] [INFO ] Deduced a trap composed of 44 places in 123 ms
[2020-05-12 03:17:17] [INFO ] Deduced a trap composed of 58 places in 161 ms
[2020-05-12 03:17:17] [INFO ] Deduced a trap composed of 21 places in 254 ms
[2020-05-12 03:17:17] [INFO ] Deduced a trap composed of 59 places in 106 ms
[2020-05-12 03:17:17] [INFO ] Deduced a trap composed of 59 places in 114 ms
[2020-05-12 03:17:18] [INFO ] Deduced a trap composed of 39 places in 111 ms
[2020-05-12 03:17:18] [INFO ] Deduced a trap composed of 25 places in 153 ms
[2020-05-12 03:17:18] [INFO ] Deduced a trap composed of 53 places in 113 ms
[2020-05-12 03:17:18] [INFO ] Deduced a trap composed of 112 places in 136 ms
[2020-05-12 03:17:18] [INFO ] Deduced a trap composed of 26 places in 116 ms
[2020-05-12 03:17:18] [INFO ] Deduced a trap composed of 43 places in 121 ms
[2020-05-12 03:17:19] [INFO ] Deduced a trap composed of 45 places in 118 ms
[2020-05-12 03:17:19] [INFO ] Deduced a trap composed of 109 places in 110 ms
[2020-05-12 03:17:19] [INFO ] Deduced a trap composed of 120 places in 271 ms
[2020-05-12 03:17:19] [INFO ] Deduced a trap composed of 24 places in 519 ms
[2020-05-12 03:17:20] [INFO ] Trap strengthening (SAT) tested/added 63/62 trap constraints in 15484 ms
[2020-05-12 03:17:20] [INFO ] Computed and/alt/rep : 520/2220/520 causal constraints in 23 ms.
[2020-05-12 03:17:23] [INFO ] Added : 332 causal constraints over 67 iterations in 3627 ms. Result :(error "Failed to check-sat")
[2020-05-12 03:17:23] [INFO ] [Real]Absence check using 55 positive place invariants in 32 ms returned sat
[2020-05-12 03:17:23] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 20 ms returned sat
[2020-05-12 03:17:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:17:24] [INFO ] [Real]Absence check using state equation in 698 ms returned sat
[2020-05-12 03:17:24] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:17:24] [INFO ] [Nat]Absence check using 55 positive place invariants in 135 ms returned sat
[2020-05-12 03:17:24] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 72 ms returned sat
[2020-05-12 03:17:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:17:25] [INFO ] [Nat]Absence check using state equation in 1089 ms returned sat
[2020-05-12 03:17:26] [INFO ] Deduced a trap composed of 19 places in 194 ms
[2020-05-12 03:17:26] [INFO ] Deduced a trap composed of 15 places in 388 ms
[2020-05-12 03:17:26] [INFO ] Deduced a trap composed of 14 places in 127 ms
[2020-05-12 03:17:26] [INFO ] Deduced a trap composed of 27 places in 265 ms
[2020-05-12 03:17:27] [INFO ] Deduced a trap composed of 21 places in 884 ms
[2020-05-12 03:17:28] [INFO ] Deduced a trap composed of 27 places in 371 ms
[2020-05-12 03:17:28] [INFO ] Deduced a trap composed of 20 places in 132 ms
[2020-05-12 03:17:28] [INFO ] Deduced a trap composed of 16 places in 86 ms
[2020-05-12 03:17:28] [INFO ] Deduced a trap composed of 16 places in 75 ms
[2020-05-12 03:17:29] [INFO ] Deduced a trap composed of 20 places in 824 ms
[2020-05-12 03:17:29] [INFO ] Deduced a trap composed of 38 places in 169 ms
[2020-05-12 03:17:29] [INFO ] Deduced a trap composed of 45 places in 59 ms
[2020-05-12 03:17:30] [INFO ] Deduced a trap composed of 50 places in 280 ms
[2020-05-12 03:17:30] [INFO ] Deduced a trap composed of 46 places in 113 ms
[2020-05-12 03:17:30] [INFO ] Deduced a trap composed of 56 places in 121 ms
[2020-05-12 03:17:30] [INFO ] Deduced a trap composed of 41 places in 284 ms
[2020-05-12 03:17:30] [INFO ] Deduced a trap composed of 36 places in 145 ms
[2020-05-12 03:17:31] [INFO ] Deduced a trap composed of 60 places in 163 ms
[2020-05-12 03:17:31] [INFO ] Deduced a trap composed of 78 places in 71 ms
[2020-05-12 03:17:31] [INFO ] Deduced a trap composed of 83 places in 123 ms
[2020-05-12 03:17:31] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 5476 ms
[2020-05-12 03:17:31] [INFO ] Computed and/alt/rep : 520/2220/520 causal constraints in 24 ms.
[2020-05-12 03:17:32] [INFO ] Added : 189 causal constraints over 39 iterations in 1556 ms. Result :sat
[2020-05-12 03:17:33] [INFO ] [Real]Absence check using 55 positive place invariants in 65 ms returned sat
[2020-05-12 03:17:33] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 45 ms returned sat
[2020-05-12 03:17:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:17:33] [INFO ] [Real]Absence check using state equation in 691 ms returned sat
[2020-05-12 03:17:33] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:17:34] [INFO ] [Nat]Absence check using 55 positive place invariants in 187 ms returned sat
[2020-05-12 03:17:34] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 19 ms returned sat
[2020-05-12 03:17:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:17:34] [INFO ] [Nat]Absence check using state equation in 656 ms returned sat
[2020-05-12 03:17:35] [INFO ] Deduced a trap composed of 21 places in 314 ms
[2020-05-12 03:17:35] [INFO ] Deduced a trap composed of 14 places in 355 ms
[2020-05-12 03:17:35] [INFO ] Deduced a trap composed of 33 places in 284 ms
[2020-05-12 03:17:36] [INFO ] Deduced a trap composed of 20 places in 324 ms
[2020-05-12 03:17:36] [INFO ] Deduced a trap composed of 149 places in 294 ms
[2020-05-12 03:17:36] [INFO ] Deduced a trap composed of 31 places in 96 ms
[2020-05-12 03:17:36] [INFO ] Deduced a trap composed of 19 places in 90 ms
[2020-05-12 03:17:37] [INFO ] Deduced a trap composed of 28 places in 362 ms
[2020-05-12 03:17:37] [INFO ] Deduced a trap composed of 27 places in 205 ms
[2020-05-12 03:17:37] [INFO ] Deduced a trap composed of 24 places in 135 ms
[2020-05-12 03:17:37] [INFO ] Deduced a trap composed of 30 places in 107 ms
[2020-05-12 03:17:38] [INFO ] Deduced a trap composed of 52 places in 274 ms
[2020-05-12 03:17:38] [INFO ] Deduced a trap composed of 134 places in 170 ms
[2020-05-12 03:17:38] [INFO ] Deduced a trap composed of 21 places in 302 ms
[2020-05-12 03:17:38] [INFO ] Deduced a trap composed of 134 places in 374 ms
[2020-05-12 03:17:39] [INFO ] Deduced a trap composed of 24 places in 146 ms
[2020-05-12 03:17:39] [INFO ] Deduced a trap composed of 41 places in 217 ms
[2020-05-12 03:17:39] [INFO ] Deduced a trap composed of 140 places in 143 ms
[2020-05-12 03:17:39] [INFO ] Deduced a trap composed of 38 places in 362 ms
[2020-05-12 03:17:40] [INFO ] Deduced a trap composed of 43 places in 145 ms
[2020-05-12 03:17:40] [INFO ] Deduced a trap composed of 25 places in 527 ms
[2020-05-12 03:17:41] [INFO ] Deduced a trap composed of 39 places in 409 ms
[2020-05-12 03:17:41] [INFO ] Deduced a trap composed of 53 places in 324 ms
[2020-05-12 03:17:41] [INFO ] Deduced a trap composed of 130 places in 151 ms
[2020-05-12 03:17:42] [INFO ] Deduced a trap composed of 50 places in 444 ms
[2020-05-12 03:17:42] [INFO ] Deduced a trap composed of 40 places in 615 ms
[2020-05-12 03:17:43] [INFO ] Deduced a trap composed of 147 places in 612 ms
[2020-05-12 03:17:43] [INFO ] Deduced a trap composed of 143 places in 126 ms
[2020-05-12 03:17:43] [INFO ] Deduced a trap composed of 145 places in 136 ms
[2020-05-12 03:17:43] [INFO ] Deduced a trap composed of 21 places in 126 ms
[2020-05-12 03:17:44] [INFO ] Deduced a trap composed of 35 places in 711 ms
[2020-05-12 03:17:44] [INFO ] Deduced a trap composed of 36 places in 254 ms
[2020-05-12 03:17:45] [INFO ] Deduced a trap composed of 33 places in 257 ms
[2020-05-12 03:17:46] [INFO ] Deduced a trap composed of 30 places in 1514 ms
[2020-05-12 03:17:47] [INFO ] Deduced a trap composed of 149 places in 619 ms
[2020-05-12 03:17:47] [INFO ] Deduced a trap composed of 34 places in 180 ms
[2020-05-12 03:17:47] [INFO ] Deduced a trap composed of 45 places in 142 ms
[2020-05-12 03:17:47] [INFO ] Deduced a trap composed of 131 places in 191 ms
[2020-05-12 03:17:48] [INFO ] Deduced a trap composed of 42 places in 289 ms
[2020-05-12 03:17:49] [INFO ] Deduced a trap composed of 146 places in 929 ms
[2020-05-12 03:17:49] [INFO ] Deduced a trap composed of 140 places in 532 ms
[2020-05-12 03:17:49] [INFO ] Deduced a trap composed of 143 places in 145 ms
[2020-05-12 03:17:50] [INFO ] Deduced a trap composed of 139 places in 139 ms
[2020-05-12 03:17:50] [INFO ] Deduced a trap composed of 139 places in 293 ms
[2020-05-12 03:17:51] [INFO ] Deduced a trap composed of 144 places in 813 ms
[2020-05-12 03:17:51] [INFO ] Deduced a trap composed of 143 places in 184 ms
[2020-05-12 03:17:51] [INFO ] Deduced a trap composed of 135 places in 239 ms
[2020-05-12 03:17:52] [INFO ] Deduced a trap composed of 136 places in 296 ms
[2020-05-12 03:17:52] [INFO ] Deduced a trap composed of 139 places in 157 ms
[2020-05-12 03:17:52] [INFO ] Deduced a trap composed of 127 places in 297 ms
[2020-05-12 03:17:52] [INFO ] Deduced a trap composed of 141 places in 175 ms
[2020-05-12 03:17:53] [INFO ] Deduced a trap composed of 135 places in 189 ms
[2020-05-12 03:17:53] [INFO ] Deduced a trap composed of 138 places in 290 ms
[2020-05-12 03:17:53] [INFO ] Deduced a trap composed of 128 places in 149 ms
[2020-05-12 03:17:53] [INFO ] Deduced a trap composed of 128 places in 388 ms
[2020-05-12 03:17:53] [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 s31 s32 s60 s61 s62 s66 s67 s68 s69 s77 s78 s79 s80 s81 s82 s83 s114 s134 s135 s145 s154 s155 s159 s160 s161 s171 s172 s173 s176 s177 s185 s223 s224 s236 s239 s270 s279 s289 s293 s295 s304 s314 s319 s324 s344 s349 s364 s369 s374 s384 s394 s398 s399 s400 s404 s409 s413 s414 s415 s416 s417 s418 s419 s420 s421 s422 s423 s424 s425 s426 s427 s428 s429 s432 s437 s438 s439 s440 s441 s442 s449 s450 s454 s455 s456 s458 s469 s470 s471 s474 s475 s476 s477 s478 s479 s486 s487 s488 s489 s490 s491 s492 s493 s496 s497 s502 s503 s513 s514 s517 s518 s521 s522 s527 s528 s529 s530 s539 s540 s543 s551 s557 s558 s559 s563) 0)") while checking expression at index 6
[2020-05-12 03:17:54] [INFO ] [Real]Absence check using 55 positive place invariants in 93 ms returned sat
[2020-05-12 03:17:54] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 37 ms returned sat
[2020-05-12 03:17:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:17:54] [INFO ] [Real]Absence check using state equation in 791 ms returned sat
[2020-05-12 03:17:54] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:17:55] [INFO ] [Nat]Absence check using 55 positive place invariants in 52 ms returned sat
[2020-05-12 03:17:55] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 21 ms returned sat
[2020-05-12 03:17:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:17:56] [INFO ] [Nat]Absence check using state equation in 967 ms returned sat
[2020-05-12 03:17:56] [INFO ] Deduced a trap composed of 16 places in 341 ms
[2020-05-12 03:17:56] [INFO ] Deduced a trap composed of 14 places in 217 ms
[2020-05-12 03:17:57] [INFO ] Deduced a trap composed of 11 places in 396 ms
[2020-05-12 03:17:57] [INFO ] Deduced a trap composed of 21 places in 422 ms
[2020-05-12 03:17:57] [INFO ] Deduced a trap composed of 11 places in 145 ms
[2020-05-12 03:17:57] [INFO ] Deduced a trap composed of 24 places in 141 ms
[2020-05-12 03:17:58] [INFO ] Deduced a trap composed of 19 places in 256 ms
[2020-05-12 03:17:59] [INFO ] Deduced a trap composed of 30 places in 1098 ms
[2020-05-12 03:18:00] [INFO ] Deduced a trap composed of 16 places in 972 ms
[2020-05-12 03:18:00] [INFO ] Deduced a trap composed of 114 places in 282 ms
[2020-05-12 03:18:01] [INFO ] Deduced a trap composed of 26 places in 424 ms
[2020-05-12 03:18:01] [INFO ] Deduced a trap composed of 26 places in 449 ms
[2020-05-12 03:18:01] [INFO ] Deduced a trap composed of 24 places in 357 ms
[2020-05-12 03:18:02] [INFO ] Deduced a trap composed of 15 places in 292 ms
[2020-05-12 03:18:02] [INFO ] Deduced a trap composed of 29 places in 120 ms
[2020-05-12 03:18:02] [INFO ] Deduced a trap composed of 129 places in 184 ms
[2020-05-12 03:18:02] [INFO ] Deduced a trap composed of 134 places in 135 ms
[2020-05-12 03:18:02] [INFO ] Deduced a trap composed of 126 places in 156 ms
[2020-05-12 03:18:03] [INFO ] Deduced a trap composed of 127 places in 145 ms
[2020-05-12 03:18:03] [INFO ] Deduced a trap composed of 125 places in 234 ms
[2020-05-12 03:18:03] [INFO ] Deduced a trap composed of 19 places in 277 ms
[2020-05-12 03:18:03] [INFO ] Deduced a trap composed of 115 places in 130 ms
[2020-05-12 03:18:04] [INFO ] Deduced a trap composed of 120 places in 191 ms
[2020-05-12 03:18:04] [INFO ] Deduced a trap composed of 119 places in 120 ms
[2020-05-12 03:18:04] [INFO ] Deduced a trap composed of 118 places in 150 ms
[2020-05-12 03:18:04] [INFO ] Deduced a trap composed of 117 places in 229 ms
[2020-05-12 03:18:04] [INFO ] Deduced a trap composed of 109 places in 113 ms
[2020-05-12 03:18:04] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 8698 ms
[2020-05-12 03:18:04] [INFO ] Computed and/alt/rep : 520/2220/520 causal constraints in 50 ms.
[2020-05-12 03:18:07] [INFO ] Added : 284 causal constraints over 57 iterations in 2835 ms. Result :sat
[2020-05-12 03:18:07] [INFO ] Deduced a trap composed of 125 places in 182 ms
[2020-05-12 03:18:08] [INFO ] Deduced a trap composed of 131 places in 477 ms
[2020-05-12 03:18:08] [INFO ] Deduced a trap composed of 114 places in 195 ms
[2020-05-12 03:18:08] [INFO ] Deduced a trap composed of 126 places in 220 ms
[2020-05-12 03:18:09] [INFO ] Deduced a trap composed of 128 places in 261 ms
[2020-05-12 03:18:10] [INFO ] Deduced a trap composed of 130 places in 1371 ms
[2020-05-12 03:18:10] [INFO ] Deduced a trap composed of 109 places in 122 ms
[2020-05-12 03:18:11] [INFO ] Deduced a trap composed of 122 places in 237 ms
[2020-05-12 03:18:11] [INFO ] Deduced a trap composed of 128 places in 616 ms
[2020-05-12 03:18:12] [INFO ] Deduced a trap composed of 116 places in 269 ms
[2020-05-12 03:18:12] [INFO ] Deduced a trap composed of 116 places in 126 ms
[2020-05-12 03:18:12] [INFO ] Deduced a trap composed of 121 places in 149 ms
[2020-05-12 03:18:12] [INFO ] Deduced a trap composed of 115 places in 133 ms
[2020-05-12 03:18:12] [INFO ] Deduced a trap composed of 120 places in 143 ms
[2020-05-12 03:18:13] [INFO ] Deduced a trap composed of 134 places in 145 ms
[2020-05-12 03:18:13] [INFO ] Deduced a trap composed of 118 places in 142 ms
[2020-05-12 03:18:13] [INFO ] Deduced a trap composed of 129 places in 163 ms
[2020-05-12 03:18:13] [INFO ] Deduced a trap composed of 113 places in 127 ms
[2020-05-12 03:18:13] [INFO ] Deduced a trap composed of 116 places in 190 ms
[2020-05-12 03:18:14] [INFO ] Deduced a trap composed of 111 places in 165 ms
[2020-05-12 03:18:14] [INFO ] Deduced a trap composed of 112 places in 135 ms
[2020-05-12 03:18:14] [INFO ] Deduced a trap composed of 109 places in 155 ms
[2020-05-12 03:18:14] [INFO ] Deduced a trap composed of 114 places in 127 ms
[2020-05-12 03:18:14] [INFO ] Deduced a trap composed of 111 places in 248 ms
[2020-05-12 03:18:14] [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 s5 s134 s135 s159 s160 s161 s176 s177 s178 s182 s191 s192 s193 s225 s283 s285 s289 s293 s295 s309 s313 s314 s315 s319 s324 s334 s359 s369 s374 s379 s394 s399 s404 s413 s416 s417 s418 s419 s420 s421 s422 s423 s424 s425 s426 s427 s428 s429 s430 s431 s432 s433 s434 s439 s440 s441 s442 s447 s448 s449 s450 s451 s452 s474 s475 s478 s479 s486 s487 s488 s489 s490 s491 s492 s493 s494 s495 s496 s497 s500 s501 s502 s503 s504 s505 s506 s507 s515 s516 s517 s518 s521 s522 s525 s526 s527 s528 s529 s530 s535 s536 s539 s540 s541 s542 s543) 0)") while checking expression at index 7
[2020-05-12 03:18:15] [INFO ] [Real]Absence check using 55 positive place invariants in 30 ms returned sat
[2020-05-12 03:18:15] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 20 ms returned sat
[2020-05-12 03:18:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:18:15] [INFO ] [Real]Absence check using state equation in 667 ms returned sat
[2020-05-12 03:18:16] [INFO ] Deduced a trap composed of 11 places in 578 ms
[2020-05-12 03:18:16] [INFO ] Deduced a trap composed of 13 places in 610 ms
[2020-05-12 03:18:17] [INFO ] Deduced a trap composed of 19 places in 98 ms
[2020-05-12 03:18:17] [INFO ] Deduced a trap composed of 29 places in 128 ms
[2020-05-12 03:18:17] [INFO ] Deduced a trap composed of 19 places in 116 ms
[2020-05-12 03:18:17] [INFO ] Deduced a trap composed of 31 places in 145 ms
[2020-05-12 03:18:17] [INFO ] Deduced a trap composed of 39 places in 94 ms
[2020-05-12 03:18:17] [INFO ] Deduced a trap composed of 20 places in 106 ms
[2020-05-12 03:18:18] [INFO ] Deduced a trap composed of 29 places in 559 ms
[2020-05-12 03:18:18] [INFO ] Deduced a trap composed of 21 places in 149 ms
[2020-05-12 03:18:19] [INFO ] Deduced a trap composed of 46 places in 472 ms
[2020-05-12 03:18:19] [INFO ] Deduced a trap composed of 17 places in 334 ms
[2020-05-12 03:18:19] [INFO ] Deduced a trap composed of 27 places in 90 ms
[2020-05-12 03:18:19] [INFO ] Deduced a trap composed of 23 places in 116 ms
[2020-05-12 03:18:19] [INFO ] Deduced a trap composed of 20 places in 102 ms
[2020-05-12 03:18:19] [INFO ] Deduced a trap composed of 20 places in 97 ms
[2020-05-12 03:18:20] [INFO ] Deduced a trap composed of 32 places in 123 ms
[2020-05-12 03:18:20] [INFO ] Deduced a trap composed of 36 places in 365 ms
[2020-05-12 03:18:20] [INFO ] Deduced a trap composed of 29 places in 299 ms
[2020-05-12 03:18:20] [INFO ] Deduced a trap composed of 20 places in 113 ms
[2020-05-12 03:18:21] [INFO ] Deduced a trap composed of 28 places in 182 ms
[2020-05-12 03:18:21] [INFO ] Deduced a trap composed of 14 places in 179 ms
[2020-05-12 03:18:21] [INFO ] Deduced a trap composed of 21 places in 85 ms
[2020-05-12 03:18:21] [INFO ] Deduced a trap composed of 25 places in 198 ms
[2020-05-12 03:18:21] [INFO ] Deduced a trap composed of 24 places in 256 ms
[2020-05-12 03:18:22] [INFO ] Deduced a trap composed of 30 places in 209 ms
[2020-05-12 03:18:22] [INFO ] Deduced a trap composed of 21 places in 89 ms
[2020-05-12 03:18:22] [INFO ] Deduced a trap composed of 45 places in 153 ms
[2020-05-12 03:18:22] [INFO ] Deduced a trap composed of 51 places in 184 ms
[2020-05-12 03:18:22] [INFO ] Deduced a trap composed of 28 places in 238 ms
[2020-05-12 03:18:23] [INFO ] Deduced a trap composed of 56 places in 223 ms
[2020-05-12 03:18:23] [INFO ] Deduced a trap composed of 25 places in 141 ms
[2020-05-12 03:18:23] [INFO ] Deduced a trap composed of 27 places in 224 ms
[2020-05-12 03:18:23] [INFO ] Deduced a trap composed of 43 places in 92 ms
[2020-05-12 03:18:23] [INFO ] Deduced a trap composed of 29 places in 64 ms
[2020-05-12 03:18:23] [INFO ] Deduced a trap composed of 26 places in 88 ms
[2020-05-12 03:18:24] [INFO ] Deduced a trap composed of 28 places in 87 ms
[2020-05-12 03:18:24] [INFO ] Deduced a trap composed of 43 places in 66 ms
[2020-05-12 03:18:24] [INFO ] Deduced a trap composed of 31 places in 68 ms
[2020-05-12 03:18:24] [INFO ] Deduced a trap composed of 43 places in 63 ms
[2020-05-12 03:18:24] [INFO ] Deduced a trap composed of 40 places in 63 ms
[2020-05-12 03:18:24] [INFO ] Deduced a trap composed of 56 places in 61 ms
[2020-05-12 03:18:24] [INFO ] Deduced a trap composed of 52 places in 64 ms
[2020-05-12 03:18:24] [INFO ] Deduced a trap composed of 43 places in 61 ms
[2020-05-12 03:18:24] [INFO ] Deduced a trap composed of 45 places in 54 ms
[2020-05-12 03:18:24] [INFO ] Deduced a trap composed of 48 places in 120 ms
[2020-05-12 03:18:24] [INFO ] Trap strengthening (SAT) tested/added 47/46 trap constraints in 9221 ms
[2020-05-12 03:18:24] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:18:25] [INFO ] [Nat]Absence check using 55 positive place invariants in 39 ms returned sat
[2020-05-12 03:18:25] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 19 ms returned sat
[2020-05-12 03:18:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:18:25] [INFO ] [Nat]Absence check using state equation in 638 ms returned sat
[2020-05-12 03:18:25] [INFO ] Deduced a trap composed of 14 places in 96 ms
[2020-05-12 03:18:25] [INFO ] Deduced a trap composed of 11 places in 94 ms
[2020-05-12 03:18:26] [INFO ] Deduced a trap composed of 29 places in 133 ms
[2020-05-12 03:18:26] [INFO ] Deduced a trap composed of 28 places in 85 ms
[2020-05-12 03:18:26] [INFO ] Deduced a trap composed of 21 places in 86 ms
[2020-05-12 03:18:26] [INFO ] Deduced a trap composed of 24 places in 78 ms
[2020-05-12 03:18:26] [INFO ] Deduced a trap composed of 20 places in 78 ms
[2020-05-12 03:18:26] [INFO ] Deduced a trap composed of 19 places in 128 ms
[2020-05-12 03:18:27] [INFO ] Deduced a trap composed of 34 places in 181 ms
[2020-05-12 03:18:27] [INFO ] Deduced a trap composed of 31 places in 112 ms
[2020-05-12 03:18:27] [INFO ] Deduced a trap composed of 23 places in 77 ms
[2020-05-12 03:18:27] [INFO ] Deduced a trap composed of 38 places in 172 ms
[2020-05-12 03:18:27] [INFO ] Deduced a trap composed of 29 places in 102 ms
[2020-05-12 03:18:27] [INFO ] Deduced a trap composed of 25 places in 93 ms
[2020-05-12 03:18:27] [INFO ] Deduced a trap composed of 35 places in 74 ms
[2020-05-12 03:18:27] [INFO ] Deduced a trap composed of 41 places in 76 ms
[2020-05-12 03:18:28] [INFO ] Deduced a trap composed of 29 places in 57 ms
[2020-05-12 03:18:28] [INFO ] Deduced a trap composed of 36 places in 74 ms
[2020-05-12 03:18:28] [INFO ] Deduced a trap composed of 31 places in 59 ms
[2020-05-12 03:18:28] [INFO ] Deduced a trap composed of 44 places in 66 ms
[2020-05-12 03:18:28] [INFO ] Deduced a trap composed of 25 places in 236 ms
[2020-05-12 03:18:28] [INFO ] Deduced a trap composed of 22 places in 136 ms
[2020-05-12 03:18:28] [INFO ] Deduced a trap composed of 23 places in 131 ms
[2020-05-12 03:18:29] [INFO ] Deduced a trap composed of 34 places in 106 ms
[2020-05-12 03:18:29] [INFO ] Deduced a trap composed of 32 places in 125 ms
[2020-05-12 03:18:29] [INFO ] Deduced a trap composed of 24 places in 133 ms
[2020-05-12 03:18:29] [INFO ] Deduced a trap composed of 27 places in 130 ms
[2020-05-12 03:18:29] [INFO ] Deduced a trap composed of 38 places in 113 ms
[2020-05-12 03:18:29] [INFO ] Deduced a trap composed of 46 places in 74 ms
[2020-05-12 03:18:29] [INFO ] Deduced a trap composed of 35 places in 73 ms
[2020-05-12 03:18:29] [INFO ] Deduced a trap composed of 41 places in 60 ms
[2020-05-12 03:18:29] [INFO ] Deduced a trap composed of 37 places in 71 ms
[2020-05-12 03:18:30] [INFO ] Deduced a trap composed of 42 places in 77 ms
[2020-05-12 03:18:30] [INFO ] Deduced a trap composed of 33 places in 61 ms
[2020-05-12 03:18:30] [INFO ] Deduced a trap composed of 26 places in 58 ms
[2020-05-12 03:18:30] [INFO ] Deduced a trap composed of 29 places in 57 ms
[2020-05-12 03:18:30] [INFO ] Deduced a trap composed of 33 places in 55 ms
[2020-05-12 03:18:30] [INFO ] Deduced a trap composed of 41 places in 55 ms
[2020-05-12 03:18:30] [INFO ] Deduced a trap composed of 26 places in 43 ms
[2020-05-12 03:18:30] [INFO ] Deduced a trap composed of 42 places in 71 ms
[2020-05-12 03:18:30] [INFO ] Trap strengthening (SAT) tested/added 41/40 trap constraints in 4934 ms
[2020-05-12 03:18:30] [INFO ] Computed and/alt/rep : 520/2220/520 causal constraints in 20 ms.
[2020-05-12 03:18:34] [INFO ] Added : 362 causal constraints over 73 iterations in 3651 ms. Result :sat
[2020-05-12 03:18:35] [INFO ] Deduced a trap composed of 141 places in 1190 ms
[2020-05-12 03:18:35] [INFO ] Deduced a trap composed of 136 places in 344 ms
[2020-05-12 03:18:36] [INFO ] Deduced a trap composed of 135 places in 540 ms
[2020-05-12 03:18:36] [INFO ] Deduced a trap composed of 143 places in 260 ms
[2020-05-12 03:18:37] [INFO ] Deduced a trap composed of 131 places in 244 ms
[2020-05-12 03:18:37] [INFO ] Deduced a trap composed of 124 places in 536 ms
[2020-05-12 03:18:38] [INFO ] Deduced a trap composed of 131 places in 713 ms
[2020-05-12 03:18:38] [INFO ] Deduced a trap composed of 132 places in 295 ms
[2020-05-12 03:18:39] [INFO ] Deduced a trap composed of 141 places in 291 ms
[2020-05-12 03:18:39] [INFO ] Deduced a trap composed of 151 places in 289 ms
[2020-05-12 03:18:40] [INFO ] Deduced a trap composed of 134 places in 294 ms
[2020-05-12 03:18:40] [INFO ] Deduced a trap composed of 152 places in 296 ms
[2020-05-12 03:18:40] [INFO ] Deduced a trap composed of 147 places in 288 ms
[2020-05-12 03:18:41] [INFO ] Deduced a trap composed of 128 places in 289 ms
[2020-05-12 03:18:41] [INFO ] Deduced a trap composed of 136 places in 151 ms
[2020-05-12 03:18:41] [INFO ] Deduced a trap composed of 135 places in 144 ms
[2020-05-12 03:18:41] [INFO ] Deduced a trap composed of 130 places in 144 ms
[2020-05-12 03:18:42] [INFO ] Deduced a trap composed of 131 places in 144 ms
[2020-05-12 03:18:42] [INFO ] Deduced a trap composed of 122 places in 158 ms
[2020-05-12 03:18:42] [INFO ] Deduced a trap composed of 127 places in 157 ms
[2020-05-12 03:18:42] [INFO ] Deduced a trap composed of 131 places in 132 ms
[2020-05-12 03:18:42] [INFO ] Deduced a trap composed of 124 places in 117 ms
[2020-05-12 03:18:43] [INFO ] Deduced a trap composed of 137 places in 114 ms
[2020-05-12 03:18:43] [INFO ] Deduced a trap composed of 129 places in 141 ms
[2020-05-12 03:18:43] [INFO ] Deduced a trap composed of 134 places in 142 ms
[2020-05-12 03:18:43] [INFO ] Deduced a trap composed of 129 places in 139 ms
[2020-05-12 03:18:44] [INFO ] Deduced a trap composed of 133 places in 140 ms
[2020-05-12 03:18:44] [INFO ] Deduced a trap composed of 138 places in 141 ms
[2020-05-12 03:18:44] [INFO ] Deduced a trap composed of 131 places in 230 ms
[2020-05-12 03:18:44] [INFO ] Deduced a trap composed of 120 places in 155 ms
[2020-05-12 03:18:45] [INFO ] Deduced a trap composed of 131 places in 174 ms
[2020-05-12 03:18:45] [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 s27 s28 s31 s71 s80 s86 s96 s126 s127 s128 s134 s135 s145 s151 s152 s171 s172 s173 s176 s177 s185 s197 s198 s199 s209 s210 s211 s228 s229 s230 s236 s239 s270 s275 s283 s285 s288 s290 s294 s299 s304 s329 s339 s369 s374 s384 s389 s394 s404 s413 s414 s415 s416 s417 s418 s419 s420 s421 s422 s423 s424 s425 s426 s427 s432 s433 s434 s439 s440 s443 s444 s445 s446 s447 s448 s451 s452 s456 s458 s460 s466 s470 s471 s472 s473 s474 s475 s476 s477 s480 s481 s482 s483 s488 s489 s490 s491 s494 s495 s498 s499 s500 s501 s502 s503 s504 s505 s508 s513 s514 s521 s522 s523 s524 s529 s530 s533 s534 s535 s536 s541 s542 s543 s554 s563 s566 s580 s581) 0)") while checking expression at index 8
[2020-05-12 03:18:45] [INFO ] [Real]Absence check using 55 positive place invariants in 51 ms returned sat
[2020-05-12 03:18:45] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 36 ms returned sat
[2020-05-12 03:18:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:18:46] [INFO ] [Real]Absence check using state equation in 1532 ms returned sat
[2020-05-12 03:18:46] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:18:47] [INFO ] [Nat]Absence check using 55 positive place invariants in 248 ms returned sat
[2020-05-12 03:18:47] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 34 ms returned sat
[2020-05-12 03:18:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:18:48] [INFO ] [Nat]Absence check using state equation in 1012 ms returned sat
[2020-05-12 03:18:48] [INFO ] Deduced a trap composed of 13 places in 347 ms
[2020-05-12 03:18:48] [INFO ] Deduced a trap composed of 11 places in 165 ms
[2020-05-12 03:18:49] [INFO ] Deduced a trap composed of 8 places in 824 ms
[2020-05-12 03:18:49] [INFO ] Deduced a trap composed of 21 places in 199 ms
[2020-05-12 03:18:50] [INFO ] Deduced a trap composed of 104 places in 137 ms
[2020-05-12 03:18:50] [INFO ] Deduced a trap composed of 117 places in 137 ms
[2020-05-12 03:18:50] [INFO ] Deduced a trap composed of 104 places in 313 ms
[2020-05-12 03:18:50] [INFO ] Deduced a trap composed of 115 places in 238 ms
[2020-05-12 03:18:51] [INFO ] Deduced a trap composed of 19 places in 140 ms
[2020-05-12 03:18:51] [INFO ] Deduced a trap composed of 21 places in 124 ms
[2020-05-12 03:18:51] [INFO ] Deduced a trap composed of 106 places in 190 ms
[2020-05-12 03:18:51] [INFO ] Deduced a trap composed of 24 places in 522 ms
[2020-05-12 03:18:52] [INFO ] Deduced a trap composed of 12 places in 263 ms
[2020-05-12 03:18:52] [INFO ] Deduced a trap composed of 121 places in 174 ms
[2020-05-12 03:18:52] [INFO ] Deduced a trap composed of 15 places in 137 ms
[2020-05-12 03:18:52] [INFO ] Deduced a trap composed of 28 places in 120 ms
[2020-05-12 03:18:52] [INFO ] Deduced a trap composed of 26 places in 117 ms
[2020-05-12 03:18:52] [INFO ] Deduced a trap composed of 31 places in 123 ms
[2020-05-12 03:18:53] [INFO ] Deduced a trap composed of 24 places in 129 ms
[2020-05-12 03:18:54] [INFO ] Deduced a trap composed of 29 places in 1330 ms
[2020-05-12 03:18:55] [INFO ] Deduced a trap composed of 26 places in 946 ms
[2020-05-12 03:18:55] [INFO ] Deduced a trap composed of 17 places in 223 ms
[2020-05-12 03:18:55] [INFO ] Deduced a trap composed of 123 places in 148 ms
[2020-05-12 03:18:56] [INFO ] Deduced a trap composed of 29 places in 130 ms
[2020-05-12 03:18:56] [INFO ] Deduced a trap composed of 26 places in 130 ms
[2020-05-12 03:18:56] [INFO ] Deduced a trap composed of 28 places in 145 ms
[2020-05-12 03:18:56] [INFO ] Deduced a trap composed of 20 places in 210 ms
[2020-05-12 03:18:56] [INFO ] Deduced a trap composed of 20 places in 198 ms
[2020-05-12 03:18:56] [INFO ] Deduced a trap composed of 112 places in 145 ms
[2020-05-12 03:18:57] [INFO ] Deduced a trap composed of 37 places in 221 ms
[2020-05-12 03:18:57] [INFO ] Deduced a trap composed of 39 places in 241 ms
[2020-05-12 03:18:57] [INFO ] Deduced a trap composed of 37 places in 195 ms
[2020-05-12 03:18:57] [INFO ] Deduced a trap composed of 38 places in 116 ms
[2020-05-12 03:18:58] [INFO ] Deduced a trap composed of 106 places in 279 ms
[2020-05-12 03:18:58] [INFO ] Deduced a trap composed of 57 places in 132 ms
[2020-05-12 03:18:58] [INFO ] Deduced a trap composed of 41 places in 114 ms
[2020-05-12 03:18:58] [INFO ] Deduced a trap composed of 110 places in 126 ms
[2020-05-12 03:18:58] [INFO ] Deduced a trap composed of 109 places in 238 ms
[2020-05-12 03:18:59] [INFO ] Deduced a trap composed of 123 places in 865 ms
[2020-05-12 03:18:59] [INFO ] Deduced a trap composed of 110 places in 129 ms
[2020-05-12 03:19:00] [INFO ] Deduced a trap composed of 113 places in 132 ms
[2020-05-12 03:19:00] [INFO ] Deduced a trap composed of 106 places in 128 ms
[2020-05-12 03:19:00] [INFO ] Deduced a trap composed of 107 places in 149 ms
[2020-05-12 03:19:00] [INFO ] Deduced a trap composed of 64 places in 67 ms
[2020-05-12 03:19:00] [INFO ] Deduced a trap composed of 62 places in 86 ms
[2020-05-12 03:19:00] [INFO ] Trap strengthening (SAT) tested/added 46/45 trap constraints in 12395 ms
[2020-05-12 03:19:00] [INFO ] Computed and/alt/rep : 520/2220/520 causal constraints in 19 ms.
[2020-05-12 03:19:03] [INFO ] Added : 344 causal constraints over 69 iterations in 3190 ms. Result :sat
[2020-05-12 03:19:04] [INFO ] Deduced a trap composed of 131 places in 432 ms
[2020-05-12 03:19:04] [INFO ] Deduced a trap composed of 142 places in 143 ms
[2020-05-12 03:19:05] [INFO ] Deduced a trap composed of 125 places in 631 ms
[2020-05-12 03:19:05] [INFO ] Deduced a trap composed of 129 places in 128 ms
[2020-05-12 03:19:05] [INFO ] Deduced a trap composed of 130 places in 406 ms
[2020-05-12 03:19:06] [INFO ] Deduced a trap composed of 123 places in 268 ms
[2020-05-12 03:19:06] [INFO ] Deduced a trap composed of 126 places in 267 ms
[2020-05-12 03:19:06] [INFO ] Deduced a trap composed of 139 places in 142 ms
[2020-05-12 03:19:07] [INFO ] Deduced a trap composed of 133 places in 414 ms
[2020-05-12 03:19:07] [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 s31 s32 s71 s73 s83 s87 s88 s89 s93 s102 s120 s121 s122 s159 s160 s161 s215 s216 s217 s223 s224 s236 s239 s270 s275 s283 s285 s298 s300 s304 s309 s314 s319 s324 s329 s339 s344 s349 s369 s379 s384 s394 s404 s413 s414 s415 s416 s417 s418 s419 s420 s421 s422 s423 s424 s425 s426 s427 s428 s429 s432 s439 s440 s441 s442 s443 s444 s449 s450 s451 s452 s453 s455 s458 s459 s460 s463 s464 s465 s469 s478 s479 s484 s485 s488 s489 s490 s491 s492 s493 s494 s495 s502 s503 s506 s507 s508 s509 s510 s513 s514 s517 s518 s519 s520 s521 s522 s525 s526 s527 s528 s533 s534 s539 s540 s541 s542 s543 s549 s550 s558 s559 s563 s566 s567 s568 s572 s573 s574 s575) 0)") while checking expression at index 9
[2020-05-12 03:19:07] [INFO ] [Real]Absence check using 55 positive place invariants in 45 ms returned sat
[2020-05-12 03:19:07] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 19 ms returned sat
[2020-05-12 03:19:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:19:08] [INFO ] [Real]Absence check using state equation in 672 ms returned sat
[2020-05-12 03:19:08] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:19:08] [INFO ] [Nat]Absence check using 55 positive place invariants in 39 ms returned sat
[2020-05-12 03:19:08] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 19 ms returned sat
[2020-05-12 03:19:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:19:09] [INFO ] [Nat]Absence check using state equation in 699 ms returned sat
[2020-05-12 03:19:09] [INFO ] Deduced a trap composed of 11 places in 177 ms
[2020-05-12 03:19:09] [INFO ] Deduced a trap composed of 13 places in 142 ms
[2020-05-12 03:19:09] [INFO ] Deduced a trap composed of 16 places in 192 ms
[2020-05-12 03:19:09] [INFO ] Deduced a trap composed of 32 places in 140 ms
[2020-05-12 03:19:10] [INFO ] Deduced a trap composed of 22 places in 676 ms
[2020-05-12 03:19:10] [INFO ] Deduced a trap composed of 130 places in 220 ms
[2020-05-12 03:19:11] [INFO ] Deduced a trap composed of 14 places in 608 ms
[2020-05-12 03:19:11] [INFO ] Deduced a trap composed of 129 places in 139 ms
[2020-05-12 03:19:11] [INFO ] Deduced a trap composed of 11 places in 135 ms
[2020-05-12 03:19:11] [INFO ] Deduced a trap composed of 20 places in 147 ms
[2020-05-12 03:19:12] [INFO ] Deduced a trap composed of 30 places in 165 ms
[2020-05-12 03:19:12] [INFO ] Deduced a trap composed of 15 places in 136 ms
[2020-05-12 03:19:12] [INFO ] Deduced a trap composed of 136 places in 156 ms
[2020-05-12 03:19:12] [INFO ] Deduced a trap composed of 21 places in 304 ms
[2020-05-12 03:19:13] [INFO ] Deduced a trap composed of 107 places in 995 ms
[2020-05-12 03:19:13] [INFO ] Deduced a trap composed of 19 places in 131 ms
[2020-05-12 03:19:14] [INFO ] Deduced a trap composed of 17 places in 171 ms
[2020-05-12 03:19:14] [INFO ] Deduced a trap composed of 20 places in 140 ms
[2020-05-12 03:19:14] [INFO ] Deduced a trap composed of 26 places in 126 ms
[2020-05-12 03:19:15] [INFO ] Deduced a trap composed of 35 places in 661 ms
[2020-05-12 03:19:15] [INFO ] Deduced a trap composed of 33 places in 701 ms
[2020-05-12 03:19:16] [INFO ] Deduced a trap composed of 132 places in 293 ms
[2020-05-12 03:19:16] [INFO ] Deduced a trap composed of 21 places in 191 ms
[2020-05-12 03:19:16] [INFO ] Deduced a trap composed of 21 places in 225 ms
[2020-05-12 03:19:16] [INFO ] Deduced a trap composed of 26 places in 260 ms
[2020-05-12 03:19:17] [INFO ] Deduced a trap composed of 145 places in 308 ms
[2020-05-12 03:19:17] [INFO ] Deduced a trap composed of 127 places in 288 ms
[2020-05-12 03:19:19] [INFO ] Deduced a trap composed of 131 places in 2317 ms
[2020-05-12 03:19:20] [INFO ] Deduced a trap composed of 30 places in 506 ms
[2020-05-12 03:19:20] [INFO ] Deduced a trap composed of 37 places in 317 ms
[2020-05-12 03:19:21] [INFO ] Deduced a trap composed of 143 places in 287 ms
[2020-05-12 03:19:21] [INFO ] Deduced a trap composed of 28 places in 140 ms
[2020-05-12 03:19:21] [INFO ] Deduced a trap composed of 126 places in 502 ms
[2020-05-12 03:19:22] [INFO ] Deduced a trap composed of 129 places in 560 ms
[2020-05-12 03:19:22] [INFO ] Deduced a trap composed of 125 places in 577 ms
[2020-05-12 03:19:23] [INFO ] Deduced a trap composed of 127 places in 130 ms
[2020-05-12 03:19:23] [INFO ] Deduced a trap composed of 139 places in 123 ms
[2020-05-12 03:19:23] [INFO ] Deduced a trap composed of 137 places in 130 ms
[2020-05-12 03:19:23] [INFO ] Deduced a trap composed of 132 places in 132 ms
[2020-05-12 03:19:23] [INFO ] Deduced a trap composed of 133 places in 127 ms
[2020-05-12 03:19:23] [INFO ] Deduced a trap composed of 146 places in 134 ms
[2020-05-12 03:19:23] [INFO ] Deduced a trap composed of 26 places in 126 ms
[2020-05-12 03:19:24] [INFO ] Deduced a trap composed of 141 places in 133 ms
[2020-05-12 03:19:24] [INFO ] Deduced a trap composed of 137 places in 128 ms
[2020-05-12 03:19:24] [INFO ] Deduced a trap composed of 134 places in 140 ms
[2020-05-12 03:19:24] [INFO ] Deduced a trap composed of 133 places in 126 ms
[2020-05-12 03:19:24] [INFO ] Deduced a trap composed of 133 places in 125 ms
[2020-05-12 03:19:24] [INFO ] Deduced a trap composed of 143 places in 133 ms
[2020-05-12 03:19:25] [INFO ] Deduced a trap composed of 136 places in 126 ms
[2020-05-12 03:19:25] [INFO ] Deduced a trap composed of 142 places in 125 ms
[2020-05-12 03:19:25] [INFO ] Deduced a trap composed of 143 places in 122 ms
[2020-05-12 03:19:25] [INFO ] Deduced a trap composed of 129 places in 130 ms
[2020-05-12 03:19:25] [INFO ] Deduced a trap composed of 128 places in 135 ms
[2020-05-12 03:19:26] [INFO ] Deduced a trap composed of 132 places in 269 ms
[2020-05-12 03:19:26] [INFO ] Deduced a trap composed of 138 places in 560 ms
[2020-05-12 03:19:26] [INFO ] Deduced a trap composed of 143 places in 127 ms
[2020-05-12 03:19:27] [INFO ] Deduced a trap composed of 131 places in 669 ms
[2020-05-12 03:19:27] [INFO ] Deduced a trap composed of 30 places in 138 ms
[2020-05-12 03:19:27] [INFO ] Deduced a trap composed of 135 places in 131 ms
[2020-05-12 03:19:27] [INFO ] Deduced a trap composed of 38 places in 187 ms
[2020-05-12 03:19:28] [INFO ] Deduced a trap composed of 137 places in 128 ms
[2020-05-12 03:19:28] [INFO ] Deduced a trap composed of 50 places in 150 ms
[2020-05-12 03:19:28] [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 s145 s154 s155 s203 s204 s205 s240 s270 s333 s334 s335 s349 s359 s369 s374 s378 s379 s380 s384 s389 s394 s399 s404 s407 s409 s410 s411 s432 s433 s434 s502 s503 s509 s510 s513 s514 s517 s518 s525 s526 s529 s530 s535 s536 s539 s540 s572 s576) 0)") while checking expression at index 10
[2020-05-12 03:19:28] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-05-12 03:19:28] [INFO ] Flatten gal took : 146 ms
[2020-05-12 03:19:28] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-05-12 03:19:28] [INFO ] Flatten gal took : 27 ms
FORMULA BusinessProcesses-PT-12-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-12 03:19:28] [INFO ] Applying decomposition
[2020-05-12 03:19:28] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph11102034918213141710.txt, -o, /tmp/graph11102034918213141710.bin, -w, /tmp/graph11102034918213141710.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/graph11102034918213141710.bin, -l, -1, -v, -w, /tmp/graph11102034918213141710.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-12 03:19:29] [INFO ] Decomposing Gal with order
[2020-05-12 03:19:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-12 03:19:29] [INFO ] Removed a total of 265 redundant transitions.
[2020-05-12 03:19:29] [INFO ] Flatten gal took : 139 ms
[2020-05-12 03:19:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 3 labels/synchronizations in 21 ms.
[2020-05-12 03:19:29] [INFO ] Time to serialize gal into /home/mcc/execution/CTLCardinality.pnml.gal : 21 ms
[2020-05-12 03:19:29] [INFO ] Time to serialize properties into /home/mcc/execution/CTLCardinality.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLCardinality.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLCardinality.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLCardinality.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLCardinality.ctl
No direction supplied, using forward translation only.
Parsed 9 CTL formulae.
built 54 ordering constraints for composite.
built 4 ordering constraints for composite.
built 35 ordering constraints for composite.
built 13 ordering constraints for composite.
built 26 ordering constraints for composite.
built 16 ordering constraints for composite.
built 22 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 17 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 20 ordering constraints for composite.
built 17 ordering constraints for composite.
built 73 ordering constraints for composite.
built 93 ordering constraints for composite.
built 33 ordering constraints for composite.
built 25 ordering constraints for composite.
built 25 ordering constraints for composite.
built 28 ordering constraints for composite.
built 22 ordering constraints for composite.
built 31 ordering constraints for composite.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.14329e+23,3.45572,126728,13437,70,188413,838,1127,743711,67,2031,0


Converting to forward existential form...Done !
original formula: ((AG(((i10.u33.p86==0)||(i12.u54.p143==1))) + !(EX(((i14.u196.p501==0)||(i11.u25.p64==1))))) + !(EF(((i14.u209.p527==0)||(i9.u119.p314==1)))))
=> equivalent forward existential formula: [(FwdU((Init * !((!(E(TRUE U !(((i10.u33.p86==0)||(i12.u54.p143==1))))) + !(EX(((i14.u196.p501==0)||(i11.u25.p64==1))))))),TRUE) * ((i14.u209.p527==0)||(i9.u119.p314==1)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t80, t264, t270, t282, i0.t260, i0.t143, i0.t139, i0.u79.t273, i0.u84.t263, i0.u87.t256, i0.u156.t144, i0.u159.t140, i1.t396, i1.t388, i1.t239, i1.u10.t394, i1.u12.t391, i1.u23.t369, i1.u11.t392, i1.u108.t240, i2.t387, i2.t383, i2.t381, i2.t379, i2.t377, i2.t374, i2.t372, i3.t171, i3.u65.t297, i3.u71.t289, i3.u142.t172, i4.i0.i0.u73.t285, i4.i0.i1.t159, i4.i0.i1.u148.t160, i4.i1.i1.t167, i4.i1.i1.u145.t168, i4.i1.i2.t163, i4.i1.i2.u147.t164, i4.i1.i3.t155, i4.i1.i3.u150.t156, i4.i1.i4.t151, i4.i1.i4.u152.t152, i5.t274, i5.t250, i5.u75.t281, i5.u77.t277, i5.u103.t251, i6.t195, i6.t191, i6.t187, i6.t183, i6.t179, i6.u130.t196, i6.u133.t192, i6.u134.t188, i6.u136.t184, i6.u138.t180, i7.t325, i7.t215, i7.t211, i7.t207, i7.t203, i7.u49.t327, i7.u120.t216, i7.u123.t212, i7.u124.t208, i7.u127.t204, i8.t115, i8.u165.t119, i9.t235, i9.t231, i9.t219, i9.u111.t236, i9.u112.t232, i9.u119.t220, i10.t343, i10.t341, i10.t339, i10.t247, i10.t227, i10.t223, i10.u106.t248, i10.u115.t228, i10.u27.t347, i10.u27.t351, i10.u27.t355, i10.u27.t361, i10.u117.t224, i11.u25.t365, i11.u45.t335, i11.u47.t331, i12.t199, i12.u52.t321, i12.u54.t317, i12.u59.t309, i12.u129.t200, i13.t267, i13.t147, i13.u81.t269, i13.u155.t148, i14.t133, i14.t126, i14.t121, i14.t117, i14.t113, i14.t110, i14.t108, i14.t106, i14.t104, i14.t101, i14.t73, i14.t70, i14.t67, i14.t65, i14.t62, i14.t59, i14.t57, i14.t55, i14.t53, i14.t50, i14.t47, i14.t37, i14.t34, i14.t31, i14.t28, i14.t25, i14.t22, i14.t20, i14.t17, i14.t14, i14.u219.t12, i14.u219.t44, i14.u219.t84, i14.u219.t88, i14.u219.t92, i14.u219.t98, i15.t175, i15.u61.t305, i15.u63.t301, i15.u140.t176, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/343/140/519
(forward)formula 0,0,37.5548,1231212,1,0,1.58659e+06,1007,9563,8.8258e+06,364,3503,3219695
FORMULA BusinessProcesses-PT-12-CTLCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF(!(EX(((i0.u80.p216==0)||(i7.u124.p329==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(((i0.u80.p216==0)||(i7.u124.p329==1)))))] != FALSE
(forward)formula 1,1,38.9912,1258404,1,0,1.61172e+06,1007,9568,8.95141e+06,364,3503,3235091
FORMULA BusinessProcesses-PT-12-CTLCardinality-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG(A((i12.u197.p502==1) U ((i11.u187.p482==0)||(i10.u37.p94==1))))
=> equivalent forward existential formula: ([(FwdU(FwdU(Init,TRUE),!(((i11.u187.p482==0)||(i10.u37.p94==1)))) * (!((i12.u197.p502==1)) * !(((i11.u187.p482==0)||(i10.u37.p94==1)))))] = FALSE * [FwdG(FwdU(Init,TRUE),!(((i11.u187.p482==0)||(i10.u37.p94==1))))] = FALSE)
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 2,0,41.4085,1291668,1,0,1.6845e+06,1008,10114,9.12338e+06,396,3514,3310064
FORMULA BusinessProcesses-PT-12-CTLCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (!(AG((((i0.u156.p409==1)||(i8.u167.p437==0))||(i1.u10.p30==1)))) * AG(((i10.u38.p97==0)||(i13.u81.p218==1))))
=> equivalent forward existential formula: ([(Init * !(E(TRUE U !((((i0.u156.p409==1)||(i8.u167.p437==0))||(i1.u10.p30==1))))))] = FALSE * [(FwdU(Init,TRUE) * !(((i10.u38.p97==0)||(i13.u81.p218==1))))] = FALSE)
(forward)formula 3,0,41.5107,1296156,1,0,1.69038e+06,1008,10120,9.1602e+06,396,3514,3316852
FORMULA BusinessProcesses-PT-12-CTLCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF(!(AG(((i6.u130.p343==0)||(i6.u138.p363==1)))))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,TRUE),TRUE) * !(((i6.u130.p343==0)||(i6.u138.p363==1))))] != FALSE
(forward)formula 4,1,41.515,1296420,1,0,1.69054e+06,1008,10128,9.16053e+06,396,3514,3317571
FORMULA BusinessProcesses-PT-12-CTLCardinality-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG((((i3.u67.p178==0)||(i14.u205.p519==1))&&((i6.u131.p341==0)||(i3.u65.p174==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !((((i3.u67.p178==0)||(i14.u205.p519==1))&&((i6.u131.p341==0)||(i3.u65.p174==1)))))] = FALSE
(forward)formula 5,0,41.5257,1296684,1,0,1.69115e+06,1008,10141,9.16215e+06,396,3514,3320219
FORMULA BusinessProcesses-PT-12-CTLCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: !(AG(((i15.u61.p163==0)||(i0.u158.p415==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(((i15.u61.p163==0)||(i0.u158.p415==1))))] != FALSE
(forward)formula 6,1,41.5442,1297476,1,0,1.69133e+06,1008,10147,9.16376e+06,396,3514,3325138
FORMULA BusinessProcesses-PT-12-CTLCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG(EX(((i14.u195.p498==0)||(i15.u61.p162==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(((i14.u195.p498==0)||(i15.u61.p162==1)))))] = FALSE
(forward)formula 7,0,41.5888,1298532,1,0,1.69362e+06,1008,10151,9.17195e+06,396,3514,3332408
FORMULA BusinessProcesses-PT-12-CTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF((AG((i4.i1.i3.u150.p392==1)) + (i13.u81.p219==1)))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U !((i4.i1.i3.u150.p392==1)))))] != FALSE + [(FwdU(Init,TRUE) * (i13.u81.p219==1))] != FALSE)
(forward)formula 8,1,45.9551,1402216,1,0,1.80262e+06,1022,10159,9.77273e+06,396,3563,3613937
FORMULA BusinessProcesses-PT-12-CTLCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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


BK_STOP 1589253615991

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-12"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-12, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r021-oct2-158897699200539"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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