Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r048-tajo-171620399600490.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is BusinessProcesses-PT-06, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399600490
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 9.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 109K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 16:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 179K Apr 11 16:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 11 16:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 16:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 85K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716333862180

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-06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-21 23:24:23] [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]
[2024-05-21 23:24:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:24:23] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2024-05-21 23:24:23] [INFO ] Transformed 376 places.
[2024-05-21 23:24:23] [INFO ] Transformed 297 transitions.
[2024-05-21 23:24:23] [INFO ] Found NUPN structural information;
[2024-05-21 23:24:23] [INFO ] Parsed PT model containing 376 places and 297 transitions and 830 arcs in 195 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 1 transitions.
Support contains 94 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 296/296 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 373 transition count 296
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 27 place count 348 transition count 271
Iterating global reduction 1 with 25 rules applied. Total rules applied 52 place count 348 transition count 271
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 61 place count 339 transition count 262
Iterating global reduction 1 with 9 rules applied. Total rules applied 70 place count 339 transition count 262
Applied a total of 70 rules in 76 ms. Remains 339 /375 variables (removed 36) and now considering 262/296 (removed 34) transitions.
// Phase 1: matrix 262 rows 339 cols
[2024-05-21 23:24:24] [INFO ] Computed 79 invariants in 26 ms
[2024-05-21 23:24:24] [INFO ] Implicit Places using invariants in 510 ms returned []
[2024-05-21 23:24:24] [INFO ] Invariant cache hit.
[2024-05-21 23:24:24] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 888 ms to find 0 implicit places.
Running 261 sub problems to find dead transitions.
[2024-05-21 23:24:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/338 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/338 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 1/339 variables, 41/72 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/339 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-21 23:24:29] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 27 ms to minimize.
[2024-05-21 23:24:29] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 3 ms to minimize.
[2024-05-21 23:24:30] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:24:30] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:24:30] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:24:30] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:24:30] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:24:30] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:24:30] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:24:30] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:24:30] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:24:30] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-05-21 23:24:30] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:24:30] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:24:31] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:24:31] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2024-05-21 23:24:31] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:24:31] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 0 ms to minimize.
[2024-05-21 23:24:31] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:24:31] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-21 23:24:32] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 3 ms to minimize.
[2024-05-21 23:24:32] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:24:32] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:24:32] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:24:32] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:24:32] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:24:32] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:24:32] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:24:32] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:24:32] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:24:32] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:24:33] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:24:33] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:24:33] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 3 ms to minimize.
[2024-05-21 23:24:33] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:24:33] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:24:33] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:24:33] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:24:33] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:24:33] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-21 23:24:34] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:24:34] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:24:34] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:24:34] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:24:34] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:24:35] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:24:35] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:24:35] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:24:35] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:24:35] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:24:35] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 4 ms to minimize.
[2024-05-21 23:24:35] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:24:35] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 3 ms to minimize.
[2024-05-21 23:24:35] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 3 ms to minimize.
[2024-05-21 23:24:36] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 3 ms to minimize.
[2024-05-21 23:24:36] [INFO ] Deduced a trap composed of 28 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:24:36] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:24:36] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:24:36] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:24:36] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-21 23:24:39] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 1 ms to minimize.
[2024-05-21 23:24:39] [INFO ] Deduced a trap composed of 18 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:24:39] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:24:39] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:24:39] [INFO ] Deduced a trap composed of 17 places in 161 ms of which 2 ms to minimize.
[2024-05-21 23:24:40] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:24:40] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:24:40] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:24:40] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:24:40] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:24:40] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 11/150 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-21 23:24:42] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:24:42] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:24:42] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 3/153 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-21 23:24:43] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:24:44] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:24:44] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:24:44] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:24:44] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:24:44] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:24:44] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:24:44] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 1 ms to minimize.
[2024-05-21 23:24:45] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 10 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 9/162 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-21 23:24:47] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-21 23:24:47] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:24:47] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:24:47] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:24:47] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/339 variables, 5/167 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-21 23:24:49] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:24:49] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:24:49] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:24:49] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:24:50] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:24:50] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:24:50] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:24:50] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:24:50] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:24:50] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/339 variables, 10/177 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-21 23:24:51] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
[2024-05-21 23:24:52] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-05-21 23:24:52] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-05-21 23:24:52] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:24:52] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 1 ms to minimize.
[2024-05-21 23:24:52] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-05-21 23:24:53] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:24:53] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/339 variables, 8/185 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 339/601 variables, and 185 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30065 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 0/339 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 106/106 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/338 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/338 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 1/339 variables, 41/72 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/339 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 106/185 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-21 23:24:58] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:24:58] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:24:58] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 3/188 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-21 23:25:00] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-21 23:25:01] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:25:01] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
[2024-05-21 23:25:02] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:25:02] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:25:02] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:25:02] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:25:03] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 7/196 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (OVERLAPS) 262/601 variables, 339/535 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/601 variables, 261/796 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-21 23:25:08] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:25:09] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:25:09] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-21 23:25:09] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:25:10] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:25:10] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:25:10] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:25:10] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 1 ms to minimize.
[2024-05-21 23:25:10] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:25:13] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:25:13] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:25:14] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:25:14] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/601 variables, 13/809 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-21 23:25:21] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:25:21] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:25:21] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:25:22] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:25:22] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:25:24] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:25:25] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 601/601 variables, and 816 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 339/339 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 137/137 constraints]
After SMT, in 60222ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 60252ms
Starting structural reductions in LTL mode, iteration 1 : 339/375 places, 262/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61250 ms. Remains : 339/375 places, 262/296 transitions.
Support contains 94 out of 339 places after structural reductions.
[2024-05-21 23:25:25] [INFO ] Flatten gal took : 71 ms
[2024-05-21 23:25:25] [INFO ] Flatten gal took : 19 ms
[2024-05-21 23:25:25] [INFO ] Input system was already deterministic with 262 transitions.
RANDOM walk for 40000 steps (395 resets) in 2143 ms. (18 steps per ms) remains 9/69 properties
BEST_FIRST walk for 40001 steps (104 resets) in 260 ms. (153 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (69 resets) in 198 ms. (201 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40003 steps (72 resets) in 183 ms. (217 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (74 resets) in 153 ms. (259 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (89 resets) in 131 ms. (303 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (71 resets) in 161 ms. (246 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (69 resets) in 94 ms. (421 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (67 resets) in 133 ms. (298 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (60 resets) in 270 ms. (147 steps per ms) remains 8/8 properties
[2024-05-21 23:25:26] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 125/145 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 86/231 variables, 18/41 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 83/314 variables, 38/79 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 245/559 variables, 314/393 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/559 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 39/598 variables, 23/416 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/598 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 3/601 variables, 2/418 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/601 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 0/601 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 601/601 variables, and 418 constraints, problems are : Problem set: 0 solved, 8 unsolved in 787 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 339/339 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AtomicPropp44 is UNSAT
At refinement iteration 1 (OVERLAPS) 125/145 variables, 23/23 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-21 23:25:27] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 1/24 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 86/231 variables, 18/42 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-21 23:25:28] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:25:28] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:25:28] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:25:28] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 2 ms to minimize.
[2024-05-21 23:25:28] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:25:28] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:25:28] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:25:28] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 0 ms to minimize.
[2024-05-21 23:25:28] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:25:28] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:25:28] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:25:28] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 12/54 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/54 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 83/314 variables, 38/92 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-21 23:25:28] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:25:28] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 1 ms to minimize.
[2024-05-21 23:25:28] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/314 variables, 3/95 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-21 23:25:29] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 2 ms to minimize.
[2024-05-21 23:25:29] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:25:29] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 3/98 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-21 23:25:29] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:25:29] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:25:29] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 3/101 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/314 variables, 0/101 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 245/559 variables, 314/415 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/559 variables, 5/420 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-21 23:25:30] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 1 ms to minimize.
[2024-05-21 23:25:30] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/559 variables, 2/422 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-21 23:25:30] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:25:30] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:25:30] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:25:30] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:25:30] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:25:30] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:25:30] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/559 variables, 7/429 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/559 variables, 0/429 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Problem AtomicPropp5 is UNSAT
At refinement iteration 17 (OVERLAPS) 39/598 variables, 23/452 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/598 variables, 2/454 constraints. Problems are: Problem set: 2 solved, 6 unsolved
[2024-05-21 23:25:31] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:25:31] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:25:31] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:25:31] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:25:31] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/598 variables, 5/459 constraints. Problems are: Problem set: 2 solved, 6 unsolved
[2024-05-21 23:25:31] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:25:31] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/598 variables, 2/461 constraints. Problems are: Problem set: 2 solved, 6 unsolved
[2024-05-21 23:25:31] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/598 variables, 1/462 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/598 variables, 0/462 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Problem AtomicPropp58 is UNSAT
At refinement iteration 23 (OVERLAPS) 3/601 variables, 2/464 constraints. Problems are: Problem set: 3 solved, 5 unsolved
[2024-05-21 23:25:32] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:25:32] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/601 variables, 2/466 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/601 variables, 0/466 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 26 (OVERLAPS) 0/601 variables, 0/466 constraints. Problems are: Problem set: 3 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 601/601 variables, and 466 constraints, problems are : Problem set: 3 solved, 5 unsolved in 4882 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 339/339 constraints, PredecessorRefiner: 7/8 constraints, Known Traps: 41/41 constraints]
After SMT, in 5691ms problems are : Problem set: 3 solved, 5 unsolved
Parikh walk visited 1 properties in 1764 ms.
Support contains 6 out of 339 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 339/339 places, 262/262 transitions.
Graph (trivial) has 154 edges and 339 vertex of which 7 / 339 are part of one of the 1 SCC in 3 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 645 edges and 333 vertex of which 332 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 41 place count 332 transition count 213
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 80 place count 293 transition count 213
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 80 place count 293 transition count 148
Deduced a syphon composed of 65 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 139 rules applied. Total rules applied 219 place count 219 transition count 148
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 239 place count 199 transition count 128
Iterating global reduction 2 with 20 rules applied. Total rules applied 259 place count 199 transition count 128
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 162 rules applied. Total rules applied 421 place count 114 transition count 51
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 422 place count 114 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 423 place count 113 transition count 50
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 424 place count 113 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 425 place count 112 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 426 place count 111 transition count 49
Applied a total of 426 rules in 73 ms. Remains 111 /339 variables (removed 228) and now considering 49/262 (removed 213) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 111/339 places, 49/262 transitions.
RANDOM walk for 189 steps (0 resets) in 8 ms. (21 steps per ms) remains 0/4 properties
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
FORMULA BusinessProcesses-PT-06-CTLFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 23:25:34] [INFO ] Flatten gal took : 14 ms
[2024-05-21 23:25:34] [INFO ] Flatten gal took : 14 ms
[2024-05-21 23:25:34] [INFO ] Input system was already deterministic with 262 transitions.
Computed a total of 331 stabilizing places and 252 stable transitions
Graph (complete) has 653 edges and 339 vertex of which 338 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Starting structural reductions in LTL mode, iteration 0 : 339/339 places, 262/262 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 317 transition count 240
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 317 transition count 240
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 51 place count 310 transition count 233
Iterating global reduction 0 with 7 rules applied. Total rules applied 58 place count 310 transition count 233
Applied a total of 58 rules in 25 ms. Remains 310 /339 variables (removed 29) and now considering 233/262 (removed 29) transitions.
// Phase 1: matrix 233 rows 310 cols
[2024-05-21 23:25:34] [INFO ] Computed 79 invariants in 7 ms
[2024-05-21 23:25:34] [INFO ] Implicit Places using invariants in 334 ms returned []
[2024-05-21 23:25:34] [INFO ] Invariant cache hit.
[2024-05-21 23:25:35] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 595 ms to find 0 implicit places.
Running 232 sub problems to find dead transitions.
[2024-05-21 23:25:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/309 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (OVERLAPS) 1/310 variables, 34/65 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:25:38] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:25:38] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:25:38] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:25:38] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:25:39] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:25:39] [INFO ] Deduced a trap composed of 18 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:25:39] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:25:39] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:25:39] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:25:39] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:25:39] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:25:39] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:25:39] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:25:40] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:25:40] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-21 23:25:40] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
[2024-05-21 23:25:40] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:25:40] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:25:40] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 2 ms to minimize.
[2024-05-21 23:25:40] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:25:40] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:25:40] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:25:41] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:25:41] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:25:41] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:25:41] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:25:41] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:25:41] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:25:41] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:25:41] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:25:41] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:25:42] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:25:42] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:25:42] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 14/113 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:25:43] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:25:43] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:25:43] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:25:43] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:25:44] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:25:44] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:25:44] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:25:44] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:25:44] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:25:44] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:25:45] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:25:45] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 12/125 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:25:46] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:25:47] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:25:47] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:25:47] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-05-21 23:25:47] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 0 ms to minimize.
[2024-05-21 23:25:47] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-05-21 23:25:47] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-21 23:25:47] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 0 ms to minimize.
[2024-05-21 23:25:47] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 0 ms to minimize.
[2024-05-21 23:25:47] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:25:47] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:25:47] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 2 ms to minimize.
[2024-05-21 23:25:47] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:25:47] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 0 ms to minimize.
[2024-05-21 23:25:47] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:25:47] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 0 ms to minimize.
[2024-05-21 23:25:47] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:25:48] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:25:48] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:25:48] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:25:48] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-21 23:25:48] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:25:49] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:25:49] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 4/149 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:25:50] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/310 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 11 (OVERLAPS) 233/543 variables, 310/460 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:25:55] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
[2024-05-21 23:25:55] [INFO ] Deduced a trap composed of 22 places in 20 ms of which 1 ms to minimize.
[2024-05-21 23:25:55] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:25:55] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2024-05-21 23:25:55] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:25:55] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 3 ms to minimize.
[2024-05-21 23:25:56] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 8 ms to minimize.
[2024-05-21 23:25:56] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:25:56] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:25:56] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:25:56] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:25:56] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 0 ms to minimize.
[2024-05-21 23:25:56] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 0 ms to minimize.
[2024-05-21 23:25:56] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:25:56] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/543 variables, 15/475 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/543 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:26:01] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 2 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/543 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:26:03] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 15 (INCLUDED_ONLY) 0/543 variables, 1/477 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 543/543 variables, and 477 constraints, problems are : Problem set: 0 solved, 232 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 88/88 constraints]
Escalating to Integer solving :Problem set: 0 solved, 232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/309 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (OVERLAPS) 1/310 variables, 34/65 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:26:07] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:26:07] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 2/169 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:26:08] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:26:08] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:26:08] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:26:09] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:26:09] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 5/174 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:26:10] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 9 (OVERLAPS) 233/543 variables, 310/485 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/543 variables, 232/717 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:26:16] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:26:16] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:26:16] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:26:17] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-21 23:26:17] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/543 variables, 5/722 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:26:24] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/543 variables, 1/723 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 1)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 543/543 variables, and 723 constraints, problems are : Problem set: 0 solved, 232 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 102/102 constraints]
After SMT, in 60085ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 60088ms
Starting structural reductions in LTL mode, iteration 1 : 310/339 places, 233/262 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60709 ms. Remains : 310/339 places, 233/262 transitions.
[2024-05-21 23:26:35] [INFO ] Flatten gal took : 23 ms
[2024-05-21 23:26:35] [INFO ] Flatten gal took : 21 ms
[2024-05-21 23:26:35] [INFO ] Input system was already deterministic with 233 transitions.
[2024-05-21 23:26:35] [INFO ] Flatten gal took : 13 ms
[2024-05-21 23:26:35] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:26:35] [INFO ] Time to serialize gal into /tmp/CTLFireability13333023029721974779.gal : 7 ms
[2024-05-21 23:26:35] [INFO ] Time to serialize properties into /tmp/CTLFireability13834896412618084789.ctl : 15 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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13333023029721974779.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13834896412618084789.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:27:05] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:27:05] [INFO ] Applying decomposition
[2024-05-21 23:27:05] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16231617545641516663.txt' '-o' '/tmp/graph16231617545641516663.bin' '-w' '/tmp/graph16231617545641516663.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16231617545641516663.bin' '-l' '-1' '-v' '-w' '/tmp/graph16231617545641516663.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:27:05] [INFO ] Decomposing Gal with order
[2024-05-21 23:27:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:27:05] [INFO ] Removed a total of 32 redundant transitions.
[2024-05-21 23:27:05] [INFO ] Flatten gal took : 111 ms
[2024-05-21 23:27:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 18 ms.
[2024-05-21 23:27:05] [INFO ] Time to serialize gal into /tmp/CTLFireability13655513291182896209.gal : 20 ms
[2024-05-21 23:27:05] [INFO ] Time to serialize properties into /tmp/CTLFireability6339984966847578177.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13655513291182896209.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6339984966847578177.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.64213e+18,11.4744,343412,105234,34,722626,678,654,942317,47,1536,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 339/339 places, 262/262 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 317 transition count 240
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 317 transition count 240
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 51 place count 310 transition count 233
Iterating global reduction 0 with 7 rules applied. Total rules applied 58 place count 310 transition count 233
Applied a total of 58 rules in 39 ms. Remains 310 /339 variables (removed 29) and now considering 233/262 (removed 29) transitions.
// Phase 1: matrix 233 rows 310 cols
[2024-05-21 23:27:36] [INFO ] Computed 79 invariants in 12 ms
[2024-05-21 23:27:36] [INFO ] Implicit Places using invariants in 224 ms returned []
[2024-05-21 23:27:36] [INFO ] Invariant cache hit.
[2024-05-21 23:27:36] [INFO ] Implicit Places using invariants and state equation in 414 ms returned []
Implicit Place search using SMT with State Equation took 641 ms to find 0 implicit places.
Running 232 sub problems to find dead transitions.
[2024-05-21 23:27:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/309 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (OVERLAPS) 1/310 variables, 34/65 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:27:40] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:27:40] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:27:40] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:27:40] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:27:40] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:27:40] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:27:40] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:27:40] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:27:41] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:27:41] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:27:41] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:27:41] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:27:41] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:27:41] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:27:41] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:27:41] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:27:41] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-21 23:27:41] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:27:41] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:27:42] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:27:42] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:27:42] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:27:42] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:27:42] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:27:43] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:27:43] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:27:43] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:27:43] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:27:43] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:27:43] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:27:44] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 0 ms to minimize.
[2024-05-21 23:27:44] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 12/111 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:27:44] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:27:44] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-05-21 23:27:45] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:27:45] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:27:45] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:27:45] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:27:45] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:27:45] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:27:45] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:27:45] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-21 23:27:45] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:27:45] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:27:45] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:27:45] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:27:45] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:27:45] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:27:45] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:27:46] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-05-21 23:27:46] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:27:46] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:27:47] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:27:47] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:27:47] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-21 23:27:47] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:27:47] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:27:47] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:27:47] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-05-21 23:27:48] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:27:48] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 0 ms to minimize.
[2024-05-21 23:27:48] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:27:48] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 11/142 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:27:49] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:27:49] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-21 23:27:49] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:27:49] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:27:49] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:27:49] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 1 ms to minimize.
[2024-05-21 23:27:49] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:27:49] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:27:50] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 9/151 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:27:50] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:27:50] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:27:50] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:27:51] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:27:51] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:27:51] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 6/157 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:27:53] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:27:53] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/310 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/310 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 12 (OVERLAPS) 233/543 variables, 310/469 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:27:56] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-05-21 23:27:57] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/543 variables, 2/471 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/543 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 15 (OVERLAPS) 0/543 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 232 unsolved
No progress, stopping.
After SMT solving in domain Real declared 543/543 variables, and 471 constraints, problems are : Problem set: 0 solved, 232 unsolved in 26115 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 82/82 constraints]
Escalating to Integer solving :Problem set: 0 solved, 232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/309 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (OVERLAPS) 1/310 variables, 34/65 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 82/161 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (OVERLAPS) 233/543 variables, 310/471 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/543 variables, 232/703 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:28:06] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:28:06] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:28:09] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:28:09] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:28:10] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:28:10] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/543 variables, 6/709 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:28:21] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/543 variables, 1/710 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/543 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 543/543 variables, and 710 constraints, problems are : Problem set: 0 solved, 232 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 89/89 constraints]
After SMT, in 56181ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 56188ms
Starting structural reductions in LTL mode, iteration 1 : 310/339 places, 233/262 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56869 ms. Remains : 310/339 places, 233/262 transitions.
[2024-05-21 23:28:32] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:28:32] [INFO ] Flatten gal took : 24 ms
[2024-05-21 23:28:32] [INFO ] Input system was already deterministic with 233 transitions.
[2024-05-21 23:28:32] [INFO ] Flatten gal took : 14 ms
[2024-05-21 23:28:32] [INFO ] Flatten gal took : 13 ms
[2024-05-21 23:28:33] [INFO ] Time to serialize gal into /tmp/CTLFireability17248080031141598172.gal : 4 ms
[2024-05-21 23:28:33] [INFO ] Time to serialize properties into /tmp/CTLFireability5452286433332999794.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17248080031141598172.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5452286433332999794.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:29:03] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:29:03] [INFO ] Applying decomposition
[2024-05-21 23:29:03] [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.202405141337/bin/convert-linux64' '-i' '/tmp/graph8305457004022657504.txt' '-o' '/tmp/graph8305457004022657504.bin' '-w' '/tmp/graph8305457004022657504.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8305457004022657504.bin' '-l' '-1' '-v' '-w' '/tmp/graph8305457004022657504.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:29:03] [INFO ] Decomposing Gal with order
[2024-05-21 23:29:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:29:03] [INFO ] Removed a total of 30 redundant transitions.
[2024-05-21 23:29:03] [INFO ] Flatten gal took : 27 ms
[2024-05-21 23:29:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 14 ms.
[2024-05-21 23:29:03] [INFO ] Time to serialize gal into /tmp/CTLFireability14893607511275993213.gal : 17 ms
[2024-05-21 23:29:03] [INFO ] Time to serialize properties into /tmp/CTLFireability4587717488105551415.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14893607511275993213.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4587717488105551415.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.73222e+18,29.1625,815296,251369,47,1.98562e+06,599,661,1.91539e+06,52,1396,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 339/339 places, 262/262 transitions.
Graph (trivial) has 161 edges and 339 vertex of which 7 / 339 are part of one of the 1 SCC in 2 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 646 edges and 333 vertex of which 332 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 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 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 45 place count 331 transition count 210
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 88 place count 288 transition count 210
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 88 place count 288 transition count 145
Deduced a syphon composed of 65 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 228 place count 213 transition count 145
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 250 place count 191 transition count 123
Iterating global reduction 2 with 22 rules applied. Total rules applied 272 place count 191 transition count 123
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 430 place count 108 transition count 48
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 432 place count 107 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 433 place count 106 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 434 place count 105 transition count 46
Applied a total of 434 rules in 113 ms. Remains 105 /339 variables (removed 234) and now considering 46/262 (removed 216) transitions.
// Phase 1: matrix 46 rows 105 cols
[2024-05-21 23:29:33] [INFO ] Computed 60 invariants in 2 ms
[2024-05-21 23:29:33] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-21 23:29:33] [INFO ] Invariant cache hit.
[2024-05-21 23:29:33] [INFO ] Implicit Places using invariants and state equation in 141 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 12, 14, 16, 18, 20, 22, 24, 33, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 74]
Discarding 39 places :
Implicit Place search using SMT with State Equation took 307 ms to find 39 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 66/339 places, 46/262 transitions.
Graph (complete) has 137 edges and 66 vertex of which 58 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 58 transition count 35
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 48 transition count 35
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 41 place count 35 transition count 28
Applied a total of 41 rules in 2 ms. Remains 35 /66 variables (removed 31) and now considering 28/46 (removed 18) transitions.
// Phase 1: matrix 28 rows 35 cols
[2024-05-21 23:29:33] [INFO ] Computed 8 invariants in 0 ms
[2024-05-21 23:29:33] [INFO ] Implicit Places using invariants in 36 ms returned [34]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 36 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 34/339 places, 28/262 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 34 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 33 transition count 27
Applied a total of 2 rules in 3 ms. Remains 33 /34 variables (removed 1) and now considering 27/28 (removed 1) transitions.
// Phase 1: matrix 27 rows 33 cols
[2024-05-21 23:29:33] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 23:29:33] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-21 23:29:33] [INFO ] Invariant cache hit.
[2024-05-21 23:29:33] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 33/339 places, 27/262 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 549 ms. Remains : 33/339 places, 27/262 transitions.
[2024-05-21 23:29:33] [INFO ] Flatten gal took : 1 ms
[2024-05-21 23:29:33] [INFO ] Flatten gal took : 1 ms
[2024-05-21 23:29:33] [INFO ] Input system was already deterministic with 27 transitions.
[2024-05-21 23:29:33] [INFO ] Flatten gal took : 1 ms
[2024-05-21 23:29:33] [INFO ] Flatten gal took : 1 ms
RANDOM walk for 109 steps (41 resets) in 5 ms. (18 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-06-CTLFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-21 23:29:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9109616885997165937.gal : 2 ms
[2024-05-21 23:29:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4837597801751915984.prop : 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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9109616885997165937.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4837597801751915984.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 339/339 places, 262/262 transitions.
Graph (trivial) has 157 edges and 339 vertex of which 7 / 339 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 646 edges and 333 vertex of which 332 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 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 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 331 transition count 211
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 86 place count 289 transition count 211
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 62 Pre rules applied. Total rules applied 86 place count 289 transition count 149
Deduced a syphon composed of 62 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 133 rules applied. Total rules applied 219 place count 218 transition count 149
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 239 place count 198 transition count 129
Iterating global reduction 2 with 20 rules applied. Total rules applied 259 place count 198 transition count 129
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 417 place count 115 transition count 54
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 419 place count 114 transition count 53
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 420 place count 113 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 421 place count 112 transition count 52
Applied a total of 421 rules in 33 ms. Remains 112 /339 variables (removed 227) and now considering 52/262 (removed 210) transitions.
// Phase 1: matrix 52 rows 112 cols
[2024-05-21 23:29:33] [INFO ] Computed 61 invariants in 1 ms
[2024-05-21 23:29:34] [INFO ] Implicit Places using invariants in 217 ms returned [84]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 218 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 111/339 places, 52/262 transitions.
Applied a total of 0 rules in 4 ms. Remains 111 /111 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 256 ms. Remains : 111/339 places, 52/262 transitions.
[2024-05-21 23:29:34] [INFO ] Flatten gal took : 32 ms
[2024-05-21 23:29:34] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:29:34] [INFO ] Input system was already deterministic with 52 transitions.
[2024-05-21 23:29:34] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:29:34] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:29:34] [INFO ] Time to serialize gal into /tmp/CTLFireability3535654940528864898.gal : 1 ms
[2024-05-21 23:29:34] [INFO ] Time to serialize properties into /tmp/CTLFireability5943815574711560105.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3535654940528864898.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5943815574711560105.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,140480,0.636686,31652,2,27994,5,167930,6,0,495,101450,0


