Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r044-tall-174854027700042.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 CloudDeployment-PT-4b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r044-tall-174854027700042
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1016K
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 591K 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 CloudDeployment-PT-4b-CTLFireability-2023-12
FORMULA_NAME CloudDeployment-PT-4b-CTLFireability-2023-13
FORMULA_NAME CloudDeployment-PT-4b-CTLFireability-2023-14
FORMULA_NAME CloudDeployment-PT-4b-CTLFireability-2023-15
FORMULA_NAME CloudDeployment-PT-4b-CTLFireability-2025-00
FORMULA_NAME CloudDeployment-PT-4b-CTLFireability-2025-01
FORMULA_NAME CloudDeployment-PT-4b-CTLFireability-2025-02
FORMULA_NAME CloudDeployment-PT-4b-CTLFireability-2025-03
FORMULA_NAME CloudDeployment-PT-4b-CTLFireability-2025-04
FORMULA_NAME CloudDeployment-PT-4b-CTLFireability-2025-05
FORMULA_NAME CloudDeployment-PT-4b-CTLFireability-2025-06
FORMULA_NAME CloudDeployment-PT-4b-CTLFireability-2025-07
FORMULA_NAME CloudDeployment-PT-4b-CTLFireability-2025-08
FORMULA_NAME CloudDeployment-PT-4b-CTLFireability-2025-09
FORMULA_NAME CloudDeployment-PT-4b-CTLFireability-2025-10
FORMULA_NAME CloudDeployment-PT-4b-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1748555372779

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-4b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-05-29 21:49:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-29 21:49:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 21:49:34] [INFO ] Load time of PNML (sax parser for PT used): 140 ms
[2025-05-29 21:49:34] [INFO ] Transformed 1182 places.
[2025-05-29 21:49:34] [INFO ] Transformed 1824 transitions.
[2025-05-29 21:49:34] [INFO ] Found NUPN structural information;
[2025-05-29 21:49:34] [INFO ] Parsed PT model containing 1182 places and 1824 transitions and 8741 arcs in 240 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Support contains 107 out of 1182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1182/1182 places, 1824/1824 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1178 transition count 1824
Discarding 280 places :
Symmetric choice reduction at 1 with 280 rule applications. Total rules 284 place count 898 transition count 1544
Iterating global reduction 1 with 280 rules applied. Total rules applied 564 place count 898 transition count 1544
Discarding 99 places :
Symmetric choice reduction at 1 with 99 rule applications. Total rules 663 place count 799 transition count 1445
Iterating global reduction 1 with 99 rules applied. Total rules applied 762 place count 799 transition count 1445
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 774 place count 799 transition count 1433
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 784 place count 789 transition count 1423
Iterating global reduction 2 with 10 rules applied. Total rules applied 794 place count 789 transition count 1423
Applied a total of 794 rules in 248 ms. Remains 789 /1182 variables (removed 393) and now considering 1423/1824 (removed 401) transitions.
// Phase 1: matrix 1423 rows 789 cols
[2025-05-29 21:49:34] [INFO ] Computed 13 invariants in 51 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:49:34] [INFO ] Implicit Places using invariants in 392 ms returned []
[2025-05-29 21:49:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:49:35] [INFO ] Implicit Places using invariants and state equation in 883 ms returned []
Implicit Place search using SMT with State Equation took 1308 ms to find 0 implicit places.
Running 1422 sub problems to find dead transitions.
[2025-05-29 21:49:35] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/788 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1422 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 788/2212 variables, and 13 constraints, problems are : Problem set: 0 solved, 1422 unsolved in 30044 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 0/789 constraints, PredecessorRefiner: 1422/1165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1422 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/788 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1422 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/788 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1422 unsolved
SMT process timed out in 61594ms, After SMT, problems are : Problem set: 0 solved, 1422 unsolved
Search for dead transitions found 0 dead transitions in 61617ms
Starting structural reductions in LTL mode, iteration 1 : 789/1182 places, 1423/1824 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63205 ms. Remains : 789/1182 places, 1423/1824 transitions.
Support contains 107 out of 789 places after structural reductions.
[2025-05-29 21:50:37] [INFO ] Flatten gal took : 191 ms
[2025-05-29 21:50:38] [INFO ] Flatten gal took : 117 ms
[2025-05-29 21:50:38] [INFO ] Input system was already deterministic with 1423 transitions.
RANDOM walk for 40000 steps (312 resets) in 2152 ms. (18 steps per ms) remains 37/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 56 ms. (70 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 37/37 properties
[2025-05-29 21:50:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (OVERLAPS) 140/216 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (OVERLAPS) 806/1022 variables, 216/229 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1022 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 37 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp61 is UNSAT
At refinement iteration 6 (OVERLAPS) 463/1485 variables, 199/428 constraints. Problems are: Problem set: 9 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1485 variables, 0/428 constraints. Problems are: Problem set: 9 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 368/1853 variables, 171/599 constraints. Problems are: Problem set: 9 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1853 variables, 0/599 constraints. Problems are: Problem set: 9 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 250/2103 variables, 134/733 constraints. Problems are: Problem set: 9 solved, 28 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2103 variables, 0/733 constraints. Problems are: Problem set: 9 solved, 28 unsolved
At refinement iteration 12 (OVERLAPS) 84/2187 variables, 53/786 constraints. Problems are: Problem set: 9 solved, 28 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2187 variables, 0/786 constraints. Problems are: Problem set: 9 solved, 28 unsolved
At refinement iteration 14 (OVERLAPS) 21/2208 variables, 12/798 constraints. Problems are: Problem set: 9 solved, 28 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2208 variables, 0/798 constraints. Problems are: Problem set: 9 solved, 28 unsolved
At refinement iteration 16 (OVERLAPS) 4/2212 variables, 4/802 constraints. Problems are: Problem set: 9 solved, 28 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2212/2212 variables, and 802 constraints, problems are : Problem set: 9 solved, 28 unsolved in 5015 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 789/789 constraints, PredecessorRefiner: 37/29 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 28 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 162/206 variables, 12/12 constraints. Problems are: Problem set: 9 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/12 constraints. Problems are: Problem set: 9 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 1/207 variables, 1/13 constraints. Problems are: Problem set: 9 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/13 constraints. Problems are: Problem set: 9 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 795/1002 variables, 207/220 constraints. Problems are: Problem set: 9 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1002 variables, 1/221 constraints. Problems are: Problem set: 9 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1002 variables, 0/221 constraints. Problems are: Problem set: 9 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 455/1457 variables, 197/418 constraints. Problems are: Problem set: 9 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1457 variables, 27/445 constraints. Problems are: Problem set: 9 solved, 28 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1457 variables, 0/445 constraints. Problems are: Problem set: 9 solved, 28 unsolved
At refinement iteration 11 (OVERLAPS) 369/1826 variables, 169/614 constraints. Problems are: Problem set: 9 solved, 28 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1826/2212 variables, and 614 constraints, problems are : Problem set: 9 solved, 28 unsolved in 5010 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 573/789 constraints, PredecessorRefiner: 28/29 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10126ms problems are : Problem set: 9 solved, 28 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 44 out of 789 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 789/789 places, 1423/1423 transitions.
Graph (trivial) has 727 edges and 789 vertex of which 196 / 789 are part of one of the 23 SCC in 5 ms
Free SCC test removed 173 places
Drop transitions (Empty/Sink Transition effects.) removed 475 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 477 transitions.
Graph (complete) has 1956 edges and 616 vertex of which 593 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.3 ms
Discarding 23 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 214 transitions
Trivial Post-agglo rules discarded 214 transitions
Performed 214 trivial Post agglomeration. Transition count delta: 214
Iterating post reduction 0 with 224 rules applied. Total rules applied 226 place count 593 transition count 722
Reduce places removed 214 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 233 rules applied. Total rules applied 459 place count 379 transition count 703
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 475 place count 363 transition count 703
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 475 place count 363 transition count 655
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 571 place count 315 transition count 655
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 578 place count 308 transition count 648
Iterating global reduction 3 with 7 rules applied. Total rules applied 585 place count 308 transition count 648
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 585 place count 308 transition count 644
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 593 place count 304 transition count 644
Performed 82 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 82 places in 1 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 3 with 164 rules applied. Total rules applied 757 place count 222 transition count 561
Performed 34 Post agglomeration using F-continuation condition with reduction of 37 identical transitions.
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 825 place count 188 transition count 684
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 848 place count 188 transition count 661
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 4 with 30 rules applied. Total rules applied 878 place count 188 transition count 631
Free-agglomeration rule applied 22 times.
Iterating global reduction 4 with 22 rules applied. Total rules applied 900 place count 188 transition count 609
Reduce places removed 22 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 4 with 47 rules applied. Total rules applied 947 place count 166 transition count 584
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 961 place count 166 transition count 570
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 971 place count 166 transition count 570
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 975 place count 166 transition count 566
Applied a total of 975 rules in 206 ms. Remains 166 /789 variables (removed 623) and now considering 566/1423 (removed 857) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 206 ms. Remains : 166/789 places, 566/1423 transitions.
RANDOM walk for 40000 steps (490 resets) in 1226 ms. (32 steps per ms) remains 17/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (9 resets) in 10 ms. (363 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (9 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 17/17 properties
[2025-05-29 21:50:49] [INFO ] Flow matrix only has 463 transitions (discarded 103 similar events)
// Phase 1: matrix 463 rows 166 cols
[2025-05-29 21:50:49] [INFO ] Computed 10 invariants in 2 ms
[2025-05-29 21:50:49] [INFO ] State equation strengthened by 112 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 88/115 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 28/143 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 441/584 variables, 143/153 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/584 variables, 71/224 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/584 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 44/628 variables, 22/246 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/628 variables, 41/287 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/628 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 1/629 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/629 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (OVERLAPS) 0/629 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 629/629 variables, and 288 constraints, problems are : Problem set: 0 solved, 17 unsolved in 2117 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 166/166 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 88/115 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 28/143 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:50:52] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:50:52] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 441/584 variables, 143/155 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/584 variables, 71/226 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/584 variables, 8/234 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/584 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 44/628 variables, 22/256 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/628 variables, 41/297 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/628 variables, 9/306 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/628 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (OVERLAPS) 1/629 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:50:56] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:50:56] [INFO ] Deduced a trap composed of 48 places in 53 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/629 variables, 2/309 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/629 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 17 (OVERLAPS) 0/629 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 629/629 variables, and 309 constraints, problems are : Problem set: 0 solved, 17 unsolved in 14197 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 166/166 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16342ms problems are : Problem set: 0 solved, 17 unsolved
Parikh walk visited 9 properties in 1753 ms.
Support contains 16 out of 166 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 566/566 transitions.
Graph (trivial) has 107 edges and 166 vertex of which 24 / 166 are part of one of the 10 SCC in 0 ms
Free SCC test removed 14 places
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 152 transition count 531
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 147 transition count 531
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 11 place count 147 transition count 528
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 17 place count 144 transition count 528
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 143 transition count 523
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 143 transition count 523
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 35 place count 135 transition count 515
Performed 7 Post agglomeration using F-continuation condition with reduction of 13 identical transitions.
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 49 place count 128 transition count 568
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 76 place count 128 transition count 541
Drop transitions (Redundant composition of simpler transitions.) removed 72 transitions
Redundant transition composition rules discarded 72 transitions
Iterating global reduction 3 with 72 rules applied. Total rules applied 148 place count 128 transition count 469
Free-agglomeration rule applied 13 times.
Iterating global reduction 3 with 13 rules applied. Total rules applied 161 place count 128 transition count 456
Reduce places removed 13 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 3 with 39 rules applied. Total rules applied 200 place count 115 transition count 430
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 201 place count 114 transition count 425
Iterating global reduction 4 with 1 rules applied. Total rules applied 202 place count 114 transition count 425
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 4 with 14 rules applied. Total rules applied 216 place count 114 transition count 411
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 217 place count 113 transition count 406
Iterating global reduction 4 with 1 rules applied. Total rules applied 218 place count 113 transition count 406
Applied a total of 218 rules in 64 ms. Remains 113 /166 variables (removed 53) and now considering 406/566 (removed 160) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 113/166 places, 406/566 transitions.
RANDOM walk for 40000 steps (557 resets) in 833 ms. (47 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40003 steps (67 resets) in 142 ms. (279 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40003 steps (34 resets) in 82 ms. (481 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (70 resets) in 62 ms. (634 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (70 resets) in 42 ms. (930 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (32 resets) in 41 ms. (952 steps per ms) remains 5/5 properties
[2025-05-29 21:51:08] [INFO ] Flow matrix only has 276 transitions (discarded 130 similar events)
// Phase 1: matrix 276 rows 113 cols
[2025-05-29 21:51:08] [INFO ] Computed 12 invariants in 2 ms
[2025-05-29 21:51:08] [INFO ] State equation strengthened by 108 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 59/69 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 29/98 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 253/351 variables, 98/110 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 69/179 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/351 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 38/389 variables, 15/194 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/389 variables, 39/233 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/389 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/389 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 233 constraints, problems are : Problem set: 0 solved, 5 unsolved in 323 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 113/113 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 59/69 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 29/98 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:51:08] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:51:08] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 253/351 variables, 98/112 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/351 variables, 69/181 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/351 variables, 3/184 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/351 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 38/389 variables, 15/199 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/389 variables, 39/238 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/389 variables, 2/240 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/389 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:51:09] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:51:09] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:51:09] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:51:09] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 2 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/389 variables, 4/244 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/389 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/389 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 389/389 variables, and 244 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1410 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 113/113 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1745ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 3 properties in 237 ms.
Support contains 3 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 406/406 transitions.
Graph (trivial) has 58 edges and 113 vertex of which 6 / 113 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 715 edges and 110 vertex of which 109 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 109 transition count 394
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 108 transition count 394
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 5 place count 108 transition count 392
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 9 place count 106 transition count 392
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 103 transition count 389
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 103 transition count 388
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 20 place count 101 transition count 402
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 21 place count 101 transition count 401
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 4 with 40 rules applied. Total rules applied 61 place count 101 transition count 361
Free-agglomeration rule applied 11 times with reduction of 2 identical transitions.
Iterating global reduction 4 with 11 rules applied. Total rules applied 72 place count 101 transition count 348
Reduce places removed 11 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 43 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 4 with 58 rules applied. Total rules applied 130 place count 90 transition count 301
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 131 place count 89 transition count 296
Iterating global reduction 5 with 1 rules applied. Total rules applied 132 place count 89 transition count 296
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 5 with 24 rules applied. Total rules applied 156 place count 89 transition count 272
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 157 place count 88 transition count 271
Applied a total of 157 rules in 46 ms. Remains 88 /113 variables (removed 25) and now considering 271/406 (removed 135) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 88/113 places, 271/406 transitions.
RANDOM walk for 37720 steps (708 resets) in 88 ms. (423 steps per ms) remains 0/2 properties
Successfully simplified 9 atomic propositions for a total of 16 simplifications.
FORMULA CloudDeployment-PT-4b-CTLFireability-2025-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-4b-CTLFireability-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-29 21:51:10] [INFO ] Flatten gal took : 99 ms
[2025-05-29 21:51:10] [INFO ] Flatten gal took : 89 ms
[2025-05-29 21:51:10] [INFO ] Input system was already deterministic with 1423 transitions.
Support contains 81 out of 789 places (down from 83) after GAL structural reductions.
Computed a total of 137 stabilizing places and 599 stable transitions
Graph (complete) has 2194 edges and 789 vertex of which 766 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.25 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 789/789 places, 1423/1423 transitions.
Graph (trivial) has 803 edges and 789 vertex of which 278 / 789 are part of one of the 31 SCC in 2 ms
Free SCC test removed 247 places
Ensure Unique test removed 281 transitions
Reduce isomorphic transitions removed 281 transitions.
Graph (complete) has 1873 edges and 542 vertex of which 519 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.3 ms
Discarding 23 places :
Also discarding 257 output transitions
Drop transitions (Output transitions of discarded places.) removed 257 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 215 transitions
Trivial Post-agglo rules discarded 215 transitions
Performed 215 trivial Post agglomeration. Transition count delta: 215
Iterating post reduction 0 with 215 rules applied. Total rules applied 217 place count 518 transition count 669
Reduce places removed 215 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 219 rules applied. Total rules applied 436 place count 303 transition count 665
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 440 place count 299 transition count 665
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 440 place count 299 transition count 627
Deduced a syphon composed of 38 places in 2 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 516 place count 261 transition count 627
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 524 place count 253 transition count 619
Iterating global reduction 3 with 8 rules applied. Total rules applied 532 place count 253 transition count 619
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 532 place count 253 transition count 616
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 538 place count 250 transition count 616
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 3 with 138 rules applied. Total rules applied 676 place count 181 transition count 547
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 3 with 17 rules applied. Total rules applied 693 place count 181 transition count 530
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 3 with 7 rules applied. Total rules applied 700 place count 181 transition count 523
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 8 rules applied. Total rules applied 708 place count 174 transition count 522
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 709 place count 173 transition count 522
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 717 place count 169 transition count 518
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 718 place count 168 transition count 517
Applied a total of 718 rules in 113 ms. Remains 168 /789 variables (removed 621) and now considering 517/1423 (removed 906) transitions.
[2025-05-29 21:51:11] [INFO ] Flow matrix only has 431 transitions (discarded 86 similar events)
// Phase 1: matrix 431 rows 168 cols
[2025-05-29 21:51:11] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:51:11] [INFO ] Implicit Places using invariants in 94 ms returned []
[2025-05-29 21:51:11] [INFO ] Flow matrix only has 431 transitions (discarded 86 similar events)
[2025-05-29 21:51:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:51:11] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-05-29 21:51:11] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 21:51:11] [INFO ] Redundant transitions in 338 ms returned []
Running 484 sub problems to find dead transitions.
[2025-05-29 21:51:11] [INFO ] Flow matrix only has 431 transitions (discarded 86 similar events)
[2025-05-29 21:51:11] [INFO ] Invariant cache hit.
[2025-05-29 21:51:11] [INFO ] State equation strengthened by 16 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 2 (OVERLAPS) 430/594 variables, 164/168 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/594 variables, 16/184 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/594 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 5 (OVERLAPS) 4/598 variables, 4/188 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/598 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 484 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 598/599 variables, and 188 constraints, problems are : Problem set: 0 solved, 484 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 168/168 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 484/483 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 484 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 2 (OVERLAPS) 430/594 variables, 164/168 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/594 variables, 16/184 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/594 variables, 44/228 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/594 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 6 (OVERLAPS) 4/598 variables, 4/232 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/598 variables, 439/671 constraints. Problems are: Problem set: 0 solved, 484 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 598/599 variables, and 671 constraints, problems are : Problem set: 0 solved, 484 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 168/168 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 484/483 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60554ms problems are : Problem set: 0 solved, 484 unsolved
Search for dead transitions found 0 dead transitions in 60558ms
Starting structural reductions in SI_CTL mode, iteration 1 : 168/789 places, 517/1423 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61412 ms. Remains : 168/789 places, 517/1423 transitions.
[2025-05-29 21:52:12] [INFO ] Flatten gal took : 19 ms
[2025-05-29 21:52:12] [INFO ] Flatten gal took : 20 ms
[2025-05-29 21:52:12] [INFO ] Input system was already deterministic with 517 transitions.
[2025-05-29 21:52:12] [INFO ] Flatten gal took : 19 ms
[2025-05-29 21:52:12] [INFO ] Flatten gal took : 19 ms
[2025-05-29 21:52:12] [INFO ] Time to serialize gal into /tmp/CTLFireability14972714928434364270.gal : 12 ms
[2025-05-29 21:52:12] [INFO ] Time to serialize properties into /tmp/CTLFireability8842115383799283487.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14972714928434364270.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8842115383799283487.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,8.89201e+12,1.56361,55764,2,7074,5,194891,6,0,1140,217380,0


