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-158897699200564.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-15, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897699200564
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 320K
-rw-r--r-- 1 mcc users 3.2K Mar 26 02:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 26 02:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 25 22:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 12K 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.1K Apr 8 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 25 17:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13K Mar 25 17:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K 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 157K 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-15-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1589255569406

[2020-05-12 03:52:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -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:52:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 03:52:52] [INFO ] Load time of PNML (sax parser for PT used): 116 ms
[2020-05-12 03:52:52] [INFO ] Transformed 630 places.
[2020-05-12 03:52:52] [INFO ] Transformed 566 transitions.
[2020-05-12 03:52:52] [INFO ] Found NUPN structural information;
[2020-05-12 03:52:52] [INFO ] Parsed PT model containing 630 places and 566 transitions in 185 ms.
Deduced a syphon composed of 4 places in 7 ms
Reduce places removed 4 places and 4 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 92 ms.
Incomplete random walk after 100000 steps, including 677 resets, run finished after 290 ms. (steps per millisecond=344 ) properties seen :[1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1]
// Phase 1: matrix 562 rows 626 cols
[2020-05-12 03:52:52] [INFO ] Computed 102 place invariants in 27 ms
[2020-05-12 03:52:52] [INFO ] [Real]Absence check using 61 positive place invariants in 46 ms returned sat
[2020-05-12 03:52:52] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 31 ms returned sat
[2020-05-12 03:52:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:52:53] [INFO ] [Real]Absence check using state equation in 875 ms returned sat
[2020-05-12 03:52:54] [INFO ] Deduced a trap composed of 15 places in 430 ms
[2020-05-12 03:52:54] [INFO ] Deduced a trap composed of 11 places in 298 ms
[2020-05-12 03:52:54] [INFO ] Deduced a trap composed of 142 places in 233 ms
[2020-05-12 03:52:55] [INFO ] Deduced a trap composed of 21 places in 518 ms
[2020-05-12 03:52:55] [INFO ] Deduced a trap composed of 24 places in 484 ms
[2020-05-12 03:52:56] [INFO ] Deduced a trap composed of 18 places in 815 ms
[2020-05-12 03:52:57] [INFO ] Deduced a trap composed of 21 places in 472 ms
[2020-05-12 03:52:57] [INFO ] Deduced a trap composed of 117 places in 527 ms
[2020-05-12 03:52:59] [INFO ] Deduced a trap composed of 17 places in 1569 ms
[2020-05-12 03:52:59] [INFO ] Deduced a trap composed of 23 places in 324 ms
[2020-05-12 03:53:00] [INFO ] Deduced a trap composed of 20 places in 293 ms
[2020-05-12 03:53:00] [INFO ] Deduced a trap composed of 20 places in 368 ms
[2020-05-12 03:53:01] [INFO ] Deduced a trap composed of 32 places in 375 ms
[2020-05-12 03:53:01] [INFO ] Deduced a trap composed of 141 places in 397 ms
[2020-05-12 03:53:01] [INFO ] Deduced a trap composed of 22 places in 375 ms
[2020-05-12 03:53:02] [INFO ] Deduced a trap composed of 23 places in 338 ms
[2020-05-12 03:53:02] [INFO ] Deduced a trap composed of 19 places in 230 ms
[2020-05-12 03:53:02] [INFO ] Deduced a trap composed of 23 places in 275 ms
[2020-05-12 03:53:02] [INFO ] Deduced a trap composed of 25 places in 183 ms
[2020-05-12 03:53:03] [INFO ] Deduced a trap composed of 22 places in 338 ms
[2020-05-12 03:53:03] [INFO ] Deduced a trap composed of 26 places in 547 ms
[2020-05-12 03:53:04] [INFO ] Deduced a trap composed of 26 places in 359 ms
[2020-05-12 03:53:04] [INFO ] Deduced a trap composed of 25 places in 349 ms
[2020-05-12 03:53:04] [INFO ] Deduced a trap composed of 120 places in 175 ms
[2020-05-12 03:53:05] [INFO ] Deduced a trap composed of 26 places in 194 ms
[2020-05-12 03:53:05] [INFO ] Deduced a trap composed of 42 places in 138 ms
[2020-05-12 03:53:05] [INFO ] Deduced a trap composed of 50 places in 192 ms
[2020-05-12 03:53:05] [INFO ] Deduced a trap composed of 31 places in 317 ms
[2020-05-12 03:53:06] [INFO ] Deduced a trap composed of 27 places in 206 ms
[2020-05-12 03:53:06] [INFO ] Deduced a trap composed of 137 places in 174 ms
[2020-05-12 03:53:06] [INFO ] Deduced a trap composed of 134 places in 135 ms
[2020-05-12 03:53:06] [INFO ] Deduced a trap composed of 34 places in 191 ms
[2020-05-12 03:53:06] [INFO ] Deduced a trap composed of 25 places in 163 ms
[2020-05-12 03:53:07] [INFO ] Deduced a trap composed of 25 places in 156 ms
[2020-05-12 03:53:07] [INFO ] Deduced a trap composed of 46 places in 161 ms
[2020-05-12 03:53:07] [INFO ] Deduced a trap composed of 29 places in 192 ms
[2020-05-12 03:53:07] [INFO ] Deduced a trap composed of 33 places in 273 ms
[2020-05-12 03:53:08] [INFO ] Deduced a trap composed of 32 places in 141 ms
[2020-05-12 03:53:08] [INFO ] Deduced a trap composed of 30 places in 300 ms
[2020-05-12 03:53:08] [INFO ] Deduced a trap composed of 141 places in 220 ms
[2020-05-12 03:53:09] [INFO ] Deduced a trap composed of 152 places in 517 ms
[2020-05-12 03:53:09] [INFO ] Deduced a trap composed of 43 places in 371 ms
[2020-05-12 03:53:09] [INFO ] Deduced a trap composed of 32 places in 317 ms
[2020-05-12 03:53:10] [INFO ] Deduced a trap composed of 143 places in 314 ms
[2020-05-12 03:53:10] [INFO ] Deduced a trap composed of 161 places in 501 ms
[2020-05-12 03:53:11] [INFO ] Deduced a trap composed of 24 places in 494 ms
[2020-05-12 03:53:11] [INFO ] Deduced a trap composed of 28 places in 457 ms
[2020-05-12 03:53:12] [INFO ] Deduced a trap composed of 152 places in 544 ms
[2020-05-12 03:53:13] [INFO ] Deduced a trap composed of 45 places in 611 ms
[2020-05-12 03:53:13] [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 s29 s30 s31 s32 s33 s34 s35 s54 s55 s206 s207 s208 s212 s213 s214 s218 s219 s220 s224 s225 s226 s251 s254 s303 s318 s407 s412 s417 s422 s427 s432 s437 s442 s478 s479 s482 s577 s578 s583 s584 s587 s588) 0)") while checking expression at index 0
[2020-05-12 03:53:13] [INFO ] [Real]Absence check using 61 positive place invariants in 158 ms returned sat
[2020-05-12 03:53:13] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 46 ms returned sat
[2020-05-12 03:53:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:53:14] [INFO ] [Real]Absence check using state equation in 906 ms returned sat
[2020-05-12 03:53:14] [INFO ] Deduced a trap composed of 13 places in 485 ms
[2020-05-12 03:53:15] [INFO ] Deduced a trap composed of 18 places in 410 ms
[2020-05-12 03:53:15] [INFO ] Deduced a trap composed of 144 places in 265 ms
[2020-05-12 03:53:15] [INFO ] Deduced a trap composed of 19 places in 250 ms
[2020-05-12 03:53:16] [INFO ] Deduced a trap composed of 11 places in 241 ms
[2020-05-12 03:53:16] [INFO ] Deduced a trap composed of 8 places in 187 ms
[2020-05-12 03:53:16] [INFO ] Deduced a trap composed of 24 places in 565 ms
[2020-05-12 03:53:17] [INFO ] Deduced a trap composed of 32 places in 217 ms
[2020-05-12 03:53:17] [INFO ] Deduced a trap composed of 26 places in 204 ms
[2020-05-12 03:53:17] [INFO ] Deduced a trap composed of 31 places in 144 ms
[2020-05-12 03:53:17] [INFO ] Deduced a trap composed of 159 places in 147 ms
[2020-05-12 03:53:17] [INFO ] Deduced a trap composed of 26 places in 148 ms
[2020-05-12 03:53:18] [INFO ] Deduced a trap composed of 39 places in 140 ms
[2020-05-12 03:53:18] [INFO ] Deduced a trap composed of 36 places in 170 ms
[2020-05-12 03:53:18] [INFO ] Deduced a trap composed of 142 places in 156 ms
[2020-05-12 03:53:18] [INFO ] Deduced a trap composed of 23 places in 156 ms
[2020-05-12 03:53:18] [INFO ] Deduced a trap composed of 27 places in 144 ms
[2020-05-12 03:53:19] [INFO ] Deduced a trap composed of 150 places in 163 ms
[2020-05-12 03:53:19] [INFO ] Deduced a trap composed of 148 places in 185 ms
[2020-05-12 03:53:19] [INFO ] Deduced a trap composed of 21 places in 167 ms
[2020-05-12 03:53:19] [INFO ] Deduced a trap composed of 22 places in 170 ms
[2020-05-12 03:53:19] [INFO ] Deduced a trap composed of 121 places in 178 ms
[2020-05-12 03:53:20] [INFO ] Deduced a trap composed of 31 places in 189 ms
[2020-05-12 03:53:20] [INFO ] Deduced a trap composed of 39 places in 100 ms
[2020-05-12 03:53:20] [INFO ] Deduced a trap composed of 38 places in 53 ms
[2020-05-12 03:53:20] [INFO ] Deduced a trap composed of 45 places in 48 ms
[2020-05-12 03:53:20] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 6109 ms
[2020-05-12 03:53:20] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:53:20] [INFO ] [Nat]Absence check using 61 positive place invariants in 66 ms returned sat
[2020-05-12 03:53:20] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 23 ms returned sat
[2020-05-12 03:53:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:53:21] [INFO ] [Nat]Absence check using state equation in 817 ms returned sat
[2020-05-12 03:53:21] [INFO ] Deduced a trap composed of 14 places in 276 ms
[2020-05-12 03:53:22] [INFO ] Deduced a trap composed of 22 places in 474 ms
[2020-05-12 03:53:22] [INFO ] Deduced a trap composed of 13 places in 218 ms
[2020-05-12 03:53:22] [INFO ] Deduced a trap composed of 18 places in 243 ms
[2020-05-12 03:53:22] [INFO ] Deduced a trap composed of 8 places in 212 ms
[2020-05-12 03:53:23] [INFO ] Deduced a trap composed of 12 places in 249 ms
[2020-05-12 03:53:23] [INFO ] Deduced a trap composed of 22 places in 263 ms
[2020-05-12 03:53:23] [INFO ] Deduced a trap composed of 21 places in 199 ms
[2020-05-12 03:53:23] [INFO ] Deduced a trap composed of 36 places in 190 ms
[2020-05-12 03:53:24] [INFO ] Deduced a trap composed of 18 places in 175 ms
[2020-05-12 03:53:24] [INFO ] Deduced a trap composed of 25 places in 196 ms
[2020-05-12 03:53:24] [INFO ] Deduced a trap composed of 23 places in 196 ms
[2020-05-12 03:53:24] [INFO ] Deduced a trap composed of 17 places in 207 ms
[2020-05-12 03:53:25] [INFO ] Deduced a trap composed of 134 places in 170 ms
[2020-05-12 03:53:25] [INFO ] Deduced a trap composed of 32 places in 170 ms
[2020-05-12 03:53:25] [INFO ] Deduced a trap composed of 19 places in 177 ms
[2020-05-12 03:53:25] [INFO ] Deduced a trap composed of 36 places in 212 ms
[2020-05-12 03:53:25] [INFO ] Deduced a trap composed of 40 places in 79 ms
[2020-05-12 03:53:25] [INFO ] Deduced a trap composed of 20 places in 85 ms
[2020-05-12 03:53:26] [INFO ] Deduced a trap composed of 52 places in 86 ms
[2020-05-12 03:53:26] [INFO ] Deduced a trap composed of 47 places in 85 ms
[2020-05-12 03:53:26] [INFO ] Deduced a trap composed of 40 places in 81 ms
[2020-05-12 03:53:26] [INFO ] Deduced a trap composed of 58 places in 173 ms
[2020-05-12 03:53:26] [INFO ] Deduced a trap composed of 26 places in 24 ms
[2020-05-12 03:53:26] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 5126 ms
[2020-05-12 03:53:26] [INFO ] Computed and/alt/rep : 561/2502/561 causal constraints in 29 ms.
[2020-05-12 03:53:31] [INFO ] Added : 410 causal constraints over 82 iterations in 4955 ms. Result :sat
[2020-05-12 03:53:31] [INFO ] Deduced a trap composed of 153 places in 137 ms
[2020-05-12 03:53:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 255 ms
[2020-05-12 03:53:31] [INFO ] [Real]Absence check using 61 positive place invariants in 36 ms returned sat
[2020-05-12 03:53:31] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 23 ms returned sat
[2020-05-12 03:53:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:53:32] [INFO ] [Real]Absence check using state equation in 500 ms returned unsat
[2020-05-12 03:53:32] [INFO ] [Real]Absence check using 61 positive place invariants in 36 ms returned sat
[2020-05-12 03:53:32] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 24 ms returned sat
[2020-05-12 03:53:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:53:33] [INFO ] [Real]Absence check using state equation in 714 ms returned sat
[2020-05-12 03:53:33] [INFO ] Deduced a trap composed of 12 places in 227 ms
[2020-05-12 03:53:33] [INFO ] Deduced a trap composed of 20 places in 185 ms
[2020-05-12 03:53:33] [INFO ] Deduced a trap composed of 21 places in 183 ms
[2020-05-12 03:53:34] [INFO ] Deduced a trap composed of 115 places in 191 ms
[2020-05-12 03:53:34] [INFO ] Deduced a trap composed of 118 places in 177 ms
[2020-05-12 03:53:34] [INFO ] Deduced a trap composed of 14 places in 165 ms
[2020-05-12 03:53:34] [INFO ] Deduced a trap composed of 20 places in 171 ms
[2020-05-12 03:53:34] [INFO ] Deduced a trap composed of 24 places in 167 ms
[2020-05-12 03:53:35] [INFO ] Deduced a trap composed of 11 places in 172 ms
[2020-05-12 03:53:35] [INFO ] Deduced a trap composed of 24 places in 178 ms
[2020-05-12 03:53:35] [INFO ] Deduced a trap composed of 26 places in 154 ms
[2020-05-12 03:53:35] [INFO ] Deduced a trap composed of 48 places in 153 ms
[2020-05-12 03:53:35] [INFO ] Deduced a trap composed of 129 places in 155 ms
[2020-05-12 03:53:36] [INFO ] Deduced a trap composed of 42 places in 146 ms
[2020-05-12 03:53:36] [INFO ] Deduced a trap composed of 36 places in 144 ms
[2020-05-12 03:53:36] [INFO ] Deduced a trap composed of 129 places in 158 ms
[2020-05-12 03:53:36] [INFO ] Deduced a trap composed of 147 places in 141 ms
[2020-05-12 03:53:36] [INFO ] Deduced a trap composed of 49 places in 180 ms
[2020-05-12 03:53:36] [INFO ] Deduced a trap composed of 24 places in 163 ms
[2020-05-12 03:53:37] [INFO ] Deduced a trap composed of 24 places in 119 ms
[2020-05-12 03:53:37] [INFO ] Deduced a trap composed of 49 places in 190 ms
[2020-05-12 03:53:37] [INFO ] Deduced a trap composed of 70 places in 103 ms
[2020-05-12 03:53:37] [INFO ] Deduced a trap composed of 26 places in 120 ms
[2020-05-12 03:53:37] [INFO ] Deduced a trap composed of 25 places in 129 ms
[2020-05-12 03:53:37] [INFO ] Deduced a trap composed of 22 places in 93 ms
[2020-05-12 03:53:37] [INFO ] Deduced a trap composed of 36 places in 107 ms
[2020-05-12 03:53:38] [INFO ] Deduced a trap composed of 24 places in 98 ms
[2020-05-12 03:53:38] [INFO ] Deduced a trap composed of 31 places in 98 ms
[2020-05-12 03:53:38] [INFO ] Deduced a trap composed of 18 places in 96 ms
[2020-05-12 03:53:38] [INFO ] Deduced a trap composed of 28 places in 113 ms
[2020-05-12 03:53:38] [INFO ] Deduced a trap composed of 35 places in 248 ms
[2020-05-12 03:53:38] [INFO ] Deduced a trap composed of 24 places in 89 ms
[2020-05-12 03:53:39] [INFO ] Deduced a trap composed of 22 places in 90 ms
[2020-05-12 03:53:39] [INFO ] Deduced a trap composed of 44 places in 91 ms
[2020-05-12 03:53:39] [INFO ] Deduced a trap composed of 30 places in 89 ms
[2020-05-12 03:53:39] [INFO ] Deduced a trap composed of 39 places in 89 ms
[2020-05-12 03:53:39] [INFO ] Deduced a trap composed of 34 places in 91 ms
[2020-05-12 03:53:39] [INFO ] Deduced a trap composed of 35 places in 89 ms
[2020-05-12 03:53:39] [INFO ] Deduced a trap composed of 21 places in 88 ms
[2020-05-12 03:53:39] [INFO ] Deduced a trap composed of 18 places in 87 ms
[2020-05-12 03:53:39] [INFO ] Deduced a trap composed of 29 places in 80 ms
[2020-05-12 03:53:40] [INFO ] Deduced a trap composed of 46 places in 94 ms
[2020-05-12 03:53:40] [INFO ] Deduced a trap composed of 49 places in 100 ms
[2020-05-12 03:53:40] [INFO ] Deduced a trap composed of 75 places in 85 ms
[2020-05-12 03:53:40] [INFO ] Deduced a trap composed of 85 places in 85 ms
[2020-05-12 03:53:40] [INFO ] Deduced a trap composed of 56 places in 81 ms
[2020-05-12 03:53:40] [INFO ] Deduced a trap composed of 57 places in 77 ms
[2020-05-12 03:53:40] [INFO ] Deduced a trap composed of 65 places in 76 ms
[2020-05-12 03:53:40] [INFO ] Deduced a trap composed of 86 places in 92 ms
[2020-05-12 03:53:40] [INFO ] Trap strengthening (SAT) tested/added 50/49 trap constraints in 7582 ms
[2020-05-12 03:53:40] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:53:40] [INFO ] [Nat]Absence check using 61 positive place invariants in 51 ms returned sat
[2020-05-12 03:53:40] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 23 ms returned sat
[2020-05-12 03:53:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:53:41] [INFO ] [Nat]Absence check using state equation in 709 ms returned sat
[2020-05-12 03:53:41] [INFO ] Deduced a trap composed of 12 places in 168 ms
[2020-05-12 03:53:42] [INFO ] Deduced a trap composed of 20 places in 172 ms
[2020-05-12 03:53:42] [INFO ] Deduced a trap composed of 22 places in 179 ms
[2020-05-12 03:53:42] [INFO ] Deduced a trap composed of 24 places in 172 ms
[2020-05-12 03:53:42] [INFO ] Deduced a trap composed of 139 places in 175 ms
[2020-05-12 03:53:42] [INFO ] Deduced a trap composed of 12 places in 169 ms
[2020-05-12 03:53:43] [INFO ] Deduced a trap composed of 19 places in 175 ms
[2020-05-12 03:53:43] [INFO ] Deduced a trap composed of 16 places in 166 ms
[2020-05-12 03:53:43] [INFO ] Deduced a trap composed of 14 places in 168 ms
[2020-05-12 03:53:43] [INFO ] Deduced a trap composed of 18 places in 163 ms
[2020-05-12 03:53:43] [INFO ] Deduced a trap composed of 39 places in 161 ms
[2020-05-12 03:53:43] [INFO ] Deduced a trap composed of 24 places in 156 ms
[2020-05-12 03:53:44] [INFO ] Deduced a trap composed of 25 places in 154 ms
[2020-05-12 03:53:44] [INFO ] Deduced a trap composed of 25 places in 173 ms
[2020-05-12 03:53:44] [INFO ] Deduced a trap composed of 41 places in 161 ms
[2020-05-12 03:53:44] [INFO ] Deduced a trap composed of 22 places in 156 ms
[2020-05-12 03:53:44] [INFO ] Deduced a trap composed of 28 places in 159 ms
[2020-05-12 03:53:45] [INFO ] Deduced a trap composed of 24 places in 154 ms
[2020-05-12 03:53:45] [INFO ] Deduced a trap composed of 125 places in 164 ms
[2020-05-12 03:53:45] [INFO ] Deduced a trap composed of 20 places in 179 ms
[2020-05-12 03:53:45] [INFO ] Deduced a trap composed of 30 places in 171 ms
[2020-05-12 03:53:45] [INFO ] Deduced a trap composed of 124 places in 171 ms
[2020-05-12 03:53:46] [INFO ] Deduced a trap composed of 137 places in 154 ms
[2020-05-12 03:53:46] [INFO ] Deduced a trap composed of 34 places in 152 ms
[2020-05-12 03:53:46] [INFO ] Deduced a trap composed of 52 places in 155 ms
[2020-05-12 03:53:46] [INFO ] Deduced a trap composed of 41 places in 153 ms
[2020-05-12 03:53:46] [INFO ] Deduced a trap composed of 39 places in 321 ms
[2020-05-12 03:53:47] [INFO ] Deduced a trap composed of 44 places in 172 ms
[2020-05-12 03:53:47] [INFO ] Deduced a trap composed of 130 places in 169 ms
[2020-05-12 03:53:47] [INFO ] Deduced a trap composed of 23 places in 209 ms
[2020-05-12 03:53:47] [INFO ] Deduced a trap composed of 44 places in 268 ms
[2020-05-12 03:53:48] [INFO ] Deduced a trap composed of 26 places in 249 ms
[2020-05-12 03:53:48] [INFO ] Deduced a trap composed of 30 places in 170 ms
[2020-05-12 03:53:48] [INFO ] Deduced a trap composed of 51 places in 173 ms
[2020-05-12 03:53:48] [INFO ] Deduced a trap composed of 21 places in 179 ms
[2020-05-12 03:53:48] [INFO ] Deduced a trap composed of 66 places in 185 ms
[2020-05-12 03:53:49] [INFO ] Deduced a trap composed of 67 places in 212 ms
[2020-05-12 03:53:49] [INFO ] Deduced a trap composed of 24 places in 194 ms
[2020-05-12 03:53:49] [INFO ] Deduced a trap composed of 70 places in 153 ms
[2020-05-12 03:53:49] [INFO ] Deduced a trap composed of 40 places in 156 ms
[2020-05-12 03:53:49] [INFO ] Deduced a trap composed of 161 places in 157 ms
[2020-05-12 03:53:50] [INFO ] Deduced a trap composed of 38 places in 166 ms
[2020-05-12 03:53:50] [INFO ] Deduced a trap composed of 69 places in 153 ms
[2020-05-12 03:53:50] [INFO ] Deduced a trap composed of 33 places in 161 ms
[2020-05-12 03:53:50] [INFO ] Deduced a trap composed of 18 places in 147 ms
[2020-05-12 03:53:50] [INFO ] Deduced a trap composed of 35 places in 154 ms
[2020-05-12 03:53:50] [INFO ] Deduced a trap composed of 138 places in 153 ms
[2020-05-12 03:53:51] [INFO ] Deduced a trap composed of 74 places in 165 ms
[2020-05-12 03:53:51] [INFO ] Deduced a trap composed of 29 places in 146 ms
[2020-05-12 03:53:51] [INFO ] Deduced a trap composed of 148 places in 160 ms
[2020-05-12 03:53:51] [INFO ] Deduced a trap composed of 113 places in 155 ms
[2020-05-12 03:53:51] [INFO ] Deduced a trap composed of 152 places in 161 ms
[2020-05-12 03:53:52] [INFO ] Deduced a trap composed of 25 places in 148 ms
[2020-05-12 03:53:52] [INFO ] Deduced a trap composed of 67 places in 145 ms
[2020-05-12 03:53:52] [INFO ] Deduced a trap composed of 73 places in 143 ms
[2020-05-12 03:53:52] [INFO ] Deduced a trap composed of 19 places in 184 ms
[2020-05-12 03:53:52] [INFO ] Deduced a trap composed of 30 places in 158 ms
[2020-05-12 03:53:52] [INFO ] Deduced a trap composed of 140 places in 127 ms
[2020-05-12 03:53:53] [INFO ] Deduced a trap composed of 46 places in 120 ms
[2020-05-12 03:53:53] [INFO ] Deduced a trap composed of 29 places in 123 ms
[2020-05-12 03:53:53] [INFO ] Deduced a trap composed of 57 places in 123 ms
[2020-05-12 03:53:53] [INFO ] Deduced a trap composed of 88 places in 120 ms
[2020-05-12 03:53:53] [INFO ] Deduced a trap composed of 90 places in 133 ms
[2020-05-12 03:53:53] [INFO ] Deduced a trap composed of 139 places in 192 ms
[2020-05-12 03:53:54] [INFO ] Deduced a trap composed of 142 places in 118 ms
[2020-05-12 03:53:54] [INFO ] Deduced a trap composed of 24 places in 115 ms
[2020-05-12 03:53:54] [INFO ] Trap strengthening (SAT) tested/added 67/66 trap constraints in 12543 ms
[2020-05-12 03:53:54] [INFO ] Computed and/alt/rep : 561/2502/561 causal constraints in 28 ms.
[2020-05-12 03:53:58] [INFO ] Added : 363 causal constraints over 73 iterations in 4314 ms. Result :sat
[2020-05-12 03:53:58] [INFO ] Deduced a trap composed of 42 places in 91 ms
[2020-05-12 03:53:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2020-05-12 03:53:58] [INFO ] [Real]Absence check using 61 positive place invariants in 59 ms returned sat
[2020-05-12 03:53:58] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 70 ms returned sat
[2020-05-12 03:53:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:53:59] [INFO ] [Real]Absence check using state equation in 754 ms returned unsat
[2020-05-12 03:53:59] [INFO ] [Real]Absence check using 61 positive place invariants in 85 ms returned sat
[2020-05-12 03:53:59] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 43 ms returned sat
[2020-05-12 03:53:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:54:00] [INFO ] [Real]Absence check using state equation in 492 ms returned unsat
[2020-05-12 03:54:00] [INFO ] [Real]Absence check using 61 positive place invariants in 37 ms returned sat
[2020-05-12 03:54:00] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 26 ms returned sat
[2020-05-12 03:54:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:54:01] [INFO ] [Real]Absence check using state equation in 813 ms returned sat
[2020-05-12 03:54:01] [INFO ] Deduced a trap composed of 16 places in 211 ms
[2020-05-12 03:54:01] [INFO ] Deduced a trap composed of 20 places in 212 ms
[2020-05-12 03:54:01] [INFO ] Deduced a trap composed of 22 places in 176 ms
[2020-05-12 03:54:02] [INFO ] Deduced a trap composed of 12 places in 173 ms
[2020-05-12 03:54:02] [INFO ] Deduced a trap composed of 18 places in 179 ms
[2020-05-12 03:54:02] [INFO ] Deduced a trap composed of 20 places in 205 ms
[2020-05-12 03:54:02] [INFO ] Deduced a trap composed of 24 places in 169 ms
[2020-05-12 03:54:02] [INFO ] Deduced a trap composed of 140 places in 176 ms
[2020-05-12 03:54:03] [INFO ] Deduced a trap composed of 24 places in 169 ms
[2020-05-12 03:54:03] [INFO ] Deduced a trap composed of 23 places in 176 ms
[2020-05-12 03:54:03] [INFO ] Deduced a trap composed of 17 places in 175 ms
[2020-05-12 03:54:03] [INFO ] Deduced a trap composed of 43 places in 170 ms
[2020-05-12 03:54:03] [INFO ] Deduced a trap composed of 140 places in 162 ms
[2020-05-12 03:54:04] [INFO ] Deduced a trap composed of 139 places in 158 ms
[2020-05-12 03:54:04] [INFO ] Deduced a trap composed of 142 places in 153 ms
[2020-05-12 03:54:04] [INFO ] Deduced a trap composed of 28 places in 157 ms
[2020-05-12 03:54:04] [INFO ] Deduced a trap composed of 148 places in 166 ms
[2020-05-12 03:54:04] [INFO ] Deduced a trap composed of 22 places in 165 ms
[2020-05-12 03:54:05] [INFO ] Deduced a trap composed of 146 places in 161 ms
[2020-05-12 03:54:05] [INFO ] Deduced a trap composed of 152 places in 182 ms
[2020-05-12 03:54:05] [INFO ] Deduced a trap composed of 140 places in 171 ms
[2020-05-12 03:54:05] [INFO ] Deduced a trap composed of 25 places in 160 ms
[2020-05-12 03:54:05] [INFO ] Deduced a trap composed of 139 places in 171 ms
[2020-05-12 03:54:06] [INFO ] Deduced a trap composed of 25 places in 227 ms
[2020-05-12 03:54:06] [INFO ] Deduced a trap composed of 30 places in 215 ms
[2020-05-12 03:54:06] [INFO ] Deduced a trap composed of 58 places in 238 ms
[2020-05-12 03:54:06] [INFO ] Deduced a trap composed of 30 places in 153 ms
[2020-05-12 03:54:07] [INFO ] Deduced a trap composed of 33 places in 198 ms
[2020-05-12 03:54:07] [INFO ] Deduced a trap composed of 133 places in 221 ms
[2020-05-12 03:54:07] [INFO ] Deduced a trap composed of 33 places in 289 ms
[2020-05-12 03:54:07] [INFO ] Deduced a trap composed of 22 places in 151 ms
[2020-05-12 03:54:07] [INFO ] Deduced a trap composed of 36 places in 178 ms
[2020-05-12 03:54:08] [INFO ] Deduced a trap composed of 36 places in 166 ms
[2020-05-12 03:54:08] [INFO ] Deduced a trap composed of 30 places in 177 ms
[2020-05-12 03:54:08] [INFO ] Deduced a trap composed of 163 places in 202 ms
[2020-05-12 03:54:08] [INFO ] Deduced a trap composed of 12 places in 197 ms
[2020-05-12 03:54:09] [INFO ] Deduced a trap composed of 21 places in 160 ms
[2020-05-12 03:54:09] [INFO ] Deduced a trap composed of 17 places in 170 ms
[2020-05-12 03:54:09] [INFO ] Deduced a trap composed of 30 places in 177 ms
[2020-05-12 03:54:09] [INFO ] Deduced a trap composed of 44 places in 163 ms
[2020-05-12 03:54:09] [INFO ] Deduced a trap composed of 27 places in 180 ms
[2020-05-12 03:54:09] [INFO ] Deduced a trap composed of 134 places in 153 ms
[2020-05-12 03:54:10] [INFO ] Deduced a trap composed of 31 places in 351 ms
[2020-05-12 03:54:10] [INFO ] Deduced a trap composed of 44 places in 149 ms
[2020-05-12 03:54:10] [INFO ] Deduced a trap composed of 45 places in 239 ms
[2020-05-12 03:54:11] [INFO ] Deduced a trap composed of 149 places in 192 ms
[2020-05-12 03:54:11] [INFO ] Deduced a trap composed of 138 places in 168 ms
[2020-05-12 03:54:11] [INFO ] Deduced a trap composed of 139 places in 153 ms
[2020-05-12 03:54:11] [INFO ] Deduced a trap composed of 26 places in 150 ms
[2020-05-12 03:54:11] [INFO ] Deduced a trap composed of 45 places in 147 ms
[2020-05-12 03:54:11] [INFO ] Deduced a trap composed of 25 places in 145 ms
[2020-05-12 03:54:12] [INFO ] Deduced a trap composed of 32 places in 143 ms
[2020-05-12 03:54:12] [INFO ] Deduced a trap composed of 51 places in 146 ms
[2020-05-12 03:54:12] [INFO ] Deduced a trap composed of 41 places in 149 ms
[2020-05-12 03:54:12] [INFO ] Deduced a trap composed of 22 places in 145 ms
[2020-05-12 03:54:12] [INFO ] Deduced a trap composed of 20 places in 169 ms
[2020-05-12 03:54:12] [INFO ] Deduced a trap composed of 69 places in 140 ms
[2020-05-12 03:54:13] [INFO ] Deduced a trap composed of 144 places in 148 ms
[2020-05-12 03:54:13] [INFO ] Deduced a trap composed of 38 places in 141 ms
[2020-05-12 03:54:13] [INFO ] Deduced a trap composed of 54 places in 161 ms
[2020-05-12 03:54:13] [INFO ] Deduced a trap composed of 138 places in 140 ms
[2020-05-12 03:54:13] [INFO ] Deduced a trap composed of 44 places in 151 ms
[2020-05-12 03:54:14] [INFO ] Deduced a trap composed of 47 places in 162 ms
[2020-05-12 03:54:14] [INFO ] Deduced a trap composed of 24 places in 181 ms
[2020-05-12 03:54:14] [INFO ] Deduced a trap composed of 31 places in 190 ms
[2020-05-12 03:54:14] [INFO ] Deduced a trap composed of 45 places in 322 ms
[2020-05-12 03:54:15] [INFO ] Deduced a trap composed of 69 places in 278 ms
[2020-05-12 03:54:15] [INFO ] Deduced a trap composed of 52 places in 241 ms
[2020-05-12 03:54:15] [INFO ] Deduced a trap composed of 58 places in 142 ms
[2020-05-12 03:54:15] [INFO ] Deduced a trap composed of 61 places in 189 ms
[2020-05-12 03:54:16] [INFO ] Deduced a trap composed of 45 places in 164 ms
[2020-05-12 03:54:16] [INFO ] Deduced a trap composed of 48 places in 206 ms
[2020-05-12 03:54:16] [INFO ] Deduced a trap composed of 154 places in 178 ms
[2020-05-12 03:54:16] [INFO ] Deduced a trap composed of 43 places in 137 ms
[2020-05-12 03:54:16] [INFO ] Deduced a trap composed of 159 places in 149 ms
[2020-05-12 03:54:17] [INFO ] Deduced a trap composed of 145 places in 130 ms
[2020-05-12 03:54:17] [INFO ] Trap strengthening (SAT) tested/added 77/76 trap constraints in 15719 ms
[2020-05-12 03:54:17] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:54:17] [INFO ] [Nat]Absence check using 61 positive place invariants in 51 ms returned sat
[2020-05-12 03:54:17] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 38 ms returned sat
[2020-05-12 03:54:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:54:18] [INFO ] [Nat]Absence check using state equation in 840 ms returned sat
[2020-05-12 03:54:18] [INFO ] Deduced a trap composed of 13 places in 256 ms
[2020-05-12 03:54:18] [INFO ] Deduced a trap composed of 22 places in 326 ms
[2020-05-12 03:54:18] [INFO ] Deduced a trap composed of 13 places in 207 ms
[2020-05-12 03:54:19] [INFO ] Deduced a trap composed of 19 places in 176 ms
[2020-05-12 03:54:19] [INFO ] Deduced a trap composed of 21 places in 842 ms
[2020-05-12 03:54:20] [INFO ] Deduced a trap composed of 22 places in 183 ms
[2020-05-12 03:54:20] [INFO ] Deduced a trap composed of 17 places in 343 ms
[2020-05-12 03:54:20] [INFO ] Deduced a trap composed of 22 places in 373 ms
[2020-05-12 03:54:21] [INFO ] Deduced a trap composed of 23 places in 467 ms
[2020-05-12 03:54:21] [INFO ] Deduced a trap composed of 27 places in 169 ms
[2020-05-12 03:54:21] [INFO ] Deduced a trap composed of 24 places in 182 ms
[2020-05-12 03:54:22] [INFO ] Deduced a trap composed of 31 places in 165 ms
[2020-05-12 03:54:22] [INFO ] Deduced a trap composed of 31 places in 267 ms
[2020-05-12 03:54:22] [INFO ] Deduced a trap composed of 34 places in 204 ms
[2020-05-12 03:54:22] [INFO ] Deduced a trap composed of 140 places in 348 ms
[2020-05-12 03:54:23] [INFO ] Deduced a trap composed of 42 places in 223 ms
[2020-05-12 03:54:23] [INFO ] Deduced a trap composed of 25 places in 153 ms
[2020-05-12 03:54:23] [INFO ] Deduced a trap composed of 154 places in 192 ms
[2020-05-12 03:54:23] [INFO ] Deduced a trap composed of 22 places in 159 ms
[2020-05-12 03:54:24] [INFO ] Deduced a trap composed of 20 places in 303 ms
[2020-05-12 03:54:24] [INFO ] Deduced a trap composed of 139 places in 172 ms
[2020-05-12 03:54:24] [INFO ] Deduced a trap composed of 28 places in 159 ms
[2020-05-12 03:54:24] [INFO ] Deduced a trap composed of 147 places in 172 ms
[2020-05-12 03:54:24] [INFO ] Deduced a trap composed of 29 places in 169 ms
[2020-05-12 03:54:25] [INFO ] Deduced a trap composed of 137 places in 159 ms
[2020-05-12 03:54:25] [INFO ] Deduced a trap composed of 162 places in 168 ms
[2020-05-12 03:54:25] [INFO ] Deduced a trap composed of 152 places in 203 ms
[2020-05-12 03:54:25] [INFO ] Deduced a trap composed of 161 places in 340 ms
[2020-05-12 03:54:26] [INFO ] Deduced a trap composed of 140 places in 250 ms
[2020-05-12 03:54:26] [INFO ] Deduced a trap composed of 21 places in 189 ms
[2020-05-12 03:54:26] [INFO ] Deduced a trap composed of 19 places in 155 ms
[2020-05-12 03:54:26] [INFO ] Deduced a trap composed of 30 places in 390 ms
[2020-05-12 03:54:27] [INFO ] Deduced a trap composed of 26 places in 219 ms
[2020-05-12 03:54:27] [INFO ] Deduced a trap composed of 37 places in 141 ms
[2020-05-12 03:54:27] [INFO ] Deduced a trap composed of 31 places in 162 ms
[2020-05-12 03:54:27] [INFO ] Deduced a trap composed of 13 places in 109 ms
[2020-05-12 03:54:27] [INFO ] Deduced a trap composed of 29 places in 87 ms
[2020-05-12 03:54:27] [INFO ] Deduced a trap composed of 27 places in 105 ms
[2020-05-12 03:54:28] [INFO ] Deduced a trap composed of 34 places in 189 ms
[2020-05-12 03:54:28] [INFO ] Deduced a trap composed of 26 places in 85 ms
[2020-05-12 03:54:28] [INFO ] Deduced a trap composed of 26 places in 82 ms
[2020-05-12 03:54:28] [INFO ] Deduced a trap composed of 39 places in 81 ms
[2020-05-12 03:54:28] [INFO ] Deduced a trap composed of 25 places in 146 ms
[2020-05-12 03:54:28] [INFO ] Deduced a trap composed of 16 places in 143 ms
[2020-05-12 03:54:29] [INFO ] Deduced a trap composed of 29 places in 136 ms
[2020-05-12 03:54:29] [INFO ] Deduced a trap composed of 12 places in 137 ms
[2020-05-12 03:54:29] [INFO ] Deduced a trap composed of 29 places in 146 ms
[2020-05-12 03:54:29] [INFO ] Deduced a trap composed of 20 places in 141 ms
[2020-05-12 03:54:29] [INFO ] Deduced a trap composed of 47 places in 134 ms
[2020-05-12 03:54:29] [INFO ] Deduced a trap composed of 47 places in 134 ms
[2020-05-12 03:54:29] [INFO ] Deduced a trap composed of 35 places in 149 ms
[2020-05-12 03:54:30] [INFO ] Deduced a trap composed of 39 places in 137 ms
[2020-05-12 03:54:30] [INFO ] Deduced a trap composed of 146 places in 138 ms
[2020-05-12 03:54:30] [INFO ] Deduced a trap composed of 149 places in 140 ms
[2020-05-12 03:54:30] [INFO ] Deduced a trap composed of 43 places in 61 ms
[2020-05-12 03:54:30] [INFO ] Deduced a trap composed of 40 places in 70 ms
[2020-05-12 03:54:30] [INFO ] Deduced a trap composed of 31 places in 55 ms
[2020-05-12 03:54:30] [INFO ] Deduced a trap composed of 16 places in 61 ms
[2020-05-12 03:54:30] [INFO ] Deduced a trap composed of 39 places in 69 ms
[2020-05-12 03:54:31] [INFO ] Deduced a trap composed of 32 places in 57 ms
[2020-05-12 03:54:31] [INFO ] Deduced a trap composed of 36 places in 131 ms
[2020-05-12 03:54:31] [INFO ] Deduced a trap composed of 139 places in 140 ms
[2020-05-12 03:54:31] [INFO ] Deduced a trap composed of 43 places in 135 ms
[2020-05-12 03:54:31] [INFO ] Deduced a trap composed of 29 places in 147 ms
[2020-05-12 03:54:31] [INFO ] Deduced a trap composed of 43 places in 141 ms
[2020-05-12 03:54:31] [INFO ] Deduced a trap composed of 25 places in 146 ms
[2020-05-12 03:54:32] [INFO ] Deduced a trap composed of 70 places in 145 ms
[2020-05-12 03:54:32] [INFO ] Deduced a trap composed of 41 places in 156 ms
[2020-05-12 03:54:32] [INFO ] Deduced a trap composed of 43 places in 156 ms
[2020-05-12 03:54:32] [INFO ] Deduced a trap composed of 31 places in 150 ms
[2020-05-12 03:54:32] [INFO ] Deduced a trap composed of 166 places in 147 ms
[2020-05-12 03:54:33] [INFO ] Deduced a trap composed of 29 places in 145 ms
[2020-05-12 03:54:33] [INFO ] Deduced a trap composed of 152 places in 152 ms
[2020-05-12 03:54:33] [INFO ] Deduced a trap composed of 165 places in 151 ms
[2020-05-12 03:54:33] [INFO ] Deduced a trap composed of 48 places in 148 ms
[2020-05-12 03:54:33] [INFO ] Deduced a trap composed of 141 places in 233 ms
[2020-05-12 03:54:33] [INFO ] Deduced a trap composed of 37 places in 75 ms
[2020-05-12 03:54:34] [INFO ] Deduced a trap composed of 39 places in 74 ms
[2020-05-12 03:54:34] [INFO ] Deduced a trap composed of 45 places in 502 ms
[2020-05-12 03:54:34] [INFO ] Deduced a trap composed of 70 places in 115 ms
[2020-05-12 03:54:34] [INFO ] Deduced a trap composed of 141 places in 143 ms
[2020-05-12 03:54:34] [INFO ] Deduced a trap composed of 53 places in 77 ms
[2020-05-12 03:54:35] [INFO ] Trap strengthening (SAT) tested/added 83/82 trap constraints in 16996 ms
[2020-05-12 03:54:35] [INFO ] Computed and/alt/rep : 561/2502/561 causal constraints in 26 ms.
[2020-05-12 03:54:37] [INFO ] Added : 230 causal constraints over 46 iterations in 2047 ms. Result :(error "Failed to check-sat")
[2020-05-12 03:54:37] [INFO ] [Real]Absence check using 61 positive place invariants in 37 ms returned sat
[2020-05-12 03:54:37] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 4 ms returned unsat
[2020-05-12 03:54:37] [INFO ] [Real]Absence check using 61 positive place invariants in 57 ms returned sat
[2020-05-12 03:54:37] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 29 ms returned sat
[2020-05-12 03:54:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:54:38] [INFO ] [Real]Absence check using state equation in 845 ms returned sat
[2020-05-12 03:54:38] [INFO ] Deduced a trap composed of 8 places in 198 ms
[2020-05-12 03:54:38] [INFO ] Deduced a trap composed of 22 places in 172 ms
[2020-05-12 03:54:38] [INFO ] Deduced a trap composed of 13 places in 173 ms
[2020-05-12 03:54:39] [INFO ] Deduced a trap composed of 122 places in 172 ms
[2020-05-12 03:54:39] [INFO ] Deduced a trap composed of 147 places in 184 ms
[2020-05-12 03:54:39] [INFO ] Deduced a trap composed of 140 places in 184 ms
[2020-05-12 03:54:39] [INFO ] Deduced a trap composed of 141 places in 166 ms
[2020-05-12 03:54:39] [INFO ] Deduced a trap composed of 140 places in 171 ms
[2020-05-12 03:54:40] [INFO ] Deduced a trap composed of 142 places in 193 ms
[2020-05-12 03:54:40] [INFO ] Deduced a trap composed of 129 places in 165 ms
[2020-05-12 03:54:40] [INFO ] Deduced a trap composed of 134 places in 177 ms
[2020-05-12 03:54:40] [INFO ] Deduced a trap composed of 140 places in 162 ms
[2020-05-12 03:54:40] [INFO ] Deduced a trap composed of 134 places in 162 ms
[2020-05-12 03:54:41] [INFO ] Deduced a trap composed of 122 places in 171 ms
[2020-05-12 03:54:41] [INFO ] Deduced a trap composed of 128 places in 185 ms
[2020-05-12 03:54:41] [INFO ] Deduced a trap composed of 134 places in 209 ms
[2020-05-12 03:54:41] [INFO ] Deduced a trap composed of 135 places in 180 ms
[2020-05-12 03:54:41] [INFO ] Deduced a trap composed of 129 places in 183 ms
[2020-05-12 03:54:42] [INFO ] Deduced a trap composed of 133 places in 196 ms
[2020-05-12 03:54:42] [INFO ] Deduced a trap composed of 130 places in 213 ms
[2020-05-12 03:54:42] [INFO ] Deduced a trap composed of 131 places in 196 ms
[2020-05-12 03:54:42] [INFO ] Deduced a trap composed of 115 places in 180 ms
[2020-05-12 03:54:42] [INFO ] Deduced a trap composed of 122 places in 182 ms
[2020-05-12 03:54:43] [INFO ] Deduced a trap composed of 129 places in 188 ms
[2020-05-12 03:54:43] [INFO ] Deduced a trap composed of 123 places in 188 ms
[2020-05-12 03:54:43] [INFO ] Deduced a trap composed of 121 places in 221 ms
[2020-05-12 03:54:43] [INFO ] Deduced a trap composed of 121 places in 176 ms
[2020-05-12 03:54:44] [INFO ] Deduced a trap composed of 114 places in 173 ms
[2020-05-12 03:54:46] [INFO ] Deduced a trap composed of 113 places in 2481 ms
[2020-05-12 03:54:49] [INFO ] Deduced a trap composed of 137 places in 2578 ms
[2020-05-12 03:54:50] [INFO ] Deduced a trap composed of 140 places in 1719 ms
[2020-05-12 03:54:52] [INFO ] Deduced a trap composed of 129 places in 1366 ms
[2020-05-12 03:54:54] [INFO ] Deduced a trap composed of 127 places in 2158 ms
[2020-05-12 03:54:55] [INFO ] Deduced a trap composed of 131 places in 1165 ms
[2020-05-12 03:54:56] [INFO ] Deduced a trap composed of 138 places in 377 ms
[2020-05-12 03:54:56] [INFO ] Deduced a trap composed of 130 places in 367 ms
[2020-05-12 03:54:57] [INFO ] Deduced a trap composed of 137 places in 447 ms
[2020-05-12 03:55:00] [INFO ] Deduced a trap composed of 146 places in 3636 ms
[2020-05-12 03:55:00] [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 s6 s7 s8 s30 s31 s34 s35 s36 s39 s40 s43 s44 s45 s46 s47 s48 s50 s51 s54 s55 s56 s57 s58 s59 s60 s61 s65 s66 s67 s68 s75 s76 s80 s81 s82 s89 s90 s91 s94 s98 s103 s112 s113 s131 s168 s173 s174 s178 s179 s180 s206 s207 s208 s212 s213 s214 s221 s243 s244 s245 s287 s288 s289 s293 s312 s314 s317 s319 s323 s332 s336 s338 s342 s347 s352 s366 s367 s368 s376 s377 s378 s382 s387 s417 s426 s427 s428 s437 s442 s446 s449 s450 s451 s452 s456 s457 s458 s459 s460 s468 s469 s472 s473 s480 s481 s489 s490 s493 s494 s497 s498 s506 s510 s516 s519 s520 s521 s538 s539 s540 s541 s548 s549 s550 s551 s554 s555 s559 s560 s571 s572 s573 s574 s581 s582 s583 s584 s591 s605 s614) 0)") while checking expression at index 8
[2020-05-12 03:55:01] [INFO ] [Real]Absence check using 61 positive place invariants in 449 ms returned sat
[2020-05-12 03:55:01] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 44 ms returned sat
[2020-05-12 03:55:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:55:05] [INFO ] [Real]Absence check using state equation in 4186 ms returned sat
[2020-05-12 03:55:11] [INFO ] Deduced a trap composed of 8 places in 5887 ms
[2020-05-12 03:55:17] [INFO ] Deduced a trap composed of 11 places in 6469 ms
[2020-05-12 03:55:23] [INFO ] Deduced a trap composed of 8 places in 5732 ms
[2020-05-12 03:55:23] [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 s247 s356 s357 s358) 0)") while checking expression at index 9
[2020-05-12 03:55:24] [INFO ] [Real]Absence check using 61 positive place invariants in 339 ms returned sat
[2020-05-12 03:55:24] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 110 ms returned sat
[2020-05-12 03:55:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:55:27] [INFO ] [Real]Absence check using state equation in 3058 ms returned unsat
[2020-05-12 03:55:27] [INFO ] [Real]Absence check using 61 positive place invariants in 122 ms returned sat
[2020-05-12 03:55:27] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 23 ms returned sat
[2020-05-12 03:55:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:55:31] [INFO ] [Real]Absence check using state equation in 4046 ms returned sat
[2020-05-12 03:55:35] [INFO ] Deduced a trap composed of 12 places in 4313 ms
[2020-05-12 03:55:42] [INFO ] Deduced a trap composed of 13 places in 6410 ms
[2020-05-12 03:55:48] [INFO ] Deduced a trap composed of 12 places in 5876 ms
[2020-05-12 03:55:48] [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 s243 s244 s245 s251 s254 s436 s437 s438 s442) 0)") while checking expression at index 11
Successfully simplified 5 atomic propositions for a total of 5 simplifications.
[2020-05-12 03:55:48] [INFO ] Flatten gal took : 152 ms
[2020-05-12 03:55:48] [INFO ] Flatten gal took : 45 ms
[2020-05-12 03:55:48] [INFO ] Applying decomposition
[2020-05-12 03:55:48] [INFO ] Flatten gal took : 24 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/graph14641298221948806382.txt, -o, /tmp/graph14641298221948806382.bin, -w, /tmp/graph14641298221948806382.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/graph14641298221948806382.bin, -l, -1, -v, -w, /tmp/graph14641298221948806382.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-12 03:55:49] [INFO ] Decomposing Gal with order
[2020-05-12 03:55:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-12 03:55:49] [INFO ] Removed a total of 275 redundant transitions.
[2020-05-12 03:55:49] [INFO ] Flatten gal took : 133 ms
[2020-05-12 03:55:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 3 labels/synchronizations in 23 ms.
[2020-05-12 03:55:49] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 24 ms
[2020-05-12 03:55:49] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.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/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.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/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl
No direction supplied, using forward translation only.
Parsed 16 CTL formulae.
built 63 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 26 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 24 ordering constraints for composite.
built 23 ordering constraints for composite.
built 4 ordering constraints for composite.
built 23 ordering constraints for composite.
built 20 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 16 ordering constraints for composite.
built 19 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 21 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 79 ordering constraints for composite.
built 4 ordering constraints for composite.
built 9 ordering constraints for composite.
built 5 ordering constraints for composite.
built 12 ordering constraints for composite.
built 21 ordering constraints for composite.
built 12 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 13 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 24 ordering constraints for composite.
built 16 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 24 ordering constraints for composite.
built 22 ordering constraints for composite.
built 6 ordering constraints for composite.
built 19 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 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 17 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 26 ordering constraints for composite.
built 46 ordering constraints for composite.
built 25 ordering constraints for composite.
built 43 ordering constraints for composite.
built 20 ordering constraints for composite.
built 12 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.87325e+25,10.2367,262136,15153,72,386388,840,1387,882872,76,2419,0


Converting to forward existential form...Done !
original formula: EF(((i16.i0.u250.p614==1)||(((i16.i0.u52.p131==1)&&(i16.i2.u139.p357==1))&&(i16.i2.u203.p621==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * ((i16.i0.u250.p614==1)||(((i16.i0.u52.p131==1)&&(i16.i2.u139.p357==1))&&(i16.i2.u203.p621==1))))] != FALSE
(forward)formula 0,1,10.2846,262136,1,0,386388,840,1417,882872,81,2419,740
FORMULA BusinessProcesses-PT-15-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF(AX((i19.u194.p494==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!((i19.u194.p494==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t72, t286, t296, t410, t420, i0.i0.t282, i0.i0.t292, i0.i0.u85.t299, i0.i0.u87.t295, i0.i0.u92.t285, i0.i1.t165, i0.i1.u167.t166, i1.i0.u64.t339, i1.i0.u66.t335, i1.i0.u69.t329, i1.i2.t193, i1.i2.u153.t194, i2.u57.t353, i2.u59.t349, i3.t392, i3.i0.t390, i3.i0.t405, i3.i1.t395, i3.i1.t397, i3.i1.t399, i3.i1.t401, i4.i0.t343, i4.i0.u61.t345, i4.i1.t201, i4.i1.u148.t202, i5.i1.u95.t278, i6.i0.t289, i6.i0.u89.t291, i6.i2.t161, i6.i2.u168.t162, i6.i3.t157, i6.i3.u170.t158, i6.i4.t153, i6.i4.u172.t154, i6.i5.t149, i6.i5.u174.t150, i7.i2.t197, i7.i2.u150.t198, i7.i3.t185, i7.i3.u156.t186, i7.i4.t173, i7.i4.u163.t174, i7.i5.t169, i7.i5.u164.t170, i8.i2.t233, i8.i2.u133.t234, i8.i3.t229, i8.i3.u135.t230, i8.i4.t217, i8.i4.u141.t218, i8.i5.t213, i8.i5.u142.t214, i8.i6.t209, i8.i6.u145.t210, i9.i0.t406, i9.i0.u22.t413, i9.i0.u24.t409, i9.i1.t415, i9.i1.u23.t411, i9.i3.t237, i9.i3.u130.t238, i10.i1.t269, i10.i1.u116.t270, i10.i2.t261, i10.i2.u120.t262, i10.i3.t257, i10.i3.u121.t258, i10.i4.t253, i10.i4.u123.t254, i10.i5.t249, i10.i5.u126.t250, i11.i0.u73.t321, i11.i0.u75.t317, i11.i1.t272, i11.i1.u113.t273, i12.i0.u14.t428, i12.i0.u19.t419, i12.i1.t430, i12.i1.u15.t426, i12.i2.t265, i12.i2.u117.t266, i12.i3.t125, i12.i3.u181.t129, i13.i0.t423, i13.i0.u16.t425, i13.i1.t205, i13.i1.u147.t206, i14.t111, i14.u189.t115, i15.u35.t387, i15.u37.t383, i16.t361, i16.t359, i16.i0.t245, i16.i0.u127.t246, i16.i1.t225, i16.i1.u136.t226, i16.i2.t221, i16.i2.t357, i16.i2.u39.t365, i16.i2.u39.t369, i16.i2.u39.t373, i16.i2.u39.t379, i16.i2.u139.t222, i17.i0.u71.t325, i17.i1.t189, i17.i1.u154.t190, i17.i2.t181, i17.i2.u158.t182, i18.i0.t304, i18.i0.u81.t307, i18.i0.u83.t303, i18.i1.u79.t311, i18.i2.t177, i18.i2.u160.t178, i19.t143, i19.t136, i19.t131, i19.t127, i19.t123, i19.t121, i19.t118, i19.t113, i19.t109, i19.t106, i19.t104, i19.t102, i19.t100, i19.t97, i19.t69, i19.t66, i19.t63, i19.t61, i19.t58, i19.t55, i19.t53, i19.t51, i19.t48, i19.t45, i19.t37, i19.t34, i19.t31, i19.t28, i19.t25, i19.t22, i19.t20, i19.t17, i19.t14, i19.u242.t12, i19.u242.t42, i19.u242.t80, i19.u242.t84, i19.u242.t88, i19.u242.t94, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/365/159/560
(forward)formula 1,1,49.8619,1319988,1,0,2.19492e+06,840,7740,4.04027e+06,338,2419,5559095
FORMULA BusinessProcesses-PT-15-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: !(AX(EF((((i2.u60.p149==1)&&(i8.i4.u141.p362==1))&&(i2.u211.p532==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U (((i2.u60.p149==1)&&(i8.i4.u141.p362==1))&&(i2.u211.p532==1)))))] != FALSE
(forward)formula 2,0,92.947,1992244,1,0,3.00016e+06,840,9526,7.54693e+06,375,2554,7303100
FORMULA BusinessProcesses-PT-15-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF(((i11.i0.u77.p198==1)&&(i11.i0.u78.p201==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * ((i11.i0.u77.p198==1)&&(i11.i0.u78.p201==1)))] != FALSE
(forward)formula 3,1,92.9588,1992508,1,0,3.00017e+06,840,9537,7.54767e+06,375,2554,7304069
FORMULA BusinessProcesses-PT-15-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF((AX(FALSE) * ((i2.u8.p19==1) + EG((i10.i0.u111.p285==1)))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(EX(!(FALSE)))) * (i2.u8.p19==1))] != FALSE + [FwdG((FwdU(Init,TRUE) * !(EX(!(FALSE)))),(i10.i0.u111.p285==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
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 an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
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
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
(forward)formula 4,0,96.9148,2031052,1,0,3.03475e+06,840,9868,7.89499e+06,399,2565,7340611
FORMULA BusinessProcesses-PT-15-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF(((i17.i1.u154.p395!=1)&&((i6.i0.u90.p236==1)||(i19.u215.p540==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * ((i17.i1.u154.p395!=1)&&((i6.i0.u90.p236==1)||(i19.u215.p540==1))))] != FALSE
(forward)formula 5,1,96.9807,2033164,1,0,3.0374e+06,840,9879,7.90218e+06,400,2565,7356667
FORMULA BusinessProcesses-PT-15-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF(EX((i11.i1.u114.p293==1)))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * (i11.i1.u114.p293==1))] != FALSE
(forward)formula 6,1,97.8212,2063524,1,0,3.08329e+06,840,9919,8.04657e+06,400,2583,7436488
FORMULA BusinessProcesses-PT-15-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG((!(EF((((i2.u60.p149==1)&&(i8.i4.u141.p362==1))&&(i2.u211.p532==1)))) * (((i18.i0.u84.p220!=1)&&(i19.u196.p498!=1))||((i16.i2.u139.p355!=1)&&(i19.u182.p468!=1)))))
=> equivalent forward existential formula: [FwdG(Init,(!(E(TRUE U (((i2.u60.p149==1)&&(i8.i4.u141.p362==1))&&(i2.u211.p532==1)))) * (((i18.i0.u84.p220!=1)&&(i19.u196.p498!=1))||((i16.i2.u139.p355!=1)&&(i19.u182.p468!=1)))))] != FALSE
(forward)formula 7,0,97.9471,2066428,1,0,3.08613e+06,840,9938,8.05941e+06,401,2583,7456357
FORMULA BusinessProcesses-PT-15-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AX((i6.i0.u89.p235==1))
=> equivalent forward existential formula: [(EY(Init) * !((i6.i0.u89.p235==1)))] = FALSE
(forward)formula 8,0,98.0422,2069860,1,0,3.09472e+06,840,9944,8.06802e+06,401,2583,7465778
FORMULA BusinessProcesses-PT-15-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EG(EF((i17.i1.u155.p394==1)))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (i17.i1.u155.p394==1)))] != FALSE
(forward)formula 9,1,134.253,2206084,1,0,3.50913e+06,840,2998,8.31318e+06,150,2600,3300467
FORMULA BusinessProcesses-PT-15-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
Detected timeout of ITS tools.
[2020-05-12 04:16:47] [INFO ] Applying decomposition
[2020-05-12 04:16:47] [INFO ] Flatten gal took : 21 ms
[2020-05-12 04:16:48] [INFO ] Decomposing Gal with order
[2020-05-12 04:16:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-12 04:16:48] [INFO ] Removed a total of 117 redundant transitions.
[2020-05-12 04:16:48] [INFO ] Flatten gal took : 38 ms
[2020-05-12 04:16:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 156 labels/synchronizations in 215 ms.
[2020-05-12 04:16:48] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 22 ms
[2020-05-12 04:16:48] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.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/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.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/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl
No direction supplied, using forward translation only.
Parsed 6 CTL formulae.
built 2 ordering constraints for composite.
built 141 ordering constraints for composite.
built 78 ordering constraints for composite.
built 77 ordering constraints for composite.
built 76 ordering constraints for composite.
built 76 ordering constraints for composite.
built 74 ordering constraints for composite.
built 71 ordering constraints for composite.
built 69 ordering constraints for composite.
built 67 ordering constraints for composite.
built 65 ordering constraints for composite.
built 63 ordering constraints for composite.
built 61 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 49 ordering constraints for composite.
built 47 ordering constraints for composite.
built 44 ordering constraints for composite.
built 42 ordering constraints for composite.
built 40 ordering constraints for composite.
built 24 ordering constraints for composite.
built 22 ordering constraints for composite.
built 20 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 10 ordering constraints for composite.
built 8 ordering constraints for composite.
built 25 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 65 ordering constraints for composite.
built 63 ordering constraints for composite.
built 61 ordering constraints for composite.
built 59 ordering constraints for composite.
built 57 ordering constraints for composite.
built 55 ordering constraints for composite.
built 53 ordering constraints for composite.
built 51 ordering constraints for composite.
built 49 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 33 ordering constraints for composite.
built 31 ordering constraints for composite.
built 29 ordering constraints for composite.
built 27 ordering constraints for composite.
built 25 ordering constraints for composite.
built 23 ordering constraints for composite.
built 21 ordering constraints for composite.
built 19 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 86 ordering constraints for composite.
built 6 ordering constraints for composite.
Detected timeout of ITS tools.
[2020-05-12 04:37:48] [INFO ] Flatten gal took : 403 ms
[2020-05-12 04:37:49] [INFO ] Input system was already deterministic with 562 transitions.
[2020-05-12 04:37:49] [INFO ] Transformed 626 places.
[2020-05-12 04:37:49] [INFO ] Transformed 562 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:38:19] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 6 ms
[2020-05-12 04:38:19] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 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-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 6 CTL formulae.

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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution CTLFireability -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 CTLFireability -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-15"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

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

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

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