Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r086-smll-174860102400369.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 FireWire-PT-17, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086-smll-174860102400369
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 153K 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 FireWire-PT-17-CTLCardinality-2024-12
FORMULA_NAME FireWire-PT-17-CTLCardinality-2024-13
FORMULA_NAME FireWire-PT-17-CTLCardinality-2024-14
FORMULA_NAME FireWire-PT-17-CTLCardinality-2024-15
FORMULA_NAME FireWire-PT-17-CTLCardinality-2025-00
FORMULA_NAME FireWire-PT-17-CTLCardinality-2025-01
FORMULA_NAME FireWire-PT-17-CTLCardinality-2025-02
FORMULA_NAME FireWire-PT-17-CTLCardinality-2025-03
FORMULA_NAME FireWire-PT-17-CTLCardinality-2025-04
FORMULA_NAME FireWire-PT-17-CTLCardinality-2025-05
FORMULA_NAME FireWire-PT-17-CTLCardinality-2025-06
FORMULA_NAME FireWire-PT-17-CTLCardinality-2025-07
FORMULA_NAME FireWire-PT-17-CTLCardinality-2025-08
FORMULA_NAME FireWire-PT-17-CTLCardinality-2025-09
FORMULA_NAME FireWire-PT-17-CTLCardinality-2025-10
FORMULA_NAME FireWire-PT-17-CTLCardinality-2025-11

=== Now, execution of the tool begins

