About the Execution of ITS-Tools for BusinessProcesses-PT-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | ????F??FFFFF???? | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r030-smll-174853813300073.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is BusinessProcesses-PT-10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-smll-174853813300073
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 131K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME BusinessProcesses-PT-10-CTLCardinality-2023-12
FORMULA_NAME BusinessProcesses-PT-10-CTLCardinality-2023-13
FORMULA_NAME BusinessProcesses-PT-10-CTLCardinality-2023-14
FORMULA_NAME BusinessProcesses-PT-10-CTLCardinality-2023-15
FORMULA_NAME BusinessProcesses-PT-10-CTLCardinality-2025-00
FORMULA_NAME BusinessProcesses-PT-10-CTLCardinality-2025-01
FORMULA_NAME BusinessProcesses-PT-10-CTLCardinality-2025-02
FORMULA_NAME BusinessProcesses-PT-10-CTLCardinality-2025-03
FORMULA_NAME BusinessProcesses-PT-10-CTLCardinality-2025-04
FORMULA_NAME BusinessProcesses-PT-10-CTLCardinality-2025-05
FORMULA_NAME BusinessProcesses-PT-10-CTLCardinality-2025-06
FORMULA_NAME BusinessProcesses-PT-10-CTLCardinality-2025-07
FORMULA_NAME BusinessProcesses-PT-10-CTLCardinality-2025-08
FORMULA_NAME BusinessProcesses-PT-10-CTLCardinality-2025-09
FORMULA_NAME BusinessProcesses-PT-10-CTLCardinality-2025-10
FORMULA_NAME BusinessProcesses-PT-10-CTLCardinality-2025-11
=== Now, execution of the tool begins
BK_START 1748566424001
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-05-30 00:53:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 00:53:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 00:53:46] [INFO ] Load time of PNML (sax parser for PT used): 187 ms
[2025-05-30 00:53:46] [INFO ] Transformed 518 places.
[2025-05-30 00:53:46] [INFO ] Transformed 471 transitions.
[2025-05-30 00:53:46] [INFO ] Found NUPN structural information;
[2025-05-30 00:53:46] [INFO ] Parsed PT model containing 518 places and 471 transitions and 1415 arcs in 394 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 22 ms.
FORMULA BusinessProcesses-PT-10-CTLCardinality-2025-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 86 out of 518 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 471/471 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 517 transition count 471
Discarding 58 places :
Symmetric choice reduction at 1 with 58 rule applications. Total rules 59 place count 459 transition count 413
Iterating global reduction 1 with 58 rules applied. Total rules applied 117 place count 459 transition count 413
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 143 place count 433 transition count 387
Iterating global reduction 1 with 26 rules applied. Total rules applied 169 place count 433 transition count 387
Applied a total of 169 rules in 167 ms. Remains 433 /518 variables (removed 85) and now considering 387/471 (removed 84) transitions.
// Phase 1: matrix 387 rows 433 cols
[2025-05-30 00:53:47] [INFO ] Computed 84 invariants in 57 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:53:48] [INFO ] Implicit Places using invariants in 1025 ms returned []
[2025-05-30 00:53:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:53:49] [INFO ] Implicit Places using invariants and state equation in 1476 ms returned []
Implicit Place search using SMT with State Equation took 2572 ms to find 0 implicit places.
Running 386 sub problems to find dead transitions.
[2025-05-30 00:53:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 2 (OVERLAPS) 1/433 variables, 45/80 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 386 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:11] [INFO ] Deduced a trap composed of 58 places in 459 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:11] [INFO ] Deduced a trap composed of 77 places in 289 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:12] [INFO ] Deduced a trap composed of 75 places in 342 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:12] [INFO ] Deduced a trap composed of 70 places in 321 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:12] [INFO ] Deduced a trap composed of 55 places in 309 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:13] [INFO ] Deduced a trap composed of 69 places in 319 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:13] [INFO ] Deduced a trap composed of 27 places in 301 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:13] [INFO ] Deduced a trap composed of 69 places in 290 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:14] [INFO ] Deduced a trap composed of 74 places in 272 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:14] [INFO ] Deduced a trap composed of 74 places in 308 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:15] [INFO ] Deduced a trap composed of 31 places in 342 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:15] [INFO ] Deduced a trap composed of 76 places in 342 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:15] [INFO ] Deduced a trap composed of 32 places in 344 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:16] [INFO ] Deduced a trap composed of 76 places in 332 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:16] [INFO ] Deduced a trap composed of 75 places in 348 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:17] [INFO ] Deduced a trap composed of 74 places in 227 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:17] [INFO ] Deduced a trap composed of 70 places in 357 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:18] [INFO ] Deduced a trap composed of 71 places in 339 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:18] [INFO ] Deduced a trap composed of 70 places in 375 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:19] [INFO ] Deduced a trap composed of 69 places in 376 ms of which 67 ms to minimize.
Problem TDEAD304 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 20/104 constraints. Problems are: Problem set: 8 solved, 378 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:19] [INFO ] Deduced a trap composed of 76 places in 348 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:20] [INFO ] Deduced a trap composed of 71 places in 385 ms of which 122 ms to minimize.
SMT process timed out in 30584ms, After SMT, problems are : Problem set: 8 solved, 378 unsolved
Search for dead transitions found 8 dead transitions in 30610ms
Found 8 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 8 transitions
Dead transitions reduction (with SMT) removed 8 transitions
Starting structural reductions in LTL mode, iteration 1 : 433/518 places, 379/471 transitions.
Applied a total of 0 rules in 8 ms. Remains 433 /433 variables (removed 0) and now considering 379/379 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 33400 ms. Remains : 433/518 places, 379/471 transitions.
Support contains 86 out of 433 places after structural reductions.
[2025-05-30 00:54:20] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-05-30 00:54:20] [INFO ] Flatten gal took : 107 ms
[2025-05-30 00:54:20] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BusinessProcesses-PT-10-CTLCardinality-2025-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-CTLCardinality-2025-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-30 00:54:20] [INFO ] Flatten gal took : 50 ms
[2025-05-30 00:54:20] [INFO ] Input system was already deterministic with 379 transitions.
Support contains 68 out of 433 places (down from 86) after GAL structural reductions.
RANDOM walk for 40000 steps (325 resets) in 3246 ms. (12 steps per ms) remains 10/43 properties
BEST_FIRST walk for 40003 steps (56 resets) in 240 ms. (165 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (59 resets) in 156 ms. (254 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (64 resets) in 118 ms. (336 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (59 resets) in 191 ms. (208 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (58 resets) in 100 ms. (396 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (58 resets) in 112 ms. (354 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (57 resets) in 184 ms. (216 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (57 resets) in 149 ms. (266 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (56 resets) in 127 ms. (312 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (54 resets) in 185 ms. (215 steps per ms) remains 7/10 properties
// Phase 1: matrix 379 rows 433 cols
[2025-05-30 00:54:22] [INFO ] Computed 84 invariants in 18 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 100/115 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 151/266 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp29 is UNSAT
At refinement iteration 5 (OVERLAPS) 154/420 variables, 33/76 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 0/76 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 10/430 variables, 8/84 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/430 variables, 0/84 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 377/807 variables, 430/514 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/807 variables, 0/514 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 5/812 variables, 3/517 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/812 variables, 0/517 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/812 variables, 0/517 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 812/812 variables, and 517 constraints, problems are : Problem set: 1 solved, 6 unsolved in 1017 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 96/109 variables, 12/12 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:23] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 1/13 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 156/265 variables, 31/44 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:23] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:23] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:23] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:23] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:24] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:24] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 6/50 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 0/50 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Problem AtomicPropp5 is UNSAT
At refinement iteration 7 (OVERLAPS) 155/420 variables, 33/83 constraints. Problems are: Problem set: 2 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:24] [INFO ] Deduced a trap composed of 10 places in 370 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:24] [INFO ] Deduced a trap composed of 21 places in 295 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:25] [INFO ] Deduced a trap composed of 21 places in 348 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:25] [INFO ] Deduced a trap composed of 19 places in 282 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:25] [INFO ] Deduced a trap composed of 20 places in 290 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:26] [INFO ] Deduced a trap composed of 23 places in 356 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:26] [INFO ] Deduced a trap composed of 55 places in 352 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:27] [INFO ] Deduced a trap composed of 57 places in 386 ms of which 62 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 8/91 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/420 variables, 0/91 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 10/430 variables, 8/99 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/430 variables, 0/99 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 377/807 variables, 430/529 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/807 variables, 5/534 constraints. Problems are: Problem set: 2 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:27] [INFO ] Deduced a trap composed of 8 places in 303 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:28] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:28] [INFO ] Deduced a trap composed of 30 places in 152 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:28] [INFO ] Deduced a trap composed of 33 places in 120 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:28] [INFO ] Deduced a trap composed of 33 places in 121 ms of which 14 ms to minimize.
SMT process timed out in 6166ms, After SMT, problems are : Problem set: 2 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 9 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 379/379 transitions.
Graph (trivial) has 200 edges and 433 vertex of which 6 / 433 are part of one of the 1 SCC in 6 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 951 edges and 428 vertex of which 427 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 427 transition count 321
Reduce places removed 50 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 52 rules applied. Total rules applied 104 place count 377 transition count 319
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 106 place count 375 transition count 319
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 83 Pre rules applied. Total rules applied 106 place count 375 transition count 236
Deduced a syphon composed of 83 places in 2 ms
Ensure Unique test removed 11 places
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 3 with 177 rules applied. Total rules applied 283 place count 281 transition count 236
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 302 place count 262 transition count 217
Iterating global reduction 3 with 19 rules applied. Total rules applied 321 place count 262 transition count 217
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 321 place count 262 transition count 216
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 323 place count 261 transition count 216
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 3 with 191 rules applied. Total rules applied 514 place count 163 transition count 123
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 516 place count 162 transition count 126
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 518 place count 162 transition count 124
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 520 place count 160 transition count 124
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 521 place count 160 transition count 124
Applied a total of 521 rules in 201 ms. Remains 160 /433 variables (removed 273) and now considering 124/379 (removed 255) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 201 ms. Remains : 160/433 places, 124/379 transitions.
RANDOM walk for 1549 steps (62 resets) in 47 ms. (32 steps per ms) remains 0/5 properties
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
[2025-05-30 00:54:28] [INFO ] Flatten gal took : 59 ms
[2025-05-30 00:54:28] [INFO ] Flatten gal took : 61 ms
[2025-05-30 00:54:29] [INFO ] Input system was already deterministic with 379 transitions.
Computed a total of 208 stabilizing places and 205 stable transitions
Graph (complete) has 958 edges and 433 vertex of which 432 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.20 ms
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 379/379 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 412 transition count 358
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 412 transition count 358
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 50 place count 404 transition count 350
Iterating global reduction 0 with 8 rules applied. Total rules applied 58 place count 404 transition count 350
Applied a total of 58 rules in 84 ms. Remains 404 /433 variables (removed 29) and now considering 350/379 (removed 29) transitions.
// Phase 1: matrix 350 rows 404 cols
[2025-05-30 00:54:29] [INFO ] Computed 84 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:54:29] [INFO ] Implicit Places using invariants in 353 ms returned []
[2025-05-30 00:54:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:54:30] [INFO ] Implicit Places using invariants and state equation in 751 ms returned []
Implicit Place search using SMT with State Equation took 1108 ms to find 0 implicit places.
Running 349 sub problems to find dead transitions.
[2025-05-30 00:54:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/403 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 2 (OVERLAPS) 1/404 variables, 45/80 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/404 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 349 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:47] [INFO ] Deduced a trap composed of 49 places in 324 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:48] [INFO ] Deduced a trap composed of 49 places in 309 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:48] [INFO ] Deduced a trap composed of 50 places in 321 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:48] [INFO ] Deduced a trap composed of 49 places in 308 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:48] [INFO ] Deduced a trap composed of 49 places in 291 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:49] [INFO ] Deduced a trap composed of 49 places in 295 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:49] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:50] [INFO ] Deduced a trap composed of 54 places in 300 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:50] [INFO ] Deduced a trap composed of 54 places in 317 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:50] [INFO ] Deduced a trap composed of 49 places in 301 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:51] [INFO ] Deduced a trap composed of 18 places in 262 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:51] [INFO ] Deduced a trap composed of 20 places in 251 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:52] [INFO ] Deduced a trap composed of 49 places in 297 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:52] [INFO ] Deduced a trap composed of 59 places in 323 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:53] [INFO ] Deduced a trap composed of 62 places in 375 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:54] [INFO ] Deduced a trap composed of 36 places in 338 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:54] [INFO ] Deduced a trap composed of 32 places in 316 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:55] [INFO ] Deduced a trap composed of 30 places in 384 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:55] [INFO ] Deduced a trap composed of 23 places in 320 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:55] [INFO ] Deduced a trap composed of 27 places in 301 ms of which 12 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/404 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 349 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:56] [INFO ] Deduced a trap composed of 68 places in 288 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:56] [INFO ] Deduced a trap composed of 63 places in 315 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:57] [INFO ] Deduced a trap composed of 68 places in 333 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:57] [INFO ] Deduced a trap composed of 68 places in 252 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:57] [INFO ] Deduced a trap composed of 70 places in 277 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:58] [INFO ] Deduced a trap composed of 27 places in 273 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:58] [INFO ] Deduced a trap composed of 65 places in 368 ms of which 116 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:58] [INFO ] Deduced a trap composed of 30 places in 304 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:59] [INFO ] Deduced a trap composed of 30 places in 308 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:59] [INFO ] Deduced a trap composed of 70 places in 318 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:54:59] [INFO ] Deduced a trap composed of 70 places in 338 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:55:00] [INFO ] Deduced a trap composed of 55 places in 301 ms of which 49 ms to minimize.
SMT process timed out in 30142ms, After SMT, problems are : Problem set: 0 solved, 349 unsolved
Search for dead transitions found 0 dead transitions in 30148ms
Starting structural reductions in LTL mode, iteration 1 : 404/433 places, 350/379 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31343 ms. Remains : 404/433 places, 350/379 transitions.
[2025-05-30 00:55:00] [INFO ] Flatten gal took : 44 ms
[2025-05-30 00:55:00] [INFO ] Flatten gal took : 44 ms
[2025-05-30 00:55:00] [INFO ] Input system was already deterministic with 350 transitions.
[2025-05-30 00:55:00] [INFO ] Flatten gal took : 43 ms
[2025-05-30 00:55:00] [INFO ] Flatten gal took : 41 ms
[2025-05-30 00:55:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality12838737723172265457.gal : 18 ms
[2025-05-30 00:55:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality13265671753618550450.ctl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12838737723172265457.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13265671753618550450.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-30 00:55:30] [INFO ] Flatten gal took : 25 ms
[2025-05-30 00:55:30] [INFO ] Applying decomposition
[2025-05-30 00:55:30] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14295848780553931169.txt' '-o' '/tmp/graph14295848780553931169.bin' '-w' '/tmp/graph14295848780553931169.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14295848780553931169.bin' '-l' '-1' '-v' '-w' '/tmp/graph14295848780553931169.weights' '-q' '0' '-e' '0.001'
[2025-05-30 00:55:31] [INFO ] Decomposing Gal with order
[2025-05-30 00:55:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 00:55:31] [INFO ] Removed a total of 213 redundant transitions.
[2025-05-30 00:55:31] [INFO ] Flatten gal took : 151 ms
[2025-05-30 00:55:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 14 ms.
[2025-05-30 00:55:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality9056355487377320791.gal : 23 ms
[2025-05-30 00:55:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality13162655108180069399.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9056355487377320791.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13162655108180069399.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.97885e+24,27.9345,519572,10381,46,872547,635,1007,1.24872e+06,59,1558,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 379/379 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 411 transition count 357
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 411 transition count 357
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 54 place count 401 transition count 347
Iterating global reduction 0 with 10 rules applied. Total rules applied 64 place count 401 transition count 347
Applied a total of 64 rules in 60 ms. Remains 401 /433 variables (removed 32) and now considering 347/379 (removed 32) transitions.
// Phase 1: matrix 347 rows 401 cols
[2025-05-30 00:56:01] [INFO ] Computed 84 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:56:01] [INFO ] Implicit Places using invariants in 357 ms returned []
[2025-05-30 00:56:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:56:02] [INFO ] Implicit Places using invariants and state equation in 721 ms returned []
Implicit Place search using SMT with State Equation took 1082 ms to find 0 implicit places.
Running 346 sub problems to find dead transitions.
[2025-05-30 00:56:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 2 (OVERLAPS) 1/401 variables, 45/80 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 346 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:56:21] [INFO ] Deduced a trap composed of 48 places in 297 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:56:21] [INFO ] Deduced a trap composed of 67 places in 334 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:56:22] [INFO ] Deduced a trap composed of 67 places in 818 ms of which 556 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:56:22] [INFO ] Deduced a trap composed of 69 places in 173 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:56:22] [INFO ] Deduced a trap composed of 69 places in 159 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:56:23] [INFO ] Deduced a trap composed of 69 places in 280 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:56:23] [INFO ] Deduced a trap composed of 69 places in 333 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:56:24] [INFO ] Deduced a trap composed of 69 places in 475 ms of which 213 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:56:24] [INFO ] Deduced a trap composed of 31 places in 215 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:56:24] [INFO ] Deduced a trap composed of 67 places in 310 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:56:25] [INFO ] Deduced a trap composed of 68 places in 336 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:56:25] [INFO ] Deduced a trap composed of 69 places in 339 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:56:26] [INFO ] Deduced a trap composed of 68 places in 639 ms of which 371 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:56:27] [INFO ] Deduced a trap composed of 67 places in 987 ms of which 726 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:56:27] [INFO ] Deduced a trap composed of 10 places in 163 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:56:28] [INFO ] Deduced a trap composed of 20 places in 142 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:56:28] [INFO ] Deduced a trap composed of 15 places in 318 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:56:29] [INFO ] Deduced a trap composed of 65 places in 258 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:56:30] [INFO ] Deduced a trap composed of 33 places in 297 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:56:30] [INFO ] Deduced a trap composed of 48 places in 250 ms of which 23 ms to minimize.
Problem TDEAD268 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD298 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 20/104 constraints. Problems are: Problem set: 3 solved, 343 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:56:31] [INFO ] Deduced a trap composed of 68 places in 374 ms of which 118 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:56:31] [INFO ] Deduced a trap composed of 68 places in 224 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:56:31] [INFO ] Deduced a trap composed of 30 places in 200 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:56:32] [INFO ] Deduced a trap composed of 69 places in 220 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:56:32] [INFO ] Deduced a trap composed of 30 places in 195 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:56:33] [INFO ] Deduced a trap composed of 68 places in 409 ms of which 138 ms to minimize.
SMT process timed out in 30436ms, After SMT, problems are : Problem set: 3 solved, 343 unsolved
Search for dead transitions found 3 dead transitions in 30439ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 401/433 places, 344/379 transitions.
Applied a total of 0 rules in 16 ms. Remains 401 /401 variables (removed 0) and now considering 344/344 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31600 ms. Remains : 401/433 places, 344/379 transitions.
[2025-05-30 00:56:33] [INFO ] Flatten gal took : 27 ms
[2025-05-30 00:56:33] [INFO ] Flatten gal took : 16 ms
[2025-05-30 00:56:33] [INFO ] Input system was already deterministic with 344 transitions.
[2025-05-30 00:56:33] [INFO ] Flatten gal took : 15 ms
[2025-05-30 00:56:33] [INFO ] Flatten gal took : 15 ms
[2025-05-30 00:56:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality6045138838743074227.gal : 3 ms
[2025-05-30 00:56:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality14806496410895641461.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6045138838743074227.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14806496410895641461.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-30 00:57:03] [INFO ] Flatten gal took : 18 ms
[2025-05-30 00:57:03] [INFO ] Applying decomposition
[2025-05-30 00:57:03] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2391530155678130559.txt' '-o' '/tmp/graph2391530155678130559.bin' '-w' '/tmp/graph2391530155678130559.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2391530155678130559.bin' '-l' '-1' '-v' '-w' '/tmp/graph2391530155678130559.weights' '-q' '0' '-e' '0.001'
[2025-05-30 00:57:03] [INFO ] Decomposing Gal with order
[2025-05-30 00:57:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 00:57:03] [INFO ] Removed a total of 202 redundant transitions.
[2025-05-30 00:57:03] [INFO ] Flatten gal took : 34 ms
[2025-05-30 00:57:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 16 ms.
[2025-05-30 00:57:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality13230279833422380654.gal : 8 ms
[2025-05-30 00:57:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality8497468399530259519.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13230279833422380654.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8497468399530259519.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 433/433 places, 379/379 transitions.
Graph (trivial) has 203 edges and 433 vertex of which 6 / 433 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 952 edges and 428 vertex of which 427 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 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 426 transition count 320
Reduce places removed 51 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 54 rules applied. Total rules applied 107 place count 375 transition count 317
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 110 place count 372 transition count 317
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 110 place count 372 transition count 237
Deduced a syphon composed of 80 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 3 with 171 rules applied. Total rules applied 281 place count 281 transition count 237
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 302 place count 260 transition count 216
Iterating global reduction 3 with 21 rules applied. Total rules applied 323 place count 260 transition count 216
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 323 place count 260 transition count 215
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 325 place count 259 transition count 215
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 3 with 191 rules applied. Total rules applied 516 place count 161 transition count 122
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 517 place count 160 transition count 121
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 518 place count 159 transition count 121
Applied a total of 518 rules in 112 ms. Remains 159 /433 variables (removed 274) and now considering 121/379 (removed 258) transitions.
// Phase 1: matrix 121 rows 159 cols
[2025-05-30 00:57:33] [INFO ] Computed 67 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:57:34] [INFO ] Implicit Places using invariants in 289 ms returned [28, 31, 57, 128, 133]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 293 ms to find 5 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 154/433 places, 121/379 transitions.
Applied a total of 0 rules in 13 ms. Remains 154 /154 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 419 ms. Remains : 154/433 places, 121/379 transitions.
[2025-05-30 00:57:34] [INFO ] Flatten gal took : 10 ms
[2025-05-30 00:57:34] [INFO ] Flatten gal took : 9 ms
[2025-05-30 00:57:34] [INFO ] Input system was already deterministic with 121 transitions.
[2025-05-30 00:57:34] [INFO ] Flatten gal took : 10 ms
[2025-05-30 00:57:34] [INFO ] Flatten gal took : 9 ms
[2025-05-30 00:57:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality7501805791529285821.gal : 3 ms
[2025-05-30 00:57:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality7262945138936313641.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7501805791529285821.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7262945138936313641.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.25543e+09,4.71568,106572,2,8643,5,510948,6,0,736,363405,0
Converting to forward existential form...Done !
original formula: (AG((A((p140==1) U (p203==0)) + !(E((p148==1) U ((p82==0)||(p290==1)))))) + AF(AG(EF((((p308==0)&&(p10==1))&&(p53==0))))))
=> equivalent forward existential formula: [FwdG((Init * !(!(E(TRUE U !((!((E(!((p203==0)) U (!((p140==1)) * !((p203==0)))) + EG(!((p203==0))))) + !(E((p14...265
Reverse transition relation is NOT exact ! Due to transitions t4, t17, t25, t26, t29, t32, t33, t34, t35, t58, t59, t60, t61, t62, t72, t73, t79, t80, t90,...347
(forward)formula 0,0,15.3957,297016,1,0,273,1.69566e+06,253,128,5452,1.20755e+06,314
FORMULA BusinessProcesses-PT-10-CTLCardinality-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 379/379 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 410 transition count 356
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 410 transition count 356
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 56 place count 400 transition count 346
Iterating global reduction 0 with 10 rules applied. Total rules applied 66 place count 400 transition count 346
Applied a total of 66 rules in 28 ms. Remains 400 /433 variables (removed 33) and now considering 346/379 (removed 33) transitions.
// Phase 1: matrix 346 rows 400 cols
[2025-05-30 00:57:49] [INFO ] Computed 84 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:57:50] [INFO ] Implicit Places using invariants in 363 ms returned []
[2025-05-30 00:57:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:57:51] [INFO ] Implicit Places using invariants and state equation in 1129 ms returned []
Implicit Place search using SMT with State Equation took 1494 ms to find 0 implicit places.
Running 345 sub problems to find dead transitions.
[2025-05-30 00:57:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/399 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/399 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 2 (OVERLAPS) 1/400 variables, 47/82 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 345 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:09] [INFO ] Deduced a trap composed of 47 places in 321 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:09] [INFO ] Deduced a trap composed of 66 places in 335 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:09] [INFO ] Deduced a trap composed of 66 places in 342 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:10] [INFO ] Deduced a trap composed of 67 places in 349 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:10] [INFO ] Deduced a trap composed of 62 places in 327 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:10] [INFO ] Deduced a trap composed of 62 places in 317 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:11] [INFO ] Deduced a trap composed of 62 places in 308 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:11] [INFO ] Deduced a trap composed of 67 places in 315 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:11] [INFO ] Deduced a trap composed of 67 places in 274 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:12] [INFO ] Deduced a trap composed of 68 places in 316 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:12] [INFO ] Deduced a trap composed of 31 places in 305 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:13] [INFO ] Deduced a trap composed of 31 places in 298 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:13] [INFO ] Deduced a trap composed of 68 places in 320 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:13] [INFO ] Deduced a trap composed of 68 places in 319 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:14] [INFO ] Deduced a trap composed of 68 places in 285 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:14] [INFO ] Deduced a trap composed of 68 places in 297 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:14] [INFO ] Deduced a trap composed of 66 places in 307 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:15] [INFO ] Deduced a trap composed of 67 places in 333 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:15] [INFO ] Deduced a trap composed of 67 places in 335 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:16] [INFO ] Deduced a trap composed of 66 places in 329 ms of which 64 ms to minimize.
Problem TDEAD283 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 20/104 constraints. Problems are: Problem set: 1 solved, 344 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:16] [INFO ] Deduced a trap composed of 47 places in 259 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:17] [INFO ] Deduced a trap composed of 31 places in 308 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:18] [INFO ] Deduced a trap composed of 47 places in 321 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:18] [INFO ] Deduced a trap composed of 66 places in 292 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:18] [INFO ] Deduced a trap composed of 61 places in 298 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:19] [INFO ] Deduced a trap composed of 10 places in 263 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:19] [INFO ] Deduced a trap composed of 20 places in 250 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:19] [INFO ] Deduced a trap composed of 28 places in 340 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:20] [INFO ] Deduced a trap composed of 29 places in 304 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:20] [INFO ] Deduced a trap composed of 58 places in 321 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:20] [INFO ] Deduced a trap composed of 47 places in 298 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:21] [INFO ] Deduced a trap composed of 60 places in 277 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:21] [INFO ] Deduced a trap composed of 61 places in 285 ms of which 55 ms to minimize.
SMT process timed out in 30259ms, After SMT, problems are : Problem set: 1 solved, 344 unsolved
Search for dead transitions found 1 dead transitions in 30262ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 400/433 places, 345/379 transitions.
Applied a total of 0 rules in 13 ms. Remains 400 /400 variables (removed 0) and now considering 345/345 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31800 ms. Remains : 400/433 places, 345/379 transitions.
[2025-05-30 00:58:21] [INFO ] Flatten gal took : 18 ms
[2025-05-30 00:58:21] [INFO ] Flatten gal took : 18 ms
[2025-05-30 00:58:21] [INFO ] Input system was already deterministic with 345 transitions.
[2025-05-30 00:58:21] [INFO ] Flatten gal took : 17 ms
[2025-05-30 00:58:21] [INFO ] Flatten gal took : 18 ms
[2025-05-30 00:58:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality10002060438126828168.gal : 6 ms
[2025-05-30 00:58:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality13290245634070465065.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10002060438126828168.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13290245634070465065.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-30 00:58:51] [INFO ] Flatten gal took : 13 ms
[2025-05-30 00:58:51] [INFO ] Applying decomposition
[2025-05-30 00:58:51] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2358330000503913643.txt' '-o' '/tmp/graph2358330000503913643.bin' '-w' '/tmp/graph2358330000503913643.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2358330000503913643.bin' '-l' '-1' '-v' '-w' '/tmp/graph2358330000503913643.weights' '-q' '0' '-e' '0.001'
[2025-05-30 00:58:51] [INFO ] Decomposing Gal with order
[2025-05-30 00:58:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 00:58:51] [INFO ] Removed a total of 209 redundant transitions.
[2025-05-30 00:58:51] [INFO ] Flatten gal took : 36 ms
[2025-05-30 00:58:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 10 ms.
[2025-05-30 00:58:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality2699523528717726234.gal : 6 ms
[2025-05-30 00:58:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality11541805772106425100.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2699523528717726234.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11541805772106425100.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.87567e+24,12.9636,257628,4877,56,364158,888,974,1.47331e+06,62,2762,0
Converting to forward existential form...Done !
original formula: (AG((i5.i1.u88.p274!=1)) + AX(((i8.u37.p110==0)&&(i14.i1.u136.p505==1))))
=> equivalent forward existential formula: [(EY((Init * !(!(E(TRUE U !((i5.i1.u88.p274!=1))))))) * !(((i8.u37.p110==0)&&(i14.i1.u136.p505==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t7, t8, t9, t10, t139, t143, t161, t165, t185, t226, t306, t308, t310, t312, t313, t3...1132
(forward)formula 0,0,29.8297,405980,1,0,575039,888,6104,2.42947e+06,301,2762,977116
FORMULA BusinessProcesses-PT-10-CTLCardinality-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 379/379 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 411 transition count 357
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 411 transition count 357
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 53 place count 402 transition count 348
Iterating global reduction 0 with 9 rules applied. Total rules applied 62 place count 402 transition count 348
Applied a total of 62 rules in 26 ms. Remains 402 /433 variables (removed 31) and now considering 348/379 (removed 31) transitions.
// Phase 1: matrix 348 rows 402 cols
[2025-05-30 00:59:21] [INFO ] Computed 84 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:59:22] [INFO ] Implicit Places using invariants in 374 ms returned []
[2025-05-30 00:59:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:59:23] [INFO ] Implicit Places using invariants and state equation in 1023 ms returned []
Implicit Place search using SMT with State Equation took 1408 ms to find 0 implicit places.
Running 347 sub problems to find dead transitions.
[2025-05-30 00:59:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 2 (OVERLAPS) 1/402 variables, 43/78 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 6/84 constraints. Problems are: Problem set: 0 solved, 347 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:41] [INFO ] Deduced a trap composed of 48 places in 274 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:42] [INFO ] Deduced a trap composed of 67 places in 314 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:42] [INFO ] Deduced a trap composed of 67 places in 341 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:42] [INFO ] Deduced a trap composed of 67 places in 395 ms of which 143 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:43] [INFO ] Deduced a trap composed of 68 places in 310 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:43] [INFO ] Deduced a trap composed of 68 places in 321 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:43] [INFO ] Deduced a trap composed of 68 places in 312 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:44] [INFO ] Deduced a trap composed of 68 places in 304 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:44] [INFO ] Deduced a trap composed of 68 places in 328 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:44] [INFO ] Deduced a trap composed of 69 places in 284 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:45] [INFO ] Deduced a trap composed of 69 places in 357 ms of which 106 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:45] [INFO ] Deduced a trap composed of 69 places in 297 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:46] [INFO ] Deduced a trap composed of 69 places in 350 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:46] [INFO ] Deduced a trap composed of 31 places in 292 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:46] [INFO ] Deduced a trap composed of 69 places in 331 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:47] [INFO ] Deduced a trap composed of 67 places in 343 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:47] [INFO ] Deduced a trap composed of 68 places in 321 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:48] [INFO ] Deduced a trap composed of 68 places in 580 ms of which 340 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:48] [INFO ] Deduced a trap composed of 10 places in 275 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:49] [INFO ] Deduced a trap composed of 20 places in 245 ms of which 12 ms to minimize.
Problem TDEAD270 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/402 variables, 20/104 constraints. Problems are: Problem set: 1 solved, 346 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:50] [INFO ] Deduced a trap composed of 30 places in 270 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:50] [INFO ] Deduced a trap composed of 69 places in 341 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:50] [INFO ] Deduced a trap composed of 69 places in 311 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:51] [INFO ] Deduced a trap composed of 63 places in 284 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:52] [INFO ] Deduced a trap composed of 21 places in 276 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:52] [INFO ] Deduced a trap composed of 30 places in 281 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:53] [INFO ] Deduced a trap composed of 38 places in 180 ms of which 13 ms to minimize.
SMT process timed out in 30131ms, After SMT, problems are : Problem set: 1 solved, 346 unsolved
Search for dead transitions found 1 dead transitions in 30132ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 402/433 places, 347/379 transitions.
Applied a total of 0 rules in 14 ms. Remains 402 /402 variables (removed 0) and now considering 347/347 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31582 ms. Remains : 402/433 places, 347/379 transitions.
[2025-05-30 00:59:53] [INFO ] Flatten gal took : 24 ms
[2025-05-30 00:59:53] [INFO ] Flatten gal took : 19 ms
[2025-05-30 00:59:53] [INFO ] Input system was already deterministic with 347 transitions.
[2025-05-30 00:59:53] [INFO ] Flatten gal took : 19 ms
[2025-05-30 00:59:53] [INFO ] Flatten gal took : 19 ms
[2025-05-30 00:59:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality15367233910871254555.gal : 4 ms
[2025-05-30 00:59:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality14257534825795156627.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15367233910871254555.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14257534825795156627.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-30 01:00:23] [INFO ] Flatten gal took : 12 ms
[2025-05-30 01:00:23] [INFO ] Applying decomposition
[2025-05-30 01:00:23] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9468303161883995806.txt' '-o' '/tmp/graph9468303161883995806.bin' '-w' '/tmp/graph9468303161883995806.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9468303161883995806.bin' '-l' '-1' '-v' '-w' '/tmp/graph9468303161883995806.weights' '-q' '0' '-e' '0.001'
[2025-05-30 01:00:23] [INFO ] Decomposing Gal with order
[2025-05-30 01:00:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 01:00:23] [INFO ] Removed a total of 212 redundant transitions.
[2025-05-30 01:00:23] [INFO ] Flatten gal took : 27 ms
[2025-05-30 01:00:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 9 ms.
[2025-05-30 01:00:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality6674552099335460874.gal : 6 ms
[2025-05-30 01:00:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality11821285932568967958.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6674552099335460874.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11821285932568967958.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.90271e+24,17.2888,319668,6834,37,536020,541,1007,1.14058e+06,52,1435,0
Converting to forward existential form...Done !
original formula: EF((!(E(!(AX((i17.i1.u62.p188==1))) U EF((i16.u108.p403!=1)))) * ((i17.i2.u127.p506==0)||(i12.i1.u89.p275==1))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * ((i17.i2.u127.p506==0)||(i12.i1.u89.p275==1))) * !(E(!(!(EX(!((i17.i1.u62.p188==1))))) U E(...194
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t7, t8, t9, t10, t141, t145, t163, t187, t211, t232, t308, t310, t312, t314, t315, t3...1178
(forward)formula 0,0,27.67,331188,1,0,591712,541,6043,1.27215e+06,231,1435,1258403
FORMULA BusinessProcesses-PT-10-CTLCardinality-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 379/379 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 410 transition count 356
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 410 transition count 356
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 56 place count 400 transition count 346
Iterating global reduction 0 with 10 rules applied. Total rules applied 66 place count 400 transition count 346
Applied a total of 66 rules in 27 ms. Remains 400 /433 variables (removed 33) and now considering 346/379 (removed 33) transitions.
// Phase 1: matrix 346 rows 400 cols
[2025-05-30 01:00:51] [INFO ] Computed 84 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:00:51] [INFO ] Implicit Places using invariants in 336 ms returned []
[2025-05-30 01:00:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:00:52] [INFO ] Implicit Places using invariants and state equation in 1042 ms returned []
Implicit Place search using SMT with State Equation took 1381 ms to find 0 implicit places.
Running 345 sub problems to find dead transitions.
[2025-05-30 01:00:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/399 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/399 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 2 (OVERLAPS) 1/400 variables, 47/82 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 345 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:11] [INFO ] Deduced a trap composed of 47 places in 319 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:11] [INFO ] Deduced a trap composed of 66 places in 340 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:12] [INFO ] Deduced a trap composed of 66 places in 315 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:12] [INFO ] Deduced a trap composed of 67 places in 313 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:12] [INFO ] Deduced a trap composed of 62 places in 330 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:13] [INFO ] Deduced a trap composed of 62 places in 315 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:13] [INFO ] Deduced a trap composed of 62 places in 295 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:13] [INFO ] Deduced a trap composed of 67 places in 317 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:14] [INFO ] Deduced a trap composed of 67 places in 283 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:14] [INFO ] Deduced a trap composed of 68 places in 295 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:14] [INFO ] Deduced a trap composed of 31 places in 303 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:15] [INFO ] Deduced a trap composed of 31 places in 277 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:15] [INFO ] Deduced a trap composed of 68 places in 309 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:15] [INFO ] Deduced a trap composed of 68 places in 269 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:16] [INFO ] Deduced a trap composed of 68 places in 232 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:16] [INFO ] Deduced a trap composed of 68 places in 229 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:16] [INFO ] Deduced a trap composed of 66 places in 268 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:17] [INFO ] Deduced a trap composed of 67 places in 302 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:17] [INFO ] Deduced a trap composed of 67 places in 324 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:18] [INFO ] Deduced a trap composed of 66 places in 340 ms of which 66 ms to minimize.
Problem TDEAD283 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 20/104 constraints. Problems are: Problem set: 1 solved, 344 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:18] [INFO ] Deduced a trap composed of 47 places in 253 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:19] [INFO ] Deduced a trap composed of 31 places in 314 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:20] [INFO ] Deduced a trap composed of 47 places in 310 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:20] [INFO ] Deduced a trap composed of 66 places in 315 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:20] [INFO ] Deduced a trap composed of 61 places in 326 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:21] [INFO ] Deduced a trap composed of 10 places in 247 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:21] [INFO ] Deduced a trap composed of 20 places in 265 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:21] [INFO ] Deduced a trap composed of 28 places in 332 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:22] [INFO ] Deduced a trap composed of 29 places in 311 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:22] [INFO ] Deduced a trap composed of 58 places in 292 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:22] [INFO ] Deduced a trap composed of 47 places in 271 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:23] [INFO ] Deduced a trap composed of 60 places in 259 ms of which 53 ms to minimize.
SMT process timed out in 30193ms, After SMT, problems are : Problem set: 1 solved, 344 unsolved
Search for dead transitions found 1 dead transitions in 30197ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 400/433 places, 345/379 transitions.
Applied a total of 0 rules in 14 ms. Remains 400 /400 variables (removed 0) and now considering 345/345 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31622 ms. Remains : 400/433 places, 345/379 transitions.
[2025-05-30 01:01:23] [INFO ] Flatten gal took : 16 ms
[2025-05-30 01:01:23] [INFO ] Flatten gal took : 16 ms
[2025-05-30 01:01:23] [INFO ] Input system was already deterministic with 345 transitions.
[2025-05-30 01:01:23] [INFO ] Flatten gal took : 14 ms
[2025-05-30 01:01:23] [INFO ] Flatten gal took : 25 ms
[2025-05-30 01:01:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality13835545123071532170.gal : 3 ms
[2025-05-30 01:01:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality16870511923679144719.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13835545123071532170.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16870511923679144719.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-30 01:01:53] [INFO ] Flatten gal took : 11 ms
[2025-05-30 01:01:53] [INFO ] Applying decomposition
[2025-05-30 01:01:53] [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.202505121319/bin/convert-linux64' '-i' '/tmp/graph15225042035477853011.txt' '-o' '/tmp/graph15225042035477853011.bin' '-w' '/tmp/graph15225042035477853011.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15225042035477853011.bin' '-l' '-1' '-v' '-w' '/tmp/graph15225042035477853011.weights' '-q' '0' '-e' '0.001'
[2025-05-30 01:01:53] [INFO ] Decomposing Gal with order
[2025-05-30 01:01:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 01:01:53] [INFO ] Removed a total of 209 redundant transitions.
[2025-05-30 01:01:53] [INFO ] Flatten gal took : 40 ms
[2025-05-30 01:01:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 9 ms.
[2025-05-30 01:01:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality9914179635863334631.gal : 6 ms
[2025-05-30 01:01:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality17487788795214443856.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9914179635863334631.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17487788795214443856.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.87567e+24,19.9119,389776,5122,46,512325,489,974,2.16178e+06,59,1160,0
Converting to forward existential form...Done !
original formula: EX(EF((EF((i5.i1.u98.p328==0)) * AF((i7.i3.u114.p487==1)))))
=> equivalent forward existential formula: [((FwdU(EY(Init),TRUE) * E(TRUE U (i5.i1.u98.p328==0))) * !(EG(!((i7.i3.u114.p487==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t7, t8, t9, t10, t143, t185, t209, t218, t226, t230, t306, t308, t310, t312, t313...1149
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 379/379 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 410 transition count 356
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 410 transition count 356
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 56 place count 400 transition count 346
Iterating global reduction 0 with 10 rules applied. Total rules applied 66 place count 400 transition count 346
Applied a total of 66 rules in 28 ms. Remains 400 /433 variables (removed 33) and now considering 346/379 (removed 33) transitions.
[2025-05-30 01:02:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:02:23] [INFO ] Implicit Places using invariants in 460 ms returned []
[2025-05-30 01:02:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:02:24] [INFO ] Implicit Places using invariants and state equation in 918 ms returned []
Implicit Place search using SMT with State Equation took 1380 ms to find 0 implicit places.
Running 345 sub problems to find dead transitions.
[2025-05-30 01:02:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/399 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/399 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 2 (OVERLAPS) 1/400 variables, 47/82 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 345 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:43] [INFO ] Deduced a trap composed of 47 places in 313 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:43] [INFO ] Deduced a trap composed of 66 places in 328 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:44] [INFO ] Deduced a trap composed of 66 places in 316 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:44] [INFO ] Deduced a trap composed of 67 places in 328 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:44] [INFO ] Deduced a trap composed of 62 places in 315 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:45] [INFO ] Deduced a trap composed of 62 places in 305 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:45] [INFO ] Deduced a trap composed of 62 places in 265 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:45] [INFO ] Deduced a trap composed of 67 places in 288 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:45] [INFO ] Deduced a trap composed of 67 places in 249 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:46] [INFO ] Deduced a trap composed of 68 places in 277 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:46] [INFO ] Deduced a trap composed of 31 places in 297 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:47] [INFO ] Deduced a trap composed of 31 places in 289 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:47] [INFO ] Deduced a trap composed of 68 places in 296 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:47] [INFO ] Deduced a trap composed of 68 places in 274 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:47] [INFO ] Deduced a trap composed of 68 places in 235 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:48] [INFO ] Deduced a trap composed of 68 places in 269 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:48] [INFO ] Deduced a trap composed of 66 places in 280 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:49] [INFO ] Deduced a trap composed of 67 places in 313 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:49] [INFO ] Deduced a trap composed of 67 places in 323 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:49] [INFO ] Deduced a trap composed of 66 places in 341 ms of which 64 ms to minimize.
Problem TDEAD283 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 20/104 constraints. Problems are: Problem set: 1 solved, 344 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:50] [INFO ] Deduced a trap composed of 47 places in 242 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:51] [INFO ] Deduced a trap composed of 31 places in 294 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:51] [INFO ] Deduced a trap composed of 47 places in 327 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:52] [INFO ] Deduced a trap composed of 66 places in 329 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:52] [INFO ] Deduced a trap composed of 61 places in 324 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:53] [INFO ] Deduced a trap composed of 10 places in 261 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:53] [INFO ] Deduced a trap composed of 20 places in 245 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:53] [INFO ] Deduced a trap composed of 28 places in 332 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:54] [INFO ] Deduced a trap composed of 29 places in 323 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:54] [INFO ] Deduced a trap composed of 58 places in 318 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:54] [INFO ] Deduced a trap composed of 47 places in 270 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:54] [INFO ] Deduced a trap composed of 60 places in 286 ms of which 53 ms to minimize.
SMT process timed out in 30100ms, After SMT, problems are : Problem set: 1 solved, 344 unsolved
Search for dead transitions found 1 dead transitions in 30101ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 400/433 places, 345/379 transitions.
Applied a total of 0 rules in 19 ms. Remains 400 /400 variables (removed 0) and now considering 345/345 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31534 ms. Remains : 400/433 places, 345/379 transitions.
[2025-05-30 01:02:55] [INFO ] Flatten gal took : 14 ms
[2025-05-30 01:02:55] [INFO ] Flatten gal took : 14 ms
[2025-05-30 01:02:55] [INFO ] Input system was already deterministic with 345 transitions.
[2025-05-30 01:02:55] [INFO ] Flatten gal took : 14 ms
[2025-05-30 01:02:55] [INFO ] Flatten gal took : 15 ms
[2025-05-30 01:02:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality13946851120916692936.gal : 3 ms
[2025-05-30 01:02:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality9660820409459134100.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13946851120916692936.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9660820409459134100.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-30 01:03:25] [INFO ] Flatten gal took : 9 ms
[2025-05-30 01:03:25] [INFO ] Applying decomposition
[2025-05-30 01:03:25] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2100278504973483454.txt' '-o' '/tmp/graph2100278504973483454.bin' '-w' '/tmp/graph2100278504973483454.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2100278504973483454.bin' '-l' '-1' '-v' '-w' '/tmp/graph2100278504973483454.weights' '-q' '0' '-e' '0.001'
[2025-05-30 01:03:25] [INFO ] Decomposing Gal with order
[2025-05-30 01:03:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 01:03:25] [INFO ] Removed a total of 209 redundant transitions.
[2025-05-30 01:03:25] [INFO ] Flatten gal took : 22 ms
[2025-05-30 01:03:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 8 ms.
[2025-05-30 01:03:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality2965381125272945779.gal : 5 ms
[2025-05-30 01:03:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality10800225359886355739.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2965381125272945779.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10800225359886355739.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 379/379 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 411 transition count 357
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 411 transition count 357
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 54 place count 401 transition count 347
Iterating global reduction 0 with 10 rules applied. Total rules applied 64 place count 401 transition count 347
Applied a total of 64 rules in 27 ms. Remains 401 /433 variables (removed 32) and now considering 347/379 (removed 32) transitions.
// Phase 1: matrix 347 rows 401 cols
[2025-05-30 01:03:55] [INFO ] Computed 84 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:03:55] [INFO ] Implicit Places using invariants in 449 ms returned []
[2025-05-30 01:03:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:03:56] [INFO ] Implicit Places using invariants and state equation in 1109 ms returned []
Implicit Place search using SMT with State Equation took 1560 ms to find 0 implicit places.
Running 346 sub problems to find dead transitions.
[2025-05-30 01:03:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 2 (OVERLAPS) 1/401 variables, 45/80 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 346 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:15] [INFO ] Deduced a trap composed of 47 places in 309 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:16] [INFO ] Deduced a trap composed of 47 places in 303 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:16] [INFO ] Deduced a trap composed of 47 places in 297 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:16] [INFO ] Deduced a trap composed of 66 places in 325 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:17] [INFO ] Deduced a trap composed of 47 places in 305 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:17] [INFO ] Deduced a trap composed of 48 places in 291 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:17] [INFO ] Deduced a trap composed of 48 places in 270 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:18] [INFO ] Deduced a trap composed of 68 places in 291 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:18] [INFO ] Deduced a trap composed of 68 places in 316 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:18] [INFO ] Deduced a trap composed of 68 places in 302 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:19] [INFO ] Deduced a trap composed of 68 places in 298 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:19] [INFO ] Deduced a trap composed of 30 places in 305 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:19] [INFO ] Deduced a trap composed of 31 places in 302 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:20] [INFO ] Deduced a trap composed of 31 places in 297 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:20] [INFO ] Deduced a trap composed of 68 places in 322 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:20] [INFO ] Deduced a trap composed of 61 places in 405 ms of which 152 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:21] [INFO ] Deduced a trap composed of 61 places in 299 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:21] [INFO ] Deduced a trap composed of 63 places in 354 ms of which 142 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:22] [INFO ] Deduced a trap composed of 27 places in 293 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:22] [INFO ] Deduced a trap composed of 48 places in 316 ms of which 58 ms to minimize.
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD298 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 20/104 constraints. Problems are: Problem set: 11 solved, 335 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:23] [INFO ] Deduced a trap composed of 66 places in 294 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:23] [INFO ] Deduced a trap composed of 62 places in 316 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:23] [INFO ] Deduced a trap composed of 62 places in 335 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:24] [INFO ] Deduced a trap composed of 67 places in 438 ms of which 188 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:24] [INFO ] Deduced a trap composed of 68 places in 323 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:25] [INFO ] Deduced a trap composed of 68 places in 536 ms of which 290 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:25] [INFO ] Deduced a trap composed of 68 places in 295 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:25] [INFO ] Deduced a trap composed of 68 places in 342 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:26] [INFO ] Deduced a trap composed of 66 places in 322 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:26] [INFO ] Deduced a trap composed of 67 places in 318 ms of which 62 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 401/748 variables, and 114 constraints, problems are : Problem set: 11 solved, 335 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/401 constraints, PredecessorRefiner: 346/346 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 335 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 35/35 constraints. Problems are: Problem set: 11 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/35 constraints. Problems are: Problem set: 11 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 1/401 variables, 45/80 constraints. Problems are: Problem set: 11 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 4/84 constraints. Problems are: Problem set: 11 solved, 335 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 30/114 constraints. Problems are: Problem set: 11 solved, 335 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:33] [INFO ] Deduced a trap composed of 68 places in 302 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:33] [INFO ] Deduced a trap composed of 68 places in 297 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:33] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:33] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:34] [INFO ] Deduced a trap composed of 48 places in 312 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:34] [INFO ] Deduced a trap composed of 47 places in 327 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:35] [INFO ] Deduced a trap composed of 61 places in 329 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:35] [INFO ] Deduced a trap composed of 66 places in 345 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:35] [INFO ] Deduced a trap composed of 18 places in 252 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:36] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:36] [INFO ] Deduced a trap composed of 71 places in 325 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:37] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:37] [INFO ] Deduced a trap composed of 27 places in 316 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:38] [INFO ] Deduced a trap composed of 30 places in 318 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:38] [INFO ] Deduced a trap composed of 33 places in 296 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:39] [INFO ] Deduced a trap composed of 39 places in 302 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:39] [INFO ] Deduced a trap composed of 15 places in 234 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:39] [INFO ] Deduced a trap composed of 30 places in 297 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:40] [INFO ] Deduced a trap composed of 34 places in 339 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:40] [INFO ] Deduced a trap composed of 31 places in 350 ms of which 44 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 20/134 constraints. Problems are: Problem set: 11 solved, 335 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:41] [INFO ] Deduced a trap composed of 67 places in 338 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:42] [INFO ] Deduced a trap composed of 66 places in 425 ms of which 154 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:42] [INFO ] Deduced a trap composed of 29 places in 263 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:43] [INFO ] Deduced a trap composed of 59 places in 292 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:43] [INFO ] Deduced a trap composed of 60 places in 289 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:44] [INFO ] Deduced a trap composed of 61 places in 278 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:44] [INFO ] Deduced a trap composed of 62 places in 287 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:44] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:45] [INFO ] Deduced a trap composed of 62 places in 292 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:45] [INFO ] Deduced a trap composed of 34 places in 368 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:46] [INFO ] Deduced a trap composed of 65 places in 356 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:46] [INFO ] Deduced a trap composed of 31 places in 303 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:47] [INFO ] Deduced a trap composed of 31 places in 298 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:47] [INFO ] Deduced a trap composed of 62 places in 419 ms of which 154 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:48] [INFO ] Deduced a trap composed of 19 places in 200 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:48] [INFO ] Deduced a trap composed of 18 places in 183 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:48] [INFO ] Deduced a trap composed of 19 places in 183 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:48] [INFO ] Deduced a trap composed of 22 places in 179 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:49] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:49] [INFO ] Deduced a trap composed of 24 places in 175 ms of which 13 ms to minimize.
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD269 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 20/154 constraints. Problems are: Problem set: 15 solved, 331 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:51] [INFO ] Deduced a trap composed of 62 places in 302 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:51] [INFO ] Deduced a trap composed of 62 places in 339 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:52] [INFO ] Deduced a trap composed of 62 places in 309 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:52] [INFO ] Deduced a trap composed of 63 places in 294 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:52] [INFO ] Deduced a trap composed of 64 places in 314 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:54] [INFO ] Deduced a trap composed of 52 places in 391 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:54] [INFO ] Deduced a trap composed of 24 places in 171 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:54] [INFO ] Deduced a trap composed of 26 places in 152 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:54] [INFO ] Deduced a trap composed of 26 places in 161 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:55] [INFO ] Deduced a trap composed of 15 places in 328 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:55] [INFO ] Deduced a trap composed of 49 places in 348 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:56] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:56] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:56] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:56] [INFO ] Deduced a trap composed of 47 places in 237 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:57] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 401/748 variables, and 170 constraints, problems are : Problem set: 15 solved, 331 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/401 constraints, PredecessorRefiner: 0/346 constraints, Known Traps: 86/86 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60115ms problems are : Problem set: 15 solved, 331 unsolved
Search for dead transitions found 15 dead transitions in 60118ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 401/433 places, 332/379 transitions.
Applied a total of 0 rules in 15 ms. Remains 401 /401 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61724 ms. Remains : 401/433 places, 332/379 transitions.
[2025-05-30 01:04:57] [INFO ] Flatten gal took : 14 ms
[2025-05-30 01:04:57] [INFO ] Flatten gal took : 13 ms
[2025-05-30 01:04:57] [INFO ] Input system was already deterministic with 332 transitions.
[2025-05-30 01:04:57] [INFO ] Flatten gal took : 13 ms
[2025-05-30 01:04:57] [INFO ] Flatten gal took : 13 ms
[2025-05-30 01:04:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality12126758252595241031.gal : 3 ms
[2025-05-30 01:04:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality2135596748554267708.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12126758252595241031.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2135596748554267708.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-30 01:05:27] [INFO ] Flatten gal took : 8 ms
[2025-05-30 01:05:27] [INFO ] Applying decomposition
[2025-05-30 01:05:27] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17202035122536963185.txt' '-o' '/tmp/graph17202035122536963185.bin' '-w' '/tmp/graph17202035122536963185.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17202035122536963185.bin' '-l' '-1' '-v' '-w' '/tmp/graph17202035122536963185.weights' '-q' '0' '-e' '0.001'
[2025-05-30 01:05:27] [INFO ] Decomposing Gal with order
[2025-05-30 01:05:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 01:05:27] [INFO ] Removed a total of 150 redundant transitions.
[2025-05-30 01:05:27] [INFO ] Flatten gal took : 22 ms
[2025-05-30 01:05:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-05-30 01:05:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality14072477191379540288.gal : 6 ms
[2025-05-30 01:05:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality18312731389229034018.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14072477191379540288.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18312731389229034018.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 379/379 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 412 transition count 358
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 412 transition count 358
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 52 place count 402 transition count 348
Iterating global reduction 0 with 10 rules applied. Total rules applied 62 place count 402 transition count 348
Applied a total of 62 rules in 29 ms. Remains 402 /433 variables (removed 31) and now considering 348/379 (removed 31) transitions.
// Phase 1: matrix 348 rows 402 cols
[2025-05-30 01:05:57] [INFO ] Computed 84 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:05:57] [INFO ] Implicit Places using invariants in 370 ms returned []
[2025-05-30 01:05:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:05:58] [INFO ] Implicit Places using invariants and state equation in 1135 ms returned []
Implicit Place search using SMT with State Equation took 1507 ms to find 0 implicit places.
Running 347 sub problems to find dead transitions.
[2025-05-30 01:05:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 2 (OVERLAPS) 1/402 variables, 43/78 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 6/84 constraints. Problems are: Problem set: 0 solved, 347 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:06:17] [INFO ] Deduced a trap composed of 48 places in 309 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:06:17] [INFO ] Deduced a trap composed of 48 places in 306 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:06:17] [INFO ] Deduced a trap composed of 67 places in 308 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:06:17] [INFO ] Deduced a trap composed of 65 places in 288 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:06:18] [INFO ] Deduced a trap composed of 67 places in 276 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:06:18] [INFO ] Deduced a trap composed of 67 places in 266 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:06:18] [INFO ] Deduced a trap composed of 69 places in 260 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:06:19] [INFO ] Deduced a trap composed of 69 places in 249 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:06:19] [INFO ] Deduced a trap composed of 69 places in 278 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:06:19] [INFO ] Deduced a trap composed of 69 places in 291 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:06:20] [INFO ] Deduced a trap composed of 69 places in 348 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:06:20] [INFO ] Deduced a trap composed of 69 places in 814 ms of which 579 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:06:20] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:06:22] [INFO ] Deduced a trap composed of 69 places in 1413 ms of which 1182 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:06:22] [INFO ] Deduced a trap composed of 69 places in 192 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:06:22] [INFO ] Deduced a trap composed of 69 places in 308 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:06:23] [INFO ] Deduced a trap composed of 69 places in 487 ms of which 249 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:06:23] [INFO ] Deduced a trap composed of 69 places in 287 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:06:24] [INFO ] Deduced a trap composed of 69 places in 656 ms of which 433 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:06:24] [INFO ] Deduced a trap composed of 67 places in 319 ms of which 68 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/402 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 347 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:06:25] [INFO ] Deduced a trap composed of 48 places in 313 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:06:26] [INFO ] Deduced a trap composed of 48 places in 312 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:06:26] [INFO ] Deduced a trap composed of 67 places in 314 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:06:26] [INFO ] Deduced a trap composed of 62 places in 339 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:06:27] [INFO ] Deduced a trap composed of 69 places in 297 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:06:27] [INFO ] Deduced a trap composed of 31 places in 293 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:06:28] [INFO ] Deduced a trap composed of 70 places in 396 ms of which 163 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:06:28] [INFO ] Deduced a trap composed of 70 places in 303 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:06:28] [INFO ] Deduced a trap composed of 70 places in 391 ms of which 157 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:06:29] [INFO ] Deduced a trap composed of 70 places in 287 ms of which 64 ms to minimize.
SMT process timed out in 30169ms, After SMT, problems are : Problem set: 0 solved, 347 unsolved
Search for dead transitions found 0 dead transitions in 30171ms
Starting structural reductions in LTL mode, iteration 1 : 402/433 places, 348/379 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31708 ms. Remains : 402/433 places, 348/379 transitions.
[2025-05-30 01:06:29] [INFO ] Flatten gal took : 12 ms
[2025-05-30 01:06:29] [INFO ] Flatten gal took : 12 ms
[2025-05-30 01:06:29] [INFO ] Input system was already deterministic with 348 transitions.
[2025-05-30 01:06:29] [INFO ] Flatten gal took : 12 ms
[2025-05-30 01:06:29] [INFO ] Flatten gal took : 13 ms
[2025-05-30 01:06:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality12192902533393022157.gal : 3 ms
[2025-05-30 01:06:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality7049727634816308368.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12192902533393022157.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7049727634816308368.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-30 01:06:59] [INFO ] Flatten gal took : 9 ms
[2025-05-30 01:06:59] [INFO ] Applying decomposition
[2025-05-30 01:06:59] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8763976992178397111.txt' '-o' '/tmp/graph8763976992178397111.bin' '-w' '/tmp/graph8763976992178397111.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8763976992178397111.bin' '-l' '-1' '-v' '-w' '/tmp/graph8763976992178397111.weights' '-q' '0' '-e' '0.001'
[2025-05-30 01:06:59] [INFO ] Decomposing Gal with order
[2025-05-30 01:06:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 01:06:59] [INFO ] Removed a total of 218 redundant transitions.
[2025-05-30 01:06:59] [INFO ] Flatten gal took : 21 ms
[2025-05-30 01:06:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2025-05-30 01:06:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality11667468824043007021.gal : 6 ms
[2025-05-30 01:06:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality6044084803045580866.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11667468824043007021.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6044084803045580866.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.90934e+24,13.7373,265864,5928,41,313580,466,986,2.00212e+06,48,1213,0
Converting to forward existential form...Done !
original formula: AG(E(AG(!(((i17.u117.p413==1)&&(i14.i2.u97.p317==1)))) U EF(EX((i4.i1.u80.p233==0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(!(E(TRUE U !(!(((i17.u117.p413==1)&&(i14.i2.u97.p317==1)))))) U E(TRUE U EX((i4.i1.u80.p...176
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t7, t8, t9, t10, t141, t145, t187, t211, t232, t309, t311, t313, t315, t316, t317...1137
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 379/379 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 410 transition count 356
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 410 transition count 356
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 56 place count 400 transition count 346
Iterating global reduction 0 with 10 rules applied. Total rules applied 66 place count 400 transition count 346
Applied a total of 66 rules in 29 ms. Remains 400 /433 variables (removed 33) and now considering 346/379 (removed 33) transitions.
// Phase 1: matrix 346 rows 400 cols
[2025-05-30 01:07:29] [INFO ] Computed 84 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:07:29] [INFO ] Implicit Places using invariants in 326 ms returned []
[2025-05-30 01:07:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:07:30] [INFO ] Implicit Places using invariants and state equation in 901 ms returned []
Implicit Place search using SMT with State Equation took 1229 ms to find 0 implicit places.
Running 345 sub problems to find dead transitions.
[2025-05-30 01:07:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/399 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/399 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 2 (OVERLAPS) 1/400 variables, 47/82 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 345 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:07:45] [INFO ] Deduced a trap composed of 47 places in 187 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:07:46] [INFO ] Deduced a trap composed of 66 places in 213 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:07:46] [INFO ] Deduced a trap composed of 66 places in 338 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:07:46] [INFO ] Deduced a trap composed of 67 places in 330 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:07:47] [INFO ] Deduced a trap composed of 62 places in 301 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:07:47] [INFO ] Deduced a trap composed of 62 places in 277 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:07:47] [INFO ] Deduced a trap composed of 62 places in 279 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:07:48] [INFO ] Deduced a trap composed of 67 places in 287 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:07:48] [INFO ] Deduced a trap composed of 67 places in 291 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:07:48] [INFO ] Deduced a trap composed of 68 places in 299 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:07:49] [INFO ] Deduced a trap composed of 31 places in 312 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:07:49] [INFO ] Deduced a trap composed of 31 places in 309 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:07:49] [INFO ] Deduced a trap composed of 68 places in 337 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:07:50] [INFO ] Deduced a trap composed of 68 places in 323 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:07:50] [INFO ] Deduced a trap composed of 68 places in 295 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:07:50] [INFO ] Deduced a trap composed of 68 places in 280 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:07:51] [INFO ] Deduced a trap composed of 66 places in 298 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:07:51] [INFO ] Deduced a trap composed of 67 places in 327 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:07:52] [INFO ] Deduced a trap composed of 67 places in 319 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:07:52] [INFO ] Deduced a trap composed of 66 places in 326 ms of which 64 ms to minimize.
Problem TDEAD283 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 20/104 constraints. Problems are: Problem set: 1 solved, 344 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:07:53] [INFO ] Deduced a trap composed of 47 places in 245 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:07:53] [INFO ] Deduced a trap composed of 31 places in 296 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:07:54] [INFO ] Deduced a trap composed of 47 places in 305 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:07:54] [INFO ] Deduced a trap composed of 66 places in 312 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:07:55] [INFO ] Deduced a trap composed of 61 places in 306 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:07:55] [INFO ] Deduced a trap composed of 10 places in 251 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:07:55] [INFO ] Deduced a trap composed of 20 places in 243 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:07:56] [INFO ] Deduced a trap composed of 28 places in 320 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:07:56] [INFO ] Deduced a trap composed of 29 places in 318 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:07:56] [INFO ] Deduced a trap composed of 58 places in 316 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:07:57] [INFO ] Deduced a trap composed of 47 places in 262 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:07:57] [INFO ] Deduced a trap composed of 60 places in 275 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:07:57] [INFO ] Deduced a trap composed of 61 places in 283 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:07:58] [INFO ] Deduced a trap composed of 47 places in 270 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:07:58] [INFO ] Deduced a trap composed of 61 places in 244 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:07:58] [INFO ] Deduced a trap composed of 28 places in 312 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:08:00] [INFO ] Deduced a trap composed of 12 places in 366 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:08:00] [INFO ] Deduced a trap composed of 20 places in 370 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:08:00] [INFO ] Deduced a trap composed of 25 places in 381 ms of which 41 ms to minimize.
SMT process timed out in 30270ms, After SMT, problems are : Problem set: 1 solved, 344 unsolved
Search for dead transitions found 1 dead transitions in 30272ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 400/433 places, 345/379 transitions.
Applied a total of 0 rules in 16 ms. Remains 400 /400 variables (removed 0) and now considering 345/345 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31547 ms. Remains : 400/433 places, 345/379 transitions.
[2025-05-30 01:08:00] [INFO ] Flatten gal took : 14 ms
[2025-05-30 01:08:00] [INFO ] Flatten gal took : 15 ms
[2025-05-30 01:08:01] [INFO ] Input system was already deterministic with 345 transitions.
[2025-05-30 01:08:01] [INFO ] Flatten gal took : 14 ms
[2025-05-30 01:08:01] [INFO ] Flatten gal took : 14 ms
[2025-05-30 01:08:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality4324607816784177711.gal : 3 ms
[2025-05-30 01:08:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality14363298721690886109.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4324607816784177711.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14363298721690886109.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-30 01:08:31] [INFO ] Flatten gal took : 8 ms
[2025-05-30 01:08:31] [INFO ] Applying decomposition
[2025-05-30 01:08:31] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8850610815532282806.txt' '-o' '/tmp/graph8850610815532282806.bin' '-w' '/tmp/graph8850610815532282806.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8850610815532282806.bin' '-l' '-1' '-v' '-w' '/tmp/graph8850610815532282806.weights' '-q' '0' '-e' '0.001'
[2025-05-30 01:08:31] [INFO ] Decomposing Gal with order
[2025-05-30 01:08:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 01:08:31] [INFO ] Removed a total of 215 redundant transitions.
[2025-05-30 01:08:31] [INFO ] Flatten gal took : 20 ms
[2025-05-30 01:08:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-05-30 01:08:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality10061354549874051024.gal : 5 ms
[2025-05-30 01:08:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality12979692638162086460.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10061354549874051024.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12979692638162086460.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 433/433 places, 379/379 transitions.
Graph (trivial) has 207 edges and 433 vertex of which 6 / 433 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 952 edges and 428 vertex of which 427 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 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 426 transition count 317
Reduce places removed 54 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 55 rules applied. Total rules applied 111 place count 372 transition count 316
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 112 place count 371 transition count 316
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 84 Pre rules applied. Total rules applied 112 place count 371 transition count 232
Deduced a syphon composed of 84 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 292 place count 275 transition count 232
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 313 place count 254 transition count 211
Iterating global reduction 3 with 21 rules applied. Total rules applied 334 place count 254 transition count 211
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 334 place count 254 transition count 210
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 336 place count 253 transition count 210
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Deduced a syphon composed of 96 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 197 rules applied. Total rules applied 533 place count 152 transition count 114
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 534 place count 151 transition count 113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 535 place count 150 transition count 113
Applied a total of 535 rules in 56 ms. Remains 150 /433 variables (removed 283) and now considering 113/379 (removed 266) transitions.
// Phase 1: matrix 113 rows 150 cols
[2025-05-30 01:09:01] [INFO ] Computed 66 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:09:01] [INFO ] Implicit Places using invariants in 269 ms returned [0, 1, 2, 5, 6, 7, 8, 22, 23, 24, 25, 26, 27, 50, 109]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 283 ms to find 15 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 135/433 places, 113/379 transitions.
Applied a total of 0 rules in 9 ms. Remains 135 /135 variables (removed 0) and now considering 113/113 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 348 ms. Remains : 135/433 places, 113/379 transitions.
[2025-05-30 01:09:01] [INFO ] Flatten gal took : 7 ms
[2025-05-30 01:09:01] [INFO ] Flatten gal took : 35 ms
[2025-05-30 01:09:01] [INFO ] Input system was already deterministic with 113 transitions.
[2025-05-30 01:09:01] [INFO ] Flatten gal took : 6 ms
[2025-05-30 01:09:01] [INFO ] Flatten gal took : 4 ms
[2025-05-30 01:09:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality13407605415335037300.gal : 1 ms
[2025-05-30 01:09:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality3414514317943866146.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13407605415335037300.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3414514317943866146.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.59346e+09,7.83378,166604,2,15433,5,689471,6,0,654,798223,0
Converting to forward existential form...Done !
original formula: AF(EG((AG((p43==0)) + ((p319!=0)&&(p395!=1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG((!(E(TRUE U !((p43==0)))) + ((p319!=0)&&(p395!=1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t12, t20, t24, t25, t26, t27, t51, t52, t53, t54, t55, t72, t73, t87, t88, t89, t90, t91, t92...306
Detected timeout of ITS tools.
[2025-05-30 01:09:31] [INFO ] Flatten gal took : 4 ms
[2025-05-30 01:09:31] [INFO ] Applying decomposition
[2025-05-30 01:09:31] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5738101951431833168.txt' '-o' '/tmp/graph5738101951431833168.bin' '-w' '/tmp/graph5738101951431833168.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5738101951431833168.bin' '-l' '-1' '-v' '-w' '/tmp/graph5738101951431833168.weights' '-q' '0' '-e' '0.001'
[2025-05-30 01:09:31] [INFO ] Decomposing Gal with order
[2025-05-30 01:09:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 01:09:31] [INFO ] Removed a total of 80 redundant transitions.
[2025-05-30 01:09:31] [INFO ] Flatten gal took : 10 ms
[2025-05-30 01:09:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 17 labels/synchronizations in 2 ms.
[2025-05-30 01:09:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality2379373231474599528.gal : 2 ms
[2025-05-30 01:09:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality4969431032386548087.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2379373231474599528.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4969431032386548087.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 379/379 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 418 transition count 364
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 418 transition count 364
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 36 place count 412 transition count 358
Iterating global reduction 0 with 6 rules applied. Total rules applied 42 place count 412 transition count 358
Applied a total of 42 rules in 30 ms. Remains 412 /433 variables (removed 21) and now considering 358/379 (removed 21) transitions.
// Phase 1: matrix 358 rows 412 cols
[2025-05-30 01:10:01] [INFO ] Computed 84 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:10:02] [INFO ] Implicit Places using invariants in 370 ms returned []
[2025-05-30 01:10:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:10:03] [INFO ] Implicit Places using invariants and state equation in 786 ms returned []
Implicit Place search using SMT with State Equation took 1157 ms to find 0 implicit places.
Running 357 sub problems to find dead transitions.
[2025-05-30 01:10:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/411 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 2 (OVERLAPS) 1/412 variables, 45/75 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 9/84 constraints. Problems are: Problem set: 0 solved, 357 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:16] [INFO ] Deduced a trap composed of 50 places in 317 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:16] [INFO ] Deduced a trap composed of 51 places in 307 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:16] [INFO ] Deduced a trap composed of 51 places in 303 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:17] [INFO ] Deduced a trap composed of 51 places in 316 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:17] [INFO ] Deduced a trap composed of 51 places in 307 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:18] [INFO ] Deduced a trap composed of 56 places in 315 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:18] [INFO ] Deduced a trap composed of 56 places in 332 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:18] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:18] [INFO ] Deduced a trap composed of 51 places in 322 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:19] [INFO ] Deduced a trap composed of 10 places in 271 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:19] [INFO ] Deduced a trap composed of 49 places in 304 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:20] [INFO ] Deduced a trap composed of 50 places in 303 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:20] [INFO ] Deduced a trap composed of 12 places in 265 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:20] [INFO ] Deduced a trap composed of 68 places in 173 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:20] [INFO ] Deduced a trap composed of 68 places in 181 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:21] [INFO ] Deduced a trap composed of 63 places in 169 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:21] [INFO ] Deduced a trap composed of 32 places in 147 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:21] [INFO ] Deduced a trap composed of 28 places in 214 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:21] [INFO ] Deduced a trap composed of 28 places in 213 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:21] [INFO ] Deduced a trap composed of 28 places in 213 ms of which 27 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/412 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 357 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:22] [INFO ] Deduced a trap composed of 50 places in 185 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:23] [INFO ] Deduced a trap composed of 69 places in 319 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:23] [INFO ] Deduced a trap composed of 69 places in 196 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:23] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:24] [INFO ] Deduced a trap composed of 18 places in 309 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:24] [INFO ] Deduced a trap composed of 26 places in 162 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:25] [INFO ] Deduced a trap composed of 26 places in 152 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:25] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:25] [INFO ] Deduced a trap composed of 36 places in 407 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:26] [INFO ] Deduced a trap composed of 50 places in 357 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:26] [INFO ] Deduced a trap composed of 34 places in 406 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:26] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:27] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:27] [INFO ] Deduced a trap composed of 9 places in 282 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:27] [INFO ] Deduced a trap composed of 51 places in 316 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:28] [INFO ] Deduced a trap composed of 27 places in 280 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:28] [INFO ] Deduced a trap composed of 50 places in 333 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:28] [INFO ] Deduced a trap composed of 50 places in 329 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:29] [INFO ] Deduced a trap composed of 50 places in 320 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:29] [INFO ] Deduced a trap composed of 50 places in 334 ms of which 59 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/412 variables, 20/124 constraints. Problems are: Problem set: 0 solved, 357 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:30] [INFO ] Deduced a trap composed of 50 places in 331 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:31] [INFO ] Deduced a trap composed of 55 places in 325 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:32] [INFO ] Deduced a trap composed of 70 places in 314 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:32] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:32] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:33] [INFO ] Deduced a trap composed of 29 places in 123 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 412/770 variables, and 130 constraints, problems are : Problem set: 0 solved, 357 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/412 constraints, PredecessorRefiner: 357/357 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 357 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/411 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 2 (OVERLAPS) 1/412 variables, 45/75 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 9/84 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/412 variables, 46/130 constraints. Problems are: Problem set: 0 solved, 357 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:39] [INFO ] Deduced a trap composed of 47 places in 269 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:40] [INFO ] Deduced a trap composed of 50 places in 304 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:40] [INFO ] Deduced a trap composed of 50 places in 277 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:40] [INFO ] Deduced a trap composed of 50 places in 287 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:40] [INFO ] Deduced a trap composed of 62 places in 313 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:41] [INFO ] Deduced a trap composed of 68 places in 388 ms of which 132 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:41] [INFO ] Deduced a trap composed of 62 places in 315 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:42] [INFO ] Deduced a trap composed of 68 places in 312 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:42] [INFO ] Deduced a trap composed of 68 places in 314 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:42] [INFO ] Deduced a trap composed of 68 places in 322 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:43] [INFO ] Deduced a trap composed of 68 places in 320 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:43] [INFO ] Deduced a trap composed of 62 places in 332 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:43] [INFO ] Deduced a trap composed of 68 places in 301 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:44] [INFO ] Deduced a trap composed of 68 places in 267 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:44] [INFO ] Deduced a trap composed of 66 places in 279 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:44] [INFO ] Deduced a trap composed of 64 places in 308 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:45] [INFO ] Deduced a trap composed of 68 places in 339 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:45] [INFO ] Deduced a trap composed of 68 places in 303 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:45] [INFO ] Deduced a trap composed of 63 places in 303 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:46] [INFO ] Deduced a trap composed of 67 places in 716 ms of which 446 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/412 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 357 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:47] [INFO ] Deduced a trap composed of 69 places in 233 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:47] [INFO ] Deduced a trap composed of 51 places in 313 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:47] [INFO ] Deduced a trap composed of 51 places in 312 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:48] [INFO ] Deduced a trap composed of 71 places in 308 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:48] [INFO ] Deduced a trap composed of 71 places in 314 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:48] [INFO ] Deduced a trap composed of 71 places in 305 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:49] [INFO ] Deduced a trap composed of 69 places in 332 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:49] [INFO ] Deduced a trap composed of 51 places in 337 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:49] [INFO ] Deduced a trap composed of 51 places in 347 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:50] [INFO ] Deduced a trap composed of 51 places in 318 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:50] [INFO ] Deduced a trap composed of 70 places in 326 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:50] [INFO ] Deduced a trap composed of 65 places in 331 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:51] [INFO ] Deduced a trap composed of 65 places in 344 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:51] [INFO ] Deduced a trap composed of 65 places in 335 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:52] [INFO ] Deduced a trap composed of 65 places in 339 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:52] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:52] [INFO ] Deduced a trap composed of 49 places in 325 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:53] [INFO ] Deduced a trap composed of 49 places in 330 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:53] [INFO ] Deduced a trap composed of 49 places in 314 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:53] [INFO ] Deduced a trap composed of 49 places in 312 ms of which 50 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 20/170 constraints. Problems are: Problem set: 0 solved, 357 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:54] [INFO ] Deduced a trap composed of 64 places in 345 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:55] [INFO ] Deduced a trap composed of 69 places in 340 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:55] [INFO ] Deduced a trap composed of 64 places in 304 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:55] [INFO ] Deduced a trap composed of 69 places in 311 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:56] [INFO ] Deduced a trap composed of 64 places in 385 ms of which 128 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:56] [INFO ] Deduced a trap composed of 69 places in 407 ms of which 148 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:57] [INFO ] Deduced a trap composed of 64 places in 330 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:57] [INFO ] Deduced a trap composed of 69 places in 330 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:57] [INFO ] Deduced a trap composed of 70 places in 331 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:58] [INFO ] Deduced a trap composed of 70 places in 326 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:58] [INFO ] Deduced a trap composed of 65 places in 316 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:58] [INFO ] Deduced a trap composed of 48 places in 298 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:59] [INFO ] Deduced a trap composed of 48 places in 284 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:59] [INFO ] Deduced a trap composed of 49 places in 285 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:10:59] [INFO ] Deduced a trap composed of 49 places in 293 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:11:00] [INFO ] Deduced a trap composed of 49 places in 288 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:11:00] [INFO ] Deduced a trap composed of 49 places in 283 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:11:00] [INFO ] Deduced a trap composed of 52 places in 303 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:11:01] [INFO ] Deduced a trap composed of 52 places in 291 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:11:01] [INFO ] Deduced a trap composed of 52 places in 293 ms of which 55 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/412 variables, 20/190 constraints. Problems are: Problem set: 0 solved, 357 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:11:02] [INFO ] Deduced a trap composed of 62 places in 274 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:11:02] [INFO ] Deduced a trap composed of 47 places in 316 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:11:03] [INFO ] Deduced a trap composed of 47 places in 324 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:11:03] [INFO ] Deduced a trap composed of 47 places in 302 ms of which 53 ms to minimize.
SMT process timed out in 60293ms, After SMT, problems are : Problem set: 0 solved, 357 unsolved
Search for dead transitions found 0 dead transitions in 60296ms
Starting structural reductions in LTL mode, iteration 1 : 412/433 places, 358/379 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61485 ms. Remains : 412/433 places, 358/379 transitions.
[2025-05-30 01:11:03] [INFO ] Flatten gal took : 14 ms
[2025-05-30 01:11:03] [INFO ] Flatten gal took : 14 ms
[2025-05-30 01:11:03] [INFO ] Input system was already deterministic with 358 transitions.
[2025-05-30 01:11:03] [INFO ] Flatten gal took : 14 ms
[2025-05-30 01:11:03] [INFO ] Flatten gal took : 14 ms
[2025-05-30 01:11:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality15217934419571067763.gal : 2 ms
[2025-05-30 01:11:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality13470085251634660183.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15217934419571067763.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13470085251634660183.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-30 01:11:33] [INFO ] Flatten gal took : 9 ms
[2025-05-30 01:11:33] [INFO ] Applying decomposition
[2025-05-30 01:11:33] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13360375654398721990.txt' '-o' '/tmp/graph13360375654398721990.bin' '-w' '/tmp/graph13360375654398721990.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13360375654398721990.bin' '-l' '-1' '-v' '-w' '/tmp/graph13360375654398721990.weights' '-q' '0' '-e' '0.001'
[2025-05-30 01:11:33] [INFO ] Decomposing Gal with order
[2025-05-30 01:11:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 01:11:33] [INFO ] Removed a total of 218 redundant transitions.
[2025-05-30 01:11:33] [INFO ] Flatten gal took : 21 ms
[2025-05-30 01:11:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-05-30 01:11:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality3985002639680834496.gal : 5 ms
[2025-05-30 01:11:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality15557527734896710237.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3985002639680834496.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15557527734896710237.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 379/379 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 411 transition count 357
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 411 transition count 357
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 53 place count 402 transition count 348
Iterating global reduction 0 with 9 rules applied. Total rules applied 62 place count 402 transition count 348
Applied a total of 62 rules in 26 ms. Remains 402 /433 variables (removed 31) and now considering 348/379 (removed 31) transitions.
// Phase 1: matrix 348 rows 402 cols
[2025-05-30 01:12:03] [INFO ] Computed 84 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:12:04] [INFO ] Implicit Places using invariants in 337 ms returned []
[2025-05-30 01:12:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:12:04] [INFO ] Implicit Places using invariants and state equation in 852 ms returned []
Implicit Place search using SMT with State Equation took 1191 ms to find 0 implicit places.
Running 347 sub problems to find dead transitions.
[2025-05-30 01:12:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 2 (OVERLAPS) 1/402 variables, 43/78 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 6/84 constraints. Problems are: Problem set: 0 solved, 347 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:16] [INFO ] Deduced a trap composed of 48 places in 184 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:17] [INFO ] Deduced a trap composed of 67 places in 175 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:17] [INFO ] Deduced a trap composed of 62 places in 209 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:17] [INFO ] Deduced a trap composed of 62 places in 232 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:17] [INFO ] Deduced a trap composed of 62 places in 333 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:18] [INFO ] Deduced a trap composed of 69 places in 287 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:18] [INFO ] Deduced a trap composed of 69 places in 162 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:18] [INFO ] Deduced a trap composed of 62 places in 206 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:18] [INFO ] Deduced a trap composed of 69 places in 186 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:19] [INFO ] Deduced a trap composed of 68 places in 315 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:19] [INFO ] Deduced a trap composed of 63 places in 284 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:20] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:20] [INFO ] Deduced a trap composed of 18 places in 145 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:20] [INFO ] Deduced a trap composed of 20 places in 140 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:20] [INFO ] Deduced a trap composed of 46 places in 186 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:20] [INFO ] Deduced a trap composed of 59 places in 193 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:21] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:21] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:21] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:22] [INFO ] Deduced a trap composed of 33 places in 302 ms of which 32 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/402 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 347 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:23] [INFO ] Deduced a trap composed of 48 places in 239 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:23] [INFO ] Deduced a trap composed of 63 places in 192 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:23] [INFO ] Deduced a trap composed of 48 places in 163 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:24] [INFO ] Deduced a trap composed of 27 places in 199 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:24] [INFO ] Deduced a trap composed of 28 places in 209 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:24] [INFO ] Deduced a trap composed of 60 places in 294 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:25] [INFO ] Deduced a trap composed of 60 places in 427 ms of which 134 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:25] [INFO ] Deduced a trap composed of 28 places in 250 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:25] [INFO ] Deduced a trap composed of 31 places in 232 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:26] [INFO ] Deduced a trap composed of 21 places in 142 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:26] [INFO ] Deduced a trap composed of 22 places in 179 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:27] [INFO ] Deduced a trap composed of 94 places in 347 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:27] [INFO ] Deduced a trap composed of 38 places in 290 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:28] [INFO ] Deduced a trap composed of 23 places in 345 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:28] [INFO ] Deduced a trap composed of 61 places in 276 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:28] [INFO ] Deduced a trap composed of 64 places in 250 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:29] [INFO ] Deduced a trap composed of 63 places in 267 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:29] [INFO ] Deduced a trap composed of 69 places in 297 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:29] [INFO ] Deduced a trap composed of 30 places in 340 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:30] [INFO ] Deduced a trap composed of 31 places in 329 ms of which 45 ms to minimize.
Problem TDEAD270 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 20/124 constraints. Problems are: Problem set: 7 solved, 340 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:31] [INFO ] Deduced a trap composed of 64 places in 337 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:31] [INFO ] Deduced a trap composed of 69 places in 310 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:31] [INFO ] Deduced a trap composed of 69 places in 308 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:32] [INFO ] Deduced a trap composed of 69 places in 304 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:32] [INFO ] Deduced a trap composed of 63 places in 248 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:33] [INFO ] Deduced a trap composed of 71 places in 316 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:33] [INFO ] Deduced a trap composed of 30 places in 291 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:34] [INFO ] Deduced a trap composed of 39 places in 305 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:12:34] [INFO ] Deduced a trap composed of 61 places in 320 ms of which 71 ms to minimize.
SMT process timed out in 30078ms, After SMT, problems are : Problem set: 7 solved, 340 unsolved
Search for dead transitions found 7 dead transitions in 30080ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) removed 7 transitions
Starting structural reductions in LTL mode, iteration 1 : 402/433 places, 341/379 transitions.
Applied a total of 0 rules in 15 ms. Remains 402 /402 variables (removed 0) and now considering 341/341 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31316 ms. Remains : 402/433 places, 341/379 transitions.
[2025-05-30 01:12:35] [INFO ] Flatten gal took : 14 ms
[2025-05-30 01:12:35] [INFO ] Flatten gal took : 14 ms
[2025-05-30 01:12:35] [INFO ] Input system was already deterministic with 341 transitions.
[2025-05-30 01:12:35] [INFO ] Flatten gal took : 14 ms
[2025-05-30 01:12:35] [INFO ] Flatten gal took : 15 ms
[2025-05-30 01:12:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality16248921559059410305.gal : 3 ms
[2025-05-30 01:12:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality17054366476365806279.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16248921559059410305.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17054366476365806279.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-30 01:13:05] [INFO ] Flatten gal took : 9 ms
[2025-05-30 01:13:05] [INFO ] Applying decomposition
[2025-05-30 01:13:05] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14680816090765073129.txt' '-o' '/tmp/graph14680816090765073129.bin' '-w' '/tmp/graph14680816090765073129.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14680816090765073129.bin' '-l' '-1' '-v' '-w' '/tmp/graph14680816090765073129.weights' '-q' '0' '-e' '0.001'
[2025-05-30 01:13:05] [INFO ] Decomposing Gal with order
[2025-05-30 01:13:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 01:13:05] [INFO ] Removed a total of 186 redundant transitions.
[2025-05-30 01:13:05] [INFO ] Flatten gal took : 18 ms
[2025-05-30 01:13:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2025-05-30 01:13:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality4604096168901671194.gal : 5 ms
[2025-05-30 01:13:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality16446319660766884268.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4604096168901671194.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16446319660766884268.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-30 01:13:35] [INFO ] Flatten gal took : 10 ms
[2025-05-30 01:13:35] [INFO ] Flatten gal took : 10 ms
[2025-05-30 01:13:35] [INFO ] Applying decomposition
[2025-05-30 01:13:35] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14889683544191428037.txt' '-o' '/tmp/graph14889683544191428037.bin' '-w' '/tmp/graph14889683544191428037.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14889683544191428037.bin' '-l' '-1' '-v' '-w' '/tmp/graph14889683544191428037.weights' '-q' '0' '-e' '0.001'
[2025-05-30 01:13:35] [INFO ] Decomposing Gal with order
[2025-05-30 01:13:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 01:13:35] [INFO ] Removed a total of 218 redundant transitions.
[2025-05-30 01:13:35] [INFO ] Flatten gal took : 20 ms
[2025-05-30 01:13:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-05-30 01:13:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality13284887571830105593.gal : 4 ms
[2025-05-30 01:13:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality9590130701568260467.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13284887571830105593.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9590130701568260467.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 10 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,9.77003e+24,38.6072,733324,23498,51,1.21472e+06,922,968,4.03428e+06,59,3684,0
Converting to forward existential form...Done !
original formula: EF(AX((EG((i15.u126.p402==1)) * EX(((i2.u44.p132==0)||(i15.u122.p392==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!((EG((i15.u126.p402==1)) * EX(((i2.u44.p132==0)||(i15.u122.p392==1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t10, t167, t171, t194, t214, t238, t247, t255, t340, t344, t346, t356, t360, t364...1249
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2025-05-30 01:16:23] [INFO ] Applying decomposition
[2025-05-30 01:16:23] [INFO ] Flatten gal took : 10 ms
[2025-05-30 01:16:23] [INFO ] Decomposing Gal with order
[2025-05-30 01:16:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 01:16:23] [INFO ] Removed a total of 108 redundant transitions.
[2025-05-30 01:16:23] [INFO ] Flatten gal took : 21 ms
[2025-05-30 01:16:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 19 ms.
[2025-05-30 01:16:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality1232568675996228589.gal : 8 ms
[2025-05-30 01:16:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality2597589781491620372.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1232568675996228589.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2597589781491620372.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 10 CTL formulae.
Detected timeout of ITS tools.
[2025-05-30 01:43:02] [INFO ] Flatten gal took : 302 ms
[2025-05-30 01:43:05] [INFO ] Input system was already deterministic with 379 transitions.
[2025-05-30 01:43:06] [INFO ] Transformed 433 places.
[2025-05-30 01:43:06] [INFO ] Transformed 379 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-05-30 01:43:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality1966985597689852600.gal : 15 ms
[2025-05-30 01:43:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality16822646833340559150.ctl : 12 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1966985597689852600.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16822646833340559150.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...329
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 10 CTL formulae.
BK_TIME_CONFINEMENT_REACHED
--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -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-10"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-10, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r030-smll-174853813300073"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-10.tgz
mv BusinessProcesses-PT-10 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;