Converting to forward existential form...Done !
original formula: E(EF(!((E(((p19==1)||(p171==1)) U EF((p221==1))) * (p156==1)))) U (p369==1))
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U !((E(((p19==1)||(p171==1)) U E(TRUE U (p221==1))) * (p156==1))))) * (p369==1))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t5, t18, t27, t28, t51, Intersection with reachable at each step enabled. (destroyed...191
(forward)formula 0,1,8.07641,249196,1,0,115,1.08339e+06,131,67,3232,797903,141
FORMULA BusinessProcesses-PT-06-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 339/339 places, 262/262 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 319 transition count 242
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 319 transition count 242
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 47 place count 312 transition count 235
Iterating global reduction 0 with 7 rules applied. Total rules applied 54 place count 312 transition count 235
Applied a total of 54 rules in 9 ms. Remains 312 /339 variables (removed 27) and now considering 235/262 (removed 27) transitions.
// Phase 1: matrix 235 rows 312 cols
[2024-05-21 23:29:42] [INFO ] Computed 79 invariants in 2 ms
[2024-05-21 23:29:42] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-21 23:29:42] [INFO ] Invariant cache hit.
[2024-05-21 23:29:42] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
Running 234 sub problems to find dead transitions.
[2024-05-21 23:29:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 40/72 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-21 23:29:46] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:29:46] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:29:46] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:29:46] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:29:46] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:29:46] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:29:46] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:29:46] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 1 ms to minimize.
[2024-05-21 23:29:46] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:29:46] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:29:46] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:29:46] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:29:47] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-21 23:29:47] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-21 23:29:47] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:29:47] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:29:47] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:29:47] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:29:47] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:29:47] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-21 23:29:47] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:29:47] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:29:47] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:29:48] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:29:48] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:29:48] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:29:48] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:29:48] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:29:48] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:29:48] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:29:48] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:29:48] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:29:48] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:29:49] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:29:49] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:29:49] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:29:49] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:29:49] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:29:49] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:29:49] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-21 23:29:50] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:29:50] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:29:50] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:29:50] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:29:50] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:29:50] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:29:50] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 1 ms to minimize.
[2024-05-21 23:29:50] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:29:50] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:29:50] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:29:50] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:29:50] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:29:50] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:29:50] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:29:51] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:29:51] [INFO ] Deduced a trap composed of 20 places in 19 ms of which 1 ms to minimize.
[2024-05-21 23:29:51] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2024-05-21 23:29:51] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 0 ms to minimize.
[2024-05-21 23:29:51] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:29:51] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-21 23:29:53] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:29:53] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 0 ms to minimize.
[2024-05-21 23:29:53] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:29:53] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 4/143 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-21 23:29:54] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
[2024-05-21 23:29:54] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:29:54] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 3/146 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-21 23:29:55] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-21 23:29:55] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-21 23:29:55] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-21 23:29:55] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
[2024-05-21 23:29:56] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:29:56] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:29:56] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 7/153 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-21 23:29:59] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-21 23:30:00] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/312 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/312 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 13 (OVERLAPS) 235/547 variables, 312/467 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-21 23:30:04] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:30:04] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:30:04] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:30:04] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-21 23:30:04] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:30:04] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-21 23:30:04] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 1 ms to minimize.
[2024-05-21 23:30:04] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-05-21 23:30:05] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:30:05] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:30:05] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/547 variables, 11/478 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-21 23:30:07] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:30:07] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:30:07] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:30:07] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 13 ms to minimize.
[2024-05-21 23:30:07] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:30:07] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:30:07] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:30:07] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/547 variables, 8/486 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-21 23:30:10] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/547 variables, 1/487 constraints. Problems are: Problem set: 0 solved, 234 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 547/547 variables, and 487 constraints, problems are : Problem set: 0 solved, 234 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 96/96 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 40/72 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 96/175 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-21 23:30:14] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (OVERLAPS) 235/547 variables, 312/488 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/547 variables, 234/722 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-21 23:30:19] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:30:19] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:30:19] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/547 variables, 3/725 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-21 23:30:27] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:30:27] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:30:28] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/547 variables, 3/728 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-21 23:30:38] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/547 variables, 1/729 constraints. Problems are: Problem set: 0 solved, 234 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 547/547 variables, and 729 constraints, problems are : Problem set: 0 solved, 234 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 104/104 constraints]
After SMT, in 60088ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 60091ms
Starting structural reductions in LTL mode, iteration 1 : 312/339 places, 235/262 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60501 ms. Remains : 312/339 places, 235/262 transitions.
[2024-05-21 23:30:42] [INFO ] Flatten gal took : 21 ms
[2024-05-21 23:30:42] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:30:42] [INFO ] Input system was already deterministic with 235 transitions.
[2024-05-21 23:30:42] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:30:42] [INFO ] Flatten gal took : 21 ms
[2024-05-21 23:30:42] [INFO ] Time to serialize gal into /tmp/CTLFireability16111795694592599234.gal : 2 ms
[2024-05-21 23:30:42] [INFO ] Time to serialize properties into /tmp/CTLFireability9733960014448810533.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16111795694592599234.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9733960014448810533.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:31:13] [INFO ] Flatten gal took : 22 ms
[2024-05-21 23:31:13] [INFO ] Applying decomposition
[2024-05-21 23:31:13] [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.202405141337/bin/convert-linux64' '-i' '/tmp/graph4367532356711756411.txt' '-o' '/tmp/graph4367532356711756411.bin' '-w' '/tmp/graph4367532356711756411.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4367532356711756411.bin' '-l' '-1' '-v' '-w' '/tmp/graph4367532356711756411.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:31:13] [INFO ] Decomposing Gal with order
[2024-05-21 23:31:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:31:13] [INFO ] Removed a total of 33 redundant transitions.
[2024-05-21 23:31:13] [INFO ] Flatten gal took : 26 ms
[2024-05-21 23:31:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 15 ms.
[2024-05-21 23:31:13] [INFO ] Time to serialize gal into /tmp/CTLFireability6738981396205755586.gal : 15 ms
[2024-05-21 23:31:13] [INFO ] Time to serialize properties into /tmp/CTLFireability7798715619854689879.ctl : 2 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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6738981396205755586.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7798715619854689879.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.70641e+18,1.1952,46612,10225,33,116074,395,703,103225,45,1014,0


Converting to forward existential form...Done !
original formula: AG((AG(E(EF((i14.u73.p190==1)) U ((EX((i0.u22.p62==1)) * (i7.i1.u31.p84==1)) * (i17.i1.u80.p219==1)))) * ((AX(AX((i8.i2.u106.p347==0))) +...504
=> equivalent forward existential formula: ([(FwdU(FwdU(Init,TRUE),TRUE) * !(E(E(TRUE U (i14.u73.p190==1)) U ((EX((i0.u22.p62==1)) * (i7.i1.u31.p84==1)) * ...1381
Reverse transition relation is NOT exact ! Due to transitions t2, t108, t156, t164, t176, i0.t152, i0.t116, i0.u21.t155, i0.u38.t133, i1.t172, i1.t168, i1....794
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
(forward)formula 0,0,21.0875,573672,1,0,1.41377e+06,442,5017,1.52054e+06,239,1291,3646092
FORMULA BusinessProcesses-PT-06-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 339/339 places, 262/262 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 317 transition count 240
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 317 transition count 240
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 50 place count 311 transition count 234
Iterating global reduction 0 with 6 rules applied. Total rules applied 56 place count 311 transition count 234
Applied a total of 56 rules in 17 ms. Remains 311 /339 variables (removed 28) and now considering 234/262 (removed 28) transitions.
// Phase 1: matrix 234 rows 311 cols
[2024-05-21 23:31:34] [INFO ] Computed 79 invariants in 4 ms
[2024-05-21 23:31:34] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-21 23:31:34] [INFO ] Invariant cache hit.
[2024-05-21 23:31:34] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
Running 233 sub problems to find dead transitions.
[2024-05-21 23:31:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 34/65 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:31:37] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-21 23:31:37] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:31:37] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:31:38] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:31:38] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:31:38] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:31:38] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 1 ms to minimize.
[2024-05-21 23:31:38] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:31:38] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:31:38] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:31:38] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:31:38] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:31:38] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:31:38] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:31:39] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:31:39] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:31:39] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-05-21 23:31:39] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
[2024-05-21 23:31:39] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:31:39] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:31:39] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:31:39] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:31:39] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:31:39] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-21 23:31:39] [INFO ] Deduced a trap composed of 14 places in 17 ms of which 0 ms to minimize.
[2024-05-21 23:31:39] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-05-21 23:31:40] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-21 23:31:40] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2024-05-21 23:31:40] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
[2024-05-21 23:31:40] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2024-05-21 23:31:40] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:31:40] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:31:40] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-05-21 23:31:40] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:31:40] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-21 23:31:40] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:31:40] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
[2024-05-21 23:31:40] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:31:40] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 29 ms to minimize.
[2024-05-21 23:31:40] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:31:41] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:31:41] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:31:41] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:31:41] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 1 ms to minimize.
[2024-05-21 23:31:41] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:31:41] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:31:42] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 1 ms to minimize.
[2024-05-21 23:31:42] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 0 ms to minimize.
[2024-05-21 23:31:42] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 0 ms to minimize.
[2024-05-21 23:31:42] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:31:42] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:31:42] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:31:42] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:31:42] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:31:42] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:31:42] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:31:42] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 17/136 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:31:44] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 0 ms to minimize.
[2024-05-21 23:31:44] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:31:44] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:31:44] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 4/140 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:31:45] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:31:46] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:31:46] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 3/143 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:31:47] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:31:47] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:31:49] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/311 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:31:50] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/311 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/311 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 13 (OVERLAPS) 234/545 variables, 311/458 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:31:54] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-21 23:31:54] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-21 23:31:54] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:31:54] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 0 ms to minimize.
[2024-05-21 23:31:54] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-05-21 23:31:54] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:31:54] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:31:54] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:31:54] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:31:55] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:31:55] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:31:55] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 0 ms to minimize.
[2024-05-21 23:31:55] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/545 variables, 13/471 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:31:56] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-05-21 23:31:56] [INFO ] Deduced a trap composed of 20 places in 19 ms of which 1 ms to minimize.
[2024-05-21 23:31:56] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:31:57] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-05-21 23:31:57] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/545 variables, 5/476 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:32:00] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-05-21 23:32:00] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/545 variables, 2/478 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/545 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 18 (OVERLAPS) 0/545 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 233 unsolved
No progress, stopping.
After SMT solving in domain Real declared 545/545 variables, and 478 constraints, problems are : Problem set: 0 solved, 233 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 88/88 constraints]
Escalating to Integer solving :Problem set: 0 solved, 233 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 34/65 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:32:06] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:32:06] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:32:06] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:32:06] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:32:06] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:32:06] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:32:07] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-21 23:32:07] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-21 23:32:07] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 9/176 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:32:08] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-05-21 23:32:08] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2024-05-21 23:32:08] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:32:08] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-21 23:32:08] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:32:08] [INFO ] Deduced a trap composed of 23 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:32:08] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-05-21 23:32:08] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 8/184 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:32:09] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:32:10] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:32:10] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-05-21 23:32:10] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:32:10] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:32:11] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:32:11] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:32:11] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-21 23:32:11] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 4 ms to minimize.
[2024-05-21 23:32:11] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:32:11] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:32:11] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 11/196 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 10 (OVERLAPS) 234/545 variables, 311/507 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/545 variables, 233/740 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:32:17] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 5 ms to minimize.
[2024-05-21 23:32:17] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:32:18] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:32:18] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:32:18] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:32:18] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/545 variables, 6/746 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/545 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 233 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 545/545 variables, and 746 constraints, problems are : Problem set: 0 solved, 233 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 123/123 constraints]
After SMT, in 60083ms problems are : Problem set: 0 solved, 233 unsolved
Search for dead transitions found 0 dead transitions in 60099ms
Starting structural reductions in LTL mode, iteration 1 : 311/339 places, 234/262 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60534 ms. Remains : 311/339 places, 234/262 transitions.
[2024-05-21 23:32:34] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:32:34] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:32:35] [INFO ] Input system was already deterministic with 234 transitions.
[2024-05-21 23:32:35] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:32:35] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:32:35] [INFO ] Time to serialize gal into /tmp/CTLFireability9530410173000059609.gal : 4 ms
[2024-05-21 23:32:35] [INFO ] Time to serialize properties into /tmp/CTLFireability15774056066569381981.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9530410173000059609.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15774056066569381981.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:33:05] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:33:05] [INFO ] Applying decomposition
[2024-05-21 23:33:05] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph800868169687962739.txt' '-o' '/tmp/graph800868169687962739.bin' '-w' '/tmp/graph800868169687962739.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph800868169687962739.bin' '-l' '-1' '-v' '-w' '/tmp/graph800868169687962739.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:33:05] [INFO ] Decomposing Gal with order
[2024-05-21 23:33:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:33:05] [INFO ] Removed a total of 33 redundant transitions.
[2024-05-21 23:33:05] [INFO ] Flatten gal took : 37 ms
[2024-05-21 23:33:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 15 ms.
[2024-05-21 23:33:05] [INFO ] Time to serialize gal into /tmp/CTLFireability14756669580004132123.gal : 3 ms
[2024-05-21 23:33:05] [INFO ] Time to serialize properties into /tmp/CTLFireability10716382424317941013.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14756669580004132123.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10716382424317941013.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.64213e+18,1.27589,50036,10495,29,119961,338,687,123807,43,924,0


Converting to forward existential form...Done !
original formula: EF(((AG((i12.u67.p165==0)) * (i15.u92.p283==1)) * (AF((EG((((i6.i1.u35.p91==1)&&(i9.u81.p232==1))&&(i15.u92.p345==1))) * ((i14.i0.u62.p15...223
=> equivalent forward existential formula: [(FwdU(((FwdU(Init,TRUE) * (!(E(TRUE U !((i12.u67.p165==0)))) * (i15.u92.p283==1))) * !(EG(!((EG((((i6.i1.u35.p9...306
Reverse transition relation is NOT exact ! Due to transitions t2, t107, t115, t151, t159, t167, t175, i0.i0.u89.t43, i0.i1.u58.t106, i0.i2.u56.t110, i0.i2....760
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 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
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 339/339 places, 262/262 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 319 transition count 242
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 319 transition count 242
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 46 place count 313 transition count 236
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 313 transition count 236
Applied a total of 52 rules in 10 ms. Remains 313 /339 variables (removed 26) and now considering 236/262 (removed 26) transitions.
// Phase 1: matrix 236 rows 313 cols
[2024-05-21 23:33:35] [INFO ] Computed 79 invariants in 5 ms
[2024-05-21 23:33:35] [INFO ] Implicit Places using invariants in 274 ms returned []
[2024-05-21 23:33:35] [INFO ] Invariant cache hit.
[2024-05-21 23:33:35] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
Running 235 sub problems to find dead transitions.
[2024-05-21 23:33:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 34/65 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-21 23:33:39] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:33:39] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 3 ms to minimize.
[2024-05-21 23:33:39] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:33:39] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:33:39] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:33:39] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:33:39] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:33:39] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:33:39] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:33:40] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:33:40] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:33:40] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:33:40] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:33:40] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:33:40] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-05-21 23:33:40] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 3 ms to minimize.
[2024-05-21 23:33:40] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:33:40] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:33:40] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:33:40] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-21 23:33:41] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:33:41] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:33:41] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:33:41] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:33:41] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:33:41] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:33:41] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:33:42] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:33:42] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:33:42] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:33:42] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:33:42] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 12/111 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-21 23:33:43] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:33:43] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-05-21 23:33:44] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:33:44] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-21 23:33:46] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 13 ms to minimize.
[2024-05-21 23:33:46] [INFO ] Deduced a trap composed of 14 places in 16 ms of which 0 ms to minimize.
[2024-05-21 23:33:46] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-05-21 23:33:46] [INFO ] Deduced a trap composed of 16 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:33:46] [INFO ] Deduced a trap composed of 17 places in 17 ms of which 1 ms to minimize.
[2024-05-21 23:33:46] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:33:46] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:33:46] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:33:46] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 1 ms to minimize.
[2024-05-21 23:33:46] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:33:47] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:33:47] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-05-21 23:33:47] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:33:47] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 14/129 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-21 23:33:48] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:33:49] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-21 23:33:50] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:33:50] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:33:50] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:33:50] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:33:50] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:33:50] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:33:50] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:33:50] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/313 variables, 8/139 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-21 23:33:53] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:33:53] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/313 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/313 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 12 (OVERLAPS) 236/549 variables, 313/454 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-21 23:33:57] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-21 23:33:57] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:33:57] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-21 23:33:57] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:33:57] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:33:57] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 0 ms to minimize.
[2024-05-21 23:33:58] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:33:58] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:33:58] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:33:58] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:33:58] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:33:58] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:33:58] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:33:58] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:33:58] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/549 variables, 15/469 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-21 23:34:00] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-05-21 23:34:00] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/549 variables, 2/471 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/549 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 16 (OVERLAPS) 0/549 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 235 unsolved
No progress, stopping.
After SMT solving in domain Real declared 549/549 variables, and 471 constraints, problems are : Problem set: 0 solved, 235 unsolved in 29922 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 235/235 constraints, Known Traps: 79/79 constraints]
Escalating to Integer solving :Problem set: 0 solved, 235 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 34/65 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 79/158 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-21 23:34:07] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-21 23:34:07] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:34:07] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:34:07] [INFO ] Deduced a trap composed of 24 places in 20 ms of which 1 ms to minimize.
[2024-05-21 23:34:07] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:34:07] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 0 ms to minimize.
[2024-05-21 23:34:07] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 7/165 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-21 23:34:08] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-21 23:34:09] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 9 (OVERLAPS) 236/549 variables, 313/480 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/549 variables, 235/715 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-21 23:34:14] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:34:14] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:34:15] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:34:16] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/549 variables, 4/719 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-21 23:34:27] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/549 variables, 1/720 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-21 23:34:34] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:34:34] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:34:34] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 549/549 variables, and 723 constraints, problems are : Problem set: 0 solved, 235 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 235/235 constraints, Known Traps: 96/96 constraints]
After SMT, in 59986ms problems are : Problem set: 0 solved, 235 unsolved
Search for dead transitions found 0 dead transitions in 59989ms
Starting structural reductions in LTL mode, iteration 1 : 313/339 places, 236/262 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60535 ms. Remains : 313/339 places, 236/262 transitions.
[2024-05-21 23:34:35] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:34:35] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:34:35] [INFO ] Input system was already deterministic with 236 transitions.
[2024-05-21 23:34:35] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:34:35] [INFO ] Flatten gal took : 22 ms
[2024-05-21 23:34:35] [INFO ] Time to serialize gal into /tmp/CTLFireability80966485308075115.gal : 2 ms
[2024-05-21 23:34:35] [INFO ] Time to serialize properties into /tmp/CTLFireability11400836869089084870.ctl : 14 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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability80966485308075115.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11400836869089084870.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:35:06] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:35:06] [INFO ] Applying decomposition
[2024-05-21 23:35:06] [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.202405141337/bin/convert-linux64' '-i' '/tmp/graph953241781516743104.txt' '-o' '/tmp/graph953241781516743104.bin' '-w' '/tmp/graph953241781516743104.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph953241781516743104.bin' '-l' '-1' '-v' '-w' '/tmp/graph953241781516743104.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:35:06] [INFO ] Decomposing Gal with order
[2024-05-21 23:35:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:35:06] [INFO ] Removed a total of 33 redundant transitions.
[2024-05-21 23:35:06] [INFO ] Flatten gal took : 24 ms
[2024-05-21 23:35:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-21 23:35:06] [INFO ] Time to serialize gal into /tmp/CTLFireability255122277764803198.gal : 20 ms
[2024-05-21 23:35:06] [INFO ] Time to serialize properties into /tmp/CTLFireability16573192077140694097.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability255122277764803198.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16573192077140694097.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.69916e+18,3.5889,124208,23008,34,308274,439,669,380672,43,1183,0


