fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r026-tajo-162038143800386
Last Updated
Jun 28, 2021

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16249.892 3575209.00 3486806.00 141464.30 F???????F?T???FT normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r026-tajo-162038143800386.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-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 BusinessProcesses-PT-09, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-tajo-162038143800386
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 126K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 22 12:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 104K May 5 16:51 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-09-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1620762178894

Running Version 0
[2021-05-11 19:43:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-11 19:43:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-11 19:43:00] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2021-05-11 19:43:00] [INFO ] Transformed 403 places.
[2021-05-11 19:43:00] [INFO ] Transformed 374 transitions.
[2021-05-11 19:43:00] [INFO ] Found NUPN structural information;
[2021-05-11 19:43:00] [INFO ] Parsed PT model containing 403 places and 374 transitions in 110 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Support contains 334 out of 403 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 403/403 places, 374/374 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 402 transition count 374
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 393 transition count 365
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 393 transition count 365
Applied a total of 19 rules in 28 ms. Remains 393 /403 variables (removed 10) and now considering 365/374 (removed 9) transitions.
// Phase 1: matrix 365 rows 393 cols
[2021-05-11 19:43:00] [INFO ] Computed 64 place invariants in 26 ms
[2021-05-11 19:43:00] [INFO ] Implicit Places using invariants in 243 ms returned []
// Phase 1: matrix 365 rows 393 cols
[2021-05-11 19:43:00] [INFO ] Computed 64 place invariants in 11 ms
[2021-05-11 19:43:01] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
// Phase 1: matrix 365 rows 393 cols
[2021-05-11 19:43:01] [INFO ] Computed 64 place invariants in 7 ms
[2021-05-11 19:43:01] [INFO ] Dead Transitions using invariants and state equation in 232 ms returned []
Finished structural reductions, in 1 iterations. Remains : 393/403 places, 365/374 transitions.
[2021-05-11 19:43:01] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-11 19:43:01] [INFO ] Flatten gal took : 67 ms
FORMULA BusinessProcesses-PT-09-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-11 19:43:01] [INFO ] Flatten gal took : 28 ms
[2021-05-11 19:43:01] [INFO ] Input system was already deterministic with 365 transitions.
Incomplete random walk after 100000 steps, including 1038 resets, run finished after 393 ms. (steps per millisecond=254 ) properties (out of 63) seen :59
Running SMT prover for 4 properties.
// Phase 1: matrix 365 rows 393 cols
[2021-05-11 19:43:02] [INFO ] Computed 64 place invariants in 10 ms
[2021-05-11 19:43:02] [INFO ] [Real]Absence check using 34 positive place invariants in 18 ms returned sat
[2021-05-11 19:43:02] [INFO ] [Real]Absence check using 34 positive and 30 generalized place invariants in 11 ms returned sat
[2021-05-11 19:43:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 19:43:02] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2021-05-11 19:43:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 19:43:02] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2021-05-11 19:43:02] [INFO ] [Nat]Absence check using 34 positive and 30 generalized place invariants in 7 ms returned sat
[2021-05-11 19:43:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 19:43:02] [INFO ] [Nat]Absence check using state equation in 179 ms returned sat
[2021-05-11 19:43:02] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 3 ms to minimize.
[2021-05-11 19:43:03] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 2 ms to minimize.
[2021-05-11 19:43:03] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 1 ms to minimize.
[2021-05-11 19:43:03] [INFO ] Deduced a trap composed of 93 places in 101 ms of which 1 ms to minimize.
[2021-05-11 19:43:03] [INFO ] Deduced a trap composed of 84 places in 110 ms of which 2 ms to minimize.
[2021-05-11 19:43:03] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 1 ms to minimize.
[2021-05-11 19:43:03] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 0 ms to minimize.
[2021-05-11 19:43:03] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 1 ms to minimize.
[2021-05-11 19:43:03] [INFO ] Deduced a trap composed of 86 places in 83 ms of which 1 ms to minimize.
[2021-05-11 19:43:04] [INFO ] Deduced a trap composed of 92 places in 85 ms of which 0 ms to minimize.
[2021-05-11 19:43:04] [INFO ] Deduced a trap composed of 106 places in 83 ms of which 1 ms to minimize.
[2021-05-11 19:43:04] [INFO ] Deduced a trap composed of 97 places in 101 ms of which 1 ms to minimize.
[2021-05-11 19:43:04] [INFO ] Deduced a trap composed of 96 places in 120 ms of which 0 ms to minimize.
[2021-05-11 19:43:04] [INFO ] Deduced a trap composed of 83 places in 116 ms of which 1 ms to minimize.
[2021-05-11 19:43:04] [INFO ] Deduced a trap composed of 12 places in 230 ms of which 1 ms to minimize.
[2021-05-11 19:43:04] [INFO ] Deduced a trap composed of 34 places in 140 ms of which 1 ms to minimize.
[2021-05-11 19:43:05] [INFO ] Deduced a trap composed of 85 places in 130 ms of which 1 ms to minimize.
[2021-05-11 19:43:05] [INFO ] Deduced a trap composed of 104 places in 127 ms of which 0 ms to minimize.
[2021-05-11 19:43:05] [INFO ] Deduced a trap composed of 108 places in 106 ms of which 1 ms to minimize.
[2021-05-11 19:43:05] [INFO ] Deduced a trap composed of 93 places in 108 ms of which 1 ms to minimize.
[2021-05-11 19:43:05] [INFO ] Deduced a trap composed of 113 places in 108 ms of which 0 ms to minimize.
[2021-05-11 19:43:05] [INFO ] Deduced a trap composed of 93 places in 109 ms of which 0 ms to minimize.
[2021-05-11 19:43:05] [INFO ] Deduced a trap composed of 102 places in 87 ms of which 1 ms to minimize.
[2021-05-11 19:43:06] [INFO ] Deduced a trap composed of 88 places in 125 ms of which 0 ms to minimize.
[2021-05-11 19:43:06] [INFO ] Deduced a trap composed of 100 places in 108 ms of which 0 ms to minimize.
[2021-05-11 19:43:06] [INFO ] Deduced a trap composed of 107 places in 128 ms of which 0 ms to minimize.
[2021-05-11 19:43:06] [INFO ] Deduced a trap composed of 98 places in 110 ms of which 1 ms to minimize.
[2021-05-11 19:43:06] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 1 ms to minimize.
[2021-05-11 19:43:06] [INFO ] Deduced a trap composed of 98 places in 98 ms of which 1 ms to minimize.
[2021-05-11 19:43:06] [INFO ] Deduced a trap composed of 95 places in 95 ms of which 1 ms to minimize.
[2021-05-11 19:43:06] [INFO ] Deduced a trap composed of 100 places in 98 ms of which 0 ms to minimize.
[2021-05-11 19:43:07] [INFO ] Deduced a trap composed of 90 places in 94 ms of which 1 ms to minimize.
[2021-05-11 19:43:07] [INFO ] Deduced a trap composed of 96 places in 95 ms of which 0 ms to minimize.
[2021-05-11 19:43:07] [INFO ] Deduced a trap composed of 90 places in 130 ms of which 1 ms to minimize.
[2021-05-11 19:43:07] [INFO ] Deduced a trap composed of 94 places in 95 ms of which 5 ms to minimize.
[2021-05-11 19:43:07] [INFO ] Deduced a trap composed of 110 places in 113 ms of which 0 ms to minimize.
[2021-05-11 19:43:07] [INFO ] Deduced a trap composed of 107 places in 124 ms of which 1 ms to minimize.
[2021-05-11 19:43:08] [INFO ] Deduced a trap composed of 33 places in 134 ms of which 0 ms to minimize.
[2021-05-11 19:43:08] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 1 ms to minimize.
[2021-05-11 19:43:08] [INFO ] Deduced a trap composed of 43 places in 89 ms of which 2 ms to minimize.
[2021-05-11 19:43:08] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 0 ms to minimize.
[2021-05-11 19:43:08] [INFO ] Deduced a trap composed of 101 places in 134 ms of which 1 ms to minimize.
[2021-05-11 19:43:08] [INFO ] Deduced a trap composed of 88 places in 122 ms of which 0 ms to minimize.
[2021-05-11 19:43:08] [INFO ] Deduced a trap composed of 109 places in 118 ms of which 1 ms to minimize.
[2021-05-11 19:43:09] [INFO ] Deduced a trap composed of 84 places in 100 ms of which 1 ms to minimize.
[2021-05-11 19:43:09] [INFO ] Deduced a trap composed of 86 places in 106 ms of which 1 ms to minimize.
[2021-05-11 19:43:09] [INFO ] Deduced a trap composed of 98 places in 112 ms of which 0 ms to minimize.
[2021-05-11 19:43:09] [INFO ] Deduced a trap composed of 89 places in 140 ms of which 1 ms to minimize.
[2021-05-11 19:43:09] [INFO ] Deduced a trap composed of 91 places in 123 ms of which 1 ms to minimize.
[2021-05-11 19:43:09] [INFO ] Deduced a trap composed of 94 places in 117 ms of which 0 ms to minimize.
[2021-05-11 19:43:10] [INFO ] Deduced a trap composed of 92 places in 107 ms of which 0 ms to minimize.
[2021-05-11 19:43:10] [INFO ] Deduced a trap composed of 96 places in 141 ms of which 0 ms to minimize.
[2021-05-11 19:43:10] [INFO ] Deduced a trap composed of 106 places in 135 ms of which 1 ms to minimize.
[2021-05-11 19:43:10] [INFO ] Deduced a trap composed of 106 places in 105 ms of which 1 ms to minimize.
[2021-05-11 19:43:10] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 2 ms to minimize.
[2021-05-11 19:43:10] [INFO ] Deduced a trap composed of 92 places in 125 ms of which 14 ms to minimize.
[2021-05-11 19:43:11] [INFO ] Deduced a trap composed of 92 places in 134 ms of which 0 ms to minimize.
[2021-05-11 19:43:11] [INFO ] Deduced a trap composed of 101 places in 89 ms of which 0 ms to minimize.
[2021-05-11 19:43:11] [INFO ] Deduced a trap composed of 96 places in 94 ms of which 0 ms to minimize.
[2021-05-11 19:43:11] [INFO ] Deduced a trap composed of 91 places in 140 ms of which 1 ms to minimize.
[2021-05-11 19:43:11] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 1 ms to minimize.
[2021-05-11 19:43:12] [INFO ] Deduced a trap composed of 97 places in 118 ms of which 1 ms to minimize.
[2021-05-11 19:43:12] [INFO ] Deduced a trap composed of 87 places in 143 ms of which 1 ms to minimize.
[2021-05-11 19:43:12] [INFO ] Deduced a trap composed of 95 places in 103 ms of which 1 ms to minimize.
[2021-05-11 19:43:12] [INFO ] Deduced a trap composed of 86 places in 116 ms of which 1 ms to minimize.
[2021-05-11 19:43:12] [INFO ] Deduced a trap composed of 100 places in 126 ms of which 1 ms to minimize.
[2021-05-11 19:43:12] [INFO ] Deduced a trap composed of 99 places in 109 ms of which 1 ms to minimize.
[2021-05-11 19:43:13] [INFO ] Deduced a trap composed of 96 places in 136 ms of which 0 ms to minimize.
[2021-05-11 19:43:13] [INFO ] Deduced a trap composed of 92 places in 146 ms of which 1 ms to minimize.
[2021-05-11 19:43:13] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 0 ms to minimize.
[2021-05-11 19:43:13] [INFO ] Deduced a trap composed of 93 places in 124 ms of which 1 ms to minimize.
[2021-05-11 19:43:14] [INFO ] Deduced a trap composed of 113 places in 122 ms of which 1 ms to minimize.
[2021-05-11 19:43:14] [INFO ] Deduced a trap composed of 102 places in 101 ms of which 0 ms to minimize.
[2021-05-11 19:43:14] [INFO ] Deduced a trap composed of 97 places in 104 ms of which 1 ms to minimize.
[2021-05-11 19:43:14] [INFO ] Deduced a trap composed of 105 places in 129 ms of which 0 ms to minimize.
[2021-05-11 19:43:14] [INFO ] Deduced a trap composed of 89 places in 140 ms of which 0 ms to minimize.
[2021-05-11 19:43:15] [INFO ] Deduced a trap composed of 100 places in 135 ms of which 1 ms to minimize.
[2021-05-11 19:43:17] [INFO ] Deduced a trap composed of 42 places in 143 ms of which 0 ms to minimize.
[2021-05-11 19:43:17] [INFO ] Deduced a trap composed of 112 places in 131 ms of which 1 ms to minimize.
[2021-05-11 19:43:17] [INFO ] Deduced a trap composed of 98 places in 126 ms of which 0 ms to minimize.
[2021-05-11 19:43:17] [INFO ] Deduced a trap composed of 104 places in 122 ms of which 1 ms to minimize.
[2021-05-11 19:43:17] [INFO ] Deduced a trap composed of 98 places in 107 ms of which 0 ms to minimize.
[2021-05-11 19:43:17] [INFO ] Deduced a trap composed of 103 places in 131 ms of which 1 ms to minimize.
[2021-05-11 19:43:18] [INFO ] Deduced a trap composed of 95 places in 129 ms of which 1 ms to minimize.
[2021-05-11 19:43:18] [INFO ] Deduced a trap composed of 98 places in 142 ms of which 0 ms to minimize.
[2021-05-11 19:43:18] [INFO ] Deduced a trap composed of 91 places in 140 ms of which 1 ms to minimize.
[2021-05-11 19:43:18] [INFO ] Deduced a trap composed of 96 places in 134 ms of which 0 ms to minimize.
[2021-05-11 19:43:19] [INFO ] Trap strengthening (SAT) tested/added 88/87 trap constraints in 16786 ms
[2021-05-11 19:43:19] [INFO ] Computed and/alt/rep : 343/640/343 causal constraints (skipped 21 transitions) in 36 ms.
[2021-05-11 19:43:20] [INFO ] Added : 194 causal constraints over 39 iterations in 1276 ms. Result :sat
[2021-05-11 19:43:20] [INFO ] [Real]Absence check using 34 positive place invariants in 28 ms returned sat
[2021-05-11 19:43:21] [INFO ] [Real]Absence check using 34 positive and 30 generalized place invariants in 22 ms returned sat
[2021-05-11 19:43:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 19:43:21] [INFO ] [Real]Absence check using state equation in 234 ms returned sat
[2021-05-11 19:43:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 19:43:21] [INFO ] [Nat]Absence check using 34 positive place invariants in 14 ms returned sat
[2021-05-11 19:43:21] [INFO ] [Nat]Absence check using 34 positive and 30 generalized place invariants in 17 ms returned sat
[2021-05-11 19:43:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 19:43:21] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2021-05-11 19:43:21] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 0 ms to minimize.
[2021-05-11 19:43:21] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 1 ms to minimize.
[2021-05-11 19:43:21] [INFO ] Deduced a trap composed of 74 places in 102 ms of which 0 ms to minimize.
[2021-05-11 19:43:22] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 1 ms to minimize.
[2021-05-11 19:43:22] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 1 ms to minimize.
[2021-05-11 19:43:22] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 0 ms to minimize.
[2021-05-11 19:43:22] [INFO ] Deduced a trap composed of 81 places in 106 ms of which 1 ms to minimize.
[2021-05-11 19:43:22] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 1 ms to minimize.
[2021-05-11 19:43:22] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 0 ms to minimize.
[2021-05-11 19:43:22] [INFO ] Deduced a trap composed of 95 places in 112 ms of which 0 ms to minimize.
[2021-05-11 19:43:22] [INFO ] Deduced a trap composed of 87 places in 91 ms of which 1 ms to minimize.
[2021-05-11 19:43:23] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 1 ms to minimize.
[2021-05-11 19:43:23] [INFO ] Deduced a trap composed of 76 places in 108 ms of which 0 ms to minimize.
[2021-05-11 19:43:23] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 0 ms to minimize.
[2021-05-11 19:43:23] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2021-05-11 19:43:23] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 0 ms to minimize.
[2021-05-11 19:43:23] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1810 ms
[2021-05-11 19:43:23] [INFO ] Computed and/alt/rep : 343/640/343 causal constraints (skipped 21 transitions) in 21 ms.
[2021-05-11 19:43:24] [INFO ] Deduced a trap composed of 43 places in 66 ms of which 1 ms to minimize.
[2021-05-11 19:43:24] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2021-05-11 19:43:24] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 1 ms to minimize.
[2021-05-11 19:43:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 382 ms
[2021-05-11 19:43:24] [INFO ] Added : 222 causal constraints over 46 iterations in 1659 ms. Result :sat
[2021-05-11 19:43:25] [INFO ] [Real]Absence check using 34 positive place invariants in 12 ms returned sat
[2021-05-11 19:43:25] [INFO ] [Real]Absence check using 34 positive and 30 generalized place invariants in 10 ms returned sat
[2021-05-11 19:43:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 19:43:25] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2021-05-11 19:43:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 19:43:25] [INFO ] [Nat]Absence check using 34 positive place invariants in 12 ms returned sat
[2021-05-11 19:43:25] [INFO ] [Nat]Absence check using 34 positive and 30 generalized place invariants in 9 ms returned sat
[2021-05-11 19:43:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 19:43:25] [INFO ] [Nat]Absence check using state equation in 141 ms returned unsat
[2021-05-11 19:43:25] [INFO ] [Real]Absence check using 34 positive place invariants in 16 ms returned sat
[2021-05-11 19:43:25] [INFO ] [Real]Absence check using 34 positive and 30 generalized place invariants in 19 ms returned sat
[2021-05-11 19:43:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 19:43:25] [INFO ] [Real]Absence check using state equation in 161 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 392 transition count 322
Reduce places removed 42 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 46 rules applied. Total rules applied 88 place count 350 transition count 318
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 92 place count 346 transition count 318
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 78 Pre rules applied. Total rules applied 92 place count 346 transition count 240
Deduced a syphon composed of 78 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 164 rules applied. Total rules applied 256 place count 260 transition count 240
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 294 place count 222 transition count 202
Iterating global reduction 3 with 38 rules applied. Total rules applied 332 place count 222 transition count 202
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 332 place count 222 transition count 199
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 338 place count 219 transition count 199
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 448 place count 164 transition count 144
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 449 place count 164 transition count 144
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 450 place count 163 transition count 143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 451 place count 162 transition count 143
Applied a total of 451 rules in 105 ms. Remains 162 /393 variables (removed 231) and now considering 143/365 (removed 222) transitions.
[2021-05-11 19:43:25] [INFO ] Flatten gal took : 13 ms
[2021-05-11 19:43:25] [INFO ] Flatten gal took : 14 ms
[2021-05-11 19:43:25] [INFO ] Input system was already deterministic with 143 transitions.
[2021-05-11 19:43:25] [INFO ] Flatten gal took : 13 ms
[2021-05-11 19:43:26] [INFO ] Flatten gal took : 14 ms
[2021-05-11 19:43:26] [INFO ] Time to serialize gal into /tmp/CTLFireability6468151152764010295.gal : 8 ms
[2021-05-11 19:43:26] [INFO ] Time to serialize properties into /tmp/CTLFireability10503413379867504232.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability6468151152764010295.gal, -t, CGAL, -ctl, /tmp/CTLFireability10503413379867504232.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability6468151152764010295.gal -t CGAL -ctl /tmp/CTLFireability10503413379867504232.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.51133e+09,2.48869,76744,2,13438,5,333767,6,0,788,310547,0


