Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r030-smll-174853813200026.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is BusinessProcesses-PT-04, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-smll-174853813200026
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 79K May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME BusinessProcesses-PT-04-CTLFireability-2023-12
FORMULA_NAME BusinessProcesses-PT-04-CTLFireability-2023-13
FORMULA_NAME BusinessProcesses-PT-04-CTLFireability-2023-14
FORMULA_NAME BusinessProcesses-PT-04-CTLFireability-2023-15
FORMULA_NAME BusinessProcesses-PT-04-CTLFireability-2025-00
FORMULA_NAME BusinessProcesses-PT-04-CTLFireability-2025-01
FORMULA_NAME BusinessProcesses-PT-04-CTLFireability-2025-02
FORMULA_NAME BusinessProcesses-PT-04-CTLFireability-2025-03
FORMULA_NAME BusinessProcesses-PT-04-CTLFireability-2025-04
FORMULA_NAME BusinessProcesses-PT-04-CTLFireability-2025-05
FORMULA_NAME BusinessProcesses-PT-04-CTLFireability-2025-06
FORMULA_NAME BusinessProcesses-PT-04-CTLFireability-2025-07
FORMULA_NAME BusinessProcesses-PT-04-CTLFireability-2025-08
FORMULA_NAME BusinessProcesses-PT-04-CTLFireability-2025-09
FORMULA_NAME BusinessProcesses-PT-04-CTLFireability-2025-10
FORMULA_NAME BusinessProcesses-PT-04-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1748546589126

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-05-29 19:23:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-29 19:23:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 19:23:12] [INFO ] Load time of PNML (sax parser for PT used): 184 ms
[2025-05-29 19:23:12] [INFO ] Transformed 288 places.
[2025-05-29 19:23:12] [INFO ] Transformed 283 transitions.
[2025-05-29 19:23:12] [INFO ] Found NUPN structural information;
[2025-05-29 19:23:12] [INFO ] Parsed PT model containing 288 places and 283 transitions and 916 arcs in 409 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 21 ms.
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 2 transitions.
Support contains 120 out of 286 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 281/281 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 283 transition count 281
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 22 place count 264 transition count 262
Iterating global reduction 1 with 19 rules applied. Total rules applied 41 place count 264 transition count 262
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 46 place count 259 transition count 257
Iterating global reduction 1 with 5 rules applied. Total rules applied 51 place count 259 transition count 257
Applied a total of 51 rules in 93 ms. Remains 259 /286 variables (removed 27) and now considering 257/281 (removed 24) transitions.
// Phase 1: matrix 257 rows 259 cols
[2025-05-29 19:23:12] [INFO ] Computed 41 invariants in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:23:13] [INFO ] Implicit Places using invariants in 579 ms returned []
[2025-05-29 19:23:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:23:13] [INFO ] Implicit Places using invariants and state equation in 733 ms returned []
Implicit Place search using SMT with State Equation took 1367 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2025-05-29 19:23:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (OVERLAPS) 1/259 variables, 18/40 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/259 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:24] [INFO ] Deduced a trap composed of 38 places in 261 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:24] [INFO ] Deduced a trap composed of 52 places in 208 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:24] [INFO ] Deduced a trap composed of 56 places in 309 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:24] [INFO ] Deduced a trap composed of 53 places in 257 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:25] [INFO ] Deduced a trap composed of 57 places in 249 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:25] [INFO ] Deduced a trap composed of 55 places in 201 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:25] [INFO ] Deduced a trap composed of 53 places in 233 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:25] [INFO ] Deduced a trap composed of 53 places in 249 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:25] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:26] [INFO ] Deduced a trap composed of 57 places in 256 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:26] [INFO ] Deduced a trap composed of 14 places in 238 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:26] [INFO ] Deduced a trap composed of 29 places in 243 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:27] [INFO ] Deduced a trap composed of 48 places in 241 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:27] [INFO ] Deduced a trap composed of 30 places in 245 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:27] [INFO ] Deduced a trap composed of 29 places in 223 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:27] [INFO ] Deduced a trap composed of 30 places in 124 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:27] [INFO ] Deduced a trap composed of 32 places in 132 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:28] [INFO ] Deduced a trap composed of 35 places in 152 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:28] [INFO ] Deduced a trap composed of 56 places in 176 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:28] [INFO ] Deduced a trap composed of 50 places in 175 ms of which 32 ms to minimize.
Problem TDEAD185 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD209 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 20/61 constraints. Problems are: Problem set: 3 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:28] [INFO ] Deduced a trap composed of 59 places in 138 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:29] [INFO ] Deduced a trap composed of 59 places in 143 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:29] [INFO ] Deduced a trap composed of 60 places in 203 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:29] [INFO ] Deduced a trap composed of 56 places in 227 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:29] [INFO ] Deduced a trap composed of 57 places in 232 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:30] [INFO ] Deduced a trap composed of 63 places in 232 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:30] [INFO ] Deduced a trap composed of 61 places in 225 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:30] [INFO ] Deduced a trap composed of 58 places in 232 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:30] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:30] [INFO ] Deduced a trap composed of 23 places in 159 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:31] [INFO ] Deduced a trap composed of 22 places in 248 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:31] [INFO ] Deduced a trap composed of 27 places in 250 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:31] [INFO ] Deduced a trap composed of 34 places in 218 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:32] [INFO ] Deduced a trap composed of 39 places in 206 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:32] [INFO ] Deduced a trap composed of 39 places in 204 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:32] [INFO ] Deduced a trap composed of 39 places in 242 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:32] [INFO ] Deduced a trap composed of 42 places in 218 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:33] [INFO ] Deduced a trap composed of 24 places in 225 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:33] [INFO ] Deduced a trap composed of 42 places in 218 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:33] [INFO ] Deduced a trap composed of 29 places in 204 ms of which 23 ms to minimize.
Problem TDEAD249 is UNSAT
Problem TDEAD251 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 20/81 constraints. Problems are: Problem set: 5 solved, 251 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:34] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:34] [INFO ] Deduced a trap composed of 55 places in 258 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:34] [INFO ] Deduced a trap composed of 57 places in 247 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:35] [INFO ] Deduced a trap composed of 57 places in 239 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:35] [INFO ] Deduced a trap composed of 60 places in 232 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:35] [INFO ] Deduced a trap composed of 60 places in 220 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:35] [INFO ] Deduced a trap composed of 61 places in 238 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:36] [INFO ] Deduced a trap composed of 61 places in 257 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:36] [INFO ] Deduced a trap composed of 59 places in 204 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:36] [INFO ] Deduced a trap composed of 54 places in 196 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:36] [INFO ] Deduced a trap composed of 53 places in 188 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:37] [INFO ] Deduced a trap composed of 54 places in 214 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:37] [INFO ] Deduced a trap composed of 56 places in 228 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:37] [INFO ] Deduced a trap composed of 64 places in 205 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:37] [INFO ] Deduced a trap composed of 62 places in 219 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:38] [INFO ] Deduced a trap composed of 62 places in 240 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:38] [INFO ] Deduced a trap composed of 41 places in 230 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:38] [INFO ] Deduced a trap composed of 40 places in 242 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:39] [INFO ] Deduced a trap composed of 57 places in 226 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:39] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 20/101 constraints. Problems are: Problem set: 5 solved, 251 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:42] [INFO ] Deduced a trap composed of 41 places in 212 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:43] [INFO ] Deduced a trap composed of 15 places in 256 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:43] [INFO ] Deduced a trap composed of 20 places in 241 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:43] [INFO ] Deduced a trap composed of 26 places in 247 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:44] [INFO ] Deduced a trap composed of 27 places in 257 ms of which 42 ms to minimize.
SMT process timed out in 30414ms, After SMT, problems are : Problem set: 5 solved, 251 unsolved
Search for dead transitions found 5 dead transitions in 30443ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) removed 5 transitions
Starting structural reductions in LTL mode, iteration 1 : 259/286 places, 252/281 transitions.
Applied a total of 0 rules in 10 ms. Remains 259 /259 variables (removed 0) and now considering 252/252 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31953 ms. Remains : 259/286 places, 252/281 transitions.
Support contains 120 out of 259 places after structural reductions.
[2025-05-29 19:23:44] [INFO ] Flatten gal took : 108 ms
[2025-05-29 19:23:44] [INFO ] Flatten gal took : 49 ms
[2025-05-29 19:23:45] [INFO ] Input system was already deterministic with 252 transitions.
RANDOM walk for 40000 steps (461 resets) in 2451 ms. (16 steps per ms) remains 20/78 properties
BEST_FIRST walk for 4003 steps (11 resets) in 56 ms. (70 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (10 resets) in 58 ms. (67 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (10 resets) in 63 ms. (62 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (11 resets) in 48 ms. (81 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (9 resets) in 43 ms. (90 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (11 resets) in 49 ms. (80 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (10 resets) in 51 ms. (76 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (10 resets) in 53 ms. (74 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (10 resets) in 48 ms. (81 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (10 resets) in 43 ms. (90 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (10 resets) in 39 ms. (100 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (9 resets) in 36 ms. (108 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (11 resets) in 36 ms. (108 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (12 resets) in 21 ms. (181 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (11 resets) in 34 ms. (114 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (11 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (9 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (10 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (10 resets) in 23 ms. (166 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (10 resets) in 68 ms. (58 steps per ms) remains 20/20 properties
// Phase 1: matrix 252 rows 259 cols
[2025-05-29 19:23:46] [INFO ] Computed 41 invariants in 10 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp73 is UNSAT
At refinement iteration 1 (OVERLAPS) 125/181 variables, 17/17 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 0/17 constraints. Problems are: Problem set: 2 solved, 18 unsolved
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp30 is UNSAT
At refinement iteration 3 (OVERLAPS) 68/249 variables, 24/41 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 0/41 constraints. Problems are: Problem set: 4 solved, 16 unsolved
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp34 is UNSAT
At refinement iteration 5 (OVERLAPS) 245/494 variables, 249/290 constraints. Problems are: Problem set: 6 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/494 variables, 0/290 constraints. Problems are: Problem set: 6 solved, 14 unsolved
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp71 is UNSAT
At refinement iteration 7 (OVERLAPS) 11/505 variables, 6/296 constraints. Problems are: Problem set: 15 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/505 variables, 0/296 constraints. Problems are: Problem set: 15 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 6/511 variables, 4/300 constraints. Problems are: Problem set: 15 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/511 variables, 0/300 constraints. Problems are: Problem set: 15 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/511 variables, 0/300 constraints. Problems are: Problem set: 15 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 511/511 variables, and 300 constraints, problems are : Problem set: 15 solved, 5 unsolved in 1547 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 259/259 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 5 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 5 unsolved
Problem AtomicPropp50 is UNSAT
At refinement iteration 1 (OVERLAPS) 112/129 variables, 8/8 constraints. Problems are: Problem set: 16 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:47] [INFO ] Deduced a trap composed of 50 places in 94 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:48] [INFO ] Deduced a trap composed of 51 places in 91 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:48] [INFO ] Deduced a trap composed of 54 places in 84 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:48] [INFO ] Deduced a trap composed of 57 places in 104 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:48] [INFO ] Deduced a trap composed of 58 places in 108 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:48] [INFO ] Deduced a trap composed of 61 places in 99 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:48] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 3 ms to minimize.
Problem AtomicPropp51 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 7/15 constraints. Problems are: Problem set: 17 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:48] [INFO ] Deduced a trap composed of 51 places in 105 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:48] [INFO ] Deduced a trap composed of 51 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:48] [INFO ] Deduced a trap composed of 49 places in 69 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 3/18 constraints. Problems are: Problem set: 17 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/18 constraints. Problems are: Problem set: 17 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 35/164 variables, 9/27 constraints. Problems are: Problem set: 17 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:48] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:48] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:49] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:49] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 4/31 constraints. Problems are: Problem set: 17 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 0/31 constraints. Problems are: Problem set: 17 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 85/249 variables, 24/55 constraints. Problems are: Problem set: 17 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:49] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:49] [INFO ] Deduced a trap composed of 29 places in 132 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:49] [INFO ] Deduced a trap composed of 32 places in 141 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:49] [INFO ] Deduced a trap composed of 27 places in 175 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:49] [INFO ] Deduced a trap composed of 22 places in 222 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:50] [INFO ] Deduced a trap composed of 30 places in 212 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:50] [INFO ] Deduced a trap composed of 30 places in 181 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:50] [INFO ] Deduced a trap composed of 36 places in 228 ms of which 42 ms to minimize.
Problem AtomicPropp28 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:50] [INFO ] Deduced a trap composed of 36 places in 216 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:51] [INFO ] Deduced a trap composed of 49 places in 201 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:51] [INFO ] Deduced a trap composed of 36 places in 183 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:51] [INFO ] Deduced a trap composed of 36 places in 214 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:51] [INFO ] Deduced a trap composed of 52 places in 226 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:51] [INFO ] Deduced a trap composed of 52 places in 197 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:52] [INFO ] Deduced a trap composed of 51 places in 218 ms of which 31 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 15/70 constraints. Problems are: Problem set: 18 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:52] [INFO ] Deduced a trap composed of 60 places in 134 ms of which 24 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 1/71 constraints. Problems are: Problem set: 18 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 0/71 constraints. Problems are: Problem set: 18 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 245/494 variables, 249/320 constraints. Problems are: Problem set: 18 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/494 variables, 2/322 constraints. Problems are: Problem set: 18 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:52] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:52] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:23:52] [INFO ] Deduced a trap along path composed of 3 places in 33 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/494 variables, 3/325 constraints. Problems are: Problem set: 18 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 494/511 variables, and 325 constraints, problems are : Problem set: 18 solved, 2 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 249/259 constraints, PredecessorRefiner: 2/20 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 6596ms problems are : Problem set: 18 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 259 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 259/259 places, 252/252 transitions.
Graph (trivial) has 126 edges and 259 vertex of which 8 / 259 are part of one of the 1 SCC in 3 ms
Free SCC test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 582 edges and 252 vertex of which 251 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 37 place count 251 transition count 206
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 73 place count 216 transition count 205
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 215 transition count 205
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 74 place count 215 transition count 162
Deduced a syphon composed of 43 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 91 rules applied. Total rules applied 165 place count 167 transition count 162
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 183 place count 149 transition count 144
Iterating global reduction 3 with 18 rules applied. Total rules applied 201 place count 149 transition count 144
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 201 place count 149 transition count 141
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 207 place count 146 transition count 141
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 299 place count 100 transition count 95
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 301 place count 99 transition count 98
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 302 place count 99 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 303 place count 98 transition count 97
Applied a total of 303 rules in 103 ms. Remains 98 /259 variables (removed 161) and now considering 97/252 (removed 155) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 98/259 places, 97/252 transitions.
RANDOM walk for 4656 steps (311 resets) in 38 ms. (119 steps per ms) remains 0/2 properties
Successfully simplified 18 atomic propositions for a total of 16 simplifications.
FORMULA BusinessProcesses-PT-04-CTLFireability-2025-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-CTLFireability-2025-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-CTLFireability-2025-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-29 19:23:52] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-05-29 19:23:52] [INFO ] Flatten gal took : 29 ms
FORMULA BusinessProcesses-PT-04-CTLFireability-2025-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-29 19:23:52] [INFO ] Flatten gal took : 29 ms
[2025-05-29 19:23:53] [INFO ] Input system was already deterministic with 252 transitions.
Support contains 79 out of 259 places (down from 83) after GAL structural reductions.
Computed a total of 230 stabilizing places and 223 stable transitions
Graph (complete) has 592 edges and 259 vertex of which 258 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 252/252 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 231 transition count 224
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 231 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 57 place count 231 transition count 223
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 67 place count 221 transition count 213
Iterating global reduction 1 with 10 rules applied. Total rules applied 77 place count 221 transition count 213
Applied a total of 77 rules in 22 ms. Remains 221 /259 variables (removed 38) and now considering 213/252 (removed 39) transitions.
// Phase 1: matrix 213 rows 221 cols
[2025-05-29 19:23:53] [INFO ] Computed 41 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:23:53] [INFO ] Implicit Places using invariants in 283 ms returned []
[2025-05-29 19:23:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:23:53] [INFO ] Implicit Places using invariants and state equation in 608 ms returned [20, 21]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 896 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 219/259 places, 213/252 transitions.
Applied a total of 0 rules in 4 ms. Remains 219 /219 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 923 ms. Remains : 219/259 places, 213/252 transitions.
[2025-05-29 19:23:53] [INFO ] Flatten gal took : 22 ms
[2025-05-29 19:23:54] [INFO ] Flatten gal took : 26 ms
[2025-05-29 19:23:54] [INFO ] Input system was already deterministic with 213 transitions.
[2025-05-29 19:23:54] [INFO ] Flatten gal took : 21 ms
[2025-05-29 19:23:54] [INFO ] Flatten gal took : 28 ms
[2025-05-29 19:23:54] [INFO ] Time to serialize gal into /tmp/CTLFireability3853271448314158507.gal : 11 ms
[2025-05-29 19:23:54] [INFO ] Time to serialize properties into /tmp/CTLFireability15762825439721123967.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3853271448314158507.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15762825439721123967.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
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.12662e+11,4.05261,96016,2,35256,5,344094,6,0,1090,395007,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-29 19:24:24] [INFO ] Flatten gal took : 15 ms
[2025-05-29 19:24:24] [INFO ] Applying decomposition
[2025-05-29 19:24:24] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5988352071637604541.txt' '-o' '/tmp/graph5988352071637604541.bin' '-w' '/tmp/graph5988352071637604541.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5988352071637604541.bin' '-l' '-1' '-v' '-w' '/tmp/graph5988352071637604541.weights' '-q' '0' '-e' '0.001'
[2025-05-29 19:24:24] [INFO ] Decomposing Gal with order
[2025-05-29 19:24:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 19:24:24] [INFO ] Removed a total of 212 redundant transitions.
[2025-05-29 19:24:24] [INFO ] Flatten gal took : 93 ms
[2025-05-29 19:24:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2025-05-29 19:24:24] [INFO ] Time to serialize gal into /tmp/CTLFireability2030620251304328582.gal : 12 ms
[2025-05-29 19:24:24] [INFO ] Time to serialize properties into /tmp/CTLFireability16485161622458895079.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2030620251304328582.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16485161622458895079.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
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.12662e+11,0.526356,13924,1476,49,20888,361,700,27261,53,934,0