Converting to forward existential form...Done !
original formula: E((EF((!(A((((i7.i3.u23.p94==1)&&(i14.u84.p237==1))&&(i18.u91.p345==1)) U (i9.i0.u39.p100==1))) * ((((i10.i0.u38.p97==1)&&(i12.u89.p262==...406
=> equivalent forward existential formula: [FwdG((FwdU(Init,(E(TRUE U (!(!((E(!((i9.i0.u39.p100==1)) U (!((((i7.i3.u23.p94==1)&&(i14.u84.p237==1))&&(i18.u9...547
Reverse transition relation is NOT exact ! Due to transitions t2, t109, t157, t169, t173, i0.t153, i0.i0.u19.t160, i0.i1.u21.t156, i1.t165, i1.t161, i1.u13...770
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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 339/339 places, 262/262 transitions.
Graph (complete) has 653 edges and 339 vertex of which 338 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 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 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 36 place count 337 transition count 225
Reduce places removed 35 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 37 rules applied. Total rules applied 73 place count 302 transition count 223
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 75 place count 300 transition count 223
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 71 Pre rules applied. Total rules applied 75 place count 300 transition count 152
Deduced a syphon composed of 71 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 3 with 152 rules applied. Total rules applied 227 place count 219 transition count 152
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 250 place count 196 transition count 129
Iterating global reduction 3 with 23 rules applied. Total rules applied 273 place count 196 transition count 129
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 149 rules applied. Total rules applied 422 place count 121 transition count 55
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 423 place count 120 transition count 54
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 424 place count 119 transition count 54
Applied a total of 424 rules in 76 ms. Remains 119 /339 variables (removed 220) and now considering 54/262 (removed 208) transitions.
// Phase 1: matrix 54 rows 119 cols
[2024-05-21 23:35:36] [INFO ] Computed 67 invariants in 1 ms
[2024-05-21 23:35:36] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-21 23:35:36] [INFO ] Invariant cache hit.
[2024-05-21 23:35:36] [INFO ] Implicit Places using invariants and state equation in 221 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 12, 14, 16, 18, 20, 22, 24, 41, 42, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 80, 82]
Discarding 37 places :
Implicit Place search using SMT with State Equation took 350 ms to find 37 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 82/339 places, 54/262 transitions.
Graph (complete) has 178 edges and 82 vertex of which 74 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 74 transition count 45
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 66 transition count 45
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 23 place count 63 transition count 42
Applied a total of 23 rules in 3 ms. Remains 63 /82 variables (removed 19) and now considering 42/54 (removed 12) transitions.
// Phase 1: matrix 42 rows 63 cols
[2024-05-21 23:35:36] [INFO ] Computed 23 invariants in 2 ms
[2024-05-21 23:35:36] [INFO ] Implicit Places using invariants in 63 ms returned [62]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 64 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 62/339 places, 42/262 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 494 ms. Remains : 62/339 places, 42/262 transitions.
[2024-05-21 23:35:36] [INFO ] Flatten gal took : 1 ms
[2024-05-21 23:35:36] [INFO ] Flatten gal took : 1 ms
[2024-05-21 23:35:36] [INFO ] Input system was already deterministic with 42 transitions.
[2024-05-21 23:35:36] [INFO ] Flatten gal took : 1 ms
[2024-05-21 23:35:36] [INFO ] Flatten gal took : 1 ms
[2024-05-21 23:35:36] [INFO ] Time to serialize gal into /tmp/CTLFireability1591515213470923563.gal : 1 ms
[2024-05-21 23:35:36] [INFO ] Time to serialize properties into /tmp/CTLFireability15366361004580575216.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1591515213470923563.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15366361004580575216.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,131772,0.285491,14112,2,11613,5,47535,6,0,291,43955,0


Converting to forward existential form...Done !
original formula: !(E(AG(!((((p125==1)&&(p253==1))&&(p370==1)))) U (((p150==1)&&(p268==1))&&(p345==1))))
=> equivalent forward existential formula: [(FwdU(Init,!(E(TRUE U !(!((((p125==1)&&(p253==1))&&(p370==1))))))) * (((p150==1)&&(p268==1))&&(p345==1)))] = FA...158
Reverse transition relation is NOT exact ! Due to transitions t1, t20, t22, Intersection with reachable at each step enabled. (destroyed/reverse/intersect...173
(forward)formula 0,1,1.62945,59408,1,0,91,219901,110,45,1875,122485,97
FORMULA BusinessProcesses-PT-06-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 339/339 places, 262/262 transitions.
Graph (complete) has 653 edges and 339 vertex of which 338 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 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 337 transition count 229
Reduce places removed 31 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 34 rules applied. Total rules applied 66 place count 306 transition count 226
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 69 place count 303 transition count 226
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 68 Pre rules applied. Total rules applied 69 place count 303 transition count 158
Deduced a syphon composed of 68 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 145 rules applied. Total rules applied 214 place count 226 transition count 158
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 234 place count 206 transition count 138
Iterating global reduction 3 with 20 rules applied. Total rules applied 254 place count 206 transition count 138
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 410 place count 124 transition count 64
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 411 place count 123 transition count 63
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 412 place count 122 transition count 63
Applied a total of 412 rules in 77 ms. Remains 122 /339 variables (removed 217) and now considering 63/262 (removed 199) transitions.
// Phase 1: matrix 63 rows 122 cols
[2024-05-21 23:35:38] [INFO ] Computed 61 invariants in 1 ms
[2024-05-21 23:35:38] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-21 23:35:38] [INFO ] Invariant cache hit.
[2024-05-21 23:35:38] [INFO ] Implicit Places using invariants and state equation in 220 ms returned [0, 1, 3, 4, 5, 6, 7, 8, 19, 21, 23, 25, 27, 36, 39, 42, 44, 46, 48, 50, 52, 54, 56, 61, 67, 69, 71, 73, 75, 77, 79, 81]
Discarding 32 places :
Implicit Place search using SMT with State Equation took 368 ms to find 32 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 90/339 places, 63/262 transitions.
Graph (complete) has 191 edges and 90 vertex of which 82 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 82 transition count 56
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 76 transition count 56
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Ensure Unique test removed 7 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 25 rules applied. Total rules applied 38 place count 60 transition count 47
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 59 transition count 46
Applied a total of 40 rules in 5 ms. Remains 59 /90 variables (removed 31) and now considering 46/63 (removed 17) transitions.
// Phase 1: matrix 46 rows 59 cols
[2024-05-21 23:35:38] [INFO ] Computed 15 invariants in 1 ms
[2024-05-21 23:35:38] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-21 23:35:38] [INFO ] Invariant cache hit.
[2024-05-21 23:35:39] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 59/339 places, 46/262 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 599 ms. Remains : 59/339 places, 46/262 transitions.
[2024-05-21 23:35:39] [INFO ] Flatten gal took : 2 ms
[2024-05-21 23:35:39] [INFO ] Flatten gal took : 2 ms
[2024-05-21 23:35:39] [INFO ] Input system was already deterministic with 46 transitions.
[2024-05-21 23:35:39] [INFO ] Flatten gal took : 2 ms
[2024-05-21 23:35:39] [INFO ] Flatten gal took : 1 ms
[2024-05-21 23:35:39] [INFO ] Time to serialize gal into /tmp/CTLFireability2925432042126215875.gal : 2 ms
[2024-05-21 23:35:39] [INFO ] Time to serialize properties into /tmp/CTLFireability7179283163689639817.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2925432042126215875.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7179283163689639817.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,721860,0.434557,21492,2,16075,5,74760,6,0,280,82786,0


Converting to forward existential form...Done !
original formula: AG(AF((((AG(!(A((p71==1) U (p339==1)))) * !(E((p269==1) U (p23==1)))) * (EF((((p134==0)||(p213==0))||(p337==0))) * (p224==0))) * (((p150=...185
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((((!(E(TRUE U !(!(!((E(!((p339==1)) U (!((p71==1)) * !((p339==1)))) + EG(!((p339==1)))))...302
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t9, t10, t12, t21, t28, Intersection with reachable at each step enabled. (destroyed...191
(forward)formula 0,0,11.7166,340372,1,0,240,1.7827e+06,136,127,1826,2.01428e+06,271
FORMULA BusinessProcesses-PT-06-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 339/339 places, 262/262 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 319 transition count 242
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 319 transition count 242
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 46 place count 313 transition count 236
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 313 transition count 236
Applied a total of 52 rules in 13 ms. Remains 313 /339 variables (removed 26) and now considering 236/262 (removed 26) transitions.
// Phase 1: matrix 236 rows 313 cols
[2024-05-21 23:35:50] [INFO ] Computed 79 invariants in 6 ms
[2024-05-21 23:35:51] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-21 23:35:51] [INFO ] Invariant cache hit.
[2024-05-21 23:35:51] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
Running 235 sub problems to find dead transitions.
[2024-05-21 23:35:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 40/72 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-21 23:35:54] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:35:54] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:35:54] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:35:54] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:35:54] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:35:54] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2024-05-21 23:35:54] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:35:54] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:35:54] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:35:54] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:35:55] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:35:55] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:35:55] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 1 ms to minimize.
[2024-05-21 23:35:55] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:35:55] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:35:55] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 3 ms to minimize.
[2024-05-21 23:35:55] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-05-21 23:35:55] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:35:55] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-05-21 23:35:55] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-21 23:35:55] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-05-21 23:35:55] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:35:55] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:35:56] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:35:56] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:35:56] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:35:56] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:35:56] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:35:56] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:35:56] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:35:56] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:35:56] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 0 ms to minimize.
[2024-05-21 23:35:56] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:35:56] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:35:57] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:35:57] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:35:57] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:35:57] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:35:57] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:35:57] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-21 23:35:58] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:35:58] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:35:58] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:35:58] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 0 ms to minimize.
[2024-05-21 23:35:58] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:35:58] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:35:58] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:35:58] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:35:58] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:35:58] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
[2024-05-21 23:35:59] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:35:59] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:35:59] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 13/132 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-21 23:36:00] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:36:00] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:36:00] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:36:00] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:36:00] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:36:01] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:36:01] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-05-21 23:36:01] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:36:01] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:36:01] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 1 ms to minimize.
[2024-05-21 23:36:01] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 1 ms to minimize.
[2024-05-21 23:36:01] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:36:01] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:36:01] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:36:01] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 0 ms to minimize.
[2024-05-21 23:36:02] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:36:02] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 17/149 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-21 23:36:03] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:36:03] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:36:03] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 3/152 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-21 23:36:04] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/313 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-21 23:36:06] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/313 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-21 23:36:07] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:36:07] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-05-21 23:36:07] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/313 variables, 3/157 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-21 23:36:09] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/313 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-21 23:36:10] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/313 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-21 23:36:11] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-05-21 23:36:12] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 1 ms to minimize.
[2024-05-21 23:36:12] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
[2024-05-21 23:36:12] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:36:12] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:36:12] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:36:12] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:36:12] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:36:12] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:36:12] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:36:12] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:36:12] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:36:13] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/313 variables, 13/172 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/313 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 16 (OVERLAPS) 236/549 variables, 313/485 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-21 23:36:16] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-05-21 23:36:16] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-05-21 23:36:16] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:36:16] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:36:16] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:36:16] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
[2024-05-21 23:36:16] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-05-21 23:36:16] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:36:16] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:36:17] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:36:17] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:36:17] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/549 variables, 12/497 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/549 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 235 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 549/549 variables, and 497 constraints, problems are : Problem set: 0 solved, 235 unsolved in 30007 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 235/235 constraints, Known Traps: 105/105 constraints]
Escalating to Integer solving :Problem set: 0 solved, 235 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 40/72 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 105/184 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 6 (OVERLAPS) 236/549 variables, 313/497 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/549 variables, 235/732 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-21 23:36:25] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:36:28] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:36:29] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:36:29] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:36:30] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:36:30] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:36:31] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/549 variables, 7/739 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-21 23:36:36] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:36:36] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:36:36] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 2 ms to minimize.
[2024-05-21 23:36:37] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/549 variables, 4/743 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-21 23:36:47] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/549 variables, 1/744 constraints. Problems are: Problem set: 0 solved, 235 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 549/549 variables, and 744 constraints, problems are : Problem set: 0 solved, 235 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 235/235 constraints, Known Traps: 117/117 constraints]
After SMT, in 60052ms problems are : Problem set: 0 solved, 235 unsolved
Search for dead transitions found 0 dead transitions in 60054ms
Starting structural reductions in LTL mode, iteration 1 : 313/339 places, 236/262 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60510 ms. Remains : 313/339 places, 236/262 transitions.
[2024-05-21 23:36:51] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:36:51] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:36:51] [INFO ] Input system was already deterministic with 236 transitions.
[2024-05-21 23:36:51] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:36:51] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:36:51] [INFO ] Time to serialize gal into /tmp/CTLFireability9401767883372589750.gal : 1 ms
[2024-05-21 23:36:51] [INFO ] Time to serialize properties into /tmp/CTLFireability12619346837639145063.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9401767883372589750.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12619346837639145063.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:37:21] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:37:21] [INFO ] Applying decomposition
[2024-05-21 23:37:21] [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.202405141337/bin/convert-linux64' '-i' '/tmp/graph4650880125125969256.txt' '-o' '/tmp/graph4650880125125969256.bin' '-w' '/tmp/graph4650880125125969256.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4650880125125969256.bin' '-l' '-1' '-v' '-w' '/tmp/graph4650880125125969256.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:37:21] [INFO ] Decomposing Gal with order
[2024-05-21 23:37:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:37:21] [INFO ] Removed a total of 34 redundant transitions.
[2024-05-21 23:37:21] [INFO ] Flatten gal took : 27 ms
[2024-05-21 23:37:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 23:37:21] [INFO ] Time to serialize gal into /tmp/CTLFireability8109464494310632518.gal : 23 ms
[2024-05-21 23:37:21] [INFO ] Time to serialize properties into /tmp/CTLFireability13133371817020879221.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8109464494310632518.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13133371817020879221.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.77097e+18,0.848328,33884,6889,28,74606,375,649,86996,41,992,0


