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

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

=== Now, execution of the tool begins

BK_START 1589255830034

[2020-05-12 03:57:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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:57:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 03:57:12] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2020-05-12 03:57:12] [INFO ] Transformed 638 places.
[2020-05-12 03:57:12] [INFO ] Transformed 578 transitions.
[2020-05-12 03:57:12] [INFO ] Found NUPN structural information;
[2020-05-12 03:57:12] [INFO ] Parsed PT model containing 638 places and 578 transitions in 119 ms.
Deduced a syphon composed of 8 places in 6 ms
Reduce places removed 8 places and 8 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 664 resets, run finished after 322 ms. (steps per millisecond=310 ) properties seen :[1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1]
// Phase 1: matrix 570 rows 630 cols
[2020-05-12 03:57:12] [INFO ] Computed 100 place invariants in 35 ms
[2020-05-12 03:57:12] [INFO ] [Real]Absence check using 62 positive place invariants in 48 ms returned sat
[2020-05-12 03:57:12] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 22 ms returned sat
[2020-05-12 03:57:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:57:13] [INFO ] [Real]Absence check using state equation in 912 ms returned sat
[2020-05-12 03:57:14] [INFO ] Deduced a trap composed of 15 places in 375 ms
[2020-05-12 03:57:14] [INFO ] Deduced a trap composed of 11 places in 232 ms
[2020-05-12 03:57:14] [INFO ] Deduced a trap composed of 14 places in 228 ms
[2020-05-12 03:57:14] [INFO ] Deduced a trap composed of 15 places in 193 ms
[2020-05-12 03:57:15] [INFO ] Deduced a trap composed of 8 places in 183 ms
[2020-05-12 03:57:15] [INFO ] Deduced a trap composed of 22 places in 247 ms
[2020-05-12 03:57:15] [INFO ] Deduced a trap composed of 18 places in 192 ms
[2020-05-12 03:57:15] [INFO ] Deduced a trap composed of 16 places in 160 ms
[2020-05-12 03:57:15] [INFO ] Deduced a trap composed of 21 places in 158 ms
[2020-05-12 03:57:16] [INFO ] Deduced a trap composed of 22 places in 100 ms
[2020-05-12 03:57:16] [INFO ] Deduced a trap composed of 28 places in 761 ms
[2020-05-12 03:57:17] [INFO ] Deduced a trap composed of 18 places in 1011 ms
[2020-05-12 03:57:18] [INFO ] Deduced a trap composed of 16 places in 197 ms
[2020-05-12 03:57:18] [INFO ] Deduced a trap composed of 14 places in 324 ms
[2020-05-12 03:57:18] [INFO ] Deduced a trap composed of 24 places in 164 ms
[2020-05-12 03:57:18] [INFO ] Deduced a trap composed of 18 places in 139 ms
[2020-05-12 03:57:19] [INFO ] Deduced a trap composed of 25 places in 152 ms
[2020-05-12 03:57:19] [INFO ] Deduced a trap composed of 30 places in 74 ms
[2020-05-12 03:57:19] [INFO ] Deduced a trap composed of 32 places in 61 ms
[2020-05-12 03:57:19] [INFO ] Deduced a trap composed of 38 places in 53 ms
[2020-05-12 03:57:19] [INFO ] Deduced a trap composed of 36 places in 197 ms
[2020-05-12 03:57:19] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 5874 ms
[2020-05-12 03:57:19] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:57:19] [INFO ] [Nat]Absence check using 62 positive place invariants in 85 ms returned sat
[2020-05-12 03:57:19] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 20 ms returned sat
[2020-05-12 03:57:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:57:20] [INFO ] [Nat]Absence check using state equation in 695 ms returned sat
[2020-05-12 03:57:20] [INFO ] Deduced a trap composed of 8 places in 143 ms
[2020-05-12 03:57:20] [INFO ] Deduced a trap composed of 14 places in 105 ms
[2020-05-12 03:57:20] [INFO ] Deduced a trap composed of 18 places in 101 ms
[2020-05-12 03:57:21] [INFO ] Deduced a trap composed of 16 places in 166 ms
[2020-05-12 03:57:21] [INFO ] Deduced a trap composed of 22 places in 95 ms
[2020-05-12 03:57:21] [INFO ] Deduced a trap composed of 12 places in 167 ms
[2020-05-12 03:57:21] [INFO ] Deduced a trap composed of 30 places in 213 ms
[2020-05-12 03:57:21] [INFO ] Deduced a trap composed of 22 places in 125 ms
[2020-05-12 03:57:22] [INFO ] Deduced a trap composed of 22 places in 597 ms
[2020-05-12 03:57:22] [INFO ] Deduced a trap composed of 19 places in 115 ms
[2020-05-12 03:57:24] [INFO ] Deduced a trap composed of 24 places in 1398 ms
[2020-05-12 03:57:27] [INFO ] Deduced a trap composed of 25 places in 3442 ms
[2020-05-12 03:57:27] [INFO ] Deduced a trap composed of 28 places in 312 ms
[2020-05-12 03:57:28] [INFO ] Deduced a trap composed of 37 places in 136 ms
[2020-05-12 03:57:28] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 7532 ms
[2020-05-12 03:57:28] [INFO ] Computed and/alt/rep : 569/2553/569 causal constraints in 48 ms.
[2020-05-12 03:57:34] [INFO ] Added : 430 causal constraints over 86 iterations in 6081 ms. Result :sat
[2020-05-12 03:57:34] [INFO ] Deduced a trap composed of 32 places in 42 ms
[2020-05-12 03:57:34] [INFO ] Deduced a trap composed of 35 places in 41 ms
[2020-05-12 03:57:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 297 ms
[2020-05-12 03:57:34] [INFO ] [Real]Absence check using 62 positive place invariants in 45 ms returned sat
[2020-05-12 03:57:34] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 24 ms returned sat
[2020-05-12 03:57:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:57:35] [INFO ] [Real]Absence check using state equation in 762 ms returned sat
[2020-05-12 03:57:35] [INFO ] Deduced a trap composed of 8 places in 179 ms
[2020-05-12 03:57:35] [INFO ] Deduced a trap composed of 21 places in 164 ms
[2020-05-12 03:57:35] [INFO ] Deduced a trap composed of 45 places in 86 ms
[2020-05-12 03:57:36] [INFO ] Deduced a trap composed of 15 places in 67 ms
[2020-05-12 03:57:36] [INFO ] Deduced a trap composed of 11 places in 50 ms
[2020-05-12 03:57:36] [INFO ] Deduced a trap composed of 16 places in 45 ms
[2020-05-12 03:57:36] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 857 ms
[2020-05-12 03:57:36] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:57:36] [INFO ] [Nat]Absence check using 62 positive place invariants in 101 ms returned sat
[2020-05-12 03:57:36] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 43 ms returned sat
[2020-05-12 03:57:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:57:38] [INFO ] [Nat]Absence check using state equation in 1628 ms returned sat
[2020-05-12 03:57:38] [INFO ] Deduced a trap composed of 12 places in 357 ms
[2020-05-12 03:57:38] [INFO ] Deduced a trap composed of 15 places in 199 ms
[2020-05-12 03:57:38] [INFO ] Deduced a trap composed of 8 places in 95 ms
[2020-05-12 03:57:39] [INFO ] Deduced a trap composed of 20 places in 94 ms
[2020-05-12 03:57:39] [INFO ] Deduced a trap composed of 16 places in 59 ms
[2020-05-12 03:57:39] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1016 ms
[2020-05-12 03:57:39] [INFO ] Computed and/alt/rep : 569/2553/569 causal constraints in 62 ms.
[2020-05-12 03:57:41] [INFO ] Added : 267 causal constraints over 55 iterations in 2445 ms. Result :sat
[2020-05-12 03:57:41] [INFO ] [Real]Absence check using 62 positive place invariants in 38 ms returned sat
[2020-05-12 03:57:41] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 23 ms returned sat
[2020-05-12 03:57:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:57:42] [INFO ] [Real]Absence check using state equation in 859 ms returned sat
[2020-05-12 03:57:44] [INFO ] Deduced a trap composed of 8 places in 1440 ms
[2020-05-12 03:57:45] [INFO ] Deduced a trap composed of 21 places in 980 ms
[2020-05-12 03:57:45] [INFO ] Deduced a trap composed of 45 places in 151 ms
[2020-05-12 03:57:45] [INFO ] Deduced a trap composed of 15 places in 120 ms
[2020-05-12 03:57:48] [INFO ] Deduced a trap composed of 11 places in 2547 ms
[2020-05-12 03:57:49] [INFO ] Deduced a trap composed of 16 places in 1768 ms
[2020-05-12 03:57:49] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 7177 ms
[2020-05-12 03:57:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:57:50] [INFO ] [Nat]Absence check using 62 positive place invariants in 160 ms returned sat
[2020-05-12 03:57:50] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 36 ms returned sat
[2020-05-12 03:57:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:57:52] [INFO ] [Nat]Absence check using state equation in 1964 ms returned sat
[2020-05-12 03:58:00] [INFO ] Deduced a trap composed of 12 places in 7975 ms
[2020-05-12 03:58:01] [INFO ] Deduced a trap composed of 15 places in 831 ms
[2020-05-12 03:58:03] [INFO ] Deduced a trap composed of 8 places in 2184 ms
[2020-05-12 03:58:03] [INFO ] Deduced a trap composed of 20 places in 338 ms
[2020-05-12 03:58:05] [INFO ] Deduced a trap composed of 16 places in 2136 ms
[2020-05-12 03:58:05] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 13613 ms
[2020-05-12 03:58:05] [INFO ] Computed and/alt/rep : 569/2553/569 causal constraints in 63 ms.
[2020-05-12 03:58:08] [INFO ] Added : 267 causal constraints over 55 iterations in 3035 ms. Result :sat
[2020-05-12 03:58:09] [INFO ] [Real]Absence check using 62 positive place invariants in 328 ms returned sat
[2020-05-12 03:58:09] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 44 ms returned sat
[2020-05-12 03:58:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:58:10] [INFO ] [Real]Absence check using state equation in 677 ms returned sat
[2020-05-12 03:58:10] [INFO ] Deduced a trap composed of 18 places in 200 ms
[2020-05-12 03:58:10] [INFO ] Deduced a trap composed of 8 places in 190 ms
[2020-05-12 03:58:11] [INFO ] Deduced a trap composed of 11 places in 1102 ms
[2020-05-12 03:58:13] [INFO ] Deduced a trap composed of 20 places in 1973 ms
[2020-05-12 03:58:19] [INFO ] Deduced a trap composed of 15 places in 5376 ms
[2020-05-12 03:58:22] [INFO ] Deduced a trap composed of 19 places in 2989 ms
[2020-05-12 03:58:25] [INFO ] Deduced a trap composed of 27 places in 3057 ms
[2020-05-12 03:58:27] [INFO ] Deduced a trap composed of 31 places in 2599 ms
[2020-05-12 03:58:30] [INFO ] Deduced a trap composed of 47 places in 2153 ms
[2020-05-12 03:58:30] [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 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s37 s38 s39 s40 s41 s47 s48 s51 s76 s79 s80 s313 s318 s328 s358 s433 s477 s478 s511 s512 s552 s553 s579 s580) 0)") while checking expression at index 3
[2020-05-12 03:58:30] [INFO ] [Real]Absence check using 62 positive place invariants in 238 ms returned sat
[2020-05-12 03:58:30] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 122 ms returned sat
[2020-05-12 03:58:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:58:34] [INFO ] [Real]Absence check using state equation in 3793 ms returned sat
[2020-05-12 03:58:38] [INFO ] Deduced a trap composed of 8 places in 4358 ms
[2020-05-12 03:58:43] [INFO ] Deduced a trap composed of 15 places in 5091 ms
[2020-05-12 03:58:50] [INFO ] Deduced a trap composed of 12 places in 6828 ms
[2020-05-12 03:58:50] [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 s238 s239 s240 s247 s250 s437 s438 s439 s443) 0)") while checking expression at index 4
[2020-05-12 03:58:51] [INFO ] [Real]Absence check using 62 positive place invariants in 215 ms returned sat
[2020-05-12 03:58:51] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 161 ms returned sat
[2020-05-12 03:58:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:58:55] [INFO ] [Real]Absence check using state equation in 4095 ms returned sat
[2020-05-12 03:58:59] [INFO ] Deduced a trap composed of 16 places in 4213 ms
[2020-05-12 03:59:00] [INFO ] Deduced a trap composed of 17 places in 533 ms
[2020-05-12 03:59:00] [INFO ] Deduced a trap composed of 16 places in 288 ms
[2020-05-12 03:59:00] [INFO ] Deduced a trap composed of 12 places in 308 ms
[2020-05-12 03:59:01] [INFO ] Deduced a trap composed of 143 places in 161 ms
[2020-05-12 03:59:01] [INFO ] Deduced a trap composed of 142 places in 183 ms
[2020-05-12 03:59:01] [INFO ] Deduced a trap composed of 136 places in 159 ms
[2020-05-12 03:59:03] [INFO ] Deduced a trap composed of 147 places in 2499 ms
[2020-05-12 03:59:08] [INFO ] Deduced a trap composed of 36 places in 4469 ms
[2020-05-12 03:59:13] [INFO ] Deduced a trap composed of 138 places in 4821 ms
[2020-05-12 03:59: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 s35 s36 s81 s82 s136 s137 s138 s142 s143 s144 s166 s167 s168 s173 s177 s183 s202 s211 s220 s221 s222 s247 s250 s289 s290 s291 s303 s308 s312 s313 s314 s317 s319 s332 s334 s337 s339 s353 s358 s363 s372 s374 s382 s383 s384 s387 s388 s389 s398 s407 s408 s409 s412 s414 s428 s433 s438 s443 s447 s448 s449 s450 s451 s452 s453 s456 s457 s458 s459 s460 s461 s490 s491 s494 s495 s496 s497 s498 s499 s500 s505 s506 s517 s518 s521 s522 s529 s530 s532 s533 s538 s539 s550 s551 s552 s553 s558 s559 s560 s563 s564 s568 s569 s570 s572 s573 s574 s575 s576 s581 s582 s583 s584 s585 s586 s587 s588 s591 s592 s595 s599 s607 s608 s609 s610 s611 s616 s617 s618 s625 s626) 0)") while checking expression at index 5
[2020-05-12 03:59:13] [INFO ] [Real]Absence check using 62 positive place invariants in 143 ms returned sat
[2020-05-12 03:59:13] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 64 ms returned sat
[2020-05-12 03:59:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:59:17] [INFO ] [Real]Absence check using state equation in 3341 ms returned sat
[2020-05-12 03:59:22] [INFO ] Deduced a trap composed of 19 places in 4941 ms
[2020-05-12 03:59:25] [INFO ] Deduced a trap composed of 13 places in 3908 ms
[2020-05-12 03:59:29] [INFO ] Deduced a trap composed of 11 places in 3903 ms
[2020-05-12 03:59:34] [INFO ] Deduced a trap composed of 14 places in 4443 ms
[2020-05-12 03:59:34] [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 s9 s217 s327 s328 s329) 0)") while checking expression at index 6
[2020-05-12 03:59:34] [INFO ] [Real]Absence check using 62 positive place invariants in 218 ms returned sat
[2020-05-12 03:59:34] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 94 ms returned sat
[2020-05-12 03:59:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:59:38] [INFO ] [Real]Absence check using state equation in 3511 ms returned sat
[2020-05-12 03:59:44] [INFO ] Deduced a trap composed of 8 places in 6436 ms
[2020-05-12 03:59:51] [INFO ] Deduced a trap composed of 129 places in 6089 ms
[2020-05-12 03:59:56] [INFO ] Deduced a trap composed of 127 places in 5275 ms
[2020-05-12 03:59:56] [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 s47 s48 s51 s60 s61 s125 s126 s127 s148 s149 s150 s154 s155 s156 s160 s161 s162 s171 s183 s186 s189 s190 s238 s239 s240 s247 s250 s290 s294 s295 s296 s317 s319 s322 s324 s328 s332 s334 s342 s344 s347 s348 s349 s352 s353 s354 s362 s363 s364 s373 s378 s382 s383 s384 s387 s388 s389 s393 s407 s408 s409 s413 s418 s432 s433 s434 s443 s447 s450 s451 s452 s453 s456 s457 s458 s459 s462 s463 s468 s469 s470 s488 s489 s490 s491 s494 s495 s496 s497 s498 s517 s518 s519 s520 s521 s522 s529 s530 s536 s537 s540 s541 s542 s543 s546 s547 s550 s551 s561 s563 s565 s568 s575 s576 s579 s580 s587 s588 s589 s590 s595 s615 s618 s624) 0)") while checking expression at index 7
[2020-05-12 03:59:56] [INFO ] [Real]Absence check using 62 positive place invariants in 254 ms returned sat
[2020-05-12 03:59:56] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 85 ms returned sat
[2020-05-12 03:59:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:00:00] [INFO ] [Real]Absence check using state equation in 3353 ms returned sat
[2020-05-12 04:00:04] [INFO ] Deduced a trap composed of 8 places in 4078 ms
[2020-05-12 04:00:08] [INFO ] Deduced a trap composed of 11 places in 4313 ms
[2020-05-12 04:00:13] [INFO ] Deduced a trap composed of 123 places in 4770 ms
[2020-05-12 04:00:19] [INFO ] Deduced a trap composed of 19 places in 5672 ms
[2020-05-12 04:00:19] [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 s232 s233 s234 s247 s250 s342 s343 s344 s348 s438 s443 s498 s499 s500 s591 s592) 0)") while checking expression at index 8
[2020-05-12 04:00:19] [INFO ] [Real]Absence check using 62 positive place invariants in 233 ms returned sat
[2020-05-12 04:00:19] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 163 ms returned sat
[2020-05-12 04:00:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:00:22] [INFO ] [Real]Absence check using state equation in 3255 ms returned sat
[2020-05-12 04:00:29] [INFO ] Deduced a trap composed of 8 places in 6120 ms
[2020-05-12 04:00:34] [INFO ] Deduced a trap composed of 13 places in 5495 ms
[2020-05-12 04:00:40] [INFO ] Deduced a trap composed of 11 places in 5790 ms
[2020-05-12 04:00:40] [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 s247 s250 s437 s438 s439 s443 s591 s592) 0)") while checking expression at index 9
[2020-05-12 04:00:40] [INFO ] [Real]Absence check using 62 positive place invariants in 272 ms returned sat
[2020-05-12 04:00:40] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 103 ms returned sat
[2020-05-12 04:00:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:00:44] [INFO ] [Real]Absence check using state equation in 3479 ms returned sat
[2020-05-12 04:00:47] [INFO ] Deduced a trap composed of 14 places in 3161 ms
[2020-05-12 04:00:50] [INFO ] Deduced a trap composed of 17 places in 2995 ms
[2020-05-12 04:00:53] [INFO ] Deduced a trap composed of 16 places in 2511 ms
[2020-05-12 04:00:56] [INFO ] Deduced a trap composed of 15 places in 3610 ms
[2020-05-12 04:01:01] [INFO ] Deduced a trap composed of 23 places in 4947 ms
[2020-05-12 04:01:01] [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 s120 s121 s122 s251 s252 s253 s254 s255 s256 s257 s258 s259 s260 s261 s387 s388 s389 s391 s393 s394 s395) 0)") while checking expression at index 10
[2020-05-12 04:01:02] [INFO ] [Real]Absence check using 62 positive place invariants in 214 ms returned sat
[2020-05-12 04:01:02] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 62 ms returned sat
[2020-05-12 04:01:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:01:05] [INFO ] [Real]Absence check using state equation in 3152 ms returned unsat
[2020-05-12 04:01:05] [INFO ] [Real]Absence check using 62 positive place invariants in 224 ms returned sat
[2020-05-12 04:01:05] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 178 ms returned sat
[2020-05-12 04:01:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:01:08] [INFO ] [Real]Absence check using state equation in 2074 ms returned unsat
[2020-05-12 04:01:08] [INFO ] [Real]Absence check using 62 positive place invariants in 282 ms returned sat
[2020-05-12 04:01:08] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 162 ms returned sat
[2020-05-12 04:01:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:01:12] [INFO ] [Real]Absence check using state equation in 3761 ms returned sat
[2020-05-12 04:01:16] [INFO ] Deduced a trap composed of 16 places in 4309 ms
[2020-05-12 04:01:22] [INFO ] Deduced a trap composed of 19 places in 5202 ms
[2020-05-12 04:01:24] [INFO ] Deduced a trap composed of 11 places in 2694 ms
[2020-05-12 04:01:24] [INFO ] Deduced a trap composed of 31 places in 164 ms
[2020-05-12 04:01:25] [INFO ] Deduced a trap composed of 15 places in 243 ms
[2020-05-12 04:01:25] [INFO ] Deduced a trap composed of 23 places in 172 ms
[2020-05-12 04:01:25] [INFO ] Deduced a trap composed of 34 places in 158 ms
[2020-05-12 04:01:28] [INFO ] Deduced a trap composed of 31 places in 2533 ms
[2020-05-12 04:01: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 s53 s56 s57 s60 s61 s67 s68 s238 s239 s240 s251 s294 s295 s296 s332 s333 s334 s338 s343 s348 s438 s441 s443 s444 s445 s583 s584 s587 s588) 0)") while checking expression at index 13
[2020-05-12 04:01:28] [INFO ] [Real]Absence check using 62 positive place invariants in 283 ms returned sat
[2020-05-12 04:01:28] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 47 ms returned sat
[2020-05-12 04:01:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:01:29] [INFO ] [Real]Absence check using state equation in 784 ms returned sat
[2020-05-12 04:01:33] [INFO ] Deduced a trap composed of 11 places in 3612 ms
[2020-05-12 04:01:33] [INFO ] Deduced a trap composed of 8 places in 424 ms
[2020-05-12 04:01:33] [INFO ] Deduced a trap composed of 16 places in 228 ms
[2020-05-12 04:01:37] [INFO ] Deduced a trap composed of 23 places in 3871 ms
[2020-05-12 04:01:38] [INFO ] Deduced a trap composed of 42 places in 387 ms
[2020-05-12 04:01:38] [INFO ] Deduced a trap composed of 15 places in 347 ms
[2020-05-12 04:01:40] [INFO ] Deduced a trap composed of 21 places in 2186 ms
[2020-05-12 04:01:40] [INFO ] Deduced a trap composed of 34 places in 120 ms
[2020-05-12 04:01:41] [INFO ] Deduced a trap composed of 48 places in 319 ms
[2020-05-12 04:01:41] [INFO ] Deduced a trap composed of 17 places in 527 ms
[2020-05-12 04:01:41] [INFO ] Deduced a trap composed of 15 places in 204 ms
[2020-05-12 04:01:42] [INFO ] Deduced a trap composed of 23 places in 603 ms
[2020-05-12 04:01:42] [INFO ] Deduced a trap composed of 63 places in 191 ms
[2020-05-12 04:01:44] [INFO ] Deduced a trap composed of 27 places in 1845 ms
[2020-05-12 04:01:44] [INFO ] Deduced a trap composed of 89 places in 211 ms
[2020-05-12 04:01:45] [INFO ] Deduced a trap composed of 92 places in 203 ms
[2020-05-12 04:01:45] [INFO ] Deduced a trap composed of 95 places in 222 ms
[2020-05-12 04:01:45] [INFO ] Deduced a trap composed of 31 places in 142 ms
[2020-05-12 04:01:45] [INFO ] Deduced a trap composed of 32 places in 123 ms
[2020-05-12 04:01:45] [INFO ] Deduced a trap composed of 45 places in 140 ms
[2020-05-12 04:01:45] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 16538 ms
[2020-05-12 04:01:45] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 04:01:46] [INFO ] [Nat]Absence check using 62 positive place invariants in 93 ms returned sat
[2020-05-12 04:01:46] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 39 ms returned sat
[2020-05-12 04:01:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 04:01:47] [INFO ] [Nat]Absence check using state equation in 1628 ms returned sat
[2020-05-12 04:01:48] [INFO ] Deduced a trap composed of 14 places in 233 ms
[2020-05-12 04:01:48] [INFO ] Deduced a trap composed of 12 places in 173 ms
[2020-05-12 04:01:48] [INFO ] Deduced a trap composed of 8 places in 169 ms
[2020-05-12 04:01:48] [INFO ] Deduced a trap composed of 16 places in 194 ms
[2020-05-12 04:01:48] [INFO ] Deduced a trap composed of 37 places in 168 ms
[2020-05-12 04:01:49] [INFO ] Deduced a trap composed of 41 places in 164 ms
[2020-05-12 04:01:49] [INFO ] Deduced a trap composed of 15 places in 104 ms
[2020-05-12 04:01:49] [INFO ] Deduced a trap composed of 48 places in 105 ms
[2020-05-12 04:01:49] [INFO ] Deduced a trap composed of 19 places in 66 ms
[2020-05-12 04:01:49] [INFO ] Deduced a trap composed of 43 places in 65 ms
[2020-05-12 04:01:49] [INFO ] Deduced a trap composed of 48 places in 65 ms
[2020-05-12 04:01:49] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1900 ms
[2020-05-12 04:01:49] [INFO ] Computed and/alt/rep : 569/2553/569 causal constraints in 53 ms.
[2020-05-12 04:01:53] [INFO ] Added : 410 causal constraints over 83 iterations in 4253 ms. Result :sat
[2020-05-12 04:01:54] [INFO ] [Real]Absence check using 62 positive place invariants in 356 ms returned sat
[2020-05-12 04:01:54] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 52 ms returned sat
[2020-05-12 04:01:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:01:55] [INFO ] [Real]Absence check using state equation in 786 ms returned sat
[2020-05-12 04:01:59] [INFO ] Deduced a trap composed of 8 places in 3880 ms
[2020-05-12 04:02:03] [INFO ] Deduced a trap composed of 11 places in 4500 ms
[2020-05-12 04:02:04] [INFO ] Deduced a trap composed of 21 places in 550 ms
[2020-05-12 04:02:04] [INFO ] Deduced a trap composed of 17 places in 385 ms
[2020-05-12 04:02:05] [INFO ] Deduced a trap composed of 14 places in 361 ms
[2020-05-12 04:02:08] [INFO ] Deduced a trap composed of 38 places in 3754 ms
[2020-05-12 04:02:13] [INFO ] Deduced a trap composed of 15 places in 4775 ms
[2020-05-12 04:02:17] [INFO ] Deduced a trap composed of 19 places in 3775 ms
[2020-05-12 04:02:17] [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 s9 s10 s11 s12 s157 s317 s318 s319 s552 s553) 0)") while checking expression at index 15
[2020-05-12 04:02:17] [INFO ] [Real]Absence check using 62 positive place invariants in 50 ms returned unsat
[2020-05-12 04:02:18] [INFO ] [Real]Absence check using 62 positive place invariants in 193 ms returned sat
[2020-05-12 04:02:18] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 128 ms returned sat
[2020-05-12 04:02:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:02:19] [INFO ] [Real]Absence check using state equation in 1140 ms returned sat
[2020-05-12 04:02:19] [INFO ] Deduced a trap composed of 108 places in 432 ms
[2020-05-12 04:02:20] [INFO ] Deduced a trap composed of 8 places in 355 ms
[2020-05-12 04:02:20] [INFO ] Deduced a trap composed of 116 places in 207 ms
[2020-05-12 04:02:20] [INFO ] Deduced a trap composed of 13 places in 189 ms
[2020-05-12 04:02:20] [INFO ] Deduced a trap composed of 118 places in 186 ms
[2020-05-12 04:02:21] [INFO ] Deduced a trap composed of 15 places in 203 ms
[2020-05-12 04:02:21] [INFO ] Deduced a trap composed of 12 places in 116 ms
[2020-05-12 04:02:21] [INFO ] Deduced a trap composed of 24 places in 130 ms
[2020-05-12 04:02:21] [INFO ] Deduced a trap composed of 35 places in 78 ms
[2020-05-12 04:02:21] [INFO ] Deduced a trap composed of 52 places in 95 ms
[2020-05-12 04:02:21] [INFO ] Deduced a trap composed of 17 places in 94 ms
[2020-05-12 04:02:21] [INFO ] Deduced a trap composed of 62 places in 94 ms
[2020-05-12 04:02:21] [INFO ] Deduced a trap composed of 42 places in 87 ms
[2020-05-12 04:02:22] [INFO ] Deduced a trap composed of 44 places in 91 ms
[2020-05-12 04:02:22] [INFO ] Deduced a trap composed of 16 places in 52 ms
[2020-05-12 04:02:22] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2898 ms
[2020-05-12 04:02:22] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 04:02:22] [INFO ] [Nat]Absence check using 62 positive place invariants in 66 ms returned sat
[2020-05-12 04:02:22] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 23 ms returned sat
[2020-05-12 04:02:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 04:02:23] [INFO ] [Nat]Absence check using state equation in 786 ms returned sat
[2020-05-12 04:02:23] [INFO ] Deduced a trap composed of 15 places in 214 ms
[2020-05-12 04:02:23] [INFO ] Deduced a trap composed of 8 places in 199 ms
[2020-05-12 04:02:23] [INFO ] Deduced a trap composed of 13 places in 197 ms
[2020-05-12 04:02:24] [INFO ] Deduced a trap composed of 11 places in 227 ms
[2020-05-12 04:02:24] [INFO ] Deduced a trap composed of 8 places in 319 ms
[2020-05-12 04:02:24] [INFO ] Deduced a trap composed of 17 places in 341 ms
[2020-05-12 04:02:25] [INFO ] Deduced a trap composed of 19 places in 337 ms
[2020-05-12 04:02:25] [INFO ] Deduced a trap composed of 122 places in 334 ms
[2020-05-12 04:02:25] [INFO ] Deduced a trap composed of 16 places in 333 ms
[2020-05-12 04:02:26] [INFO ] Deduced a trap composed of 19 places in 327 ms
[2020-05-12 04:02:26] [INFO ] Deduced a trap composed of 15 places in 335 ms
[2020-05-12 04:02:26] [INFO ] Deduced a trap composed of 46 places in 179 ms
[2020-05-12 04:02:27] [INFO ] Deduced a trap composed of 63 places in 177 ms
[2020-05-12 04:02:27] [INFO ] Deduced a trap composed of 29 places in 143 ms
[2020-05-12 04:02:27] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 4070 ms
[2020-05-12 04:02:27] [INFO ] Computed and/alt/rep : 569/2553/569 causal constraints in 26 ms.
[2020-05-12 04:02:30] [INFO ] Added : 332 causal constraints over 67 iterations in 3176 ms. Result :sat
[2020-05-12 04:02:30] [INFO ] [Real]Absence check using 62 positive place invariants in 61 ms returned sat
[2020-05-12 04:02:30] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 40 ms returned sat
[2020-05-12 04:02:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:02:33] [INFO ] [Real]Absence check using state equation in 3273 ms returned sat
[2020-05-12 04:02:34] [INFO ] Deduced a trap composed of 20 places in 201 ms
[2020-05-12 04:02:34] [INFO ] Deduced a trap composed of 8 places in 158 ms
[2020-05-12 04:02:34] [INFO ] Deduced a trap composed of 119 places in 201 ms
[2020-05-12 04:02:34] [INFO ] Deduced a trap composed of 112 places in 202 ms
[2020-05-12 04:02:35] [INFO ] Deduced a trap composed of 12 places in 157 ms
[2020-05-12 04:02:35] [INFO ] Deduced a trap composed of 13 places in 152 ms
[2020-05-12 04:02:35] [INFO ] Deduced a trap composed of 8 places in 170 ms
[2020-05-12 04:02:35] [INFO ] Deduced a trap composed of 18 places in 173 ms
[2020-05-12 04:02:35] [INFO ] Deduced a trap composed of 27 places in 151 ms
[2020-05-12 04:02:36] [INFO ] Deduced a trap composed of 35 places in 160 ms
[2020-05-12 04:02:36] [INFO ] Deduced a trap composed of 52 places in 153 ms
[2020-05-12 04:02:36] [INFO ] Deduced a trap composed of 57 places in 163 ms
[2020-05-12 04:02:36] [INFO ] Deduced a trap composed of 126 places in 149 ms
[2020-05-12 04:02:36] [INFO ] Deduced a trap composed of 23 places in 185 ms
[2020-05-12 04:02:37] [INFO ] Deduced a trap composed of 17 places in 157 ms
[2020-05-12 04:02:37] [INFO ] Deduced a trap composed of 27 places in 157 ms
[2020-05-12 04:02:37] [INFO ] Deduced a trap composed of 49 places in 158 ms
[2020-05-12 04:02:37] [INFO ] Deduced a trap composed of 31 places in 170 ms
[2020-05-12 04:02:37] [INFO ] Deduced a trap composed of 59 places in 174 ms
[2020-05-12 04:02:37] [INFO ] Deduced a trap composed of 43 places in 147 ms
[2020-05-12 04:02:38] [INFO ] Deduced a trap composed of 19 places in 38 ms
[2020-05-12 04:02:38] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 4108 ms
[2020-05-12 04:02:38] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 04:02:38] [INFO ] [Nat]Absence check using 62 positive place invariants in 65 ms returned sat
[2020-05-12 04:02:38] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 22 ms returned sat
[2020-05-12 04:02:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 04:02:39] [INFO ] [Nat]Absence check using state equation in 843 ms returned sat
[2020-05-12 04:02:39] [INFO ] Deduced a trap composed of 8 places in 389 ms
[2020-05-12 04:02:39] [INFO ] Deduced a trap composed of 8 places in 332 ms
[2020-05-12 04:02:40] [INFO ] Deduced a trap composed of 126 places in 340 ms
[2020-05-12 04:02:40] [INFO ] Deduced a trap composed of 11 places in 352 ms
[2020-05-12 04:02:40] [INFO ] Deduced a trap composed of 19 places in 186 ms
[2020-05-12 04:02:41] [INFO ] Deduced a trap composed of 123 places in 327 ms
[2020-05-12 04:02:41] [INFO ] Deduced a trap composed of 15 places in 307 ms
[2020-05-12 04:02:46] [INFO ] Deduced a trap composed of 36 places in 5272 ms
[2020-05-12 04:02:50] [INFO ] Deduced a trap composed of 21 places in 3237 ms
[2020-05-12 04:02:53] [INFO ] Deduced a trap composed of 119 places in 3217 ms
[2020-05-12 04:02:57] [INFO ] Deduced a trap composed of 30 places in 4407 ms
[2020-05-12 04:02:58] [INFO ] Deduced a trap composed of 16 places in 197 ms
[2020-05-12 04:02:58] [INFO ] Deduced a trap composed of 133 places in 177 ms
[2020-05-12 04:02:58] [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 s29 s30 s35 s63 s64 s67 s68 s74 s75 s86 s88 s89 s114 s115 s116 s120 s121 s122 s125 s126 s130 s142 s143 s144 s148 s149 s150 s223 s226 s227 s228 s238 s239 s240 s294 s295 s296 s303 s308 s312 s314 s317 s318 s319 s353 s357 s358 s359 s363 s368 s373 s387 s388 s389 s403 s422 s423 s424 s428 s438 s443 s447 s448 s449 s450 s451 s452 s453 s456 s457 s458 s459 s460 s461 s466 s467 s468 s469 s470 s475 s476 s481 s482 s483 s484 s485 s488 s489 s490 s491 s492 s493 s496 s497 s511 s512 s517 s518 s519 s520 s521 s522 s531 s534 s535 s536 s537 s548 s549 s556 s557 s577 s578 s579 s580 s581 s582 s585 s586 s587 s588 s595 s600 s601) 0)") while checking expression at index 18
[2020-05-12 04:02:58] [INFO ] [Real]Absence check using 62 positive place invariants in 182 ms returned sat
[2020-05-12 04:02:58] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 61 ms returned sat
[2020-05-12 04:02:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:03:02] [INFO ] [Real]Absence check using state equation in 3532 ms returned sat
[2020-05-12 04:03:06] [INFO ] Deduced a trap composed of 18 places in 4271 ms
[2020-05-12 04:03:06] [INFO ] Deduced a trap composed of 14 places in 148 ms
[2020-05-12 04:03:06] [INFO ] Deduced a trap composed of 15 places in 141 ms
[2020-05-12 04:03:06] [INFO ] Deduced a trap composed of 13 places in 142 ms
[2020-05-12 04:03:07] [INFO ] Deduced a trap composed of 13 places in 181 ms
[2020-05-12 04:03:07] [INFO ] Deduced a trap composed of 12 places in 845 ms
[2020-05-12 04:03:08] [INFO ] Deduced a trap composed of 32 places in 633 ms
[2020-05-12 04:03:08] [INFO ] Deduced a trap composed of 37 places in 263 ms
[2020-05-12 04:03:09] [INFO ] Deduced a trap composed of 36 places in 998 ms
[2020-05-12 04:03:10] [INFO ] Deduced a trap composed of 70 places in 191 ms
[2020-05-12 04:03:10] [INFO ] Deduced a trap composed of 78 places in 186 ms
[2020-05-12 04:03:10] [INFO ] Deduced a trap composed of 40 places in 184 ms
[2020-05-12 04:03:10] [INFO ] Deduced a trap composed of 78 places in 182 ms
[2020-05-12 04:03:10] [INFO ] Deduced a trap composed of 40 places in 180 ms
[2020-05-12 04:03:11] [INFO ] Deduced a trap composed of 71 places in 206 ms
[2020-05-12 04:03:11] [INFO ] Deduced a trap composed of 16 places in 478 ms
[2020-05-12 04:03:11] [INFO ] Deduced a trap composed of 44 places in 130 ms
[2020-05-12 04:03:11] [INFO ] Deduced a trap composed of 42 places in 73 ms
[2020-05-12 04:03:12] [INFO ] Deduced a trap composed of 22 places in 75 ms
[2020-05-12 04:03:12] [INFO ] Deduced a trap composed of 55 places in 229 ms
[2020-05-12 04:03:12] [INFO ] Deduced a trap composed of 54 places in 121 ms
[2020-05-12 04:03:13] [INFO ] Deduced a trap composed of 55 places in 919 ms
[2020-05-12 04:03:13] [INFO ] Deduced a trap composed of 62 places in 132 ms
[2020-05-12 04:03:13] [INFO ] Deduced a trap composed of 52 places in 403 ms
[2020-05-12 04:03:14] [INFO ] Deduced a trap composed of 56 places in 476 ms
[2020-05-12 04:03:15] [INFO ] Deduced a trap composed of 60 places in 523 ms
[2020-05-12 04:03:15] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 12938 ms
[2020-05-12 04:03:15] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 04:03:15] [INFO ] [Nat]Absence check using 62 positive place invariants in 102 ms returned sat
[2020-05-12 04:03:15] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 38 ms returned sat
[2020-05-12 04:03:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 04:03:17] [INFO ] [Nat]Absence check using state equation in 1794 ms returned sat
[2020-05-12 04:03:17] [INFO ] Deduced a trap composed of 18 places in 190 ms
[2020-05-12 04:03:17] [INFO ] Deduced a trap composed of 14 places in 135 ms
[2020-05-12 04:03:17] [INFO ] Deduced a trap composed of 15 places in 211 ms
[2020-05-12 04:03:18] [INFO ] Deduced a trap composed of 12 places in 196 ms
[2020-05-12 04:03:22] [INFO ] Deduced a trap composed of 13 places in 4087 ms
[2020-05-12 04:03:25] [INFO ] Deduced a trap composed of 12 places in 2957 ms
[2020-05-12 04:03:29] [INFO ] Deduced a trap composed of 32 places in 4086 ms
[2020-05-12 04:03:33] [INFO ] Deduced a trap composed of 37 places in 4583 ms
[2020-05-12 04:03:33] [INFO ] Deduced a trap composed of 34 places in 128 ms
[2020-05-12 04:03:35] [INFO ] Deduced a trap composed of 68 places in 1455 ms
[2020-05-12 04:03:35] [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 s51 s52 s60 s61 s148 s149 s150 s154 s155 s156 s183 s186 s187 s188 s232 s233 s234 s238 s239 s240 s251 s290 s295 s322 s323 s324 s327 s328 s329 s333 s338 s343 s348 s367 s368 s369 s407 s408 s409 s413 s417 s418 s419 s423 s438 s441 s443 s444 s445 s464 s465 s468 s498 s499 s500 s559 s561 s563 s565 s568 s583 s584 s609 s615 s621 s624) 0)") while checking expression at index 19
[2020-05-12 04:03:35] [INFO ] [Real]Absence check using 62 positive place invariants in 397 ms returned sat
[2020-05-12 04:03:36] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 90 ms returned sat
[2020-05-12 04:03:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:03:38] [INFO ] [Real]Absence check using state equation in 2539 ms returned sat
[2020-05-12 04:03:39] [INFO ] Deduced a trap composed of 21 places in 1316 ms
[2020-05-12 04:03:40] [INFO ] Deduced a trap composed of 36 places in 711 ms
[2020-05-12 04:03:44] [INFO ] Deduced a trap composed of 35 places in 4117 ms
[2020-05-12 04:03:45] [INFO ] Deduced a trap composed of 11 places in 113 ms
[2020-05-12 04:03:45] [INFO ] Deduced a trap composed of 49 places in 118 ms
[2020-05-12 04:03:45] [INFO ] Deduced a trap composed of 36 places in 134 ms
[2020-05-12 04:03:45] [INFO ] Deduced a trap composed of 39 places in 118 ms
[2020-05-12 04:03:45] [INFO ] Deduced a trap composed of 22 places in 119 ms
[2020-05-12 04:03:45] [INFO ] Deduced a trap composed of 92 places in 115 ms
[2020-05-12 04:03:46] [INFO ] Deduced a trap composed of 42 places in 242 ms
[2020-05-12 04:03:46] [INFO ] Deduced a trap composed of 39 places in 233 ms
[2020-05-12 04:03:46] [INFO ] Deduced a trap composed of 25 places in 181 ms
[2020-05-12 04:03:46] [INFO ] Deduced a trap composed of 48 places in 73 ms
[2020-05-12 04:03:46] [INFO ] Deduced a trap composed of 45 places in 86 ms
[2020-05-12 04:03:46] [INFO ] Deduced a trap composed of 32 places in 50 ms
[2020-05-12 04:03:46] [INFO ] Deduced a trap composed of 48 places in 130 ms
[2020-05-12 04:03:47] [INFO ] Deduced a trap composed of 18 places in 93 ms
[2020-05-12 04:03:47] [INFO ] Deduced a trap composed of 56 places in 90 ms
[2020-05-12 04:03:47] [INFO ] Deduced a trap composed of 41 places in 91 ms
[2020-05-12 04:03:47] [INFO ] Deduced a trap composed of 38 places in 86 ms
[2020-05-12 04:03:47] [INFO ] Deduced a trap composed of 36 places in 84 ms
[2020-05-12 04:03:47] [INFO ] Deduced a trap composed of 54 places in 83 ms
[2020-05-12 04:03:47] [INFO ] Deduced a trap composed of 51 places in 69 ms
[2020-05-12 04:03:47] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 9167 ms
[2020-05-12 04:03:47] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 04:03:48] [INFO ] [Nat]Absence check using 62 positive place invariants in 85 ms returned sat
[2020-05-12 04:03:48] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 23 ms returned sat
[2020-05-12 04:03:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 04:03:48] [INFO ] [Nat]Absence check using state equation in 830 ms returned sat
[2020-05-12 04:03:49] [INFO ] Deduced a trap composed of 12 places in 145 ms
[2020-05-12 04:03:49] [INFO ] Deduced a trap composed of 19 places in 144 ms
[2020-05-12 04:03:49] [INFO ] Deduced a trap composed of 50 places in 122 ms
[2020-05-12 04:03:49] [INFO ] Deduced a trap composed of 16 places in 120 ms
[2020-05-12 04:03:49] [INFO ] Deduced a trap composed of 53 places in 119 ms
[2020-05-12 04:03:49] [INFO ] Deduced a trap composed of 16 places in 113 ms
[2020-05-12 04:03:50] [INFO ] Deduced a trap composed of 8 places in 229 ms
[2020-05-12 04:03:50] [INFO ] Deduced a trap composed of 17 places in 106 ms
[2020-05-12 04:03:50] [INFO ] Deduced a trap composed of 19 places in 126 ms
[2020-05-12 04:03:50] [INFO ] Deduced a trap composed of 23 places in 96 ms
[2020-05-12 04:03:50] [INFO ] Deduced a trap composed of 46 places in 92 ms
[2020-05-12 04:03:50] [INFO ] Deduced a trap composed of 23 places in 197 ms
[2020-05-12 04:03:51] [INFO ] Deduced a trap composed of 16 places in 160 ms
[2020-05-12 04:03:51] [INFO ] Deduced a trap composed of 56 places in 105 ms
[2020-05-12 04:03:51] [INFO ] Deduced a trap composed of 26 places in 192 ms
[2020-05-12 04:03:51] [INFO ] Deduced a trap composed of 46 places in 199 ms
[2020-05-12 04:03:51] [INFO ] Deduced a trap composed of 32 places in 65 ms
[2020-05-12 04:03:51] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2802 ms
[2020-05-12 04:03:51] [INFO ] Computed and/alt/rep : 569/2553/569 causal constraints in 25 ms.
[2020-05-12 04:03:56] [INFO ] Added : 392 causal constraints over 79 iterations in 5111 ms. Result :sat
[2020-05-12 04:03:57] [INFO ] [Real]Absence check using 62 positive place invariants in 112 ms returned sat
[2020-05-12 04:03:57] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 71 ms returned sat
[2020-05-12 04:03:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:03:59] [INFO ] [Real]Absence check using state equation in 1926 ms returned sat
[2020-05-12 04:03:59] [INFO ] Deduced a trap composed of 15 places in 420 ms
[2020-05-12 04:04:00] [INFO ] Deduced a trap composed of 46 places in 904 ms
[2020-05-12 04:04:00] [INFO ] Deduced a trap composed of 8 places in 132 ms
[2020-05-12 04:04:05] [INFO ] Deduced a trap composed of 18 places in 4958 ms
[2020-05-12 04:04:05] [INFO ] Deduced a trap composed of 11 places in 210 ms
[2020-05-12 04:04:08] [INFO ] Deduced a trap composed of 16 places in 2403 ms
[2020-05-12 04:04:08] [INFO ] Deduced a trap composed of 22 places in 224 ms
[2020-05-12 04:04:08] [INFO ] Deduced a trap composed of 25 places in 228 ms
[2020-05-12 04:04:09] [INFO ] Deduced a trap composed of 15 places in 248 ms
[2020-05-12 04:04:09] [INFO ] Deduced a trap composed of 29 places in 203 ms
[2020-05-12 04:04:09] [INFO ] Deduced a trap composed of 42 places in 179 ms
[2020-05-12 04:04:09] [INFO ] Deduced a trap composed of 35 places in 103 ms
[2020-05-12 04:04:09] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 10564 ms
[2020-05-12 04:04:09] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 04:04:09] [INFO ] [Nat]Absence check using 62 positive place invariants in 104 ms returned sat
[2020-05-12 04:04:10] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 70 ms returned sat
[2020-05-12 04:04:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 04:04:11] [INFO ] [Nat]Absence check using state equation in 1284 ms returned sat
[2020-05-12 04:04:11] [INFO ] Deduced a trap composed of 8 places in 484 ms
[2020-05-12 04:04:12] [INFO ] Deduced a trap composed of 16 places in 169 ms
[2020-05-12 04:04:12] [INFO ] Deduced a trap composed of 11 places in 187 ms
[2020-05-12 04:04:12] [INFO ] Deduced a trap composed of 15 places in 169 ms
[2020-05-12 04:04:12] [INFO ] Deduced a trap composed of 14 places in 186 ms
[2020-05-12 04:04:12] [INFO ] Deduced a trap composed of 18 places in 177 ms
[2020-05-12 04:04:13] [INFO ] Deduced a trap composed of 22 places in 117 ms
[2020-05-12 04:04:13] [INFO ] Deduced a trap composed of 39 places in 219 ms
[2020-05-12 04:04:13] [INFO ] Deduced a trap composed of 22 places in 85 ms
[2020-05-12 04:04:13] [INFO ] Deduced a trap composed of 42 places in 134 ms
[2020-05-12 04:04:13] [INFO ] Deduced a trap composed of 49 places in 80 ms
[2020-05-12 04:04:13] [INFO ] Deduced a trap composed of 52 places in 77 ms
[2020-05-12 04:04:13] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2460 ms
[2020-05-12 04:04:13] [INFO ] Computed and/alt/rep : 569/2553/569 causal constraints in 26 ms.
[2020-05-12 04:04:17] [INFO ] Added : 387 causal constraints over 78 iterations in 4015 ms. Result :sat
[2020-05-12 04:04:18] [INFO ] Deduced a trap composed of 137 places in 581 ms
[2020-05-12 04:04:18] [INFO ] Deduced a trap composed of 142 places in 388 ms
[2020-05-12 04:04:19] [INFO ] Deduced a trap composed of 137 places in 176 ms
[2020-05-12 04:04:19] [INFO ] Deduced a trap composed of 156 places in 152 ms
[2020-05-12 04:04:19] [INFO ] Deduced a trap composed of 152 places in 178 ms
[2020-05-12 04:04:19] [INFO ] Deduced a trap composed of 145 places in 178 ms
[2020-05-12 04:04:20] [INFO ] Deduced a trap composed of 151 places in 431 ms
[2020-05-12 04:04:20] [INFO ] Deduced a trap composed of 149 places in 415 ms
[2020-05-12 04:04:24] [INFO ] Deduced a trap composed of 156 places in 3060 ms
[2020-05-12 04:04:25] [INFO ] Deduced a trap composed of 159 places in 1627 ms
[2020-05-12 04:04:26] [INFO ] Deduced a trap composed of 146 places in 283 ms
[2020-05-12 04:04:26] [INFO ] Deduced a trap composed of 142 places in 193 ms
[2020-05-12 04:04:26] [INFO ] Deduced a trap composed of 150 places in 311 ms
[2020-05-12 04:04:27] [INFO ] Deduced a trap composed of 157 places in 288 ms
[2020-05-12 04:04:27] [INFO ] Deduced a trap composed of 144 places in 174 ms
[2020-05-12 04:04:27] [INFO ] Deduced a trap composed of 149 places in 155 ms
[2020-05-12 04:04:27] [INFO ] Deduced a trap composed of 156 places in 156 ms
[2020-05-12 04:04:28] [INFO ] Deduced a trap composed of 156 places in 156 ms
[2020-05-12 04:04:28] [INFO ] Deduced a trap composed of 140 places in 157 ms
[2020-05-12 04:04:28] [INFO ] Deduced a trap composed of 141 places in 151 ms
[2020-05-12 04:04:28] [INFO ] Deduced a trap composed of 154 places in 167 ms
[2020-05-12 04:04:29] [INFO ] Deduced a trap composed of 155 places in 160 ms
[2020-05-12 04:04:29] [INFO ] Deduced a trap composed of 155 places in 153 ms
[2020-05-12 04:04:29] [INFO ] Deduced a trap composed of 146 places in 182 ms
[2020-05-12 04:04:29] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-12 04:04:30] [INFO ] Deduced a trap composed of 6 places in 308 ms
[2020-05-12 04:04:30] [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 s242) 0)") while checking expression at index 21
[2020-05-12 04:04:30] [INFO ] [Real]Absence check using 62 positive place invariants in 36 ms returned sat
[2020-05-12 04:04:30] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 23 ms returned sat
[2020-05-12 04:04:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:04:30] [INFO ] [Real]Absence check using state equation in 750 ms returned sat
[2020-05-12 04:04:31] [INFO ] Deduced a trap composed of 17 places in 103 ms
[2020-05-12 04:04:31] [INFO ] Deduced a trap composed of 23 places in 96 ms
[2020-05-12 04:04:31] [INFO ] Deduced a trap composed of 12 places in 94 ms
[2020-05-12 04:04:31] [INFO ] Deduced a trap composed of 15 places in 92 ms
[2020-05-12 04:04:31] [INFO ] Deduced a trap composed of 8 places in 92 ms
[2020-05-12 04:04:31] [INFO ] Deduced a trap composed of 22 places in 92 ms
[2020-05-12 04:04:31] [INFO ] Deduced a trap composed of 30 places in 95 ms
[2020-05-12 04:04:31] [INFO ] Deduced a trap composed of 13 places in 92 ms
[2020-05-12 04:04:31] [INFO ] Deduced a trap composed of 33 places in 93 ms
[2020-05-12 04:04:32] [INFO ] Deduced a trap composed of 26 places in 87 ms
[2020-05-12 04:04:32] [INFO ] Deduced a trap composed of 37 places in 94 ms
[2020-05-12 04:04:32] [INFO ] Deduced a trap composed of 37 places in 89 ms
[2020-05-12 04:04:32] [INFO ] Deduced a trap composed of 20 places in 90 ms
[2020-05-12 04:04:32] [INFO ] Deduced a trap composed of 28 places in 87 ms
[2020-05-12 04:04:32] [INFO ] Deduced a trap composed of 38 places in 97 ms
[2020-05-12 04:04:32] [INFO ] Deduced a trap composed of 24 places in 106 ms
[2020-05-12 04:04:32] [INFO ] Deduced a trap composed of 39 places in 86 ms
[2020-05-12 04:04:32] [INFO ] Deduced a trap composed of 27 places in 83 ms
[2020-05-12 04:04:33] [INFO ] Deduced a trap composed of 22 places in 79 ms
[2020-05-12 04:04:33] [INFO ] Deduced a trap composed of 42 places in 79 ms
[2020-05-12 04:04:33] [INFO ] Deduced a trap composed of 53 places in 77 ms
[2020-05-12 04:04:33] [INFO ] Deduced a trap composed of 44 places in 73 ms
[2020-05-12 04:04:33] [INFO ] Deduced a trap composed of 28 places in 79 ms
[2020-05-12 04:04:33] [INFO ] Deduced a trap composed of 31 places in 77 ms
[2020-05-12 04:04:33] [INFO ] Deduced a trap composed of 44 places in 86 ms
[2020-05-12 04:04:33] [INFO ] Deduced a trap composed of 39 places in 82 ms
[2020-05-12 04:04:33] [INFO ] Deduced a trap composed of 48 places in 70 ms
[2020-05-12 04:04:33] [INFO ] Deduced a trap composed of 26 places in 44 ms
[2020-05-12 04:04:33] [INFO ] Deduced a trap composed of 32 places in 34 ms
[2020-05-12 04:04:33] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 3065 ms
[2020-05-12 04:04:34] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 04:04:34] [INFO ] [Nat]Absence check using 62 positive place invariants in 132 ms returned sat
[2020-05-12 04:04:34] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 24 ms returned sat
[2020-05-12 04:04:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 04:04:35] [INFO ] [Nat]Absence check using state equation in 832 ms returned sat
[2020-05-12 04:04:35] [INFO ] Deduced a trap composed of 8 places in 116 ms
[2020-05-12 04:04:35] [INFO ] Deduced a trap composed of 14 places in 113 ms
[2020-05-12 04:04:35] [INFO ] Deduced a trap composed of 17 places in 100 ms
[2020-05-12 04:04:35] [INFO ] Deduced a trap composed of 39 places in 98 ms
[2020-05-12 04:04:35] [INFO ] Deduced a trap composed of 12 places in 99 ms
[2020-05-12 04:04:35] [INFO ] Deduced a trap composed of 35 places in 183 ms
[2020-05-12 04:04:36] [INFO ] Deduced a trap composed of 19 places in 96 ms
[2020-05-12 04:04:36] [INFO ] Deduced a trap composed of 26 places in 112 ms
[2020-05-12 04:04:36] [INFO ] Deduced a trap composed of 38 places in 108 ms
[2020-05-12 04:04:36] [INFO ] Deduced a trap composed of 27 places in 105 ms
[2020-05-12 04:04:36] [INFO ] Deduced a trap composed of 22 places in 98 ms
[2020-05-12 04:04:36] [INFO ] Deduced a trap composed of 33 places in 226 ms
[2020-05-12 04:04:36] [INFO ] Deduced a trap composed of 22 places in 93 ms
[2020-05-12 04:04:37] [INFO ] Deduced a trap composed of 39 places in 954 ms
[2020-05-12 04:04:38] [INFO ] Deduced a trap composed of 39 places in 90 ms
[2020-05-12 04:04:38] [INFO ] Deduced a trap composed of 20 places in 96 ms
[2020-05-12 04:04:38] [INFO ] Deduced a trap composed of 41 places in 90 ms
[2020-05-12 04:04:38] [INFO ] Deduced a trap composed of 43 places in 89 ms
[2020-05-12 04:04:38] [INFO ] Deduced a trap composed of 59 places in 92 ms
[2020-05-12 04:04:38] [INFO ] Deduced a trap composed of 42 places in 80 ms
[2020-05-12 04:04:38] [INFO ] Deduced a trap composed of 41 places in 80 ms
[2020-05-12 04:04:38] [INFO ] Deduced a trap composed of 23 places in 80 ms
[2020-05-12 04:04:38] [INFO ] Deduced a trap composed of 30 places in 82 ms
[2020-05-12 04:04:38] [INFO ] Deduced a trap composed of 27 places in 80 ms
[2020-05-12 04:04:38] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 3905 ms
[2020-05-12 04:04:39] [INFO ] Computed and/alt/rep : 569/2553/569 causal constraints in 28 ms.
[2020-05-12 04:04:43] [INFO ] Added : 424 causal constraints over 85 iterations in 4664 ms. Result :sat
[2020-05-12 04:04:47] [INFO ] Deduced a trap composed of 164 places in 3393 ms
[2020-05-12 04:04:49] [INFO ] Deduced a trap composed of 159 places in 1956 ms
[2020-05-12 04:04:52] [INFO ] Deduced a trap composed of 155 places in 3446 ms
[2020-05-12 04:04:53] [INFO ] Deduced a trap composed of 158 places in 1049 ms
[2020-05-12 04:04:55] [INFO ] Deduced a trap composed of 158 places in 1184 ms
[2020-05-12 04:04:55] [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 s29 s30 s31 s32 s35 s36 s44 s45 s47 s48 s51 s52 s74 s75 s81 s82 s86 s88 s89 s120 s121 s122 s125 s126 s130 s154 s155 s156 s166 s167 s168 s171 s175 s177 s180 s186 s187 s188 s196 s205 s214 s220 s221 s222 s251 s252 s253 s254 s255 s256 s257 s258 s290 s313 s338 s343 s348 s353 s368 s377 s378 s379 s383 s388 s403 s406 s408 s409 s410 s413 s417 s419 s423 s433 s438 s443 s447 s450 s451 s452 s453 s454 s455 s456 s457 s458 s459 s460 s461 s471 s472 s473 s474 s481 s482 s486 s487 s488 s489 s490 s491 s492 s493 s494 s495 s498 s499 s500 s501 s502 s503 s504 s507 s508 s509 s510 s515 s516 s517 s518 s519 s520 s525 s526 s531 s536 s537 s544 s545 s550 s551 s552 s553 s558 s561 s562 s564 s571 s572 s573 s583 s584 s587 s588 s591 s592 s595 s600 s601 s610 s611 s612 s622 s623 s628 s629) 0)") while checking expression at index 22
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2020-05-12 04:04:55] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-12 04:04:55] [INFO ] Flatten gal took : 72 ms
FORMULA BusinessProcesses-PT-16-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-12 04:04:55] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-12 04:04:55] [INFO ] Flatten gal took : 28 ms
[2020-05-12 04:04:55] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BusinessProcesses-PT-16-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-12 04:04:55] [INFO ] Applying decomposition
[2020-05-12 04:04:55] [INFO ] Flatten gal took : 39 ms
[2020-05-12 04:04:55] [INFO ] Input system was already deterministic with 570 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph11116749074234548540.txt, -o, /tmp/graph11116749074234548540.bin, -w, /tmp/graph11116749074234548540.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/graph11116749074234548540.bin, -l, -1, -v, -w, /tmp/graph11116749074234548540.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-12 04:04:55] [INFO ] Decomposing Gal with order
[2020-05-12 04:04:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-12 04:04:56] [INFO ] Removed a total of 286 redundant transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 570 rows 630 cols
[2020-05-12 04:04:56] [INFO ] Flatten gal took : 164 ms
[2020-05-12 04:04:56] [INFO ] Computed 100 place invariants in 34 ms
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p229 + p230 + p231 + p595 + p596 = 1
inv : p0 + p1 + p257 + p258 + p259 + p260 + p434 + p435 + p436 + p437 + p438 = 1
inv : p620 + p621 + p622 - p623 - p624 - p625 = 0
inv : -p1 - p2 - p3 - p4 - p5 - p6 - p7 - p8 - p9 - p10 - p169 - p170 + p171 - p172 - p174 - p176 + p177 - p178 - p179 - p180 - p181 - p182 - p184 - p185 + p189 + p193 - p197 - p198 - p203 - p204 - p209 - p210 - p212 - p213 + p214 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538 + p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556 + p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564 + p565 + p566 - p567 + p568 + p570 + p572 - p573 + p574 + p575 + p576 + p577 + p578 + p580 + p581 + p585 + p586 + p587 + p588 + p589 + p590 + p591 + p592 + p593 + p594 + p595 + p596 + p597 + p598 + p599 + p600 + p601 + p602 + p603 + p607 + p608 + p609 + p615 + p616 - p617 + p624 + p625 + p630 + p631 + p633 + p634 - p635 = 0
inv : p0 + p1 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p394 + p395 + p396 + p397 + p398 = 1
inv : p0 + p1 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p364 + p365 + p366 + p367 + p368 = 1
inv : p47 + p48 + p51 + p52 - p487 - p488 - p491 - p492 - p493 = 0
inv : p0 + p1 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p399 + p400 + p401 + p402 + p403 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p62 + p65 + p66 + p502 + p503 + p506 + p507 + p508 = 1
inv : p136 + p137 + p138 - p544 - p545 = 0
inv : p0 + p1 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p409 + p410 + p411 + p412 + p413 = 1
inv : p0 + p1 + p2 + p3 + p4 + p245 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p123 + p124 + p128 + p129 + p540 + p541 + p604 = 1
inv : p226 + p227 + p228 - p591 - p592 = 0
inv : p125 + p126 + p127 - p540 - p541 - p604 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p46 + p49 + p50 + p487 + p488 + p491 + p492 + p493 = 1
inv : p0 + p1 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p384 + p385 + p386 + p387 + p388 = 1
inv : p610 + p614 + p615 + p616 - p617 - p618 - p619 = 0
inv : p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p169 + p170 + p172 + p173 + p174 + p176 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p197 + p198 + p202 + p203 + p204 + p209 + p210 + p215 + p216 - p454 - p455 - p456 - p457 - p458 - p459 - p460 - p461 - p462 - p463 - p464 - p465 - p466 - p467 - p468 - p469 - p470 - p471 - p472 - p473 - p474 - p475 - p476 - p477 - p478 - p479 - p480 - p481 - p482 - p483 - p484 - p485 - p486 - p487 - p488 - p489 - p490 - p491 - p492 - p493 - p494 - p495 - p496 - p497 - p498 - p499 - p500 - p501 - p502 - p503 - p504 - p505 - p506 - p507 - p508 - p509 - p510 - p511 - p512 - p513 - p514 - p515 - p516 - p517 - p518 - p519 - p520 - p521 - p522 - p523 - p524 - p525 - p526 - p527 - p528 - p529 - p530 - p531 - p532 - p533 - p534 - p535 - p536 - p537 - p538 - p539 - p540 - p541 - p542 - p543 - p544 - p545 - p546 - p547 - p548 - p549 - p550 - p551 - p552 - p553 - p554 - p555 - p556 - p557 - p558 - p559 - p560 - p561 - p562 - p563 - p564 - p565 - p566 - p568 - p569 - p570 - p572 - p574 - p575 - p576 - p577 - p578 - p579 - p580 - p581 - p585 - p586 - p587 - p588 - p589 - p590 - p591 - p592 - p593 - p594 - p595 - p596 - p597 - p598 - p599 - p600 - p601 - p602 - p603 - p607 - p608 - p609 - p618 - p619 - p623 - p624 - p625 - p630 - p631 - p636 - p637 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p33 + p34 + p470 + p471 + p472 + p473 + p476 + p477 + p478 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p163 + p164 + p165 + p564 + p565 = 1
inv : p220 + p221 + p222 - p587 - p588 = 0
inv : p81 + p82 - p519 - p520 = 0
inv : p0 + p1 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p414 + p415 + p416 + p417 + p418 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p485 + p486 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p241 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p83 + p84 + p85 + p86 + p87 + p91 + p92 - p267 + p269 + p389 + p390 + p392 + p393 - p394 - p395 - p397 - p398 - p399 - p400 - p402 - p403 + p404 + p405 + p407 + p408 + p537 + p538 - p544 - p545 + p604 - p607 = 1
inv : p44 + p45 - p485 - p486 = 0
inv : p0 + p1 + p257 + p449 + p450 + p451 + p452 + p453 = 1
inv : p0 + p1 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p285 + p309 + p311 + p312 + p313 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p133 + p134 + p135 + p544 + p545 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p235 + p236 + p237 + p599 + p600 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p139 + p140 + p141 + p548 + p549 = 1
inv : p0 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538 + p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556 + p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 + p572 + p573 + p574 + p575 + p576 + p577 + p578 + p579 + p580 + p581 + p582 + p583 + p584 + p585 + p586 + p587 + p588 + p589 + p590 + p591 + p592 + p593 + p594 + p595 + p596 + p597 + p598 + p599 + p600 + p601 + p602 + p603 + p607 + p608 + p609 + p617 + p618 + p619 + p623 + p624 + p625 + p629 + p630 + p631 + p635 + p636 + p637 = 1
inv : p0 + p1 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p334 + p335 + p336 + p337 + p338 = 1
inv : p0 + p1 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p314 + p315 + p316 + p317 + p318 = 1
inv : p88 + p89 - p91 - p92 + p267 - p269 - p389 - p390 - p392 - p393 + p394 + p395 + p397 + p398 + p399 + p400 + p402 + p403 - p404 - p405 - p407 - p408 - p537 - p538 + p544 + p545 - p604 + p607 = 0
inv : p0 + p1 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p304 + p306 + p307 + p308 = 1
inv : -p1 - p2 - p3 - p4 - p5 - p6 - p7 - p8 - p9 - p10 - p169 - p170 + p171 - p172 - p174 + p175 - p176 - p178 - p179 - p181 - p182 - p183 - p184 - p185 + p189 + p190 - p197 - p198 - p200 - p201 + p205 - p209 - p210 - p215 - p216 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538 + p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556 + p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564 + p565 + p566 - p567 + p568 + p570 - p571 + p572 + p574 + p575 + p577 + p578 + p579 + p580 + p581 + p585 + p586 + p587 + p588 + p589 + p590 + p591 + p592 + p593 + p594 + p595 + p596 + p597 + p598 + p599 + p600 + p601 + p602 + p603 + p607 + p608 + p609 + p612 + p613 - p617 + p621 + p622 + p627 + p628 - p629 + p636 + p637 = 0
inv : p0 + p1 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 = 1
inv : p0 + p1 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p354 + p355 + p356 + p357 + p358 = 1
inv : p626 + p627 + p628 - p629 - p630 - p631 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p157 + p158 + p159 + p560 + p561 = 1
inv : p0 + p1 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p359 + p360 + p361 + p362 + p363 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p500 + p501 = 1
inv : p0 + p1 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p419 + p420 + p421 + p422 + p423 = 1
inv : p0 + p1 + p2 + p253 + p254 + p255 + p256 = 1
inv : p0 + p1 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p379 + p380 + p381 + p382 + p383 = 1
inv : p0 + p1 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p324 + p325 + p326 + p327 + p328 = 1
inv : p0 + p1 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p349 + p350 + p351 + p352 + p353 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p123 + p124 + p131 + p132 + p540 + p541 + p607 = 1
inv : p0 + p1 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p319 + p320 + p321 + p322 + p323 = 1
inv : p125 + p126 + p130 - p540 - p541 - p607 = 0
inv : p0 + p1 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p294 + p295 + p296 + p297 + p298 = 1
inv : p0 + p1 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p369 + p370 + p371 + p372 + p373 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p69 + p70 + p71 + p72 + p73 + p513 + p514 = 1
inv : p0 + p1 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p329 + p330 + p331 + p332 + p333 = 1
inv : p0 + p1 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p389 + p390 + p391 + p392 + p393 = 1
inv : p211 + p212 + p213 - p214 - p215 - p216 = 0
inv : p0 + p1 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p339 + p340 + p341 + p342 + p343 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p117 + p118 + p119 + p537 + p538 = 1
inv : p0 + p187 + p188 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538 + p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556 + p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 + p572 + p573 + p574 + p575 + p576 + p577 + p578 + p579 + p580 + p581 + p582 + p585 + p586 + p587 + p588 + p589 + p590 + p591 + p592 + p593 + p594 + p595 + p596 + p597 + p598 + p599 + p600 + p601 + p602 + p603 + p607 + p608 + p609 + p617 + p618 + p619 + p623 + p624 + p625 + p629 + p630 + p631 + p635 + p636 + p637 = 1
inv : p238 + p239 + p240 - p599 - p600 = 0
inv : p60 + p61 - p500 - p501 = 0
inv : p0 + p1 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p344 + p345 + p346 + p347 + p348 = 1
inv : p148 + p149 + p150 - p552 - p553 = 0
inv : p0 + p1 + p257 + p258 + p259 + p439 + p440 + p441 + p442 + p443 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p217 + p218 + p219 + p587 + p588 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p111 + p112 + p113 + p533 + p534 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p76 + p77 + p78 + p79 + p80 + p519 + p520 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p83 + p84 + p85 + p86 + p90 + p91 + p92 = 1
inv : p610 + p611 + p612 + p613 - p617 - p618 - p619 = 0
inv : p114 + p115 + p116 - p533 - p534 = 0
inv : p29 + p30 + p31 + p32 + p35 + p36 - p470 - p471 - p472 - p473 - p476 - p477 - p478 = 0
inv : p0 + p1 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p374 + p375 + p376 + p377 + p378 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p151 + p152 + p153 + p556 + p557 = 1
inv : p171 + p175 + p177 + p186 + p196 + p205 + p206 + p207 - p209 - p210 + p214 - p567 - p571 - p573 - p582 - p617 - p629 - p635 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p145 + p146 + p147 + p552 + p553 = 1
inv : p74 + p75 - p513 - p514 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 = 1
inv : p604 + p605 + p606 - p607 - p608 - p609 = 0
inv : p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p169 + p170 + p172 + p174 + p175 + p176 + p178 + p179 + p180 + p181 + p182 + p184 + p185 + p186 + p194 + p195 + p203 + p204 + p205 + p206 + p207 + p212 + p213 - p454 - p455 - p456 - p457 - p458 - p459 - p460 - p461 - p462 - p463 - p464 - p465 - p466 - p467 - p468 - p469 - p470 - p471 - p472 - p473 - p474 - p475 - p476 - p477 - p478 - p479 - p480 - p481 - p482 - p483 - p484 - p485 - p486 - p487 - p488 - p489 - p490 - p491 - p492 - p493 - p494 - p495 - p496 - p497 - p498 - p499 - p500 - p501 - p502 - p503 - p504 - p505 - p506 - p507 - p508 - p509 - p510 - p511 - p512 - p513 - p514 - p515 - p516 - p517 - p518 - p519 - p520 - p521 - p522 - p523 - p524 - p525 - p526 - p527 - p528 - p529 - p530 - p531 - p532 - p533 - p534 - p535 - p536 - p537 - p538 - p539 - p540 - p541 - p542 - p543 - p544 - p545 - p546 - p547 - p548 - p549 - p550 - p551 - p552 - p553 - p554 - p555 - p556 - p557 - p558 - p559 - p560 - p561 - p562 - p563 - p564 - p565 - p566 - p568 - p570 - p571 - p572 - p574 - p575 - p576 - p577 - p578 - p580 - p581 - p582 - p585 - p586 - p587 - p588 - p589 - p590 - p591 - p592 - p593 - p594 - p595 - p596 - p597 - p598 - p599 - p600 - p601 - p602 - p603 - p607 - p608 - p609 - p615 - p616 - p624 - p625 - p629 - p630 - p631 - p633 - p634 = 0
inv : p632 + p633 + p634 - p635 - p636 - p637 = 0
inv : p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p169 + p170 + p172 + p174 + p176 + p177 + p178 + p179 + p181 + p182 + p183 + p184 + p185 + p186 + p191 + p192 + p200 + p201 + p206 + p207 + p214 + p215 + p216 - p454 - p455 - p456 - p457 - p458 - p459 - p460 - p461 - p462 - p463 - p464 - p465 - p466 - p467 - p468 - p469 - p470 - p471 - p472 - p473 - p474 - p475 - p476 - p477 - p478 - p479 - p480 - p481 - p482 - p483 - p484 - p485 - p486 - p487 - p488 - p489 - p490 - p491 - p492 - p493 - p494 - p495 - p496 - p497 - p498 - p499 - p500 - p501 - p502 - p503 - p504 - p505 - p506 - p507 - p508 - p509 - p510 - p511 - p512 - p513 - p514 - p515 - p516 - p517 - p518 - p519 - p520 - p521 - p522 - p523 - p524 - p525 - p526 - p527 - p528 - p529 - p530 - p531 - p532 - p533 - p534 - p535 - p536 - p537 - p538 - p539 - p540 - p541 - p542 - p543 - p544 - p545 - p546 - p547 - p548 - p549 - p550 - p551 - p552 - p553 - p554 - p555 - p556 - p557 - p558 - p559 - p560 - p561 - p562 - p563 - p564 - p565 - p566 - p568 - p570 - p572 - p573 - p574 - p575 - p577 - p578 - p579 - p580 - p581 - p582 - p585 - p586 - p587 - p588 - p589 - p590 - p591 - p592 - p593 - p594 - p595 - p596 - p597 - p598 - p599 - p600 - p601 - p602 - p603 - p607 - p608 - p609 - p612 - p613 - p621 - p622 - p627 - p628 - p635 - p636 - p637 = 0
inv : p0 + p1 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p404 + p405 + p406 + p407 + p408 = 1
inv : p0 + p1 + p2 + p3 + p249 + p250 + p251 + p252 = 1
inv : p63 + p64 + p67 + p68 - p502 - p503 - p506 - p507 - p508 = 0
inv : p0 + p1 + p257 + p258 + p259 + p260 + p261 + p429 + p430 + p431 + p432 + p433 = 1
inv : p232 + p233 + p234 - p595 - p596 = 0
inv : p142 + p143 + p144 - p548 - p549 = 0
inv : p154 + p155 + p156 - p556 - p557 = 0
inv : p120 + p121 + p122 - p537 - p538 = 0
inv : p0 + p1 + p257 + p258 + p444 + p445 + p446 + p447 + p448 = 1
inv : p0 + p1 + p257 + p258 + p259 + p260 + p261 + p262 + p424 + p425 + p426 + p427 + p428 = 1
inv : p160 + p161 + p162 - p560 - p561 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p223 + p224 + p225 + p591 + p592 = 1
inv : -p205 - p206 - p207 + p208 + p209 + p210 = 0
inv : p166 + p167 + p168 - p564 - p565 = 0
inv : p0 + p1 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p299 + p300 + p301 + p302 + p303 = 1
inv : p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p169 + p170 + p172 + p173 + p174 + p176 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p197 + p198 + p199 + p200 + p201 + p209 + p210 + p215 + p216 - p454 - p455 - p456 - p457 - p458 - p459 - p460 - p461 - p462 - p463 - p464 - p465 - p466 - p467 - p468 - p469 - p470 - p471 - p472 - p473 - p474 - p475 - p476 - p477 - p478 - p479 - p480 - p481 - p482 - p483 - p484 - p485 - p486 - p487 - p488 - p489 - p490 - p491 - p492 - p493 - p494 - p495 - p496 - p497 - p498 - p499 - p500 - p501 - p502 - p503 - p504 - p505 - p506 - p507 - p508 - p509 - p510 - p511 - p512 - p513 - p514 - p515 - p516 - p517 - p518 - p519 - p520 - p521 - p522 - p523 - p524 - p525 - p526 - p527 - p528 - p529 - p530 - p531 - p532 - p533 - p534 - p535 - p536 - p537 - p538 - p539 - p540 - p541 - p542 - p543 - p544 - p545 - p546 - p547 - p548 - p549 - p550 - p551 - p552 - p553 - p554 - p555 - p556 - p557 - p558 - p559 - p560 - p561 - p562 - p563 - p564 - p565 - p566 - p568 - p569 - p570 - p572 - p574 - p575 - p576 - p577 - p578 - p579 - p580 - p581 - p585 - p586 - p587 - p588 - p589 - p590 - p591 - p592 - p593 - p594 - p595 - p596 - p597 - p598 - p599 - p600 - p601 - p602 - p603 - p607 - p608 - p609 - p618 - p619 - p623 - p624 - p625 - p630 - p631 - p636 - p637 = 0
Total of 100 invariants.
[2020-05-12 04:04:56] [INFO ] Computed 100 place invariants in 59 ms
[2020-05-12 04:04:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 3 labels/synchronizations in 29 ms.
[2020-05-12 04:04:56] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 27 ms
[2020-05-12 04:04:56] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 13 LTL properties
Checking formula 0 : !(((G(((X("(i12.i0.u110.p286==1)"))U(X("(i10.i2.u124.p324==1)")))&&("(i12.i0.u110.p286!=1)")))||(F("((i19.u206.p522==1)&&(i10.i2.u124.p324!=1))"))))
Formula 0 simplified : !(G("(i12.i0.u110.p286!=1)" & (X"(i12.i0.u110.p286==1)" U X"(i10.i2.u124.p324==1)")) | F"((i19.u206.p522==1)&&(i10.i2.u124.p324!=1))")
built 64 ordering constraints for composite.
built 13 ordering constraints for composite.
built 15 ordering constraints for composite.
built 4 ordering constraints for composite.
built 23 ordering constraints for composite.
built 18 ordering constraints for composite.
built 7 ordering constraints for composite.
built 18 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 16 ordering constraints for composite.
built 15 ordering constraints for composite.
built 4 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 11 ordering constraints for composite.
built 26 ordering constraints for composite.
built 48 ordering constraints for composite.
built 31 ordering constraints for composite.
built 37 ordering constraints for composite.
built 16 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 20 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 8 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 23 ordering constraints for composite.
built 9 ordering constraints for composite.
built 16 ordering constraints for composite.
built 81 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 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 22 ordering constraints for composite.
built 21 ordering constraints for composite.
built 4 ordering constraints for composite.
built 20 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 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 6 ordering constraints for composite.
built 28 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 23 ordering constraints for composite.
built 9 ordering constraints for composite.
built 6 ordering constraints for composite.
built 12 ordering constraints for composite.
built 4 ordering constraints for composite.
built 11 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
[2020-05-12 04:04:57] [INFO ] Proved 630 variables to be positive in 1072 ms
[2020-05-12 04:04:57] [INFO ] Computing symmetric may disable matrix : 570 transitions.
[2020-05-12 04:04:57] [INFO ] Computation of disable matrix completed :0/570 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-12 04:04:57] [INFO ] Computation of Complete disable matrix. took 34 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-12 04:04:57] [INFO ] Computing symmetric may enable matrix : 570 transitions.
[2020-05-12 04:04:57] [INFO ] Computation of Complete enable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-12 04:05:01] [INFO ] Computing symmetric co enabling matrix : 570 transitions.
[2020-05-12 04:05:01] [INFO ] Computation of co-enabling matrix(0/570) took 42 ms. Total solver calls (SAT/UNSAT): 50(20/30)
[2020-05-12 04:05:04] [INFO ] Computation of co-enabling matrix(3/570) took 3499 ms. Total solver calls (SAT/UNSAT): 645(589/56)
SMT solver raised 'unknown', retrying with same input.
SMT solver raised 'unknown', retrying with same input.
SMT solver raised 'unknown', retrying with same input.
SMT solver raised 'unknown' twice, overapproximating result to 1.
[2020-05-12 04:05:11] [INFO ] Computation of co-enabling matrix(6/570) took 10739 ms. Total solver calls (SAT/UNSAT): 1360(1163/197)
[2020-05-12 04:05:11] [INFO ] Computation of Finished co-enabling matrix. took 10763 ms. Total solver calls (SAT/UNSAT): 1360(1163/197)
[2020-05-12 04:05:12] [INFO ] Computing Do-Not-Accords matrix : 570 transitions.
[2020-05-12 04:05:19] [INFO ] Computation of Completed DNA matrix. took 7492 ms. Total solver calls (SAT/UNSAT): 3646(0/3646)
[2020-05-12 04:05:19] [INFO ] Built C files in 24058ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
Compilation finished in 7181 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 58 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, ( [](( (X((LTLAP0==true)))U(X((LTLAP1==true))) ) && ( (LTLAP2==true) ))) || ( <>((LTLAP3==true))) , --buchi-type=spotba], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, ( [](( (X((LTLAP0==true)))U(X((LTLAP1==true))) ) && ( (LTLAP2==true) ))) || ( <>((LTLAP3==true))) , --buchi-type=spotba], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, ( [](( (X((LTLAP0==true)))U(X((LTLAP1==true))) ) && ( (LTLAP2==true) ))) || ( <>((LTLAP3==true))) , --buchi-type=spotba], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
Reverse transition relation is NOT exact ! Due to transitions t33, t410, t416, i0.i0.u85.t309, i0.i1.u63.t343, i0.i1.u65.t339, i1.u59.t351, i1.u61.t347, i2.i0.u49.t369, i2.i0.u55.t359, i2.i1.u57.t355, i3.t430, i3.i0.t424, i3.i0.u15.t440, i3.i0.u22.t427, i3.i1.t442, i3.i1.t444, i3.i1.u16.t438, i3.i2.t433, i3.i2.t435, i3.i2.u17.t437, i3.i3.t429, i3.i3.u23.t425, i4.i0.u37.t397, i4.i0.u47.t373, i5.t378, i5.i0.t376, i5.i0.u40.t391, i5.i1.t381, i5.i1.t383, i5.i1.t385, i5.i1.t387, i6.i1.u94.t287, i6.i3.t162, i6.i3.u170.t163, i6.i4.t154, i6.i4.u174.t155, i7.i1.t170, i7.i1.u166.t171, i7.i2.t166, i7.i2.u168.t167, i8.i1.t206, i8.i1.u149.t207, i8.i2.t202, i8.i2.u151.t203, i8.i3.t198, i8.i3.u152.t199, i8.i4.t190, i8.i4.u156.t191, i8.i5.t186, i8.i5.u159.t187, i9.i1.t230, i9.i1.u137.t231, i9.i2.t226, i9.i2.u138.t227, i9.i3.t218, i9.i3.u142.t219, i9.i4.t214, i9.i4.u144.t215, i9.i5.t210, i9.i5.u146.t211, i10.i0.t419, i10.i0.t421, i10.i0.u24.t423, i10.i2.t254, i10.i2.u125.t255, i10.i3.t250, i10.i3.u127.t251, i10.i4.t242, i10.i4.u130.t243, i10.i5.t238, i10.i5.u133.t239, i10.i6.t234, i10.i6.u135.t235, i11.i0.t281, i11.i0.u113.t282, i11.i1.t278, i11.i1.u115.t279, i11.i2.t274, i11.i2.u116.t275, i11.i3.t128, i11.i3.t132, i11.i3.u182.t134, i12.i1.t262, i12.i1.u120.t263, i12.i2.t258, i12.i2.u122.t259, i13.i0.t246, i13.i0.u129.t247, i13.i1.t115, i13.i1.u190.t119, i14.i0.t294, i14.i0.t298, i14.i0.u87.t305, i14.i0.u89.t301, i14.i0.u91.t297, i14.i1.t158, i14.i1.u173.t159, i15.i0.t415, i15.i0.u30.t411, i15.i1.u29.t413, i15.i2.t407, i15.i2.u31.t409, i15.i3.t102, i15.i3.u197.t106, i16.i0.u51.t365, i16.i1.t194, i16.i1.u154.t195, i17.t317, i17.t313, i17.i0.t182, i17.i0.u160.t183, i17.i1.t178, i17.i1.t315, i17.i1.u67.t321, i17.i1.u67.t325, i17.i1.u67.t329, i17.i1.u67.t335, i17.i1.u162.t179, i17.i2.t174, i17.i2.u164.t175, i18.i0.t401, i18.i0.u34.t403, i18.i1.t222, i18.i1.u141.t223, i19.t148, i19.t141, i19.t136, i19.t130, i19.t126, i19.t124, i19.t122, i19.t117, i19.t113, i19.t111, i19.t109, i19.t104, i19.t100, i19.t98, i19.t95, i19.t93, i19.t90, i19.t88, i19.t86, i19.t84, i19.t82, i19.t80, i19.t77, i19.t69, i19.t66, i19.t63, i19.t60, i19.t57, i19.t54, i19.t26, i19.t23, i19.t20, i19.t17, i19.t14, i19.u176.t12, i19.u176.t37, i19.u176.t41, i19.u176.t45, i19.u176.t51, i19.u176.t74, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/367/165/568
Computing Next relation with stutter on 1215 deadlock states
125 unique states visited
125 strongly connected components in search stack
126 transitions explored
125 items max in DFS search stack
75399 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,754.113,7418124,1,0,9.4535e+06,1043,4217,1.72953e+07,198,4131,492238
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-16-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((X((!(X("(i0.i0.u86.p222==1)")))&&("(i10.i1.u108.p282!=1)")))||(X((G("(i0.i0.u86.p222!=1)"))U("(i19.u222.p555==1)")))))
Formula 1 simplified : !(X("(i10.i1.u108.p282!=1)" & !X"(i0.i0.u86.p222==1)") | X(G"(i0.i0.u86.p222!=1)" U "(i19.u222.p555==1)"))
Computing Next relation with stutter on 1215 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
1383 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,767.972,7418912,1,0,9.4535e+06,1043,4943,1.72953e+07,216,4131,752856
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-16-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((((!(X(X("(i10.i0.u24.p55!=1)"))))||("(i5.i0.u46.p93==1)"))U(!(F((((!(F("(i5.i0.u46.p93==1)")))||("(i17.i2.u69.p214!=1)"))||("(i17.i2.u164.p427!=1)"))||("(i17.i2.u233.p582!=1)"))))))
Formula 2 simplified : !(("(i5.i0.u46.p93==1)" | !XX"(i10.i0.u24.p55!=1)") U !F("(i17.i2.u69.p214!=1)" | "(i17.i2.u164.p427!=1)" | "(i17.i2.u233.p582!=1)" | !F"(i5.i0.u46.p93==1)"))
Computing Next relation with stutter on 1215 deadlock states
136 unique states visited
136 strongly connected components in search stack
136 transitions explored
136 items max in DFS search stack
25099 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1019.01,7419080,1,0,9.4535e+06,1232,5572,1.72953e+07,233,5377,3999115
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-16-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F(G(F((((F((G("(((i3.i2.u20.p44==1)&&(i11.i0.u113.p292==1))&&(i3.i2.u189.p485==1))"))U("(i11.i3.u182.p471==1)")))&&("(i15.i2.u33.p74==1)"))&&("(i12.i0.u119.p312==1)"))&&("(i15.i2.u202.p513==1)"))))))
Formula 3 simplified : !FGF("(i12.i0.u119.p312==1)" & "(i15.i2.u33.p74==1)" & "(i15.i2.u202.p513==1)" & F(G"(((i3.i2.u20.p44==1)&&(i11.i0.u113.p292==1))&&(i3.i2.u189.p485==1))" U "(i11.i3.u182.p471==1)"))
Computing Next relation with stutter on 1215 deadlock states
138 unique states visited
138 strongly connected components in search stack
139 transitions explored
138 items max in DFS search stack
367 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1022.7,7419080,1,0,9.4535e+06,1237,5638,1.72953e+07,233,5408,4136557
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-16-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X(G(F(!(F((X(G("(i10.i0.u26.p58==1)")))&&("(i17.i2.u233.p581==1)"))))))))
Formula 4 simplified : !XGF!F("(i17.i2.u233.p581==1)" & XG"(i10.i0.u26.p58==1)")
Computing Next relation with stutter on 1215 deadlock states
137 unique states visited
0 strongly connected components in search stack
272 transitions explored
137 items max in DFS search stack
1493 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1037.64,7419088,1,0,9.4535e+06,1237,5716,1.77015e+07,233,5408,5217158
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-16-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G(!(F(G((F(G("(((i5.i1.u41.p106==1)&&(i8.i1.u149.p386==1))&&(i19.u176.p603==1))")))U(!(G("((i19.u179.p463==1)||(i19.u194.p497==1))")))))))))
Formula 5 simplified : !G!FG(FG"(((i5.i1.u41.p106==1)&&(i8.i1.u149.p386==1))&&(i19.u176.p603==1))" U !G"((i19.u179.p463==1)||(i19.u194.p497==1))")
Computing Next relation with stutter on 1215 deadlock states
Detected timeout of ITS tools.
[2020-05-12 04:27:30] [INFO ] Applying decomposition
[2020-05-12 04:27:30] [INFO ] Flatten gal took : 48 ms
[2020-05-12 04:27:30] [INFO ] Decomposing Gal with order
[2020-05-12 04:27:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-12 04:27:30] [INFO ] Removed a total of 117 redundant transitions.
[2020-05-12 04:27:30] [INFO ] Flatten gal took : 72 ms
[2020-05-12 04:27:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 27 ms.
[2020-05-12 04:27:30] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 25 ms
[2020-05-12 04:27:30] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 8 LTL properties
Checking formula 0 : !((G(!(F(G((F(G("(((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u38.p106==1)&&(i0.i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u120.p386==1))&&(i1.u206.p603==1))")))U(!(G("((i1.u206.p463==1)||(i1.u206.p497==1))")))))))))
Formula 0 simplified : !G!FG(FG"(((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u38.p106==1)&&(i0.i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u120.p386==1))&&(i1.u206.p603==1))" U !G"((i1.u206.p463==1)||(i1.u206.p497==1))")
built 2 ordering constraints for composite.
built 147 ordering constraints for composite.
built 83 ordering constraints for composite.
built 82 ordering constraints for composite.
built 81 ordering constraints for composite.
built 81 ordering constraints for composite.
built 81 ordering constraints for composite.
built 79 ordering constraints for composite.
built 77 ordering constraints for composite.
built 75 ordering constraints for composite.
built 73 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 38 ordering constraints for composite.
built 36 ordering constraints for composite.
built 34 ordering constraints for composite.
built 29 ordering constraints for composite.
built 26 ordering constraints for composite.
built 23 ordering constraints for composite.
built 20 ordering constraints for composite.
built 17 ordering constraints for composite.
built 13 ordering constraints for composite.
built 10 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 25 ordering constraints for composite.
built 6 ordering constraints for composite.
built 66 ordering constraints for composite.
built 64 ordering constraints for composite.
built 62 ordering constraints for composite.
built 60 ordering constraints for composite.
built 58 ordering constraints for composite.
built 56 ordering constraints for composite.
built 54 ordering constraints for composite.
built 52 ordering constraints for composite.
built 50 ordering constraints for composite.
built 48 ordering constraints for composite.
built 46 ordering constraints for composite.
built 44 ordering constraints for composite.
built 42 ordering constraints for composite.
built 40 ordering constraints for composite.
built 38 ordering constraints for composite.
built 36 ordering constraints for composite.
built 34 ordering constraints for composite.
built 32 ordering constraints for composite.
built 30 ordering constraints for composite.
built 28 ordering constraints for composite.
built 26 ordering constraints for composite.
built 24 ordering constraints for composite.
built 22 ordering constraints for composite.
built 20 ordering constraints for composite.
built 18 ordering constraints for composite.
built 16 ordering constraints for composite.
built 14 ordering constraints for composite.
built 12 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 87 ordering constraints for composite.
built 6 ordering constraints for composite.
Detected timeout of ITS tools.
[2020-05-12 04:50:11] [INFO ] Flatten gal took : 2216 ms
[2020-05-12 04:50:13] [INFO ] Input system was already deterministic with 570 transitions.
[2020-05-12 04:50:13] [INFO ] Transformed 630 places.
[2020-05-12 04:50:13] [INFO ] Transformed 570 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:50:44] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 84 ms
[2020-05-12 04:50:44] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 12 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 8 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(!(F(G((F(G("(((p106==1)&&(p386==1))&&(p603==1))")))U(!(G("((p463==1)||(p497==1))")))))))))
Formula 0 simplified : !G!FG(FG"(((p106==1)&&(p386==1))&&(p603==1))" U !G"((p463==1)||(p497==1))")

BK_TIME_CONFINEMENT_REACHED

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

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

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