Converting to forward existential form...Done !
original formula: AG(EF((AX((i0.i2.u41.p125==1)) * ((AF((i12.u65.p238==1)) + (i1.u35.p106==0)) + ((i8.u51.p166==0)||(i1.u67.p245==0))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (!(EX(!((i0.i2.u41.p125==1)))) * ((!(EG(!((i12.u65.p238==1)))) + (i1.u35.p106==0)...209
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t6, t7, t8, t9, t90, t112, t120, t196, t197, i0.i0.u40.t78, i0.i1.u38.t81, i0.i2.u52....538
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 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 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
Fast SCC detection found an SCC at level 12
(forward)formula 0,1,10.6713,264804,1,0,534377,551,4099,734522,258,1806,690615
FORMULA BusinessProcesses-PT-04-CTLFireability-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 252/252 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 232 transition count 225
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 232 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 55 place count 232 transition count 224
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 65 place count 222 transition count 214
Iterating global reduction 1 with 10 rules applied. Total rules applied 75 place count 222 transition count 214
Applied a total of 75 rules in 10 ms. Remains 222 /259 variables (removed 37) and now considering 214/252 (removed 38) transitions.
// Phase 1: matrix 214 rows 222 cols
[2025-05-29 19:24:35] [INFO ] Computed 41 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:24:35] [INFO ] Implicit Places using invariants in 194 ms returned []
[2025-05-29 19:24:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:24:36] [INFO ] Implicit Places using invariants and state equation in 674 ms returned [21, 23]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 871 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 220/259 places, 214/252 transitions.
Applied a total of 0 rules in 4 ms. Remains 220 /220 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 886 ms. Remains : 220/259 places, 214/252 transitions.
[2025-05-29 19:24:36] [INFO ] Flatten gal took : 22 ms
[2025-05-29 19:24:36] [INFO ] Flatten gal took : 22 ms
[2025-05-29 19:24:36] [INFO ] Input system was already deterministic with 214 transitions.
[2025-05-29 19:24:36] [INFO ] Flatten gal took : 19 ms
[2025-05-29 19:24:36] [INFO ] Flatten gal took : 19 ms
[2025-05-29 19:24:36] [INFO ] Time to serialize gal into /tmp/CTLFireability3037459990648161230.gal : 4 ms
[2025-05-29 19:24:36] [INFO ] Time to serialize properties into /tmp/CTLFireability8428996728893625217.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3037459990648161230.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8428996728893625217.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
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.12962e+11,7.25411,159436,2,46938,5,538963,6,0,1095,624955,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-29 19:25:06] [INFO ] Flatten gal took : 10 ms
[2025-05-29 19:25:06] [INFO ] Applying decomposition
[2025-05-29 19:25:06] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16159163581095790437.txt' '-o' '/tmp/graph16159163581095790437.bin' '-w' '/tmp/graph16159163581095790437.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16159163581095790437.bin' '-l' '-1' '-v' '-w' '/tmp/graph16159163581095790437.weights' '-q' '0' '-e' '0.001'
[2025-05-29 19:25:06] [INFO ] Decomposing Gal with order
[2025-05-29 19:25:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 19:25:06] [INFO ] Removed a total of 213 redundant transitions.
[2025-05-29 19:25:06] [INFO ] Flatten gal took : 31 ms
[2025-05-29 19:25:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2025-05-29 19:25:06] [INFO ] Time to serialize gal into /tmp/CTLFireability3894164987067853338.gal : 7 ms
[2025-05-29 19:25:06] [INFO ] Time to serialize properties into /tmp/CTLFireability15155824078975616521.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3894164987067853338.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15155824078975616521.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
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.12962e+11,1.14583,30032,3335,36,54588,347,733,72783,49,892,0


Converting to forward existential form...Done !
original formula: AX((EG((i8.i0.u21.p62==0)) * !(E(EF(((i0.u5.p14==1)||(i1.i0.u6.p19==1))) U AX(E((i8.i0.u65.p242==1) U (((i3.u16.p49==1)&&(i1.i1.u49.p150=...184
=> equivalent forward existential formula: ([(EY(Init) * !(EG((i8.i0.u21.p62==0))))] = FALSE * [(FwdU(EY(Init),E(TRUE U ((i0.u5.p14==1)||(i1.i0.u6.p19==1))...264
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t6, t7, t8, t9, t88, t111, t119, t197, t198, i0.u4.t130, i0.u35.t87, i1.t0, i1.i0...537
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 252/252 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 232 transition count 225
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 232 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 55 place count 232 transition count 224
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 65 place count 222 transition count 214
Iterating global reduction 1 with 10 rules applied. Total rules applied 75 place count 222 transition count 214
Applied a total of 75 rules in 10 ms. Remains 222 /259 variables (removed 37) and now considering 214/252 (removed 38) transitions.
// Phase 1: matrix 214 rows 222 cols
[2025-05-29 19:25:36] [INFO ] Computed 41 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:25:36] [INFO ] Implicit Places using invariants in 266 ms returned []
[2025-05-29 19:25:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:25:37] [INFO ] Implicit Places using invariants and state equation in 533 ms returned [20, 21]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 803 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 220/259 places, 214/252 transitions.
Applied a total of 0 rules in 4 ms. Remains 220 /220 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 818 ms. Remains : 220/259 places, 214/252 transitions.
[2025-05-29 19:25:37] [INFO ] Flatten gal took : 15 ms
[2025-05-29 19:25:37] [INFO ] Flatten gal took : 14 ms
[2025-05-29 19:25:37] [INFO ] Input system was already deterministic with 214 transitions.
[2025-05-29 19:25:37] [INFO ] Flatten gal took : 14 ms
[2025-05-29 19:25:37] [INFO ] Flatten gal took : 14 ms
[2025-05-29 19:25:37] [INFO ] Time to serialize gal into /tmp/CTLFireability1262595639710167491.gal : 3 ms
[2025-05-29 19:25:37] [INFO ] Time to serialize properties into /tmp/CTLFireability12191843398787411342.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1262595639710167491.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12191843398787411342.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
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.15809e+11,6.18055,118084,2,38484,5,422783,6,0,1095,467937,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-29 19:26:07] [INFO ] Flatten gal took : 10 ms
[2025-05-29 19:26:07] [INFO ] Applying decomposition
[2025-05-29 19:26:07] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17138581465065941403.txt' '-o' '/tmp/graph17138581465065941403.bin' '-w' '/tmp/graph17138581465065941403.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17138581465065941403.bin' '-l' '-1' '-v' '-w' '/tmp/graph17138581465065941403.weights' '-q' '0' '-e' '0.001'
[2025-05-29 19:26:07] [INFO ] Decomposing Gal with order
[2025-05-29 19:26:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 19:26:07] [INFO ] Removed a total of 205 redundant transitions.
[2025-05-29 19:26:07] [INFO ] Flatten gal took : 24 ms
[2025-05-29 19:26:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-05-29 19:26:07] [INFO ] Time to serialize gal into /tmp/CTLFireability8712816490746348090.gal : 6 ms
[2025-05-29 19:26:07] [INFO ] Time to serialize properties into /tmp/CTLFireability8381150903725847642.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8712816490746348090.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8381150903725847642.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
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.15809e+11,0.488577,16900,2004,67,26330,793,720,44125,78,1508,0


Converting to forward existential form...Done !
original formula: EX(A(((EG(EX((i9.i0.u2.p3==1))) + (i10.u64.p247==1)) + ((AX((i9.i2.u54.p187==1)) * EX((((u7.p13==1)&&(i8.i0.u44.p136==1))&&(i2.u56.p204==...213
=> equivalent forward existential formula: [((EY(Init) * !(EG(!(E(TRUE U (i6.u23.p74==1)))))) * !(E(!(E(TRUE U (i6.u23.p74==1))) U (!(((EG(EX((i9.i0.u2.p3=...358
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t8, t9, t91, t113, t121, t197, t198, i0.i0.u51.t56, i0.i1.u49.t62, i0.i1....529
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 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
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 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
Fast SCC detection found a local 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,1,27.2487,489860,1,0,843935,1253,4544,1.42743e+06,428,3540,928533
FORMULA BusinessProcesses-PT-04-CTLFireability-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 252/252 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 231 transition count 224
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 231 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 57 place count 231 transition count 223
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 68 place count 220 transition count 212
Iterating global reduction 1 with 11 rules applied. Total rules applied 79 place count 220 transition count 212
Applied a total of 79 rules in 9 ms. Remains 220 /259 variables (removed 39) and now considering 212/252 (removed 40) transitions.
// Phase 1: matrix 212 rows 220 cols
[2025-05-29 19:26:35] [INFO ] Computed 41 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:26:35] [INFO ] Implicit Places using invariants in 255 ms returned []
[2025-05-29 19:26:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:26:36] [INFO ] Implicit Places using invariants and state equation in 634 ms returned [20, 21]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 893 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 218/259 places, 212/252 transitions.
Applied a total of 0 rules in 4 ms. Remains 218 /218 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 907 ms. Remains : 218/259 places, 212/252 transitions.
[2025-05-29 19:26:36] [INFO ] Flatten gal took : 12 ms
[2025-05-29 19:26:36] [INFO ] Flatten gal took : 12 ms
[2025-05-29 19:26:36] [INFO ] Input system was already deterministic with 212 transitions.
[2025-05-29 19:26:36] [INFO ] Flatten gal took : 12 ms
[2025-05-29 19:26:36] [INFO ] Flatten gal took : 12 ms
[2025-05-29 19:26:36] [INFO ] Time to serialize gal into /tmp/CTLFireability2395711918404728442.gal : 3 ms
[2025-05-29 19:26:36] [INFO ] Time to serialize properties into /tmp/CTLFireability16987390521110528588.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2395711918404728442.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16987390521110528588.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
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.12622e+11,3.49716,77768,2,29639,5,276805,6,0,1085,297598,0


Converting to forward existential form...Done !
original formula: AG(AX((p144!=1)))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !((p144!=1)))] = FALSE
(forward)formula 0,0,4.17434,77768,1,0,9,276805,9,2,1921,297598,2
FORMULA BusinessProcesses-PT-04-CTLFireability-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 252/252 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 230 transition count 223
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 230 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 59 place count 230 transition count 222
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 70 place count 219 transition count 211
Iterating global reduction 1 with 11 rules applied. Total rules applied 81 place count 219 transition count 211
Applied a total of 81 rules in 14 ms. Remains 219 /259 variables (removed 40) and now considering 211/252 (removed 41) transitions.
// Phase 1: matrix 211 rows 219 cols
[2025-05-29 19:26:40] [INFO ] Computed 41 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:26:40] [INFO ] Implicit Places using invariants in 211 ms returned []
[2025-05-29 19:26:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:26:41] [INFO ] Implicit Places using invariants and state equation in 658 ms returned [20, 21]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 872 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 217/259 places, 211/252 transitions.
Applied a total of 0 rules in 4 ms. Remains 217 /217 variables (removed 0) and now considering 211/211 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 891 ms. Remains : 217/259 places, 211/252 transitions.
[2025-05-29 19:26:41] [INFO ] Flatten gal took : 11 ms
[2025-05-29 19:26:41] [INFO ] Flatten gal took : 12 ms
[2025-05-29 19:26:41] [INFO ] Input system was already deterministic with 211 transitions.
[2025-05-29 19:26:41] [INFO ] Flatten gal took : 12 ms
[2025-05-29 19:26:41] [INFO ] Flatten gal took : 12 ms
[2025-05-29 19:26:41] [INFO ] Time to serialize gal into /tmp/CTLFireability7952037956562258763.gal : 3 ms
[2025-05-29 19:26:41] [INFO ] Time to serialize properties into /tmp/CTLFireability7920741499004790533.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7952037956562258763.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7920741499004790533.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
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.12622e+11,9.06484,169084,2,46126,5,567554,6,0,1080,683268,0


Converting to forward existential form...Done !
original formula: (EF(EX((p15==1))) + EX(EX(!(E(EF((p192==1)) U (p266!=1))))))
=> equivalent forward existential formula: ([(EY(FwdU(Init,TRUE)) * (p15==1))] != FALSE + [(EY(EY(Init)) * !(E(E(TRUE U (p192==1)) U (p266!=1))))] != FALSE...156
(forward)formula 0,1,10.1866,169084,1,0,8,567554,8,1,1920,683268,2
FORMULA BusinessProcesses-PT-04-CTLFireability-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 252/252 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 236 transition count 229
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 236 transition count 229
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 236 transition count 228
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 55 place count 228 transition count 220
Iterating global reduction 1 with 8 rules applied. Total rules applied 63 place count 228 transition count 220
Applied a total of 63 rules in 12 ms. Remains 228 /259 variables (removed 31) and now considering 220/252 (removed 32) transitions.
// Phase 1: matrix 220 rows 228 cols
[2025-05-29 19:26:51] [INFO ] Computed 41 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:26:51] [INFO ] Implicit Places using invariants in 204 ms returned []
[2025-05-29 19:26:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:26:52] [INFO ] Implicit Places using invariants and state equation in 539 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 751 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 227/259 places, 220/252 transitions.
Applied a total of 0 rules in 3 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 767 ms. Remains : 227/259 places, 220/252 transitions.
[2025-05-29 19:26:52] [INFO ] Flatten gal took : 13 ms
[2025-05-29 19:26:52] [INFO ] Flatten gal took : 12 ms
[2025-05-29 19:26:52] [INFO ] Input system was already deterministic with 220 transitions.
[2025-05-29 19:26:52] [INFO ] Flatten gal took : 12 ms
[2025-05-29 19:26:52] [INFO ] Flatten gal took : 12 ms
[2025-05-29 19:26:52] [INFO ] Time to serialize gal into /tmp/CTLFireability858223214726059702.gal : 3 ms
[2025-05-29 19:26:52] [INFO ] Time to serialize properties into /tmp/CTLFireability4158304005749830627.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability858223214726059702.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4158304005749830627.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
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.2558e+11,7.86893,163380,2,51734,5,557364,6,0,1129,646844,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-29 19:27:22] [INFO ] Flatten gal took : 8 ms
[2025-05-29 19:27:22] [INFO ] Applying decomposition
[2025-05-29 19:27:22] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9094986289174890304.txt' '-o' '/tmp/graph9094986289174890304.bin' '-w' '/tmp/graph9094986289174890304.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9094986289174890304.bin' '-l' '-1' '-v' '-w' '/tmp/graph9094986289174890304.weights' '-q' '0' '-e' '0.001'
[2025-05-29 19:27:22] [INFO ] Decomposing Gal with order
[2025-05-29 19:27:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 19:27:22] [INFO ] Removed a total of 216 redundant transitions.
[2025-05-29 19:27:22] [INFO ] Flatten gal took : 20 ms
[2025-05-29 19:27:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 9 ms.
[2025-05-29 19:27:22] [INFO ] Time to serialize gal into /tmp/CTLFireability16634053694941593773.gal : 4 ms
[2025-05-29 19:27:22] [INFO ] Time to serialize properties into /tmp/CTLFireability1102492205411666603.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16634053694941593773.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1102492205411666603.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
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.2558e+11,0.943601,28516,2123,51,44042,472,731,113634,68,1310,0


Converting to forward existential form...Done !
original formula: EF(((((i1.i1.u7.p30==1)&&(i1.i2.u46.p151==1))&&((i1.i1.u70.p257==1)&&(i9.i0.u53.p174==1))) * ((EX(E((i11.u66.p244==1) U (i5.u0.p1==1))) +...489
=> equivalent forward existential formula: (([(EY(((FwdU(Init,TRUE) * (((i1.i1.u7.p30==1)&&(i1.i2.u46.p151==1))&&((i1.i1.u70.p257==1)&&(i9.i0.u53.p174==1))...1594
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t6, t7, t8, t9, t42, t95, t118, t126, t204, i0.u4.t136, i1.i0.t129, i1.i0.u6.t133, i1...565
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 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 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
Fast SCC detection found an SCC at level 12
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 259/259 places, 252/252 transitions.
Graph (trivial) has 130 edges and 259 vertex of which 7 / 259 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.
Graph (complete) has 585 edges and 253 vertex of which 252 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 40 place count 251 transition count 205
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 78 place count 213 transition count 205
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 78 place count 213 transition count 161
Deduced a syphon composed of 44 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 172 place count 163 transition count 161
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 193 place count 142 transition count 140
Iterating global reduction 2 with 21 rules applied. Total rules applied 214 place count 142 transition count 140
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 214 place count 142 transition count 135
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 224 place count 137 transition count 135
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 306 place count 96 transition count 94
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 307 place count 95 transition count 93
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 308 place count 94 transition count 93
Applied a total of 308 rules in 42 ms. Remains 94 /259 variables (removed 165) and now considering 93/252 (removed 159) transitions.
// Phase 1: matrix 93 rows 94 cols
[2025-05-29 19:27:52] [INFO ] Computed 34 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:27:52] [INFO ] Implicit Places using invariants in 146 ms returned [0, 11, 34, 35]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 147 ms to find 4 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 90/259 places, 93/252 transitions.
Applied a total of 0 rules in 6 ms. Remains 90 /90 variables (removed 0) and now considering 93/93 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 195 ms. Remains : 90/259 places, 93/252 transitions.
[2025-05-29 19:27:52] [INFO ] Flatten gal took : 4 ms
[2025-05-29 19:27:52] [INFO ] Flatten gal took : 4 ms
[2025-05-29 19:27:52] [INFO ] Input system was already deterministic with 93 transitions.
[2025-05-29 19:27:52] [INFO ] Flatten gal took : 4 ms
[2025-05-29 19:27:52] [INFO ] Flatten gal took : 5 ms
[2025-05-29 19:27:52] [INFO ] Time to serialize gal into /tmp/CTLFireability4618161759330798526.gal : 1 ms
[2025-05-29 19:27:52] [INFO ] Time to serialize properties into /tmp/CTLFireability15985358887550493743.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4618161759330798526.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15985358887550493743.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
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,11892,0.111513,7224,2,2264,5,14987,6,0,452,10201,0


Converting to forward existential form...Done !
original formula: EF(AG((p190==0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((p190==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t11, t12, t13, t14, t15, t28, t29, t30, t31, t32, t64, t65, t79, t80, t82, t83, t84, Interse...246
(forward)formula 0,1,0.890707,27280,1,0,127,122424,172,54,3584,69164,164
FORMULA BusinessProcesses-PT-04-CTLFireability-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 252/252 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 232 transition count 225
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 232 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 55 place count 232 transition count 224
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 65 place count 222 transition count 214
Iterating global reduction 1 with 10 rules applied. Total rules applied 75 place count 222 transition count 214
Applied a total of 75 rules in 8 ms. Remains 222 /259 variables (removed 37) and now considering 214/252 (removed 38) transitions.
// Phase 1: matrix 214 rows 222 cols
[2025-05-29 19:27:53] [INFO ] Computed 41 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:27:53] [INFO ] Implicit Places using invariants in 174 ms returned []
[2025-05-29 19:27:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:27:54] [INFO ] Implicit Places using invariants and state equation in 450 ms returned [20, 21]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 626 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 220/259 places, 214/252 transitions.
Applied a total of 0 rules in 3 ms. Remains 220 /220 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 637 ms. Remains : 220/259 places, 214/252 transitions.
[2025-05-29 19:27:54] [INFO ] Flatten gal took : 6 ms
[2025-05-29 19:27:54] [INFO ] Flatten gal took : 6 ms
[2025-05-29 19:27:54] [INFO ] Input system was already deterministic with 214 transitions.
[2025-05-29 19:27:54] [INFO ] Flatten gal took : 11 ms
[2025-05-29 19:27:54] [INFO ] Flatten gal took : 6 ms
[2025-05-29 19:27:54] [INFO ] Time to serialize gal into /tmp/CTLFireability16068483154480422968.gal : 2 ms
[2025-05-29 19:27:54] [INFO ] Time to serialize properties into /tmp/CTLFireability2562462393958554524.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16068483154480422968.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2562462393958554524.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
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.14358e+11,3.76728,87008,2,37514,5,328481,6,0,1095,358478,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-29 19:28:24] [INFO ] Flatten gal took : 7 ms
[2025-05-29 19:28:24] [INFO ] Applying decomposition
[2025-05-29 19:28:24] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15471142288727266292.txt' '-o' '/tmp/graph15471142288727266292.bin' '-w' '/tmp/graph15471142288727266292.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15471142288727266292.bin' '-l' '-1' '-v' '-w' '/tmp/graph15471142288727266292.weights' '-q' '0' '-e' '0.001'
[2025-05-29 19:28:24] [INFO ] Decomposing Gal with order
[2025-05-29 19:28:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 19:28:24] [INFO ] Removed a total of 210 redundant transitions.
[2025-05-29 19:28:24] [INFO ] Flatten gal took : 17 ms
[2025-05-29 19:28:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-05-29 19:28:24] [INFO ] Time to serialize gal into /tmp/CTLFireability17128333314286713650.gal : 4 ms
[2025-05-29 19:28:24] [INFO ] Time to serialize properties into /tmp/CTLFireability18336395761049718626.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17128333314286713650.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18336395761049718626.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
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.14358e+11,1.20895,33512,5091,46,64898,399,774,72005,54,1035,0


Converting to forward existential form...Done !
original formula: AX(EF(AG(E(((i1.i1.u38.p118==1)||(i5.i1.u53.p174==1)) U ((i5.i1.u62.p235==1)||((i5.i2.u79.p283==1)&&(i5.i2.u81.p286==1)))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(E(TRUE U !(E(((i1.i1.u38.p118==1)||(i5.i1.u53.p174==1)) U ((i5.i1.u62.p235==1)||((i5.i...208
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t6, t7, t8, t9, t16, t91, t113, t121, t197, t198, i0.i0.u15.t112, i1.i0.u33.t...530
(forward)formula 0,0,4.50634,127592,1,0,270400,399,4269,340044,240,1218,909577
FORMULA BusinessProcesses-PT-04-CTLFireability-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 252/252 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 236 transition count 229
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 236 transition count 229
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 236 transition count 228
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 55 place count 228 transition count 220
Iterating global reduction 1 with 8 rules applied. Total rules applied 63 place count 228 transition count 220
Applied a total of 63 rules in 9 ms. Remains 228 /259 variables (removed 31) and now considering 220/252 (removed 32) transitions.
// Phase 1: matrix 220 rows 228 cols
[2025-05-29 19:28:29] [INFO ] Computed 41 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:28:29] [INFO ] Implicit Places using invariants in 192 ms returned []
[2025-05-29 19:28:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:28:29] [INFO ] Implicit Places using invariants and state equation in 549 ms returned [20, 22]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 746 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 226/259 places, 220/252 transitions.
Applied a total of 0 rules in 4 ms. Remains 226 /226 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 759 ms. Remains : 226/259 places, 220/252 transitions.
[2025-05-29 19:28:29] [INFO ] Flatten gal took : 9 ms
[2025-05-29 19:28:29] [INFO ] Flatten gal took : 11 ms
[2025-05-29 19:28:29] [INFO ] Input system was already deterministic with 220 transitions.
[2025-05-29 19:28:29] [INFO ] Flatten gal took : 10 ms
[2025-05-29 19:28:29] [INFO ] Flatten gal took : 10 ms
[2025-05-29 19:28:30] [INFO ] Time to serialize gal into /tmp/CTLFireability4909779191513307198.gal : 2 ms
[2025-05-29 19:28:30] [INFO ] Time to serialize properties into /tmp/CTLFireability6417604773932457301.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4909779191513307198.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6417604773932457301.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
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.37029e+11,6.08798,132668,2,49113,5,468130,6,0,1125,576147,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-29 19:29:00] [INFO ] Flatten gal took : 7 ms
[2025-05-29 19:29:00] [INFO ] Applying decomposition
[2025-05-29 19:29:00] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5885842197201096895.txt' '-o' '/tmp/graph5885842197201096895.bin' '-w' '/tmp/graph5885842197201096895.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5885842197201096895.bin' '-l' '-1' '-v' '-w' '/tmp/graph5885842197201096895.weights' '-q' '0' '-e' '0.001'
[2025-05-29 19:29:00] [INFO ] Decomposing Gal with order
[2025-05-29 19:29:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 19:29:00] [INFO ] Removed a total of 207 redundant transitions.
[2025-05-29 19:29:00] [INFO ] Flatten gal took : 17 ms
[2025-05-29 19:29:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 5 ms.
[2025-05-29 19:29:00] [INFO ] Time to serialize gal into /tmp/CTLFireability14777808562333790458.gal : 4 ms
[2025-05-29 19:29:00] [INFO ] Time to serialize properties into /tmp/CTLFireability7582345529253319921.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14777808562333790458.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7582345529253319921.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
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.37029e+11,0.934139,21396,2665,51,35408,424,764,57091,58,1172,0


Converting to forward existential form...Done !
original formula: ((!(E(!(AX((i10.u7.p23==1))) U EX((i8.i3.u79.p275==1)))) + EX(AG((i3.i1.u16.p46!=1)))) * ((EF((((i9.u61.p202==1)||(i4.i1.u1.p2==1)) * EG(...416
=> equivalent forward existential formula: ([(EY(FwdU((Init * !(EX(!(E(TRUE U !((i3.i1.u16.p46!=1))))))),!(!(EX(!((i10.u7.p23==1))))))) * (i8.i3.u79.p275==...686
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t6, t7, t8, t9, t93, t126, t204, i0.u58.t47, i1.u37.t88, i2.u5.t136, i3.t118,...601
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 an 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 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 252/252 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 233 transition count 226
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 233 transition count 226
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 53 place count 233 transition count 225
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 63 place count 223 transition count 215
Iterating global reduction 1 with 10 rules applied. Total rules applied 73 place count 223 transition count 215
Applied a total of 73 rules in 7 ms. Remains 223 /259 variables (removed 36) and now considering 215/252 (removed 37) transitions.
// Phase 1: matrix 215 rows 223 cols
[2025-05-29 19:29:30] [INFO ] Computed 41 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:29:30] [INFO ] Implicit Places using invariants in 197 ms returned []
[2025-05-29 19:29:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:29:30] [INFO ] Implicit Places using invariants and state equation in 444 ms returned [20, 21]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 643 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 221/259 places, 215/252 transitions.
Applied a total of 0 rules in 4 ms. Remains 221 /221 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 655 ms. Remains : 221/259 places, 215/252 transitions.
[2025-05-29 19:29:30] [INFO ] Flatten gal took : 10 ms
[2025-05-29 19:29:30] [INFO ] Flatten gal took : 9 ms
[2025-05-29 19:29:30] [INFO ] Input system was already deterministic with 215 transitions.
[2025-05-29 19:29:30] [INFO ] Flatten gal took : 9 ms
[2025-05-29 19:29:30] [INFO ] Flatten gal took : 10 ms
[2025-05-29 19:29:30] [INFO ] Time to serialize gal into /tmp/CTLFireability8488499928059057390.gal : 2 ms
[2025-05-29 19:29:30] [INFO ] Time to serialize properties into /tmp/CTLFireability533094794368528309.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8488499928059057390.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability533094794368528309.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
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.14371e+11,6.58552,130596,2,43753,5,451018,6,0,1100,536727,0


Converting to forward existential form...Done !
original formula: EF(((p232==1) + (AX((EX((p167==0)) * (p50==1))) * E(((p228==1)||(((p55==1)&&(p185==1))&&(p253==1))) U !(((((p94==1)&&(p181==1))&&(p240==1...174
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * (p232==1))] != FALSE + [(FwdU((FwdU(Init,TRUE) * !(EX(!((EX((p167==0)) * (p50==1)))))),((p2...264
(forward)formula 0,1,6.59536,130596,1,0,7,451018,8,1,1103,536727,1
FORMULA BusinessProcesses-PT-04-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 252/252 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 230 transition count 223
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 230 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 59 place count 230 transition count 222
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 70 place count 219 transition count 211
Iterating global reduction 1 with 11 rules applied. Total rules applied 81 place count 219 transition count 211
Applied a total of 81 rules in 8 ms. Remains 219 /259 variables (removed 40) and now considering 211/252 (removed 41) transitions.
// Phase 1: matrix 211 rows 219 cols
[2025-05-29 19:29:37] [INFO ] Computed 41 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:29:37] [INFO ] Implicit Places using invariants in 213 ms returned []
[2025-05-29 19:29:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:29:38] [INFO ] Implicit Places using invariants and state equation in 513 ms returned [20, 21]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 729 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 217/259 places, 211/252 transitions.
Applied a total of 0 rules in 3 ms. Remains 217 /217 variables (removed 0) and now considering 211/211 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 741 ms. Remains : 217/259 places, 211/252 transitions.
[2025-05-29 19:29:38] [INFO ] Flatten gal took : 7 ms
[2025-05-29 19:29:38] [INFO ] Flatten gal took : 7 ms
[2025-05-29 19:29:38] [INFO ] Input system was already deterministic with 211 transitions.
[2025-05-29 19:29:38] [INFO ] Flatten gal took : 7 ms
[2025-05-29 19:29:38] [INFO ] Flatten gal took : 7 ms
[2025-05-29 19:29:38] [INFO ] Time to serialize gal into /tmp/CTLFireability768960757130430974.gal : 2 ms
[2025-05-29 19:29:38] [INFO ] Time to serialize properties into /tmp/CTLFireability3909294924702265977.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability768960757130430974.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3909294924702265977.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
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.12622e+11,8.58689,169976,2,46126,5,567554,6,0,1080,683268,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-29 19:30:08] [INFO ] Flatten gal took : 5 ms
[2025-05-29 19:30:08] [INFO ] Applying decomposition
[2025-05-29 19:30:08] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9079007502914535750.txt' '-o' '/tmp/graph9079007502914535750.bin' '-w' '/tmp/graph9079007502914535750.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9079007502914535750.bin' '-l' '-1' '-v' '-w' '/tmp/graph9079007502914535750.weights' '-q' '0' '-e' '0.001'
[2025-05-29 19:30:08] [INFO ] Decomposing Gal with order
[2025-05-29 19:30:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 19:30:08] [INFO ] Removed a total of 212 redundant transitions.
[2025-05-29 19:30:08] [INFO ] Flatten gal took : 15 ms
[2025-05-29 19:30:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2025-05-29 19:30:08] [INFO ] Time to serialize gal into /tmp/CTLFireability7166294639843621298.gal : 5 ms
[2025-05-29 19:30:08] [INFO ] Time to serialize properties into /tmp/CTLFireability10378126362882894926.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7166294639843621298.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10378126362882894926.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
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.12622e+11,0.447582,14320,1951,53,21051,405,756,36471,63,1031,0


Converting to forward existential form...Done !
original formula: EF(EG(AX((i5.i0.u31.p102==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EX(!((i5.i0.u31.p102==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t6, t7, t8, t9, t88, t110, t118, t194, i0.t5, i1.u4.t127, i2.t117, i3.u14.t109, i...522
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
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
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 0,1,1.45951,48112,1,0,97966,465,3706,170768,270,1534,264380
FORMULA BusinessProcesses-PT-04-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 252/252 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 231 transition count 224
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 231 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 57 place count 231 transition count 223
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 67 place count 221 transition count 213
Iterating global reduction 1 with 10 rules applied. Total rules applied 77 place count 221 transition count 213
Applied a total of 77 rules in 11 ms. Remains 221 /259 variables (removed 38) and now considering 213/252 (removed 39) transitions.
// Phase 1: matrix 213 rows 221 cols
[2025-05-29 19:30:09] [INFO ] Computed 41 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:30:10] [INFO ] Implicit Places using invariants in 189 ms returned []
[2025-05-29 19:30:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:30:10] [INFO ] Implicit Places using invariants and state equation in 668 ms returned [20, 21]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 859 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 219/259 places, 213/252 transitions.
Applied a total of 0 rules in 4 ms. Remains 219 /219 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 874 ms. Remains : 219/259 places, 213/252 transitions.
[2025-05-29 19:30:10] [INFO ] Flatten gal took : 9 ms
[2025-05-29 19:30:10] [INFO ] Flatten gal took : 9 ms
[2025-05-29 19:30:10] [INFO ] Input system was already deterministic with 213 transitions.
[2025-05-29 19:30:10] [INFO ] Flatten gal took : 9 ms
[2025-05-29 19:30:10] [INFO ] Flatten gal took : 9 ms
[2025-05-29 19:30:10] [INFO ] Time to serialize gal into /tmp/CTLFireability18364219879857401249.gal : 1 ms
[2025-05-29 19:30:10] [INFO ] Time to serialize properties into /tmp/CTLFireability16604578518017914549.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18364219879857401249.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16604578518017914549.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
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.12941e+11,5.10561,108148,2,32614,5,392419,6,0,1090,423826,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-29 19:30:40] [INFO ] Flatten gal took : 6 ms
[2025-05-29 19:30:40] [INFO ] Applying decomposition
[2025-05-29 19:30:40] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7687742159835561053.txt' '-o' '/tmp/graph7687742159835561053.bin' '-w' '/tmp/graph7687742159835561053.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7687742159835561053.bin' '-l' '-1' '-v' '-w' '/tmp/graph7687742159835561053.weights' '-q' '0' '-e' '0.001'
[2025-05-29 19:30:40] [INFO ] Decomposing Gal with order
[2025-05-29 19:30:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 19:30:40] [INFO ] Removed a total of 211 redundant transitions.
[2025-05-29 19:30:41] [INFO ] Flatten gal took : 15 ms
[2025-05-29 19:30:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2025-05-29 19:30:41] [INFO ] Time to serialize gal into /tmp/CTLFireability5393000051793442655.gal : 3 ms
[2025-05-29 19:30:41] [INFO ] Time to serialize properties into /tmp/CTLFireability7162746777163904605.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5393000051793442655.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7162746777163904605.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
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.12941e+11,0.941866,24224,3136,63,44093,498,733,57845,64,1341,0


Converting to forward existential form...Done !
original formula: AG((((i9.u54.p206==1) + AG((((u33.p106==0)||(i6.u49.p166==0))||((i0.u60.p245==0)||(i12.i1.u19.p61==1))))) + AX((i11.i0.u16.p65==0))))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * !(((i9.u54.p206==1) + !(E(TRUE U !((((u33.p106==0)||(i6.u49.p166==0))||((i0.u60.p245==0)...220
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t7, t8, t9, t89, t112, t120, t197, i0.u14.t111, i0.u32.t88, i1.u4.t129, i2.t1...536
(forward)formula 0,1,3.17837,86304,1,0,185243,499,4158,268251,290,1689,440624
FORMULA BusinessProcesses-PT-04-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

[2025-05-29 19:30:44] [INFO ] Flatten gal took : 6 ms
[2025-05-29 19:30:44] [INFO ] Flatten gal took : 6 ms
[2025-05-29 19:30:44] [INFO ] Applying decomposition
[2025-05-29 19:30:44] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16139598658351712815.txt' '-o' '/tmp/graph16139598658351712815.bin' '-w' '/tmp/graph16139598658351712815.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16139598658351712815.bin' '-l' '-1' '-v' '-w' '/tmp/graph16139598658351712815.weights' '-q' '0' '-e' '0.001'
[2025-05-29 19:30:44] [INFO ] Decomposing Gal with order
[2025-05-29 19:30:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 19:30:44] [INFO ] Removed a total of 213 redundant transitions.
[2025-05-29 19:30:44] [INFO ] Flatten gal took : 17 ms
[2025-05-29 19:30:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-05-29 19:30:44] [INFO ] Time to serialize gal into /tmp/CTLFireability7514712355321451112.gal : 4 ms
[2025-05-29 19:30:44] [INFO ] Time to serialize properties into /tmp/CTLFireability10207999345171744517.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7514712355321451112.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10207999345171744517.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 3 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.76784e+11,1.50416,36464,3610,62,59961,494,828,110115,82,1621,0


Converting to forward existential form...Done !
original formula: AX((EG((i3.i0.u21.p62==0)) * !(E(EF(((i2.i0.u5.p14==1)||(i1.i0.u7.p19==1))) U AX(E((i3.i0.u79.p242==1) U (((i4.i0.u19.p49==1)&&(i6.u54.p1...188
=> equivalent forward existential formula: ([(EY(Init) * !(EG((i3.i0.u21.p62==0))))] = FALSE * [(FwdU(EY(Init),E(TRUE U ((i2.i0.u5.p14==1)||(i1.i0.u7.p19==...268
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t7, t21, t23, t25, t117, t156, i0.u38.t116, i1.i0.t159, i1.i0.t161, i1.i0.u6.t165, i1...822
(forward)formula 0,0,35.3481,640664,1,0,1.33142e+06,800,4730,1.73087e+06,396,2718,2001094
FORMULA BusinessProcesses-PT-04-CTLFireability-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF(((((i1.i1.u10.p30==1)&&(i6.u54.p151==1))&&((i1.i1.u71.p257==1)&&(i9.i0.u62.p174==1))) * ((EX(E((i12.i0.u66.p244==1) U (i10.i0.u0.p1==1...505
=> equivalent forward existential formula: (([(EY(((FwdU(Init,TRUE) * (((i1.i1.u10.p30==1)&&(i6.u54.p151==1))&&((i1.i1.u71.p257==1)&&(i9.i0.u62.p174==1))))...1642
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 an 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 an SCC at level 5
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
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
(forward)formula 1,0,92.4583,1445660,1,0,2.65476e+06,968,5123,4.26572e+06,423,3258,3398703
FORMULA BusinessProcesses-PT-04-CTLFireability-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: ((!(E(!(AX((i1.i0.u8.p23==1))) U EX((i9.i1.u91.p275==1)))) + EX(AG((i2.i2.u18.p46!=1)))) * ((EF((((i11.u69.p202==1)||(i10.i0.u0.p2==1)) *...424
=> equivalent forward existential formula: ([(EY(FwdU((Init * !(EX(!(E(TRUE U !((i2.i2.u18.p46!=1))))))),!(!(EX(!((i1.i0.u8.p23==1))))))) * (i9.i1.u91.p275...698
(forward)formula 2,0,196.115,2197996,1,0,4.09709e+06,994,1625,6.3303e+06,169,3432,1966498
FORMULA BusinessProcesses-PT-04-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Total runtime 649213 ms.

BK_STOP 1748547241035

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-04"
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-5832"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-04, 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 r030-smll-174853813200026"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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