Converting to forward existential form...Done !
original formula: (EF((EX((i20.u101.p330==0)) + A((i1.u37.p98==1) U (i18.i0.u71.p186==1)))) * (AX((i5.i0.u98.p307==1)) + AF(AG((i19.u77.p209==0)))))
=> equivalent forward existential formula: ([(Init * !(E(TRUE U (EX((i20.u101.p330==0)) + !((E(!((i18.i0.u71.p186==1)) U (!((i1.u37.p98==1)) * !((i18.i0.u7...311
Reverse transition relation is NOT exact ! Due to transitions t2, t109, t117, t153, t157, t169, t173, i0.u55.t112, i0.u57.t108, i1.u37.t134, i1.u53.t116, i...765
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 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
(forward)formula 0,0,14.3101,562392,1,0,1.64677e+06,375,4118,1.12305e+06,182,992,2957826
FORMULA BusinessProcesses-PT-06-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 339/339 places, 262/262 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 316 transition count 239
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 316 transition count 239
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 53 place count 309 transition count 232
Iterating global reduction 0 with 7 rules applied. Total rules applied 60 place count 309 transition count 232
Applied a total of 60 rules in 9 ms. Remains 309 /339 variables (removed 30) and now considering 232/262 (removed 30) transitions.
// Phase 1: matrix 232 rows 309 cols
[2024-05-21 23:37:36] [INFO ] Computed 79 invariants in 10 ms
[2024-05-21 23:37:36] [INFO ] Implicit Places using invariants in 193 ms returned []
[2024-05-21 23:37:36] [INFO ] Invariant cache hit.
[2024-05-21 23:37:36] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
Running 231 sub problems to find dead transitions.
[2024-05-21 23:37:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 1/309 variables, 40/72 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:37:40] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:37:40] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:37:40] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:37:40] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:37:40] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:37:40] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:37:40] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:37:40] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:37:40] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:37:40] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:37:40] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:37:41] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:37:41] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:37:41] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:37:41] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:37:41] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:37:41] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:37:41] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:37:41] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:37:41] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:37:42] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:37:42] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:37:42] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:37:42] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:37:42] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:37:42] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:37:42] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:37:42] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:37:43] [INFO ] Deduced a trap composed of 18 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:37:43] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:37:43] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:37:43] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:37:43] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:37:43] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:37:43] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:37:43] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:37:43] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:37:43] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:37:43] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 19/118 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:37:44] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:37:45] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:37:45] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:37:45] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:37:45] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-05-21 23:37:45] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:37:45] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:37:45] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 8/126 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:37:47] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:37:47] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:37:47] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
[2024-05-21 23:37:47] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-21 23:37:47] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-05-21 23:37:47] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-21 23:37:47] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 0 ms to minimize.
[2024-05-21 23:37:47] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:37:48] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 0 ms to minimize.
[2024-05-21 23:37:48] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 0 ms to minimize.
[2024-05-21 23:37:48] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:37:48] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:37:48] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:37:48] [INFO ] Deduced a trap composed of 18 places in 17 ms of which 1 ms to minimize.
[2024-05-21 23:37:48] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
[2024-05-21 23:37:48] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:37:48] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 0 ms to minimize.
[2024-05-21 23:37:48] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:37:49] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:37:49] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:37:49] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:37:49] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:37:49] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:37:49] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:37:49] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:37:50] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:37:50] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:37:50] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 8/154 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:37:51] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:37:51] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:37:51] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 13 ms to minimize.
[2024-05-21 23:37:51] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:37:52] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:37:52] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:37:52] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:37:52] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 8/162 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/309 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 11 (OVERLAPS) 232/541 variables, 309/471 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:37:55] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-05-21 23:37:56] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:37:56] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/541 variables, 3/474 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/541 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 14 (OVERLAPS) 0/541 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 231 unsolved
No progress, stopping.
After SMT solving in domain Real declared 541/541 variables, and 474 constraints, problems are : Problem set: 0 solved, 231 unsolved in 26649 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 309/309 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 86/86 constraints]
Escalating to Integer solving :Problem set: 0 solved, 231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 1/309 variables, 40/72 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 86/165 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:38:04] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:38:04] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:38:04] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-21 23:38:04] [INFO ] Deduced a trap composed of 22 places in 19 ms of which 0 ms to minimize.
[2024-05-21 23:38:04] [INFO ] Deduced a trap composed of 23 places in 18 ms of which 1 ms to minimize.
[2024-05-21 23:38:04] [INFO ] Deduced a trap composed of 24 places in 20 ms of which 0 ms to minimize.
[2024-05-21 23:38:05] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 7/172 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (OVERLAPS) 232/541 variables, 309/481 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/541 variables, 231/712 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:38:09] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:38:10] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:38:10] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2024-05-21 23:38:10] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:38:10] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/541 variables, 5/717 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:38:19] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:38:19] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/541 variables, 2/719 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:38:25] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:38:27] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:38:27] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:38:27] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:38:28] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-05-21 23:38:28] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/541 variables, 6/725 constraints. Problems are: Problem set: 0 solved, 231 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 541/541 variables, and 725 constraints, problems are : Problem set: 0 solved, 231 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 309/309 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 106/106 constraints]
After SMT, in 56691ms problems are : Problem set: 0 solved, 231 unsolved
Search for dead transitions found 0 dead transitions in 56694ms
Starting structural reductions in LTL mode, iteration 1 : 309/339 places, 232/262 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57153 ms. Remains : 309/339 places, 232/262 transitions.
[2024-05-21 23:38:33] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:38:33] [INFO ] Flatten gal took : 13 ms
[2024-05-21 23:38:33] [INFO ] Input system was already deterministic with 232 transitions.
[2024-05-21 23:38:33] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:38:33] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:38:33] [INFO ] Time to serialize gal into /tmp/CTLFireability3205580665800638298.gal : 2 ms
[2024-05-21 23:38:33] [INFO ] Time to serialize properties into /tmp/CTLFireability13747783422420267540.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3205580665800638298.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13747783422420267540.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:39:03] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:39:03] [INFO ] Applying decomposition
[2024-05-21 23:39:03] [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.202405141337/bin/convert-linux64' '-i' '/tmp/graph5043394960517217215.txt' '-o' '/tmp/graph5043394960517217215.bin' '-w' '/tmp/graph5043394960517217215.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5043394960517217215.bin' '-l' '-1' '-v' '-w' '/tmp/graph5043394960517217215.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:39:03] [INFO ] Decomposing Gal with order
[2024-05-21 23:39:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:39:03] [INFO ] Removed a total of 32 redundant transitions.
[2024-05-21 23:39:03] [INFO ] Flatten gal took : 15 ms
[2024-05-21 23:39:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 23:39:03] [INFO ] Time to serialize gal into /tmp/CTLFireability730028495040143996.gal : 3 ms
[2024-05-21 23:39:03] [INFO ] Time to serialize properties into /tmp/CTLFireability18184000206229531123.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability730028495040143996.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18184000206229531123.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.64213e+18,0.594708,29128,5138,35,56147,563,636,109275,47,1178,0


