Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r051-ebro-158902546000314.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DES-PT-50b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r051-ebro-158902546000314
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 296K
-rw-r--r-- 1 mcc users 3.4K Mar 30 01:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 30 01:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 28 16:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 8 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Apr 8 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Mar 27 08:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 27 08:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 26 08:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 26 08:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 127K 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 DES-PT-50b-00
FORMULA_NAME DES-PT-50b-01
FORMULA_NAME DES-PT-50b-02
FORMULA_NAME DES-PT-50b-03
FORMULA_NAME DES-PT-50b-04
FORMULA_NAME DES-PT-50b-05
FORMULA_NAME DES-PT-50b-06
FORMULA_NAME DES-PT-50b-07
FORMULA_NAME DES-PT-50b-08
FORMULA_NAME DES-PT-50b-09
FORMULA_NAME DES-PT-50b-10
FORMULA_NAME DES-PT-50b-11
FORMULA_NAME DES-PT-50b-12
FORMULA_NAME DES-PT-50b-13
FORMULA_NAME DES-PT-50b-14
FORMULA_NAME DES-PT-50b-15

=== Now, execution of the tool begins

BK_START 1589556837599

[2020-05-15 15:34:00] [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-15 15:34:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-15 15:34:00] [INFO ] Load time of PNML (sax parser for PT used): 151 ms
[2020-05-15 15:34:00] [INFO ] Transformed 479 places.
[2020-05-15 15:34:00] [INFO ] Transformed 430 transitions.
[2020-05-15 15:34:00] [INFO ] Found NUPN structural information;
[2020-05-15 15:34:00] [INFO ] Parsed PT model containing 479 places and 430 transitions in 253 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 65 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 848 resets, run finished after 692 ms. (steps per millisecond=144 ) properties seen :[1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0]
// Phase 1: matrix 430 rows 479 cols
[2020-05-15 15:34:01] [INFO ] Computed 65 place invariants in 100 ms
[2020-05-15 15:34:02] [INFO ] [Real]Absence check using 40 positive place invariants in 131 ms returned sat
[2020-05-15 15:34:02] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 55 ms returned sat
[2020-05-15 15:34:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 15:34:04] [INFO ] [Real]Absence check using state equation in 1492 ms returned sat
[2020-05-15 15:34:04] [INFO ] Deduced a trap composed of 18 places in 377 ms
[2020-05-15 15:34:05] [INFO ] Deduced a trap composed of 13 places in 319 ms
[2020-05-15 15:34:05] [INFO ] Deduced a trap composed of 16 places in 269 ms
[2020-05-15 15:34:05] [INFO ] Deduced a trap composed of 18 places in 186 ms
[2020-05-15 15:34:05] [INFO ] Deduced a trap composed of 18 places in 187 ms
[2020-05-15 15:34:06] [INFO ] Deduced a trap composed of 19 places in 135 ms
[2020-05-15 15:34:06] [INFO ] Deduced a trap composed of 20 places in 128 ms
[2020-05-15 15:34:06] [INFO ] Deduced a trap composed of 16 places in 111 ms
[2020-05-15 15:34:06] [INFO ] Deduced a trap composed of 14 places in 119 ms
[2020-05-15 15:34:06] [INFO ] Deduced a trap composed of 20 places in 99 ms
[2020-05-15 15:34:06] [INFO ] Deduced a trap composed of 21 places in 93 ms
[2020-05-15 15:34:06] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2594 ms
[2020-05-15 15:34:06] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 15:34:07] [INFO ] [Nat]Absence check using 40 positive place invariants in 181 ms returned sat
[2020-05-15 15:34:07] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 46 ms returned sat
[2020-05-15 15:34:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 15:34:08] [INFO ] [Nat]Absence check using state equation in 1264 ms returned sat
[2020-05-15 15:34:08] [INFO ] Deduced a trap composed of 18 places in 263 ms
[2020-05-15 15:34:09] [INFO ] Deduced a trap composed of 13 places in 263 ms
[2020-05-15 15:34:09] [INFO ] Deduced a trap composed of 22 places in 253 ms
[2020-05-15 15:34:09] [INFO ] Deduced a trap composed of 22 places in 301 ms
[2020-05-15 15:34:10] [INFO ] Deduced a trap composed of 18 places in 254 ms
[2020-05-15 15:34:10] [INFO ] Deduced a trap composed of 21 places in 103 ms
[2020-05-15 15:34:10] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1777 ms
[2020-05-15 15:34:10] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 56 ms.
[2020-05-15 15:34:18] [INFO ] Added : 420 causal constraints over 84 iterations in 8033 ms. Result :sat
[2020-05-15 15:34:18] [INFO ] Deduced a trap composed of 47 places in 276 ms
[2020-05-15 15:34:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 414 ms
[2020-05-15 15:34:18] [INFO ] [Real]Absence check using 40 positive place invariants in 53 ms returned sat
[2020-05-15 15:34:18] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 52 ms returned sat
[2020-05-15 15:34:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 15:34:20] [INFO ] [Real]Absence check using state equation in 1255 ms returned sat
[2020-05-15 15:34:20] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 15:34:20] [INFO ] [Nat]Absence check using 40 positive place invariants in 81 ms returned sat
[2020-05-15 15:34:20] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 106 ms returned sat
[2020-05-15 15:34:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 15:34:22] [INFO ] [Nat]Absence check using state equation in 1448 ms returned sat
[2020-05-15 15:34:22] [INFO ] Deduced a trap composed of 9 places in 261 ms
[2020-05-15 15:34:22] [INFO ] Deduced a trap composed of 14 places in 214 ms
[2020-05-15 15:34:22] [INFO ] Deduced a trap composed of 23 places in 199 ms
[2020-05-15 15:34:23] [INFO ] Deduced a trap composed of 14 places in 221 ms
[2020-05-15 15:34:23] [INFO ] Deduced a trap composed of 14 places in 199 ms
[2020-05-15 15:34:23] [INFO ] Deduced a trap composed of 16 places in 195 ms
[2020-05-15 15:34:23] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1591 ms
[2020-05-15 15:34:23] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 48 ms.
[2020-05-15 15:34:28] [INFO ] Added : 264 causal constraints over 53 iterations in 4474 ms. Result :sat
[2020-05-15 15:34:28] [INFO ] Deduced a trap composed of 59 places in 359 ms
[2020-05-15 15:34:28] [INFO ] Deduced a trap composed of 42 places in 270 ms
[2020-05-15 15:34:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 903 ms
[2020-05-15 15:34:29] [INFO ] [Real]Absence check using 40 positive place invariants in 50 ms returned sat
[2020-05-15 15:34:29] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 51 ms returned sat
[2020-05-15 15:34:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 15:34:30] [INFO ] [Real]Absence check using state equation in 1511 ms returned sat
[2020-05-15 15:34:30] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 15:34:31] [INFO ] [Nat]Absence check using 40 positive place invariants in 157 ms returned sat
[2020-05-15 15:34:31] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 85 ms returned sat
[2020-05-15 15:34:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 15:34:33] [INFO ] [Nat]Absence check using state equation in 2012 ms returned sat
[2020-05-15 15:34:33] [INFO ] Deduced a trap composed of 17 places in 200 ms
[2020-05-15 15:34:33] [INFO ] Deduced a trap composed of 16 places in 175 ms
[2020-05-15 15:34:33] [INFO ] Deduced a trap composed of 12 places in 146 ms
[2020-05-15 15:34:34] [INFO ] Deduced a trap composed of 33 places in 114 ms
[2020-05-15 15:34:34] [INFO ] Deduced a trap composed of 17 places in 105 ms
[2020-05-15 15:34:34] [INFO ] Deduced a trap composed of 20 places in 68 ms
[2020-05-15 15:34:34] [INFO ] Deduced a trap composed of 28 places in 104 ms
[2020-05-15 15:34:34] [INFO ] Deduced a trap composed of 14 places in 102 ms
[2020-05-15 15:34:34] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1441 ms
[2020-05-15 15:34:34] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 47 ms.
[2020-05-15 15:34:41] [INFO ] Added : 387 causal constraints over 79 iterations in 6716 ms. Result :sat
[2020-05-15 15:34:41] [INFO ] Deduced a trap composed of 42 places in 261 ms
[2020-05-15 15:34:41] [INFO ] Deduced a trap composed of 28 places in 234 ms
[2020-05-15 15:34:42] [INFO ] Deduced a trap composed of 36 places in 241 ms
[2020-05-15 15:34:42] [INFO ] Deduced a trap composed of 57 places in 238 ms
[2020-05-15 15:34:42] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1408 ms
[2020-05-15 15:34:42] [INFO ] [Real]Absence check using 40 positive place invariants in 55 ms returned sat
[2020-05-15 15:34:42] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 52 ms returned sat
[2020-05-15 15:34:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 15:34:44] [INFO ] [Real]Absence check using state equation in 1593 ms returned sat
[2020-05-15 15:34:44] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 15:34:44] [INFO ] [Nat]Absence check using 40 positive place invariants in 247 ms returned sat
[2020-05-15 15:34:45] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 74 ms returned sat
[2020-05-15 15:34:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 15:34:46] [INFO ] [Nat]Absence check using state equation in 1564 ms returned sat
[2020-05-15 15:34:46] [INFO ] Deduced a trap composed of 12 places in 349 ms
[2020-05-15 15:34:47] [INFO ] Deduced a trap composed of 18 places in 139 ms
[2020-05-15 15:34:47] [INFO ] Deduced a trap composed of 22 places in 139 ms
[2020-05-15 15:34:47] [INFO ] Deduced a trap composed of 24 places in 120 ms
[2020-05-15 15:34:47] [INFO ] Deduced a trap composed of 30 places in 94 ms
[2020-05-15 15:34:47] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1124 ms
[2020-05-15 15:34:47] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 53 ms.
[2020-05-15 15:34:54] [INFO ] Added : 361 causal constraints over 73 iterations in 7206 ms. Result :sat
[2020-05-15 15:34:55] [INFO ] Deduced a trap composed of 60 places in 245 ms
[2020-05-15 15:34:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 374 ms
[2020-05-15 15:34:55] [INFO ] [Real]Absence check using 40 positive place invariants in 50 ms returned sat
[2020-05-15 15:34:55] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 45 ms returned sat
[2020-05-15 15:34:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 15:34:56] [INFO ] [Real]Absence check using state equation in 1275 ms returned sat
[2020-05-15 15:34:57] [INFO ] Deduced a trap composed of 8 places in 297 ms
[2020-05-15 15:34:57] [INFO ] Deduced a trap composed of 13 places in 275 ms
[2020-05-15 15:34:57] [INFO ] Deduced a trap composed of 14 places in 260 ms
[2020-05-15 15:34:57] [INFO ] Deduced a trap composed of 18 places in 199 ms
[2020-05-15 15:34:58] [INFO ] Deduced a trap composed of 20 places in 154 ms
[2020-05-15 15:34:58] [INFO ] Deduced a trap composed of 21 places in 156 ms
[2020-05-15 15:34:58] [INFO ] Deduced a trap composed of 17 places in 174 ms
[2020-05-15 15:34:58] [INFO ] Deduced a trap composed of 16 places in 160 ms
[2020-05-15 15:34:58] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2120 ms
[2020-05-15 15:34:58] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 15:34:59] [INFO ] [Nat]Absence check using 40 positive place invariants in 158 ms returned sat
[2020-05-15 15:34:59] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 50 ms returned sat
[2020-05-15 15:34:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 15:35:00] [INFO ] [Nat]Absence check using state equation in 1292 ms returned sat
[2020-05-15 15:35:01] [INFO ] Deduced a trap composed of 8 places in 450 ms
[2020-05-15 15:35:01] [INFO ] Deduced a trap composed of 20 places in 340 ms
[2020-05-15 15:35:01] [INFO ] Deduced a trap composed of 12 places in 339 ms
[2020-05-15 15:35:02] [INFO ] Deduced a trap composed of 19 places in 153 ms
[2020-05-15 15:35:02] [INFO ] Deduced a trap composed of 21 places in 108 ms
[2020-05-15 15:35:02] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1682 ms
[2020-05-15 15:35:02] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 49 ms.
[2020-05-15 15:35:09] [INFO ] Added : 406 causal constraints over 82 iterations in 7261 ms. Result :sat
[2020-05-15 15:35:09] [INFO ] Deduced a trap composed of 28 places in 271 ms
[2020-05-15 15:35:10] [INFO ] Deduced a trap composed of 58 places in 246 ms
[2020-05-15 15:35:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1256 ms
[2020-05-15 15:35:10] [INFO ] [Real]Absence check using 40 positive place invariants in 135 ms returned sat
[2020-05-15 15:35:11] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 56 ms returned sat
[2020-05-15 15:35:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 15:35:12] [INFO ] [Real]Absence check using state equation in 1332 ms returned sat
[2020-05-15 15:35:12] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 15:35:12] [INFO ] [Nat]Absence check using 40 positive place invariants in 81 ms returned sat
[2020-05-15 15:35:12] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 87 ms returned sat
[2020-05-15 15:35:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 15:35:14] [INFO ] [Nat]Absence check using state equation in 1436 ms returned sat
[2020-05-15 15:35:14] [INFO ] Deduced a trap composed of 8 places in 261 ms
[2020-05-15 15:35:14] [INFO ] Deduced a trap composed of 12 places in 230 ms
[2020-05-15 15:35:15] [INFO ] Deduced a trap composed of 36 places in 284 ms
[2020-05-15 15:35:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 983 ms
[2020-05-15 15:35:15] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 52 ms.
[2020-05-15 15:35:20] [INFO ] Added : 302 causal constraints over 62 iterations in 5325 ms. Result :sat
[2020-05-15 15:35:20] [INFO ] Deduced a trap composed of 31 places in 185 ms
[2020-05-15 15:35:20] [INFO ] Deduced a trap composed of 43 places in 196 ms
[2020-05-15 15:35:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 599 ms
[2020-05-15 15:35:21] [INFO ] [Real]Absence check using 40 positive place invariants in 79 ms returned sat
[2020-05-15 15:35:21] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 57 ms returned sat
[2020-05-15 15:35:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 15:35:22] [INFO ] [Real]Absence check using state equation in 1623 ms returned sat
[2020-05-15 15:35:22] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 15:35:23] [INFO ] [Nat]Absence check using 40 positive place invariants in 91 ms returned sat
[2020-05-15 15:35:23] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 69 ms returned sat
[2020-05-15 15:35:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 15:35:24] [INFO ] [Nat]Absence check using state equation in 1510 ms returned sat
[2020-05-15 15:35:25] [INFO ] Deduced a trap composed of 8 places in 301 ms
[2020-05-15 15:35:25] [INFO ] Deduced a trap composed of 20 places in 202 ms
[2020-05-15 15:35:25] [INFO ] Deduced a trap composed of 12 places in 218 ms
[2020-05-15 15:35:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 900 ms
[2020-05-15 15:35:25] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 74 ms.
[2020-05-15 15:35:31] [INFO ] Added : 331 causal constraints over 67 iterations in 5866 ms. Result :sat
[2020-05-15 15:35:31] [INFO ] Deduced a trap composed of 52 places in 264 ms
[2020-05-15 15:35:32] [INFO ] Deduced a trap composed of 45 places in 195 ms
[2020-05-15 15:35:32] [INFO ] Deduced a trap composed of 58 places in 250 ms
[2020-05-15 15:35:32] [INFO ] Deduced a trap composed of 61 places in 245 ms
[2020-05-15 15:35:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1363 ms
[2020-05-15 15:35:33] [INFO ] [Real]Absence check using 40 positive place invariants in 50 ms returned sat
[2020-05-15 15:35:33] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 66 ms returned sat
[2020-05-15 15:35:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 15:35:34] [INFO ] [Real]Absence check using state equation in 1294 ms returned sat
[2020-05-15 15:35:34] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 15:35:34] [INFO ] [Nat]Absence check using 40 positive place invariants in 80 ms returned sat
[2020-05-15 15:35:34] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 88 ms returned sat
[2020-05-15 15:35:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 15:35:36] [INFO ] [Nat]Absence check using state equation in 1703 ms returned sat
[2020-05-15 15:35:36] [INFO ] Deduced a trap composed of 8 places in 442 ms
[2020-05-15 15:35:37] [INFO ] Deduced a trap composed of 12 places in 300 ms
[2020-05-15 15:35:37] [INFO ] Deduced a trap composed of 33 places in 233 ms
[2020-05-15 15:35:37] [INFO ] Deduced a trap composed of 27 places in 224 ms
[2020-05-15 15:35:38] [INFO ] Deduced a trap composed of 29 places in 192 ms
[2020-05-15 15:35:38] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1690 ms
[2020-05-15 15:35:38] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 42 ms.
[2020-05-15 15:35:43] [INFO ] Added : 274 causal constraints over 56 iterations in 5423 ms. Result :sat
[2020-05-15 15:35:43] [INFO ] Deduced a trap composed of 62 places in 220 ms
[2020-05-15 15:35:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 349 ms
[2020-05-15 15:35:44] [INFO ] [Real]Absence check using 40 positive place invariants in 49 ms returned sat
[2020-05-15 15:35:44] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 55 ms returned sat
[2020-05-15 15:35:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 15:35:45] [INFO ] [Real]Absence check using state equation in 1486 ms returned sat
[2020-05-15 15:35:45] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 15:35:45] [INFO ] [Nat]Absence check using 40 positive place invariants in 166 ms returned sat
[2020-05-15 15:35:46] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 88 ms returned sat
[2020-05-15 15:35:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 15:35:48] [INFO ] [Nat]Absence check using state equation in 2172 ms returned sat
[2020-05-15 15:35:48] [INFO ] Deduced a trap composed of 12 places in 278 ms
[2020-05-15 15:35:48] [INFO ] Deduced a trap composed of 17 places in 206 ms
[2020-05-15 15:35:49] [INFO ] Deduced a trap composed of 10 places in 152 ms
[2020-05-15 15:35:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 830 ms
[2020-05-15 15:35:49] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 43 ms.
[2020-05-15 15:35:55] [INFO ] Added : 377 causal constraints over 76 iterations in 6494 ms. Result :sat
[2020-05-15 15:35:55] [INFO ] [Real]Absence check using 40 positive place invariants in 59 ms returned sat
[2020-05-15 15:35:55] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 53 ms returned sat
[2020-05-15 15:35:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 15:35:57] [INFO ] [Real]Absence check using state equation in 1383 ms returned sat
[2020-05-15 15:35:57] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 15:35:57] [INFO ] [Nat]Absence check using 40 positive place invariants in 92 ms returned sat
[2020-05-15 15:35:57] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 73 ms returned sat
[2020-05-15 15:35:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 15:35:58] [INFO ] [Nat]Absence check using state equation in 1353 ms returned sat
[2020-05-15 15:35:59] [INFO ] Deduced a trap composed of 16 places in 280 ms
[2020-05-15 15:35:59] [INFO ] Deduced a trap composed of 15 places in 197 ms
[2020-05-15 15:35:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 632 ms
[2020-05-15 15:35:59] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 45 ms.
[2020-05-15 15:36:06] [INFO ] Added : 407 causal constraints over 83 iterations in 7377 ms. Result :sat
[2020-05-15 15:36:07] [INFO ] [Real]Absence check using 40 positive place invariants in 50 ms returned sat
[2020-05-15 15:36:07] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 54 ms returned sat
[2020-05-15 15:36:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 15:36:08] [INFO ] [Real]Absence check using state equation in 1332 ms returned sat
[2020-05-15 15:36:08] [INFO ] Deduced a trap composed of 16 places in 257 ms
[2020-05-15 15:36:09] [INFO ] Deduced a trap composed of 15 places in 228 ms
[2020-05-15 15:36:09] [INFO ] Deduced a trap composed of 16 places in 316 ms
[2020-05-15 15:36:09] [INFO ] Deduced a trap composed of 21 places in 230 ms
[2020-05-15 15:36:10] [INFO ] Deduced a trap composed of 20 places in 187 ms
[2020-05-15 15:36:10] [INFO ] Deduced a trap composed of 12 places in 106 ms
[2020-05-15 15:36:10] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1652 ms
[2020-05-15 15:36:10] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 15:36:10] [INFO ] [Nat]Absence check using 40 positive place invariants in 77 ms returned sat
[2020-05-15 15:36:10] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 86 ms returned sat
[2020-05-15 15:36:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 15:36:12] [INFO ] [Nat]Absence check using state equation in 1639 ms returned sat
[2020-05-15 15:36:12] [INFO ] Deduced a trap composed of 10 places in 243 ms
[2020-05-15 15:36:12] [INFO ] Deduced a trap composed of 30 places in 219 ms
[2020-05-15 15:36:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 592 ms
[2020-05-15 15:36:12] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 64 ms.
[2020-05-15 15:36:19] [INFO ] Added : 399 causal constraints over 81 iterations in 7205 ms. Result :sat
[2020-05-15 15:36:20] [INFO ] Deduced a trap composed of 55 places in 395 ms
[2020-05-15 15:36:20] [INFO ] Deduced a trap composed of 32 places in 286 ms
[2020-05-15 15:36:21] [INFO ] Deduced a trap composed of 24 places in 301 ms
[2020-05-15 15:36:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1390 ms
[2020-05-15 15:36:21] [INFO ] [Real]Absence check using 40 positive place invariants in 50 ms returned sat
[2020-05-15 15:36:21] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 51 ms returned sat
[2020-05-15 15:36:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 15:36:22] [INFO ] [Real]Absence check using state equation in 1275 ms returned sat
[2020-05-15 15:36:22] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 15:36:23] [INFO ] [Nat]Absence check using 40 positive place invariants in 196 ms returned sat
[2020-05-15 15:36:23] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 88 ms returned sat
[2020-05-15 15:36:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 15:36:24] [INFO ] [Nat]Absence check using state equation in 1657 ms returned sat
[2020-05-15 15:36:25] [INFO ] Deduced a trap composed of 43 places in 276 ms
[2020-05-15 15:36:26] [INFO ] Deduced a trap composed of 8 places in 734 ms
[2020-05-15 15:36:26] [INFO ] Deduced a trap composed of 18 places in 234 ms
[2020-05-15 15:36:26] [INFO ] Deduced a trap composed of 24 places in 221 ms
[2020-05-15 15:36:26] [INFO ] Deduced a trap composed of 32 places in 190 ms
[2020-05-15 15:36:27] [INFO ] Deduced a trap composed of 33 places in 164 ms
[2020-05-15 15:36:27] [INFO ] Deduced a trap composed of 31 places in 157 ms
[2020-05-15 15:36:27] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2326 ms
[2020-05-15 15:36:27] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 39 ms.
[2020-05-15 15:36:32] [INFO ] Added : 230 causal constraints over 46 iterations in 5082 ms. Result :sat
[2020-05-15 15:36:32] [INFO ] Deduced a trap composed of 50 places in 250 ms
[2020-05-15 15:36:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 415 ms
[2020-05-15 15:36:32] [INFO ] [Real]Absence check using 40 positive place invariants in 50 ms returned sat
[2020-05-15 15:36:33] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 62 ms returned sat
[2020-05-15 15:36:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 15:36:34] [INFO ] [Real]Absence check using state equation in 1441 ms returned sat
[2020-05-15 15:36:34] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 15:36:34] [INFO ] [Nat]Absence check using 40 positive place invariants in 158 ms returned sat
[2020-05-15 15:36:34] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 51 ms returned sat
[2020-05-15 15:36:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 15:36:36] [INFO ] [Nat]Absence check using state equation in 1631 ms returned sat
[2020-05-15 15:36:36] [INFO ] Deduced a trap composed of 21 places in 204 ms
[2020-05-15 15:36:36] [INFO ] Deduced a trap composed of 20 places in 203 ms
[2020-05-15 15:36:37] [INFO ] Deduced a trap composed of 21 places in 137 ms
[2020-05-15 15:36:37] [INFO ] Deduced a trap composed of 20 places in 160 ms
[2020-05-15 15:36:37] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 936 ms
[2020-05-15 15:36:37] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 48 ms.
[2020-05-15 15:36:42] [INFO ] Added : 295 causal constraints over 60 iterations in 5545 ms. Result :sat
[2020-05-15 15:36:43] [INFO ] Deduced a trap composed of 45 places in 266 ms
[2020-05-15 15:36:43] [INFO ] Deduced a trap composed of 55 places in 268 ms
[2020-05-15 15:36:44] [INFO ] Deduced a trap composed of 49 places in 241 ms
[2020-05-15 15:36:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1130 ms
[2020-05-15 15:36:44] [INFO ] [Real]Absence check using 40 positive place invariants in 49 ms returned sat
[2020-05-15 15:36:44] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 46 ms returned sat
[2020-05-15 15:36:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 15:36:45] [INFO ] [Real]Absence check using state equation in 1371 ms returned sat
[2020-05-15 15:36:46] [INFO ] Deduced a trap composed of 17 places in 297 ms
[2020-05-15 15:36:46] [INFO ] Deduced a trap composed of 14 places in 227 ms
[2020-05-15 15:36:46] [INFO ] Deduced a trap composed of 18 places in 137 ms
[2020-05-15 15:36:46] [INFO ] Deduced a trap composed of 21 places in 144 ms
[2020-05-15 15:36:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1010 ms
[2020-05-15 15:36:46] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 15:36:46] [INFO ] [Nat]Absence check using 40 positive place invariants in 154 ms returned sat
[2020-05-15 15:36:47] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 45 ms returned sat
[2020-05-15 15:36:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 15:36:48] [INFO ] [Nat]Absence check using state equation in 1222 ms returned sat
[2020-05-15 15:36:48] [INFO ] Deduced a trap composed of 17 places in 324 ms
[2020-05-15 15:36:48] [INFO ] Deduced a trap composed of 13 places in 259 ms
[2020-05-15 15:36:49] [INFO ] Deduced a trap composed of 18 places in 158 ms
[2020-05-15 15:36:49] [INFO ] Deduced a trap composed of 19 places in 145 ms
[2020-05-15 15:36:49] [INFO ] Deduced a trap composed of 21 places in 191 ms
[2020-05-15 15:36:49] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1390 ms
[2020-05-15 15:36:49] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 43 ms.
[2020-05-15 15:36:58] [INFO ] Added : 378 causal constraints over 76 iterations in 8405 ms. Result :sat
[2020-05-15 15:36:58] [INFO ] [Real]Absence check using 40 positive place invariants in 59 ms returned sat
[2020-05-15 15:36:58] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 48 ms returned sat
[2020-05-15 15:36:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 15:36:59] [INFO ] [Real]Absence check using state equation in 1457 ms returned sat
[2020-05-15 15:37:00] [INFO ] Deduced a trap composed of 17 places in 326 ms
[2020-05-15 15:37:00] [INFO ] Deduced a trap composed of 14 places in 274 ms
[2020-05-15 15:37:00] [INFO ] Deduced a trap composed of 18 places in 159 ms
[2020-05-15 15:37:00] [INFO ] Deduced a trap composed of 21 places in 168 ms
[2020-05-15 15:37:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1188 ms
[2020-05-15 15:37:01] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 15:37:01] [INFO ] [Nat]Absence check using 40 positive place invariants in 155 ms returned sat
[2020-05-15 15:37:01] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 45 ms returned sat
[2020-05-15 15:37:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 15:37:02] [INFO ] [Nat]Absence check using state equation in 1363 ms returned sat
[2020-05-15 15:37:03] [INFO ] Deduced a trap composed of 17 places in 309 ms
[2020-05-15 15:37:03] [INFO ] Deduced a trap composed of 13 places in 270 ms
[2020-05-15 15:37:03] [INFO ] Deduced a trap composed of 18 places in 154 ms
[2020-05-15 15:37:03] [INFO ] Deduced a trap composed of 19 places in 290 ms
[2020-05-15 15:37:04] [INFO ] Deduced a trap composed of 21 places in 268 ms
[2020-05-15 15:37:04] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1602 ms
[2020-05-15 15:37:04] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 40 ms.
[2020-05-15 15:37:12] [INFO ] Added : 378 causal constraints over 76 iterations in 8394 ms. Result :sat
[2020-05-15 15:37:13] [INFO ] [Real]Absence check using 40 positive place invariants in 110 ms returned sat
[2020-05-15 15:37:13] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 59 ms returned sat
[2020-05-15 15:37:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 15:37:14] [INFO ] [Real]Absence check using state equation in 1421 ms returned sat
[2020-05-15 15:37:14] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 15:37:15] [INFO ] [Nat]Absence check using 40 positive place invariants in 77 ms returned sat
[2020-05-15 15:37:15] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 87 ms returned sat
[2020-05-15 15:37:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 15:37:16] [INFO ] [Nat]Absence check using state equation in 1288 ms returned sat
[2020-05-15 15:37:16] [INFO ] Deduced a trap composed of 14 places in 259 ms
[2020-05-15 15:37:16] [INFO ] Deduced a trap composed of 9 places in 225 ms
[2020-05-15 15:37:17] [INFO ] Deduced a trap composed of 21 places in 211 ms
[2020-05-15 15:37:17] [INFO ] Deduced a trap composed of 12 places in 222 ms
[2020-05-15 15:37:17] [INFO ] Deduced a trap composed of 10 places in 272 ms
[2020-05-15 15:37:18] [INFO ] Deduced a trap composed of 8 places in 391 ms
[2020-05-15 15:37:18] [INFO ] Deduced a trap composed of 28 places in 227 ms
[2020-05-15 15:37:18] [INFO ] Deduced a trap composed of 30 places in 305 ms
[2020-05-15 15:37:19] [INFO ] Deduced a trap composed of 32 places in 567 ms
[2020-05-15 15:37:19] [INFO ] Deduced a trap composed of 33 places in 197 ms
[2020-05-15 15:37:19] [INFO ] Deduced a trap composed of 36 places in 176 ms
[2020-05-15 15:37:19] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3523 ms
[2020-05-15 15:37:19] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 41 ms.
[2020-05-15 15:37:24] [INFO ] Added : 293 causal constraints over 59 iterations in 5042 ms. Result :sat
[2020-05-15 15:37:25] [INFO ] Deduced a trap composed of 54 places in 298 ms
[2020-05-15 15:37:25] [INFO ] Deduced a trap composed of 34 places in 251 ms
[2020-05-15 15:37:25] [INFO ] Deduced a trap composed of 45 places in 253 ms
[2020-05-15 15:37:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1132 ms
[2020-05-15 15:37:26] [INFO ] [Real]Absence check using 40 positive place invariants in 50 ms returned sat
[2020-05-15 15:37:26] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 51 ms returned sat
[2020-05-15 15:37:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 15:37:27] [INFO ] [Real]Absence check using state equation in 1339 ms returned sat
[2020-05-15 15:37:27] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 15:37:27] [INFO ] [Nat]Absence check using 40 positive place invariants in 164 ms returned sat
[2020-05-15 15:37:28] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 96 ms returned sat
[2020-05-15 15:37:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 15:37:29] [INFO ] [Nat]Absence check using state equation in 1803 ms returned sat
[2020-05-15 15:37:30] [INFO ] Deduced a trap composed of 20 places in 566 ms
[2020-05-15 15:37:30] [INFO ] Deduced a trap composed of 31 places in 282 ms
[2020-05-15 15:37:31] [INFO ] Deduced a trap composed of 39 places in 192 ms
[2020-05-15 15:37:31] [INFO ] Deduced a trap composed of 23 places in 142 ms
[2020-05-15 15:37:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1524 ms
[2020-05-15 15:37:31] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 38 ms.
[2020-05-15 15:37:36] [INFO ] Added : 265 causal constraints over 54 iterations in 5619 ms. Result :sat
[2020-05-15 15:37:37] [INFO ] Deduced a trap composed of 72 places in 242 ms
[2020-05-15 15:37:37] [INFO ] Deduced a trap composed of 38 places in 177 ms
[2020-05-15 15:37:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 714 ms
[2020-05-15 15:37:37] [INFO ] [Real]Absence check using 40 positive place invariants in 54 ms returned sat
[2020-05-15 15:37:37] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 61 ms returned sat
[2020-05-15 15:37:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 15:37:39] [INFO ] [Real]Absence check using state equation in 2080 ms returned sat
[2020-05-15 15:37:40] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 15:37:40] [INFO ] [Nat]Absence check using 40 positive place invariants in 103 ms returned sat
[2020-05-15 15:37:40] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 111 ms returned sat
[2020-05-15 15:37:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 15:37:42] [INFO ] [Nat]Absence check using state equation in 1899 ms returned sat
[2020-05-15 15:37:42] [INFO ] Deduced a trap composed of 22 places in 363 ms
[2020-05-15 15:37:43] [INFO ] Deduced a trap composed of 16 places in 465 ms
[2020-05-15 15:37:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 970 ms
[2020-05-15 15:37:43] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 50 ms.
[2020-05-15 15:37:49] [INFO ] Added : 256 causal constraints over 52 iterations in 5808 ms. Result :sat
[2020-05-15 15:37:49] [INFO ] Deduced a trap composed of 62 places in 306 ms
[2020-05-15 15:37:50] [INFO ] Deduced a trap composed of 60 places in 295 ms
[2020-05-15 15:37:50] [INFO ] Deduced a trap composed of 68 places in 298 ms
[2020-05-15 15:37:51] [INFO ] Deduced a trap composed of 66 places in 867 ms
[2020-05-15 15:37:51] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2656 ms
[2020-05-15 15:37:52] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-05-15 15:37:52] [INFO ] Flatten gal took : 222 ms
FORMULA DES-PT-50b-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50b-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50b-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-15 15:37:52] [INFO ] Flatten gal took : 139 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-15 15:37:52] [INFO ] Applying decomposition
[2020-05-15 15:37:53] [INFO ] Flatten gal took : 154 ms
[2020-05-15 15:37:53] [INFO ] Input system was already deterministic with 430 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/graph8966677878561884953.txt, -o, /tmp/graph8966677878561884953.bin, -w, /tmp/graph8966677878561884953.weights], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 430 rows 479 cols
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph8966677878561884953.bin, -l, -1, -v, -w, /tmp/graph8966677878561884953.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-15 15:37:53] [INFO ] Computed 65 place invariants in 35 ms
inv : -2*p0 - 2*p2 + 98*p6 + 96*p7 + 94*p8 + 92*p9 + 90*p10 + 88*p11 + 86*p12 + 84*p13 + 82*p14 + 80*p15 + 78*p16 + 76*p17 + 74*p18 + 72*p19 + 70*p20 + 68*p21 + 66*p22 + 64*p23 + 62*p24 + 60*p25 + 58*p26 + 56*p27 + 54*p28 + 52*p29 + 50*p30 + 48*p31 + 46*p32 + 44*p33 + 42*p34 + 40*p35 + 38*p36 + 36*p37 + 34*p38 + 32*p39 + 30*p40 + 28*p41 + 26*p42 + 24*p43 + 22*p44 + 20*p45 + 18*p46 + 16*p47 + 14*p48 + 12*p49 + 10*p50 + 8*p51 + 6*p52 + 4*p53 + 2*p54 - 100*p56 - 98*p57 - 96*p58 - 94*p59 - 92*p60 - 90*p61 - 88*p62 - 86*p63 - 84*p64 - 82*p65 - 80*p66 - 78*p67 - 76*p68 - 74*p69 - 72*p70 - 70*p71 - 68*p72 - 66*p73 - 64*p74 - 62*p75 - 60*p76 - 58*p77 - 56*p78 - 54*p79 - 52*p80 - 50*p81 - 48*p82 - 46*p83 - 44*p84 - 42*p85 - 40*p86 - 38*p87 - 36*p88 - 34*p89 - 32*p90 - 30*p91 - 28*p92 - 26*p93 - 24*p94 - 22*p95 - 20*p96 - 18*p97 - 16*p98 - 14*p99 - 12*p100 - 10*p101 - 8*p102 - 6*p103 - 4*p104 - 2*p105 - 2*p208 - 2*p326 + 2*p330 + p332 + p334 + p340 + p344 + p439 + p442 + p445 + p452 + p456 + p460 + p463 + p466 - 2*p471 - 2*p472 - p476 - p478 = -2
inv : -2*p0 - p2 + 49*p6 + 48*p7 + 47*p8 + 46*p9 + 45*p10 + 44*p11 + 43*p12 + 42*p13 + 41*p14 + 40*p15 + 39*p16 + 38*p17 + 37*p18 + 36*p19 + 35*p20 + 34*p21 + 33*p22 + 32*p23 + 31*p24 + 30*p25 + 29*p26 + 28*p27 + 27*p28 + 26*p29 + 25*p30 + 24*p31 + 23*p32 + 22*p33 + 21*p34 + 20*p35 + 19*p36 + 18*p37 + 17*p38 + 16*p39 + 15*p40 + 14*p41 + 13*p42 + 12*p43 + 11*p44 + 10*p45 + 9*p46 + 8*p47 + 7*p48 + 6*p49 + 5*p50 + 4*p51 + 3*p52 + 2*p53 + p54 - 50*p56 - 49*p57 - 48*p58 - 47*p59 - 46*p60 - 45*p61 - 44*p62 - 43*p63 - 42*p64 - 41*p65 - 40*p66 - 39*p67 - 38*p68 - 37*p69 - 36*p70 - 35*p71 - 34*p72 - 33*p73 - 32*p74 - 31*p75 - 30*p76 - 29*p77 - 28*p78 - 27*p79 - 26*p80 - 25*p81 - 24*p82 - 23*p83 - 22*p84 - 21*p85 - 20*p86 - 19*p87 - 18*p88 - 17*p89 - 16*p90 - 15*p91 - 14*p92 - 13*p93 - 12*p94 - 11*p95 - 10*p96 - 9*p97 - 8*p98 - 7*p99 - 6*p100 - 5*p101 - 4*p102 - 3*p103 - 2*p104 - p105 - 2*p208 - 2*p326 - p327 + p330 + p332 - p335 - p336 - p337 + p340 + p342 - p345 - p346 + p350 + p372 + p403 - p404 - p405 - p429 - p432 + p436 + p439 + p442 + p445 + p450 + p454 - p471 - p472 - p476 = -2
inv : p0 + p208 + p326 + p327 + p335 + p336 + p337 + p345 + p346 + p404 + p405 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p432 + p433 = 1
inv : p0 + p208 + p209 + p267 + p268 + p272 + p273 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p303 + p304 = 1
inv : p0 + p208 + p326 + p327 + p335 + p336 + p337 + p345 + p346 + p347 + p373 + p374 + p398 + p399 + p400 = 1
inv : p0 + p208 + p326 + p327 + p335 + p336 + p337 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p361 + p372 - p388 + p403 + p419 - p429 = 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 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 = 1
inv : p0 + p208 + p326 + p327 + p335 + p336 + p337 + p345 + p346 + p404 + p405 + p406 + p407 + p428 + p429 + p432 + p433 = 1
inv : p0 + p208 + p326 + p327 + p335 + p336 + p337 + p345 + p346 + p347 + p373 + p374 + p375 + p395 + p396 + p397 = 1
inv : p0 + p1 + p2 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 = 1
inv : p0 + p208 + p209 + p210 + p262 + p263 + p264 + p265 + p266 = 1
inv : 3*p0 + p2 - 49*p6 - 48*p7 - 47*p8 - 46*p9 - 45*p10 - 44*p11 - 43*p12 - 42*p13 - 41*p14 - 40*p15 - 39*p16 - 38*p17 - 37*p18 - 36*p19 - 35*p20 - 34*p21 - 33*p22 - 32*p23 - 31*p24 - 30*p25 - 29*p26 - 28*p27 - 27*p28 - 26*p29 - 25*p30 - 24*p31 - 23*p32 - 22*p33 - 21*p34 - 20*p35 - 19*p36 - 18*p37 - 17*p38 - 16*p39 - 15*p40 - 14*p41 - 13*p42 - 12*p43 - 11*p44 - 10*p45 - 9*p46 - 8*p47 - 7*p48 - 6*p49 - 5*p50 - 4*p51 - 3*p52 - 2*p53 - p54 + 50*p56 + 49*p57 + 48*p58 + 47*p59 + 46*p60 + 45*p61 + 44*p62 + 43*p63 + 42*p64 + 41*p65 + 40*p66 + 39*p67 + 38*p68 + 37*p69 + 36*p70 + 35*p71 + 34*p72 + 33*p73 + 32*p74 + 31*p75 + 30*p76 + 29*p77 + 28*p78 + 27*p79 + 26*p80 + 25*p81 + 24*p82 + 23*p83 + 22*p84 + 21*p85 + 20*p86 + 19*p87 + 18*p88 + 17*p89 + 16*p90 + 15*p91 + 14*p92 + 13*p93 + 12*p94 + 11*p95 + 10*p96 + 9*p97 + 8*p98 + 7*p99 + 6*p100 + 5*p101 + 4*p102 + 3*p103 + 2*p104 + p105 + 3*p208 + 3*p326 + 2*p327 - p330 - p332 + 2*p335 + 2*p336 + 2*p337 + p338 + p339 + p341 + p345 + p346 - p350 - p372 - p403 + p404 + p405 + p429 + p432 - p436 - p439 - p442 - p445 - p450 - p454 + p471 + p472 + p476 = 3
inv : p0 + p208 + p326 + p327 + p335 + p336 + p337 + p345 + p346 + p404 + p405 + p406 + p407 + p408 + p409 + p424 + p425 + p432 + p433 = 1
inv : p0 + p208 + p326 + p327 + p335 + p336 + p337 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p363 + p372 - p391 + p403 + p421 - p429 = 1
inv : p0 + p208 + p326 + p327 + p335 + p336 + p337 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p365 + p372 - p394 + p403 + p423 - p429 = 1
inv : p364 - p372 + p391 - p403 - p421 + p429 = 0
inv : p0 + p208 + p326 + p327 + p335 + p336 + p337 + p345 + p346 + p404 + p405 + p406 + p407 + p408 + p426 + p427 + p432 + p433 = 1
inv : p0 + p208 + p209 + p267 + p268 + p272 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p0 + p208 + p326 + p471 + p472 + p473 + p474 + p475 + p476 = 1
inv : -2*p2 + 98*p6 + 96*p7 + 94*p8 + 92*p9 + 90*p10 + 88*p11 + 86*p12 + 84*p13 + 82*p14 + 80*p15 + 78*p16 + 76*p17 + 74*p18 + 72*p19 + 70*p20 + 68*p21 + 66*p22 + 64*p23 + 62*p24 + 60*p25 + 58*p26 + 56*p27 + 54*p28 + 52*p29 + 50*p30 + 48*p31 + 46*p32 + 44*p33 + 42*p34 + 40*p35 + 38*p36 + 36*p37 + 34*p38 + 32*p39 + 30*p40 + 28*p41 + 26*p42 + 24*p43 + 22*p44 + 20*p45 + 18*p46 + 16*p47 + 14*p48 + 12*p49 + 10*p50 + 8*p51 + 6*p52 + 4*p53 + 2*p54 - 50*p56 - 49*p57 - 48*p58 - 47*p59 - 46*p60 - 45*p61 - 44*p62 - 43*p63 - 42*p64 - 41*p65 - 40*p66 - 39*p67 - 38*p68 - 37*p69 - 36*p70 - 35*p71 - 34*p72 - 33*p73 - 32*p74 - 31*p75 - 30*p76 - 29*p77 - 28*p78 - 27*p79 - 26*p80 - 25*p81 - 24*p82 - 23*p83 - 22*p84 - 21*p85 - 20*p86 - 19*p87 - 18*p88 - 17*p89 - 16*p90 - 15*p91 - 14*p92 - 13*p93 - 12*p94 - 11*p95 - 10*p96 - 9*p97 - 8*p98 - 7*p99 - 6*p100 - 5*p101 - 4*p102 - 3*p103 - 2*p104 - p105 - 50*p158 - 49*p159 - 48*p160 - 47*p161 - 46*p162 - 45*p163 - 44*p164 - 43*p165 - 42*p166 - 41*p167 - 40*p168 - 39*p169 - 38*p170 - 37*p171 - 36*p172 - 35*p173 - 34*p174 - 33*p175 - 32*p176 - 31*p177 - 30*p178 - 29*p179 - 28*p180 - 27*p181 - 26*p182 - 25*p183 - 24*p184 - 23*p185 - 22*p186 - 21*p187 - 20*p188 - 19*p189 - 18*p190 - 17*p191 - 16*p192 - 15*p193 - 14*p194 - 13*p195 - 12*p196 - 11*p197 - 10*p198 - 9*p199 - 8*p200 - 7*p201 - 6*p202 - 5*p203 - 4*p204 - 3*p205 - 2*p206 - p207 + p209 + p230 + p232 + p234 + p237 + p239 + p244 + p245 + p256 + p258 + p260 + p261 + p267 + p268 - p271 + p272 + p273 + p286 + p287 + p294 + p300 - p302 + p303 + p304 - p307 - p309 - p311 - p313 - p315 - p316 - p317 - p318 - p322 - p326 + 2*p330 + p332 + p334 + p340 + p344 - p431 + p433 + p436 + p439 + p442 + p445 + p450 + p454 + p460 + p461 + p463 + p464 + p466 + p467 + p468 + p469 + p470 - p471 - p472 - p476 = 0
inv : p301 + p302 - p303 - p304 = 0
inv : p0 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p222 + p223 + p224 + p225 + p226 + p227 + p228 = 1
inv : p0 + p208 + p326 + p327 + p335 + p336 + p337 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p369 + p372 - p400 + p403 + p427 - p429 = 1
inv : p0 + p208 + p209 + p267 + p268 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p285 = 1
inv : p0 + p208 + p209 + p267 + p323 + p324 + p325 = 1
inv : p362 - p372 + p388 - p403 - p419 + p429 = 0
inv : p0 + p208 + p326 + p327 + p335 + p336 + p337 + p338 + p339 + p340 + p343 + p344 = 1
inv : p0 + p208 + p326 + p327 + p335 + p336 + p337 + p345 + p346 + p347 + p373 + p401 + p402 + p403 = 1
inv : p0 + 2*p2 - 98*p6 - 96*p7 - 94*p8 - 92*p9 - 90*p10 - 88*p11 - 86*p12 - 84*p13 - 82*p14 - 80*p15 - 78*p16 - 76*p17 - 74*p18 - 72*p19 - 70*p20 - 68*p21 - 66*p22 - 64*p23 - 62*p24 - 60*p25 - 58*p26 - 56*p27 - 54*p28 - 52*p29 - 50*p30 - 48*p31 - 46*p32 - 44*p33 - 42*p34 - 40*p35 - 38*p36 - 36*p37 - 34*p38 - 32*p39 - 30*p40 - 28*p41 - 26*p42 - 24*p43 - 22*p44 - 20*p45 - 18*p46 - 16*p47 - 14*p48 - 12*p49 - 10*p50 - 8*p51 - 6*p52 - 4*p53 - 2*p54 + 50*p56 + 49*p57 + 48*p58 + 47*p59 + 46*p60 + 45*p61 + 44*p62 + 43*p63 + 42*p64 + 41*p65 + 40*p66 + 39*p67 + 38*p68 + 37*p69 + 36*p70 + 35*p71 + 34*p72 + 33*p73 + 32*p74 + 31*p75 + 30*p76 + 29*p77 + 28*p78 + 27*p79 + 26*p80 + 25*p81 + 24*p82 + 23*p83 + 22*p84 + 21*p85 + 20*p86 + 19*p87 + 18*p88 + 17*p89 + 16*p90 + 15*p91 + 14*p92 + 13*p93 + 12*p94 + 11*p95 + 10*p96 + 9*p97 + 8*p98 + 7*p99 + 6*p100 + 5*p101 + 4*p102 + 3*p103 + 2*p104 + p105 + 50*p158 + 49*p159 + 48*p160 + 47*p161 + 46*p162 + 45*p163 + 44*p164 + 43*p165 + 42*p166 + 41*p167 + 40*p168 + 39*p169 + 38*p170 + 37*p171 + 36*p172 + 35*p173 + 34*p174 + 33*p175 + 32*p176 + 31*p177 + 30*p178 + 29*p179 + 28*p180 + 27*p181 + 26*p182 + 25*p183 + 24*p184 + 23*p185 + 22*p186 + 21*p187 + 20*p188 + 19*p189 + 18*p190 + 17*p191 + 16*p192 + 15*p193 + 14*p194 + 13*p195 + 12*p196 + 11*p197 + 10*p198 + 9*p199 + 8*p200 + 7*p201 + 6*p202 + 5*p203 + 4*p204 + 3*p205 + 2*p206 + p207 + p208 + p210 + p211 + p212 + p213 + p229 + p231 + p233 + p235 + p236 + p238 + p240 + p241 + p242 + p243 - p256 - p258 - p260 - p261 - p267 - p268 + p271 - p272 - p273 - p286 - p287 - p294 - p300 + p302 - p303 - p304 + p307 + p309 + p311 + p313 + p315 + p316 + p317 + p318 + p322 + p326 - 2*p330 - p332 - p334 - p340 - p344 + p431 - p433 - p436 - p439 - p442 - p445 - p450 - p454 - p460 - p461 - p463 - p464 - p466 - p467 - p468 - p469 - p470 + p471 + p472 + p476 = 1
inv : p0 + p208 + p209 + p210 + p211 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 = 1
inv : p0 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 = 1
inv : p454 + p455 - p456 - p457 = 0
inv : p370 - p372 + p400 - p403 - p427 + p429 = 0
inv : p2 - 49*p6 - 48*p7 - 47*p8 - 46*p9 - 45*p10 - 44*p11 - 43*p12 - 42*p13 - 41*p14 - 40*p15 - 39*p16 - 38*p17 - 37*p18 - 36*p19 - 35*p20 - 34*p21 - 33*p22 - 32*p23 - 31*p24 - 30*p25 - 29*p26 - 28*p27 - 27*p28 - 26*p29 - 25*p30 - 24*p31 - 23*p32 - 22*p33 - 21*p34 - 20*p35 - 19*p36 - 18*p37 - 17*p38 - 16*p39 - 15*p40 - 14*p41 - 13*p42 - 12*p43 - 11*p44 - 10*p45 - 9*p46 - 8*p47 - 7*p48 - 6*p49 - 5*p50 - 4*p51 - 3*p52 - 2*p53 - p54 + 50*p56 + 49*p57 + 48*p58 + 47*p59 + 46*p60 + 45*p61 + 44*p62 + 43*p63 + 42*p64 + 41*p65 + 40*p66 + 39*p67 + 38*p68 + 37*p69 + 36*p70 + 35*p71 + 34*p72 + 33*p73 + 32*p74 + 31*p75 + 30*p76 + 29*p77 + 28*p78 + 27*p79 + 26*p80 + 25*p81 + 24*p82 + 23*p83 + 22*p84 + 21*p85 + 20*p86 + 19*p87 + 18*p88 + 17*p89 + 16*p90 + 15*p91 + 14*p92 + 13*p93 + 12*p94 + 11*p95 + 10*p96 + 9*p97 + 8*p98 + 7*p99 + 6*p100 + 5*p101 + 4*p102 + 3*p103 + 2*p104 + p105 + p248 + p250 + p252 + p253 - p256 - p258 - p260 - p261 - p327 - p330 - p334 - p335 - p336 - p340 - p344 - p437 - p438 - p439 - p441 - p442 - p444 - p445 - p450 - p451 - p456 - p457 - p460 - p461 - p463 - p464 - p466 - p467 - p468 - p469 - p470 + p471 + p472 + p476 = 0
inv : p0 + p208 + p326 + p327 + p335 + p336 + p337 + p345 + p346 + p347 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 = 1
inv : p0 + p1 + p2 + p3 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 = 1
inv : p0 + p208 + p326 + p327 + p335 + p336 + p337 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p372 - p382 + p403 + p415 - p429 = 1
inv : p0 + p208 + p326 + p327 + p335 + p336 + p337 + p345 + p346 + p347 + p373 + p374 + p375 + p376 + p377 + p389 + p390 + p391 = 1
inv : p0 + p1 + p2 + p3 + p4 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 = 1
inv : p0 + p208 + p326 + p327 + p335 + p336 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p456 + p457 = 1
inv : p0 + p208 + p209 + p267 + p268 + p272 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p321 + p322 = 1
inv : p0 + p208 + p326 + p327 + p328 + p329 + p330 + p333 + p334 = 1
inv : p0 + p208 + p326 + p327 + p335 + p336 + p337 + p345 + p346 + p404 + p405 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p418 + p419 + p432 + p433 = 1
inv : p0 - p2 + 49*p6 + 48*p7 + 47*p8 + 46*p9 + 45*p10 + 44*p11 + 43*p12 + 42*p13 + 41*p14 + 40*p15 + 39*p16 + 38*p17 + 37*p18 + 36*p19 + 35*p20 + 34*p21 + 33*p22 + 32*p23 + 31*p24 + 30*p25 + 29*p26 + 28*p27 + 27*p28 + 26*p29 + 25*p30 + 24*p31 + 23*p32 + 22*p33 + 21*p34 + 20*p35 + 19*p36 + 18*p37 + 17*p38 + 16*p39 + 15*p40 + 14*p41 + 13*p42 + 12*p43 + 11*p44 + 10*p45 + 9*p46 + 8*p47 + 7*p48 + 6*p49 + 5*p50 + 4*p51 + 3*p52 + 2*p53 + p54 - 50*p56 - 49*p57 - 48*p58 - 47*p59 - 46*p60 - 45*p61 - 44*p62 - 43*p63 - 42*p64 - 41*p65 - 40*p66 - 39*p67 - 38*p68 - 37*p69 - 36*p70 - 35*p71 - 34*p72 - 33*p73 - 32*p74 - 31*p75 - 30*p76 - 29*p77 - 28*p78 - 27*p79 - 26*p80 - 25*p81 - 24*p82 - 23*p83 - 22*p84 - 21*p85 - 20*p86 - 19*p87 - 18*p88 - 17*p89 - 16*p90 - 15*p91 - 14*p92 - 13*p93 - 12*p94 - 11*p95 - 10*p96 - 9*p97 - 8*p98 - 7*p99 - 6*p100 - 5*p101 - 4*p102 - 3*p103 - 2*p104 - p105 + p208 + p209 + p210 + p211 + p212 + p246 + p247 + p249 + p251 + p256 + p258 + p260 + p261 + p327 + p330 + p334 + p335 + p336 + p340 + p344 + p437 + p438 + p439 + p441 + p442 + p444 + p445 + p450 + p451 + p456 + p457 + p460 + p461 + p463 + p464 + p466 + p467 + p468 + p469 + p470 - p471 - p472 - p476 = 1
inv : p0 + p208 + p326 + p327 + p335 + p336 + p337 + p345 + p346 + p347 + p373 + p374 + p375 + p376 + p392 + p393 + p394 = 1
inv : p360 - p372 + p385 - p403 - p417 + p429 = 0
inv : p0 + p208 + p326 + p327 + p335 + p336 + p337 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p359 + p372 - p385 + p403 + p417 - p429 = 1
inv : p0 + p208 + p326 + p327 + p335 + p336 + p337 + p345 + p346 + p347 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p383 + p384 + p385 = 1
inv : p0 + p208 + p209 + p267 + p268 + p269 + p270 + p271 = 1
inv : p0 + p208 + p326 + p327 + p335 + p336 + p337 + p345 + p346 + p404 + p405 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p416 + p417 + p432 + p433 = 1
inv : p0 + p208 + p326 + p327 + p335 + p336 + p337 + p345 + p434 + p435 + p436 = 1
inv : p368 - p372 + p397 - p403 - p425 + p429 = 0
inv : p430 + p431 - p432 - p433 = 0
inv : p0 + p208 + p326 + p327 + p335 + p336 + p337 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p367 + p372 - p397 + p403 + p425 - p429 = 1
inv : 2*p0 + 2*p2 - 98*p6 - 96*p7 - 94*p8 - 92*p9 - 90*p10 - 88*p11 - 86*p12 - 84*p13 - 82*p14 - 80*p15 - 78*p16 - 76*p17 - 74*p18 - 72*p19 - 70*p20 - 68*p21 - 66*p22 - 64*p23 - 62*p24 - 60*p25 - 58*p26 - 56*p27 - 54*p28 - 52*p29 - 50*p30 - 48*p31 - 46*p32 - 44*p33 - 42*p34 - 40*p35 - 38*p36 - 36*p37 - 34*p38 - 32*p39 - 30*p40 - 28*p41 - 26*p42 - 24*p43 - 22*p44 - 20*p45 - 18*p46 - 16*p47 - 14*p48 - 12*p49 - 10*p50 - 8*p51 - 6*p52 - 4*p53 - 2*p54 + 100*p56 + 98*p57 + 96*p58 + 94*p59 + 92*p60 + 90*p61 + 88*p62 + 86*p63 + 84*p64 + 82*p65 + 80*p66 + 78*p67 + 76*p68 + 74*p69 + 72*p70 + 70*p71 + 68*p72 + 66*p73 + 64*p74 + 62*p75 + 60*p76 + 58*p77 + 56*p78 + 54*p79 + 52*p80 + 50*p81 + 48*p82 + 46*p83 + 44*p84 + 42*p85 + 40*p86 + 38*p87 + 36*p88 + 34*p89 + 32*p90 + 30*p91 + 28*p92 + 26*p93 + 24*p94 + 22*p95 + 20*p96 + 18*p97 + 16*p98 + 14*p99 + 12*p100 + 10*p101 + 8*p102 + 6*p103 + 4*p104 + 2*p105 + 2*p208 + 2*p326 - 2*p330 - p332 - p334 - p340 - p344 - p439 - p442 - p445 - p450 - p451 + p453 - p456 - p460 - p463 - p466 + 2*p471 + 2*p472 + p476 + p478 = 2
inv : p0 + p208 + p326 + p327 + p335 + p336 + p337 + p345 + p346 + p347 + p373 + p374 + p375 + p376 + p377 + p378 + p386 + p387 + p388 = 1
inv : p0 + p208 + p326 + p327 + p335 + p336 + p337 + p345 + p346 + p404 + p405 + p406 + p407 + p408 + p409 + p410 + p422 + p423 + p432 + p433 = 1
inv : p0 + p208 + p326 + p471 + p472 + p473 + p474 + p477 + p478 = 1
inv : p0 + p208 + p326 + p327 + p335 + p336 + p337 + p345 + p346 + p404 + p405 + p406 + p407 + p408 + p409 + p410 + p411 + p420 + p421 + p432 + p433 = 1
inv : p0 + p208 + p326 + p327 + p335 + p336 + p337 + p345 + p346 + p347 + p348 + p349 + p350 + p371 + p372 = 1
inv : p358 - p372 + p382 - p403 - p415 + p429 = 0
inv : p366 - p372 + p394 - p403 - p423 + p429 = 0
inv : p0 + p208 + p209 + p267 + p268 + p272 + p273 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p299 + p300 + p303 + p304 = 1
inv : p0 + p208 + p326 + p327 + p328 + p329 + p330 + p331 + p332 = 1
inv : p0 + p208 + p326 + p327 + p335 + p458 + p459 + p460 + p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 = 1
Total of 65 invariants.
[2020-05-15 15:37:53] [INFO ] Computed 65 place invariants in 44 ms
[2020-05-15 15:37:53] [INFO ] Decomposing Gal with order
[2020-05-15 15:37:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-15 15:37:54] [INFO ] Removed a total of 32 redundant transitions.
[2020-05-15 15:37:54] [INFO ] Flatten gal took : 242 ms
[2020-05-15 15:37:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 20 ms.
[2020-05-15 15:37:54] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 24 ms
[2020-05-15 15:37:54] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 4 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 : !((X(G(((((("(i11.i1.u76.p438==1)")U("((u39.p109==1)&&(u39.p323==1))"))&&(G("((u39.p109==1)&&(u39.p323==1))")))&&(G("(i11.i1.u76.p438==1)")))&&("(i9.i1.u52.p363==1)"))&&("(i9.i4.u62.p391==1)")))))
Formula 0 simplified : !XG("(i9.i1.u52.p363==1)" & "(i9.i4.u62.p391==1)" & ("(i11.i1.u76.p438==1)" U "((u39.p109==1)&&(u39.p323==1))") & G"((u39.p109==1)&&(u39.p323==1))" & G"(i11.i1.u76.p438==1)")
built 23 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 9 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 11 ordering constraints for composite.
built 15 ordering constraints for composite.
built 7 ordering constraints for composite.
built 11 ordering constraints for composite.
built 6 ordering constraints for composite.
built 23 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 3 ordering constraints for composite.
built 9 ordering constraints for composite.
built 8 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 23 ordering constraints for composite.
built 5 ordering constraints for composite.
built 37 ordering constraints for composite.
built 30 ordering constraints for composite.
built 14 ordering constraints for composite.
built 25 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 11 ordering constraints for composite.
built 6 ordering constraints for composite.
[2020-05-15 15:37:55] [INFO ] Proved 479 variables to be positive in 2110 ms
[2020-05-15 15:37:55] [INFO ] Computing symmetric may disable matrix : 430 transitions.
[2020-05-15 15:37:55] [INFO ] Computation of disable matrix completed :0/430 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 15:37:55] [INFO ] Computation of Complete disable matrix. took 107 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 15:37:55] [INFO ] Computing symmetric may enable matrix : 430 transitions.
[2020-05-15 15:37:55] [INFO ] Computation of Complete enable matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 15:38:08] [INFO ] Computing symmetric co enabling matrix : 430 transitions.
[2020-05-15 15:38:11] [INFO ] Computation of co-enabling matrix(0/430) took 3899 ms. Total solver calls (SAT/UNSAT): 316(113/203)
[2020-05-15 15:38:16] [INFO ] Computation of co-enabling matrix(2/430) took 8255 ms. Total solver calls (SAT/UNSAT): 805(550/255)
SMT solver raised 'unknown', retrying with same input.
SMT solver raised 'unknown' twice, overapproximating result to 1.
[2020-05-15 15:38:20] [INFO ] Computation of co-enabling matrix(4/430) took 12103 ms. Total solver calls (SAT/UNSAT): 1087(796/291)
[2020-05-15 15:38:20] [INFO ] Computation of Finished co-enabling matrix. took 12180 ms. Total solver calls (SAT/UNSAT): 1087(796/291)
[2020-05-15 15:38:20] [INFO ] Computing Do-Not-Accords matrix : 430 transitions.
[2020-05-15 15:38:22] [INFO ] Computation of Completed DNA matrix. took 2264 ms. Total solver calls (SAT/UNSAT): 1017(0/1017)
[2020-05-15 15:38:22] [INFO ] Built C files in 29862ms 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 10042 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 81 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, X([](( ( ( ( ((LTLAP0==true))U((LTLAP1==true)) ) && ( []((LTLAP1==true)) ) ) && ( []((LTLAP0==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((LTLAP1==true)) ) && ( []((LTLAP1==true)) ) ) && ( []((LTLAP0==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((LTLAP1==true)) ) && ( []((LTLAP1==true)) ) ) && ( []((LTLAP0==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 t62, t99, t139, t141, t154, u39.t83, i1.i1.u16.t133, i1.i1.u16.t135, i1.i1.u16.t137, i1.i2.t121, i1.i2.u20.t123, i1.i3.u18.t126, i1.i3.u18.t128, i1.i3.u18.t130, i2.i1.u14.t144, i2.i1.u14.t146, i2.i1.u14.t149, i2.i1.u14.t151, i2.i1.u14.t153, i4.u35.t90, i4.u35.t92, i4.u35.t94, i4.u35.t96, i4.u35.t98, i5.i0.t166, i5.i0.u7.t162, i5.i0.u7.t164, i5.i1.u26.t112, i5.i1.u27.t111, i5.i1.u27.t117, i6.i0.t160, i6.i0.u9.t156, i6.i0.u9.t158, i6.i1.u23.t118, i6.i1.u29.t102, i6.i1.u29.t109, i8.t80, i9.t58, i9.t54, i9.i0.u67.t52, i9.i0.u75.t41, i9.i1.u48.t76, i9.i1.u66.t55, i9.i2.t56, i9.i2.t60, i9.i2.u63.t61, i9.i2.u65.t57, i9.i3.u64.t59, i9.i4.u62.t63, i10.t64, i10.i0.t66, i10.i0.u59.t68, i10.i0.u60.t67, i10.i1.u61.t65, i11.i1.u44.t78, i11.i1.u76.t33, i11.i1.u76.t36, i11.i1.u76.t38, i11.i1.u83.t23, i11.i1.u83.t25, i11.i1.u83.t27, i12.u86.t17, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/366/62/428
Computing Next relation with stutter on 1.11096e+10 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
72419 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,724.336,2212924,1,0,3.65476e+06,196816,2445,7.38623e+06,1714,930464,1633368
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DES-PT-50b-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(((G("((((u39.p130==1)&&(u39.p323==1))&&(i8.u42.p53==1))&&(i8.u42.p330==1))"))U("((i12.u86.p68==1)&&(i12.u86.p471==1))"))||("((((u39.p130==1)&&(u39.p323==1))&&(i12.u86.p68==1))&&(i12.u86.p471==1))"))))
Formula 1 simplified : !X("((((u39.p130==1)&&(u39.p323==1))&&(i12.u86.p68==1))&&(i12.u86.p471==1))" | (G"((((u39.p130==1)&&(u39.p323==1))&&(i8.u42.p53==1))&&(i8.u42.p330==1))" U "((i12.u86.p68==1)&&(i12.u86.p471==1))"))
Computing Next relation with stutter on 1.11096e+10 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
1358 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,737.921,2213320,1,0,3.65476e+06,196816,2762,8.55935e+06,2099,930464,1842449
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA DES-PT-50b-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G((G((F(X(((F("((u39.p123==1)&&(u39.p323==1))"))&&("(i8.u42.p37==1)"))&&("(i8.u42.p330==1)"))))&&(F(G("((u39.p123==1)&&(u39.p323==1))")))))||("((i8.u42.p37==1)&&(i8.u42.p330==1))"))))
Formula 2 simplified : !G("((i8.u42.p37==1)&&(i8.u42.p330==1))" | G(FX("(i8.u42.p37==1)" & "(i8.u42.p330==1)" & F"((u39.p123==1)&&(u39.p323==1))") & FG"((u39.p123==1)&&(u39.p323==1))"))
Computing Next relation with stutter on 1.11096e+10 deadlock states
Detected timeout of ITS tools.
[2020-05-15 15:59:11] [INFO ] Applying decomposition
[2020-05-15 15:59:11] [INFO ] Flatten gal took : 76 ms
[2020-05-15 15:59:11] [INFO ] Decomposing Gal with order
[2020-05-15 15:59:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-15 15:59:11] [INFO ] Removed a total of 217 redundant transitions.
[2020-05-15 15:59:11] [INFO ] Flatten gal took : 129 ms
[2020-05-15 15:59:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 752 labels/synchronizations in 60 ms.
[2020-05-15 15:59:12] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 12 ms
[2020-05-15 15:59:12] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 4 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 11 LTL properties
Checking formula 0 : !((G((G((F(X(((F("((i0.i0.u6.p123==1)&&(i1.i0.i1.u35.p323==1))"))&&("(i0.i0.i0.u4.p37==1)"))&&("(i1.i1.i0.i0.u137.p330==1)"))))&&(F(G("((i0.i0.u6.p123==1)&&(i1.i0.i1.u35.p323==1))")))))||("((i0.i0.i0.u4.p37==1)&&(i1.i1.i0.i0.u137.p330==1))"))))
Formula 0 simplified : !G("((i0.i0.i0.u4.p37==1)&&(i1.i1.i0.i0.u137.p330==1))" | G(FX("(i0.i0.i0.u4.p37==1)" & "(i1.i1.i0.i0.u137.p330==1)" & F"((i0.i0.u6.p123==1)&&(i1.i0.i1.u35.p323==1))") & FG"((i0.i0.u6.p123==1)&&(i1.i0.i1.u35.p323==1))"))
built 2 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 9 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 9 ordering constraints for composite.
built 8 ordering constraints for composite.
built 5 ordering constraints for composite.
built 8 ordering constraints for composite.
built 9 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 16 ordering constraints for composite.
built 14 ordering constraints for composite.
built 12 ordering constraints for composite.
built 10 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 18 ordering constraints for composite.
built 16 ordering constraints for composite.
built 14 ordering constraints for composite.
built 12 ordering constraints for composite.
built 10 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 13 ordering constraints for composite.
built 16 ordering constraints for composite.
built 14 ordering constraints for composite.
built 12 ordering constraints for composite.
built 10 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 11 ordering constraints for composite.
built 5 ordering constraints for composite.
Detected timeout of ITS tools.
[2020-05-15 16:20:32] [INFO ] Flatten gal took : 1798 ms
[2020-05-15 16:20:33] [INFO ] Input system was already deterministic with 430 transitions.
[2020-05-15 16:20:33] [INFO ] Transformed 479 places.
[2020-05-15 16:20:33] [INFO ] Transformed 430 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-15 16:21:04] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 18 ms
[2020-05-15 16:21:04] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 6 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 11 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G((G((F(X(((F("((p123==1)&&(p323==1))"))&&("(p37==1)"))&&("(p330==1)"))))&&(F(G("((p123==1)&&(p323==1))")))))||("((p37==1)&&(p330==1))"))))
Formula 0 simplified : !G("((p37==1)&&(p330==1))" | G(FX("(p37==1)" & "(p330==1)" & F"((p123==1)&&(p323==1))") & FG"((p123==1)&&(p323==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="DES-PT-50b"
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 DES-PT-50b, 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 r051-ebro-158902546000314"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-50b.tgz
mv DES-PT-50b 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 ;