BK_START 1748888726674

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-02 18:25:29] [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-06-02 18:25:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 18:25:29] [INFO ] Load time of PNML (sax parser for PT used): 238 ms
[2025-06-02 18:25:29] [INFO ] Transformed 428 places.
[2025-06-02 18:25:29] [INFO ] Transformed 656 transitions.
[2025-06-02 18:25:29] [INFO ] Found NUPN structural information;
[2025-06-02 18:25:29] [INFO ] Parsed PT model containing 428 places and 656 transitions and 1904 arcs in 609 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 38 ms.
Initial state reduction rules removed 1 formulas.
FORMULA FireWire-PT-17-CTLCardinality-2025-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 107 out of 428 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 428/428 places, 656/656 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 425 transition count 656
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 65 place count 363 transition count 594
Iterating global reduction 1 with 62 rules applied. Total rules applied 127 place count 363 transition count 594
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 136 place count 354 transition count 583
Iterating global reduction 1 with 9 rules applied. Total rules applied 145 place count 354 transition count 583
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 146 place count 354 transition count 582
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 147 place count 353 transition count 581
Iterating global reduction 2 with 1 rules applied. Total rules applied 148 place count 353 transition count 581
Applied a total of 148 rules in 197 ms. Remains 353 /428 variables (removed 75) and now considering 581/656 (removed 75) transitions.
// Phase 1: matrix 581 rows 353 cols
[2025-06-02 18:25:30] [INFO ] Computed 7 invariants in 48 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:25:31] [INFO ] Implicit Places using invariants in 924 ms returned []
[2025-06-02 18:25:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:25:32] [INFO ] Implicit Places using invariants and state equation in 1107 ms returned []
Implicit Place search using SMT with State Equation took 2116 ms to find 0 implicit places.
Running 580 sub problems to find dead transitions.
[2025-06-02 18:25:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/349 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 1 (OVERLAPS) 1/350 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 580 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:51] [INFO ] Deduced a trap composed of 80 places in 346 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:53] [INFO ] Deduced a trap composed of 100 places in 113 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:54] [INFO ] Deduced a trap composed of 83 places in 129 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:54] [INFO ] Deduced a trap composed of 87 places in 142 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:55] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:55] [INFO ] Deduced a trap composed of 94 places in 114 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:55] [INFO ] Deduced a trap composed of 97 places in 127 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:56] [INFO ] Deduced a trap composed of 93 places in 103 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:57] [INFO ] Deduced a trap composed of 63 places in 332 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:57] [INFO ] Deduced a trap composed of 66 places in 344 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:58] [INFO ] Deduced a trap composed of 65 places in 367 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:58] [INFO ] Deduced a trap composed of 83 places in 294 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:25:59] [INFO ] Deduced a trap composed of 76 places in 388 ms of which 57 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 350/934 variables, and 20 constraints, problems are : Problem set: 0 solved, 580 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/353 constraints, PredecessorRefiner: 580/580 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 580 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/349 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 1 (OVERLAPS) 1/350 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 580 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:11] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:19] [INFO ] Deduced a trap composed of 170 places in 345 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:19] [INFO ] Deduced a trap composed of 88 places in 158 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:19] [INFO ] Deduced a trap composed of 86 places in 130 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:20] [INFO ] Deduced a trap composed of 85 places in 123 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/350 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 580 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 350/934 variables, and 25 constraints, problems are : Problem set: 0 solved, 580 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/353 constraints, PredecessorRefiner: 0/580 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60676ms problems are : Problem set: 0 solved, 580 unsolved
Search for dead transitions found 0 dead transitions in 60714ms
Starting structural reductions in LTL mode, iteration 1 : 353/428 places, 581/656 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63073 ms. Remains : 353/428 places, 581/656 transitions.
Support contains 107 out of 353 places after structural reductions.
[2025-06-02 18:26:33] [INFO ] Flatten gal took : 153 ms
[2025-06-02 18:26:33] [INFO ] Flatten gal took : 87 ms
[2025-06-02 18:26:34] [INFO ] Input system was already deterministic with 581 transitions.
Support contains 104 out of 353 places (down from 107) after GAL structural reductions.
RANDOM walk for 40000 steps (14 resets) in 3350 ms. (11 steps per ms) remains 34/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
[2025-06-02 18:26:35] [INFO ] Invariant cache hit.
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/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 245/311 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (OVERLAPS) 549/860 variables, 311/318 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/860 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (OVERLAPS) 39/899 variables, 21/339 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/899 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (OVERLAPS) 20/919 variables, 12/351 constraints. Problems are: Problem set: 0 solved, 34 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:38] [INFO ] Deduced a trap composed of 88 places in 95 ms of which 14 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/919 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/919 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 10 (OVERLAPS) 10/929 variables, 6/358 constraints. Problems are: Problem set: 0 solved, 34 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 929/934 variables, and 358 constraints, problems are : Problem set: 0 solved, 34 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 350/353 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 245/311 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 34 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:41] [INFO ] Deduced a trap composed of 80 places in 339 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:41] [INFO ] Deduced a trap composed of 85 places in 426 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:42] [INFO ] Deduced a trap composed of 157 places in 411 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:42] [INFO ] Deduced a trap composed of 170 places in 384 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:43] [INFO ] Deduced a trap composed of 63 places in 535 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:43] [INFO ] Deduced a trap composed of 65 places in 398 ms of which 44 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 34 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:44] [INFO ] Deduced a trap composed of 101 places in 117 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 34 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 1)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 1)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 311/934 variables, and 15 constraints, problems are : Problem set: 0 solved, 34 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/353 constraints, PredecessorRefiner: 0/34 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10052ms problems are : Problem set: 0 solved, 34 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 66 out of 353 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 353/353 places, 581/581 transitions.
Graph (trivial) has 191 edges and 353 vertex of which 5 / 353 are part of one of the 1 SCC in 5 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 987 edges and 349 vertex of which 346 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 346 transition count 535
Reduce places removed 39 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 49 rules applied. Total rules applied 92 place count 307 transition count 525
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 102 place count 297 transition count 525
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 102 place count 297 transition count 512
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 128 place count 284 transition count 512
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 137 place count 275 transition count 502
Iterating global reduction 3 with 9 rules applied. Total rules applied 146 place count 275 transition count 502
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 146 place count 275 transition count 499
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 152 place count 272 transition count 499
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 2 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 228 place count 234 transition count 461
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 229 place count 233 transition count 441
Iterating global reduction 3 with 1 rules applied. Total rules applied 230 place count 233 transition count 441
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -62
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 264 place count 216 transition count 503
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 265 place count 216 transition count 502
Free-agglomeration rule applied 23 times.
Iterating global reduction 3 with 23 rules applied. Total rules applied 288 place count 216 transition count 479
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 311 place count 193 transition count 479
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 315 place count 193 transition count 475
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 316 place count 193 transition count 474
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 317 place count 192 transition count 474
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 319 place count 192 transition count 474
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 321 place count 192 transition count 474
Applied a total of 321 rules in 385 ms. Remains 192 /353 variables (removed 161) and now considering 474/581 (removed 107) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 386 ms. Remains : 192/353 places, 474/581 transitions.
RANDOM walk for 40000 steps (24 resets) in 878 ms. (45 steps per ms) remains 31/34 properties
BEST_FIRST walk for 4001 steps (20 resets) in 45 ms. (86 steps per ms) remains 30/31 properties
BEST_FIRST walk for 4001 steps (16 resets) in 29 ms. (133 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4001 steps (20 resets) in 21 ms. (181 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (13 resets) in 38 ms. (102 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4001 steps (13 resets) in 47 ms. (83 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (18 resets) in 39 ms. (100 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (17 resets) in 65 ms. (60 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4001 steps (17 resets) in 41 ms. (95 steps per ms) remains 29/30 properties
BEST_FIRST walk for 4002 steps (18 resets) in 47 ms. (83 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (13 resets) in 31 ms. (125 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (11 resets) in 37 ms. (105 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (17 resets) in 46 ms. (85 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (18 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (16 resets) in 32 ms. (121 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (13 resets) in 27 ms. (142 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (16 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (19 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (8 resets) in 28 ms. (137 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (12 resets) in 27 ms. (142 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (22 resets) in 19 ms. (200 steps per ms) remains 28/29 properties
BEST_FIRST walk for 4001 steps (12 resets) in 25 ms. (153 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (12 resets) in 82 ms. (48 steps per ms) remains 26/28 properties
BEST_FIRST walk for 4001 steps (13 resets) in 51 ms. (76 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (20 resets) in 45 ms. (86 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (21 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (12 resets) in 34 ms. (114 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (12 resets) in 34 ms. (114 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (20 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
[2025-06-02 18:26:46] [INFO ] Flow matrix only has 464 transitions (discarded 10 similar events)
// Phase 1: matrix 464 rows 192 cols
[2025-06-02 18:26:46] [INFO ] Computed 7 invariants in 6 ms
[2025-06-02 18:26:46] [INFO ] State equation strengthened by 30 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 126/180 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 462/642 variables, 180/187 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/642 variables, 30/217 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/642 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (OVERLAPS) 13/655 variables, 11/228 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/655 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (OVERLAPS) 1/656 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/656 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (OVERLAPS) 0/656 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 656/656 variables, and 229 constraints, problems are : Problem set: 0 solved, 26 unsolved in 2775 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 192/192 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 126/180 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 26 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:49] [INFO ] Deduced a trap composed of 43 places in 231 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:50] [INFO ] Deduced a trap composed of 51 places in 100 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:50] [INFO ] Deduced a trap composed of 46 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:50] [INFO ] Deduced a trap composed of 94 places in 238 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:50] [INFO ] Deduced a trap composed of 30 places in 299 ms of which 39 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 26 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:51] [INFO ] Deduced a trap composed of 57 places in 67 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 462/642 variables, 180/193 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 30/223 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/642 variables, 21/244 constraints. Problems are: Problem set: 0 solved, 26 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:53] [INFO ] Deduced a trap composed of 68 places in 253 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:26:53] [INFO ] Deduced a trap composed of 71 places in 209 ms of which 28 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/642 variables, 2/246 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/642 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (OVERLAPS) 13/655 variables, 11/257 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/655 variables, 5/262 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/655 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 13 (OVERLAPS) 1/656 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/656 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 15 (OVERLAPS) 0/656 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 656/656 variables, and 263 constraints, problems are : Problem set: 0 solved, 26 unsolved in 18335 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 192/192 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21133ms problems are : Problem set: 0 solved, 26 unsolved
Parikh walk visited 0 properties in 9634 ms.
Support contains 54 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 474/474 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 192 transition count 473
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 191 transition count 473
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 191 transition count 470
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 188 transition count 470
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 186 transition count 468
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 186 transition count 468
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 185 transition count 467
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 183 transition count 481
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 21 place count 183 transition count 478
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 183 transition count 476
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 25 place count 181 transition count 476
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 26 place count 181 transition count 476
Applied a total of 26 rules in 61 ms. Remains 181 /192 variables (removed 11) and now considering 476/474 (removed -2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 181/192 places, 476/474 transitions.
RANDOM walk for 40000 steps (21 resets) in 291 ms. (136 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (16 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (20 resets) in 28 ms. (137 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (16 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (25 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (18 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (14 resets) in 24 ms. (160 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (21 resets) in 24 ms. (160 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (16 resets) in 26 ms. (148 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (21 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (17 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (15 resets) in 35 ms. (111 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (16 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (20 resets) in 22 ms. (173 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (14 resets) in 12 ms. (307 steps per ms) remains 25/26 properties
BEST_FIRST walk for 4001 steps (20 resets) in 21 ms. (181 steps per ms) remains 24/25 properties
BEST_FIRST walk for 4000 steps (8 resets) in 47 ms. (83 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (23 resets) in 26 ms. (148 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (14 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (17 resets) in 22 ms. (173 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (8 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (15 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (18 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (16 resets) in 25 ms. (153 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (18 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
Interrupted probabilistic random walk after 280190 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :10 out of 24
Probabilistic random walk after 280190 steps, saw 69785 distinct states, run finished after 3015 ms. (steps per millisecond=92 ) properties seen :10
[2025-06-02 18:27:20] [INFO ] Flow matrix only has 468 transitions (discarded 8 similar events)
// Phase 1: matrix 468 rows 181 cols
[2025-06-02 18:27:20] [INFO ] Computed 7 invariants in 3 ms
[2025-06-02 18:27:20] [INFO ] State equation strengthened by 29 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 136/163 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 6/169 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 465/634 variables, 169/176 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/634 variables, 29/205 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/634 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 14/648 variables, 11/216 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/648 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 1/649 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:22] [INFO ] Deduced a trap composed of 27 places in 379 ms of which 45 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/649 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/649 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 0/649 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 649/649 variables, and 218 constraints, problems are : Problem set: 0 solved, 14 unsolved in 2297 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 181/181 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 136/163 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:23] [INFO ] Deduced a trap composed of 51 places in 92 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:23] [INFO ] Deduced a trap composed of 55 places in 113 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:23] [INFO ] Deduced a trap composed of 90 places in 252 ms of which 35 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 6/169 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 465/634 variables, 169/180 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/634 variables, 29/209 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/634 variables, 10/219 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/634 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 14/648 variables, 11/230 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/648 variables, 4/234 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:27] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/648 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (OVERLAPS) 1/649 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/649 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (OVERLAPS) 0/649 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 649/649 variables, and 236 constraints, problems are : Problem set: 0 solved, 14 unsolved in 8511 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 181/181 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10825ms problems are : Problem set: 0 solved, 14 unsolved
Parikh walk visited 1 properties in 7073 ms.
Support contains 25 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 476/476 transitions.
Graph (trivial) has 50 edges and 181 vertex of which 2 / 181 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 180 transition count 466
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 172 transition count 465
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 171 transition count 465
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 19 place count 171 transition count 460
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 29 place count 166 transition count 460
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 33 place count 162 transition count 416
Iterating global reduction 3 with 4 rules applied. Total rules applied 37 place count 162 transition count 416
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 38 place count 162 transition count 415
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 48 place count 157 transition count 410
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 56 place count 153 transition count 421
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 59 place count 153 transition count 418
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 63 place count 153 transition count 414
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 67 place count 149 transition count 414
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 71 place count 149 transition count 414
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 72 place count 148 transition count 412
Iterating global reduction 5 with 1 rules applied. Total rules applied 73 place count 148 transition count 412
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 74 place count 148 transition count 411
Applied a total of 74 rules in 63 ms. Remains 148 /181 variables (removed 33) and now considering 411/476 (removed 65) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 148/181 places, 411/476 transitions.
RANDOM walk for 40000 steps (24 resets) in 232 ms. (171 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (16 resets) in 217 ms. (183 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (14 resets) in 384 ms. (103 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (13 resets) in 346 ms. (115 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (14 resets) in 326 ms. (122 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (37 resets) in 282 ms. (141 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (33 resets) in 276 ms. (144 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (23 resets) in 197 ms. (202 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (27 resets) in 181 ms. (219 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (43 resets) in 106 ms. (373 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (14 resets) in 122 ms. (325 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (22 resets) in 133 ms. (298 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (15 resets) in 138 ms. (287 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (11 resets) in 48 ms. (816 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 354118 steps, run timeout after 3001 ms. (steps per millisecond=118 ) properties seen :9 out of 13
Probabilistic random walk after 354118 steps, saw 93948 distinct states, run finished after 3001 ms. (steps per millisecond=118 ) properties seen :9
[2025-06-02 18:27:42] [INFO ] Flow matrix only has 396 transitions (discarded 15 similar events)
// Phase 1: matrix 396 rows 148 cols
[2025-06-02 18:27:42] [INFO ] Computed 7 invariants in 4 ms
[2025-06-02 18:27:42] [INFO ] State equation strengthened by 28 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 77/83 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 54/137 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 388/525 variables, 137/144 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 24/168 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/525 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 9/534 variables, 5/173 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/534 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 4/538 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/538 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/538 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 3/541 variables, 2/179 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/541 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 2/543 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/543 variables, 2/182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/543 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 1/544 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/544 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/544 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 544/544 variables, and 183 constraints, problems are : Problem set: 0 solved, 4 unsolved in 467 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 148/148 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 77/83 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 54/137 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 388/525 variables, 137/144 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 24/168 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/525 variables, 3/171 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:43] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:43] [INFO ] Deduced a trap composed of 43 places in 133 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:44] [INFO ] Deduced a trap composed of 45 places in 151 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:44] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/525 variables, 4/175 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/525 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 9/534 variables, 5/180 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/534 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/534 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 4/538 variables, 2/183 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/538 variables, 2/185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/538 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 3/541 variables, 2/187 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/541 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 2/543 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/543 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/543 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 1/544 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/544 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 0/544 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 544/544 variables, and 191 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2099 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 148/148 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2580ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 474 ms.
Support contains 6 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 411/411 transitions.
Graph (trivial) has 43 edges and 148 vertex of which 5 / 148 are part of one of the 2 SCC in 1 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 145 transition count 402
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 141 transition count 402
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 9 place count 141 transition count 399
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 138 transition count 399
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 17 place count 136 transition count 396
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 136 transition count 396
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 19 place count 136 transition count 395
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 135 transition count 395
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 33 place count 129 transition count 389
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 128 transition count 387
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 128 transition count 387
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 41 place count 125 transition count 393
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 2 with 33 rules applied. Total rules applied 74 place count 125 transition count 360
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 78 place count 125 transition count 356
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 88 place count 121 transition count 350
Drop transitions (Redundant composition of simpler transitions.) removed 52 transitions
Redundant transition composition rules discarded 52 transitions
Iterating global reduction 3 with 52 rules applied. Total rules applied 140 place count 121 transition count 298
Applied a total of 140 rules in 60 ms. Remains 121 /148 variables (removed 27) and now considering 298/411 (removed 113) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 121/148 places, 298/411 transitions.
RANDOM walk for 40000 steps (2187 resets) in 412 ms. (96 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (669 resets) in 66 ms. (597 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (542 resets) in 91 ms. (434 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (544 resets) in 86 ms. (459 steps per ms) remains 2/2 properties
[2025-06-02 18:27:46] [INFO ] Flow matrix only has 265 transitions (discarded 33 similar events)
// Phase 1: matrix 265 rows 121 cols
[2025-06-02 18:27:46] [INFO ] Computed 7 invariants in 1 ms
[2025-06-02 18:27:46] [INFO ] State equation strengthened by 59 read => feed constraints.
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 57/60 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 55/115 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 263/378 variables, 115/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 59/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 7/385 variables, 5/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/386 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/386 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/386 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 187 constraints, problems are : Problem set: 0 solved, 2 unsolved in 216 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 121/121 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 57/60 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 55/115 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:46] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:46] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 263/378 variables, 115/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 59/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 2/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:46] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 10 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/378 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/378 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 7/385 variables, 5/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/385 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/386 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/386 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:47] [INFO ] Deduced a trap composed of 65 places in 115 ms of which 17 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/386 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/386 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/386 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 386/386 variables, and 193 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1047 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 121/121 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1274ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 204 ms.
Support contains 3 out of 121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 298/298 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 121 transition count 296
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 119 transition count 296
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 117 transition count 294
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 117 transition count 292
Applied a total of 10 rules in 16 ms. Remains 117 /121 variables (removed 4) and now considering 292/298 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 117/121 places, 292/298 transitions.
RANDOM walk for 40000 steps (2281 resets) in 179 ms. (222 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (718 resets) in 60 ms. (655 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (598 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 726438 steps, run visited all 2 properties in 2579 ms. (steps per millisecond=281 )
Probabilistic random walk after 726438 steps, saw 210573 distinct states, run finished after 2586 ms. (steps per millisecond=280 ) properties seen :2
[2025-06-02 18:27:50] [INFO ] Flatten gal took : 39 ms
[2025-06-02 18:27:50] [INFO ] Flatten gal took : 37 ms
[2025-06-02 18:27:50] [INFO ] Input system was already deterministic with 581 transitions.
Computed a total of 56 stabilizing places and 59 stable transitions
Graph (complete) has 992 edges and 353 vertex of which 350 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.12 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 353/353 places, 581/581 transitions.
Graph (trivial) has 285 edges and 353 vertex of which 18 / 353 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Graph (complete) has 956 edges and 338 vertex of which 335 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 77 place count 334 transition count 489
Reduce places removed 75 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 79 rules applied. Total rules applied 156 place count 259 transition count 485
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 158 place count 257 transition count 485
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 158 place count 257 transition count 471
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 186 place count 243 transition count 471
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 208 place count 221 transition count 409
Iterating global reduction 3 with 22 rules applied. Total rules applied 230 place count 221 transition count 409
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 232 place count 221 transition count 407
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 232 place count 221 transition count 398
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 250 place count 212 transition count 398
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 254 place count 208 transition count 391
Iterating global reduction 4 with 4 rules applied. Total rules applied 258 place count 208 transition count 391
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 260 place count 208 transition count 389
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 261 place count 207 transition count 389
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 6 with 54 rules applied. Total rules applied 315 place count 180 transition count 362
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 316 place count 179 transition count 360
Iterating global reduction 6 with 1 rules applied. Total rules applied 317 place count 179 transition count 360
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 319 place count 177 transition count 358
Applied a total of 319 rules in 76 ms. Remains 177 /353 variables (removed 176) and now considering 358/581 (removed 223) transitions.
[2025-06-02 18:27:50] [INFO ] Flow matrix only has 354 transitions (discarded 4 similar events)
// Phase 1: matrix 354 rows 177 cols
[2025-06-02 18:27:50] [INFO ] Computed 7 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:27:50] [INFO ] Implicit Places using invariants in 236 ms returned []
[2025-06-02 18:27:50] [INFO ] Flow matrix only has 354 transitions (discarded 4 similar events)
[2025-06-02 18:27:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:27:51] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-06-02 18:27:51] [INFO ] Implicit Places using invariants and state equation in 539 ms returned []
Implicit Place search using SMT with State Equation took 780 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:27:51] [INFO ] Redundant transitions in 31 ms returned []
Running 349 sub problems to find dead transitions.
[2025-06-02 18:27:51] [INFO ] Flow matrix only has 354 transitions (discarded 4 similar events)
[2025-06-02 18:27:51] [INFO ] Invariant cache hit.
[2025-06-02 18:27:51] [INFO ] State equation strengthened by 22 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 349 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:54] [INFO ] Deduced a trap composed of 53 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:54] [INFO ] Deduced a trap composed of 53 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:55] [INFO ] Deduced a trap composed of 23 places in 220 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:55] [INFO ] Deduced a trap composed of 58 places in 240 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:55] [INFO ] Deduced a trap composed of 23 places in 187 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:57] [INFO ] Deduced a trap composed of 30 places in 239 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:27:57] [INFO ] Deduced a trap composed of 43 places in 153 ms of which 14 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 3 (OVERLAPS) 353/528 variables, 175/189 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 22/211 constraints. Problems are: Problem set: 0 solved, 349 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:07] [INFO ] Deduced a trap composed of 63 places in 125 ms of which 16 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/528 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 349 unsolved
SMT process timed out in 30176ms, After SMT, problems are : Problem set: 0 solved, 349 unsolved
Search for dead transitions found 0 dead transitions in 30179ms
Starting structural reductions in SI_CTL mode, iteration 1 : 177/353 places, 358/581 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31074 ms. Remains : 177/353 places, 358/581 transitions.
[2025-06-02 18:28:21] [INFO ] Flatten gal took : 19 ms
[2025-06-02 18:28:21] [INFO ] Flatten gal took : 18 ms
[2025-06-02 18:28:21] [INFO ] Input system was already deterministic with 358 transitions.
[2025-06-02 18:28:21] [INFO ] Flatten gal took : 38 ms
[2025-06-02 18:28:21] [INFO ] Flatten gal took : 33 ms
[2025-06-02 18:28:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6825738869261396797.gal : 19 ms
RANDOM walk for 40000 steps (2215 resets) in 499 ms. (80 steps per ms) remains 1/1 properties
[2025-06-02 18:28:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14596975543975174302.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6825738869261396797.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14596975543975174302.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40003 steps (468 resets) in 173 ms. (229 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality14596975543975174302.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 9
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :9 after 10
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :10 after 12
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :12 after 21
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :21 after 31
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :31 after 56
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :56 after 289
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :289 after 1087
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1087 after 3899
Finished probabilistic random walk after 120279 steps, run visited all 1 properties in 321 ms. (steps per millisecond=374 )
Probabilistic random walk after 120279 steps, saw 28574 distinct states, run finished after 321 ms. (steps per millisecond=374 ) properties seen :1
FORMULA FireWire-PT-17-CTLCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 353/353 places, 581/581 transitions.
Graph (trivial) has 278 edges and 353 vertex of which 9 / 353 are part of one of the 2 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 985 edges and 346 vertex of which 343 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 73 place count 342 transition count 502
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 75 rules applied. Total rules applied 148 place count 271 transition count 498
Reduce places removed 2 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 5 rules applied. Total rules applied 153 place count 269 transition count 495
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 156 place count 266 transition count 495
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 17 Pre rules applied. Total rules applied 156 place count 266 transition count 478
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 190 place count 249 transition count 478
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 211 place count 228 transition count 436
Iterating global reduction 4 with 21 rules applied. Total rules applied 232 place count 228 transition count 436
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 233 place count 228 transition count 435
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 233 place count 228 transition count 426
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 251 place count 219 transition count 426
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 255 place count 215 transition count 419
Iterating global reduction 5 with 4 rules applied. Total rules applied 259 place count 215 transition count 419
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 261 place count 215 transition count 417
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 262 place count 214 transition count 417
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 7 with 56 rules applied. Total rules applied 318 place count 186 transition count 389
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 320 place count 184 transition count 367
Iterating global reduction 7 with 2 rules applied. Total rules applied 322 place count 184 transition count 367
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 323 place count 184 transition count 366
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 325 place count 182 transition count 364
Applied a total of 325 rules in 58 ms. Remains 182 /353 variables (removed 171) and now considering 364/581 (removed 217) transitions.
[2025-06-02 18:28:22] [INFO ] Flow matrix only has 363 transitions (discarded 1 similar events)
// Phase 1: matrix 363 rows 182 cols
[2025-06-02 18:28:22] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:28:22] [INFO ] Implicit Places using invariants in 178 ms returned []
[2025-06-02 18:28:22] [INFO ] Flow matrix only has 363 transitions (discarded 1 similar events)
[2025-06-02 18:28:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:28:22] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-02 18:28:22] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:28:22] [INFO ] Redundant transitions in 8 ms returned []
Running 355 sub problems to find dead transitions.
[2025-06-02 18:28:22] [INFO ] Flow matrix only has 363 transitions (discarded 1 similar events)
[2025-06-02 18:28:22] [INFO ] Invariant cache hit.
[2025-06-02 18:28:23] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 355 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:25] [INFO ] Deduced a trap composed of 53 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:25] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:25] [INFO ] Deduced a trap composed of 27 places in 153 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:25] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:25] [INFO ] Deduced a trap composed of 61 places in 143 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:26] [INFO ] Deduced a trap composed of 47 places in 158 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:27] [INFO ] Deduced a trap composed of 33 places in 163 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:27] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 3 (OVERLAPS) 362/542 variables, 180/195 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 355 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:28:36] [INFO ] Deduced a trap composed of 66 places in 138 ms of which 25 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 7 (OVERLAPS) 2/544 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 355 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 544/545 variables, and 200 constraints, problems are : Problem set: 0 solved, 355 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 182/182 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 355/355 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 355 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 3 (OVERLAPS) 362/542 variables, 180/196 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 355/553 constraints. Problems are: Problem set: 0 solved, 355 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 542/545 variables, and 553 constraints, problems are : Problem set: 0 solved, 355 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 180/182 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 355/355 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60131ms problems are : Problem set: 0 solved, 355 unsolved
Search for dead transitions found 0 dead transitions in 60134ms
Starting structural reductions in SI_CTL mode, iteration 1 : 182/353 places, 364/581 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60743 ms. Remains : 182/353 places, 364/581 transitions.
[2025-06-02 18:29:23] [INFO ] Flatten gal took : 25 ms
[2025-06-02 18:29:23] [INFO ] Flatten gal took : 26 ms
[2025-06-02 18:29:23] [INFO ] Input system was already deterministic with 364 transitions.
[2025-06-02 18:29:23] [INFO ] Flatten gal took : 25 ms
[2025-06-02 18:29:23] [INFO ] Flatten gal took : 25 ms
[2025-06-02 18:29:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality12971162016522297783.gal : 8 ms
[2025-06-02 18:29:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality4451714454235533445.ctl : 10 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/CTLCardinality12971162016522297783.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4451714454235533445.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.02254e+09,16.0794,319780,2,10760,5,691982,6,0,1089,1.35762e+06,0


Converting to forward existential form...Done !
original formula: E(A((p298==1) U ((p280==0)||(p234==1))) U (p66==1))
=> equivalent forward existential formula: [(FwdU(Init,!((E(!(((p280==0)||(p234==1))) U (!((p298==1)) * !(((p280==0)||(p234==1))))) + EG(!(((p280==0)||(p23...188
Reverse transition relation is NOT exact ! Due to transitions t6, t13, t20, t22, t24, t33, t35, t36, t38, t40, t47, t55, t61, t72, t74, t84, t85, t89, t90,...712
Detected timeout of ITS tools.
[2025-06-02 18:29:53] [INFO ] Flatten gal took : 17 ms
[2025-06-02 18:29:53] [INFO ] Applying decomposition
[2025-06-02 18:29:53] [INFO ] Flatten gal took : 17 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/graph4528753340412177371.txt' '-o' '/tmp/graph4528753340412177371.bin' '-w' '/tmp/graph4528753340412177371.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4528753340412177371.bin' '-l' '-1' '-v' '-w' '/tmp/graph4528753340412177371.weights' '-q' '0' '-e' '0.001'
[2025-06-02 18:29:53] [INFO ] Decomposing Gal with order
[2025-06-02 18:29:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 18:29:53] [INFO ] Removed a total of 477 redundant transitions.
[2025-06-02 18:29:53] [INFO ] Flatten gal took : 93 ms
[2025-06-02 18:29:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 65 labels/synchronizations in 23 ms.
[2025-06-02 18:29:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality16890988085173570846.gal : 11 ms
[2025-06-02 18:29:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality8569671016397309534.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/CTLCardinality16890988085173570846.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8569671016397309534.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.02254e+09,12.5379,315780,1797,44,340821,620,785,2.4392e+06,78,1801,0


Converting to forward existential form...Done !
original formula: E(A((i6.u47.p298==1) U ((i7.u44.p280==0)||(i5.i1.u39.p234==1))) U (i3.i0.u7.p66==1))
=> equivalent forward existential formula: [(FwdU(Init,!((E(!(((i7.u44.p280==0)||(i5.i1.u39.p234==1))) U (!((i6.u47.p298==1)) * !(((i7.u44.p280==0)||(i5.i1...255
Reverse transition relation is NOT exact ! Due to transitions t84, t85, t89, t107, t109, t110, t121, t162, t163, t168, t188, t189, t196, t241, t242, t244, ...1062
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 581/581 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 351 transition count 581
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 33 place count 320 transition count 529
Iterating global reduction 1 with 31 rules applied. Total rules applied 64 place count 320 transition count 529
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 65 place count 320 transition count 528
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 74 place count 311 transition count 516
Iterating global reduction 2 with 9 rules applied. Total rules applied 83 place count 311 transition count 516
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 84 place count 311 transition count 515
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 85 place count 310 transition count 514
Iterating global reduction 3 with 1 rules applied. Total rules applied 86 place count 310 transition count 514
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 87 place count 309 transition count 513
Iterating global reduction 3 with 1 rules applied. Total rules applied 88 place count 309 transition count 513
Applied a total of 88 rules in 33 ms. Remains 309 /353 variables (removed 44) and now considering 513/581 (removed 68) transitions.
// Phase 1: matrix 513 rows 309 cols
[2025-06-02 18:30:23] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:30:24] [INFO ] Implicit Places using invariants in 287 ms returned []
[2025-06-02 18:30:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:30:24] [INFO ] Implicit Places using invariants and state equation in 577 ms returned []
Implicit Place search using SMT with State Equation took 865 ms to find 0 implicit places.
Running 512 sub problems to find dead transitions.
[2025-06-02 18:30: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/307 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (OVERLAPS) 1/308 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:30:39] [INFO ] Deduced a trap composed of 76 places in 380 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:30:40] [INFO ] Deduced a trap composed of 143 places in 346 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:30:40] [INFO ] Deduced a trap composed of 74 places in 279 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:30:41] [INFO ] Deduced a trap composed of 74 places in 125 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:30:41] [INFO ] Deduced a trap composed of 77 places in 129 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:30:42] [INFO ] Deduced a trap composed of 87 places in 110 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:30:42] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:30:43] [INFO ] Deduced a trap composed of 87 places in 124 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:30:44] [INFO ] Deduced a trap composed of 54 places in 245 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:30:44] [INFO ] Deduced a trap composed of 56 places in 334 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:30:45] [INFO ] Deduced a trap composed of 68 places in 303 ms of which 43 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:30:53] [INFO ] Deduced a trap composed of 75 places in 277 ms of which 28 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 308/822 variables, and 19 constraints, problems are : Problem set: 0 solved, 512 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/309 constraints, PredecessorRefiner: 512/512 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 512 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/307 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (OVERLAPS) 1/308 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 4 (OVERLAPS) 513/821 variables, 308/327 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/821 variables, 507/834 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 821/822 variables, and 834 constraints, problems are : Problem set: 0 solved, 512 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 308/309 constraints, PredecessorRefiner: 507/512 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60175ms problems are : Problem set: 0 solved, 512 unsolved
Search for dead transitions found 0 dead transitions in 60181ms
Starting structural reductions in LTL mode, iteration 1 : 309/353 places, 513/581 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61083 ms. Remains : 309/353 places, 513/581 transitions.
[2025-06-02 18:31:24] [INFO ] Flatten gal took : 28 ms
[2025-06-02 18:31:25] [INFO ] Flatten gal took : 29 ms
[2025-06-02 18:31:25] [INFO ] Input system was already deterministic with 513 transitions.
[2025-06-02 18:31:25] [INFO ] Flatten gal took : 28 ms
[2025-06-02 18:31:25] [INFO ] Flatten gal took : 29 ms
[2025-06-02 18:31:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality16230359900029573589.gal : 7 ms
[2025-06-02 18:31:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality3676792950087183017.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/CTLCardinality16230359900029573589.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3676792950087183017.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-06-02 18:31:55] [INFO ] Flatten gal took : 19 ms
[2025-06-02 18:31:55] [INFO ] Applying decomposition
[2025-06-02 18:31:55] [INFO ] Flatten gal took : 18 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/graph6598056421209399487.txt' '-o' '/tmp/graph6598056421209399487.bin' '-w' '/tmp/graph6598056421209399487.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6598056421209399487.bin' '-l' '-1' '-v' '-w' '/tmp/graph6598056421209399487.weights' '-q' '0' '-e' '0.001'
[2025-06-02 18:31:55] [INFO ] Decomposing Gal with order
[2025-06-02 18:31:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 18:31:55] [INFO ] Removed a total of 534 redundant transitions.
[2025-06-02 18:31:55] [INFO ] Flatten gal took : 64 ms
[2025-06-02 18:31:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 41 labels/synchronizations in 12 ms.
[2025-06-02 18:31:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality2187238865684043724.gal : 14 ms
[2025-06-02 18:31:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality122295216284062875.ctl : 7 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/CTLCardinality2187238865684043724.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality122295216284062875.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 -...261
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,2.4614e+11,11.3029,263680,3359,65,413953,1532,931,1.25421e+06,83,5213,0


Converting to forward existential form...Done !
original formula: (EF((!(A(((i0.u8.p18==0)||(i9.u16.p47==1)) U ((i2.u10.p30==0)||(i0.u26.p95==1)))) * (((i2.u11.p31==0)&&(i11.u77.p278==1))||(i5.u43.p151==...468
=> equivalent forward existential formula: ([(EY((Init * E(TRUE U (!(!((E(!(((i2.u10.p30==0)||(i0.u26.p95==1))) U (!(((i0.u8.p18==0)||(i9.u16.p47==1))) * !...908
Reverse transition relation is NOT exact ! Due to transitions t26, t123, t222, t230, t244, t246, t255, t260, t262, t263, t265, t280, t282, t283, t296, t345...1175
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 581/581 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 350 transition count 581
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 41 place count 312 transition count 522
Iterating global reduction 1 with 38 rules applied. Total rules applied 79 place count 312 transition count 522
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 80 place count 312 transition count 521
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 92 place count 300 transition count 505
Iterating global reduction 2 with 12 rules applied. Total rules applied 104 place count 300 transition count 505
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 105 place count 300 transition count 504
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 107 place count 298 transition count 502
Iterating global reduction 3 with 2 rules applied. Total rules applied 109 place count 298 transition count 502
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 111 place count 296 transition count 500
Iterating global reduction 3 with 2 rules applied. Total rules applied 113 place count 296 transition count 500
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 114 place count 295 transition count 499
Iterating global reduction 3 with 1 rules applied. Total rules applied 115 place count 295 transition count 499
Applied a total of 115 rules in 29 ms. Remains 295 /353 variables (removed 58) and now considering 499/581 (removed 82) transitions.
// Phase 1: matrix 499 rows 295 cols
[2025-06-02 18:32:25] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:32:26] [INFO ] Implicit Places using invariants in 289 ms returned []
[2025-06-02 18:32:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:32:26] [INFO ] Implicit Places using invariants and state equation in 469 ms returned []
Implicit Place search using SMT with State Equation took 772 ms to find 0 implicit places.
Running 498 sub problems to find dead transitions.
[2025-06-02 18:32:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 1/295 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:41] [INFO ] Deduced a trap composed of 73 places in 387 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:41] [INFO ] Deduced a trap composed of 139 places in 327 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:41] [INFO ] Deduced a trap composed of 72 places in 101 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:42] [INFO ] Deduced a trap composed of 74 places in 111 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:42] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:43] [INFO ] Deduced a trap composed of 85 places in 99 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:44] [INFO ] Deduced a trap composed of 85 places in 114 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:44] [INFO ] Deduced a trap composed of 51 places in 235 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:45] [INFO ] Deduced a trap composed of 53 places in 278 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:46] [INFO ] Deduced a trap composed of 65 places in 293 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:49] [INFO ] Deduced a trap composed of 72 places in 101 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:32:51] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 295/794 variables, and 19 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/295 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 498 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 1/295 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (OVERLAPS) 499/794 variables, 295/314 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/794 variables, 498/812 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:33:25] [INFO ] Deduced a trap composed of 103 places in 382 ms of which 68 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 794/794 variables, and 813 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60164ms problems are : Problem set: 0 solved, 498 unsolved
Search for dead transitions found 0 dead transitions in 60166ms
Starting structural reductions in LTL mode, iteration 1 : 295/353 places, 499/581 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60968 ms. Remains : 295/353 places, 499/581 transitions.
[2025-06-02 18:33:26] [INFO ] Flatten gal took : 24 ms
[2025-06-02 18:33:26] [INFO ] Flatten gal took : 25 ms
[2025-06-02 18:33:26] [INFO ] Input system was already deterministic with 499 transitions.
[2025-06-02 18:33:26] [INFO ] Flatten gal took : 30 ms
[2025-06-02 18:33:26] [INFO ] Flatten gal took : 24 ms
[2025-06-02 18:33:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality7196014671999684805.gal : 5 ms
[2025-06-02 18:33:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality15956878957740393691.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/CTLCardinality7196014671999684805.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15956878957740393691.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-06-02 18:33:56] [INFO ] Flatten gal took : 21 ms
[2025-06-02 18:33:56] [INFO ] Applying decomposition
[2025-06-02 18:33:56] [INFO ] Flatten gal took : 28 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/graph6792232224285312649.txt' '-o' '/tmp/graph6792232224285312649.bin' '-w' '/tmp/graph6792232224285312649.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6792232224285312649.bin' '-l' '-1' '-v' '-w' '/tmp/graph6792232224285312649.weights' '-q' '0' '-e' '0.001'
[2025-06-02 18:33:57] [INFO ] Decomposing Gal with order
[2025-06-02 18:33:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 18:33:57] [INFO ] Removed a total of 504 redundant transitions.
[2025-06-02 18:33:57] [INFO ] Flatten gal took : 32 ms
[2025-06-02 18:33:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 6 ms.
[2025-06-02 18:33:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality6772565796197287455.gal : 5 ms
[2025-06-02 18:33:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality10274824441120971909.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/CTLCardinality6772565796197287455.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10274824441120971909.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.86171e+11,17.5821,306792,3281,46,399148,1736,911,1.67643e+06,68,8366,0


Converting to forward existential form...Done !
original formula: EX(E(!(AG((i7.u58.p223==0))) U (i2.u92.p350==1)))
=> equivalent forward existential formula: [(FwdU(EY(Init),!(!(E(TRUE U !((i7.u58.p223==0)))))) * (i2.u92.p350==1))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t22, t117, t214, t220, t233, t244, t249, t254, t259, t264, t269, t271, t272, t285, t287, t334...1098
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 581/581 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 350 transition count 581
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 39 place count 314 transition count 524
Iterating global reduction 1 with 36 rules applied. Total rules applied 75 place count 314 transition count 524
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 76 place count 314 transition count 523
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 86 place count 304 transition count 509
Iterating global reduction 2 with 10 rules applied. Total rules applied 96 place count 304 transition count 509
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 97 place count 304 transition count 508
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 99 place count 302 transition count 506
Iterating global reduction 3 with 2 rules applied. Total rules applied 101 place count 302 transition count 506
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 102 place count 301 transition count 505
Iterating global reduction 3 with 1 rules applied. Total rules applied 103 place count 301 transition count 505
Applied a total of 103 rules in 19 ms. Remains 301 /353 variables (removed 52) and now considering 505/581 (removed 76) transitions.
// Phase 1: matrix 505 rows 301 cols
[2025-06-02 18:34:27] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:34:27] [INFO ] Implicit Places using invariants in 216 ms returned []
[2025-06-02 18:34:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:34:27] [INFO ] Implicit Places using invariants and state equation in 524 ms returned []
Implicit Place search using SMT with State Equation took 744 ms to find 0 implicit places.
Running 504 sub problems to find dead transitions.
[2025-06-02 18:34:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/300 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 1 (OVERLAPS) 1/301 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 504 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:34:42] [INFO ] Deduced a trap composed of 74 places in 248 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:34:42] [INFO ] Deduced a trap composed of 80 places in 306 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:34:44] [INFO ] Deduced a trap composed of 85 places in 116 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:34:44] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:34:45] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:34:46] [INFO ] Deduced a trap composed of 53 places in 241 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:34:46] [INFO ] Deduced a trap composed of 55 places in 302 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:34:47] [INFO ] Deduced a trap composed of 67 places in 281 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:34:50] [INFO ] Deduced a trap composed of 150 places in 281 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:34:50] [INFO ] Deduced a trap composed of 72 places in 102 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 504 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:34:51] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 504 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 301/806 variables, and 18 constraints, problems are : Problem set: 0 solved, 504 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/301 constraints, PredecessorRefiner: 504/504 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 504 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/300 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 1 (OVERLAPS) 1/301 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 4 (OVERLAPS) 505/806 variables, 301/319 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/806 variables, 504/823 constraints. Problems are: Problem set: 0 solved, 504 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:35:23] [INFO ] Deduced a trap composed of 143 places in 366 ms of which 80 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 806/806 variables, and 824 constraints, problems are : Problem set: 0 solved, 504 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 504/504 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60151ms problems are : Problem set: 0 solved, 504 unsolved
Search for dead transitions found 0 dead transitions in 60153ms
Starting structural reductions in LTL mode, iteration 1 : 301/353 places, 505/581 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60918 ms. Remains : 301/353 places, 505/581 transitions.
[2025-06-02 18:35:28] [INFO ] Flatten gal took : 20 ms
[2025-06-02 18:35:28] [INFO ] Flatten gal took : 21 ms
[2025-06-02 18:35:28] [INFO ] Input system was already deterministic with 505 transitions.
[2025-06-02 18:35:28] [INFO ] Flatten gal took : 21 ms
[2025-06-02 18:35:28] [INFO ] Flatten gal took : 20 ms
[2025-06-02 18:35:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality1433716804644098124.gal : 7 ms
[2025-06-02 18:35:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality11995933481527260493.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/CTLCardinality1433716804644098124.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11995933481527260493.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-06-02 18:35:58] [INFO ] Flatten gal took : 13 ms
[2025-06-02 18:35:58] [INFO ] Applying decomposition
[2025-06-02 18:35:58] [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/graph6598582836419387932.txt' '-o' '/tmp/graph6598582836419387932.bin' '-w' '/tmp/graph6598582836419387932.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6598582836419387932.bin' '-l' '-1' '-v' '-w' '/tmp/graph6598582836419387932.weights' '-q' '0' '-e' '0.001'
[2025-06-02 18:35:58] [INFO ] Decomposing Gal with order
[2025-06-02 18:35:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 18:35:58] [INFO ] Removed a total of 522 redundant transitions.
[2025-06-02 18:35:58] [INFO ] Flatten gal took : 29 ms
[2025-06-02 18:35:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 5 ms.
[2025-06-02 18:35:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality18113644992972227317.gal : 5 ms
[2025-06-02 18:35:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality6150926279260964633.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/CTLCardinality18113644992972227317.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6150926279260964633.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,2.08295e+11,4.979,116620,2397,77,184530,1464,889,554557,88,4617,0


Converting to forward existential form...Done !
original formula: AX(AG((((i6.u29.p110==0) + AG(!(E((i13.u112.p422==1) U ((i5.u39.p150==0)||(i9.u83.p313==1)))))) + (((i4.u30.p117==0)&&(i1.u2.p2==1))&&((i...198
=> equivalent forward existential formula: [(FwdU(FwdU(((FwdU(EY(Init),TRUE) * !((((i4.u30.p117==0)&&(i1.u2.p2==1))&&((i0.u50.p195==1)&&(i7.i1.i1.u65.p252=...260
(forward)formula 0,0,10.0324,156940,1,0,257640,1526,2325,681809,151,5180,656905
FORMULA FireWire-PT-17-CTLCardinality-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 581/581 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 350 transition count 581
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 41 place count 312 transition count 522
Iterating global reduction 1 with 38 rules applied. Total rules applied 79 place count 312 transition count 522
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 80 place count 312 transition count 521
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 89 place count 303 transition count 510
Iterating global reduction 2 with 9 rules applied. Total rules applied 98 place count 303 transition count 510
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 99 place count 303 transition count 509
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 100 place count 302 transition count 508
Iterating global reduction 3 with 1 rules applied. Total rules applied 101 place count 302 transition count 508
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 102 place count 301 transition count 507
Iterating global reduction 3 with 1 rules applied. Total rules applied 103 place count 301 transition count 507
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 104 place count 300 transition count 506
Iterating global reduction 3 with 1 rules applied. Total rules applied 105 place count 300 transition count 506
Applied a total of 105 rules in 24 ms. Remains 300 /353 variables (removed 53) and now considering 506/581 (removed 75) transitions.
// Phase 1: matrix 506 rows 300 cols
[2025-06-02 18:36:08] [INFO ] Computed 7 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:36:08] [INFO ] Implicit Places using invariants in 263 ms returned []
[2025-06-02 18:36:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:36:09] [INFO ] Implicit Places using invariants and state equation in 650 ms returned []
Implicit Place search using SMT with State Equation took 941 ms to find 0 implicit places.
Running 505 sub problems to find dead transitions.
[2025-06-02 18:36:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/299 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 1 (OVERLAPS) 1/300 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 505 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:36:25] [INFO ] Deduced a trap composed of 75 places in 372 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:36:25] [INFO ] Deduced a trap composed of 139 places in 309 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:36:25] [INFO ] Deduced a trap composed of 72 places in 125 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:36:26] [INFO ] Deduced a trap composed of 86 places in 126 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:36:28] [INFO ] Deduced a trap composed of 85 places in 128 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:36:28] [INFO ] Deduced a trap composed of 52 places in 266 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:36:29] [INFO ] Deduced a trap composed of 66 places in 279 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:36:33] [INFO ] Deduced a trap composed of 72 places in 105 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 505 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:36:35] [INFO ] Deduced a trap composed of 74 places in 302 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:36:37] [INFO ] Deduced a trap composed of 54 places in 298 ms of which 33 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 300/806 variables, and 17 constraints, problems are : Problem set: 0 solved, 505 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/300 constraints, PredecessorRefiner: 505/505 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 505 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/299 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 1 (OVERLAPS) 1/300 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 505 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:36:45] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:36:47] [INFO ] Deduced a trap composed of 74 places in 118 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:36:47] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 5 (OVERLAPS) 506/806 variables, 300/320 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/806 variables, 505/825 constraints. Problems are: Problem set: 0 solved, 505 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 806/806 variables, and 825 constraints, problems are : Problem set: 0 solved, 505 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 300/300 constraints, PredecessorRefiner: 505/505 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60152ms problems are : Problem set: 0 solved, 505 unsolved
Search for dead transitions found 0 dead transitions in 60155ms
Starting structural reductions in LTL mode, iteration 1 : 300/353 places, 506/581 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61121 ms. Remains : 300/353 places, 506/581 transitions.
[2025-06-02 18:37:09] [INFO ] Flatten gal took : 12 ms
[2025-06-02 18:37:09] [INFO ] Flatten gal took : 12 ms
[2025-06-02 18:37:09] [INFO ] Input system was already deterministic with 506 transitions.
[2025-06-02 18:37:09] [INFO ] Flatten gal took : 12 ms
[2025-06-02 18:37:09] [INFO ] Flatten gal took : 12 ms
[2025-06-02 18:37:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality2737307564161293332.gal : 3 ms
[2025-06-02 18:37:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality9196957849974954067.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/CTLCardinality2737307564161293332.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9196957849974954067.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.
Detected timeout of ITS tools.
[2025-06-02 18:37:39] [INFO ] Flatten gal took : 21 ms
[2025-06-02 18:37:39] [INFO ] Applying decomposition
[2025-06-02 18:37:39] [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/graph5729772218830118764.txt' '-o' '/tmp/graph5729772218830118764.bin' '-w' '/tmp/graph5729772218830118764.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5729772218830118764.bin' '-l' '-1' '-v' '-w' '/tmp/graph5729772218830118764.weights' '-q' '0' '-e' '0.001'
[2025-06-02 18:37:39] [INFO ] Decomposing Gal with order
[2025-06-02 18:37:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 18:37:39] [INFO ] Removed a total of 536 redundant transitions.
[2025-06-02 18:37:39] [INFO ] Flatten gal took : 47 ms
[2025-06-02 18:37:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 16 ms.
[2025-06-02 18:37:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality5024699986007726270.gal : 9 ms
[2025-06-02 18:37:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality6737797395088040954.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/CTLCardinality5024699986007726270.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6737797395088040954.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.03809e+11,17.9138,414776,3368,57,573011,1946,1073,2.83598e+06,86,5198,0


Converting to forward existential form...Done !
original formula: AG(((EX((((i4.i0.u31.p123==1)||(i0.i0.u9.p35==0))||(i8.i1.u66.p242==1))) + !(A((i7.i0.u56.p213!=0) U ((i12.i0.u73.p272==0)||(i1.i0.u17.p7...188
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * !((i1.i2.u24.p100==1))) * !(!(!((E(!(((i12.i0.u73.p272==0)||(i1.i0.u17.p70==1))) U (!((i7....361
Reverse transition relation is NOT exact ! Due to transitions t22, t120, t221, t224, t237, t239, t248, t273, t275, t276, t289, t291, t293, t294, t341, t355...1273
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 0,0,24.9566,414776,1,0,573011,1946,6525,2.83598e+06,408,5198,1038167
FORMULA FireWire-PT-17-CTLCardinality-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 581/581 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 350 transition count 581
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 38 place count 315 transition count 525
Iterating global reduction 1 with 35 rules applied. Total rules applied 73 place count 315 transition count 525
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 83 place count 305 transition count 513
Iterating global reduction 1 with 10 rules applied. Total rules applied 93 place count 305 transition count 513
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 94 place count 305 transition count 512
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 96 place count 303 transition count 510
Iterating global reduction 2 with 2 rules applied. Total rules applied 98 place count 303 transition count 510
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 99 place count 302 transition count 509
Iterating global reduction 2 with 1 rules applied. Total rules applied 100 place count 302 transition count 509
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 301 transition count 508
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 301 transition count 508
Applied a total of 102 rules in 22 ms. Remains 301 /353 variables (removed 52) and now considering 508/581 (removed 73) transitions.
// Phase 1: matrix 508 rows 301 cols
[2025-06-02 18:38:05] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:38:05] [INFO ] Implicit Places using invariants in 201 ms returned []
[2025-06-02 18:38:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:38:06] [INFO ] Implicit Places using invariants and state equation in 731 ms returned []
Implicit Place search using SMT with State Equation took 944 ms to find 0 implicit places.
Running 507 sub problems to find dead transitions.
[2025-06-02 18:38:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/300 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 1 (OVERLAPS) 1/301 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 507 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:38:21] [INFO ] Deduced a trap composed of 76 places in 360 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:38:22] [INFO ] Deduced a trap composed of 140 places in 298 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:38:22] [INFO ] Deduced a trap composed of 149 places in 252 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:38:22] [INFO ] Deduced a trap composed of 76 places in 111 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:38:23] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:38:24] [INFO ] Deduced a trap composed of 87 places in 312 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:38:24] [INFO ] Deduced a trap composed of 149 places in 302 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:38:25] [INFO ] Deduced a trap composed of 72 places in 115 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:38:26] [INFO ] Deduced a trap composed of 85 places in 104 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:38:26] [INFO ] Deduced a trap composed of 53 places in 238 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:38:26] [INFO ] Deduced a trap composed of 56 places in 240 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:38:27] [INFO ] Deduced a trap composed of 55 places in 305 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:38:28] [INFO ] Deduced a trap composed of 66 places in 307 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:38:31] [INFO ] Deduced a trap composed of 79 places in 118 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:38:31] [INFO ] Deduced a trap composed of 73 places in 105 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 507 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 301/809 variables, and 22 constraints, problems are : Problem set: 0 solved, 507 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/301 constraints, PredecessorRefiner: 507/507 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 507 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/300 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 1 (OVERLAPS) 1/301 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 507 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:38:42] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:38:43] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 5 (OVERLAPS) 508/809 variables, 301/325 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/809 variables, 507/832 constraints. Problems are: Problem set: 0 solved, 507 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 809/809 variables, and 832 constraints, problems are : Problem set: 0 solved, 507 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 507/507 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60158ms problems are : Problem set: 0 solved, 507 unsolved
Search for dead transitions found 0 dead transitions in 60162ms
Starting structural reductions in LTL mode, iteration 1 : 301/353 places, 508/581 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61133 ms. Remains : 301/353 places, 508/581 transitions.
[2025-06-02 18:39:06] [INFO ] Flatten gal took : 13 ms
[2025-06-02 18:39:06] [INFO ] Flatten gal took : 13 ms
[2025-06-02 18:39:06] [INFO ] Input system was already deterministic with 508 transitions.
[2025-06-02 18:39:06] [INFO ] Flatten gal took : 14 ms
[2025-06-02 18:39:06] [INFO ] Flatten gal took : 14 ms
[2025-06-02 18:39:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality12632971850579214417.gal : 3 ms
[2025-06-02 18:39:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality3339116809367088316.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/CTLCardinality12632971850579214417.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3339116809367088316.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-06-02 18:39:36] [INFO ] Flatten gal took : 15 ms
[2025-06-02 18:39:36] [INFO ] Applying decomposition
[2025-06-02 18:39:36] [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/graph11662290184201618912.txt' '-o' '/tmp/graph11662290184201618912.bin' '-w' '/tmp/graph11662290184201618912.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11662290184201618912.bin' '-l' '-1' '-v' '-w' '/tmp/graph11662290184201618912.weights' '-q' '0' '-e' '0.001'
[2025-06-02 18:39:36] [INFO ] Decomposing Gal with order
[2025-06-02 18:39:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 18:39:36] [INFO ] Removed a total of 512 redundant transitions.
[2025-06-02 18:39:36] [INFO ] Flatten gal took : 53 ms
[2025-06-02 18:39:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 5 ms.
[2025-06-02 18:39:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality14690867242666282313.gal : 21 ms
[2025-06-02 18:39:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality4008869521685342968.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/CTLCardinality14690867242666282313.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4008869521685342968.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,2.095e+11,6.54023,117544,2347,70,175976,2013,906,442254,86,7336,0


Converting to forward existential form...Done !
original formula: EF((EX(AG(((i4.u47.p180!=1)||(i0.u17.p77!=1)))) + ((((i8.u66.p250==0)&&(i6.u42.p168==1)) * (A(((i11.u86.p325==0)||(i10.u79.p294==1)) U ((...251
=> equivalent forward existential formula: ([(EY(FwdU(Init,TRUE)) * !(E(TRUE U !(((i4.u47.p180!=1)||(i0.u17.p77!=1))))))] != FALSE + [(((((FwdU(Init,TRUE) ...448
Reverse transition relation is NOT exact ! Due to transitions t22, t119, t219, t225, t238, t240, t249, t254, t258, t259, t264, t269, t274, t276, t277, t290...1098
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 581/581 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 352 transition count 581
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 27 place count 326 transition count 535
Iterating global reduction 1 with 26 rules applied. Total rules applied 53 place count 326 transition count 535
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 54 place count 326 transition count 534
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 60 place count 320 transition count 527
Iterating global reduction 2 with 6 rules applied. Total rules applied 66 place count 320 transition count 527
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 67 place count 320 transition count 526
Applied a total of 67 rules in 19 ms. Remains 320 /353 variables (removed 33) and now considering 526/581 (removed 55) transitions.
// Phase 1: matrix 526 rows 320 cols
[2025-06-02 18:40:06] [INFO ] Computed 7 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:40:07] [INFO ] Implicit Places using invariants in 290 ms returned []
[2025-06-02 18:40:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:40:07] [INFO ] Implicit Places using invariants and state equation in 630 ms returned []
Implicit Place search using SMT with State Equation took 923 ms to find 0 implicit places.
Running 525 sub problems to find dead transitions.
[2025-06-02 18:40:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/317 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 525 unsolved
At refinement iteration 1 (OVERLAPS) 1/318 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 525 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:40:24] [INFO ] Deduced a trap composed of 79 places in 404 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:40:25] [INFO ] Deduced a trap composed of 146 places in 340 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:40:26] [INFO ] Deduced a trap composed of 92 places in 114 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:40:28] [INFO ] Deduced a trap composed of 87 places in 107 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:40:28] [INFO ] Deduced a trap composed of 56 places in 243 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:40:28] [INFO ] Deduced a trap composed of 59 places in 242 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:40:30] [INFO ] Deduced a trap composed of 69 places in 272 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:40:33] [INFO ] Deduced a trap composed of 77 places in 113 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:40:33] [INFO ] Deduced a trap composed of 74 places in 105 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/318 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 525 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 318/846 variables, and 16 constraints, problems are : Problem set: 0 solved, 525 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/320 constraints, PredecessorRefiner: 525/525 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 525 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/317 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 525 unsolved
At refinement iteration 1 (OVERLAPS) 1/318 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 525 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/318 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 525 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:40:46] [INFO ] Deduced a trap composed of 76 places in 116 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:40:47] [INFO ] Deduced a trap composed of 58 places in 337 ms of which 44 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/318 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 525 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:40:53] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 525 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 318/846 variables, and 19 constraints, problems are : Problem set: 0 solved, 525 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/320 constraints, PredecessorRefiner: 0/525 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60167ms problems are : Problem set: 0 solved, 525 unsolved
Search for dead transitions found 0 dead transitions in 60170ms
Starting structural reductions in LTL mode, iteration 1 : 320/353 places, 526/581 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61114 ms. Remains : 320/353 places, 526/581 transitions.
[2025-06-02 18:41:07] [INFO ] Flatten gal took : 19 ms
[2025-06-02 18:41:07] [INFO ] Flatten gal took : 21 ms
[2025-06-02 18:41:07] [INFO ] Input system was already deterministic with 526 transitions.
[2025-06-02 18:41:07] [INFO ] Flatten gal took : 21 ms
[2025-06-02 18:41:07] [INFO ] Flatten gal took : 21 ms
[2025-06-02 18:41:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality8933792232352019786.gal : 4 ms
[2025-06-02 18:41:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality939840104252709033.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/CTLCardinality8933792232352019786.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality939840104252709033.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 18:41:38] [INFO ] Flatten gal took : 12 ms
[2025-06-02 18:41:38] [INFO ] Applying decomposition
[2025-06-02 18:41:38] [INFO ] Flatten gal took : 13 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/graph13625858845691865101.txt' '-o' '/tmp/graph13625858845691865101.bin' '-w' '/tmp/graph13625858845691865101.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13625858845691865101.bin' '-l' '-1' '-v' '-w' '/tmp/graph13625858845691865101.weights' '-q' '0' '-e' '0.001'
[2025-06-02 18:41:38] [INFO ] Decomposing Gal with order
[2025-06-02 18:41:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 18:41:38] [INFO ] Removed a total of 514 redundant transitions.
[2025-06-02 18:41:38] [INFO ] Flatten gal took : 28 ms
[2025-06-02 18:41:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 27 labels/synchronizations in 6 ms.
[2025-06-02 18:41:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality17440421299945673211.gal : 4 ms
[2025-06-02 18:41:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality16239962390216483065.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/CTLCardinality17440421299945673211.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16239962390216483065.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.22305e+11,12.8591,290444,3584,71,440663,1654,935,1.60051e+06,85,4834,0


Converting to forward existential form...Done !
original formula: (EF(((i8.u71.p251==0)||(i2.u85.p297==1))) * (AX((((((i8.u71.p251==0)&&(i12.u90.p271==1))&&(i13.i1.i1.u117.p402==0))||(i13.i0.i2.u114.p398...697
=> equivalent forward existential formula: ([(Init * !(E(TRUE U ((i8.u71.p251==0)||(i2.u85.p297==1)))))] = FALSE * ([(EY((Init * !(E((EG((((i0.u8.p28==0)||...2233
Reverse transition relation is NOT exact ! Due to transitions t26, t132, t213, t214, t234, t256, t258, t267, t292, t294, t295, t308, t310, t312, t313, t360...1248
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 581/581 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 350 transition count 581
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 41 place count 312 transition count 522
Iterating global reduction 1 with 38 rules applied. Total rules applied 79 place count 312 transition count 522
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 80 place count 312 transition count 521
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 92 place count 300 transition count 505
Iterating global reduction 2 with 12 rules applied. Total rules applied 104 place count 300 transition count 505
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 105 place count 300 transition count 504
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 107 place count 298 transition count 502
Iterating global reduction 3 with 2 rules applied. Total rules applied 109 place count 298 transition count 502
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 111 place count 296 transition count 500
Iterating global reduction 3 with 2 rules applied. Total rules applied 113 place count 296 transition count 500
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 114 place count 295 transition count 499
Iterating global reduction 3 with 1 rules applied. Total rules applied 115 place count 295 transition count 499
Applied a total of 115 rules in 26 ms. Remains 295 /353 variables (removed 58) and now considering 499/581 (removed 82) transitions.
// Phase 1: matrix 499 rows 295 cols
[2025-06-02 18:42:08] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:42:08] [INFO ] Implicit Places using invariants in 261 ms returned []
[2025-06-02 18:42:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:42:09] [INFO ] Implicit Places using invariants and state equation in 568 ms returned []
Implicit Place search using SMT with State Equation took 832 ms to find 0 implicit places.
Running 498 sub problems to find dead transitions.
[2025-06-02 18:42:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 1/295 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:42:24] [INFO ] Deduced a trap composed of 73 places in 376 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:42:24] [INFO ] Deduced a trap composed of 139 places in 314 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:42:25] [INFO ] Deduced a trap composed of 72 places in 105 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:42:25] [INFO ] Deduced a trap composed of 74 places in 102 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:42:25] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:42:26] [INFO ] Deduced a trap composed of 85 places in 103 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:42:27] [INFO ] Deduced a trap composed of 85 places in 106 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:42:27] [INFO ] Deduced a trap composed of 51 places in 235 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:42:28] [INFO ] Deduced a trap composed of 53 places in 273 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:42:29] [INFO ] Deduced a trap composed of 65 places in 303 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:42:32] [INFO ] Deduced a trap composed of 72 places in 99 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:42:34] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 4 ms to minimize.
(s39 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 295/794 variables, and 19 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/295 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 498 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 1/295 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (OVERLAPS) 499/794 variables, 295/314 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/794 variables, 498/812 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:43:05] [INFO ] Deduced a trap composed of 103 places in 371 ms of which 67 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 794/794 variables, and 813 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60171ms problems are : Problem set: 0 solved, 498 unsolved
Search for dead transitions found 0 dead transitions in 60175ms
Starting structural reductions in LTL mode, iteration 1 : 295/353 places, 499/581 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61037 ms. Remains : 295/353 places, 499/581 transitions.
[2025-06-02 18:43:09] [INFO ] Flatten gal took : 19 ms
[2025-06-02 18:43:09] [INFO ] Flatten gal took : 19 ms
[2025-06-02 18:43:09] [INFO ] Input system was already deterministic with 499 transitions.
[2025-06-02 18:43:09] [INFO ] Flatten gal took : 19 ms
[2025-06-02 18:43:09] [INFO ] Flatten gal took : 24 ms
[2025-06-02 18:43:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality5452356874821764576.gal : 4 ms
[2025-06-02 18:43:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality5164489091937985505.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/CTLCardinality5452356874821764576.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5164489091937985505.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.
Detected timeout of ITS tools.
[2025-06-02 18:43:39] [INFO ] Flatten gal took : 20 ms
[2025-06-02 18:43:39] [INFO ] Applying decomposition
[2025-06-02 18:43:39] [INFO ] Flatten gal took : 19 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/graph2358462518839027397.txt' '-o' '/tmp/graph2358462518839027397.bin' '-w' '/tmp/graph2358462518839027397.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2358462518839027397.bin' '-l' '-1' '-v' '-w' '/tmp/graph2358462518839027397.weights' '-q' '0' '-e' '0.001'
[2025-06-02 18:43:39] [INFO ] Decomposing Gal with order
[2025-06-02 18:43:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 18:43:39] [INFO ] Removed a total of 525 redundant transitions.
[2025-06-02 18:43:39] [INFO ] Flatten gal took : 40 ms
[2025-06-02 18:43:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 10 ms.
[2025-06-02 18:43:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality1025073630114699181.gal : 8 ms
[2025-06-02 18:43:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality6097470483208798690.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/CTLCardinality1025073630114699181.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6097470483208798690.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.86171e+11,12.6391,293032,3042,46,433181,1101,971,1.81289e+06,73,3383,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,12.6931,293032,1,0,433181,1101,1398,1.81289e+06,82,3383,1285
FORMULA FireWire-PT-17-CTLCardinality-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 581/581 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 351 transition count 581
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 38 place count 315 transition count 543
Iterating global reduction 1 with 36 rules applied. Total rules applied 74 place count 315 transition count 543
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 75 place count 315 transition count 542
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 87 place count 303 transition count 526
Iterating global reduction 2 with 12 rules applied. Total rules applied 99 place count 303 transition count 526
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 100 place count 303 transition count 525
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 102 place count 301 transition count 523
Iterating global reduction 3 with 2 rules applied. Total rules applied 104 place count 301 transition count 523
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 106 place count 299 transition count 521
Iterating global reduction 3 with 2 rules applied. Total rules applied 108 place count 299 transition count 521
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 109 place count 298 transition count 520
Iterating global reduction 3 with 1 rules applied. Total rules applied 110 place count 298 transition count 520
Applied a total of 110 rules in 19 ms. Remains 298 /353 variables (removed 55) and now considering 520/581 (removed 61) transitions.
// Phase 1: matrix 520 rows 298 cols
[2025-06-02 18:43:52] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:43:52] [INFO ] Implicit Places using invariants in 439 ms returned []
[2025-06-02 18:43:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:43:53] [INFO ] Implicit Places using invariants and state equation in 627 ms returned []
Implicit Place search using SMT with State Equation took 1068 ms to find 0 implicit places.
Running 519 sub problems to find dead transitions.
[2025-06-02 18:43:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 1 (OVERLAPS) 1/297 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 519 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:44:09] [INFO ] Deduced a trap composed of 74 places in 359 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:44:09] [INFO ] Deduced a trap composed of 139 places in 230 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:44:10] [INFO ] Deduced a trap composed of 72 places in 252 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:44:11] [INFO ] Deduced a trap composed of 85 places in 327 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:44:11] [INFO ] Deduced a trap composed of 72 places in 98 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:44:12] [INFO ] Deduced a trap composed of 85 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:44:12] [INFO ] Deduced a trap composed of 52 places in 225 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:44:13] [INFO ] Deduced a trap composed of 54 places in 276 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:44:13] [INFO ] Deduced a trap composed of 66 places in 207 ms of which 31 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 519 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 297/818 variables, and 16 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/298 constraints, PredecessorRefiner: 519/519 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 519 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 1 (OVERLAPS) 1/297 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 519 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:44:27] [INFO ] Deduced a trap composed of 29 places in 149 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:44:28] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 5 (OVERLAPS) 520/817 variables, 297/315 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/817 variables, 517/832 constraints. Problems are: Problem set: 0 solved, 519 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 817/818 variables, and 832 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 297/298 constraints, PredecessorRefiner: 517/519 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60176ms problems are : Problem set: 0 solved, 519 unsolved
Search for dead transitions found 0 dead transitions in 60180ms
Starting structural reductions in LTL mode, iteration 1 : 298/353 places, 520/581 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61269 ms. Remains : 298/353 places, 520/581 transitions.
[2025-06-02 18:44:53] [INFO ] Flatten gal took : 16 ms
[2025-06-02 18:44:53] [INFO ] Flatten gal took : 16 ms
[2025-06-02 18:44:53] [INFO ] Input system was already deterministic with 520 transitions.
[2025-06-02 18:44:53] [INFO ] Flatten gal took : 16 ms
[2025-06-02 18:44:53] [INFO ] Flatten gal took : 16 ms
[2025-06-02 18:44:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality17374427332517454879.gal : 3 ms
[2025-06-02 18:44:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality17940709395810934457.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/CTLCardinality17374427332517454879.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17940709395810934457.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-06-02 18:45:23] [INFO ] Flatten gal took : 13 ms
[2025-06-02 18:45:23] [INFO ] Applying decomposition
[2025-06-02 18:45: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/graph4343937791875669375.txt' '-o' '/tmp/graph4343937791875669375.bin' '-w' '/tmp/graph4343937791875669375.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4343937791875669375.bin' '-l' '-1' '-v' '-w' '/tmp/graph4343937791875669375.weights' '-q' '0' '-e' '0.001'
[2025-06-02 18:45:23] [INFO ] Decomposing Gal with order
[2025-06-02 18:45:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 18:45:24] [INFO ] Removed a total of 563 redundant transitions.
[2025-06-02 18:45:24] [INFO ] Flatten gal took : 64 ms
[2025-06-02 18:45:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 41 labels/synchronizations in 8 ms.
[2025-06-02 18:45:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality9085669947496465266.gal : 6 ms
[2025-06-02 18:45:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality15095181325817971677.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/CTLCardinality9085669947496465266.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15095181325817971677.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,2.19598e+11,11.7135,254288,3408,55,432690,1568,928,1.0779e+06,78,4797,0


Converting to forward existential form...Done !
original formula: EX(AG(EF(((EF(((i0.u1.p10==0)&&(i5.i1.i0.u59.p229==1))) * (i2.u12.p50==0)) * ((i2.u14.p62==0)&&(i10.u106.p387==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(E(TRUE U ((E(TRUE U ((i0.u1.p10==0)&&(i5.i1.i0.u59.p229==1))) * (i2.u12.p50==0)) * ((i...205
Reverse transition relation is NOT exact ! Due to transitions t22, t118, t195, t234, t236, t245, t264, t270, t272, t273, t288, t345, t362, t363, t371, t375...1133
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 581/581 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 350 transition count 581
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 40 place count 313 transition count 523
Iterating global reduction 1 with 37 rules applied. Total rules applied 77 place count 313 transition count 523
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 78 place count 313 transition count 522
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 90 place count 301 transition count 506
Iterating global reduction 2 with 12 rules applied. Total rules applied 102 place count 301 transition count 506
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 103 place count 301 transition count 505
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 105 place count 299 transition count 503
Iterating global reduction 3 with 2 rules applied. Total rules applied 107 place count 299 transition count 503
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 109 place count 297 transition count 501
Iterating global reduction 3 with 2 rules applied. Total rules applied 111 place count 297 transition count 501
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 112 place count 296 transition count 500
Iterating global reduction 3 with 1 rules applied. Total rules applied 113 place count 296 transition count 500
Applied a total of 113 rules in 29 ms. Remains 296 /353 variables (removed 57) and now considering 500/581 (removed 81) transitions.
// Phase 1: matrix 500 rows 296 cols
[2025-06-02 18:45:54] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:45:54] [INFO ] Implicit Places using invariants in 325 ms returned []
[2025-06-02 18:45:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:45:55] [INFO ] Implicit Places using invariants and state equation in 673 ms returned []
Implicit Place search using SMT with State Equation took 1001 ms to find 0 implicit places.
Running 499 sub problems to find dead transitions.
[2025-06-02 18:45:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/295 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 1 (OVERLAPS) 1/296 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 499 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:09] [INFO ] Deduced a trap composed of 73 places in 368 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:09] [INFO ] Deduced a trap composed of 139 places in 296 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:10] [INFO ] Deduced a trap composed of 85 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:11] [INFO ] Deduced a trap composed of 65 places in 262 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:11] [INFO ] Deduced a trap composed of 72 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:12] [INFO ] Deduced a trap composed of 85 places in 97 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:12] [INFO ] Deduced a trap composed of 51 places in 250 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:16] [INFO ] Deduced a trap composed of 78 places in 126 ms of which 12 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 499 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:17] [INFO ] Deduced a trap composed of 148 places in 268 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:18] [INFO ] Deduced a trap composed of 148 places in 322 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:19] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:19] [INFO ] Deduced a trap composed of 148 places in 199 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:20] [INFO ] Deduced a trap composed of 53 places in 191 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:21] [INFO ] Deduced a trap composed of 103 places in 161 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:24] [INFO ] Deduced a trap composed of 72 places in 71 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 499 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 296/796 variables, and 22 constraints, problems are : Problem set: 0 solved, 499 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/296 constraints, PredecessorRefiner: 499/499 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 499 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/295 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 1 (OVERLAPS) 1/296 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 4 (OVERLAPS) 500/796 variables, 296/318 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/796 variables, 499/817 constraints. Problems are: Problem set: 0 solved, 499 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:50] [INFO ] Deduced a trap composed of 74 places in 107 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:46:54] [INFO ] Deduced a trap composed of 75 places in 283 ms of which 44 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 796/796 variables, and 819 constraints, problems are : Problem set: 0 solved, 499 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 296/296 constraints, PredecessorRefiner: 499/499 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60149ms problems are : Problem set: 0 solved, 499 unsolved
Search for dead transitions found 0 dead transitions in 60152ms
Starting structural reductions in LTL mode, iteration 1 : 296/353 places, 500/581 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61186 ms. Remains : 296/353 places, 500/581 transitions.
[2025-06-02 18:46:55] [INFO ] Flatten gal took : 19 ms
[2025-06-02 18:46:55] [INFO ] Flatten gal took : 19 ms
[2025-06-02 18:46:55] [INFO ] Input system was already deterministic with 500 transitions.
[2025-06-02 18:46:55] [INFO ] Flatten gal took : 19 ms
[2025-06-02 18:46:55] [INFO ] Flatten gal took : 19 ms
[2025-06-02 18:46:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality2944720111729450807.gal : 3 ms
[2025-06-02 18:46:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality2775376667762707809.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/CTLCardinality2944720111729450807.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2775376667762707809.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.
Detected timeout of ITS tools.
[2025-06-02 18:47:25] [INFO ] Flatten gal took : 12 ms
[2025-06-02 18:47:25] [INFO ] Applying decomposition
[2025-06-02 18:47:25] [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/graph11177341969648402452.txt' '-o' '/tmp/graph11177341969648402452.bin' '-w' '/tmp/graph11177341969648402452.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11177341969648402452.bin' '-l' '-1' '-v' '-w' '/tmp/graph11177341969648402452.weights' '-q' '0' '-e' '0.001'
[2025-06-02 18:47:25] [INFO ] Decomposing Gal with order
[2025-06-02 18:47:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 18:47:25] [INFO ] Removed a total of 529 redundant transitions.
[2025-06-02 18:47:25] [INFO ] Flatten gal took : 22 ms
[2025-06-02 18:47:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 4 ms.
[2025-06-02 18:47:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality9464730257804250119.gal : 3 ms
[2025-06-02 18:47:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality4574046441772253097.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/CTLCardinality9464730257804250119.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4574046441772253097.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.96349e+11,16.4918,431848,3372,41,627924,1074,882,2.6807e+06,67,3166,0


Converting to forward existential form...Done !
original formula: EX(EG(EF((i5.u53.p206==1))))
=> equivalent forward existential formula: [FwdG(EY(Init),E(TRUE U (i5.u53.p206==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t22, t117, t220, t233, t235, t244, t285, t334, t351, t352, t360, t364, t386, t387, t388, t401...1165
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 581/581 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 350 transition count 581
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 38 place count 315 transition count 525
Iterating global reduction 1 with 35 rules applied. Total rules applied 73 place count 315 transition count 525
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 74 place count 315 transition count 524
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 83 place count 306 transition count 511
Iterating global reduction 2 with 9 rules applied. Total rules applied 92 place count 306 transition count 511
Applied a total of 92 rules in 21 ms. Remains 306 /353 variables (removed 47) and now considering 511/581 (removed 70) transitions.
// Phase 1: matrix 511 rows 306 cols
[2025-06-02 18:47:55] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:47:56] [INFO ] Implicit Places using invariants in 313 ms returned []
[2025-06-02 18:47:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:47:56] [INFO ] Implicit Places using invariants and state equation in 692 ms returned []
Implicit Place search using SMT with State Equation took 1025 ms to find 0 implicit places.
Running 510 sub problems to find dead transitions.
[2025-06-02 18:47: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/305 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 1 (OVERLAPS) 1/306 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 510 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:48:12] [INFO ] Deduced a trap composed of 73 places in 353 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:48:13] [INFO ] Deduced a trap composed of 141 places in 303 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:48:13] [INFO ] Deduced a trap composed of 72 places in 267 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:48:13] [INFO ] Deduced a trap composed of 51 places in 293 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:48:15] [INFO ] Deduced a trap composed of 87 places in 119 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:48:16] [INFO ] Deduced a trap composed of 86 places in 109 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:48:16] [INFO ] Deduced a trap composed of 85 places in 119 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:48:17] [INFO ] Deduced a trap composed of 65 places in 298 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:48:21] [INFO ] Deduced a trap composed of 74 places in 120 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 510 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:48:23] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:48:25] [INFO ] Deduced a trap composed of 53 places in 281 ms of which 25 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/817 variables, and 18 constraints, problems are : Problem set: 0 solved, 510 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/306 constraints, PredecessorRefiner: 510/510 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 510 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 1 (OVERLAPS) 1/306 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 510 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:48:32] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 5 (OVERLAPS) 511/817 variables, 306/325 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/817 variables, 510/835 constraints. Problems are: Problem set: 0 solved, 510 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 817/817 variables, and 835 constraints, problems are : Problem set: 0 solved, 510 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 306/306 constraints, PredecessorRefiner: 510/510 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60208ms problems are : Problem set: 0 solved, 510 unsolved
Search for dead transitions found 0 dead transitions in 60210ms
Starting structural reductions in LTL mode, iteration 1 : 306/353 places, 511/581 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61260 ms. Remains : 306/353 places, 511/581 transitions.
[2025-06-02 18:48:57] [INFO ] Flatten gal took : 11 ms
[2025-06-02 18:48:57] [INFO ] Flatten gal took : 11 ms
[2025-06-02 18:48:57] [INFO ] Input system was already deterministic with 511 transitions.
[2025-06-02 18:48:57] [INFO ] Flatten gal took : 11 ms
[2025-06-02 18:48:57] [INFO ] Flatten gal took : 11 ms
[2025-06-02 18:48:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality3347620020956186203.gal : 2 ms
[2025-06-02 18:48:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality8100182540807840197.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/CTLCardinality3347620020956186203.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8100182540807840197.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.
Detected timeout of ITS tools.
[2025-06-02 18:49:27] [INFO ] Flatten gal took : 17 ms
[2025-06-02 18:49:27] [INFO ] Applying decomposition
[2025-06-02 18:49:27] [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/graph14144470680121436960.txt' '-o' '/tmp/graph14144470680121436960.bin' '-w' '/tmp/graph14144470680121436960.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14144470680121436960.bin' '-l' '-1' '-v' '-w' '/tmp/graph14144470680121436960.weights' '-q' '0' '-e' '0.001'
[2025-06-02 18:49:27] [INFO ] Decomposing Gal with order
[2025-06-02 18:49:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 18:49:27] [INFO ] Removed a total of 506 redundant transitions.
[2025-06-02 18:49:27] [INFO ] Flatten gal took : 35 ms
[2025-06-02 18:49:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 39 labels/synchronizations in 5 ms.
[2025-06-02 18:49:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality2790886132675810105.gal : 5 ms
[2025-06-02 18:49:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality11693772647704215836.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/CTLCardinality2790886132675810105.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11693772647704215836.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,2.45049e+11,10.551,232016,2841,55,329135,2195,1034,1.01376e+06,73,7731,0


Converting to forward existential form...Done !
original formula: (AF(((i11.i0.u49.p196==0)||(i12.i1.u103.p376==1))) * E((i12.i0.u70.p261==0) U (((i1.u46.p181==0)||(i14.i1.u114.p420==1)) * !(E(EX((i1.u95...215
=> equivalent forward existential formula: ([FwdG(Init,!(((i11.i0.u49.p196==0)||(i12.i1.u103.p376==1))))] = FALSE * [(Init * !(E((i12.i0.u70.p261==0) U (((...282
Reverse transition relation is NOT exact ! Due to transitions t26, t127, t157, t225, t230, t231, t244, t245, t255, t260, t265, t270, t275, t280, t282, t283...1145
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 581/581 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 350 transition count 581
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 37 place count 316 transition count 526
Iterating global reduction 1 with 34 rules applied. Total rules applied 71 place count 316 transition count 526
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 72 place count 316 transition count 525
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 83 place count 305 transition count 510
Iterating global reduction 2 with 11 rules applied. Total rules applied 94 place count 305 transition count 510
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 95 place count 305 transition count 509
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 97 place count 303 transition count 507
Iterating global reduction 3 with 2 rules applied. Total rules applied 99 place count 303 transition count 507
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 101 place count 301 transition count 505
Iterating global reduction 3 with 2 rules applied. Total rules applied 103 place count 301 transition count 505
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 104 place count 300 transition count 504
Iterating global reduction 3 with 1 rules applied. Total rules applied 105 place count 300 transition count 504
Applied a total of 105 rules in 20 ms. Remains 300 /353 variables (removed 53) and now considering 504/581 (removed 77) transitions.
// Phase 1: matrix 504 rows 300 cols
[2025-06-02 18:49:57] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:49:57] [INFO ] Implicit Places using invariants in 254 ms returned []
[2025-06-02 18:49:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:49:58] [INFO ] Implicit Places using invariants and state equation in 661 ms returned []
Implicit Place search using SMT with State Equation took 945 ms to find 0 implicit places.
Running 503 sub problems to find dead transitions.
[2025-06-02 18:49: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/299 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (OVERLAPS) 1/300 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:50:13] [INFO ] Deduced a trap composed of 74 places in 372 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:50:14] [INFO ] Deduced a trap composed of 143 places in 379 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:50:14] [INFO ] Deduced a trap composed of 74 places in 240 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:50:14] [INFO ] Deduced a trap composed of 74 places in 258 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:50:16] [INFO ] Deduced a trap composed of 87 places in 328 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:50:16] [INFO ] Deduced a trap composed of 75 places in 300 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:50:18] [INFO ] Deduced a trap composed of 86 places in 138 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:50:18] [INFO ] Deduced a trap composed of 52 places in 241 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:50:18] [INFO ] Deduced a trap composed of 54 places in 310 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:50:19] [INFO ] Deduced a trap composed of 66 places in 291 ms of which 47 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:50:24] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:50:26] [INFO ] Deduced a trap composed of 87 places in 110 ms of which 12 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 300/804 variables, and 19 constraints, problems are : Problem set: 0 solved, 503 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/300 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/299 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (OVERLAPS) 1/300 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:50:36] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (OVERLAPS) 504/804 variables, 300/320 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/804 variables, 503/823 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 804/804 variables, and 823 constraints, problems are : Problem set: 0 solved, 503 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 300/300 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60151ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 60153ms
Starting structural reductions in LTL mode, iteration 1 : 300/353 places, 504/581 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61120 ms. Remains : 300/353 places, 504/581 transitions.
[2025-06-02 18:50:58] [INFO ] Flatten gal took : 10 ms
[2025-06-02 18:50:58] [INFO ] Flatten gal took : 11 ms
[2025-06-02 18:50:58] [INFO ] Input system was already deterministic with 504 transitions.
[2025-06-02 18:50:58] [INFO ] Flatten gal took : 11 ms
[2025-06-02 18:50:58] [INFO ] Flatten gal took : 11 ms
[2025-06-02 18:50:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality10143708697518132857.gal : 2 ms
[2025-06-02 18:50:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality8278266971928597989.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/CTLCardinality10143708697518132857.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8278266971928597989.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-06-02 18:51:28] [INFO ] Flatten gal took : 12 ms
[2025-06-02 18:51:28] [INFO ] Applying decomposition
[2025-06-02 18:51:28] [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/graph7962845926614717949.txt' '-o' '/tmp/graph7962845926614717949.bin' '-w' '/tmp/graph7962845926614717949.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7962845926614717949.bin' '-l' '-1' '-v' '-w' '/tmp/graph7962845926614717949.weights' '-q' '0' '-e' '0.001'
[2025-06-02 18:51:28] [INFO ] Decomposing Gal with order
[2025-06-02 18:51:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 18:51:28] [INFO ] Removed a total of 527 redundant transitions.
[2025-06-02 18:51:28] [INFO ] Flatten gal took : 36 ms
[2025-06-02 18:51:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 37 labels/synchronizations in 2 ms.
[2025-06-02 18:51:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality2054493817853671888.gal : 3 ms
[2025-06-02 18:51:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality13188525706108618319.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/CTLCardinality2054493817853671888.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13188525706108618319.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 : 353/353 places, 581/581 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 350 transition count 581
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 39 place count 314 transition count 524
Iterating global reduction 1 with 36 rules applied. Total rules applied 75 place count 314 transition count 524
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 76 place count 314 transition count 523
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 86 place count 304 transition count 509
Iterating global reduction 2 with 10 rules applied. Total rules applied 96 place count 304 transition count 509
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 97 place count 304 transition count 508
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 98 place count 303 transition count 507
Iterating global reduction 3 with 1 rules applied. Total rules applied 99 place count 303 transition count 507
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 100 place count 302 transition count 506
Iterating global reduction 3 with 1 rules applied. Total rules applied 101 place count 302 transition count 506
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 102 place count 301 transition count 505
Iterating global reduction 3 with 1 rules applied. Total rules applied 103 place count 301 transition count 505
Applied a total of 103 rules in 18 ms. Remains 301 /353 variables (removed 52) and now considering 505/581 (removed 76) transitions.
// Phase 1: matrix 505 rows 301 cols
[2025-06-02 18:51:58] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:51:59] [INFO ] Implicit Places using invariants in 202 ms returned []
[2025-06-02 18:51:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:51:59] [INFO ] Implicit Places using invariants and state equation in 460 ms returned []
Implicit Place search using SMT with State Equation took 683 ms to find 0 implicit places.
Running 504 sub problems to find dead transitions.
[2025-06-02 18:51:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/300 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 1 (OVERLAPS) 1/301 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 504 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:52:15] [INFO ] Deduced a trap composed of 73 places in 350 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:52:15] [INFO ] Deduced a trap composed of 140 places in 313 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:52:15] [INFO ] Deduced a trap composed of 72 places in 229 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:52:16] [INFO ] Deduced a trap composed of 73 places in 141 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:52:16] [INFO ] Deduced a trap composed of 78 places in 95 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:52:17] [INFO ] Deduced a trap composed of 85 places in 115 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:52:18] [INFO ] Deduced a trap composed of 85 places in 121 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:52:19] [INFO ] Deduced a trap composed of 51 places in 227 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:52:19] [INFO ] Deduced a trap composed of 53 places in 275 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:52:20] [INFO ] Deduced a trap composed of 65 places in 319 ms of which 45 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 504 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:52:25] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 301/806 variables, and 18 constraints, problems are : Problem set: 0 solved, 504 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/301 constraints, PredecessorRefiner: 504/504 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 504 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/300 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 1 (OVERLAPS) 1/301 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 4 (OVERLAPS) 505/806 variables, 301/319 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/806 variables, 504/823 constraints. Problems are: Problem set: 0 solved, 504 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:52:55] [INFO ] Deduced a trap composed of 103 places in 398 ms of which 73 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 806/806 variables, and 824 constraints, problems are : Problem set: 0 solved, 504 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 504/504 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60155ms problems are : Problem set: 0 solved, 504 unsolved
Search for dead transitions found 0 dead transitions in 60156ms
Starting structural reductions in LTL mode, iteration 1 : 301/353 places, 505/581 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60859 ms. Remains : 301/353 places, 505/581 transitions.
[2025-06-02 18:52:59] [INFO ] Flatten gal took : 18 ms
[2025-06-02 18:52:59] [INFO ] Flatten gal took : 19 ms
[2025-06-02 18:52:59] [INFO ] Input system was already deterministic with 505 transitions.
[2025-06-02 18:52:59] [INFO ] Flatten gal took : 19 ms
[2025-06-02 18:52:59] [INFO ] Flatten gal took : 19 ms
[2025-06-02 18:52:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality15708414512035109365.gal : 3 ms
[2025-06-02 18:52:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality12081470903426184883.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/CTLCardinality15708414512035109365.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12081470903426184883.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-06-02 18:53:29] [INFO ] Flatten gal took : 12 ms
[2025-06-02 18:53:29] [INFO ] Applying decomposition
[2025-06-02 18:53:29] [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/graph18327317518451425294.txt' '-o' '/tmp/graph18327317518451425294.bin' '-w' '/tmp/graph18327317518451425294.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18327317518451425294.bin' '-l' '-1' '-v' '-w' '/tmp/graph18327317518451425294.weights' '-q' '0' '-e' '0.001'
[2025-06-02 18:53:29] [INFO ] Decomposing Gal with order
[2025-06-02 18:53:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 18:53:29] [INFO ] Removed a total of 526 redundant transitions.
[2025-06-02 18:53:29] [INFO ] Flatten gal took : 22 ms
[2025-06-02 18:53:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 25 labels/synchronizations in 7 ms.
[2025-06-02 18:53:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality858730929862470789.gal : 5 ms
[2025-06-02 18:53:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality4067217352054956963.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/CTLCardinality858730929862470789.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4067217352054956963.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 -...261
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,2.24469e+11,20.7711,450712,2948,43,512635,1268,907,3.16175e+06,71,3684,0


Converting to forward existential form...Done !
original formula: AX((EX(AF((i7.u65.p242==1))) + AG(!(A(A((i6.u56.p217==1) U (i13.i0.i0.u110.p404==1)) U (i8.u99.p372==1))))))
=> equivalent forward existential formula: [((FwdU((EY(Init) * !(EX(!(EG(!((i7.u65.p242==1))))))),TRUE) * !(EG(!((i8.u99.p372==1))))) * !(E(!((i8.u99.p372=...324
Reverse transition relation is NOT exact ! Due to transitions t23, t122, t225, t238, t249, t254, t259, t264, t269, t274, t276, t277, t290, t292, t339, t348...1119
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 581/581 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 350 transition count 581
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 37 place count 316 transition count 527
Iterating global reduction 1 with 34 rules applied. Total rules applied 71 place count 316 transition count 527
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 72 place count 316 transition count 526
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 83 place count 305 transition count 512
Iterating global reduction 2 with 11 rules applied. Total rules applied 94 place count 305 transition count 512
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 95 place count 305 transition count 511
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 97 place count 303 transition count 509
Iterating global reduction 3 with 2 rules applied. Total rules applied 99 place count 303 transition count 509
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 101 place count 301 transition count 507
Iterating global reduction 3 with 2 rules applied. Total rules applied 103 place count 301 transition count 507
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 104 place count 300 transition count 506
Iterating global reduction 3 with 1 rules applied. Total rules applied 105 place count 300 transition count 506
Applied a total of 105 rules in 23 ms. Remains 300 /353 variables (removed 53) and now considering 506/581 (removed 75) transitions.
// Phase 1: matrix 506 rows 300 cols
[2025-06-02 18:54:00] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:54:00] [INFO ] Implicit Places using invariants in 232 ms returned []
[2025-06-02 18:54:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:54:01] [INFO ] Implicit Places using invariants and state equation in 701 ms returned []
Implicit Place search using SMT with State Equation took 969 ms to find 0 implicit places.
Running 505 sub problems to find dead transitions.
[2025-06-02 18:54:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/299 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 1 (OVERLAPS) 1/300 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 505 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:54:16] [INFO ] Deduced a trap composed of 76 places in 372 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:54:17] [INFO ] Deduced a trap composed of 139 places in 316 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:54:17] [INFO ] Deduced a trap composed of 72 places in 243 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:54:18] [INFO ] Deduced a trap composed of 72 places in 302 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:54:18] [INFO ] Deduced a trap composed of 74 places in 253 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:54:18] [INFO ] Deduced a trap composed of 141 places in 302 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:54:18] [INFO ] Deduced a trap composed of 28 places in 169 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:54:20] [INFO ] Deduced a trap composed of 87 places in 296 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:54:20] [INFO ] Deduced a trap composed of 74 places in 123 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:54:20] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:54:21] [INFO ] Deduced a trap composed of 86 places in 95 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:54:22] [INFO ] Deduced a trap composed of 52 places in 230 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:54:23] [INFO ] Deduced a trap composed of 66 places in 296 ms of which 51 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 505 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 300/806 variables, and 20 constraints, problems are : Problem set: 0 solved, 505 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/300 constraints, PredecessorRefiner: 505/505 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 505 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/299 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 1 (OVERLAPS) 1/300 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 4 (OVERLAPS) 506/806 variables, 300/320 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/806 variables, 505/825 constraints. Problems are: Problem set: 0 solved, 505 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 806/806 variables, and 825 constraints, problems are : Problem set: 0 solved, 505 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 300/300 constraints, PredecessorRefiner: 505/505 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60158ms problems are : Problem set: 0 solved, 505 unsolved
Search for dead transitions found 0 dead transitions in 60160ms
Starting structural reductions in LTL mode, iteration 1 : 300/353 places, 506/581 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61154 ms. Remains : 300/353 places, 506/581 transitions.
[2025-06-02 18:55:01] [INFO ] Flatten gal took : 18 ms
[2025-06-02 18:55:01] [INFO ] Flatten gal took : 19 ms
[2025-06-02 18:55:01] [INFO ] Input system was already deterministic with 506 transitions.
[2025-06-02 18:55:01] [INFO ] Flatten gal took : 19 ms
[2025-06-02 18:55:01] [INFO ] Flatten gal took : 20 ms
[2025-06-02 18:55:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality1232511315178779163.gal : 4 ms
[2025-06-02 18:55:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality8495848705767531288.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/CTLCardinality1232511315178779163.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8495848705767531288.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.
Detected timeout of ITS tools.
[2025-06-02 18:55:31] [INFO ] Flatten gal took : 12 ms
[2025-06-02 18:55:31] [INFO ] Applying decomposition
[2025-06-02 18:55:31] [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/graph16336253356451084167.txt' '-o' '/tmp/graph16336253356451084167.bin' '-w' '/tmp/graph16336253356451084167.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16336253356451084167.bin' '-l' '-1' '-v' '-w' '/tmp/graph16336253356451084167.weights' '-q' '0' '-e' '0.001'
[2025-06-02 18:55:31] [INFO ] Decomposing Gal with order
[2025-06-02 18:55:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 18:55:31] [INFO ] Removed a total of 508 redundant transitions.
[2025-06-02 18:55:31] [INFO ] Flatten gal took : 20 ms
[2025-06-02 18:55:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 6 ms.
[2025-06-02 18:55:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality9183596609616921947.gal : 4 ms
[2025-06-02 18:55:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality6288198856316608517.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/CTLCardinality9183596609616921947.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6288198856316608517.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.
[2025-06-02 18:56:01] [INFO ] Flatten gal took : 18 ms
[2025-06-02 18:56:01] [INFO ] Flatten gal took : 46 ms
[2025-06-02 18:56:01] [INFO ] Applying decomposition
[2025-06-02 18:56:01] [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/graph4886126222874356576.txt' '-o' '/tmp/graph4886126222874356576.bin' '-w' '/tmp/graph4886126222874356576.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4886126222874356576.bin' '-l' '-1' '-v' '-w' '/tmp/graph4886126222874356576.weights' '-q' '0' '-e' '0.001'
[2025-06-02 18:56:01] [INFO ] Decomposing Gal with order
[2025-06-02 18:56:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 18:56:01] [INFO ] Removed a total of 558 redundant transitions.
[2025-06-02 18:56:01] [INFO ] Flatten gal took : 26 ms
[2025-06-02 18:56:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 3 ms.
[2025-06-02 18:56:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality13294866135886372190.gal : 13 ms
[2025-06-02 18:56:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality7892283795048296683.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/CTLCardinality13294866135886372190.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7892283795048296683.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 11 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.53495e+11,42.5474,861696,6982,152,1.11644e+06,5537,1064,5.24167e+06,102,21984,0


Converting to forward existential form...Done !
original formula: E(A((i2.u92.p298==1) U ((i10.u89.p280==0)||(i8.i0.i1.u71.p234==1))) U (i0.i1.i1.u15.p66==1))
=> equivalent forward existential formula: [(FwdU(Init,!((E(!(((i10.u89.p280==0)||(i8.i0.i1.u71.p234==1))) U (!((i2.u92.p298==1)) * !(((i10.u89.p280==0)||(...271
Reverse transition relation is NOT exact ! Due to transitions t27, t173, t235, t245, t261, t271, t282, t284, t293, t294, t319, t321, t322, t337, t339, t341...1432
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12

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="FireWire-PT-17"
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 FireWire-PT-17, 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 r086-smll-174860102400369"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-17.tgz
mv FireWire-PT-17 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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;