Converting to forward existential form...Done !
original formula: E((i2.i0.u8.p20!=1) U EX(EX(((i13.u76.p205==1) * E((((i5.i0.u27.p73==1)&&(i15.u69.p172==1))&&(i10.u91.p345==1)) U (((i6.i0.u21.p57==1)&&(...200
=> equivalent forward existential formula: [(FwdU((EY(EY(FwdU(Init,(i2.i0.u8.p20!=1)))) * (i13.u76.p205==1)),(((i5.i0.u27.p73==1)&&(i15.u69.p172==1))&&(i10...247
(forward)formula 0,0,1.28447,51040,1,0,121985,563,1517,119350,88,1178,243676
FORMULA BusinessProcesses-PT-06-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 339/339 places, 262/262 transitions.
Graph (trivial) has 159 edges and 339 vertex of which 7 / 339 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 646 edges and 333 vertex of which 332 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 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 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 331 transition count 211
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 86 place count 289 transition count 211
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 86 place count 289 transition count 146
Deduced a syphon composed of 65 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 226 place count 214 transition count 146
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 247 place count 193 transition count 125
Iterating global reduction 2 with 21 rules applied. Total rules applied 268 place count 193 transition count 125
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 426 place count 110 transition count 50
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 428 place count 109 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 429 place count 108 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 430 place count 107 transition count 48
Applied a total of 430 rules in 56 ms. Remains 107 /339 variables (removed 232) and now considering 48/262 (removed 214) transitions.
// Phase 1: matrix 48 rows 107 cols
[2024-05-21 23:39:04] [INFO ] Computed 60 invariants in 1 ms
[2024-05-21 23:39:04] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-21 23:39:04] [INFO ] Invariant cache hit.
[2024-05-21 23:39:05] [INFO ] Implicit Places using invariants and state equation in 121 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 12, 14, 16, 18, 20, 22, 24, 34, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75]
Discarding 39 places :
Implicit Place search using SMT with State Equation took 246 ms to find 39 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 68/339 places, 48/262 transitions.
Graph (complete) has 140 edges and 68 vertex of which 60 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 60 transition count 37
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 50 transition count 37
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 41 place count 37 transition count 30
Applied a total of 41 rules in 3 ms. Remains 37 /68 variables (removed 31) and now considering 30/48 (removed 18) transitions.
// Phase 1: matrix 30 rows 37 cols
[2024-05-21 23:39:05] [INFO ] Computed 8 invariants in 0 ms
[2024-05-21 23:39:05] [INFO ] Implicit Places using invariants in 53 ms returned [36]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 65 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 36/339 places, 30/262 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 35 transition count 29
Applied a total of 2 rules in 2 ms. Remains 35 /36 variables (removed 1) and now considering 29/30 (removed 1) transitions.
// Phase 1: matrix 29 rows 35 cols
[2024-05-21 23:39:05] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 23:39:05] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-21 23:39:05] [INFO ] Invariant cache hit.
[2024-05-21 23:39:05] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 35/339 places, 29/262 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 471 ms. Remains : 35/339 places, 29/262 transitions.
[2024-05-21 23:39:05] [INFO ] Flatten gal took : 1 ms
[2024-05-21 23:39:05] [INFO ] Flatten gal took : 0 ms
[2024-05-21 23:39:05] [INFO ] Input system was already deterministic with 29 transitions.
[2024-05-21 23:39:05] [INFO ] Flatten gal took : 1 ms
[2024-05-21 23:39:05] [INFO ] Flatten gal took : 0 ms
[2024-05-21 23:39:05] [INFO ] Time to serialize gal into /tmp/CTLFireability4679208160913839934.gal : 0 ms
[2024-05-21 23:39:05] [INFO ] Time to serialize properties into /tmp/CTLFireability3315607309693603693.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4679208160913839934.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3315607309693603693.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,39398,0.057702,6804,2,4237,5,21358,6,0,168,14119,0


Converting to forward existential form...Done !
original formula: AG((AG(AF((p118==1))) + (p282==0)))
=> equivalent forward existential formula: [FwdG(FwdU((FwdU(Init,TRUE) * !((p282==0))),TRUE),!((p118==1)))] = FALSE
Hit Full ! (commute/partial/dont) 27/0/2
(forward)formula 0,0,0.253847,15780,1,0,14,61154,23,6,874,28364,11
FORMULA BusinessProcesses-PT-06-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 339/339 places, 262/262 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 319 transition count 242
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 319 transition count 242
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 46 place count 313 transition count 236
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 313 transition count 236
Applied a total of 52 rules in 20 ms. Remains 313 /339 variables (removed 26) and now considering 236/262 (removed 26) transitions.
// Phase 1: matrix 236 rows 313 cols
[2024-05-21 23:39:05] [INFO ] Computed 79 invariants in 2 ms
[2024-05-21 23:39:05] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-21 23:39:05] [INFO ] Invariant cache hit.
[2024-05-21 23:39:05] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
Running 235 sub problems to find dead transitions.
[2024-05-21 23:39:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 40/72 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-21 23:39:08] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:39:09] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:39:09] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:39:09] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:39:09] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:39:09] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:39:09] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:39:09] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:39:09] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:39:09] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:39:09] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:39:09] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:39:09] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-05-21 23:39:09] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:39:10] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 0 ms to minimize.
[2024-05-21 23:39:10] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:39:10] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2024-05-21 23:39:10] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:39:10] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-05-21 23:39:10] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-21 23:39:10] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:39:10] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:39:10] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:39:10] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:39:11] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:39:11] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:39:11] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 0 ms to minimize.
[2024-05-21 23:39:11] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:39:11] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:39:11] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:39:11] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:39:11] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:39:11] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 13/112 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-21 23:39:12] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:39:12] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:39:12] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:39:12] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:39:12] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:39:13] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:39:13] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 0 ms to minimize.
[2024-05-21 23:39:13] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:39:13] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 9/121 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-21 23:39:14] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:39:14] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:39:14] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:39:15] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:39:15] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:39:15] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:39:15] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 7/128 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-21 23:39:16] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-05-21 23:39:16] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:39:16] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:39:16] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:39:16] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:39:16] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 1 ms to minimize.
[2024-05-21 23:39:16] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:39:16] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:39:16] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 0 ms to minimize.
[2024-05-21 23:39:17] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:39:17] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:39:17] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:39:17] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:39:17] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:39:17] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:39:17] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:39:17] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 0 ms to minimize.
[2024-05-21 23:39:17] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:39:17] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 19/147 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-21 23:39:18] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/313 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-21 23:39:20] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-05-21 23:39:20] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2024-05-21 23:39:20] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
[2024-05-21 23:39:20] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:39:20] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-21 23:39:20] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:39:20] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:39:21] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:39:21] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/313 variables, 9/157 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-21 23:39:22] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 ms to minimize.
[2024-05-21 23:39:22] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:39:22] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/313 variables, 3/160 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-21 23:39:23] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:39:24] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/313 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-21 23:39:25] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/313 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/313 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 15 (OVERLAPS) 236/549 variables, 313/476 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-21 23:39:29] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-21 23:39:29] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:39:29] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:39:29] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:39:30] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:39:30] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:39:30] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:39:30] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/549 variables, 8/484 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/549 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-21 23:39:33] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:39:33] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:39:33] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:39:34] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 2 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/549 variables, 4/488 constraints. Problems are: Problem set: 0 solved, 235 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 549/549 variables, and 488 constraints, problems are : Problem set: 0 solved, 235 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 235/235 constraints, Known Traps: 96/96 constraints]
Escalating to Integer solving :Problem set: 0 solved, 235 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 40/72 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 96/175 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-21 23:39:37] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:39:37] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:39:38] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:39:38] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 4/179 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 7 (OVERLAPS) 236/549 variables, 313/492 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/549 variables, 235/727 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-21 23:39:43] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:39:44] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:39:44] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/549 variables, 3/730 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-21 23:39:51] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:39:51] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-21 23:39:51] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-05-21 23:39:51] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 1 ms to minimize.
[2024-05-21 23:39:53] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/549 variables, 5/735 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/549 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 235 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 549/549 variables, and 735 constraints, problems are : Problem set: 0 solved, 235 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 235/235 constraints, Known Traps: 108/108 constraints]
After SMT, in 60070ms problems are : Problem set: 0 solved, 235 unsolved
Search for dead transitions found 0 dead transitions in 60077ms
Starting structural reductions in LTL mode, iteration 1 : 313/339 places, 236/262 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60585 ms. Remains : 313/339 places, 236/262 transitions.
[2024-05-21 23:40:06] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:40:06] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:40:06] [INFO ] Input system was already deterministic with 236 transitions.
[2024-05-21 23:40:06] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:40:06] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:40:06] [INFO ] Time to serialize gal into /tmp/CTLFireability3491075906373975086.gal : 3 ms
[2024-05-21 23:40:06] [INFO ] Time to serialize properties into /tmp/CTLFireability11540639154629304165.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3491075906373975086.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11540639154629304165.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:40:36] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:40:36] [INFO ] Applying decomposition
[2024-05-21 23:40:36] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17268304147262724201.txt' '-o' '/tmp/graph17268304147262724201.bin' '-w' '/tmp/graph17268304147262724201.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17268304147262724201.bin' '-l' '-1' '-v' '-w' '/tmp/graph17268304147262724201.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:40:36] [INFO ] Decomposing Gal with order
[2024-05-21 23:40:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:40:36] [INFO ] Removed a total of 32 redundant transitions.
[2024-05-21 23:40:36] [INFO ] Flatten gal took : 35 ms
[2024-05-21 23:40:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 23:40:36] [INFO ] Time to serialize gal into /tmp/CTLFireability5632047027253997536.gal : 21 ms
[2024-05-21 23:40:36] [INFO ] Time to serialize properties into /tmp/CTLFireability8032817767934365875.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5632047027253997536.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8032817767934365875.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.64229e+18,0.607039,26524,4783,28,53689,419,692,87336,43,1266,0


