fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r086-smll-174860102300313
Last Updated
June 24, 2025

About the Execution of ITS-Tools for FireWire-PT-10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 923353.00 0.00 0.00 FTTFFTFTTTTTTFTT normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K 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 84K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K 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 101K 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-10-CTLCardinality-2024-12
FORMULA_NAME FireWire-PT-10-CTLCardinality-2024-13
FORMULA_NAME FireWire-PT-10-CTLCardinality-2024-14
FORMULA_NAME FireWire-PT-10-CTLCardinality-2024-15
FORMULA_NAME FireWire-PT-10-CTLCardinality-2025-00
FORMULA_NAME FireWire-PT-10-CTLCardinality-2025-01
FORMULA_NAME FireWire-PT-10-CTLCardinality-2025-02
FORMULA_NAME FireWire-PT-10-CTLCardinality-2025-03
FORMULA_NAME FireWire-PT-10-CTLCardinality-2025-04
FORMULA_NAME FireWire-PT-10-CTLCardinality-2025-05
FORMULA_NAME FireWire-PT-10-CTLCardinality-2025-06
FORMULA_NAME FireWire-PT-10-CTLCardinality-2025-07
FORMULA_NAME FireWire-PT-10-CTLCardinality-2025-08
FORMULA_NAME FireWire-PT-10-CTLCardinality-2025-09
FORMULA_NAME FireWire-PT-10-CTLCardinality-2025-10
FORMULA_NAME FireWire-PT-10-CTLCardinality-2025-11

=== Now, execution of the tool begins