Converting to forward existential form...Done !
original formula: (AF(AG((((!(EG((((((((p276==1)||(p133==1))||(p284==1))||(((p28==1)&&(p195==1))&&(p301==1)))||(p285==1))||(p298==1))||(p236==1)))) + ((((p49==0)&&((p96==0)||(p340==0)))&&(p296==0))&&(p94==0))) + (((((((((p23==0)||(p199==0))||(p368==0))&&(p358==0))&&(p36==0))&&(p256==0))&&(((p105==0)||(p265==0))||(p339==0)))&&(((p73==0)||(p249==0))||(p368==0)))&&(p31==0))) + (((p64==0)&&(p311==0))&&(p8==0))))) + (AF((p286==1)) * !(AF((p193==1)))))
=> equivalent forward existential formula: ([FwdG((Init * !(!(EG(!(!(E(TRUE U !((((!(EG((((((((p276==1)||(p133==1))||(p284==1))||(((p28==1)&&(p195==1))&&(p301==1)))||(p285==1))||(p298==1))||(p236==1)))) + ((((p49==0)&&((p96==0)||(p340==0)))&&(p296==0))&&(p94==0))) + (((((((((p23==0)||(p199==0))||(p368==0))&&(p358==0))&&(p36==0))&&(p256==0))&&(((p105==0)||(p265==0))||(p339==0)))&&(((p73==0)||(p249==0))||(p368==0)))&&(p31==0))) + (((p64==0)&&(p311==0))&&(p8==0))))))))))),!((p286==1)))] = FALSE * [((Init * !(!(EG(!(!(E(TRUE U !((((!(EG((((((((p276==1)||(p133==1))||(p284==1))||(((p28==1)&&(p195==1))&&(p301==1)))||(p285==1))||(p298==1))||(p236==1)))) + ((((p49==0)&&((p96==0)||(p340==0)))&&(p296==0))&&(p94==0))) + (((((((((p23==0)||(p199==0))||(p368==0))&&(p358==0))&&(p36==0))&&(p256==0))&&(((p105==0)||(p265==0))||(p339==0)))&&(((p73==0)||(p249==0))||(p368==0)))&&(p31==0))) + (((p64==0)&&(p311==0))&&(p8==0))))))))))) * !(EG(!((p193==1)))))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t9, t13, t15, t17, t18, t21, t25, t26, t52, t56, t57, t62, t65, t66, t67, t68, t69, t70, t76, t78, t79, t80, t81, t82, t106, t107, t108, t109, t110, t111, t112, t117, t121, t122, t133, t135, t136, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/67/40/143
Detected timeout of ITS tools.
[2021-05-11 19:43:56] [INFO ] Flatten gal took : 28 ms
[2021-05-11 19:43:56] [INFO ] Applying decomposition
[2021-05-11 19:43:56] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph17413371496794188583.txt, -o, /tmp/graph17413371496794188583.bin, -w, /tmp/graph17413371496794188583.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph17413371496794188583.bin, -l, -1, -v, -w, /tmp/graph17413371496794188583.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-11 19:43:56] [INFO ] Decomposing Gal with order
[2021-05-11 19:43:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 19:43:56] [INFO ] Removed a total of 64 redundant transitions.
[2021-05-11 19:43:56] [INFO ] Flatten gal took : 48 ms
[2021-05-11 19:43:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 7 ms.
[2021-05-11 19:43:56] [INFO ] Time to serialize gal into /tmp/CTLFireability11111536478424187304.gal : 9 ms
[2021-05-11 19:43:56] [INFO ] Time to serialize properties into /tmp/CTLFireability8190655578699316858.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability11111536478424187304.gal, -t, CGAL, -ctl, /tmp/CTLFireability8190655578699316858.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability11111536478424187304.gal -t CGAL -ctl /tmp/CTLFireability8190655578699316858.ctl
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.51133e+09,0.385212,16284,802,476,21022,2281,465,42057,190,8082,0


Converting to forward existential form...Done !
original formula: (AF(AG((((!(EG((((((((i5.u30.p276==1)||(i4.u10.p133==1))||(i9.u32.p284==1))||(((i0.u1.p28==1)&&(i0.u14.p195==1))&&(i0.u35.p301==1)))||(i9.u33.p285==1))||(i0.u35.p298==1))||(i6.u22.p236==1)))) + ((((i3.i1.u6.p49==0)&&((i7.u8.p96==0)||(i7.u37.p340==0)))&&(i0.u34.p296==0))&&(u28.p94==0))) + (((((((((i0.u2.p23==0)||(i4.u15.p199==0))||(i9.u31.p368==0))&&(i9.u39.p358==0))&&(i3.i0.u4.p36==0))&&(i11.u26.p256==0))&&(((u28.p105==0)||(u28.p265==0))||(u28.p339==0)))&&(((i8.u7.p73==0)||(i8.u25.p249==0))||(i9.u31.p368==0)))&&(i1.u3.p31==0))) + (((i8.u7.p64==0)&&(i9.u31.p311==0))&&(i3.i1.u11.p8==0))))) + (AF((i9.u33.p286==1)) * !(AF((i0.u14.p193==1)))))
=> equivalent forward existential formula: ([FwdG((Init * !(!(EG(!(!(E(TRUE U !((((!(EG((((((((i5.u30.p276==1)||(i4.u10.p133==1))||(i9.u32.p284==1))||(((i0.u1.p28==1)&&(i0.u14.p195==1))&&(i0.u35.p301==1)))||(i9.u33.p285==1))||(i0.u35.p298==1))||(i6.u22.p236==1)))) + ((((i3.i1.u6.p49==0)&&((i7.u8.p96==0)||(i7.u37.p340==0)))&&(i0.u34.p296==0))&&(u28.p94==0))) + (((((((((i0.u2.p23==0)||(i4.u15.p199==0))||(i9.u31.p368==0))&&(i9.u39.p358==0))&&(i3.i0.u4.p36==0))&&(i11.u26.p256==0))&&(((u28.p105==0)||(u28.p265==0))||(u28.p339==0)))&&(((i8.u7.p73==0)||(i8.u25.p249==0))||(i9.u31.p368==0)))&&(i1.u3.p31==0))) + (((i8.u7.p64==0)&&(i9.u31.p311==0))&&(i3.i1.u11.p8==0))))))))))),!((i9.u33.p286==1)))] = FALSE * [((Init * !(!(EG(!(!(E(TRUE U !((((!(EG((((((((i5.u30.p276==1)||(i4.u10.p133==1))||(i9.u32.p284==1))||(((i0.u1.p28==1)&&(i0.u14.p195==1))&&(i0.u35.p301==1)))||(i9.u33.p285==1))||(i0.u35.p298==1))||(i6.u22.p236==1)))) + ((((i3.i1.u6.p49==0)&&((i7.u8.p96==0)||(i7.u37.p340==0)))&&(i0.u34.p296==0))&&(u28.p94==0))) + (((((((((i0.u2.p23==0)||(i4.u15.p199==0))||(i9.u31.p368==0))&&(i9.u39.p358==0))&&(i3.i0.u4.p36==0))&&(i11.u26.p256==0))&&(((u28.p105==0)||(u28.p265==0))||(u28.p339==0)))&&(((i8.u7.p73==0)||(i8.u25.p249==0))||(i9.u31.p368==0)))&&(i1.u3.p31==0))) + (((i8.u7.p64==0)&&(i9.u31.p311==0))&&(i3.i1.u11.p8==0))))))))))) * !(EG(!((i0.u14.p193==1)))))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions t37, t52, t56, t57, t68, t69, t76, t79, t80, t81, t82, t98, t106, t107, t108, t109, t110, t111, t112, t121, t122, t133, t136, i0.t26, i0.u2.t65, i0.u14.t18, i0.u14.t70, i0.u35.t5, i1.u3.t25, i3.i0.u4.t66, i3.i1.u5.t67, i4.u10.t21, i5.u30.t13, i6.u22.t17, i8.u7.t62, i9.t135, i9.t9, i9.t2, i9.u31.t4, i9.u31.t78, i11.u26.t15, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :26/66/41/133
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
(forward)formula 0,0,7.52726,198564,1,0,379658,7295,2803,705170,1815,41132,536796
FORMULA BusinessProcesses-PT-09-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Graph (trivial) has 204 edges and 393 vertex of which 7 / 393 are part of one of the 1 SCC in 6 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 73 place count 386 transition count 285
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 145 place count 314 transition count 285
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 61 Pre rules applied. Total rules applied 145 place count 314 transition count 224
Deduced a syphon composed of 61 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 131 rules applied. Total rules applied 276 place count 244 transition count 224
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 319 place count 201 transition count 181
Iterating global reduction 2 with 43 rules applied. Total rules applied 362 place count 201 transition count 181
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 362 place count 201 transition count 177
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 371 place count 196 transition count 177
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 2 with 114 rules applied. Total rules applied 485 place count 138 transition count 121
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 487 place count 137 transition count 124
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 493 place count 137 transition count 124
Applied a total of 493 rules in 72 ms. Remains 137 /393 variables (removed 256) and now considering 124/365 (removed 241) transitions.
[2021-05-11 19:44:04] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-11 19:44:04] [INFO ] Flatten gal took : 13 ms
FORMULA BusinessProcesses-PT-09-CTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-11 19:44:04] [INFO ] Flatten gal took : 11 ms
[2021-05-11 19:44:04] [INFO ] Input system was already deterministic with 124 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 392 transition count 320
Reduce places removed 44 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 50 rules applied. Total rules applied 94 place count 348 transition count 314
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 100 place count 342 transition count 314
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 100 place count 342 transition count 234
Deduced a syphon composed of 80 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 169 rules applied. Total rules applied 269 place count 253 transition count 234
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 308 place count 214 transition count 195
Iterating global reduction 3 with 39 rules applied. Total rules applied 347 place count 214 transition count 195
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 347 place count 214 transition count 192
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 354 place count 210 transition count 192
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 476 place count 148 transition count 132
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 477 place count 148 transition count 131
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 478 place count 147 transition count 130
Applied a total of 478 rules in 56 ms. Remains 147 /393 variables (removed 246) and now considering 130/365 (removed 235) transitions.
[2021-05-11 19:44:04] [INFO ] Flatten gal took : 11 ms
[2021-05-11 19:44:04] [INFO ] Flatten gal took : 11 ms
[2021-05-11 19:44:04] [INFO ] Input system was already deterministic with 130 transitions.
[2021-05-11 19:44:04] [INFO ] Flatten gal took : 11 ms
[2021-05-11 19:44:04] [INFO ] Flatten gal took : 10 ms
[2021-05-11 19:44:04] [INFO ] Time to serialize gal into /tmp/CTLFireability8194227605304653565.gal : 2 ms
[2021-05-11 19:44:04] [INFO ] Time to serialize properties into /tmp/CTLFireability15853291143760987476.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability8194227605304653565.gal, -t, CGAL, -ctl, /tmp/CTLFireability15853291143760987476.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability8194227605304653565.gal -t CGAL -ctl /tmp/CTLFireability15853291143760987476.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.19964e+09,2.80274,85032,2,25118,5,363789,6,0,718,419305,0


Converting to forward existential form...Done !
original formula: AG(!(AF(AG(((((((((((((((((p208==1)||(p213==1))||(p75==1))||(p323==1))||(((p138==1)&&(p229==1))&&(p368==1)))||(((p111==1)&&(p260==1))&&(p397==1)))||(p211==1))||(p193==1))||(p358==1))||(p353==1))||(p71==1))||(p164==1))||(p8==1))||(p74==1))||((p51==1)&&(p54==1)))||(p267==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EG(!(!(E(TRUE U !(((((((((((((((((p208==1)||(p213==1))||(p75==1))||(p323==1))||(((p138==1)&&(p229==1))&&(p368==1)))||(((p111==1)&&(p260==1))&&(p397==1)))||(p211==1))||(p193==1))||(p358==1))||(p353==1))||(p71==1))||(p164==1))||(p8==1))||(p74==1))||((p51==1)&&(p54==1)))||(p267==1)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t5, t6, t8, t9, t10, t14, t17, t42, t43, t46, t48, t49, t50, t52, t53, t54, t55, t56, t57, t62, t64, t65, t66, t88, t89, t90, t91, t93, t94, t104, t105, t110, t120, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/60/34/130
Detected timeout of ITS tools.
[2021-05-11 19:44:34] [INFO ] Flatten gal took : 26 ms
[2021-05-11 19:44:34] [INFO ] Applying decomposition
[2021-05-11 19:44:34] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph6859836135681257914.txt, -o, /tmp/graph6859836135681257914.bin, -w, /tmp/graph6859836135681257914.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph6859836135681257914.bin, -l, -1, -v, -w, /tmp/graph6859836135681257914.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-11 19:44:34] [INFO ] Decomposing Gal with order
[2021-05-11 19:44:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 19:44:34] [INFO ] Removed a total of 67 redundant transitions.
[2021-05-11 19:44:34] [INFO ] Flatten gal took : 25 ms
[2021-05-11 19:44:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 4 ms.
[2021-05-11 19:44:34] [INFO ] Time to serialize gal into /tmp/CTLFireability2621883296639889765.gal : 4 ms
[2021-05-11 19:44:34] [INFO ] Time to serialize properties into /tmp/CTLFireability10561427373684922305.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability2621883296639889765.gal, -t, CGAL, -ctl, /tmp/CTLFireability10561427373684922305.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability2621883296639889765.gal -t CGAL -ctl /tmp/CTLFireability10561427373684922305.ctl
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.19964e+09,0.747196,23424,1065,447,33399,2199,474,68065,178,6122,0


Converting to forward existential form...Done !
original formula: AG(!(AF(AG(((((((((((((((((i2.i1.u18.p208==1)||(i0.u20.p213==1))||(i8.u8.p75==1))||(i7.i3.u40.p323==1))||(((i0.u11.p138==1)&&(i9.i0.u23.p229==1))&&(i7.i3.u40.p368==1)))||(((u29.p111==1)&&(u29.p260==1))&&(u29.p397==1)))||(i2.i1.u19.p211==1))||(i1.i1.u15.p193==1))||(i7.i3.u38.p358==1))||(i0.u36.p353==1))||(i8.u7.p71==1))||(i1.i0.u13.p164==1))||(i0.u0.p8==1))||(i8.u6.p74==1))||((i9.i0.u4.p51==1)&&(i9.i0.u5.p54==1)))||(u31.p267==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EG(!(!(E(TRUE U !(((((((((((((((((i2.i1.u18.p208==1)||(i0.u20.p213==1))||(i8.u8.p75==1))||(i7.i3.u40.p323==1))||(((i0.u11.p138==1)&&(i9.i0.u23.p229==1))&&(i7.i3.u40.p368==1)))||(((u29.p111==1)&&(u29.p260==1))&&(u29.p397==1)))||(i2.i1.u19.p211==1))||(i1.i1.u15.p193==1))||(i7.i3.u38.p358==1))||(i0.u36.p353==1))||(i8.u7.p71==1))||(i1.i0.u13.p164==1))||(i0.u0.p8==1))||(i8.u6.p74==1))||((i9.i0.u4.p51==1)&&(i9.i0.u5.p54==1)))||(u31.p267==1)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t42, t43, t52, t53, t54, t55, t57, t64, t65, t66, t88, t89, t90, t91, t93, t94, t104, t110, t120, u31.t49, i0.u11.t56, i0.u20.t6, i1.i0.u13.t48, i1.i1.u15.t10, i2.i1.t8, i2.i1.u18.t9, i7.t105, i7.i3.t2, i7.i3.u40.t5, i7.i3.u40.t62, i8.t17, i8.t14, i8.u6.t50, i9.i0.t46, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :25/60/34/119
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 3
Fast SCC detection found a local SCC at level 3
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,1,6.82822,167360,1,0,265371,7975,2421,463373,1633,25597,432055
FORMULA BusinessProcesses-PT-09-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Reduce places removed 1 places and 1 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 392 transition count 317
Reduce places removed 47 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 51 rules applied. Total rules applied 98 place count 345 transition count 313
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 102 place count 341 transition count 313
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 79 Pre rules applied. Total rules applied 102 place count 341 transition count 234
Deduced a syphon composed of 79 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 3 with 166 rules applied. Total rules applied 268 place count 254 transition count 234
Discarding 43 places :
Symmetric choice reduction at 3 with 43 rule applications. Total rules 311 place count 211 transition count 191
Iterating global reduction 3 with 43 rules applied. Total rules applied 354 place count 211 transition count 191
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 354 place count 211 transition count 188
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 360 place count 208 transition count 188
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 468 place count 154 transition count 134
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 470 place count 153 transition count 137
Partial Post-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 477 place count 153 transition count 137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 478 place count 152 transition count 136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 479 place count 151 transition count 136
Applied a total of 479 rules in 108 ms. Remains 151 /393 variables (removed 242) and now considering 136/365 (removed 229) transitions.
[2021-05-11 19:44:41] [INFO ] Flatten gal took : 13 ms
[2021-05-11 19:44:41] [INFO ] Flatten gal took : 13 ms
[2021-05-11 19:44:41] [INFO ] Input system was already deterministic with 136 transitions.
[2021-05-11 19:44:41] [INFO ] Flatten gal took : 10 ms
[2021-05-11 19:44:41] [INFO ] Flatten gal took : 10 ms
[2021-05-11 19:44:41] [INFO ] Time to serialize gal into /tmp/CTLFireability12410996285392517566.gal : 2 ms
[2021-05-11 19:44:41] [INFO ] Time to serialize properties into /tmp/CTLFireability15303904274234442281.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability12410996285392517566.gal, -t, CGAL, -ctl, /tmp/CTLFireability15303904274234442281.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability12410996285392517566.gal -t CGAL -ctl /tmp/CTLFireability15303904274234442281.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.47665e+08,1.76588,66572,2,10428,5,294686,6,0,739,235130,0


Converting to forward existential form...Done !
original formula: AF((EF(((((((((p81==1)||(((p156==1)&&(p274==1))&&(p368==1)))||(p256==1))||(p242==1))||(((p117==1)&&(p265==1))&&(p382==1)))||(p12==1))||(((p144==1)&&(p259==1))&&(p368==1)))||(p29==1))) * AF((!(AG(((p371==1)||(((p89==1)&&(p245==1))&&(p385==1))))) * !(EF(((((((p284==1)||(p216==1))||((p398==1)&&(p401==1)))||(p361==1))||(p143==1))||(p314==1))))))))
=> equivalent forward existential formula: [FwdG(Init,!((E(TRUE U ((((((((p81==1)||(((p156==1)&&(p274==1))&&(p368==1)))||(p256==1))||(p242==1))||(((p117==1)&&(p265==1))&&(p382==1)))||(p12==1))||(((p144==1)&&(p259==1))&&(p368==1)))||(p29==1))) * !(EG(!((!(!(E(TRUE U !(((p371==1)||(((p89==1)&&(p245==1))&&(p385==1))))))) * !(E(TRUE U ((((((p284==1)||(p216==1))||((p398==1)&&(p401==1)))||(p361==1))||(p143==1))||(p314==1)))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t10, t11, t14, t16, t17, t54, t55, t57, t58, t59, t60, t66, t67, t68, t69, t82, t83, t84, t85, t86, t87, t88, t91, t92, t102, t103, t105, t108, t115, t116, t119, t120, t121, t122, t127, t128, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/63/37/136
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2021-05-11 19:45:11] [INFO ] Flatten gal took : 20 ms
[2021-05-11 19:45:11] [INFO ] Applying decomposition
[2021-05-11 19:45:11] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph14187099896447913859.txt, -o, /tmp/graph14187099896447913859.bin, -w, /tmp/graph14187099896447913859.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph14187099896447913859.bin, -l, -1, -v, -w, /tmp/graph14187099896447913859.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-11 19:45:11] [INFO ] Decomposing Gal with order
[2021-05-11 19:45:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 19:45:11] [INFO ] Removed a total of 125 redundant transitions.
[2021-05-11 19:45:11] [INFO ] Flatten gal took : 43 ms
[2021-05-11 19:45:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 31 labels/synchronizations in 20 ms.
[2021-05-11 19:45:11] [INFO ] Time to serialize gal into /tmp/CTLFireability3189273600571787197.gal : 15 ms
[2021-05-11 19:45:11] [INFO ] Time to serialize properties into /tmp/CTLFireability3640056690603072114.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability3189273600571787197.gal, -t, CGAL, -ctl, /tmp/CTLFireability3640056690603072114.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability3189273600571787197.gal -t CGAL -ctl /tmp/CTLFireability3640056690603072114.ctl
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.47665e+08,0.701577,26100,1631,322,39515,2360,546,92077,155,8503,0


Converting to forward existential form...Done !
original formula: AF((EF(((((((((i6.u7.p81==1)||(((i3.u15.p156==1)&&(i3.u32.p274==1))&&(i1.i1.u42.p368==1)))||(u28.p256==1))||(i2.u26.p242==1))||(((i6.u30.p117==1)&&(i6.u30.p265==1))&&(i6.u30.p382==1)))||(i1.i1.u1.p12==1))||(((i3.u14.p144==1)&&(u29.p259==1))&&(i1.i1.u42.p368==1)))||(i4.i1.u3.p29==1))) * AF((!(AG(((i8.i1.u44.p371==1)||(((i2.u10.p89==1)&&(i2.u26.p245==1))&&(i2.u38.p385==1))))) * !(EF(((((((i1.i1.u33.p284==1)||(i7.u21.p216==1))||((u29.p398==1)&&(i6.u47.p401==1)))||(i3.u41.p361==1))||(i7.u13.p143==1))||(i8.i1.u43.p314==1))))))))
=> equivalent forward existential formula: [FwdG(Init,!((E(TRUE U ((((((((i6.u7.p81==1)||(((i3.u15.p156==1)&&(i3.u32.p274==1))&&(i1.i1.u42.p368==1)))||(u28.p256==1))||(i2.u26.p242==1))||(((i6.u30.p117==1)&&(i6.u30.p265==1))&&(i6.u30.p382==1)))||(i1.i1.u1.p12==1))||(((i3.u14.p144==1)&&(u29.p259==1))&&(i1.i1.u42.p368==1)))||(i4.i1.u3.p29==1))) * !(EG(!((!(!(E(TRUE U !(((i8.i1.u44.p371==1)||(((i2.u10.p89==1)&&(i2.u26.p245==1))&&(i2.u38.p385==1))))))) * !(E(TRUE U ((((((i1.i1.u33.p284==1)||(i7.u21.p216==1))||((u29.p398==1)&&(i6.u47.p401==1)))||(i3.u41.p361==1))||(i7.u13.p143==1))||(i8.i1.u43.p314==1)))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t55, t57, t58, t66, t67, t68, t69, t83, t85, t86, t87, t88, t91, t92, t102, t103, t105, t108, t115, t127, u28.t10, i1.t116, i1.t84, i1.i1.t120, i1.i1.t122, i2.u26.t11, i3.t82, i3.u14.t59, i3.u15.t60, i4.i1.u3.t17, i6.u7.t16, i7.u21.t14, i8.i1.u6.t54, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :25/62/34/121
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Detected timeout of ITS tools.
Graph (trivial) has 211 edges and 393 vertex of which 7 / 393 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 73 rules applied. Total rules applied 74 place count 386 transition count 284
Reduce places removed 73 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 76 rules applied. Total rules applied 150 place count 313 transition count 281
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 153 place count 310 transition count 281
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 61 Pre rules applied. Total rules applied 153 place count 310 transition count 220
Deduced a syphon composed of 61 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 285 place count 239 transition count 220
Discarding 43 places :
Symmetric choice reduction at 3 with 43 rule applications. Total rules 328 place count 196 transition count 177
Iterating global reduction 3 with 43 rules applied. Total rules applied 371 place count 196 transition count 177
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 371 place count 196 transition count 172
Deduced a syphon composed of 5 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 382 place count 190 transition count 172
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 506 place count 127 transition count 111
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 508 place count 126 transition count 114
Applied a total of 508 rules in 112 ms. Remains 126 /393 variables (removed 267) and now considering 114/365 (removed 251) transitions.
[2021-05-11 19:45:41] [INFO ] Flatten gal took : 11 ms
[2021-05-11 19:45:41] [INFO ] Flatten gal took : 9 ms
[2021-05-11 19:45:41] [INFO ] Input system was already deterministic with 114 transitions.
[2021-05-11 19:45:41] [INFO ] Flatten gal took : 9 ms
[2021-05-11 19:45:41] [INFO ] Flatten gal took : 9 ms
[2021-05-11 19:45:41] [INFO ] Time to serialize gal into /tmp/CTLFireability11095047566617450438.gal : 2 ms
[2021-05-11 19:45:41] [INFO ] Time to serialize properties into /tmp/CTLFireability18434325747786491505.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability11095047566617450438.gal, -t, CGAL, -ctl, /tmp/CTLFireability18434325747786491505.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability11095047566617450438.gal -t CGAL -ctl /tmp/CTLFireability18434325747786491505.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.62401e+07,1.28178,47648,2,6241,5,242684,6,0,617,139274,0


Converting to forward existential form...Done !
original formula: EG(EF(((((p257==0)&&(p286==0))&&(p127==0))&&((p51==0)||(p54==0)))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((((p257==0)&&(p286==0))&&(p127==0))&&((p51==0)||(p54==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t24, t26, t27, t28, t29, t30, t31, t32, t35, t36, t37, t38, t39, t67, t74, t81, t82, t83, t85, t86, t87, t88, t90, t108, t109, t110, t111, t112, t113, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/48/30/114
(forward)formula 0,1,4.35862,131448,1,0,188,743493,216,80,5093,443382,224
FORMULA BusinessProcesses-PT-09-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2021-05-11 19:45:46] [INFO ] Flatten gal took : 31 ms
[2021-05-11 19:45:46] [INFO ] Flatten gal took : 38 ms
[2021-05-11 19:45:46] [INFO ] Applying decomposition
[2021-05-11 19:45:46] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph15830539095390418042.txt, -o, /tmp/graph15830539095390418042.bin, -w, /tmp/graph15830539095390418042.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph15830539095390418042.bin, -l, -1, -v, -w, /tmp/graph15830539095390418042.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-11 19:45:46] [INFO ] Decomposing Gal with order
[2021-05-11 19:45:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 19:45:46] [INFO ] Removed a total of 232 redundant transitions.
[2021-05-11 19:45:46] [INFO ] Flatten gal took : 35 ms
[2021-05-11 19:45:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2021-05-11 19:45:46] [INFO ] Time to serialize gal into /tmp/CTLFireability11617318203343964965.gal : 6 ms
[2021-05-11 19:45:46] [INFO ] Time to serialize properties into /tmp/CTLFireability6759442852508321921.ctl : 4 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability11617318203343964965.gal, -t, CGAL, -ctl, /tmp/CTLFireability6759442852508321921.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability11617318203343964965.gal -t CGAL -ctl /tmp/CTLFireability6759442852508321921.ctl
No direction supplied, using forward translation only.
Parsed 11 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.17512e+18,14.2076,282124,7435,61,453499,886,1064,896783,75,2973,0


Converting to forward existential form...Done !
original formula: A((AF(((((((((((((((((i2.i0.u15.p40==1)&&(i7.i3.u83.p214==1))&&(i14.u141.p368==1))||(((i13.u33.p105==1)&&(i13.u102.p265==1))&&(i13.u127.p339==1)))||((i13.u38.p96==1)&&(i13.u128.p340==1)))||(((i13.u34.p95==1)&&(i13.u102.p265==1))&&(i13.u153.p400==1)))||(((i0.i0.u52.p129==1)&&(i0.i1.u85.p220==1))&&(i0.i0.u130.p344==1)))||(i11.i0.u136.p357==1))||(i7.i2.u80.p208==1))||(i13.u48.p119==1))||(((i1.i0.u11.p23==1)&&(i7.i1.u79.p204==1))&&(i14.u141.p368==1)))||(i1.i1.u10.p25==1))||(i8.i3.u117.p302==1))||(i10.i1.u126.p334==1))||(i1.i0.u114.p296==1))||(i12.i0.u138.p361==1))) + ((!(EX(((((((((((i1.i0.u7.p16==1)||(i13.u33.p80==1))||(i11.i1.u97.p247==1))||(((i10.i0.u36.p89==1)&&(i10.i0.u94.p245==1))&&(i13.u125.p376==1)))||((i13.u49.p121==1)&&(i13.u50.p124==1)))||(((i1.i0.u13.p30==1)&&(i7.i2.u80.p209==1))&&(i14.u141.p368==1)))||(i14.u135.p354==1))||(i8.i3.u115.p297==1))||(i6.i3.u92.p237==1))||(i4.i0.u25.p62==1)))) * (((((((((i6.i0.u69.p179==0)&&(i10.i1.u101.p261==0))&&(i5.i3.u98.p253==0))&&(i4.i1.u27.p74==0))&&(i2.i0.u24.p60==0))&&(i4.i0.u26.p63==0))&&(((i10.i0.u39.p99==0)||(i10.i0.u94.p245==0))||(i10.i1.u147.p385==0)))&&(((i9.u53.p132==0)||(i10.i0.u94.p244==0))||(i14.u141.p368==0)))||(((((((((i11.i0.u57.p145==0)&&(i14.u141.p368==0))&&(i10.i1.u100.p258==0))&&(i8.i1.u73.p187==0))&&(i5.i3.u98.p253==0))&&(i7.i1.u78.p202==0))&&(i7.i2.u81.p207==0))&&(i3.i0.u121.p313==0))&&(((i11.i0.u58.p147==0)||(i11.i1.u96.p250==0))||(i11.i0.u136.p356==0))))) * ((i14.u131.p347==0)||((i7.i2.u81.p211==0)&&(((i10.i0.u36.p89==0)||(i10.i0.u94.p245==0))||(i13.u125.p376==0)))))) U A((!(EF((((((((((((((i1.i0.u8.p18==1)||(i10.i0.u40.p101==1))||(((i13.u46.p117==1)&&(i13.u102.p265==1))&&(i13.u153.p400==1)))||(((i13.u35.p120==1)&&(i10.i1.u100.p260==1))&&(i10.i1.u147.p388==1)))||(i8.i0.u72.p186==1))||(i10.i1.u37.p91==1))||(i3.i0.u121.p313==1))||(i11.i1.u97.p251==1))||(i13.u125.p375==1))||(i14.u135.p355==1))||(i13.u47.p116==1))||(i4.i1.u27.p74==1))||(i14.u140.p366==1)))) + E(((((((i10.i0.u95.p246==0)&&(i11.i0.u136.p357==0))&&(((i13.u33.p105==0)||(i13.u102.p265==0))||(i13.u153.p400==0)))&&(i13.u127.p337==0))&&(((i10.i0.u40.p100==0)||(i10.i1.u41.p103==0))||(i13.u42.p106==0)))&&(i5.i2.u66.p171==0)) U (EX(((((((i7.i3.u83.p213==1)||(i13.u47.p116==1))||(i3.i0.u22.p55==1))||(((i13.u35.p123==1)&&(i13.u102.p265==1))&&(i13.u127.p339==1)))||(i5.i0.u64.p165==1))||(i7.i1.u79.p203==1))) * E((i10.i0.u39.p98==1) U ((((((((((((i10.i0.u39.p102==1)&&(i10.i1.u100.p260==1))&&(i13.u153.p397==1))||(i12.i0.u62.p161==1))||(i2.i0.u16.p37==1))||(i5.i3.u99.p256==1))||(((i4.i1.u27.p65==1)&&(i6.i3.u93.p240==1))&&(i14.u112.p287==1)))||(i4.i1.u30.p71==1))||(i7.i0.u70.p180==1))||(((i10.i0.u39.p102==1)&&(i10.i1.u100.p260==1))&&(i10.i1.u147.p388==1)))||(i1.i0.u11.p26==1))||(i14.u133.p351==1)))))) U (((((((((((((i0.i0.u51.p128==1)||(i8.i2.u76.p192==1))||(i14.u141.p368==1))||(i14.u111.p286==1))||(i7.i0.u71.p184==1))||(i3.i1.u86.p222==1))||(i12.i0.u62.p161==1))||(i7.i3.u83.p213==1))||(i9.u53.p133==1))||(i7.i1.u79.p203==1))||(i8.i0.u72.p185==1))||(i1.i0.u7.p15==1))||(((i9.u56.p141==1)&&(i7.i3.u83.p215==1))&&(i9.u134.p352==1)))))
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!((((((((((((((i0.i0.u51.p128==1)||(i8.i2.u76.p192==1))||(i14.u141.p368==1))||(i14.u111.p286==1))||(i7.i0.u71.p184==1))||(i3.i1.u86.p222==1))||(i12.i0.u62.p161==1))||(i7.i3.u83.p213==1))||(i9.u53.p133==1))||(i7.i1.u79.p203==1))||(i8.i0.u72.p185==1))||(i1.i0.u7.p15==1))||(((i9.u56.p141==1)&&(i7.i3.u83.p215==1))&&(i9.u134.p352==1)))) U (!((!(E(TRUE U (((((((((((((i1.i0.u8.p18==1)||(i10.i0.u40.p101==1))||(((i13.u46.p117==1)&&(i13.u102.p265==1))&&(i13.u153.p400==1)))||(((i13.u35.p120==1)&&(i10.i1.u100.p260==1))&&(i10.i1.u147.p388==1)))||(i8.i0.u72.p186==1))||(i10.i1.u37.p91==1))||(i3.i0.u121.p313==1))||(i11.i1.u97.p251==1))||(i13.u125.p375==1))||(i14.u135.p355==1))||(i13.u47.p116==1))||(i4.i1.u27.p74==1))||(i14.u140.p366==1)))) + E(((((((i10.i0.u95.p246==0)&&(i11.i0.u136.p357==0))&&(((i13.u33.p105==0)||(i13.u102.p265==0))||(i13.u153.p400==0)))&&(i13.u127.p337==0))&&(((i10.i0.u40.p100==0)||(i10.i1.u41.p103==0))||(i13.u42.p106==0)))&&(i5.i2.u66.p171==0)) U (EX(((((((i7.i3.u83.p213==1)||(i13.u47.p116==1))||(i3.i0.u22.p55==1))||(((i13.u35.p123==1)&&(i13.u102.p265==1))&&(i13.u127.p339==1)))||(i5.i0.u64.p165==1))||(i7.i1.u79.p203==1))) * E((i10.i0.u39.p98==1) U ((((((((((((i10.i0.u39.p102==1)&&(i10.i1.u100.p260==1))&&(i13.u153.p397==1))||(i12.i0.u62.p161==1))||(i2.i0.u16.p37==1))||(i5.i3.u99.p256==1))||(((i4.i1.u27.p65==1)&&(i6.i3.u93.p240==1))&&(i14.u112.p287==1)))||(i4.i1.u30.p71==1))||(i7.i0.u70.p180==1))||(((i10.i0.u39.p102==1)&&(i10.i1.u100.p260==1))&&(i10.i1.u147.p388==1)))||(i1.i0.u11.p26==1))||(i14.u133.p351==1))))))) * !((((((((((((((i0.i0.u51.p128==1)||(i8.i2.u76.p192==1))||(i14.u141.p368==1))||(i14.u111.p286==1))||(i7.i0.u71.p184==1))||(i3.i1.u86.p222==1))||(i12.i0.u62.p161==1))||(i7.i3.u83.p213==1))||(i9.u53.p133==1))||(i7.i1.u79.p203==1))||(i8.i0.u72.p185==1))||(i1.i0.u7.p15==1))||(((i9.u56.p141==1)&&(i7.i3.u83.p215==1))&&(i9.u134.p352==1)))))) + EG(!((((((((((((((i0.i0.u51.p128==1)||(i8.i2.u76.p192==1))||(i14.u141.p368==1))||(i14.u111.p286==1))||(i7.i0.u71.p184==1))||(i3.i1.u86.p222==1))||(i12.i0.u62.p161==1))||(i7.i3.u83.p213==1))||(i9.u53.p133==1))||(i7.i1.u79.p203==1))||(i8.i0.u72.p185==1))||(i1.i0.u7.p15==1))||(((i9.u56.p141==1)&&(i7.i3.u83.p215==1))&&(i9.u134.p352==1))))))))))) * !(E(!(!((E(!((((((((((((((i0.i0.u51.p128==1)||(i8.i2.u76.p192==1))||(i14.u141.p368==1))||(i14.u111.p286==1))||(i7.i0.u71.p184==1))||(i3.i1.u86.p222==1))||(i12.i0.u62.p161==1))||(i7.i3.u83.p213==1))||(i9.u53.p133==1))||(i7.i1.u79.p203==1))||(i8.i0.u72.p185==1))||(i1.i0.u7.p15==1))||(((i9.u56.p141==1)&&(i7.i3.u83.p215==1))&&(i9.u134.p352==1)))) U (!((!(E(TRUE U (((((((((((((i1.i0.u8.p18==1)||(i10.i0.u40.p101==1))||(((i13.u46.p117==1)&&(i13.u102.p265==1))&&(i13.u153.p400==1)))||(((i13.u35.p120==1)&&(i10.i1.u100.p260==1))&&(i10.i1.u147.p388==1)))||(i8.i0.u72.p186==1))||(i10.i1.u37.p91==1))||(i3.i0.u121.p313==1))||(i11.i1.u97.p251==1))||(i13.u125.p375==1))||(i14.u135.p355==1))||(i13.u47.p116==1))||(i4.i1.u27.p74==1))||(i14.u140.p366==1)))) + E(((((((i10.i0.u95.p246==0)&&(i11.i0.u136.p357==0))&&(((i13.u33.p105==0)||(i13.u102.p265==0))||(i13.u153.p400==0)))&&(i13.u127.p337==0))&&(((i10.i0.u40.p100==0)||(i10.i1.u41.p103==0))||(i13.u42.p106==0)))&&(i5.i2.u66.p171==0)) U (EX(((((((i7.i3.u83.p213==1)||(i13.u47.p116==1))||(i3.i0.u22.p55==1))||(((i13.u35.p123==1)&&(i13.u102.p265==1))&&(i13.u127.p339==1)))||(i5.i0.u64.p165==1))||(i7.i1.u79.p203==1))) * E((i10.i0.u39.p98==1) U ((((((((((((i10.i0.u39.p102==1)&&(i10.i1.u100.p260==1))&&(i13.u153.p397==1))||(i12.i0.u62.p161==1))||(i2.i0.u16.p37==1))||(i5.i3.u99.p256==1))||(((i4.i1.u27.p65==1)&&(i6.i3.u93.p240==1))&&(i14.u112.p287==1)))||(i4.i1.u30.p71==1))||(i7.i0.u70.p180==1))||(((i10.i0.u39.p102==1)&&(i10.i1.u100.p260==1))&&(i10.i1.u147.p388==1)))||(i1.i0.u11.p26==1))||(i14.u133.p351==1))))))) * !((((((((((((((i0.i0.u51.p128==1)||(i8.i2.u76.p192==1))||(i14.u141.p368==1))||(i14.u111.p286==1))||(i7.i0.u71.p184==1))||(i3.i1.u86.p222==1))||(i12.i0.u62.p161==1))||(i7.i3.u83.p213==1))||(i9.u53.p133==1))||(i7.i1.u79.p203==1))||(i8.i0.u72.p185==1))||(i1.i0.u7.p15==1))||(((i9.u56.p141==1)&&(i7.i3.u83.p215==1))&&(i9.u134.p352==1)))))) + EG(!((((((((((((((i0.i0.u51.p128==1)||(i8.i2.u76.p192==1))||(i14.u141.p368==1))||(i14.u111.p286==1))||(i7.i0.u71.p184==1))||(i3.i1.u86.p222==1))||(i12.i0.u62.p161==1))||(i7.i3.u83.p213==1))||(i9.u53.p133==1))||(i7.i1.u79.p203==1))||(i8.i0.u72.p185==1))||(i1.i0.u7.p15==1))||(((i9.u56.p141==1)&&(i7.i3.u83.p215==1))&&(i9.u134.p352==1)))))))) U (!((!(EG(!(((((((((((((((((i2.i0.u15.p40==1)&&(i7.i3.u83.p214==1))&&(i14.u141.p368==1))||(((i13.u33.p105==1)&&(i13.u102.p265==1))&&(i13.u127.p339==1)))||((i13.u38.p96==1)&&(i13.u128.p340==1)))||(((i13.u34.p95==1)&&(i13.u102.p265==1))&&(i13.u153.p400==1)))||(((i0.i0.u52.p129==1)&&(i0.i1.u85.p220==1))&&(i0.i0.u130.p344==1)))||(i11.i0.u136.p357==1))||(i7.i2.u80.p208==1))||(i13.u48.p119==1))||(((i1.i0.u11.p23==1)&&(i7.i1.u79.p204==1))&&(i14.u141.p368==1)))||(i1.i1.u10.p25==1))||(i8.i3.u117.p302==1))||(i10.i1.u126.p334==1))||(i1.i0.u114.p296==1))||(i12.i0.u138.p361==1))))) + ((!(EX(((((((((((i1.i0.u7.p16==1)||(i13.u33.p80==1))||(i11.i1.u97.p247==1))||(((i10.i0.u36.p89==1)&&(i10.i0.u94.p245==1))&&(i13.u125.p376==1)))||((i13.u49.p121==1)&&(i13.u50.p124==1)))||(((i1.i0.u13.p30==1)&&(i7.i2.u80.p209==1))&&(i14.u141.p368==1)))||(i14.u135.p354==1))||(i8.i3.u115.p297==1))||(i6.i3.u92.p237==1))||(i4.i0.u25.p62==1)))) * (((((((((i6.i0.u69.p179==0)&&(i10.i1.u101.p261==0))&&(i5.i3.u98.p253==0))&&(i4.i1.u27.p74==0))&&(i2.i0.u24.p60==0))&&(i4.i0.u26.p63==0))&&(((i10.i0.u39.p99==0)||(i10.i0.u94.p245==0))||(i10.i1.u147.p385==0)))&&(((i9.u53.p132==0)||(i10.i0.u94.p244==0))||(i14.u141.p368==0)))||(((((((((i11.i0.u57.p145==0)&&(i14.u141.p368==0))&&(i10.i1.u100.p258==0))&&(i8.i1.u73.p187==0))&&(i5.i3.u98.p253==0))&&(i7.i1.u78.p202==0))&&(i7.i2.u81.p207==0))&&(i3.i0.u121.p313==0))&&(((i11.i0.u58.p147==0)||(i11.i1.u96.p250==0))||(i11.i0.u136.p356==0))))) * ((i14.u131.p347==0)||((i7.i2.u81.p211==0)&&(((i10.i0.u36.p89==0)||(i10.i0.u94.p245==0))||(i13.u125.p376==0))))))) * !(!((E(!((((((((((((((i0.i0.u51.p128==1)||(i8.i2.u76.p192==1))||(i14.u141.p368==1))||(i14.u111.p286==1))||(i7.i0.u71.p184==1))||(i3.i1.u86.p222==1))||(i12.i0.u62.p161==1))||(i7.i3.u83.p213==1))||(i9.u53.p133==1))||(i7.i1.u79.p203==1))||(i8.i0.u72.p185==1))||(i1.i0.u7.p15==1))||(((i9.u56.p141==1)&&(i7.i3.u83.p215==1))&&(i9.u134.p352==1)))) U (!((!(E(TRUE U (((((((((((((i1.i0.u8.p18==1)||(i10.i0.u40.p101==1))||(((i13.u46.p117==1)&&(i13.u102.p265==1))&&(i13.u153.p400==1)))||(((i13.u35.p120==1)&&(i10.i1.u100.p260==1))&&(i10.i1.u147.p388==1)))||(i8.i0.u72.p186==1))||(i10.i1.u37.p91==1))||(i3.i0.u121.p313==1))||(i11.i1.u97.p251==1))||(i13.u125.p375==1))||(i14.u135.p355==1))||(i13.u47.p116==1))||(i4.i1.u27.p74==1))||(i14.u140.p366==1)))) + E(((((((i10.i0.u95.p246==0)&&(i11.i0.u136.p357==0))&&(((i13.u33.p105==0)||(i13.u102.p265==0))||(i13.u153.p400==0)))&&(i13.u127.p337==0))&&(((i10.i0.u40.p100==0)||(i10.i1.u41.p103==0))||(i13.u42.p106==0)))&&(i5.i2.u66.p171==0)) U (EX(((((((i7.i3.u83.p213==1)||(i13.u47.p116==1))||(i3.i0.u22.p55==1))||(((i13.u35.p123==1)&&(i13.u102.p265==1))&&(i13.u127.p339==1)))||(i5.i0.u64.p165==1))||(i7.i1.u79.p203==1))) * E((i10.i0.u39.p98==1) U ((((((((((((i10.i0.u39.p102==1)&&(i10.i1.u100.p260==1))&&(i13.u153.p397==1))||(i12.i0.u62.p161==1))||(i2.i0.u16.p37==1))||(i5.i3.u99.p256==1))||(((i4.i1.u27.p65==1)&&(i6.i3.u93.p240==1))&&(i14.u112.p287==1)))||(i4.i1.u30.p71==1))||(i7.i0.u70.p180==1))||(((i10.i0.u39.p102==1)&&(i10.i1.u100.p260==1))&&(i10.i1.u147.p388==1)))||(i1.i0.u11.p26==1))||(i14.u133.p351==1))))))) * !((((((((((((((i0.i0.u51.p128==1)||(i8.i2.u76.p192==1))||(i14.u141.p368==1))||(i14.u111.p286==1))||(i7.i0.u71.p184==1))||(i3.i1.u86.p222==1))||(i12.i0.u62.p161==1))||(i7.i3.u83.p213==1))||(i9.u53.p133==1))||(i7.i1.u79.p203==1))||(i8.i0.u72.p185==1))||(i1.i0.u7.p15==1))||(((i9.u56.p141==1)&&(i7.i3.u83.p215==1))&&(i9.u134.p352==1)))))) + EG(!((((((((((((((i0.i0.u51.p128==1)||(i8.i2.u76.p192==1))||(i14.u141.p368==1))||(i14.u111.p286==1))||(i7.i0.u71.p184==1))||(i3.i1.u86.p222==1))||(i12.i0.u62.p161==1))||(i7.i3.u83.p213==1))||(i9.u53.p133==1))||(i7.i1.u79.p203==1))||(i8.i0.u72.p185==1))||(i1.i0.u7.p15==1))||(((i9.u56.p141==1)&&(i7.i3.u83.p215==1))&&(i9.u134.p352==1))))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t34, t36, t196, t209, t240, t246, i0.i0.u51.t195, i0.i1.t143, i0.i1.u85.t144, i1.i0.t252, i1.i0.t256, i1.i0.u8.t264, i1.i0.u11.t259, i1.i0.u13.t255, i1.i1.t261, i1.i1.u12.t257, i2.i0.t236, i2.i0.t251, i2.i0.u23.t239, i3.i0.u19.t245, i3.i1.t139, i3.i1.u87.t140, i4.t224, i4.i0.t222, i4.i0.t235, i4.i1.t227, i4.i1.t229, i4.i1.t231, i5.i0.u63.t171, i5.i1.u65.t168, i5.i3.t115, i5.i3.u98.t116, i5.i4.t99, i5.i4.u107.t100, i5.i5.u108.t16, i5.i5.u108.t37, i5.i5.u108.t56, i5.i5.u108.t69, i5.i5.u108.t82, i6.i1.t135, i6.i1.u88.t136, i6.i2.t131, i6.i2.u90.t132, i6.i3.t127, i6.i3.u93.t128, i7.i1.t155, i7.i1.u79.t156, i7.i2.t151, i7.i2.u80.t152, i7.i3.t147, i7.i3.u83.t148, i8.i0.u77.t158, i8.i1.t165, i8.i1.u74.t166, i8.i2.t162, i8.i2.u75.t163, i8.i3.t74, i8.i3.u115.t78, i9.u53.t191, i9.u55.t187, i10.t202, i10.i0.t123, i10.i0.u94.t124, i10.i1.t111, i10.i1.t200, i10.i1.u32.t213, i10.i1.u32.t219, i10.i1.u100.t112, i11.i0.u57.t183, i11.i1.t119, i11.i1.u96.t120, i12.i0.t172, i12.i0.u59.t179, i12.i0.u61.t175, i12.i1.t103, i12.i1.u105.t104, i13.t107, i13.t5, i13.t4, i13.u34.t198, i13.u102.t108, i14.t94, i14.t87, i14.t81, i14.t76, i14.t72, i14.t68, i14.t61, i14.t58, i14.t31, i14.t28, i14.t25, i14.t22, i14.t19, i14.t14, i14.u141.t41, i14.u141.t45, i14.u141.t49, i14.u141.t55, i14.u141.t66, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/229/100/365
ITS-tools command line returned an error code 139
[2021-05-11 20:00:07] [INFO ] Applying decomposition
[2021-05-11 20:00:07] [INFO ] Flatten gal took : 29 ms
[2021-05-11 20:00:07] [INFO ] Decomposing Gal with order
[2021-05-11 20:00:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 20:00:07] [INFO ] Removed a total of 118 redundant transitions.
[2021-05-11 20:00:07] [INFO ] Flatten gal took : 37 ms
[2021-05-11 20:00:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 44 ms.
[2021-05-11 20:00:07] [INFO ] Time to serialize gal into /tmp/CTLFireability3221590174888552272.gal : 6 ms
[2021-05-11 20:00:07] [INFO ] Time to serialize properties into /tmp/CTLFireability8041258966442852228.ctl : 7 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability3221590174888552272.gal, -t, CGAL, -ctl, /tmp/CTLFireability8041258966442852228.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability3221590174888552272.gal -t CGAL -ctl /tmp/CTLFireability8041258966442852228.ctl
No direction supplied, using forward translation only.
Parsed 11 CTL formulae.
Detected timeout of ITS tools.
[2021-05-11 20:21:04] [INFO ] Flatten gal took : 361 ms
[2021-05-11 20:21:05] [INFO ] Input system was already deterministic with 365 transitions.
[2021-05-11 20:21:05] [INFO ] Transformed 393 places.
[2021-05-11 20:21:05] [INFO ] Transformed 365 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//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/bin//..//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
[2021-05-11 20:21:35] [INFO ] Time to serialize gal into /tmp/CTLFireability6722245944566394709.gal : 10 ms
[2021-05-11 20:21:35] [INFO ] Time to serialize properties into /tmp/CTLFireability12891604690075984441.ctl : 10 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability6722245944566394709.gal, -t, CGAL, -ctl, /tmp/CTLFireability12891604690075984441.ctl, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability6722245944566394709.gal -t CGAL -ctl /tmp/CTLFireability12891604690075984441.ctl --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 11 CTL formulae.
Detected timeout of ITS tools.

BK_STOP 1620765754103

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-09"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

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

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

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