Converting to forward existential form...Done !
original formula: AF(AG(((p117==0) * (AG((p1002==1)) + (AG((p268==1)) * ((p735==0)||(p545==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((p117==0) * (!(E(TRUE U !((p1002==1)))) + (!(E(TRUE U !((p268==1)))) * ((p735==0)||(p...180
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t13, t20, t24, t41, t45, t56, t63, t67, t74, t79, t87, t91, t157, t158, t160, t163, t...1287
(forward)formula 0,0,9.73924,281504,1,0,738,1.47507e+06,1033,307,12356,1.28798e+06,1023
FORMULA CloudDeployment-PT-4b-CTLFireability-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 789/789 places, 1423/1423 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 788 transition count 1423
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 34 place count 755 transition count 1143
Iterating global reduction 1 with 33 rules applied. Total rules applied 67 place count 755 transition count 1143
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 76 place count 746 transition count 1134
Iterating global reduction 1 with 9 rules applied. Total rules applied 85 place count 746 transition count 1134
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 86 place count 745 transition count 1133
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 745 transition count 1133
Applied a total of 87 rules in 67 ms. Remains 745 /789 variables (removed 44) and now considering 1133/1423 (removed 290) transitions.
// Phase 1: matrix 1133 rows 745 cols
[2025-05-29 21:52:22] [INFO ] Computed 12 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:52:22] [INFO ] Implicit Places using invariants in 204 ms returned []
[2025-05-29 21:52:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:52:23] [INFO ] Implicit Places using invariants and state equation in 657 ms returned [10, 18, 185, 193, 358, 366, 531, 539]
[2025-05-29 21:52:23] [INFO ] Actually due to overlaps returned [10]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 865 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 744/789 places, 1133/1423 transitions.
Applied a total of 0 rules in 18 ms. Remains 744 /744 variables (removed 0) and now considering 1133/1133 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 951 ms. Remains : 744/789 places, 1133/1423 transitions.
[2025-05-29 21:52:23] [INFO ] Flatten gal took : 30 ms
[2025-05-29 21:52:23] [INFO ] Flatten gal took : 31 ms
[2025-05-29 21:52:23] [INFO ] Input system was already deterministic with 1133 transitions.
[2025-05-29 21:52:23] [INFO ] Flatten gal took : 30 ms
[2025-05-29 21:52:23] [INFO ] Flatten gal took : 30 ms
[2025-05-29 21:52:23] [INFO ] Time to serialize gal into /tmp/CTLFireability9947804131135215825.gal : 7 ms
[2025-05-29 21:52:23] [INFO ] Time to serialize properties into /tmp/CTLFireability15163363637850498219.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/CTLFireability9947804131135215825.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15163363637850498219.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-29 21:52:53] [INFO ] Flatten gal took : 29 ms
[2025-05-29 21:52:53] [INFO ] Applying decomposition
[2025-05-29 21:52:53] [INFO ] Flatten gal took : 30 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/graph6863491623353324580.txt' '-o' '/tmp/graph6863491623353324580.bin' '-w' '/tmp/graph6863491623353324580.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6863491623353324580.bin' '-l' '-1' '-v' '-w' '/tmp/graph6863491623353324580.weights' '-q' '0' '-e' '0.001'
[2025-05-29 21:52:53] [INFO ] Decomposing Gal with order
[2025-05-29 21:52:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 21:52:54] [INFO ] Removed a total of 1060 redundant transitions.
[2025-05-29 21:52:54] [INFO ] Flatten gal took : 155 ms
[2025-05-29 21:52:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 71 labels/synchronizations in 57 ms.
[2025-05-29 21:52:54] [INFO ] Time to serialize gal into /tmp/CTLFireability18070872698557995777.gal : 12 ms
[2025-05-29 21:52:54] [INFO ] Time to serialize properties into /tmp/CTLFireability8295370367191915979.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/CTLFireability18070872698557995777.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8295370367191915979.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 789/789 places, 1423/1423 transitions.
Graph (trivial) has 804 edges and 789 vertex of which 282 / 789 are part of one of the 31 SCC in 1 ms
Free SCC test removed 251 places
Ensure Unique test removed 286 transitions
Reduce isomorphic transitions removed 286 transitions.
Graph (complete) has 1873 edges and 538 vertex of which 515 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.3 ms
Discarding 23 places :
Also discarding 257 output transitions
Drop transitions (Output transitions of discarded places.) removed 257 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 217 transitions
Trivial Post-agglo rules discarded 217 transitions
Performed 217 trivial Post agglomeration. Transition count delta: 217
Iterating post reduction 0 with 217 rules applied. Total rules applied 219 place count 515 transition count 663
Reduce places removed 217 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 221 rules applied. Total rules applied 440 place count 298 transition count 659
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 443 place count 295 transition count 659
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 443 place count 295 transition count 622
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 517 place count 258 transition count 622
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 526 place count 249 transition count 613
Iterating global reduction 3 with 9 rules applied. Total rules applied 535 place count 249 transition count 613
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 535 place count 249 transition count 610
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 541 place count 246 transition count 610
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 1 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 683 place count 175 transition count 539
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 3 with 16 rules applied. Total rules applied 699 place count 175 transition count 523
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 8 rules applied. Total rules applied 707 place count 175 transition count 515
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 715 place count 167 transition count 515
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 723 place count 163 transition count 511
Applied a total of 723 rules in 54 ms. Remains 163 /789 variables (removed 626) and now considering 511/1423 (removed 912) transitions.
[2025-05-29 21:53:24] [INFO ] Flow matrix only has 417 transitions (discarded 94 similar events)
// Phase 1: matrix 417 rows 163 cols
[2025-05-29 21:53:24] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:53:24] [INFO ] Implicit Places using invariants in 99 ms returned []
[2025-05-29 21:53:24] [INFO ] Flow matrix only has 417 transitions (discarded 94 similar events)
[2025-05-29 21:53:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:53:24] [INFO ] State equation strengthened by 122 read => feed constraints.
[2025-05-29 21:53:24] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 21:53:25] [INFO ] Redundant transitions in 349 ms returned []
Running 510 sub problems to find dead transitions.
[2025-05-29 21:53:25] [INFO ] Flow matrix only has 417 transitions (discarded 94 similar events)
[2025-05-29 21:53:25] [INFO ] Invariant cache hit.
[2025-05-29 21:53:25] [INFO ] State equation strengthened by 122 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 2 (OVERLAPS) 416/578 variables, 162/166 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/578 variables, 121/287 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/578 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 5 (OVERLAPS) 1/579 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/579 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 510 unsolved
SMT process timed out in 30437ms, After SMT, problems are : Problem set: 0 solved, 510 unsolved
Search for dead transitions found 0 dead transitions in 30438ms
Starting structural reductions in SI_CTL mode, iteration 1 : 163/789 places, 511/1423 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31292 ms. Remains : 163/789 places, 511/1423 transitions.
[2025-05-29 21:53:55] [INFO ] Flatten gal took : 17 ms
[2025-05-29 21:53:55] [INFO ] Flatten gal took : 18 ms
[2025-05-29 21:53:55] [INFO ] Input system was already deterministic with 511 transitions.
[2025-05-29 21:53:55] [INFO ] Flatten gal took : 15 ms
[2025-05-29 21:53:55] [INFO ] Flatten gal took : 14 ms
[2025-05-29 21:53:55] [INFO ] Time to serialize gal into /tmp/CTLFireability14639887116969197022.gal : 5 ms
[2025-05-29 21:53:55] [INFO ] Time to serialize properties into /tmp/CTLFireability18291932096381609750.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/CTLFireability14639887116969197022.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18291932096381609750.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.60891e+12,1.35462,51908,2,8662,5,204891,6,0,1118,178641,0


Converting to forward existential form...Done !
original formula: E(((((p604==1)&&(p639==1))&&((p768==1)&&(p1163==1)))&&(p1178==1)) U !(EG(AF((p237==1)))))
=> equivalent forward existential formula: [(FwdU(Init,((((p604==1)&&(p639==1))&&((p768==1)&&(p1163==1)))&&(p1178==1))) * !(EG(!(EG(!((p237==1)))))))] != F...159
Reverse transition relation is NOT exact ! Due to transitions t1, t12, t19, t23, t40, t41, t52, t59, t63, t74, t81, t85, t137, t138, t141, t144, t148, t149...413
Detected timeout of ITS tools.
[2025-05-29 21:54:25] [INFO ] Flatten gal took : 19 ms
[2025-05-29 21:54:25] [INFO ] Applying decomposition
[2025-05-29 21:54:25] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6005191853134997349.txt' '-o' '/tmp/graph6005191853134997349.bin' '-w' '/tmp/graph6005191853134997349.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6005191853134997349.bin' '-l' '-1' '-v' '-w' '/tmp/graph6005191853134997349.weights' '-q' '0' '-e' '0.001'
[2025-05-29 21:54:25] [INFO ] Decomposing Gal with order
[2025-05-29 21:54:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 21:54:25] [INFO ] Removed a total of 1228 redundant transitions.
[2025-05-29 21:54:26] [INFO ] Flatten gal took : 33 ms
[2025-05-29 21:54:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 119 labels/synchronizations in 11 ms.
[2025-05-29 21:54:26] [INFO ] Time to serialize gal into /tmp/CTLFireability13397903818162365407.gal : 3 ms
[2025-05-29 21:54:26] [INFO ] Time to serialize properties into /tmp/CTLFireability6424930551803217551.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/CTLFireability13397903818162365407.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6424930551803217551.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,9.60891e+12,0.073956,6956,282,50,5539,547,697,8844,99,1647,0


Converting to forward existential form...Done !
original formula: E(((((i2.i0.u22.p604==1)&&(i2.i0.u23.p639==1))&&((i2.i2.u28.p768==1)&&(i4.u46.p1163==1)))&&(i4.u51.p1178==1)) U !(EG(AF((i0.i2.u8.p237==1...160
=> equivalent forward existential formula: [(FwdU(Init,((((i2.i0.u22.p604==1)&&(i2.i0.u23.p639==1))&&((i2.i2.u28.p768==1)&&(i4.u46.p1163==1)))&&(i4.u51.p11...212
Reverse transition relation is NOT exact ! Due to transitions t196, t210, t281, i0.t74, i0.i0.u0.t85, i0.i0.u1.t81, i0.i1.t200, i0.i1.u2.t137, i0.i1.u2.t13...768
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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 789/789 places, 1423/1423 transitions.
Graph (trivial) has 796 edges and 789 vertex of which 273 / 789 are part of one of the 31 SCC in 1 ms
Free SCC test removed 242 places
Ensure Unique test removed 275 transitions
Reduce isomorphic transitions removed 275 transitions.
Graph (complete) has 1879 edges and 547 vertex of which 546 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 222 transitions
Trivial Post-agglo rules discarded 222 transitions
Performed 222 trivial Post agglomeration. Transition count delta: 222
Iterating post reduction 0 with 222 rules applied. Total rules applied 224 place count 545 transition count 924
Reduce places removed 222 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 224 rules applied. Total rules applied 448 place count 323 transition count 922
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 451 place count 322 transition count 920
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 453 place count 320 transition count 920
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 39 Pre rules applied. Total rules applied 453 place count 320 transition count 881
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 531 place count 281 transition count 881
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 541 place count 271 transition count 871
Iterating global reduction 4 with 10 rules applied. Total rules applied 551 place count 271 transition count 871
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 551 place count 271 transition count 868
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 557 place count 268 transition count 868
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 4 with 138 rules applied. Total rules applied 695 place count 199 transition count 799
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 4 with 17 rules applied. Total rules applied 712 place count 199 transition count 782
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 4 with 8 rules applied. Total rules applied 720 place count 199 transition count 774
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 728 place count 191 transition count 774
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 736 place count 187 transition count 770
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 737 place count 186 transition count 769
Applied a total of 737 rules in 82 ms. Remains 186 /789 variables (removed 603) and now considering 769/1423 (removed 654) transitions.
[2025-05-29 21:54:56] [INFO ] Flow matrix only has 679 transitions (discarded 90 similar events)
// Phase 1: matrix 679 rows 186 cols
[2025-05-29 21:54:56] [INFO ] Computed 13 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:54:56] [INFO ] Implicit Places using invariants in 382 ms returned []
[2025-05-29 21:54:56] [INFO ] Flow matrix only has 679 transitions (discarded 90 similar events)
[2025-05-29 21:54:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:54:56] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-05-29 21:54:57] [INFO ] Implicit Places using invariants and state equation in 1044 ms returned []
Implicit Place search using SMT with State Equation took 1428 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 21:54:57] [INFO ] Redundant transitions in 224 ms returned []
Running 736 sub problems to find dead transitions.
[2025-05-29 21:54:57] [INFO ] Flow matrix only has 679 transitions (discarded 90 similar events)
[2025-05-29 21:54:57] [INFO ] Invariant cache hit.
[2025-05-29 21:54:57] [INFO ] State equation strengthened by 16 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 736 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/182 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 736 unsolved
At refinement iteration 2 (OVERLAPS) 4/186 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 736 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 736 unsolved
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
At refinement iteration 4 (OVERLAPS) 678/864 variables, 186/199 constraints. Problems are: Problem set: 255 solved, 481 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/864 variables, 16/215 constraints. Problems are: Problem set: 255 solved, 481 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 864/865 variables, and 215 constraints, problems are : Problem set: 255 solved, 481 unsolved in 30012 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 186/186 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 736/479 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 255 solved, 481 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 5/5 constraints. Problems are: Problem set: 255 solved, 481 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/174 variables, 0/5 constraints. Problems are: Problem set: 255 solved, 481 unsolved
At refinement iteration 2 (OVERLAPS) 12/186 variables, 8/13 constraints. Problems are: Problem set: 255 solved, 481 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 0/13 constraints. Problems are: Problem set: 255 solved, 481 unsolved
At refinement iteration 4 (OVERLAPS) 678/864 variables, 186/199 constraints. Problems are: Problem set: 255 solved, 481 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/864 variables, 16/215 constraints. Problems are: Problem set: 255 solved, 481 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/864 variables, 479/694 constraints. Problems are: Problem set: 255 solved, 481 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 864/865 variables, and 694 constraints, problems are : Problem set: 255 solved, 481 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 186/186 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 481/479 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60936ms problems are : Problem set: 255 solved, 481 unsolved
Search for dead transitions found 255 dead transitions in 60940ms
Found 255 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 255 transitions
Dead transitions reduction (with SMT) removed 255 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 186/789 places, 514/1423 transitions.
Graph (complete) has 1362 edges and 186 vertex of which 184 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 6 places
Applied a total of 1 rules in 10 ms. Remains 178 /186 variables (removed 8) and now considering 514/514 (removed 0) transitions.
[2025-05-29 21:55:58] [INFO ] Flow matrix only has 424 transitions (discarded 90 similar events)
// Phase 1: matrix 424 rows 178 cols
[2025-05-29 21:55:58] [INFO ] Computed 13 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:55:58] [INFO ] Implicit Places using invariants in 109 ms returned []
[2025-05-29 21:55:58] [INFO ] Flow matrix only has 424 transitions (discarded 90 similar events)
[2025-05-29 21:55:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:55:59] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-05-29 21:55:59] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 178/789 places, 514/1423 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 63038 ms. Remains : 178/789 places, 514/1423 transitions.
[2025-05-29 21:55:59] [INFO ] Flatten gal took : 17 ms
[2025-05-29 21:55:59] [INFO ] Flatten gal took : 17 ms
[2025-05-29 21:55:59] [INFO ] Input system was already deterministic with 514 transitions.
[2025-05-29 21:55:59] [INFO ] Flatten gal took : 16 ms
[2025-05-29 21:55:59] [INFO ] Flatten gal took : 18 ms
[2025-05-29 21:55:59] [INFO ] Time to serialize gal into /tmp/CTLFireability456424088372662881.gal : 2 ms
[2025-05-29 21:55:59] [INFO ] Time to serialize properties into /tmp/CTLFireability11895903219780860355.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/CTLFireability456424088372662881.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11895903219780860355.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,8.95825e+12,4.28032,133080,2,19326,5,638616,6,0,1169,517181,0


Converting to forward existential form...Done !
original formula: AG((EG(AF((p394==1))) + EF((((p1057!=1)||(p407==1))||(((((p24==1)&&(p47==1))&&((p85==1)&&(p305==1)))&&(((p332==1)&&(p366==1))&&((p573==1)...252
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(E(TRUE U (((p1057!=1)||(p407==1))||(((((p24==1)&&(p47==1))&&((p85==1)&&(p305==1)))&&(((p3...321
Reverse transition relation is NOT exact ! Due to transitions t1, t12, t43, t56, t77, t84, t89, t156, t158, t161, t167, t170, t173, t175, t176, t180, t188,...358
Detected timeout of ITS tools.
[2025-05-29 21:56:29] [INFO ] Flatten gal took : 19 ms
[2025-05-29 21:56:29] [INFO ] Applying decomposition
[2025-05-29 21:56:29] [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/graph15168835395690395511.txt' '-o' '/tmp/graph15168835395690395511.bin' '-w' '/tmp/graph15168835395690395511.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15168835395690395511.bin' '-l' '-1' '-v' '-w' '/tmp/graph15168835395690395511.weights' '-q' '0' '-e' '0.001'
[2025-05-29 21:56:29] [INFO ] Decomposing Gal with order
[2025-05-29 21:56:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 21:56:29] [INFO ] Removed a total of 1047 redundant transitions.
[2025-05-29 21:56:29] [INFO ] Flatten gal took : 31 ms
[2025-05-29 21:56:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 124 labels/synchronizations in 9 ms.
[2025-05-29 21:56:29] [INFO ] Time to serialize gal into /tmp/CTLFireability16342615147638852727.gal : 3 ms
[2025-05-29 21:56:29] [INFO ] Time to serialize properties into /tmp/CTLFireability4394041223802811177.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/CTLFireability16342615147638852727.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4394041223802811177.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,8.95825e+12,0.109313,8548,318,79,8144,1493,733,16050,113,5600,0


Converting to forward existential form...Done !
original formula: AG((EG(AF((i2.u15.p394==1))) + EF((((i5.i2.u41.p1057!=1)||(i2.u16.p407==1))||(((((i1.i0.u0.p24==1)&&(i4.i1.u29.p47==1))&&((i1.i1.u2.p85==...413
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(E(TRUE U (((i5.i2.u41.p1057!=1)||(i2.u16.p407==1))||(((((i1.i0.u0.p24==1)&&(i4.i1.u29.p47...482
Reverse transition relation is NOT exact ! Due to transitions t56, t89, t218, t235, u54.t1, i1.t77, i1.i0.u1.t84, i1.i1.t161, i1.i1.t222, i1.i1.u2.t156, i1...594
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 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
(forward)formula 0,1,12.2591,469204,1,0,641823,4255,4753,3.80742e+06,656,26560,385414
FORMULA CloudDeployment-PT-4b-CTLFireability-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 789/789 places, 1423/1423 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 788 transition count 1423
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 35 place count 754 transition count 1142
Iterating global reduction 1 with 34 rules applied. Total rules applied 69 place count 754 transition count 1142
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 78 place count 745 transition count 1133
Iterating global reduction 1 with 9 rules applied. Total rules applied 87 place count 745 transition count 1133
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 88 place count 744 transition count 1132
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 744 transition count 1132
Applied a total of 89 rules in 60 ms. Remains 744 /789 variables (removed 45) and now considering 1132/1423 (removed 291) transitions.
// Phase 1: matrix 1132 rows 744 cols
[2025-05-29 21:56:41] [INFO ] Computed 12 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:56:42] [INFO ] Implicit Places using invariants in 140 ms returned []
[2025-05-29 21:56:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:56:42] [INFO ] Implicit Places using invariants and state equation in 656 ms returned [10, 18, 184, 192, 357, 366, 531, 539]
[2025-05-29 21:56:42] [INFO ] Actually due to overlaps returned [10]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 798 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 743/789 places, 1132/1423 transitions.
Applied a total of 0 rules in 17 ms. Remains 743 /743 variables (removed 0) and now considering 1132/1132 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 877 ms. Remains : 743/789 places, 1132/1423 transitions.
[2025-05-29 21:56:42] [INFO ] Flatten gal took : 26 ms
[2025-05-29 21:56:42] [INFO ] Flatten gal took : 27 ms
[2025-05-29 21:56:42] [INFO ] Input system was already deterministic with 1132 transitions.
[2025-05-29 21:56:42] [INFO ] Flatten gal took : 27 ms
[2025-05-29 21:56:42] [INFO ] Flatten gal took : 27 ms
[2025-05-29 21:56:42] [INFO ] Time to serialize gal into /tmp/CTLFireability2436286818128440902.gal : 5 ms
[2025-05-29 21:56:42] [INFO ] Time to serialize properties into /tmp/CTLFireability17841731940595619071.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/CTLFireability2436286818128440902.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17841731940595619071.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 789/789 places, 1423/1423 transitions.
Graph (trivial) has 799 edges and 789 vertex of which 274 / 789 are part of one of the 30 SCC in 3 ms
Free SCC test removed 244 places
Ensure Unique test removed 278 transitions
Reduce isomorphic transitions removed 278 transitions.
Graph (complete) has 1876 edges and 545 vertex of which 522 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.2 ms
Discarding 23 places :
Also discarding 257 output transitions
Drop transitions (Output transitions of discarded places.) removed 257 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 216 transitions
Trivial Post-agglo rules discarded 216 transitions
Performed 216 trivial Post agglomeration. Transition count delta: 216
Iterating post reduction 0 with 216 rules applied. Total rules applied 218 place count 521 transition count 671
Reduce places removed 216 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 219 rules applied. Total rules applied 437 place count 305 transition count 668
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 440 place count 302 transition count 668
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 440 place count 302 transition count 629
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 518 place count 263 transition count 629
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 526 place count 255 transition count 621
Iterating global reduction 3 with 8 rules applied. Total rules applied 534 place count 255 transition count 621
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 534 place count 255 transition count 618
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 540 place count 252 transition count 618
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 3 with 138 rules applied. Total rules applied 678 place count 183 transition count 549
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 3 with 16 rules applied. Total rules applied 694 place count 183 transition count 533
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 8 rules applied. Total rules applied 702 place count 183 transition count 525
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 710 place count 175 transition count 525
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 718 place count 171 transition count 521
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 721 place count 171 transition count 521
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 722 place count 170 transition count 520
Applied a total of 722 rules in 81 ms. Remains 170 /789 variables (removed 619) and now considering 520/1423 (removed 903) transitions.
[2025-05-29 21:57:43] [INFO ] Flow matrix only has 431 transitions (discarded 89 similar events)
// Phase 1: matrix 431 rows 170 cols
[2025-05-29 21:57:43] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:57:43] [INFO ] Implicit Places using invariants in 346 ms returned []
[2025-05-29 21:57:43] [INFO ] Flow matrix only has 431 transitions (discarded 89 similar events)
[2025-05-29 21:57:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:57:43] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-05-29 21:57:43] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 570 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 21:57:44] [INFO ] Redundant transitions in 287 ms returned []
Running 486 sub problems to find dead transitions.
[2025-05-29 21:57:44] [INFO ] Flow matrix only has 431 transitions (discarded 89 similar events)
[2025-05-29 21:57:44] [INFO ] Invariant cache hit.
[2025-05-29 21:57:44] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 486 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 486 unsolved
At refinement iteration 2 (OVERLAPS) 430/595 variables, 165/169 constraints. Problems are: Problem set: 0 solved, 486 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/595 variables, 16/185 constraints. Problems are: Problem set: 0 solved, 486 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/595 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 486 unsolved
At refinement iteration 5 (OVERLAPS) 5/600 variables, 5/190 constraints. Problems are: Problem set: 0 solved, 486 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 600/601 variables, and 190 constraints, problems are : Problem set: 0 solved, 486 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 170/170 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 486/485 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 486 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 486 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 486 unsolved
At refinement iteration 2 (OVERLAPS) 430/595 variables, 165/169 constraints. Problems are: Problem set: 0 solved, 486 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/595 variables, 16/185 constraints. Problems are: Problem set: 0 solved, 486 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/595 variables, 43/228 constraints. Problems are: Problem set: 0 solved, 486 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/595 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 486 unsolved
At refinement iteration 6 (OVERLAPS) 5/600 variables, 5/233 constraints. Problems are: Problem set: 0 solved, 486 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/600 variables, 442/675 constraints. Problems are: Problem set: 0 solved, 486 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 600/601 variables, and 675 constraints, problems are : Problem set: 0 solved, 486 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 170/170 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 486/485 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60465ms problems are : Problem set: 0 solved, 486 unsolved
Search for dead transitions found 0 dead transitions in 60466ms
Starting structural reductions in SI_CTL mode, iteration 1 : 170/789 places, 520/1423 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61418 ms. Remains : 170/789 places, 520/1423 transitions.
[2025-05-29 21:58:44] [INFO ] Flatten gal took : 15 ms
[2025-05-29 21:58:44] [INFO ] Flatten gal took : 16 ms
[2025-05-29 21:58:44] [INFO ] Input system was already deterministic with 520 transitions.
[2025-05-29 21:58:44] [INFO ] Flatten gal took : 15 ms
[2025-05-29 21:58:44] [INFO ] Flatten gal took : 16 ms
[2025-05-29 21:58:44] [INFO ] Time to serialize gal into /tmp/CTLFireability17209782380560145161.gal : 2 ms
[2025-05-29 21:58:44] [INFO ] Time to serialize properties into /tmp/CTLFireability3228237784469275391.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/CTLFireability17209782380560145161.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3228237784469275391.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.11332e+13,1.06411,38220,2,5827,5,147307,6,0,1152,127961,0


Converting to forward existential form...Done !
original formula: (AG(((((p418==0)&&(p48==0)) + !(A((p696==1) U (p950==1)))) * ((p1041==0)||(p844==1)))) * EG(EF(((p542==1)&&(p1161==1)))))
=> equivalent forward existential formula: (([(((FwdU(Init,TRUE) * !(((p418==0)&&(p48==0)))) * !(EG(!((p950==1))))) * !(E(!((p950==1)) U (!((p696==1)) * !(...301
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t21, t25, t26, t42, t46, t60, t67, t71, t81, t88, t90, t93, t160, t161, t163, t167, t...1293
Detected timeout of ITS tools.
[2025-05-29 21:59:14] [INFO ] Flatten gal took : 21 ms
[2025-05-29 21:59:14] [INFO ] Applying decomposition
[2025-05-29 21:59:14] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8311100077038496428.txt' '-o' '/tmp/graph8311100077038496428.bin' '-w' '/tmp/graph8311100077038496428.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8311100077038496428.bin' '-l' '-1' '-v' '-w' '/tmp/graph8311100077038496428.weights' '-q' '0' '-e' '0.001'
[2025-05-29 21:59:14] [INFO ] Decomposing Gal with order
[2025-05-29 21:59:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 21:59:15] [INFO ] Removed a total of 1237 redundant transitions.
[2025-05-29 21:59:15] [INFO ] Flatten gal took : 25 ms
[2025-05-29 21:59:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 103 labels/synchronizations in 7 ms.
[2025-05-29 21:59:15] [INFO ] Time to serialize gal into /tmp/CTLFireability9227475319084234595.gal : 2 ms
[2025-05-29 21:59:15] [INFO ] Time to serialize properties into /tmp/CTLFireability8651029450782952357.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/CTLFireability9227475319084234595.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8651029450782952357.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.11332e+13,0.071621,6632,348,38,4456,407,714,7590,97,993,0


Converting to forward existential form...Done !
original formula: (AG(((((i1.u18.p418==0)&&(i0.u1.p48==0)) + !(A((i2.i0.i0.u29.p696==1) U (i3.u40.p950==1)))) * ((i3.u44.p1041==0)||(i2.i1.i1.u36.p844==1))...206
=> equivalent forward existential formula: (([(((FwdU(Init,TRUE) * !(((i1.u18.p418==0)&&(i0.u1.p48==0)))) * !(EG(!((i3.u40.p950==1))))) * !(E(!((i3.u40.p95...382
Reverse transition relation is NOT exact ! Due to transitions t0, t221, t238, t287, t293, t357, t389, t433, t453, t477, i0.t225, i0.t81, i0.u0.t93, i0.u1.t...771
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 789/789 places, 1423/1423 transitions.
Graph (trivial) has 793 edges and 789 vertex of which 270 / 789 are part of one of the 31 SCC in 3 ms
Free SCC test removed 239 places
Ensure Unique test removed 271 transitions
Reduce isomorphic transitions removed 271 transitions.
Graph (complete) has 1890 edges and 550 vertex of which 549 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 217 transitions
Trivial Post-agglo rules discarded 217 transitions
Performed 217 trivial Post agglomeration. Transition count delta: 217
Iterating post reduction 0 with 217 rules applied. Total rules applied 219 place count 548 transition count 933
Reduce places removed 217 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 221 rules applied. Total rules applied 440 place count 331 transition count 929
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 445 place count 327 transition count 928
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 445 place count 327 transition count 888
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 525 place count 287 transition count 888
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 533 place count 279 transition count 880
Iterating global reduction 3 with 8 rules applied. Total rules applied 541 place count 279 transition count 880
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 541 place count 279 transition count 877
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 547 place count 276 transition count 877
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 3 with 138 rules applied. Total rules applied 685 place count 207 transition count 808
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 3 with 17 rules applied. Total rules applied 702 place count 207 transition count 791
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 8 rules applied. Total rules applied 710 place count 207 transition count 783
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 718 place count 199 transition count 783
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 728 place count 194 transition count 778
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 729 place count 193 transition count 777
Applied a total of 729 rules in 83 ms. Remains 193 /789 variables (removed 596) and now considering 777/1423 (removed 646) transitions.
[2025-05-29 21:59:45] [INFO ] Flow matrix only has 691 transitions (discarded 86 similar events)
// Phase 1: matrix 691 rows 193 cols
[2025-05-29 21:59:45] [INFO ] Computed 13 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:59:45] [INFO ] Implicit Places using invariants in 217 ms returned []
[2025-05-29 21:59:45] [INFO ] Flow matrix only has 691 transitions (discarded 86 similar events)
[2025-05-29 21:59:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:59:45] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-05-29 21:59:46] [INFO ] Implicit Places using invariants and state equation in 1180 ms returned []
Implicit Place search using SMT with State Equation took 1398 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 21:59:46] [INFO ] Redundant transitions in 232 ms returned []
Running 748 sub problems to find dead transitions.
[2025-05-29 21:59:46] [INFO ] Flow matrix only has 691 transitions (discarded 86 similar events)
[2025-05-29 21:59:46] [INFO ] Invariant cache hit.
[2025-05-29 21:59:46] [INFO ] State equation strengthened by 16 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 748 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 748 unsolved
At refinement iteration 2 (OVERLAPS) 5/193 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 748 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 748 unsolved
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
At refinement iteration 4 (OVERLAPS) 690/883 variables, 193/206 constraints. Problems are: Problem set: 255 solved, 493 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/883 variables, 16/222 constraints. Problems are: Problem set: 255 solved, 493 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/883 variables, 0/222 constraints. Problems are: Problem set: 255 solved, 493 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 883/884 variables, and 222 constraints, problems are : Problem set: 255 solved, 493 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 193/193 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 748/491 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 255 solved, 493 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 5/5 constraints. Problems are: Problem set: 255 solved, 493 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 0/5 constraints. Problems are: Problem set: 255 solved, 493 unsolved
At refinement iteration 2 (OVERLAPS) 13/193 variables, 8/13 constraints. Problems are: Problem set: 255 solved, 493 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 0/13 constraints. Problems are: Problem set: 255 solved, 493 unsolved
At refinement iteration 4 (OVERLAPS) 690/883 variables, 193/206 constraints. Problems are: Problem set: 255 solved, 493 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/883 variables, 16/222 constraints. Problems are: Problem set: 255 solved, 493 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/883 variables, 491/713 constraints. Problems are: Problem set: 255 solved, 493 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 883/884 variables, and 713 constraints, problems are : Problem set: 255 solved, 493 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 193/193 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 493/491 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60990ms problems are : Problem set: 255 solved, 493 unsolved
Search for dead transitions found 255 dead transitions in 60992ms
Found 255 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 255 transitions
Dead transitions reduction (with SMT) removed 255 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 193/789 places, 522/1423 transitions.
Graph (complete) has 1376 edges and 193 vertex of which 187 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 places
Applied a total of 1 rules in 8 ms. Remains 185 /193 variables (removed 8) and now considering 522/522 (removed 0) transitions.
[2025-05-29 22:00:47] [INFO ] Flow matrix only has 436 transitions (discarded 86 similar events)
// Phase 1: matrix 436 rows 185 cols
[2025-05-29 22:00:47] [INFO ] Computed 13 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:00:47] [INFO ] Implicit Places using invariants in 84 ms returned []
[2025-05-29 22:00:47] [INFO ] Flow matrix only has 436 transitions (discarded 86 similar events)
[2025-05-29 22:00:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:00:48] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-05-29 22:00:48] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 185/789 places, 522/1423 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 63045 ms. Remains : 185/789 places, 522/1423 transitions.
[2025-05-29 22:00:48] [INFO ] Flatten gal took : 20 ms
[2025-05-29 22:00:48] [INFO ] Flatten gal took : 15 ms
[2025-05-29 22:00:48] [INFO ] Input system was already deterministic with 522 transitions.
[2025-05-29 22:00:48] [INFO ] Flatten gal took : 16 ms
[2025-05-29 22:00:48] [INFO ] Flatten gal took : 15 ms
[2025-05-29 22:00:48] [INFO ] Time to serialize gal into /tmp/CTLFireability6420388629874646533.gal : 3 ms
[2025-05-29 22:00:48] [INFO ] Time to serialize properties into /tmp/CTLFireability17121383847159615735.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/CTLFireability6420388629874646533.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17121383847159615735.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.67751e+13,5.29301,156944,2,22099,5,726514,6,0,1213,681895,0


Converting to forward existential form...Done !
original formula: (AF(EG(((p1018==0)||(p464==0)))) + EG(((E(AG((p441==1)) U ((((((p11==1)&&(p47==1))&&((p85==1)&&(p292==1)))&&(((p332==1)&&(p366==1))&&((p5...310
=> equivalent forward existential formula: [FwdG((Init * !(EG(((E(!(E(TRUE U !((p441==1)))) U ((((((p11==1)&&(p47==1))&&((p85==1)&&(p292==1)))&&(((p332==1)...417
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t12, t18, t20, t36, t59, t60, t72, t74, t83, t90, t94, t95, t150, t152, t156, t161, t...1497
Detected timeout of ITS tools.
[2025-05-29 22:01:18] [INFO ] Flatten gal took : 20 ms
[2025-05-29 22:01:18] [INFO ] Applying decomposition
[2025-05-29 22:01:18] [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/graph6393661970904637392.txt' '-o' '/tmp/graph6393661970904637392.bin' '-w' '/tmp/graph6393661970904637392.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6393661970904637392.bin' '-l' '-1' '-v' '-w' '/tmp/graph6393661970904637392.weights' '-q' '0' '-e' '0.001'
[2025-05-29 22:01:18] [INFO ] Decomposing Gal with order
[2025-05-29 22:01:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 22:01:18] [INFO ] Removed a total of 1051 redundant transitions.
[2025-05-29 22:01:18] [INFO ] Flatten gal took : 25 ms
[2025-05-29 22:01:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 107 labels/synchronizations in 5 ms.
[2025-05-29 22:01:18] [INFO ] Time to serialize gal into /tmp/CTLFireability98456245661746614.gal : 2 ms
[2025-05-29 22:01:18] [INFO ] Time to serialize properties into /tmp/CTLFireability9697294919043260569.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/CTLFireability98456245661746614.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9697294919043260569.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 -...260
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.67751e+13,0.113733,8552,389,86,8435,943,807,14026,132,2674,0


Converting to forward existential form...Done !
original formula: (AF(EG(((i4.i2.u43.p1018==0)||(i2.i1.u21.p464==0)))) + EG(((E(AG((i2.i1.u20.p441==1)) U ((((((i2.i1.u15.p11==1)&&(i2.i1.u15.p47==1))&&((i...506
=> equivalent forward existential formula: [FwdG((Init * !(EG(((E(!(E(TRUE U !((i2.i1.u20.p441==1)))) U ((((((i2.i1.u15.p11==1)&&(i2.i1.u15.p47==1))&&((i0....627
Reverse transition relation is NOT exact ! Due to transitions t0, t59, t95, t208, t221, t297, t333, t341, t357, t361, t365, t377, t409, t421, t453, t477, i...726
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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 789/789 places, 1423/1423 transitions.
Graph (trivial) has 811 edges and 789 vertex of which 284 / 789 are part of one of the 31 SCC in 2 ms
Free SCC test removed 253 places
Ensure Unique test removed 289 transitions
Reduce isomorphic transitions removed 289 transitions.
Graph (complete) has 1863 edges and 536 vertex of which 513 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.2 ms
Discarding 23 places :
Also discarding 257 output transitions
Drop transitions (Output transitions of discarded places.) removed 257 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 219 transitions
Trivial Post-agglo rules discarded 219 transitions
Performed 219 trivial Post agglomeration. Transition count delta: 219
Iterating post reduction 0 with 219 rules applied. Total rules applied 221 place count 512 transition count 657
Reduce places removed 219 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 220 rules applied. Total rules applied 441 place count 293 transition count 656
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 442 place count 292 transition count 656
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 442 place count 292 transition count 618
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 518 place count 254 transition count 618
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 526 place count 246 transition count 610
Iterating global reduction 3 with 8 rules applied. Total rules applied 534 place count 246 transition count 610
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 534 place count 246 transition count 608
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 538 place count 244 transition count 608
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 678 place count 174 transition count 538
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 3 with 16 rules applied. Total rules applied 694 place count 174 transition count 522
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 8 rules applied. Total rules applied 702 place count 174 transition count 514
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 710 place count 166 transition count 514
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 718 place count 162 transition count 510
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 719 place count 161 transition count 509
Applied a total of 719 rules in 54 ms. Remains 161 /789 variables (removed 628) and now considering 509/1423 (removed 914) transitions.
[2025-05-29 22:01:48] [INFO ] Flow matrix only has 415 transitions (discarded 94 similar events)
// Phase 1: matrix 415 rows 161 cols
[2025-05-29 22:01:48] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:01:48] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-05-29 22:01:48] [INFO ] Flow matrix only has 415 transitions (discarded 94 similar events)
[2025-05-29 22:01:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:01:48] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-05-29 22:01:48] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 22:01:49] [INFO ] Redundant transitions in 257 ms returned []
Running 476 sub problems to find dead transitions.
[2025-05-29 22:01:49] [INFO ] Flow matrix only has 415 transitions (discarded 94 similar events)
[2025-05-29 22:01:49] [INFO ] Invariant cache hit.
[2025-05-29 22:01:49] [INFO ] State equation strengthened by 16 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 2 (OVERLAPS) 414/571 variables, 157/161 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 16/177 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 5 (OVERLAPS) 4/575 variables, 4/181 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/575 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 476 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 575/576 variables, and 181 constraints, problems are : Problem set: 0 solved, 476 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 161/161 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 476/475 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 476 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 2 (OVERLAPS) 414/571 variables, 157/161 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 16/177 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 37/214 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 6 (OVERLAPS) 4/575 variables, 4/218 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/575 variables, 438/656 constraints. Problems are: Problem set: 0 solved, 476 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 575/576 variables, and 656 constraints, problems are : Problem set: 0 solved, 476 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 161/161 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 476/475 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60427ms problems are : Problem set: 0 solved, 476 unsolved
Search for dead transitions found 0 dead transitions in 60428ms
Starting structural reductions in SI_CTL mode, iteration 1 : 161/789 places, 509/1423 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61052 ms. Remains : 161/789 places, 509/1423 transitions.
[2025-05-29 22:02:49] [INFO ] Flatten gal took : 15 ms
[2025-05-29 22:02:49] [INFO ] Flatten gal took : 15 ms
[2025-05-29 22:02:49] [INFO ] Input system was already deterministic with 509 transitions.
[2025-05-29 22:02:49] [INFO ] Flatten gal took : 15 ms
[2025-05-29 22:02:49] [INFO ] Flatten gal took : 15 ms
[2025-05-29 22:02:49] [INFO ] Time to serialize gal into /tmp/CTLFireability5771169998399558011.gal : 3 ms
[2025-05-29 22:02:49] [INFO ] Time to serialize properties into /tmp/CTLFireability3613765483480274499.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/CTLFireability5771169998399558011.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3613765483480274499.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,7.59715e+12,1.6549,56820,2,8561,5,231637,6,0,1104,207556,0


Converting to forward existential form...Done !
original formula: EF((AF((p404==0)) * AG((p584==0))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!((p404==0))))) * !(E(TRUE U !((p584==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t11, t18, t22, t38, t43, t45, t57, t64, t68, t78, t85, t89, t153, t154, t157, t160, t164,...418
Detected timeout of ITS tools.
[2025-05-29 22:03:19] [INFO ] Flatten gal took : 17 ms
[2025-05-29 22:03:19] [INFO ] Applying decomposition
[2025-05-29 22:03:19] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5382702291033869474.txt' '-o' '/tmp/graph5382702291033869474.bin' '-w' '/tmp/graph5382702291033869474.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5382702291033869474.bin' '-l' '-1' '-v' '-w' '/tmp/graph5382702291033869474.weights' '-q' '0' '-e' '0.001'
[2025-05-29 22:03:19] [INFO ] Decomposing Gal with order
[2025-05-29 22:03:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 22:03:19] [INFO ] Removed a total of 1040 redundant transitions.
[2025-05-29 22:03:19] [INFO ] Flatten gal took : 22 ms
[2025-05-29 22:03:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 126 labels/synchronizations in 5 ms.
[2025-05-29 22:03:19] [INFO ] Time to serialize gal into /tmp/CTLFireability2220908516994703796.gal : 2 ms
[2025-05-29 22:03:19] [INFO ] Time to serialize properties into /tmp/CTLFireability15151467365204565994.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/CTLFireability2220908516994703796.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15151467365204565994.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,7.59715e+12,0.064954,6368,289,53,4191,513,679,6972,84,1695,0


Converting to forward existential form...Done !
original formula: EF((AF((i1.i1.u16.p404==0)) * AG((i2.i0.u23.p584==0))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!((i1.i1.u16.p404==0))))) * !(E(TRUE U !((i2.i0.u23.p584==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t213, t230, t280, u53.t1, i0.t78, i0.i0.u0.t89, i0.i0.u1.t85, i0.i2.t217, i0.i2.u2.t153, i0.i...776
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
(forward)formula 0,1,10.8092,426432,1,0,692801,3075,4326,3.14409e+06,451,19911,369517
FORMULA CloudDeployment-PT-4b-CTLFireability-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 789/789 places, 1423/1423 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 788 transition count 1423
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 34 place count 755 transition count 1143
Iterating global reduction 1 with 33 rules applied. Total rules applied 67 place count 755 transition count 1143
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 75 place count 747 transition count 1135
Iterating global reduction 1 with 8 rules applied. Total rules applied 83 place count 747 transition count 1135
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 84 place count 746 transition count 1134
Iterating global reduction 1 with 1 rules applied. Total rules applied 85 place count 746 transition count 1134
Applied a total of 85 rules in 67 ms. Remains 746 /789 variables (removed 43) and now considering 1134/1423 (removed 289) transitions.
// Phase 1: matrix 1134 rows 746 cols
[2025-05-29 22:03:30] [INFO ] Computed 12 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:03:30] [INFO ] Implicit Places using invariants in 149 ms returned []
[2025-05-29 22:03:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:03:31] [INFO ] Implicit Places using invariants and state equation in 628 ms returned [10, 18, 185, 195, 360, 368, 533, 541]
[2025-05-29 22:03:31] [INFO ] Actually due to overlaps returned [10]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 782 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 745/789 places, 1134/1423 transitions.
Applied a total of 0 rules in 16 ms. Remains 745 /745 variables (removed 0) and now considering 1134/1134 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 866 ms. Remains : 745/789 places, 1134/1423 transitions.
[2025-05-29 22:03:31] [INFO ] Flatten gal took : 25 ms
[2025-05-29 22:03:31] [INFO ] Flatten gal took : 26 ms
[2025-05-29 22:03:31] [INFO ] Input system was already deterministic with 1134 transitions.
[2025-05-29 22:03:31] [INFO ] Flatten gal took : 25 ms
[2025-05-29 22:03:31] [INFO ] Flatten gal took : 26 ms
[2025-05-29 22:03:31] [INFO ] Time to serialize gal into /tmp/CTLFireability14134040049837625281.gal : 4 ms
[2025-05-29 22:03:31] [INFO ] Time to serialize properties into /tmp/CTLFireability3314637886269000918.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/CTLFireability14134040049837625281.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3314637886269000918.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-29 22:04:01] [INFO ] Flatten gal took : 31 ms
[2025-05-29 22:04:01] [INFO ] Applying decomposition
[2025-05-29 22:04:01] [INFO ] Flatten gal took : 26 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/graph8099673008603359656.txt' '-o' '/tmp/graph8099673008603359656.bin' '-w' '/tmp/graph8099673008603359656.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8099673008603359656.bin' '-l' '-1' '-v' '-w' '/tmp/graph8099673008603359656.weights' '-q' '0' '-e' '0.001'
[2025-05-29 22:04:01] [INFO ] Decomposing Gal with order
[2025-05-29 22:04:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 22:04:02] [INFO ] Removed a total of 1018 redundant transitions.
[2025-05-29 22:04:02] [INFO ] Flatten gal took : 44 ms
[2025-05-29 22:04:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 10 ms.
[2025-05-29 22:04:02] [INFO ] Time to serialize gal into /tmp/CTLFireability7246884916549702581.gal : 6 ms
[2025-05-29 22:04:02] [INFO ] Time to serialize properties into /tmp/CTLFireability9459481442565661156.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/CTLFireability7246884916549702581.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9459481442565661156.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.17895e+19,20.8868,454592,7640,7673,471828,366924,1681,1.1083e+06,262,3.56877e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 789/789 places, 1423/1423 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 788 transition count 1423
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 36 place count 753 transition count 1141
Iterating global reduction 1 with 35 rules applied. Total rules applied 71 place count 753 transition count 1141
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 80 place count 744 transition count 1132
Iterating global reduction 1 with 9 rules applied. Total rules applied 89 place count 744 transition count 1132
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 90 place count 743 transition count 1131
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 743 transition count 1131
Applied a total of 91 rules in 57 ms. Remains 743 /789 variables (removed 46) and now considering 1131/1423 (removed 292) transitions.
// Phase 1: matrix 1131 rows 743 cols
[2025-05-29 22:04:32] [INFO ] Computed 12 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:04:32] [INFO ] Implicit Places using invariants in 142 ms returned []
[2025-05-29 22:04:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:04:33] [INFO ] Implicit Places using invariants and state equation in 679 ms returned [10, 18, 184, 192, 357, 365, 530, 538]
[2025-05-29 22:04:33] [INFO ] Actually due to overlaps returned [10]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 823 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 742/789 places, 1131/1423 transitions.
Applied a total of 0 rules in 21 ms. Remains 742 /742 variables (removed 0) and now considering 1131/1131 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 902 ms. Remains : 742/789 places, 1131/1423 transitions.
[2025-05-29 22:04:33] [INFO ] Flatten gal took : 26 ms
[2025-05-29 22:04:33] [INFO ] Flatten gal took : 26 ms
[2025-05-29 22:04:33] [INFO ] Input system was already deterministic with 1131 transitions.
[2025-05-29 22:04:33] [INFO ] Flatten gal took : 25 ms
[2025-05-29 22:04:33] [INFO ] Flatten gal took : 26 ms
[2025-05-29 22:04:33] [INFO ] Time to serialize gal into /tmp/CTLFireability3366373301464420983.gal : 4 ms
[2025-05-29 22:04:33] [INFO ] Time to serialize properties into /tmp/CTLFireability4822341925359941697.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/CTLFireability3366373301464420983.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4822341925359941697.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-29 22:05:03] [INFO ] Flatten gal took : 28 ms
[2025-05-29 22:05:03] [INFO ] Applying decomposition
[2025-05-29 22:05:03] [INFO ] Flatten gal took : 25 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/graph4234871912095800832.txt' '-o' '/tmp/graph4234871912095800832.bin' '-w' '/tmp/graph4234871912095800832.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4234871912095800832.bin' '-l' '-1' '-v' '-w' '/tmp/graph4234871912095800832.weights' '-q' '0' '-e' '0.001'
[2025-05-29 22:05:03] [INFO ] Decomposing Gal with order
[2025-05-29 22:05:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 22:05:03] [INFO ] Removed a total of 1217 redundant transitions.
[2025-05-29 22:05:03] [INFO ] Flatten gal took : 43 ms
[2025-05-29 22:05:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 11 ms.
[2025-05-29 22:05:03] [INFO ] Time to serialize gal into /tmp/CTLFireability12885163738214806868.gal : 6 ms
[2025-05-29 22:05:03] [INFO ] Time to serialize properties into /tmp/CTLFireability2184662229487362857.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/CTLFireability12885163738214806868.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2184662229487362857.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,9.45067e+18,3.77023,121800,3269,115,163543,2837,1551,797389,118,7716,0


Converting to forward existential form...Done !
original formula: EX((AG(EX((i14.u176.p782==0))) + EG(AG(((i4.u4.p42==0)||(i23.u138.p604==0))))))
=> equivalent forward existential formula: ([(EY(Init) * !(E(TRUE U !(EX((i14.u176.p782==0))))))] != FALSE + [FwdG(EY(Init),!(E(TRUE U !(((i4.u4.p42==0)||(...188
Reverse transition relation is NOT exact ! Due to transitions t0, t167, t168, t178, t186, t355, t364, t398, t543, t544, t552, t562, t669, t701, t731, t776,...1404
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 789/789 places, 1423/1423 transitions.
Graph (trivial) has 794 edges and 789 vertex of which 266 / 789 are part of one of the 29 SCC in 0 ms
Free SCC test removed 237 places
Ensure Unique test removed 271 transitions
Reduce isomorphic transitions removed 271 transitions.
Graph (complete) has 1895 edges and 552 vertex of which 529 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.1 ms
Discarding 23 places :
Also discarding 257 output transitions
Drop transitions (Output transitions of discarded places.) removed 257 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 221 transitions
Trivial Post-agglo rules discarded 221 transitions
Performed 221 trivial Post agglomeration. Transition count delta: 221
Iterating post reduction 0 with 221 rules applied. Total rules applied 223 place count 529 transition count 674
Reduce places removed 221 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 230 rules applied. Total rules applied 453 place count 308 transition count 665
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 460 place count 301 transition count 665
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 460 place count 301 transition count 627
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 536 place count 263 transition count 627
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 546 place count 253 transition count 617
Iterating global reduction 3 with 10 rules applied. Total rules applied 556 place count 253 transition count 617
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 556 place count 253 transition count 614
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 562 place count 250 transition count 614
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 1 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 704 place count 179 transition count 543
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 3 with 16 rules applied. Total rules applied 720 place count 179 transition count 527
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 8 rules applied. Total rules applied 728 place count 179 transition count 519
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 736 place count 171 transition count 519
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 744 place count 167 transition count 515
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 745 place count 167 transition count 515
Applied a total of 745 rules in 51 ms. Remains 167 /789 variables (removed 622) and now considering 515/1423 (removed 908) transitions.
[2025-05-29 22:05:33] [INFO ] Flow matrix only has 423 transitions (discarded 92 similar events)
// Phase 1: matrix 423 rows 167 cols
[2025-05-29 22:05:33] [INFO ] Computed 4 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:05:33] [INFO ] Implicit Places using invariants in 74 ms returned []
[2025-05-29 22:05:33] [INFO ] Flow matrix only has 423 transitions (discarded 92 similar events)
[2025-05-29 22:05:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:05:33] [INFO ] State equation strengthened by 87 read => feed constraints.
[2025-05-29 22:05:33] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 22:05:34] [INFO ] Redundant transitions in 237 ms returned []
Running 514 sub problems to find dead transitions.
[2025-05-29 22:05:34] [INFO ] Flow matrix only has 423 transitions (discarded 92 similar events)
[2025-05-29 22:05:34] [INFO ] Invariant cache hit.
[2025-05-29 22:05:34] [INFO ] State equation strengthened by 87 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 514 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 514 unsolved
At refinement iteration 2 (OVERLAPS) 422/588 variables, 166/170 constraints. Problems are: Problem set: 0 solved, 514 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/588 variables, 86/256 constraints. Problems are: Problem set: 0 solved, 514 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/588 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 514 unsolved
At refinement iteration 5 (OVERLAPS) 1/589 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 514 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/589 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 514 unsolved
SMT process timed out in 30428ms, After SMT, problems are : Problem set: 0 solved, 514 unsolved
Search for dead transitions found 0 dead transitions in 30429ms
Starting structural reductions in SI_CTL mode, iteration 1 : 167/789 places, 515/1423 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31076 ms. Remains : 167/789 places, 515/1423 transitions.
[2025-05-29 22:06:04] [INFO ] Flatten gal took : 15 ms
[2025-05-29 22:06:04] [INFO ] Flatten gal took : 13 ms
[2025-05-29 22:06:04] [INFO ] Input system was already deterministic with 515 transitions.
[2025-05-29 22:06:04] [INFO ] Flatten gal took : 13 ms
[2025-05-29 22:06:04] [INFO ] Flatten gal took : 12 ms
[2025-05-29 22:06:04] [INFO ] Time to serialize gal into /tmp/CTLFireability282556668600491792.gal : 2 ms
[2025-05-29 22:06:04] [INFO ] Time to serialize properties into /tmp/CTLFireability10621791410659564428.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/CTLFireability282556668600491792.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10621791410659564428.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.37816e+13,1.21221,48424,2,6634,5,181399,6,0,1140,168790,0


Converting to forward existential form...Done !
original formula: (AF(AG(((p519==0)&&(p688==0)))) * AF((((AF(((((p323==1)&&(p358==1))&&((p516==1)&&(p1163==1)))&&(p1178==1))) * (p604==1)) * ((p639==1)&&(p...194
=> equivalent forward existential formula: ([FwdG(Init,!(!(E(TRUE U !(((p519==0)&&(p688==0)))))))] = FALSE * [FwdG(Init,!((((!(EG(!(((((p323==1)&&(p358==1)...277
Reverse transition relation is NOT exact ! Due to transitions t1, t12, t19, t23, t38, t39, t52, t59, t60, t70, t77, t81, t126, t127, t131, t132, t139, t140...413
Detected timeout of ITS tools.
[2025-05-29 22:06:34] [INFO ] Flatten gal took : 17 ms
[2025-05-29 22:06:34] [INFO ] Applying decomposition
[2025-05-29 22:06:34] [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/graph4141719087393162709.txt' '-o' '/tmp/graph4141719087393162709.bin' '-w' '/tmp/graph4141719087393162709.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4141719087393162709.bin' '-l' '-1' '-v' '-w' '/tmp/graph4141719087393162709.weights' '-q' '0' '-e' '0.001'
[2025-05-29 22:06:34] [INFO ] Decomposing Gal with order
[2025-05-29 22:06:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 22:06:34] [INFO ] Removed a total of 1041 redundant transitions.
[2025-05-29 22:06:34] [INFO ] Flatten gal took : 22 ms
[2025-05-29 22:06:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 115 labels/synchronizations in 5 ms.
[2025-05-29 22:06:34] [INFO ] Time to serialize gal into /tmp/CTLFireability14408966243486520943.gal : 1 ms
[2025-05-29 22:06:34] [INFO ] Time to serialize properties into /tmp/CTLFireability4521363214691156819.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/CTLFireability14408966243486520943.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4521363214691156819.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.37816e+13,0.190458,13396,351,66,20651,557,733,39175,108,1941,0


Converting to forward existential form...Done !
original formula: (AF(AG(((i2.i0.u18.p519==0)&&(i3.i2.u26.p688==0)))) * AF((((AF(((((i2.i0.u11.p323==1)&&(i2.i0.u12.p358==1))&&((i2.i0.u18.p516==1)&&(i0.u5...302
=> equivalent forward existential formula: ([FwdG(Init,!(!(E(TRUE U !(((i2.i0.u18.p519==0)&&(i3.i2.u26.p688==0)))))))] = FALSE * [FwdG(Init,!((((!(EG(!((((...385
Reverse transition relation is NOT exact ! Due to transitions t184, t198, t284, i0.u0.t81, i0.u50.t1, i1.t70, i1.i0.u1.t77, i1.i1.t188, i1.i1.u2.t126, i1.i...765
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 789/789 places, 1423/1423 transitions.
Graph (trivial) has 801 edges and 789 vertex of which 267 / 789 are part of one of the 30 SCC in 1 ms
Free SCC test removed 237 places
Ensure Unique test removed 270 transitions
Reduce isomorphic transitions removed 270 transitions.
Graph (complete) has 1891 edges and 552 vertex of which 529 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.2 ms
Discarding 23 places :
Also discarding 257 output transitions
Drop transitions (Output transitions of discarded places.) removed 257 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 222 transitions
Trivial Post-agglo rules discarded 222 transitions
Performed 222 trivial Post agglomeration. Transition count delta: 222
Iterating post reduction 0 with 222 rules applied. Total rules applied 224 place count 529 transition count 674
Reduce places removed 222 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 225 rules applied. Total rules applied 449 place count 307 transition count 671
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 451 place count 305 transition count 671
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 451 place count 305 transition count 629
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 535 place count 263 transition count 629
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 543 place count 255 transition count 621
Iterating global reduction 3 with 8 rules applied. Total rules applied 551 place count 255 transition count 621
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 551 place count 255 transition count 618
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 557 place count 252 transition count 618
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 697 place count 182 transition count 548
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 3 with 17 rules applied. Total rules applied 714 place count 182 transition count 531
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 8 rules applied. Total rules applied 722 place count 182 transition count 523
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 730 place count 174 transition count 523
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 740 place count 169 transition count 518
Applied a total of 740 rules in 46 ms. Remains 169 /789 variables (removed 620) and now considering 518/1423 (removed 905) transitions.
[2025-05-29 22:07:05] [INFO ] Flow matrix only has 429 transitions (discarded 89 similar events)
// Phase 1: matrix 429 rows 169 cols
[2025-05-29 22:07:05] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:07:05] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-05-29 22:07:05] [INFO ] Flow matrix only has 429 transitions (discarded 89 similar events)
[2025-05-29 22:07:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:07:05] [INFO ] State equation strengthened by 122 read => feed constraints.
[2025-05-29 22:07:05] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 22:07:05] [INFO ] Redundant transitions in 266 ms returned []
Running 517 sub problems to find dead transitions.
[2025-05-29 22:07:05] [INFO ] Flow matrix only has 429 transitions (discarded 89 similar events)
[2025-05-29 22:07:05] [INFO ] Invariant cache hit.
[2025-05-29 22:07:05] [INFO ] State equation strengthened by 122 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/168 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 2 (OVERLAPS) 428/596 variables, 168/172 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/596 variables, 121/293 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/596 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 5 (OVERLAPS) 1/597 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/597 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 517 unsolved
SMT process timed out in 30479ms, After SMT, problems are : Problem set: 0 solved, 517 unsolved
Search for dead transitions found 0 dead transitions in 30480ms
Starting structural reductions in SI_CTL mode, iteration 1 : 169/789 places, 518/1423 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31188 ms. Remains : 169/789 places, 518/1423 transitions.
[2025-05-29 22:07:36] [INFO ] Flatten gal took : 12 ms
[2025-05-29 22:07:36] [INFO ] Flatten gal took : 12 ms
[2025-05-29 22:07:36] [INFO ] Input system was already deterministic with 518 transitions.
[2025-05-29 22:07:36] [INFO ] Flatten gal took : 12 ms
[2025-05-29 22:07:36] [INFO ] Flatten gal took : 26 ms
[2025-05-29 22:07:36] [INFO ] Time to serialize gal into /tmp/CTLFireability2608034973680605403.gal : 2 ms
[2025-05-29 22:07:36] [INFO ] Time to serialize properties into /tmp/CTLFireability8546399395656561236.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/CTLFireability2608034973680605403.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8546399395656561236.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.10901e+13,1.90886,63180,2,8856,5,233039,6,0,1150,236564,0


Converting to forward existential form...Done !
original formula: EF(EG(((p3==1) * ((p109==1) + E((p827==1) U ((((p604==1)&&(p639==1))&&((p723==1)&&(p1163==1)))&&(p1178==1)))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((p3==1) * ((p109==1) + E((p827==1) U ((((p604==1)&&(p639==1))&&((p723==1)&&(p1163==1)))&&...180
Reverse transition relation is NOT exact ! Due to transitions t1, t12, t19, t23, t41, t42, t53, t60, t64, t80, t84, t134, t135, t139, t141, t144, t149, t15...426
(forward)formula 0,0,8.82449,244044,1,0,703,1.29442e+06,1034,307,11959,1.14002e+06,1024
FORMULA CloudDeployment-PT-4b-CTLFireability-2023-12 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 : 789/789 places, 1423/1423 transitions.
Graph (trivial) has 812 edges and 789 vertex of which 286 / 789 are part of one of the 32 SCC in 1 ms
Free SCC test removed 254 places
Ensure Unique test removed 289 transitions
Reduce isomorphic transitions removed 289 transitions.
Graph (complete) has 1865 edges and 535 vertex of which 512 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.3 ms
Discarding 23 places :
Also discarding 257 output transitions
Drop transitions (Output transitions of discarded places.) removed 257 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 219 transitions
Trivial Post-agglo rules discarded 219 transitions
Performed 219 trivial Post agglomeration. Transition count delta: 219
Iterating post reduction 0 with 219 rules applied. Total rules applied 221 place count 511 transition count 657
Reduce places removed 219 places and 0 transitions.
Iterating post reduction 1 with 219 rules applied. Total rules applied 440 place count 292 transition count 657
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 440 place count 292 transition count 619
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 516 place count 254 transition count 619
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 525 place count 245 transition count 610
Iterating global reduction 2 with 9 rules applied. Total rules applied 534 place count 245 transition count 610
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 534 place count 245 transition count 607
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 540 place count 242 transition count 607
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 680 place count 172 transition count 537
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 2 with 16 rules applied. Total rules applied 696 place count 172 transition count 521
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 8 rules applied. Total rules applied 704 place count 172 transition count 513
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 712 place count 164 transition count 513
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 720 place count 160 transition count 509
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 721 place count 159 transition count 508
Applied a total of 721 rules in 51 ms. Remains 159 /789 variables (removed 630) and now considering 508/1423 (removed 915) transitions.
[2025-05-29 22:07:45] [INFO ] Flow matrix only has 413 transitions (discarded 95 similar events)
// Phase 1: matrix 413 rows 159 cols
[2025-05-29 22:07:45] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:07:45] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-05-29 22:07:45] [INFO ] Flow matrix only has 413 transitions (discarded 95 similar events)
[2025-05-29 22:07:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:07:45] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-05-29 22:07:45] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 22:07:45] [INFO ] Redundant transitions in 275 ms returned []
Running 475 sub problems to find dead transitions.
[2025-05-29 22:07:45] [INFO ] Flow matrix only has 413 transitions (discarded 95 similar events)
[2025-05-29 22:07:45] [INFO ] Invariant cache hit.
[2025-05-29 22:07:45] [INFO ] State equation strengthened by 16 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 2 (OVERLAPS) 412/567 variables, 155/159 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/567 variables, 16/175 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/567 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 5 (OVERLAPS) 4/571 variables, 4/179 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/571 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 475 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 571/572 variables, and 179 constraints, problems are : Problem set: 0 solved, 475 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 159/159 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 475/474 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 475 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 2 (OVERLAPS) 412/567 variables, 155/159 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/567 variables, 16/175 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/567 variables, 37/212 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/567 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 6 (OVERLAPS) 4/571 variables, 4/216 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/571 variables, 437/653 constraints. Problems are: Problem set: 0 solved, 475 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 571/572 variables, and 653 constraints, problems are : Problem set: 0 solved, 475 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 159/159 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 475/474 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60514ms problems are : Problem set: 0 solved, 475 unsolved
Search for dead transitions found 0 dead transitions in 60515ms
Starting structural reductions in SI_CTL mode, iteration 1 : 159/789 places, 508/1423 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61148 ms. Remains : 159/789 places, 508/1423 transitions.
[2025-05-29 22:08:46] [INFO ] Flatten gal took : 14 ms
[2025-05-29 22:08:46] [INFO ] Flatten gal took : 15 ms
[2025-05-29 22:08:46] [INFO ] Input system was already deterministic with 508 transitions.
[2025-05-29 22:08:46] [INFO ] Flatten gal took : 19 ms
[2025-05-29 22:08:46] [INFO ] Flatten gal took : 16 ms
[2025-05-29 22:08:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10301480662020404952.gal : 2 ms
[2025-05-29 22:08:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3362936527349576583.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/ReachabilityCardinality10301480662020404952.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3362936527349576583.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality3362936527349576583.prop.
RANDOM walk for 40000 steps (1666 resets) in 713 ms. (56 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 15
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :15 after 90
BEST_FIRST walk for 40004 steps (135 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :90 after 413
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :413 after 424
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :424 after 984
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :984 after 4904
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :4904 after 18065
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :18065 after 40509
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :40509 after 1.61154e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.61154e+06 after 1.55488e+07
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,6.47804e+12,1.14573,45316,2,5628,16,172492,7,0,1095,161454,0
Total reachable state count : 6478041420625

Verifying 1 reachability properties.
Reachability property CloudDeployment-PT-4b-CTLFireability-2023-13 is true.
FORMULA CloudDeployment-PT-4b-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CloudDeployment-PT-4b-CTLFireability-2023-13,2.27543e+11,1.14774,45316,2,4190,16,172492,7,0,1097,161454,0
Interrupted probabilistic random walk after 1451863 steps, run timeout after 3001 ms. (steps per millisecond=483 ) properties seen :0 out of 1
Probabilistic random walk after 1451863 steps, saw 197482 distinct states, run finished after 3006 ms. (steps per millisecond=482 ) properties seen :0
Starting structural reductions in LTL mode, iteration 0 : 789/789 places, 1423/1423 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 788 transition count 1423
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 36 place count 753 transition count 1141
Iterating global reduction 1 with 35 rules applied. Total rules applied 71 place count 753 transition count 1141
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 80 place count 744 transition count 1132
Iterating global reduction 1 with 9 rules applied. Total rules applied 89 place count 744 transition count 1132
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 90 place count 743 transition count 1131
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 743 transition count 1131
Applied a total of 91 rules in 64 ms. Remains 743 /789 variables (removed 46) and now considering 1131/1423 (removed 292) transitions.
// Phase 1: matrix 1131 rows 743 cols
[2025-05-29 22:08:49] [INFO ] Computed 12 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:08:49] [INFO ] Implicit Places using invariants in 148 ms returned []
[2025-05-29 22:08:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:08:50] [INFO ] Implicit Places using invariants and state equation in 675 ms returned [10, 18, 184, 192, 357, 365, 530, 538]
[2025-05-29 22:08:50] [INFO ] Actually due to overlaps returned [10]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 828 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 742/789 places, 1131/1423 transitions.
Applied a total of 0 rules in 18 ms. Remains 742 /742 variables (removed 0) and now considering 1131/1131 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 911 ms. Remains : 742/789 places, 1131/1423 transitions.
[2025-05-29 22:08:50] [INFO ] Flatten gal took : 25 ms
[2025-05-29 22:08:50] [INFO ] Flatten gal took : 26 ms
[2025-05-29 22:08:50] [INFO ] Input system was already deterministic with 1131 transitions.
[2025-05-29 22:08:50] [INFO ] Flatten gal took : 33 ms
[2025-05-29 22:08:50] [INFO ] Flatten gal took : 26 ms
[2025-05-29 22:08:50] [INFO ] Time to serialize gal into /tmp/CTLFireability15683470235656264398.gal : 4 ms
[2025-05-29 22:08:50] [INFO ] Time to serialize properties into /tmp/CTLFireability9647982237650548223.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/CTLFireability15683470235656264398.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9647982237650548223.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.45067e+18,5.84965,172200,7408,657,313281,11452,1623,704244,213,108761,0


Converting to forward existential form...Done !
original formula: AX(AX(AF(((i7.u84.p404==1)&&(i15.i0.i0.u182.p802==1)))))
=> equivalent forward existential formula: [FwdG(EY(EY(Init)),!(((i7.u84.p404==1)&&(i15.i0.i0.u182.p802==1))))] = FALSE
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
(forward)formula 0,0,28.0012,682796,1,0,1.04513e+06,63436,7322,4.173e+06,1063,973678,1458838
FORMULA CloudDeployment-PT-4b-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-29 22:09:49] [INFO ] Flatten gal took : 54 ms
[2025-05-29 22:09:49] [INFO ] Flatten gal took : 56 ms
[2025-05-29 22:09:49] [INFO ] Applying decomposition
[2025-05-29 22:09:49] [INFO ] Flatten gal took : 68 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/graph4058446533899229488.txt' '-o' '/tmp/graph4058446533899229488.bin' '-w' '/tmp/graph4058446533899229488.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4058446533899229488.bin' '-l' '-1' '-v' '-w' '/tmp/graph4058446533899229488.weights' '-q' '0' '-e' '0.001'
[2025-05-29 22:09:49] [INFO ] Decomposing Gal with order
[2025-05-29 22:09:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 22:09:49] [INFO ] Removed a total of 2743 redundant transitions.
[2025-05-29 22:09:49] [INFO ] Flatten gal took : 119 ms
[2025-05-29 22:09:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 562 labels/synchronizations in 30 ms.
[2025-05-29 22:09:49] [INFO ] Time to serialize gal into /tmp/CTLFireability2674127379803789235.gal : 8 ms
[2025-05-29 22:09:49] [INFO ] Time to serialize properties into /tmp/CTLFireability13104801241607921766.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/CTLFireability2674127379803789235.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13104801241607921766.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 8 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.80547e+19,25.2899,559292,6396,2973,572115,232911,1958,2.33894e+06,552,3.28457e+06,0


Converting to forward existential form...Done !
original formula: (AX(AG(!(A((i23.i0.i0.u262.p1085==1) U (i19.u6.p62==1))))) * AG(EF((i0.u4.p42==1))))
=> equivalent forward existential formula: ([((FwdU(EY(Init),TRUE) * !(EG(!((i19.u6.p62==1))))) * !(E(!((i19.u6.p62==1)) U (!((i23.i0.i0.u262.p1085==1)) * ...247
Reverse transition relation is NOT exact ! Due to transitions t0, t174, t304, t367, t369, t377, t569, t570, t588, t765, t776, t784, t804, t865, t1155, t115...1549
Detected timeout of ITS tools.
[2025-05-29 22:36:35] [INFO ] Applying decomposition
[2025-05-29 22:36:35] [INFO ] Flatten gal took : 58 ms
[2025-05-29 22:36:35] [INFO ] Decomposing Gal with order
[2025-05-29 22:36:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 22:36:35] [INFO ] Removed a total of 4715 redundant transitions.
[2025-05-29 22:36:35] [INFO ] Flatten gal took : 80 ms
[2025-05-29 22:36:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 435 labels/synchronizations in 15 ms.
[2025-05-29 22:36:35] [INFO ] Time to serialize gal into /tmp/CTLFireability17361510183127683447.gal : 4 ms
[2025-05-29 22:36:35] [INFO ] Time to serialize properties into /tmp/CTLFireability10170444086642322566.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/CTLFireability17361510183127683447.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10170444086642322566.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 8 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.80547e+19,2.89871,88444,1218,8011,24636,173100,764,83379,1428,931084,0


Converting to forward existential form...Done !
original formula: (AX(AG(!(A((i0.i0.i1.u24.p1085==1) U (i0.i0.i0.i0.i0.i0.u8.p62==1))))) * AG(EF((i0.i0.i0.i0.i0.i0.u7.p42==1))))
=> equivalent forward existential formula: ([((FwdU(EY(Init),TRUE) * !(EG(!((i0.i0.i0.i0.i0.i0.u8.p62==1))))) * !(E(!((i0.i0.i0.i0.i0.i0.u8.p62==1)) U (!((...302
Reverse transition relation is NOT exact ! Due to transitions t849, t1204, u32.t2, u32.t3, i0.t1402, i0.t1389, i0.t1382, i0.i0.t175, i0.i0.i0.t366, i0.i0.i...2351

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CloudDeployment-PT-4b"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is CloudDeployment-PT-4b, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r044-tall-174854027700042"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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