Converting to forward existential form...Done !
original formula: (E(AG(((!(EX((i16.u90.p270==1))) + (i8.i0.u22.p63==1)) + (i14.i1.u76.p214==1))) U (i16.u101.p335==1)) + EX(((i2.u3.p7==0) * ((AX((i3.u4.p...219
=> equivalent forward existential formula: ([(FwdU(Init,!(E(TRUE U !(((!(EX((i16.u90.p270==1))) + (i8.i0.u22.p63==1)) + (i14.i1.u76.p214==1)))))) * (i16.u1...405
Reverse transition relation is NOT exact ! Due to transitions t2, t153, t165, t173, t177, i0.i0.u86.t51, i0.i0.u87.t48, i0.i1.u84.t57, i0.i1.u85.t54, i1.i0...773
(forward)formula 0,0,3.7225,151132,1,0,354910,419,4080,417148,182,1266,867517
FORMULA BusinessProcesses-PT-06-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 339/339 places, 262/262 transitions.
Graph (trivial) has 161 edges and 339 vertex of which 7 / 339 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 646 edges and 333 vertex of which 332 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 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 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 331 transition count 211
Reduce places removed 42 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 43 rules applied. Total rules applied 87 place count 289 transition count 210
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 88 place count 288 transition count 210
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 88 place count 288 transition count 145
Deduced a syphon composed of 65 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 139 rules applied. Total rules applied 227 place count 214 transition count 145
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 249 place count 192 transition count 123
Iterating global reduction 3 with 22 rules applied. Total rules applied 271 place count 192 transition count 123
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 3 with 158 rules applied. Total rules applied 429 place count 109 transition count 48
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 431 place count 108 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 432 place count 107 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 433 place count 106 transition count 46
Applied a total of 433 rules in 26 ms. Remains 106 /339 variables (removed 233) and now considering 46/262 (removed 216) transitions.
// Phase 1: matrix 46 rows 106 cols
[2024-05-21 23:40:40] [INFO ] Computed 61 invariants in 0 ms
[2024-05-21 23:40:40] [INFO ] Implicit Places using invariants in 69 ms returned [81]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 83 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 105/339 places, 46/262 transitions.
Applied a total of 0 rules in 1 ms. Remains 105 /105 variables (removed 0) and now considering 46/46 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 111 ms. Remains : 105/339 places, 46/262 transitions.
[2024-05-21 23:40:40] [INFO ] Flatten gal took : 2 ms
[2024-05-21 23:40:40] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:40:40] [INFO ] Input system was already deterministic with 46 transitions.
[2024-05-21 23:40:40] [INFO ] Flatten gal took : 2 ms
[2024-05-21 23:40:40] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:40:40] [INFO ] Time to serialize gal into /tmp/CTLFireability7375335730278735854.gal : 1 ms
[2024-05-21 23:40:40] [INFO ] Time to serialize properties into /tmp/CTLFireability9843383470601089641.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7375335730278735854.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9843383470601089641.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,79019,0.652438,25940,2,18780,5,123098,6,0,466,88604,0


Converting to forward existential form...Done !
original formula: EG(AG((p32!=1)))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !((p32!=1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t14, t23, t45, Intersection with reachable at each step enabled. (destroyed/reverse/inte...178
(forward)formula 0,0,3.41141,116792,1,0,86,407417,119,53,2917,253766,106
FORMULA BusinessProcesses-PT-06-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 339/339 places, 262/262 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 321 transition count 244
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 321 transition count 244
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 316 transition count 239
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 316 transition count 239
Applied a total of 46 rules in 8 ms. Remains 316 /339 variables (removed 23) and now considering 239/262 (removed 23) transitions.
// Phase 1: matrix 239 rows 316 cols
[2024-05-21 23:40:43] [INFO ] Computed 79 invariants in 1 ms
[2024-05-21 23:40:43] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-21 23:40:43] [INFO ] Invariant cache hit.
[2024-05-21 23:40:44] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
Running 238 sub problems to find dead transitions.
[2024-05-21 23:40:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (OVERLAPS) 1/316 variables, 40/72 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-21 23:40:46] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:40:47] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:40:47] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:40:47] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:40:47] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:40:47] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:40:47] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:40:47] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:40:47] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:40:47] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:40:47] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:40:47] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:40:47] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:40:47] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:40:48] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:40:48] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:40:48] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:40:48] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:40:48] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 19/98 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-21 23:40:49] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:40:49] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:40:49] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:40:49] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:40:49] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:40:49] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:40:49] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-21 23:40:50] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:40:50] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:40:50] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:40:50] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:40:50] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:40:50] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-21 23:40:50] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 0 ms to minimize.
[2024-05-21 23:40:50] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-21 23:40:50] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-21 23:40:50] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:40:50] [INFO ] Deduced a trap composed of 14 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:40:50] [INFO ] Deduced a trap composed of 17 places in 17 ms of which 0 ms to minimize.
[2024-05-21 23:40:50] [INFO ] Deduced a trap composed of 16 places in 16 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-21 23:40:51] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:40:51] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:40:51] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:40:51] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:40:51] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:40:51] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:40:51] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:40:51] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:40:51] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:40:51] [INFO ] Deduced a trap composed of 17 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:40:52] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:40:52] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:40:52] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:40:52] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 14/132 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-21 23:40:54] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-05-21 23:40:54] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:40:54] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:40:54] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:40:54] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-05-21 23:40:55] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:40:55] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:40:55] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:40:55] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:40:55] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:40:55] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:40:55] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 12/144 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-21 23:40:56] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:40:56] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:40:56] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 0 ms to minimize.
[2024-05-21 23:40:57] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-21 23:40:57] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:40:57] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:40:57] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-05-21 23:40:57] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 8/152 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/316 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 10 (OVERLAPS) 239/555 variables, 316/468 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-21 23:41:00] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-21 23:41:00] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
[2024-05-21 23:41:00] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-05-21 23:41:00] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:41:00] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:41:01] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:41:01] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:41:01] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:41:01] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:41:01] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:41:01] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:41:01] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:41:01] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:41:01] [INFO ] Deduced a trap composed of 22 places in 17 ms of which 0 ms to minimize.
[2024-05-21 23:41:01] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:41:01] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:41:01] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 0 ms to minimize.
[2024-05-21 23:41:01] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:41:02] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/555 variables, 19/487 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/555 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 13 (OVERLAPS) 0/555 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 487 constraints, problems are : Problem set: 0 solved, 238 unsolved in 23892 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 316/316 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 92/92 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (OVERLAPS) 1/316 variables, 40/72 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 92/171 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-21 23:41:09] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-21 23:41:10] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-21 23:41:10] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-21 23:41:10] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-05-21 23:41:10] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:41:10] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:41:10] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:41:10] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:41:10] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:41:10] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:41:11] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 10/182 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-21 23:41:12] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:41:12] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:41:12] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:41:12] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 4/186 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-21 23:41:13] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:41:13] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:41:13] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 3 ms to minimize.
[2024-05-21 23:41:13] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2024-05-21 23:41:13] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 5/191 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/316 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 10 (OVERLAPS) 239/555 variables, 316/507 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/555 variables, 238/745 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-21 23:41:16] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:41:17] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:41:17] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:41:18] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:41:18] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:41:18] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:41:18] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:41:18] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:41:19] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:41:19] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:41:21] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:41:21] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:41:21] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/555 variables, 13/758 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-21 23:41:30] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/555 variables, 1/759 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 555/555 variables, and 759 constraints, problems are : Problem set: 0 solved, 238 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 316/316 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 126/126 constraints]
After SMT, in 53941ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 53943ms
Starting structural reductions in LTL mode, iteration 1 : 316/339 places, 239/262 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54312 ms. Remains : 316/339 places, 239/262 transitions.
[2024-05-21 23:41:37] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:41:37] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:41:37] [INFO ] Input system was already deterministic with 239 transitions.
[2024-05-21 23:41:38] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:41:38] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:41:38] [INFO ] Time to serialize gal into /tmp/CTLFireability11487855360063289555.gal : 2 ms
[2024-05-21 23:41:38] [INFO ] Time to serialize properties into /tmp/CTLFireability6327097774378826045.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11487855360063289555.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6327097774378826045.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:42:08] [INFO ] Flatten gal took : 14 ms
[2024-05-21 23:42:08] [INFO ] Applying decomposition
[2024-05-21 23:42:08] [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.202405141337/bin/convert-linux64' '-i' '/tmp/graph2636923143731783880.txt' '-o' '/tmp/graph2636923143731783880.bin' '-w' '/tmp/graph2636923143731783880.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2636923143731783880.bin' '-l' '-1' '-v' '-w' '/tmp/graph2636923143731783880.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:42:08] [INFO ] Decomposing Gal with order
[2024-05-21 23:42:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:42:08] [INFO ] Removed a total of 32 redundant transitions.
[2024-05-21 23:42:08] [INFO ] Flatten gal took : 28 ms
[2024-05-21 23:42:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 23:42:08] [INFO ] Time to serialize gal into /tmp/CTLFireability2216921532438301569.gal : 3 ms
[2024-05-21 23:42:08] [INFO ] Time to serialize properties into /tmp/CTLFireability8841897106180924749.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2216921532438301569.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8841897106180924749.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.84124e+18,0.54345,21520,4780,36,43977,614,667,44827,49,2009,0