BK_START 1748859041666

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-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-02 10:10:43] [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 10:10:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 10:10:44] [INFO ] Load time of PNML (sax parser for PT used): 193 ms
[2025-06-02 10:10:44] [INFO ] Transformed 131 places.
[2025-06-02 10:10:44] [INFO ] Transformed 409 transitions.
[2025-06-02 10:10:44] [INFO ] Found NUPN structural information;
[2025-06-02 10:10:44] [INFO ] Parsed PT model containing 131 places and 409 transitions and 1529 arcs in 427 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 35 ms.
Ensure Unique test removed 56 transitions
Reduce redundant transitions removed 56 transitions.
FORMULA FireWire-PT-10-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 94 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 353/353 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 131 transition count 347
Applied a total of 6 rules in 51 ms. Remains 131 /131 variables (removed 0) and now considering 347/353 (removed 6) transitions.
[2025-06-02 10:10:44] [INFO ] Flow matrix only has 321 transitions (discarded 26 similar events)
// Phase 1: matrix 321 rows 131 cols
[2025-06-02 10:10:44] [INFO ] Computed 8 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:10:45] [INFO ] Implicit Places using invariants in 439 ms returned []
[2025-06-02 10:10:45] [INFO ] Flow matrix only has 321 transitions (discarded 26 similar events)
[2025-06-02 10:10:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:10:45] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-06-02 10:10:45] [INFO ] Implicit Places using invariants and state equation in 520 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1052 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 130/131 places, 347/353 transitions.
Applied a total of 0 rules in 13 ms. Remains 130 /130 variables (removed 0) and now considering 347/347 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1154 ms. Remains : 130/131 places, 347/353 transitions.
Support contains 94 out of 130 places after structural reductions.
[2025-06-02 10:10:46] [INFO ] Flatten gal took : 132 ms
[2025-06-02 10:10:46] [INFO ] Flatten gal took : 65 ms
[2025-06-02 10:10:46] [INFO ] Input system was already deterministic with 347 transitions.
Support contains 85 out of 130 places (down from 94) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 75 to 69
RANDOM walk for 40000 steps (2279 resets) in 3703 ms. (10 steps per ms) remains 38/69 properties
BEST_FIRST walk for 4003 steps (58 resets) in 47 ms. (83 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4000 steps (60 resets) in 62 ms. (63 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (54 resets) in 59 ms. (66 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (83 resets) in 56 ms. (70 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (59 resets) in 31 ms. (125 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (65 resets) in 33 ms. (117 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (65 resets) in 72 ms. (54 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (70 resets) in 38 ms. (102 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (46 resets) in 25 ms. (153 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (59 resets) in 18 ms. (210 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (71 resets) in 23 ms. (166 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (57 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (56 resets) in 17 ms. (222 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (49 resets) in 13 ms. (285 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (62 resets) in 17 ms. (222 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (53 resets) in 17 ms. (222 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (71 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (58 resets) in 21 ms. (181 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (35 resets) in 47 ms. (83 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (47 resets) in 18 ms. (210 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (67 resets) in 18 ms. (210 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (57 resets) in 33 ms. (117 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (53 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (62 resets) in 20 ms. (190 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (63 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (64 resets) in 43 ms. (91 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (50 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (55 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (56 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (69 resets) in 27 ms. (142 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (43 resets) in 51 ms. (77 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (47 resets) in 32 ms. (121 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (58 resets) in 21 ms. (181 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (53 resets) in 26 ms. (148 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (72 resets) in 24 ms. (160 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (62 resets) in 17 ms. (222 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (48 resets) in 30 ms. (129 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (74 resets) in 26 ms. (148 steps per ms) remains 38/38 properties
[2025-06-02 10:10:48] [INFO ] Flow matrix only has 321 transitions (discarded 26 similar events)
// Phase 1: matrix 321 rows 130 cols
[2025-06-02 10:10:48] [INFO ] Computed 7 invariants in 10 ms
[2025-06-02 10:10:48] [INFO ] State equation strengthened by 45 read => feed constraints.
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/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 38 unsolved
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp69 is UNSAT
At refinement iteration 2 (OVERLAPS) 74/124 variables, 6/56 constraints. Problems are: Problem set: 3 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 74/130 constraints. Problems are: Problem set: 3 solved, 35 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:10:49] [INFO ] Deduced a trap composed of 13 places in 229 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:10:49] [INFO ] Deduced a trap composed of 36 places in 120 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:10:49] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 3/133 constraints. Problems are: Problem set: 3 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/133 constraints. Problems are: Problem set: 3 solved, 35 unsolved
At refinement iteration 6 (OVERLAPS) 2/126 variables, 1/134 constraints. Problems are: Problem set: 3 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 2/136 constraints. Problems are: Problem set: 3 solved, 35 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:10:50] [INFO ] Deduced a trap composed of 22 places in 149 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:10:50] [INFO ] Deduced a trap composed of 18 places in 225 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:10:50] [INFO ] Deduced a trap composed of 54 places in 128 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 3/139 constraints. Problems are: Problem set: 3 solved, 35 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/139 constraints. Problems are: Problem set: 3 solved, 35 unsolved
At refinement iteration 10 (OVERLAPS) 320/446 variables, 126/265 constraints. Problems are: Problem set: 3 solved, 35 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/446 variables, 44/309 constraints. Problems are: Problem set: 3 solved, 35 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/446 variables, 0/309 constraints. Problems are: Problem set: 3 solved, 35 unsolved
At refinement iteration 13 (OVERLAPS) 4/450 variables, 4/313 constraints. Problems are: Problem set: 3 solved, 35 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/450 variables, 4/317 constraints. Problems are: Problem set: 3 solved, 35 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/450 variables, 0/317 constraints. Problems are: Problem set: 3 solved, 35 unsolved
At refinement iteration 16 (OVERLAPS) 1/451 variables, 1/318 constraints. Problems are: Problem set: 3 solved, 35 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 451/451 variables, and 318 constraints, problems are : Problem set: 3 solved, 35 unsolved in 5014 ms.
Refiners :[Domain max(s): 130/130 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 130/130 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 35 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 46/46 constraints. Problems are: Problem set: 3 solved, 35 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/46 constraints. Problems are: Problem set: 3 solved, 35 unsolved
At refinement iteration 2 (OVERLAPS) 78/124 variables, 6/52 constraints. Problems are: Problem set: 3 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 78/130 constraints. Problems are: Problem set: 3 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 5/135 constraints. Problems are: Problem set: 3 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/135 constraints. Problems are: Problem set: 3 solved, 35 unsolved
At refinement iteration 6 (OVERLAPS) 2/126 variables, 1/136 constraints. Problems are: Problem set: 3 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 2/138 constraints. Problems are: Problem set: 3 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 1/139 constraints. Problems are: Problem set: 3 solved, 35 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/139 constraints. Problems are: Problem set: 3 solved, 35 unsolved
At refinement iteration 10 (OVERLAPS) 320/446 variables, 126/265 constraints. Problems are: Problem set: 3 solved, 35 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/446 variables, 44/309 constraints. Problems are: Problem set: 3 solved, 35 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/446 variables, 30/339 constraints. Problems are: Problem set: 3 solved, 35 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:10:57] [INFO ] Deduced a trap along path composed of 2 places in 40 ms of which 5 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/446 variables, 1/340 constraints. Problems are: Problem set: 3 solved, 35 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 446/451 variables, and 340 constraints, problems are : Problem set: 3 solved, 35 unsolved in 5017 ms.
Refiners :[Domain max(s): 126/130 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 126/130 constraints, ReadFeed: 44/45 constraints, PredecessorRefiner: 30/38 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 10114ms problems are : Problem set: 3 solved, 35 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 46 out of 130 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 130/130 places, 347/347 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 130 transition count 344
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 6 place count 127 transition count 338
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 127 transition count 338
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 11 place count 127 transition count 336
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
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 13 place count 126 transition count 338
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 15 place count 126 transition count 336
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 16 place count 126 transition count 335
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 126 transition count 334
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 18 place count 125 transition count 334
Applied a total of 18 rules in 143 ms. Remains 125 /130 variables (removed 5) and now considering 334/347 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 125/130 places, 334/347 transitions.
RANDOM walk for 40000 steps (2172 resets) in 797 ms. (50 steps per ms) remains 33/35 properties
BEST_FIRST walk for 4003 steps (47 resets) in 24 ms. (160 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (56 resets) in 21 ms. (181 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (64 resets) in 27 ms. (143 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (68 resets) in 43 ms. (90 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (48 resets) in 23 ms. (166 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (46 resets) in 36 ms. (108 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (71 resets) in 40 ms. (97 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (49 resets) in 38 ms. (102 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (49 resets) in 34 ms. (114 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (76 resets) in 35 ms. (111 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (62 resets) in 35 ms. (111 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (62 resets) in 67 ms. (58 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (62 resets) in 26 ms. (148 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (50 resets) in 33 ms. (117 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (57 resets) in 33 ms. (117 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (57 resets) in 32 ms. (121 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (52 resets) in 38 ms. (102 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (42 resets) in 27 ms. (142 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (62 resets) in 26 ms. (148 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (81 resets) in 37 ms. (105 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (53 resets) in 34 ms. (114 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (52 resets) in 37 ms. (105 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (51 resets) in 29 ms. (133 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (80 resets) in 29 ms. (133 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4001 steps (50 resets) in 31 ms. (125 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (59 resets) in 33 ms. (117 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (60 resets) in 37 ms. (105 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (56 resets) in 24 ms. (160 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (60 resets) in 32 ms. (121 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (48 resets) in 31 ms. (125 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (51 resets) in 44 ms. (88 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (57 resets) in 26 ms. (148 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (48 resets) in 27 ms. (143 steps per ms) remains 33/33 properties
Interrupted probabilistic random walk after 403860 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :26 out of 33
Probabilistic random walk after 403860 steps, saw 93690 distinct states, run finished after 3011 ms. (steps per millisecond=134 ) properties seen :26
[2025-06-02 10:11:02] [INFO ] Flow matrix only has 310 transitions (discarded 24 similar events)
// Phase 1: matrix 310 rows 125 cols
[2025-06-02 10:11:02] [INFO ] Computed 7 invariants in 2 ms
[2025-06-02 10:11:02] [INFO ] State equation strengthened by 46 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 106/116 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:11:02] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:11:02] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 5/121 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 310/431 variables, 121/130 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/431 variables, 46/176 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:11:03] [INFO ] Deduced a trap composed of 15 places in 190 ms of which 22 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 4/435 variables, 4/181 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/435 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/435 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 435/435 variables, and 181 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1474 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 125/125 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 106/116 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 5/121 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:11:04] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 310/431 variables, 121/132 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 46/178 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 6/184 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/431 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 4/435 variables, 4/188 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/435 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/435 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 0/435 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 435/435 variables, and 189 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1412 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 125/125 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2906ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 1 properties in 2533 ms.
Support contains 8 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 334/334 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 123 transition count 329
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 123 transition count 329
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 123 transition count 328
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 121 transition count 332
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 13 place count 121 transition count 328
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 121 transition count 326
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 121 transition count 328
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 19 place count 120 transition count 326
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 21 place count 120 transition count 324
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 22 place count 119 transition count 323
Applied a total of 22 rules in 82 ms. Remains 119 /125 variables (removed 6) and now considering 323/334 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 119/125 places, 323/334 transitions.
RANDOM walk for 40000 steps (2295 resets) in 1024 ms. (39 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (585 resets) in 156 ms. (254 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (513 resets) in 129 ms. (307 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (562 resets) in 144 ms. (275 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (535 resets) in 119 ms. (333 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (535 resets) in 97 ms. (408 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (572 resets) in 80 ms. (493 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 464956 steps, run timeout after 3001 ms. (steps per millisecond=154 ) properties seen :0 out of 6
Probabilistic random walk after 464956 steps, saw 102499 distinct states, run finished after 3001 ms. (steps per millisecond=154 ) properties seen :0
[2025-06-02 10:11:11] [INFO ] Flow matrix only has 294 transitions (discarded 29 similar events)
// Phase 1: matrix 294 rows 119 cols
[2025-06-02 10:11:11] [INFO ] Computed 7 invariants in 2 ms
[2025-06-02 10:11:11] [INFO ] State equation strengthened by 44 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 90/98 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:11:11] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 285/383 variables, 98/103 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 29/412 variables, 20/123 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/412 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/412 variables, 44/169 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/412 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 1/413 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/413 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/413 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/413 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 413/413 variables, and 171 constraints, problems are : Problem set: 0 solved, 6 unsolved in 870 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 119/119 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 90/98 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 285/383 variables, 98/103 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 29/412 variables, 20/123 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/412 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/412 variables, 44/169 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/412 variables, 6/175 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:11:13] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:11:13] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/412 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/412 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 1/413 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/413 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/413 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/413 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 413/413 variables, and 179 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1632 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 119/119 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2523ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 1 properties in 1817 ms.
Support contains 8 out of 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 323/323 transitions.
Applied a total of 0 rules in 12 ms. Remains 119 /119 variables (removed 0) and now considering 323/323 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 119/119 places, 323/323 transitions.
RANDOM walk for 40000 steps (2364 resets) in 162 ms. (245 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (547 resets) in 57 ms. (689 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (517 resets) in 69 ms. (571 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (560 resets) in 61 ms. (645 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (567 resets) in 69 ms. (571 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (576 resets) in 81 ms. (487 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 527745 steps, run timeout after 3001 ms. (steps per millisecond=175 ) properties seen :0 out of 5
Probabilistic random walk after 527745 steps, saw 114090 distinct states, run finished after 3001 ms. (steps per millisecond=175 ) properties seen :0
[2025-06-02 10:11:19] [INFO ] Flow matrix only has 294 transitions (discarded 29 similar events)
[2025-06-02 10:11:19] [INFO ] Invariant cache hit.
[2025-06-02 10:11:19] [INFO ] State equation strengthened by 44 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 90/98 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:11:19] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 285/383 variables, 98/103 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 29/412 variables, 20/123 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/412 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/412 variables, 44/169 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/412 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1/413 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/413 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/413 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/413 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 413/413 variables, and 171 constraints, problems are : Problem set: 0 solved, 5 unsolved in 594 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 119/119 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 90/98 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 285/383 variables, 98/103 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 29/412 variables, 20/123 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/412 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/412 variables, 44/169 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/412 variables, 5/174 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:11:20] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/412 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:11:20] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/412 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/412 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 1/413 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/413 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/413 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/413 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 413/413 variables, and 178 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1440 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 119/119 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2063ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 2437 ms.
Support contains 8 out of 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 323/323 transitions.
Applied a total of 0 rules in 10 ms. Remains 119 /119 variables (removed 0) and now considering 323/323 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 119/119 places, 323/323 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 323/323 transitions.
Applied a total of 0 rules in 9 ms. Remains 119 /119 variables (removed 0) and now considering 323/323 (removed 0) transitions.
[2025-06-02 10:11:23] [INFO ] Flow matrix only has 294 transitions (discarded 29 similar events)
[2025-06-02 10:11:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:11:23] [INFO ] Implicit Places using invariants in 151 ms returned []
[2025-06-02 10:11:23] [INFO ] Flow matrix only has 294 transitions (discarded 29 similar events)
[2025-06-02 10:11:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:11:23] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-06-02 10:11:24] [INFO ] Implicit Places using invariants and state equation in 337 ms returned [34]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 492 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 118/119 places, 323/323 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 118 transition count 322
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 117 transition count 322
Applied a total of 2 rules in 26 ms. Remains 117 /118 variables (removed 1) and now considering 322/323 (removed 1) transitions.
[2025-06-02 10:11:24] [INFO ] Flow matrix only has 293 transitions (discarded 29 similar events)
// Phase 1: matrix 293 rows 117 cols
[2025-06-02 10:11:24] [INFO ] Computed 6 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:11:24] [INFO ] Implicit Places using invariants in 196 ms returned []
[2025-06-02 10:11:24] [INFO ] Flow matrix only has 293 transitions (discarded 29 similar events)
[2025-06-02 10:11:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:11:24] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-06-02 10:11:24] [INFO ] Implicit Places using invariants and state equation in 466 ms returned []
Implicit Place search using SMT with State Equation took 665 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 117/119 places, 322/323 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1192 ms. Remains : 117/119 places, 322/323 transitions.
RANDOM walk for 40000 steps (2341 resets) in 168 ms. (236 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (565 resets) in 50 ms. (784 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (585 resets) in 49 ms. (800 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (532 resets) in 61 ms. (645 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (571 resets) in 50 ms. (784 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (562 resets) in 56 ms. (701 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 506085 steps, run timeout after 3001 ms. (steps per millisecond=168 ) properties seen :0 out of 5
Probabilistic random walk after 506085 steps, saw 109403 distinct states, run finished after 3001 ms. (steps per millisecond=168 ) properties seen :0
[2025-06-02 10:11:27] [INFO ] Flow matrix only has 293 transitions (discarded 29 similar events)
[2025-06-02 10:11:27] [INFO ] Invariant cache hit.
[2025-06-02 10:11:27] [INFO ] State equation strengthened by 44 read => feed constraints.
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 89/97 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:11:28] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 284/381 variables, 97/102 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 28/409 variables, 19/121 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/409 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/409 variables, 44/166 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/409 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1/410 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/410 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/410 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/410 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 410/410 variables, and 168 constraints, problems are : Problem set: 0 solved, 5 unsolved in 729 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 117/117 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 89/97 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 284/381 variables, 97/102 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 28/409 variables, 19/121 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/409 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/409 variables, 44/166 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/409 variables, 5/171 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:11:29] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/409 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:11:29] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/409 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/409 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 1/410 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/410 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/410 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/410 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 410/410 variables, and 175 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1431 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 117/117 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2170ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 1589 ms.
Support contains 8 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 322/322 transitions.
Applied a total of 0 rules in 8 ms. Remains 117 /117 variables (removed 0) and now considering 322/322 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 117/117 places, 322/322 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 322/322 transitions.
Applied a total of 0 rules in 7 ms. Remains 117 /117 variables (removed 0) and now considering 322/322 (removed 0) transitions.
[2025-06-02 10:11:31] [INFO ] Flow matrix only has 293 transitions (discarded 29 similar events)
[2025-06-02 10:11:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:11:31] [INFO ] Implicit Places using invariants in 121 ms returned []
[2025-06-02 10:11:31] [INFO ] Flow matrix only has 293 transitions (discarded 29 similar events)
[2025-06-02 10:11:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:11:31] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-06-02 10:11:32] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 509 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 10:11:32] [INFO ] Redundant transitions in 42 ms returned []
Running 320 sub problems to find dead transitions.
[2025-06-02 10:11:32] [INFO ] Flow matrix only has 293 transitions (discarded 29 similar events)
[2025-06-02 10:11:32] [INFO ] Invariant cache hit.
[2025-06-02 10:11:32] [INFO ] State equation strengthened by 44 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:11:34] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:11:35] [INFO ] Deduced a trap composed of 41 places in 160 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:11:35] [INFO ] Deduced a trap composed of 21 places in 196 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:11:35] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:11:35] [INFO ] Deduced a trap composed of 39 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 10:11:36] [INFO ] Deduced a trap composed of 15 places in 173 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:11:37] [INFO ] Deduced a trap composed of 40 places in 171 ms of which 18 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (OVERLAPS) 293/409 variables, 116/129 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/409 variables, 44/173 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (OVERLAPS) 1/410 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/410 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 8 (OVERLAPS) 0/410 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 320 unsolved
No progress, stopping.
After SMT solving in domain Real declared 410/410 variables, and 174 constraints, problems are : Problem set: 0 solved, 320 unsolved in 22919 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 117/117 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 320 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:11:57] [INFO ] Deduced a trap composed of 15 places in 166 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (OVERLAPS) 293/409 variables, 116/130 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 44/174 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 320/494 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:12:08] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/409 variables, 1/495 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:12:12] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:12:15] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/409 variables, 2/497 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:12:25] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 409/410 variables, and 498 constraints, problems are : Problem set: 0 solved, 320 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 116/117 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 53352ms problems are : Problem set: 0 solved, 320 unsolved
Search for dead transitions found 0 dead transitions in 53358ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53932 ms. Remains : 117/117 places, 322/322 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 110 edges and 117 vertex of which 29 / 117 are part of one of the 4 SCC in 3 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 119 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 126 transitions.
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 0 with 2 rules applied. Total rules applied 3 place count 91 transition count 195
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 91 transition count 192
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 90 transition count 191
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 90 transition count 190
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 89 transition count 189
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 12 place count 88 transition count 157
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 88 transition count 157
Free-agglomeration rule applied 3 times with reduction of 2 identical transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 88 transition count 152
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 85 transition count 151
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 85 transition count 151
Applied a total of 22 rules in 57 ms. Remains 85 /117 variables (removed 32) and now considering 151/322 (removed 171) transitions.
Running SMT prover for 5 properties.
[2025-06-02 10:12:25] [INFO ] Flow matrix only has 149 transitions (discarded 2 similar events)
// Phase 1: matrix 149 rows 85 cols
[2025-06-02 10:12:25] [INFO ] Computed 6 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 10:12:25] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2025-06-02 10:12:25] [INFO ] After 257ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 10:12:26] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2025-06-02 10:12:26] [INFO ] After 145ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:12:26] [INFO ] Deduced a trap composed of 6 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 10:12:26] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:12:26] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 7 ms to minimize.
[2025-06-02 10:12:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 292 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:12:26] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 11 ms to minimize.
[2025-06-02 10:12:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
TRAPS : Iteration 1
[2025-06-02 10:12:26] [INFO ] After 791ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2025-06-02 10:12:26] [INFO ] After 948ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 1293 ms.
Successfully simplified 3 atomic propositions for a total of 15 simplifications.
[2025-06-02 10:12:27] [INFO ] Flatten gal took : 47 ms
[2025-06-02 10:12:27] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA FireWire-PT-10-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 10:12:27] [INFO ] Flatten gal took : 46 ms
[2025-06-02 10:12:27] [INFO ] Input system was already deterministic with 347 transitions.
Support contains 78 out of 130 places (down from 84) after GAL structural reductions.
Computed a total of 23 stabilizing places and 48 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 130/130 places, 347/347 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 125 transition count 338
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 125 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 125 transition count 335
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 124 transition count 334
Applied a total of 13 rules in 42 ms. Remains 124 /130 variables (removed 6) and now considering 334/347 (removed 13) transitions.
[2025-06-02 10:12:27] [INFO ] Flow matrix only has 308 transitions (discarded 26 similar events)
// Phase 1: matrix 308 rows 124 cols
[2025-06-02 10:12:27] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:12:27] [INFO ] Implicit Places using invariants in 181 ms returned []
[2025-06-02 10:12:27] [INFO ] Flow matrix only has 308 transitions (discarded 26 similar events)
[2025-06-02 10:12:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:12:27] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-02 10:12:27] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 639 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 10:12:27] [INFO ] Redundant transitions in 13 ms returned []
Running 331 sub problems to find dead transitions.
[2025-06-02 10:12:27] [INFO ] Flow matrix only has 308 transitions (discarded 26 similar events)
[2025-06-02 10:12:27] [INFO ] Invariant cache hit.
[2025-06-02 10:12:27] [INFO ] State equation strengthened by 43 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 331 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:12:30] [INFO ] Deduced a trap composed of 42 places in 163 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:12:30] [INFO ] Deduced a trap composed of 34 places in 172 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:12:30] [INFO ] Deduced a trap composed of 15 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 10:12:30] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:12:30] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:12:30] [INFO ] Deduced a trap composed of 21 places in 160 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:12:31] [INFO ] Deduced a trap composed of 21 places in 234 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:12:32] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:12:32] [INFO ] Deduced a trap composed of 15 places in 180 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:12:32] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 3 (OVERLAPS) 307/430 variables, 123/140 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/430 variables, 43/183 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/430 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 6 (OVERLAPS) 1/431 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 331 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 431/432 variables, and 184 constraints, problems are : Problem set: 0 solved, 331 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 331/331 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 331 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 3 (OVERLAPS) 307/430 variables, 123/140 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/430 variables, 43/183 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/430 variables, 331/514 constraints. Problems are: Problem set: 0 solved, 331 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:13:08] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/430 variables, 1/515 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/430 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 8 (OVERLAPS) 1/431 variables, 1/516 constraints. Problems are: Problem set: 0 solved, 331 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 431/432 variables, and 516 constraints, problems are : Problem set: 0 solved, 331 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 331/331 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60276ms problems are : Problem set: 0 solved, 331 unsolved
Search for dead transitions found 0 dead transitions in 60280ms
Starting structural reductions in SI_CTL mode, iteration 1 : 124/130 places, 334/347 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60988 ms. Remains : 124/130 places, 334/347 transitions.
[2025-06-02 10:13:28] [INFO ] Flatten gal took : 33 ms
[2025-06-02 10:13:28] [INFO ] Flatten gal took : 34 ms
[2025-06-02 10:13:28] [INFO ] Input system was already deterministic with 334 transitions.
[2025-06-02 10:13:28] [INFO ] Flatten gal took : 30 ms
[2025-06-02 10:13:28] [INFO ] Flatten gal took : 29 ms
[2025-06-02 10:13:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality5446478235853645037.gal : 15 ms
[2025-06-02 10:13:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality8179506769793082852.ctl : 6 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/CTLCardinality5446478235853645037.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8179506769793082852.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.69115e+06,3.14561,62352,2,2962,5,184805,6,0,829,211839,0


Converting to forward existential form...Done !
original formula: AF(((EF((p58==1)) * E((p39==0) U ((p23==0)||(p95==1)))) * EF(AG(((p79==0)&&(p51==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(((E(TRUE U (p58==1)) * E((p39==0) U ((p23==0)||(p95==1)))) * E(TRUE U !(E(TRUE U !(((p79==0)&&(p51=...175
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t5, t6, t10, t11, t13, t14, t16, t18, t22, t23, t25, t26, t28, t30, t34, t35, t37...705
(forward)formula 0,0,8.02169,128028,1,0,604,472725,692,310,7158,484787,680
FORMULA FireWire-PT-10-CTLCardinality-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 130/130 places, 347/347 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 125 transition count 338
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 125 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 125 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 124 transition count 332
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 124 transition count 332
Applied a total of 13 rules in 20 ms. Remains 124 /130 variables (removed 6) and now considering 332/347 (removed 15) transitions.
[2025-06-02 10:13:36] [INFO ] Flow matrix only has 306 transitions (discarded 26 similar events)
// Phase 1: matrix 306 rows 124 cols
[2025-06-02 10:13:36] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:13:36] [INFO ] Implicit Places using invariants in 174 ms returned []
[2025-06-02 10:13:36] [INFO ] Flow matrix only has 306 transitions (discarded 26 similar events)
[2025-06-02 10:13:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:13:36] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-06-02 10:13:37] [INFO ] Implicit Places using invariants and state equation in 376 ms returned [36]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 552 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 123/130 places, 332/347 transitions.
Applied a total of 0 rules in 9 ms. Remains 123 /123 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 581 ms. Remains : 123/130 places, 332/347 transitions.
[2025-06-02 10:13:37] [INFO ] Flatten gal took : 16 ms
[2025-06-02 10:13:37] [INFO ] Flatten gal took : 17 ms
[2025-06-02 10:13:37] [INFO ] Input system was already deterministic with 332 transitions.
[2025-06-02 10:13:37] [INFO ] Flatten gal took : 16 ms
[2025-06-02 10:13:37] [INFO ] Flatten gal took : 15 ms
[2025-06-02 10:13:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality7436754567629026466.gal : 6 ms
[2025-06-02 10:13:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality15486207359443376050.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/CTLCardinality7436754567629026466.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15486207359443376050.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.18014e+07,1.80524,40476,2,2338,5,108265,6,0,823,119599,0


Converting to forward existential form...Done !
original formula: EF(EG((((AF((p71==1)) * AF((p89==1))) * ((p20==1) * ((p62==1) + A((p60==0) U ((p53==0)||(p115==1)))))) * ((p80==0)||(p72==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(((!(EG(!((p71==1)))) * !(EG(!((p89==1))))) * ((p20==1) * ((p62==1) + !((E(!(((p53==0)||(p...279
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t5, t6, t10, t11, t13, t14, t16, t18, t22, t23, t25, t26, t28, t30, t34, t35, t37...700
(forward)formula 0,1,27.8477,600088,1,0,1126,3.26063e+06,707,575,6869,3.65078e+06,1234
FORMULA FireWire-PT-10-CTLCardinality-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 347/347 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 127 transition count 341
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 127 transition count 341
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 127 transition count 339
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 126 transition count 336
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 126 transition count 336
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 125 transition count 334
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 125 transition count 334
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 124 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 124 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 123 transition count 329
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 123 transition count 329
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 122 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 122 transition count 326
Applied a total of 18 rules in 7 ms. Remains 122 /130 variables (removed 8) and now considering 326/347 (removed 21) transitions.
[2025-06-02 10:14:05] [INFO ] Flow matrix only has 300 transitions (discarded 26 similar events)
// Phase 1: matrix 300 rows 122 cols
[2025-06-02 10:14:05] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:14:05] [INFO ] Implicit Places using invariants in 190 ms returned []
[2025-06-02 10:14:05] [INFO ] Flow matrix only has 300 transitions (discarded 26 similar events)
[2025-06-02 10:14:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:14:05] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-06-02 10:14:06] [INFO ] Implicit Places using invariants and state equation in 488 ms returned [38]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 680 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 121/130 places, 326/347 transitions.
Applied a total of 0 rules in 2 ms. Remains 121 /121 variables (removed 0) and now considering 326/326 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 691 ms. Remains : 121/130 places, 326/347 transitions.
[2025-06-02 10:14:06] [INFO ] Flatten gal took : 22 ms
[2025-06-02 10:14:06] [INFO ] Flatten gal took : 23 ms
[2025-06-02 10:14:06] [INFO ] Input system was already deterministic with 326 transitions.
[2025-06-02 10:14:06] [INFO ] Flatten gal took : 24 ms
[2025-06-02 10:14:06] [INFO ] Flatten gal took : 24 ms
[2025-06-02 10:14:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality6635366690110720134.gal : 5 ms
[2025-06-02 10:14:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality16966699991770174559.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/CTLCardinality6635366690110720134.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16966699991770174559.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.20467e+07,9.33579,211084,2,9287,5,560269,6,0,809,674340,0


Converting to forward existential form...Done !
original formula: AG((EG(EF((AF((p108==1)) * AF(((p10==0)||(p48==1)))))) + AX(AX((((EF(((p40==0)||(p26==1))) + (p64==0)) + ((p84==1)||(p17==0))) + (p58==1)...160
=> equivalent forward existential formula: [((((EY(EY((FwdU(Init,TRUE) * !(EG(E(TRUE U (!(EG(!((p108==1)))) * !(EG(!(((p10==0)||(p48==1)))))))))))) * !((p5...250
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...682
Detected timeout of ITS tools.
[2025-06-02 10:14:36] [INFO ] Flatten gal took : 14 ms
[2025-06-02 10:14:36] [INFO ] Applying decomposition
[2025-06-02 10:14: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/graph4896057975636354859.txt' '-o' '/tmp/graph4896057975636354859.bin' '-w' '/tmp/graph4896057975636354859.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4896057975636354859.bin' '-l' '-1' '-v' '-w' '/tmp/graph4896057975636354859.weights' '-q' '0' '-e' '0.001'
[2025-06-02 10:14:36] [INFO ] Decomposing Gal with order
[2025-06-02 10:14:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 10:14:36] [INFO ] Removed a total of 514 redundant transitions.
[2025-06-02 10:14:36] [INFO ] Flatten gal took : 140 ms
[2025-06-02 10:14:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 108 labels/synchronizations in 37 ms.
[2025-06-02 10:14:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality10546478286603808614.gal : 12 ms
[2025-06-02 10:14:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality4987619893938387724.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/CTLCardinality10546478286603808614.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4987619893938387724.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.20467e+07,10.2472,180188,1941,233,267732,1740,639,684798,89,15477,0


Converting to forward existential form...Done !
original formula: AG((EG(EF((AF((i7.i1.u37.p108==1)) * AF(((i1.u3.p10==0)||(i2.i1.u16.p48==1)))))) + AX(AX((((EF(((i2.i1.u12.p40==0)||(i2.i0.u4.p26==1))) +...232
=> equivalent forward existential formula: [((((EY(EY((FwdU(Init,TRUE) * !(EG(E(TRUE U (!(EG(!((i7.i1.u37.p108==1)))) * !(EG(!(((i1.u3.p10==0)||(i2.i1.u16....322
Reverse transition relation is NOT exact ! Due to transitions t6, t39, t41, t42, t45, t46, t48, t56, t61, t66, t67, t71, t76, t80, t88, t89, t90, t91, t94,...797
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 347/347 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 127 transition count 341
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 127 transition count 341
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 127 transition count 339
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 126 transition count 336
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 126 transition count 336
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 125 transition count 334
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 125 transition count 334
Applied a total of 12 rules in 5 ms. Remains 125 /130 variables (removed 5) and now considering 334/347 (removed 13) transitions.
[2025-06-02 10:15:06] [INFO ] Flow matrix only has 308 transitions (discarded 26 similar events)
// Phase 1: matrix 308 rows 125 cols
[2025-06-02 10:15:06] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:15:06] [INFO ] Implicit Places using invariants in 164 ms returned []
[2025-06-02 10:15:06] [INFO ] Flow matrix only has 308 transitions (discarded 26 similar events)
[2025-06-02 10:15:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:15:07] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-06-02 10:15:07] [INFO ] Implicit Places using invariants and state equation in 533 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 699 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/130 places, 334/347 transitions.
Applied a total of 0 rules in 1 ms. Remains 124 /124 variables (removed 0) and now considering 334/334 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 707 ms. Remains : 124/130 places, 334/347 transitions.
[2025-06-02 10:15:07] [INFO ] Flatten gal took : 20 ms
[2025-06-02 10:15:07] [INFO ] Flatten gal took : 22 ms
[2025-06-02 10:15:07] [INFO ] Input system was already deterministic with 334 transitions.
[2025-06-02 10:15:07] [INFO ] Flatten gal took : 22 ms
[2025-06-02 10:15:07] [INFO ] Flatten gal took : 22 ms
[2025-06-02 10:15:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality10204732741199261727.gal : 7 ms
[2025-06-02 10:15:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality3451465326535103381.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/CTLCardinality10204732741199261727.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3451465326535103381.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.19284e+07,11.5805,227720,2,9918,5,588778,6,0,829,766733,0


Converting to forward existential form...Done !
original formula: AX(A((p46==1) U EF(((p76!=1) * AG((p81==0))))))
=> equivalent forward existential formula: ([((FwdU(EY(Init),!(E(TRUE U ((p76!=1) * !(E(TRUE U !((p81==0)))))))) * !((p46==1))) * !(E(TRUE U ((p76!=1) * !(...269
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...705
Detected timeout of ITS tools.
[2025-06-02 10:15:37] [INFO ] Flatten gal took : 13 ms
[2025-06-02 10:15:37] [INFO ] Applying decomposition
[2025-06-02 10:15:37] [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/graph16821183089918806510.txt' '-o' '/tmp/graph16821183089918806510.bin' '-w' '/tmp/graph16821183089918806510.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16821183089918806510.bin' '-l' '-1' '-v' '-w' '/tmp/graph16821183089918806510.weights' '-q' '0' '-e' '0.001'
[2025-06-02 10:15:37] [INFO ] Decomposing Gal with order
[2025-06-02 10:15:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 10:15:37] [INFO ] Removed a total of 519 redundant transitions.
[2025-06-02 10:15:37] [INFO ] Flatten gal took : 33 ms
[2025-06-02 10:15:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 119 labels/synchronizations in 17 ms.
[2025-06-02 10:15:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality3232431489890754252.gal : 5 ms
[2025-06-02 10:15:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality12153619621216860232.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/CTLCardinality3232431489890754252.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12153619621216860232.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.19284e+07,22.2289,336768,2347,260,432763,4704,688,1.70008e+06,98,42799,0


Converting to forward existential form...Done !
original formula: AX(A((i3.i0.u15.p46==1) U EF(((i1.i2.u25.p76!=1) * AG((i0.u0.p81==0))))))
=> equivalent forward existential formula: ([((FwdU(EY(Init),!(E(TRUE U ((i1.i2.u25.p76!=1) * !(E(TRUE U !((i0.u0.p81==0)))))))) * !((i3.i0.u15.p46==1))) *...327
Reverse transition relation is NOT exact ! Due to transitions t6, t39, t41, t42, t45, t46, t48, t56, t61, t66, t71, t76, t84, t88, t89, t90, t91, t94, t139...887
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 347/347 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 126 transition count 339
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 126 transition count 339
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 126 transition count 336
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 125 transition count 333
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 125 transition count 333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 124 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 124 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 123 transition count 328
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 123 transition count 328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 122 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 122 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 121 transition count 323
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 121 transition count 323
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 120 transition count 321
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 120 transition count 321
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 119 transition count 318
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 119 transition count 318
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 118 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 118 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 117 transition count 313
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 115 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 115 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 114 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 114 transition count 307
Applied a total of 35 rules in 24 ms. Remains 114 /130 variables (removed 16) and now considering 307/347 (removed 40) transitions.
[2025-06-02 10:16:07] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
// Phase 1: matrix 281 rows 114 cols
[2025-06-02 10:16:07] [INFO ] Computed 7 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:16:08] [INFO ] Implicit Places using invariants in 187 ms returned []
[2025-06-02 10:16:08] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
[2025-06-02 10:16:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:16:08] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 10:16:08] [INFO ] Implicit Places using invariants and state equation in 399 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 589 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 113/130 places, 307/347 transitions.
Applied a total of 0 rules in 1 ms. Remains 113 /113 variables (removed 0) and now considering 307/307 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 616 ms. Remains : 113/130 places, 307/347 transitions.
[2025-06-02 10:16:08] [INFO ] Flatten gal took : 17 ms
[2025-06-02 10:16:08] [INFO ] Flatten gal took : 17 ms
[2025-06-02 10:16:08] [INFO ] Input system was already deterministic with 307 transitions.
[2025-06-02 10:16:08] [INFO ] Flatten gal took : 17 ms
[2025-06-02 10:16:08] [INFO ] Flatten gal took : 17 ms
[2025-06-02 10:16:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality7366640909077635054.gal : 5 ms
[2025-06-02 10:16:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality1777181990536575277.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7366640909077635054.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1777181990536575277.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.1577e+07,9.54818,184856,2,6965,5,477294,6,0,758,637251,0


Converting to forward existential form...Done !
original formula: EX(EX((p40==1)))
=> equivalent forward existential formula: [(EY(EY(Init)) * (p40==1))] != FALSE
(forward)formula 0,1,9.5672,184856,1,0,9,477294,8,1,1177,637251,3
FORMULA FireWire-PT-10-CTLCardinality-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 347/347 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 126 transition count 339
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 126 transition count 339
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 126 transition count 336
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 125 transition count 333
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 125 transition count 333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 124 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 124 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 123 transition count 328
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 123 transition count 328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 122 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 122 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 121 transition count 323
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 121 transition count 323
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 120 transition count 321
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 120 transition count 321
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 119 transition count 318
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 119 transition count 318
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 118 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 118 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 117 transition count 313
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 116 transition count 311
Applied a total of 31 rules in 19 ms. Remains 116 /130 variables (removed 14) and now considering 311/347 (removed 36) transitions.
[2025-06-02 10:16:18] [INFO ] Flow matrix only has 285 transitions (discarded 26 similar events)
// Phase 1: matrix 285 rows 116 cols
[2025-06-02 10:16:18] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:16:18] [INFO ] Implicit Places using invariants in 142 ms returned []
[2025-06-02 10:16:18] [INFO ] Flow matrix only has 285 transitions (discarded 26 similar events)
[2025-06-02 10:16:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:16:18] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 10:16:18] [INFO ] Implicit Places using invariants and state equation in 331 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 487 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 115/130 places, 311/347 transitions.
Applied a total of 0 rules in 1 ms. Remains 115 /115 variables (removed 0) and now considering 311/311 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 508 ms. Remains : 115/130 places, 311/347 transitions.
[2025-06-02 10:16:18] [INFO ] Flatten gal took : 9 ms
[2025-06-02 10:16:18] [INFO ] Flatten gal took : 10 ms
[2025-06-02 10:16:18] [INFO ] Input system was already deterministic with 311 transitions.
[2025-06-02 10:16:18] [INFO ] Flatten gal took : 11 ms
[2025-06-02 10:16:18] [INFO ] Flatten gal took : 10 ms
[2025-06-02 10:16:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality434890649663910552.gal : 4 ms
[2025-06-02 10:16:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality1427083098028630313.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/CTLCardinality434890649663910552.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1427083098028630313.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.16163e+07,11.035,210072,2,8481,5,544599,6,0,770,718106,0


Converting to forward existential form...Done !
original formula: AX((AX((AF((p107==1)) + (p89==1))) + EF((AG((p75==1)) * AX(FALSE)))))
=> equivalent forward existential formula: [FwdG((EY((EY(Init) * !(E(TRUE U (!(E(TRUE U !((p75==1)))) * !(EX(!(FALSE)))))))) * !((p89==1))),!((p107==1)))] ...162
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...651
Detected timeout of ITS tools.
[2025-06-02 10:16:48] [INFO ] Flatten gal took : 11 ms
[2025-06-02 10:16:48] [INFO ] Applying decomposition
[2025-06-02 10:16:48] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17467930102184779826.txt' '-o' '/tmp/graph17467930102184779826.bin' '-w' '/tmp/graph17467930102184779826.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17467930102184779826.bin' '-l' '-1' '-v' '-w' '/tmp/graph17467930102184779826.weights' '-q' '0' '-e' '0.001'
[2025-06-02 10:16:49] [INFO ] Decomposing Gal with order
[2025-06-02 10:16:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 10:16:49] [INFO ] Removed a total of 483 redundant transitions.
[2025-06-02 10:16:49] [INFO ] Flatten gal took : 50 ms
[2025-06-02 10:16:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 107 labels/synchronizations in 16 ms.
[2025-06-02 10:16:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality4664914921530605257.gal : 5 ms
[2025-06-02 10:16:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality16461167339268792082.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/CTLCardinality4664914921530605257.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16461167339268792082.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.16163e+07,22.4392,336860,2207,240,318312,5067,643,2.48385e+06,102,67232,0


Converting to forward existential form...Done !
original formula: AX((AX((AF((i5.u36.p107==1)) + (i4.i2.u3.p89==1))) + EF((AG((i6.i0.u24.p75==1)) * AX(FALSE)))))
=> equivalent forward existential formula: [FwdG((EY((EY(Init) * !(E(TRUE U (!(E(TRUE U !((i6.i0.u24.p75==1)))) * !(EX(!(FALSE)))))))) * !((i4.i2.u3.p89==1...188
Reverse transition relation is NOT exact ! Due to transitions t6, t39, t41, t42, t45, t46, t48, t56, t61, t66, t71, t76, t78, t79, t88, t89, t90, t91, t94,...770
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 130/130 places, 347/347 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 126 transition count 339
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 126 transition count 339
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 126 transition count 336
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 125 transition count 335
Applied a total of 13 rules in 17 ms. Remains 125 /130 variables (removed 5) and now considering 335/347 (removed 12) transitions.
[2025-06-02 10:17:19] [INFO ] Flow matrix only has 309 transitions (discarded 26 similar events)
// Phase 1: matrix 309 rows 125 cols
[2025-06-02 10:17:19] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:17:19] [INFO ] Implicit Places using invariants in 115 ms returned []
[2025-06-02 10:17:19] [INFO ] Flow matrix only has 309 transitions (discarded 26 similar events)
[2025-06-02 10:17:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:17:19] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-06-02 10:17:19] [INFO ] Implicit Places using invariants and state equation in 591 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 721 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 124/130 places, 335/347 transitions.
Applied a total of 0 rules in 6 ms. Remains 124 /124 variables (removed 0) and now considering 335/335 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 745 ms. Remains : 124/130 places, 335/347 transitions.
[2025-06-02 10:17:19] [INFO ] Flatten gal took : 8 ms
[2025-06-02 10:17:19] [INFO ] Flatten gal took : 9 ms
[2025-06-02 10:17:20] [INFO ] Input system was already deterministic with 335 transitions.
[2025-06-02 10:17:20] [INFO ] Flatten gal took : 9 ms
[2025-06-02 10:17:20] [INFO ] Flatten gal took : 9 ms
[2025-06-02 10:17:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality8730579732052227032.gal : 3 ms
[2025-06-02 10:17:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality1759936250965969027.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/CTLCardinality8730579732052227032.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1759936250965969027.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.69115e+06,9.8183,196932,2,10392,5,505347,6,0,830,645389,0


Converting to forward existential form...Done !
original formula: AG(((!(A((E((p0==0) U (p22==0)) * AG((p27==0))) U AF((p89==0)))) + EF((((p4==0)||(p12==1))&&(p114==0)))) + (E(((p1==0)||(p119==1)) U E((p...201
=> equivalent forward existential formula: [((((FwdU(Init,TRUE) * !((E(((p1==0)||(p119==1)) U E((p17==1) U (p80==0))) * ((p69==0)||(p117==1))))) * !(E(TRUE...347
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...705
Detected timeout of ITS tools.
[2025-06-02 10:17:50] [INFO ] Flatten gal took : 11 ms
[2025-06-02 10:17:50] [INFO ] Applying decomposition
[2025-06-02 10:17:50] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2977020625641005619.txt' '-o' '/tmp/graph2977020625641005619.bin' '-w' '/tmp/graph2977020625641005619.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2977020625641005619.bin' '-l' '-1' '-v' '-w' '/tmp/graph2977020625641005619.weights' '-q' '0' '-e' '0.001'
[2025-06-02 10:17:50] [INFO ] Decomposing Gal with order
[2025-06-02 10:17:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 10:17:50] [INFO ] Removed a total of 537 redundant transitions.
[2025-06-02 10:17:50] [INFO ] Flatten gal took : 24 ms
[2025-06-02 10:17:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 111 labels/synchronizations in 8 ms.
[2025-06-02 10:17:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality11500035399981175668.gal : 3 ms
[2025-06-02 10:17:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality17108885960747118216.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/CTLCardinality11500035399981175668.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17108885960747118216.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,9.69115e+06,13.4338,228764,2748,210,308059,3663,692,1.14323e+06,86,28516,0


Converting to forward existential form...Done !
original formula: AG(((!(A((E((i1.i0.u4.p0==0) U (i1.i1.u8.p22==0)) * AG((i2.u9.p27==0))) U AF((i3.i0.u30.p89==0)))) + EF((((i1.i2.u1.p4==0)||(i3.i0.u3.p12...313
=> equivalent forward existential formula: [((((FwdU(Init,TRUE) * !((E(((i5.i2.u44.p1==0)||(i0.u40.p119==1)) U E((i3.i0.u6.p17==1) U (i0.u26.p80==0))) * ((...479
Reverse transition relation is NOT exact ! Due to transitions t6, t39, t41, t42, t45, t46, t48, t56, t61, t66, t71, t76, t84, t88, t89, t90, t91, t94, t137...859
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 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 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local 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
(forward)formula 0,1,26.0183,307644,1,0,397698,5768,3611,1.7197e+06,370,30933,969096
FORMULA FireWire-PT-10-CTLCardinality-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 130/130 places, 347/347 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 125 transition count 338
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 125 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 125 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 124 transition count 332
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 124 transition count 332
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 123 transition count 330
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 123 transition count 330
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 122 transition count 327
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 122 transition count 327
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 121 transition count 325
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 121 transition count 325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 120 transition count 322
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 120 transition count 322
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 119 transition count 320
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 119 transition count 320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 118 transition count 317
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 118 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 117 transition count 315
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 117 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 116 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 116 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 115 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 115 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 114 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 114 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 113 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 113 transition count 306
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 112 transition count 305
Applied a total of 37 rules in 44 ms. Remains 112 /130 variables (removed 18) and now considering 305/347 (removed 42) transitions.
[2025-06-02 10:18:16] [INFO ] Flow matrix only has 279 transitions (discarded 26 similar events)
// Phase 1: matrix 279 rows 112 cols
[2025-06-02 10:18:16] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:18:16] [INFO ] Implicit Places using invariants in 152 ms returned []
[2025-06-02 10:18:16] [INFO ] Flow matrix only has 279 transitions (discarded 26 similar events)
[2025-06-02 10:18:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:18:16] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-06-02 10:18:17] [INFO ] Implicit Places using invariants and state equation in 493 ms returned [36]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 647 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 111/130 places, 305/347 transitions.
Applied a total of 0 rules in 7 ms. Remains 111 /111 variables (removed 0) and now considering 305/305 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 700 ms. Remains : 111/130 places, 305/347 transitions.
[2025-06-02 10:18:17] [INFO ] Flatten gal took : 13 ms
[2025-06-02 10:18:17] [INFO ] Flatten gal took : 13 ms
[2025-06-02 10:18:17] [INFO ] Input system was already deterministic with 305 transitions.
[2025-06-02 10:18:17] [INFO ] Flatten gal took : 13 ms
[2025-06-02 10:18:17] [INFO ] Flatten gal took : 13 ms
[2025-06-02 10:18:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality16079866739829420776.gal : 4 ms
[2025-06-02 10:18:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality1375405715000781718.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/CTLCardinality16079866739829420776.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1375405715000781718.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,9.44654e+06,5.83253,116188,2,5782,5,304347,6,0,748,391545,0


Converting to forward existential form...Done !
original formula: EF(EG((p94==1)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(p94==1))] != FALSE
Hit Full ! (commute/partial/dont) 300/0/5
(forward)formula 0,1,7.03915,116188,1,0,10,304347,19,3,4418,391545,8
FORMULA FireWire-PT-10-CTLCardinality-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 130/130 places, 347/347 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 125 transition count 338
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 125 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 125 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 124 transition count 332
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 124 transition count 332
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 123 transition count 330
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 123 transition count 330
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 122 transition count 327
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 122 transition count 327
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 121 transition count 325
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 121 transition count 325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 120 transition count 322
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 120 transition count 322
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 119 transition count 321
Applied a total of 23 rules in 21 ms. Remains 119 /130 variables (removed 11) and now considering 321/347 (removed 26) transitions.
[2025-06-02 10:18:24] [INFO ] Flow matrix only has 295 transitions (discarded 26 similar events)
// Phase 1: matrix 295 rows 119 cols
[2025-06-02 10:18:24] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:18:24] [INFO ] Implicit Places using invariants in 110 ms returned []
[2025-06-02 10:18:24] [INFO ] Flow matrix only has 295 transitions (discarded 26 similar events)
[2025-06-02 10:18:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:18:24] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 10:18:24] [INFO ] Implicit Places using invariants and state equation in 360 ms returned [36]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 505 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 118/130 places, 321/347 transitions.
Applied a total of 0 rules in 8 ms. Remains 118 /118 variables (removed 0) and now considering 321/321 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 534 ms. Remains : 118/130 places, 321/347 transitions.
[2025-06-02 10:18:24] [INFO ] Flatten gal took : 12 ms
[2025-06-02 10:18:24] [INFO ] Flatten gal took : 13 ms
[2025-06-02 10:18:24] [INFO ] Input system was already deterministic with 321 transitions.
[2025-06-02 10:18:24] [INFO ] Flatten gal took : 37 ms
[2025-06-02 10:18:24] [INFO ] Flatten gal took : 13 ms
[2025-06-02 10:18:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14388615557513548551.gal : 2 ms
[2025-06-02 10:18:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18418404426009254591.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/ReachabilityCardinality14388615557513548551.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18418404426009254591.prop' '--nowitness' '--gen-order' 'FOLLOW'

RANDOM walk for 16495 steps (985 resets) in 194 ms. (84 steps per ms) remains 0/1 properties
FORMULA FireWire-PT-10-CTLCardinality-2025-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
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 ...330
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 347/347 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 127 transition count 341
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 127 transition count 341
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 9 place count 127 transition count 338
Applied a total of 9 rules in 3 ms. Remains 127 /130 variables (removed 3) and now considering 338/347 (removed 9) transitions.
[2025-06-02 10:18:25] [INFO ] Flow matrix only has 312 transitions (discarded 26 similar events)
// Phase 1: matrix 312 rows 127 cols
[2025-06-02 10:18:25] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:18:25] [INFO ] Implicit Places using invariants in 159 ms returned []
[2025-06-02 10:18:25] [INFO ] Flow matrix only has 312 transitions (discarded 26 similar events)
[2025-06-02 10:18:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:18:25] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-06-02 10:18:25] [INFO ] Implicit Places using invariants and state equation in 466 ms returned []
Implicit Place search using SMT with State Equation took 628 ms to find 0 implicit places.
Running 337 sub problems to find dead transitions.
[2025-06-02 10:18:25] [INFO ] Flow matrix only has 312 transitions (discarded 26 similar events)
[2025-06-02 10:18:25] [INFO ] Invariant cache hit.
[2025-06-02 10:18:25] [INFO ] State equation strengthened by 45 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 337 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:18:30] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:18:30] [INFO ] Deduced a trap composed of 42 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:18:30] [INFO ] Deduced a trap composed of 44 places in 169 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:18:30] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:18:31] [INFO ] Deduced a trap composed of 22 places in 196 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:18:32] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 4 (OVERLAPS) 311/438 variables, 127/140 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 44/184 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 7 (OVERLAPS) 1/439 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 9 (OVERLAPS) 0/439 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 337 unsolved
No progress, stopping.
After SMT solving in domain Real declared 439/439 variables, and 185 constraints, problems are : Problem set: 0 solved, 337 unsolved in 28700 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 127/127 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 337/337 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 337 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 4 (OVERLAPS) 311/438 variables, 127/140 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 44/184 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 337/521 constraints. Problems are: Problem set: 0 solved, 337 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 438/439 variables, and 521 constraints, problems are : Problem set: 0 solved, 337 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 127/127 constraints, ReadFeed: 44/45 constraints, PredecessorRefiner: 337/337 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58945ms problems are : Problem set: 0 solved, 337 unsolved
Search for dead transitions found 0 dead transitions in 58948ms
Starting structural reductions in LTL mode, iteration 1 : 127/130 places, 338/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59581 ms. Remains : 127/130 places, 338/347 transitions.
[2025-06-02 10:19:24] [INFO ] Flatten gal took : 13 ms
[2025-06-02 10:19:24] [INFO ] Flatten gal took : 14 ms
[2025-06-02 10:19:24] [INFO ] Input system was already deterministic with 338 transitions.
[2025-06-02 10:19:24] [INFO ] Flatten gal took : 13 ms
[2025-06-02 10:19:24] [INFO ] Flatten gal took : 14 ms
[2025-06-02 10:19:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality1330584770414617552.gal : 3 ms
[2025-06-02 10:19:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality9911006934791060201.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/CTLCardinality1330584770414617552.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9911006934791060201.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.18424e+07,3.42916,68892,2,2971,5,208069,6,0,845,217157,0


Converting to forward existential form...Done !
original formula: E(!((AF(((((p96==0)&&((p14==0)||(p39==1)))||(!((p16==0)||(p49==1))))||((p78==1)||(p77==1)))) * AF((p67==0)))) U !(E(A((p73==1) U EX((p12=...216
=> equivalent forward existential formula: [(FwdU(Init,!((!(EG(!(((((p96==0)&&((p14==0)||(p39==1)))||(!((p16==0)||(p49==1))))||((p78==1)||(p77==1)))))) * !...339
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t7, t8, t12, t13, t15, t16, t18, t20, t24, t25, t27, t28, t30, t32, t36, t37,...712
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2025-06-02 10:19:54] [INFO ] Flatten gal took : 15 ms
[2025-06-02 10:19:54] [INFO ] Applying decomposition
[2025-06-02 10:19:54] [INFO ] Flatten gal took : 16 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/graph10819204985336417987.txt' '-o' '/tmp/graph10819204985336417987.bin' '-w' '/tmp/graph10819204985336417987.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10819204985336417987.bin' '-l' '-1' '-v' '-w' '/tmp/graph10819204985336417987.weights' '-q' '0' '-e' '0.001'
[2025-06-02 10:19:54] [INFO ] Decomposing Gal with order
[2025-06-02 10:19:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 10:19:54] [INFO ] Removed a total of 544 redundant transitions.
[2025-06-02 10:19:54] [INFO ] Flatten gal took : 58 ms
[2025-06-02 10:19:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 107 labels/synchronizations in 9 ms.
[2025-06-02 10:19:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality13009635781594092349.gal : 6 ms
[2025-06-02 10:19:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality9112827953189731916.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/CTLCardinality13009635781594092349.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9112827953189731916.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.18424e+07,21.7131,309592,2567,140,411117,1576,682,1.35521e+06,82,11581,0


Converting to forward existential form...Done !
original formula: E(!((AF(((((i1.i1.u34.p96==0)&&((i1.i0.u4.p14==0)||(i3.i1.u13.p39==1)))||(!((i1.i0.u8.p16==0)||(i3.i1.u16.p49==1))))||((i6.i1.u26.p78==1)...351
=> equivalent forward existential formula: [(FwdU(Init,!((!(EG(!(((((i1.i1.u34.p96==0)&&((i1.i0.u4.p14==0)||(i3.i1.u13.p39==1)))||(!((i1.i0.u8.p16==0)||(i3...492
Reverse transition relation is NOT exact ! Due to transitions t40, t42, t43, t46, t47, t49, t55, t57, t62, t67, t72, t77, t92, t95, t134, t135, t136, t138,...854
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 130/130 places, 347/347 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 126 transition count 339
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 126 transition count 339
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 126 transition count 336
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 125 transition count 333
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 125 transition count 333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 124 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 124 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 123 transition count 328
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 123 transition count 328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 122 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 122 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 121 transition count 323
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 121 transition count 323
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 120 transition count 321
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 120 transition count 321
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 119 transition count 318
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 119 transition count 318
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 118 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 118 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 117 transition count 313
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 115 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 115 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 114 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 114 transition count 307
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 1 with 2 rules applied. Total rules applied 37 place count 113 transition count 306
Applied a total of 37 rules in 32 ms. Remains 113 /130 variables (removed 17) and now considering 306/347 (removed 41) transitions.
[2025-06-02 10:20:25] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
// Phase 1: matrix 280 rows 113 cols
[2025-06-02 10:20:25] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:20:25] [INFO ] Implicit Places using invariants in 103 ms returned []
[2025-06-02 10:20:25] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2025-06-02 10:20:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:20:25] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 10:20:25] [INFO ] Implicit Places using invariants and state equation in 277 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 382 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 112/130 places, 306/347 transitions.
Applied a total of 0 rules in 5 ms. Remains 112 /112 variables (removed 0) and now considering 306/306 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 420 ms. Remains : 112/130 places, 306/347 transitions.
[2025-06-02 10:20:25] [INFO ] Flatten gal took : 7 ms
[2025-06-02 10:20:25] [INFO ] Flatten gal took : 12 ms
[2025-06-02 10:20:25] [INFO ] Input system was already deterministic with 306 transitions.
[2025-06-02 10:20:25] [INFO ] Flatten gal took : 8 ms
[2025-06-02 10:20:25] [INFO ] Flatten gal took : 8 ms
[2025-06-02 10:20:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality3115647922764249503.gal : 2 ms
[2025-06-02 10:20:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality4789646552283734610.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/CTLCardinality3115647922764249503.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4789646552283734610.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.44654e+06,7.14201,147780,2,7000,5,370300,6,0,753,498871,0


Converting to forward existential form...Done !
original formula: EF(AG(E(!(((p44==0)||(p130==1))) U !(((p98==0)||(p23==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(E(!(((p44==0)||(p130==1))) U !(((p98==0)||(p23==1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...633
(forward)formula 0,1,15.2611,219732,1,0,664,1.01868e+06,636,344,6520,823309,748
FORMULA FireWire-PT-10-CTLCardinality-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 347/347 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 126 transition count 339
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 126 transition count 339
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 126 transition count 336
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 125 transition count 333
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 125 transition count 333
Applied a total of 13 rules in 3 ms. Remains 125 /130 variables (removed 5) and now considering 333/347 (removed 14) transitions.
[2025-06-02 10:20:40] [INFO ] Flow matrix only has 307 transitions (discarded 26 similar events)
// Phase 1: matrix 307 rows 125 cols
[2025-06-02 10:20:40] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:20:41] [INFO ] Implicit Places using invariants in 112 ms returned []
[2025-06-02 10:20:41] [INFO ] Flow matrix only has 307 transitions (discarded 26 similar events)
[2025-06-02 10:20:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:20:41] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-06-02 10:20:41] [INFO ] Implicit Places using invariants and state equation in 447 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 574 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/130 places, 333/347 transitions.
Applied a total of 0 rules in 1 ms. Remains 124 /124 variables (removed 0) and now considering 333/333 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 579 ms. Remains : 124/130 places, 333/347 transitions.
[2025-06-02 10:20:41] [INFO ] Flatten gal took : 13 ms
[2025-06-02 10:20:41] [INFO ] Flatten gal took : 14 ms
[2025-06-02 10:20:41] [INFO ] Input system was already deterministic with 333 transitions.
[2025-06-02 10:20:41] [INFO ] Flatten gal took : 14 ms
[2025-06-02 10:20:41] [INFO ] Flatten gal took : 14 ms
[2025-06-02 10:20:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality4887181343074881478.gal : 3 ms
[2025-06-02 10:20:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality15683012428332258132.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/CTLCardinality4887181343074881478.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15683012428332258132.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.18014e+07,3.10494,69668,2,2799,5,207540,6,0,828,221137,0


Converting to forward existential form...Done !
original formula: (EF((p14==1)) * AF((E((p38==1) U (p85==0)) * (EF(EX(((p115==0)&&(p118==1)))) + AX(AF((p44==1)))))))
=> equivalent forward existential formula: ([(Init * !(E(TRUE U (p14==1))))] = FALSE * [FwdG(Init,!((E((p38==1) U (p85==0)) * (E(TRUE U EX(((p115==0)&&(p11...208
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...700
Detected timeout of ITS tools.
[2025-06-02 10:21:11] [INFO ] Flatten gal took : 15 ms
[2025-06-02 10:21:11] [INFO ] Applying decomposition
[2025-06-02 10:21:11] [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/graph1973080000254011661.txt' '-o' '/tmp/graph1973080000254011661.bin' '-w' '/tmp/graph1973080000254011661.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1973080000254011661.bin' '-l' '-1' '-v' '-w' '/tmp/graph1973080000254011661.weights' '-q' '0' '-e' '0.001'
[2025-06-02 10:21:11] [INFO ] Decomposing Gal with order
[2025-06-02 10:21:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 10:21:11] [INFO ] Removed a total of 532 redundant transitions.
[2025-06-02 10:21:11] [INFO ] Flatten gal took : 32 ms
[2025-06-02 10:21:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 112 labels/synchronizations in 5 ms.
[2025-06-02 10:21:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality18314183652112350318.gal : 3 ms
[2025-06-02 10:21:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality17530596630434040662.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/CTLCardinality18314183652112350318.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17530596630434040662.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.18014e+07,20.6102,342008,3383,204,440929,3496,692,1.66869e+06,86,32218,0


Converting to forward existential form...Done !
original formula: (EF((i2.i1.u4.p14==1)) * AF((E((i3.u11.p38==1) U (i0.u28.p85==0)) * (EF(EX(((i5.i2.u39.p115==0)&&(i0.u40.p118==1)))) + AX(AF((i2.i0.u15.p...167
=> equivalent forward existential formula: ([(Init * !(E(TRUE U (i2.i1.u4.p14==1))))] = FALSE * [FwdG(Init,!((E((i3.u11.p38==1) U (i0.u28.p85==0)) * (E(TRU...258
Reverse transition relation is NOT exact ! Due to transitions t6, t39, t41, t42, t45, t46, t48, t56, t57, t61, t66, t71, t76, t88, t89, t90, t91, t94, t137...867
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 130/130 places, 347/347 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 126 transition count 339
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 126 transition count 339
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 126 transition count 336
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 125 transition count 333
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 125 transition count 333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 124 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 124 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 123 transition count 328
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 123 transition count 328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 122 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 122 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 121 transition count 323
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 121 transition count 323
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 120 transition count 321
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 120 transition count 321
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 119 transition count 318
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 119 transition count 318
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 118 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 118 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 117 transition count 313
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 115 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 115 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 114 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 114 transition count 307
Applied a total of 35 rules in 44 ms. Remains 114 /130 variables (removed 16) and now considering 307/347 (removed 40) transitions.
[2025-06-02 10:21:41] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
// Phase 1: matrix 281 rows 114 cols
[2025-06-02 10:21:41] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:21:42] [INFO ] Implicit Places using invariants in 153 ms returned []
[2025-06-02 10:21:42] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
[2025-06-02 10:21:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:21:42] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 10:21:42] [INFO ] Implicit Places using invariants and state equation in 405 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 561 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 113/130 places, 307/347 transitions.
Applied a total of 0 rules in 6 ms. Remains 113 /113 variables (removed 0) and now considering 307/307 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 612 ms. Remains : 113/130 places, 307/347 transitions.
[2025-06-02 10:21:42] [INFO ] Flatten gal took : 12 ms
[2025-06-02 10:21:42] [INFO ] Flatten gal took : 12 ms
[2025-06-02 10:21:42] [INFO ] Input system was already deterministic with 307 transitions.
[2025-06-02 10:21:42] [INFO ] Flatten gal took : 19 ms
[2025-06-02 10:21:42] [INFO ] Flatten gal took : 13 ms
[2025-06-02 10:21:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality8499058659311689116.gal : 2 ms
[2025-06-02 10:21:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality7863031123464813109.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/CTLCardinality8499058659311689116.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7863031123464813109.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.1577e+07,9.30679,185060,2,6965,5,477294,6,0,758,637251,0


Converting to forward existential form...Done !
original formula: (!(E(!(((p73==1)&&(!(((p97==1)||(p25==0))||(p50==1))))) U ((((EG(AG((p42==1))) + AG((p0==1))) + (((p44==1)&&((p101==0)||(p72==1)))||(!(((...300
=> equivalent forward existential formula: ((([FwdG(((FwdU(Init,!(((p73==1)&&(!(((p97==1)||(p25==0))||(p50==1)))))) * (((p57==1)||(p57==0))||(p114==1))) * ...693
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...639
Detected timeout of ITS tools.
[2025-06-02 10:22:12] [INFO ] Flatten gal took : 9 ms
[2025-06-02 10:22:12] [INFO ] Applying decomposition
[2025-06-02 10:22:12] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12724880762556393701.txt' '-o' '/tmp/graph12724880762556393701.bin' '-w' '/tmp/graph12724880762556393701.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12724880762556393701.bin' '-l' '-1' '-v' '-w' '/tmp/graph12724880762556393701.weights' '-q' '0' '-e' '0.001'
[2025-06-02 10:22:12] [INFO ] Decomposing Gal with order
[2025-06-02 10:22:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 10:22:12] [INFO ] Removed a total of 480 redundant transitions.
[2025-06-02 10:22:12] [INFO ] Flatten gal took : 39 ms
[2025-06-02 10:22:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 99 labels/synchronizations in 6 ms.
[2025-06-02 10:22:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality2517838234011329235.gal : 3 ms
[2025-06-02 10:22:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality11244012021087149855.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/CTLCardinality2517838234011329235.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11244012021087149855.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.1577e+07,16.7379,241432,2416,227,320184,1947,633,1.06571e+06,86,19661,0


Converting to forward existential form...Done !
original formula: (!(E(!(((i5.i0.u23.p73==1)&&(!(((i1.i2.u33.p97==1)||(i1.i1.u8.p25==0))||(i3.i1.u16.p50==1))))) U ((((EG(AG((i3.i1.u17.p42==1))) + AG((i1....475
=> equivalent forward existential formula: ((([FwdG(((FwdU(Init,!(((i5.i0.u23.p73==1)&&(!(((i1.i2.u33.p97==1)||(i1.i1.u8.p25==0))||(i3.i1.u16.p50==1)))))) ...1022
Reverse transition relation is NOT exact ! Due to transitions t6, t39, t41, t42, t45, t46, t48, t56, t61, t66, t71, t76, t79, t84, t91, t94, t133, t134, t1...775
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 347/347 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 126 transition count 339
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 126 transition count 339
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 126 transition count 336
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 125 transition count 333
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 125 transition count 333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 124 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 124 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 123 transition count 328
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 123 transition count 328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 122 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 122 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 121 transition count 323
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 121 transition count 323
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 120 transition count 321
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 120 transition count 321
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 119 transition count 318
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 119 transition count 318
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 118 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 118 transition count 316
Applied a total of 27 rules in 10 ms. Remains 118 /130 variables (removed 12) and now considering 316/347 (removed 31) transitions.
[2025-06-02 10:22:42] [INFO ] Flow matrix only has 290 transitions (discarded 26 similar events)
// Phase 1: matrix 290 rows 118 cols
[2025-06-02 10:22:42] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:22:42] [INFO ] Implicit Places using invariants in 169 ms returned []
[2025-06-02 10:22:42] [INFO ] Flow matrix only has 290 transitions (discarded 26 similar events)
[2025-06-02 10:22:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:22:43] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-06-02 10:22:43] [INFO ] Implicit Places using invariants and state equation in 414 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 585 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 117/130 places, 316/347 transitions.
Applied a total of 0 rules in 1 ms. Remains 117 /117 variables (removed 0) and now considering 316/316 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 596 ms. Remains : 117/130 places, 316/347 transitions.
[2025-06-02 10:22:43] [INFO ] Flatten gal took : 8 ms
[2025-06-02 10:22:43] [INFO ] Flatten gal took : 12 ms
[2025-06-02 10:22:43] [INFO ] Input system was already deterministic with 316 transitions.
[2025-06-02 10:22:43] [INFO ] Flatten gal took : 8 ms
[2025-06-02 10:22:43] [INFO ] Flatten gal took : 9 ms
[2025-06-02 10:22:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality1406732763536809601.gal : 1 ms
[2025-06-02 10:22:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality12843392007629835327.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/CTLCardinality1406732763536809601.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12843392007629835327.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.16573e+07,9.1633,201216,2,8961,5,533336,6,0,783,706435,0


Converting to forward existential form...Done !
original formula: ((AG(((EF((p21==1)) * (p54==1)) * (((p40==0)||(p33==1))&&((p92==0)||(p44==1))))) + AF(((!(E(((p42==0)||(p87==1)) U (p108==0))) + EG((p128...213
=> equivalent forward existential formula: [FwdG(((Init * !(EX(E(TRUE U ((p105==0)&&(p24==1)))))) * !(!(E(TRUE U !(((E(TRUE U (p21==1)) * (p54==1)) * (((p4...294
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...663
Detected timeout of ITS tools.
[2025-06-02 10:23:13] [INFO ] Flatten gal took : 8 ms
[2025-06-02 10:23:13] [INFO ] Applying decomposition
[2025-06-02 10:23:13] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1546320547772376770.txt' '-o' '/tmp/graph1546320547772376770.bin' '-w' '/tmp/graph1546320547772376770.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1546320547772376770.bin' '-l' '-1' '-v' '-w' '/tmp/graph1546320547772376770.weights' '-q' '0' '-e' '0.001'
[2025-06-02 10:23:13] [INFO ] Decomposing Gal with order
[2025-06-02 10:23:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 10:23:13] [INFO ] Removed a total of 488 redundant transitions.
[2025-06-02 10:23:13] [INFO ] Flatten gal took : 21 ms
[2025-06-02 10:23:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 99 labels/synchronizations in 5 ms.
[2025-06-02 10:23:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality11264086247654150358.gal : 4 ms
[2025-06-02 10:23:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality3104270260620399899.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/CTLCardinality11264086247654150358.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3104270260620399899.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.16573e+07,4.37535,97520,1967,175,123196,2188,636,526096,105,16551,0


Converting to forward existential form...Done !
original formula: ((AG(((EF((i0.i1.u6.p21==1)) * (i4.u18.p54==1)) * (((i2.i1.u13.p40==0)||(i1.u12.p33==1))&&((i2.i0.u30.p92==0)||(i2.i0.u15.p44==1))))) + A...324
=> equivalent forward existential formula: [FwdG(((Init * !(EX(E(TRUE U ((i5.u38.p105==0)&&(i0.i1.u7.p24==1)))))) * !(!(E(TRUE U !(((E(TRUE U (i0.i1.u6.p21...405
Reverse transition relation is NOT exact ! Due to transitions t6, t39, t41, t42, t45, t46, t48, t56, t61, t66, t71, t80, t91, t94, t133, t134, t135, t137, ...798
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
(forward)formula 0,1,23.9794,411104,1,0,602665,4211,3325,1.66706e+06,495,19647,1707607
FORMULA FireWire-PT-10-CTLCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

[2025-06-02 10:23:37] [INFO ] Flatten gal took : 10 ms
[2025-06-02 10:23:37] [INFO ] Flatten gal took : 9 ms
[2025-06-02 10:23:37] [INFO ] Applying decomposition
[2025-06-02 10:23:37] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph103502693767395109.txt' '-o' '/tmp/graph103502693767395109.bin' '-w' '/tmp/graph103502693767395109.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph103502693767395109.bin' '-l' '-1' '-v' '-w' '/tmp/graph103502693767395109.weights' '-q' '0' '-e' '0.001'
[2025-06-02 10:23:37] [INFO ] Decomposing Gal with order
[2025-06-02 10:23:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 10:23:37] [INFO ] Removed a total of 559 redundant transitions.
[2025-06-02 10:23:37] [INFO ] Flatten gal took : 29 ms
[2025-06-02 10:23:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 140 labels/synchronizations in 6 ms.
[2025-06-02 10:23:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality10773780966600549383.gal : 3 ms
[2025-06-02 10:23:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality18275511069557775414.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/CTLCardinality10773780966600549383.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18275511069557775414.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 6 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.26692e+07,12.7725,203976,1768,110,259700,835,655,948299,87,4405,0


Converting to forward existential form...Done !
original formula: AG((EG(EF((AF((i5.i0.u37.p108==1)) * AF(((i0.u3.p10==0)||(i3.i2.u15.p48==1)))))) + AX(AX((((EF(((i3.i1.u11.p40==0)||(i3.i0.u4.p26==1))) +...238
=> equivalent forward existential formula: [((((EY(EY((FwdU(Init,TRUE) * !(EG(E(TRUE U (!(EG(!((i5.i0.u37.p108==1)))) * !(EG(!(((i0.u3.p10==0)||(i3.i2.u15....328
Reverse transition relation is NOT exact ! Due to transitions t40, t43, t46, t47, t55, t57, t62, t67, t72, t77, t85, t92, t95, t97, t104, t136, t137, t138,...857
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 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
(forward)formula 0,0,49.1811,635668,1,0,766002,1963,3521,3.14889e+06,374,9353,1916980
FORMULA FireWire-PT-10-CTLCardinality-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AX(A((i3.i2.u14.p46==1) U EF(((i6.u23.p76!=1) * AG((i1.u25.p81==0))))))
=> equivalent forward existential formula: ([((FwdU(EY(Init),!(E(TRUE U ((i6.u23.p76!=1) * !(E(TRUE U !((i1.u25.p81==0)))))))) * !((i3.i2.u14.p46==1))) * !...321
(forward)formula 1,1,56.502,735328,1,0,909178,1987,3539,3.44279e+06,375,9629,2286866
FORMULA FireWire-PT-10-CTLCardinality-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AX((AX((AF((i7.u35.p107==1)) + (i0.u29.p89==1))) + EF((AG((i5.i1.u22.p75==1)) * AX(FALSE)))))
=> equivalent forward existential formula: [FwdG((EY((EY(Init) * !(E(TRUE U (!(E(TRUE U !((i5.i1.u22.p75==1)))) * !(EX(!(FALSE)))))))) * !((i0.u29.p89==1))...186
(forward)formula 2,1,64.2699,868576,1,0,1.08119e+06,2027,3568,3.9828e+06,379,10103,2767466
FORMULA FireWire-PT-10-CTLCardinality-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: E(!((AF(((((i6.u32.p96==0)&&((i3.i0.u4.p14==0)||(i3.i1.u11.p39==1)))||(!((i3.i0.u4.p16==0)||(i3.i2.u15.p49==1))))||((i5.i0.u24.p78==1)||(...333
=> equivalent forward existential formula: [(FwdU(Init,!((!(EG(!(((((i6.u32.p96==0)&&((i3.i0.u4.p14==0)||(i3.i1.u11.p39==1)))||(!((i3.i0.u4.p16==0)||(i3.i2...468
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 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
(forward)formula 3,0,80.7194,1140748,1,0,1.40354e+06,2059,3701,5.08571e+06,384,10454,3456878
FORMULA FireWire-PT-10-CTLCardinality-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (EF((i3.i0.u4.p14==1)) * AF((E((i2.u9.p38==1) U (i1.u27.p85==0)) * (EF(EX(((i5.i0.u38.p115==0)&&(i1.u40.p118==1)))) + AX(AF((i0.u13.p44==...163
=> equivalent forward existential formula: ([(Init * !(E(TRUE U (i3.i0.u4.p14==1))))] = FALSE * [FwdG(Init,!((E((i2.u9.p38==1) U (i1.u27.p85==0)) * (E(TRUE...254
(forward)formula 4,1,95.8351,1341068,1,0,1.64765e+06,2064,3771,5.63435e+06,384,10551,4080166
FORMULA FireWire-PT-10-CTLCardinality-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (!(E(!(((i5.i1.u21.p73==1)&&(!(((i6.u32.p97==1)||(i3.i0.u4.p25==0))||(i3.i2.u15.p50==1))))) U ((((EG(AG((i3.i1.u12.p42==1))) + AG((i3.i1....472
=> equivalent forward existential formula: ((([FwdG(((FwdU(Init,!(((i5.i1.u21.p73==1)&&(!(((i6.u32.p97==1)||(i3.i0.u4.p25==0))||(i3.i2.u15.p50==1)))))) * (...1031
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 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
(forward)formula 5,0,146.512,2076004,1,0,2.57865e+06,2283,4143,8.56254e+06,397,12783,6218648
FORMULA FireWire-PT-10-CTLCardinality-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Total runtime 920980 ms.

BK_STOP 1748859965019

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is FireWire-PT-10, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r086-smll-174860102300313"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' 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 ;