Converting to forward existential form...Done !
original formula: AG(((AF(((((i4.u11.p28==0)&&(i9.i2.u25.p73==1))&&((i5.u70.p172==1)&&(i19.u94.p345==1)))&&((((i10.i1.u36.p93==1)&&(i19.u96.p292==1))||(i14...420
=> equivalent forward existential formula: (([(FwdU(EY((FwdU(Init,TRUE) * !(!(EG(!(((((i4.u11.p28==0)&&(i9.i2.u25.p73==1))&&((i5.u70.p172==1)&&(i19.u94.p34...946
Reverse transition relation is NOT exact ! Due to transitions t2, t160, t168, t172, t180, i0.t112, i0.i0.u56.t115, i0.i0.u89.t51, i0.i0.u90.t48, i0.i1.u60....793
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 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Using saturation style SCC detection
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 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Detected timeout of ITS tools.
[2024-05-21 23:42:38] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:42:38] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:42:38] [INFO ] Applying decomposition
[2024-05-21 23:42:38] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9766541513783377739.txt' '-o' '/tmp/graph9766541513783377739.bin' '-w' '/tmp/graph9766541513783377739.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9766541513783377739.bin' '-l' '-1' '-v' '-w' '/tmp/graph9766541513783377739.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:42:38] [INFO ] Decomposing Gal with order
[2024-05-21 23:42:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:42:38] [INFO ] Removed a total of 38 redundant transitions.
[2024-05-21 23:42:38] [INFO ] Flatten gal took : 29 ms
[2024-05-21 23:42:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 23:42:38] [INFO ] Time to serialize gal into /tmp/CTLFireability11192561546360098111.gal : 5 ms
[2024-05-21 23:42:38] [INFO ] Time to serialize properties into /tmp/CTLFireability5912190897186271977.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11192561546360098111.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5912190897186271977.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 5 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,2.18287e+18,3.95114,129032,28594,57,323872,1084,782,276167,54,3904,0


Converting to forward existential form...Done !
original formula: EX(AG(AX((EX((i7.i1.u75.p199==0)) + (i17.i0.u55.p141==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(!(EX(!((EX((i7.i1.u75.p199==0)) + (i17.i0.u55.p141==1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t143, t179, t183, t191, t203, i0.i0.t135, i0.i0.u36.t160, i0.i0.u52.t142, i0.i0.u54.t138,...1063
(forward)formula 0,0,95.9036,2209400,1,0,5.33707e+06,1084,2509,5.25607e+06,140,3904,3754528
FORMULA BusinessProcesses-PT-06-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF(EX(EX((EX((i16.i1.u99.p277==1)) + (i18.i1.u133.p375==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(EX((EX((i16.i1.u99.p277==1)) + (i18.i1.u133.p375==1))))))] = FALSE
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local 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 an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 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
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
(forward)formula 1,1,100.116,2209400,1,0,5.33707e+06,1084,3250,5.25607e+06,202,3904,4704145
FORMULA BusinessProcesses-PT-06-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF(((AG((i7.i1.u66.p165==0)) * (i16.i1.u100.p283==1)) * (AF((EG((((i4.i1.u33.p91==1)&&(i15.i1.u88.p232==1))&&(i16.i1.u99.p345==1))) * ((i...231
=> equivalent forward existential formula: [(FwdU(((FwdU(Init,TRUE) * (!(E(TRUE U !((i7.i1.u66.p165==0)))) * (i16.i1.u100.p283==1))) * !(EG(!((EG((((i4.i1....314
(forward)formula 2,0,374.738,3137860,1,0,6.89291e+06,1084,1753,6.71669e+06,128,3904,4899093
FORMULA BusinessProcesses-PT-06-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: E((EF((!(A((((i4.i1.u21.p94==1)&&(i15.i0.u89.p237==1))&&(i16.i1.u99.p345==1)) U (i8.i1.u37.p100==1))) * ((((i0.i0.u36.p97==1)&&(i17.i0.u9...434
=> equivalent forward existential formula: [FwdG((FwdU(Init,(E(TRUE U (!(!((E(!((i8.i1.u37.p100==1)) U (!((((i4.i1.u21.p94==1)&&(i15.i0.u89.p237==1))&&(i16...575
(forward)formula 3,0,532.873,3593140,1,0,7.62644e+06,1316,3486,8.15798e+06,187,4482,7391501
FORMULA BusinessProcesses-PT-06-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AG(((AF(((((i2.u9.p28==0)&&(i6.i1.u25.p73==1))&&((i12.u69.p172==1)&&(i16.i1.u99.p345==1)))&&((((i15.i1.u34.p93==1)&&(i16.i1.u104.p292==1)...442
=> equivalent forward existential formula: (([(FwdU(EY((FwdU(Init,TRUE) * !(!(EG(!(((((i2.u9.p28==0)&&(i6.i1.u25.p73==1))&&((i12.u69.p172==1)&&(i16.i1.u99....985
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 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 an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 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
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
(forward)formula 4,0,786.993,4001984,1,0,8.46334e+06,1367,1601,9.89784e+06,112,4913,8303415
FORMULA BusinessProcesses-PT-06-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1883218 ms.

BK_STOP 1716335746982

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-06"
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-5568"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-06, 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 r048-tajo-171620399600490"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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