Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r146-tall-177961074200514.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is GPUForwardProgress-PT-36b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074200514
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 644K
-rw-r--r-- 1 mcc users 7.6K Mar 7 11:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Mar 7 11:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Mar 7 11:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 7 11:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 10:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 10:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 10:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 7 11:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Mar 7 11:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Mar 7 11:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Mar 7 11:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 10:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 179K Mar 3 18:30 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 GPUForwardProgress-PT-36b-CTLFireability-2024-00
FORMULA_NAME GPUForwardProgress-PT-36b-CTLFireability-2024-01
FORMULA_NAME GPUForwardProgress-PT-36b-CTLFireability-2024-02
FORMULA_NAME GPUForwardProgress-PT-36b-CTLFireability-2024-03
FORMULA_NAME GPUForwardProgress-PT-36b-CTLFireability-2024-04
FORMULA_NAME GPUForwardProgress-PT-36b-CTLFireability-2024-05
FORMULA_NAME GPUForwardProgress-PT-36b-CTLFireability-2024-06
FORMULA_NAME GPUForwardProgress-PT-36b-CTLFireability-2024-07
FORMULA_NAME GPUForwardProgress-PT-36b-CTLFireability-2024-08
FORMULA_NAME GPUForwardProgress-PT-36b-CTLFireability-2024-09
FORMULA_NAME GPUForwardProgress-PT-36b-CTLFireability-2024-10
FORMULA_NAME GPUForwardProgress-PT-36b-CTLFireability-2024-11
FORMULA_NAME GPUForwardProgress-PT-36b-CTLFireability-2024-12
FORMULA_NAME GPUForwardProgress-PT-36b-CTLFireability-2024-13
FORMULA_NAME GPUForwardProgress-PT-36b-CTLFireability-2024-14
FORMULA_NAME GPUForwardProgress-PT-36b-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779733289071

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-36b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-25 18:21:30] [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]
[2026-05-25 18:21:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 18:21:30] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2026-05-25 18:21:30] [INFO ] Transformed 720 places.
[2026-05-25 18:21:30] [INFO ] Transformed 757 transitions.
[2026-05-25 18:21:30] [INFO ] Found NUPN structural information;
[2026-05-25 18:21:30] [INFO ] Parsed PT model containing 720 places and 757 transitions and 1877 arcs in 188 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Support contains 94 out of 720 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 720/720 places, 757/757 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 719 transition count 757
Discarding 67 places :
Symmetric choice reduction at 1 with 67 rule applications. Total rules 68 place count 652 transition count 690
Iterating global reduction 1 with 67 rules applied. Total rules applied 135 place count 652 transition count 690
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 157 place count 630 transition count 668
Iterating global reduction 1 with 22 rules applied. Total rules applied 179 place count 630 transition count 668
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 200 place count 630 transition count 647
Applied a total of 200 rules in 165 ms. Remains 630 /720 variables (removed 90) and now considering 647/757 (removed 110) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4774640961650992410.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17305421808709225496.kers'
[2026-05-25 18:21:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4774640961650992410.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17305421808709225496.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 647 rows 630 cols 1655 entries
Finished phase 1 with 592 SingleSign rule and 1 generalized
[2026-05-25 18:21:30] [INFO ] Computed 37 invariants in 3 ms
Computed 37 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-17305421808709225496.kers
Total runtime 4 ms.
[2026-05-25 18:21:31] [INFO ] Implicit Places using invariants in 375 ms returned []
[2026-05-25 18:21:31] [INFO ] Invariant cache hit.
[2026-05-25 18:21:31] [INFO ] Implicit Places using invariants and state equation in 461 ms returned []
Implicit Place search using SMT with State Equation took 869 ms to find 0 implicit places.
Running 646 sub problems to find dead transitions.
[2026-05-25 18:21:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/629 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 646 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/629 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 646 unsolved
At refinement iteration 2 (OVERLAPS) 647/1276 variables, 629/666 constraints. Problems are: Problem set: 0 solved, 646 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1276/1277 variables, and 666 constraints, problems are : Problem set: 0 solved, 646 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 629/630 constraints, PredecessorRefiner: 646/646 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 646 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/629 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 646 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/629 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 646 unsolved
At refinement iteration 2 (OVERLAPS) 647/1276 variables, 629/666 constraints. Problems are: Problem set: 0 solved, 646 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1276 variables, 646/1312 constraints. Problems are: Problem set: 0 solved, 646 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1276/1277 variables, and 1312 constraints, problems are : Problem set: 0 solved, 646 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 629/630 constraints, PredecessorRefiner: 646/646 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60275ms problems are : Problem set: 0 solved, 646 unsolved
Search for dead transitions found 0 dead transitions in 60290ms
Starting structural reductions in LTL mode, iteration 1 : 630/720 places, 647/757 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61359 ms. Remains : 630/720 places, 647/757 transitions.
Starting structural reductions in LTL mode, iteration 0 : 630/630 places, 647/647 transitions.
Applied a total of 0 rules in 11 ms. Remains 630 /630 variables (removed 0) and now considering 647/647 (removed 0) transitions.
[2026-05-25 18:22:31] [INFO ] Invariant cache hit.
[2026-05-25 18:22:32] [INFO ] Implicit Places using invariants in 236 ms returned []
[2026-05-25 18:22:32] [INFO ] Invariant cache hit.
[2026-05-25 18:22:32] [INFO ] Implicit Places using invariants and state equation in 422 ms returned []
Implicit Place search using SMT with State Equation took 660 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 672 ms. Remains : 630/630 places, 647/647 transitions.
Support contains 94 out of 630 places after structural reductions.
[2026-05-25 18:22:32] [INFO ] Flatten gal took : 70 ms
[2026-05-25 18:22:32] [INFO ] Flatten gal took : 42 ms
[2026-05-25 18:22:32] [INFO ] Input system was already deterministic with 647 transitions.
Support contains 92 out of 630 places (down from 94) after GAL structural reductions.
RANDOM walk for 40000 steps (129 resets) in 1563 ms. (25 steps per ms) remains 26/72 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 26/26 properties
[2026-05-25 18:22:33] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 591/629 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/629 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 647/1276 variables, 629/666 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1276 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 1/1277 variables, 1/667 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1277 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 0/1277 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1277/1277 variables, and 667 constraints, problems are : Problem set: 0 solved, 26 unsolved in 2026 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 630/630 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 591/629 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/629 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 647/1276 variables, 629/666 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1276 variables, 26/692 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1276 variables, 0/692 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (OVERLAPS) 1/1277 variables, 1/693 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1277 variables, 0/693 constraints. Problems are: Problem set: 0 solved, 26 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1277/1277 variables, and 693 constraints, problems are : Problem set: 0 solved, 26 unsolved in 5015 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 630/630 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7054ms problems are : Problem set: 0 solved, 26 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 38 out of 630 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 630/630 places, 647/647 transitions.
Graph (trivial) has 471 edges and 630 vertex of which 6 / 630 are part of one of the 1 SCC in 10 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 973 edges and 625 vertex of which 586 are kept as prefixes of interest. Removing 39 places using SCC suffix rule.2 ms
Discarding 39 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 263 transitions
Trivial Post-agglo rules discarded 263 transitions
Performed 263 trivial Post agglomeration. Transition count delta: 263
Iterating post reduction 0 with 263 rules applied. Total rules applied 265 place count 586 transition count 375
Reduce places removed 263 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 1 with 273 rules applied. Total rules applied 538 place count 323 transition count 365
Reduce places removed 5 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 2 with 19 rules applied. Total rules applied 557 place count 318 transition count 351
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 16 rules applied. Total rules applied 573 place count 304 transition count 349
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 574 place count 303 transition count 349
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 62 Pre rules applied. Total rules applied 574 place count 303 transition count 287
Deduced a syphon composed of 62 places in 1 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 5 with 124 rules applied. Total rules applied 698 place count 241 transition count 287
Discarding 34 places :
Symmetric choice reduction at 5 with 34 rule applications. Total rules 732 place count 207 transition count 253
Iterating global reduction 5 with 34 rules applied. Total rules applied 766 place count 207 transition count 253
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 0 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 5 with 186 rules applied. Total rules applied 952 place count 114 transition count 160
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 963 place count 103 transition count 138
Iterating global reduction 5 with 11 rules applied. Total rules applied 974 place count 103 transition count 138
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 988 place count 96 transition count 138
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 997 place count 96 transition count 129
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 1004 place count 96 transition count 129
Applied a total of 1004 rules in 92 ms. Remains 96 /630 variables (removed 534) and now considering 129/647 (removed 518) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 96/630 places, 129/647 transitions.
RANDOM walk for 40000 steps (1613 resets) in 884 ms. (45 steps per ms) remains 2/26 properties
BEST_FIRST walk for 40002 steps (248 resets) in 110 ms. (360 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (390 resets) in 101 ms. (392 steps per ms) remains 2/2 properties
[2026-05-25 18:22:41] [INFO ] Flow matrix only has 121 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16838832181097004332.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14798523218171726206.kers'
[2026-05-25 18:22:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16838832181097004332.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14798523218171726206.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 121 rows 96 cols 420 entries
Finished phase 1 with 96 SingleSign rule and 0 generalized
[2026-05-25 18:22:41] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14798523218171726206.kers
Total runtime 1 ms.
[2026-05-25 18:22:41] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 10/14 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 69/83 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 118/201 variables, 70/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 16/217 variables, 13/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/217 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/217 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 217/217 variables, and 97 constraints, problems are : Problem set: 0 solved, 2 unsolved in 80 ms.
Refiners :[State Equation: 96/96 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 10/14 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 69/83 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 118/201 variables, 70/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 16/217 variables, 13/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/217 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/217 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 217/217 variables, and 99 constraints, problems are : Problem set: 0 solved, 2 unsolved in 152 ms.
Refiners :[State Equation: 96/96 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 241ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 10 ms.
Support contains 2 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 129/129 transitions.
Graph (complete) has 268 edges and 96 vertex of which 95 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 95 transition count 111
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 33 place count 80 transition count 111
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 33 place count 80 transition count 92
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 71 place count 61 transition count 92
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 79 place count 53 transition count 80
Iterating global reduction 2 with 8 rules applied. Total rules applied 87 place count 53 transition count 80
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 91 place count 49 transition count 74
Iterating global reduction 2 with 4 rules applied. Total rules applied 95 place count 49 transition count 74
Performed 18 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 131 place count 31 transition count 50
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Graph (complete) has 62 edges and 31 vertex of which 8 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.0 ms
Discarding 23 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Iterating post reduction 2 with 17 rules applied. Total rules applied 148 place count 8 transition count 30
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 170 place count 8 transition count 8
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 171 place count 7 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 172 place count 6 transition count 7
Applied a total of 172 rules in 12 ms. Remains 6 /96 variables (removed 90) and now considering 7/129 (removed 122) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 6/96 places, 7/129 transitions.
RANDOM walk for 40000 steps (7073 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (4111 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
Probably explored full state space saw : 6 states, properties seen :0
Probabilistic random walk after 13 steps, saw 6 distinct states, run finished after 7 ms. (steps per millisecond=1 ) properties seen :0
Explored full state space saw : 6 states, properties seen :0
Exhaustive walk after 13 steps, saw 6 distinct states, run finished after 2 ms. (steps per millisecond=6 ) properties seen :0
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2026-05-25 18:22:41] [INFO ] Flatten gal took : 24 ms
[2026-05-25 18:22:41] [INFO ] Flatten gal took : 24 ms
[2026-05-25 18:22:41] [INFO ] Input system was already deterministic with 647 transitions.
Computed a total of 121 stabilizing places and 121 stable transitions
Graph (complete) has 980 edges and 630 vertex of which 590 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.15 ms
Starting structural reductions in LTL mode, iteration 0 : 630/630 places, 647/647 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 607 transition count 624
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 607 transition count 624
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 56 place count 607 transition count 614
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 63 place count 600 transition count 607
Iterating global reduction 1 with 7 rules applied. Total rules applied 70 place count 600 transition count 607
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 75 place count 600 transition count 602
Applied a total of 75 rules in 86 ms. Remains 600 /630 variables (removed 30) and now considering 602/647 (removed 45) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17372570881956272668.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7172747297952922196.kers'
[2026-05-25 18:22:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17372570881956272668.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7172747297952922196.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 602 rows 600 cols 1565 entries
Finished phase 1 with 562 SingleSign rule and 1 generalized
[2026-05-25 18:22:41] [INFO ] Computed 37 invariants in 3 ms
Computed 37 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-7172747297952922196.kers
Total runtime 6 ms.
[2026-05-25 18:22:41] [INFO ] Implicit Places using invariants in 150 ms returned []
[2026-05-25 18:22:41] [INFO ] Invariant cache hit.
[2026-05-25 18:22:42] [INFO ] Implicit Places using invariants and state equation in 450 ms returned []
Implicit Place search using SMT with State Equation took 604 ms to find 0 implicit places.
Running 601 sub problems to find dead transitions.
[2026-05-25 18:22:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/599 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/599 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (OVERLAPS) 602/1201 variables, 599/636 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1201/1202 variables, and 636 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 599/600 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 601 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/599 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/599 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (OVERLAPS) 602/1201 variables, 599/636 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1201 variables, 601/1237 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1201/1202 variables, and 1237 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 599/600 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60149ms problems are : Problem set: 0 solved, 601 unsolved
Search for dead transitions found 0 dead transitions in 60154ms
Starting structural reductions in LTL mode, iteration 1 : 600/630 places, 602/647 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60849 ms. Remains : 600/630 places, 602/647 transitions.
[2026-05-25 18:23:42] [INFO ] Flatten gal took : 19 ms
[2026-05-25 18:23:42] [INFO ] Flatten gal took : 19 ms
[2026-05-25 18:23:42] [INFO ] Input system was already deterministic with 602 transitions.
[2026-05-25 18:23:42] [INFO ] Flatten gal took : 17 ms
[2026-05-25 18:23:42] [INFO ] Flatten gal took : 16 ms
[2026-05-25 18:23:42] [INFO ] Time to serialize gal into /tmp/CTLFireability16856220477767545564.gal : 15 ms
[2026-05-25 18:23:42] [INFO ] Time to serialize properties into /tmp/CTLFireability15525622402935459399.ctl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16856220477767545564.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15525622402935459399.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-25 18:24:12] [INFO ] Flatten gal took : 17 ms
[2026-05-25 18:24:12] [INFO ] Applying decomposition
[2026-05-25 18:24:12] [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.202604301425/bin/convert-linux64' '-i' '/tmp/graph18102251645905709394.txt' '-o' '/tmp/graph18102251645905709394.bin' '-w' '/tmp/graph18102251645905709394.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph18102251645905709394.bin' '-l' '-1' '-v' '-w' '/tmp/graph18102251645905709394.weights' '-q' '0' '-e' '0.001'
[2026-05-25 18:24:12] [INFO ] Decomposing Gal with order
[2026-05-25 18:24:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 18:24:13] [INFO ] Removed a total of 187 redundant transitions.
[2026-05-25 18:24:13] [INFO ] Flatten gal took : 108 ms
[2026-05-25 18:24:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2026-05-25 18:24:13] [INFO ] Time to serialize gal into /tmp/CTLFireability1031755382641477476.gal : 9 ms
[2026-05-25 18:24:13] [INFO ] Time to serialize properties into /tmp/CTLFireability15338493416981650982.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1031755382641477476.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15338493416981650982.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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.49039e+44,0.883429,37424,2035,29,69271,330,821,80961,36,590,0


Converting to forward existential form...Done !
original formula: EX(AG(((i5.u34.p101==0)||(i36.u242.p673==0))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(((i5.u34.p101==0)||(i36.u242.p673==0))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t528, i1.i1.t384, i1.i1.i1.u84.t377, i2.t523, i2.t516, i3.t510, i3.u22.t503, i4.t496, i4.u27....1029
(forward)formula 0,0,1.73689,50728,1,0,70760,330,5547,117216,157,590,531921
FORMULA GPUForwardProgress-PT-36b-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 630/630 places, 647/647 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 609 transition count 626
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 609 transition count 626
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 50 place count 609 transition count 618
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 56 place count 603 transition count 612
Iterating global reduction 1 with 6 rules applied. Total rules applied 62 place count 603 transition count 612
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 66 place count 603 transition count 608
Applied a total of 66 rules in 53 ms. Remains 603 /630 variables (removed 27) and now considering 608/647 (removed 39) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7172071134762237738.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5013622011453445102.kers'
[2026-05-25 18:24:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7172071134762237738.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5013622011453445102.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 608 rows 603 cols 1577 entries
Finished phase 1 with 565 SingleSign rule and 1 generalized
[2026-05-25 18:24:14] [INFO ] Computed 37 invariants in 2 ms
Computed 37 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5013622011453445102.kers
Total runtime 3 ms.
[2026-05-25 18:24:15] [INFO ] Implicit Places using invariants in 151 ms returned []
[2026-05-25 18:24:15] [INFO ] Invariant cache hit.
[2026-05-25 18:24:15] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 508 ms to find 0 implicit places.
Running 607 sub problems to find dead transitions.
[2026-05-25 18:24:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 2 (OVERLAPS) 608/1210 variables, 602/639 constraints. Problems are: Problem set: 0 solved, 607 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1210/1211 variables, and 639 constraints, problems are : Problem set: 0 solved, 607 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 602/603 constraints, PredecessorRefiner: 607/607 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 607 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 2 (OVERLAPS) 608/1210 variables, 602/639 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1210 variables, 607/1246 constraints. Problems are: Problem set: 0 solved, 607 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1210/1211 variables, and 1246 constraints, problems are : Problem set: 0 solved, 607 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 602/603 constraints, PredecessorRefiner: 607/607 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60115ms problems are : Problem set: 0 solved, 607 unsolved
Search for dead transitions found 0 dead transitions in 60117ms
Starting structural reductions in LTL mode, iteration 1 : 603/630 places, 608/647 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60681 ms. Remains : 603/630 places, 608/647 transitions.
[2026-05-25 18:25:15] [INFO ] Flatten gal took : 12 ms
[2026-05-25 18:25:15] [INFO ] Flatten gal took : 12 ms
[2026-05-25 18:25:15] [INFO ] Input system was already deterministic with 608 transitions.
[2026-05-25 18:25:15] [INFO ] Flatten gal took : 12 ms
[2026-05-25 18:25:15] [INFO ] Flatten gal took : 10 ms
[2026-05-25 18:25:15] [INFO ] Time to serialize gal into /tmp/CTLFireability6435165139202992464.gal : 3 ms
[2026-05-25 18:25:15] [INFO ] Time to serialize properties into /tmp/CTLFireability5836089616052687005.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6435165139202992464.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5836089616052687005.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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.
[2026-05-25 18:25:45] [INFO ] Flatten gal took : 10 ms
[2026-05-25 18:25:45] [INFO ] Applying decomposition
[2026-05-25 18:25:45] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph17590670867240177215.txt' '-o' '/tmp/graph17590670867240177215.bin' '-w' '/tmp/graph17590670867240177215.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17590670867240177215.bin' '-l' '-1' '-v' '-w' '/tmp/graph17590670867240177215.weights' '-q' '0' '-e' '0.001'
[2026-05-25 18:25:45] [INFO ] Decomposing Gal with order
[2026-05-25 18:25:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 18:25:45] [INFO ] Removed a total of 185 redundant transitions.
[2026-05-25 18:25:45] [INFO ] Flatten gal took : 28 ms
[2026-05-25 18:25:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2026-05-25 18:25:45] [INFO ] Time to serialize gal into /tmp/CTLFireability9054258409765917972.gal : 5 ms
[2026-05-25 18:25:45] [INFO ] Time to serialize properties into /tmp/CTLFireability17669841151126900154.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9054258409765917972.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17669841151126900154.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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.8075e+44,0.50751,22656,1675,26,37882,307,819,49181,35,525,0


Converting to forward existential form...Done !
original formula: (A(((i24.i0.i0.u2.p5==1) + A(EX(E((i37.u251.p708==1) U (i19.u130.p357==1))) U ((((i6.u43.p118==1)||(((i26.u176.p480==1)&&(i37.u250.p701==...616
=> equivalent forward existential formula: (([((FwdU(Init,!(E(TRUE U ((!((E(!((((i28.u187.p510==1)&&(i37.u250.p701==1))&&(i37.u252.p716==1))) U (!((i18.u12...1883
Reverse transition relation is NOT exact ! Due to transitions t534, i0.t34, i0.u246.t27, i1.t529, i1.u16.t520, i3.t514, i3.t507, i4.t493, i4.u34.t500, i5.t...1035
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 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 630/630 places, 647/647 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 610 transition count 627
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 610 transition count 627
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 49 place count 610 transition count 618
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 56 place count 603 transition count 611
Iterating global reduction 1 with 7 rules applied. Total rules applied 63 place count 603 transition count 611
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 68 place count 603 transition count 606
Applied a total of 68 rules in 42 ms. Remains 603 /630 variables (removed 27) and now considering 606/647 (removed 41) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17059114093631061061.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5370696906227197275.kers'
[2026-05-25 18:26:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17059114093631061061.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5370696906227197275.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 606 rows 603 cols 1573 entries
Finished phase 1 with 565 SingleSign rule and 1 generalized
[2026-05-25 18:26:15] [INFO ] Computed 37 invariants in 2 ms
Computed 37 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5370696906227197275.kers
Total runtime 4 ms.
[2026-05-25 18:26:16] [INFO ] Implicit Places using invariants in 158 ms returned []
[2026-05-25 18:26:16] [INFO ] Invariant cache hit.
[2026-05-25 18:26:16] [INFO ] Implicit Places using invariants and state equation in 487 ms returned []
Implicit Place search using SMT with State Equation took 647 ms to find 0 implicit places.
Running 605 sub problems to find dead transitions.
[2026-05-25 18:26:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 2 (OVERLAPS) 606/1208 variables, 602/639 constraints. Problems are: Problem set: 0 solved, 605 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1208/1209 variables, and 639 constraints, problems are : Problem set: 0 solved, 605 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 602/603 constraints, PredecessorRefiner: 605/605 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 605 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 2 (OVERLAPS) 606/1208 variables, 602/639 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1208 variables, 605/1244 constraints. Problems are: Problem set: 0 solved, 605 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1208/1209 variables, and 1244 constraints, problems are : Problem set: 0 solved, 605 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 602/603 constraints, PredecessorRefiner: 605/605 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60120ms problems are : Problem set: 0 solved, 605 unsolved
Search for dead transitions found 0 dead transitions in 60122ms
Starting structural reductions in LTL mode, iteration 1 : 603/630 places, 606/647 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60815 ms. Remains : 603/630 places, 606/647 transitions.
[2026-05-25 18:27:16] [INFO ] Flatten gal took : 10 ms
[2026-05-25 18:27:16] [INFO ] Flatten gal took : 9 ms
[2026-05-25 18:27:16] [INFO ] Input system was already deterministic with 606 transitions.
[2026-05-25 18:27:16] [INFO ] Flatten gal took : 8 ms
[2026-05-25 18:27:16] [INFO ] Flatten gal took : 9 ms
[2026-05-25 18:27:16] [INFO ] Time to serialize gal into /tmp/CTLFireability1237121225346530909.gal : 3 ms
[2026-05-25 18:27:16] [INFO ] Time to serialize properties into /tmp/CTLFireability2702698736446369683.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1237121225346530909.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2702698736446369683.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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.
[2026-05-25 18:27:46] [INFO ] Flatten gal took : 9 ms
[2026-05-25 18:27:46] [INFO ] Applying decomposition
[2026-05-25 18:27:46] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph8860875742167115078.txt' '-o' '/tmp/graph8860875742167115078.bin' '-w' '/tmp/graph8860875742167115078.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8860875742167115078.bin' '-l' '-1' '-v' '-w' '/tmp/graph8860875742167115078.weights' '-q' '0' '-e' '0.001'
[2026-05-25 18:27:46] [INFO ] Decomposing Gal with order
[2026-05-25 18:27:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 18:27:47] [INFO ] Removed a total of 181 redundant transitions.
[2026-05-25 18:27:47] [INFO ] Flatten gal took : 38 ms
[2026-05-25 18:27:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2026-05-25 18:27:47] [INFO ] Time to serialize gal into /tmp/CTLFireability3597605650293376077.gal : 6 ms
[2026-05-25 18:27:47] [INFO ] Time to serialize properties into /tmp/CTLFireability18066047580436670250.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3597605650293376077.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18066047580436670250.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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.80803e+44,0.396724,20344,1736,29,33097,364,886,40642,36,701,0


Converting to forward existential form...Done !
original formula: AX(AF((EG((i11.i0.u81.p220==1)) * (EF(((i16.i0.u111.p324==1)||(i28.i0.u191.p525==0))) + ((i22.i0.u156.p431==1)&&(i18.i0.u126.p353==1)))))...156
=> equivalent forward existential formula: [FwdG(EY(Init),!((EG((i11.i0.u81.p220==1)) * (E(TRUE U ((i16.i0.u111.p324==1)||(i28.i0.u191.p525==0))) + ((i22.i...207
Reverse transition relation is NOT exact ! Due to transitions t532, i1.t527, i1.i2.t520, i2.t514, i2.i2.t507, i3.t500, i3.i1.u29.t493, i4.i0.t479, i4.i0.u3...1162
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 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 630/630 places, 647/647 transitions.
Graph (trivial) has 529 edges and 630 vertex of which 6 / 630 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 974 edges and 625 vertex of which 585 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.4 ms
Discarding 40 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 306 transitions
Trivial Post-agglo rules discarded 306 transitions
Performed 306 trivial Post agglomeration. Transition count delta: 306
Iterating post reduction 0 with 306 rules applied. Total rules applied 308 place count 584 transition count 331
Reduce places removed 306 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 329 rules applied. Total rules applied 637 place count 278 transition count 308
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 647 place count 269 transition count 307
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 648 place count 268 transition count 307
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 73 Pre rules applied. Total rules applied 648 place count 268 transition count 234
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 794 place count 195 transition count 234
Discarding 37 places :
Symmetric choice reduction at 4 with 37 rule applications. Total rules 831 place count 158 transition count 197
Iterating global reduction 4 with 37 rules applied. Total rules applied 868 place count 158 transition count 197
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 868 place count 158 transition count 196
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 870 place count 157 transition count 196
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 4 with 142 rules applied. Total rules applied 1012 place count 86 transition count 125
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1013 place count 86 transition count 125
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1014 place count 85 transition count 124
Applied a total of 1014 rules in 53 ms. Remains 85 /630 variables (removed 545) and now considering 124/647 (removed 523) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8768605657692667594.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1643980873123060845.kers'
[2026-05-25 18:28:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8768605657692667594.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1643980873123060845.kers]
Normalized transition count is 123 out of 124 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 123 rows 85 cols 322 entries
Finished phase 1 with 85 SingleSign rule and 0 generalized
[2026-05-25 18:28:17] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1643980873123060845.kers
Total runtime 0 ms.
[2026-05-25 18:28:17] [INFO ] Implicit Places using invariants in 48 ms returned []
[2026-05-25 18:28:17] [INFO ] Invariant cache hit.
[2026-05-25 18:28:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 18:28:17] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2026-05-25 18:28:17] [INFO ] Redundant transitions in 3 ms returned []
Running 89 sub problems to find dead transitions.
[2026-05-25 18:28:17] [INFO ] Invariant cache hit.
[2026-05-25 18:28:17] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 123/175 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (OVERLAPS) 33/208 variables, 33/85 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 1/209 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 0/209 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 86 constraints, problems are : Problem set: 0 solved, 89 unsolved in 2925 ms.
Refiners :[State Equation: 85/85 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 123/175 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 25/77 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 33/208 variables, 33/110 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 64/174 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 1/209 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (OVERLAPS) 0/209 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 175 constraints, problems are : Problem set: 0 solved, 89 unsolved in 3326 ms.
Refiners :[State Equation: 85/85 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6277ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 6277ms
Starting structural reductions in SI_CTL mode, iteration 1 : 85/630 places, 124/647 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6499 ms. Remains : 85/630 places, 124/647 transitions.
[2026-05-25 18:28:23] [INFO ] Flatten gal took : 3 ms
[2026-05-25 18:28:23] [INFO ] Flatten gal took : 2 ms
[2026-05-25 18:28:23] [INFO ] Input system was already deterministic with 124 transitions.
[2026-05-25 18:28:23] [INFO ] Flatten gal took : 2 ms
[2026-05-25 18:28:23] [INFO ] Flatten gal took : 2 ms
[2026-05-25 18:28:23] [INFO ] Time to serialize gal into /tmp/CTLFireability5686830103855983716.gal : 1 ms
[2026-05-25 18:28:23] [INFO ] Time to serialize properties into /tmp/CTLFireability2061675973440872011.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5686830103855983716.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2061675973440872011.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.87744e+19,4.09718,112740,2,10381,5,787683,6,0,463,410013,0


Converting to forward existential form...Done !
original formula: EF(((p152==0) * AG((AG((p561==1)) + E((p35==1) U (p254==1))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * (p152==0)) * !(E(TRUE U !((!(E(TRUE U !((p561==1)))) + E((p35==1) U (p254==1)))))))] != FAL...157
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t11, t12, t14, t16, t18, t21, t22, t25, t27, t29, t31, t33, t35, t37, t39, t41, t43, ...369
(forward)formula 0,0,23.1085,573176,1,0,329,4.09553e+06,274,146,3006,3.60592e+06,301
FORMULA GPUForwardProgress-PT-36b-CTLFireability-2024-03 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 : 630/630 places, 647/647 transitions.
Graph (trivial) has 532 edges and 630 vertex of which 6 / 630 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 974 edges and 625 vertex of which 585 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.2 ms
Discarding 40 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 304 transitions
Trivial Post-agglo rules discarded 304 transitions
Performed 304 trivial Post agglomeration. Transition count delta: 304
Iterating post reduction 0 with 304 rules applied. Total rules applied 306 place count 584 transition count 333
Reduce places removed 304 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 331 rules applied. Total rules applied 637 place count 280 transition count 306
Reduce places removed 11 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 13 rules applied. Total rules applied 650 place count 269 transition count 304
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 652 place count 267 transition count 304
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 74 Pre rules applied. Total rules applied 652 place count 267 transition count 230
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 4 with 148 rules applied. Total rules applied 800 place count 193 transition count 230
Discarding 37 places :
Symmetric choice reduction at 4 with 37 rule applications. Total rules 837 place count 156 transition count 193
Iterating global reduction 4 with 37 rules applied. Total rules applied 874 place count 156 transition count 193
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 874 place count 156 transition count 192
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 876 place count 155 transition count 192
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 1022 place count 82 transition count 119
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1023 place count 81 transition count 118
Applied a total of 1023 rules in 40 ms. Remains 81 /630 variables (removed 549) and now considering 118/647 (removed 529) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1113319355069297788.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5940021157483753560.kers'
[2026-05-25 18:28:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1113319355069297788.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5940021157483753560.kers]
Normalized transition count is 117 out of 118 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 117 rows 81 cols 305 entries
Finished phase 1 with 81 SingleSign rule and 0 generalized
[2026-05-25 18:28:46] [INFO ] Computed 0 invariants in 1 ms
Computed 0 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5940021157483753560.kers
Total runtime 3 ms.
[2026-05-25 18:28:46] [INFO ] Implicit Places using invariants in 39 ms returned []
[2026-05-25 18:28:47] [INFO ] Invariant cache hit.
[2026-05-25 18:28:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 18:28:47] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2026-05-25 18:28:47] [INFO ] Redundant transitions in 2 ms returned []
Running 81 sub problems to find dead transitions.
[2026-05-25 18:28:47] [INFO ] Invariant cache hit.
[2026-05-25 18:28:47] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 117/162 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (OVERLAPS) 36/198 variables, 36/81 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 1/199 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (OVERLAPS) 0/199 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 82 constraints, problems are : Problem set: 0 solved, 81 unsolved in 2454 ms.
Refiners :[State Equation: 81/81 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 117/162 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 9/54 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (OVERLAPS) 36/198 variables, 36/90 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 72/162 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (OVERLAPS) 1/199 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (OVERLAPS) 0/199 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 163 constraints, problems are : Problem set: 0 solved, 81 unsolved in 2838 ms.
Refiners :[State Equation: 81/81 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5306ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 5306ms
Starting structural reductions in SI_CTL mode, iteration 1 : 81/630 places, 118/647 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5480 ms. Remains : 81/630 places, 118/647 transitions.
[2026-05-25 18:28:52] [INFO ] Flatten gal took : 3 ms
[2026-05-25 18:28:52] [INFO ] Flatten gal took : 2 ms
[2026-05-25 18:28:52] [INFO ] Input system was already deterministic with 118 transitions.
[2026-05-25 18:28:52] [INFO ] Flatten gal took : 2 ms
[2026-05-25 18:28:52] [INFO ] Flatten gal took : 1 ms
[2026-05-25 18:28:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1551312693259070299.gal : 1 ms
[2026-05-25 18:28:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5089889571303804194.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1551312693259070299.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5089889571303804194.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 18 steps (0 resets) in 5 ms. (3 steps per ms) remains 0/1 properties
FORMULA GPUForwardProgress-PT-36b-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 630/630 places, 647/647 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 607 transition count 624
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 607 transition count 624
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 56 place count 607 transition count 614
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 63 place count 600 transition count 607
Iterating global reduction 1 with 7 rules applied. Total rules applied 70 place count 600 transition count 607
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 75 place count 600 transition count 602
Applied a total of 75 rules in 100 ms. Remains 600 /630 variables (removed 30) and now considering 602/647 (removed 45) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9583646895257509068.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3786267492839538743.kers'
[2026-05-25 18:28:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9583646895257509068.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3786267492839538743.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 602 rows 600 cols 1565 entries
Finished phase 1 with 562 SingleSign rule and 1 generalized
[2026-05-25 18:28:52] [INFO ] Computed 37 invariants in 2 ms
Computed 37 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3786267492839538743.kers
Total runtime 3 ms.
[2026-05-25 18:28:52] [INFO ] Implicit Places using invariants in 267 ms returned []
[2026-05-25 18:28:52] [INFO ] Invariant cache hit.
[2026-05-25 18:28:53] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 650 ms to find 0 implicit places.
Running 601 sub problems to find dead transitions.
[2026-05-25 18:28:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/599 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/599 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (OVERLAPS) 602/1201 variables, 599/636 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1201/1202 variables, and 636 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 599/600 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 601 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/599 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/599 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (OVERLAPS) 602/1201 variables, 599/636 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1201 variables, 601/1237 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1201/1202 variables, and 1237 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 599/600 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60130ms problems are : Problem set: 0 solved, 601 unsolved
Search for dead transitions found 0 dead transitions in 60131ms
Starting structural reductions in LTL mode, iteration 1 : 600/630 places, 602/647 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60888 ms. Remains : 600/630 places, 602/647 transitions.
[2026-05-25 18:29:53] [INFO ] Flatten gal took : 8 ms
[2026-05-25 18:29:53] [INFO ] Flatten gal took : 8 ms
[2026-05-25 18:29:53] [INFO ] Input system was already deterministic with 602 transitions.
[2026-05-25 18:29:53] [INFO ] Flatten gal took : 8 ms
[2026-05-25 18:29:53] [INFO ] Flatten gal took : 7 ms
[2026-05-25 18:29:53] [INFO ] Time to serialize gal into /tmp/CTLFireability12058361446781380528.gal : 3 ms
[2026-05-25 18:29:53] [INFO ] Time to serialize properties into /tmp/CTLFireability13891185654974918477.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12058361446781380528.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13891185654974918477.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 630/630 places, 647/647 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 609 transition count 626
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 609 transition count 626
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 51 place count 609 transition count 617
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 57 place count 603 transition count 611
Iterating global reduction 1 with 6 rules applied. Total rules applied 63 place count 603 transition count 611
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 68 place count 603 transition count 606
Applied a total of 68 rules in 41 ms. Remains 603 /630 variables (removed 27) and now considering 606/647 (removed 41) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4244489812507121587.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1191436182063884272.kers'
[2026-05-25 18:30:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4244489812507121587.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1191436182063884272.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 606 rows 603 cols 1573 entries
Finished phase 1 with 565 SingleSign rule and 1 generalized
[2026-05-25 18:30:53] [INFO ] Computed 37 invariants in 2 ms
Computed 37 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-1191436182063884272.kers
Total runtime 3 ms.
[2026-05-25 18:30:53] [INFO ] Implicit Places using invariants in 170 ms returned []
[2026-05-25 18:30:53] [INFO ] Invariant cache hit.
[2026-05-25 18:30:54] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 576 ms to find 0 implicit places.
Running 605 sub problems to find dead transitions.
[2026-05-25 18:30:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 2 (OVERLAPS) 606/1208 variables, 602/639 constraints. Problems are: Problem set: 0 solved, 605 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1208/1209 variables, and 639 constraints, problems are : Problem set: 0 solved, 605 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 602/603 constraints, PredecessorRefiner: 605/605 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 605 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 2 (OVERLAPS) 606/1208 variables, 602/639 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1208 variables, 605/1244 constraints. Problems are: Problem set: 0 solved, 605 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1208/1209 variables, and 1244 constraints, problems are : Problem set: 0 solved, 605 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 602/603 constraints, PredecessorRefiner: 605/605 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60116ms problems are : Problem set: 0 solved, 605 unsolved
Search for dead transitions found 0 dead transitions in 60119ms
Starting structural reductions in LTL mode, iteration 1 : 603/630 places, 606/647 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60739 ms. Remains : 603/630 places, 606/647 transitions.
[2026-05-25 18:31:54] [INFO ] Flatten gal took : 8 ms
[2026-05-25 18:31:54] [INFO ] Flatten gal took : 13 ms
[2026-05-25 18:31:54] [INFO ] Input system was already deterministic with 606 transitions.
[2026-05-25 18:31:54] [INFO ] Flatten gal took : 7 ms
[2026-05-25 18:31:54] [INFO ] Flatten gal took : 7 ms
[2026-05-25 18:31:54] [INFO ] Time to serialize gal into /tmp/CTLFireability6028984530929112096.gal : 4 ms
[2026-05-25 18:31:54] [INFO ] Time to serialize properties into /tmp/CTLFireability11448596685654579839.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6028984530929112096.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11448596685654579839.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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.
[2026-05-25 18:32:24] [INFO ] Flatten gal took : 6 ms
[2026-05-25 18:32:24] [INFO ] Applying decomposition
[2026-05-25 18:32:24] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph10105870763830506710.txt' '-o' '/tmp/graph10105870763830506710.bin' '-w' '/tmp/graph10105870763830506710.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10105870763830506710.bin' '-l' '-1' '-v' '-w' '/tmp/graph10105870763830506710.weights' '-q' '0' '-e' '0.001'
[2026-05-25 18:32:24] [INFO ] Decomposing Gal with order
[2026-05-25 18:32:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 18:32:24] [INFO ] Removed a total of 86 redundant transitions.
[2026-05-25 18:32:24] [INFO ] Flatten gal took : 20 ms
[2026-05-25 18:32:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2026-05-25 18:32:24] [INFO ] Time to serialize gal into /tmp/CTLFireability6326088498885007329.gal : 4 ms
[2026-05-25 18:32:24] [INFO ] Time to serialize properties into /tmp/CTLFireability9063259188757340952.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6326088498885007329.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9063259188757340952.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 630/630 places, 647/647 transitions.
Graph (trivial) has 534 edges and 630 vertex of which 6 / 630 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 974 edges and 625 vertex of which 586 are kept as prefixes of interest. Removing 39 places using SCC suffix rule.3 ms
Discarding 39 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 310 transitions
Trivial Post-agglo rules discarded 310 transitions
Performed 310 trivial Post agglomeration. Transition count delta: 310
Iterating post reduction 0 with 310 rules applied. Total rules applied 312 place count 585 transition count 328
Reduce places removed 310 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 337 rules applied. Total rules applied 649 place count 275 transition count 301
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 660 place count 264 transition count 301
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 74 Pre rules applied. Total rules applied 660 place count 264 transition count 227
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 808 place count 190 transition count 227
Discarding 37 places :
Symmetric choice reduction at 3 with 37 rule applications. Total rules 845 place count 153 transition count 190
Iterating global reduction 3 with 37 rules applied. Total rules applied 882 place count 153 transition count 190
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 882 place count 153 transition count 189
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 884 place count 152 transition count 189
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 3 with 146 rules applied. Total rules applied 1030 place count 79 transition count 116
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 1031 place count 79 transition count 116
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1032 place count 78 transition count 115
Applied a total of 1032 rules in 37 ms. Remains 78 /630 variables (removed 552) and now considering 115/647 (removed 532) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1745881389782088862.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8835297161923233794.kers'
[2026-05-25 18:32:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1745881389782088862.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8835297161923233794.kers]
Normalized transition count is 114 out of 115 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 114 rows 78 cols 298 entries
Finished phase 1 with 78 SingleSign rule and 0 generalized
[2026-05-25 18:32:54] [INFO ] Computed 0 invariants in 1 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8835297161923233794.kers
Total runtime 2 ms.
[2026-05-25 18:32:54] [INFO ] Implicit Places using invariants in 49 ms returned []
[2026-05-25 18:32:54] [INFO ] Invariant cache hit.
[2026-05-25 18:32:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 18:32:54] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
[2026-05-25 18:32:54] [INFO ] Redundant transitions in 3 ms returned []
Running 78 sub problems to find dead transitions.
[2026-05-25 18:32:54] [INFO ] Invariant cache hit.
[2026-05-25 18:32:54] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 114/156 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (OVERLAPS) 36/192 variables, 36/78 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (OVERLAPS) 1/193 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (OVERLAPS) 0/193 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 79 constraints, problems are : Problem set: 0 solved, 78 unsolved in 2343 ms.
Refiners :[State Equation: 78/78 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 114/156 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 6/48 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 36/192 variables, 36/84 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 72/156 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (OVERLAPS) 1/193 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (OVERLAPS) 0/193 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 157 constraints, problems are : Problem set: 0 solved, 78 unsolved in 3066 ms.
Refiners :[State Equation: 78/78 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5415ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 5417ms
Starting structural reductions in SI_CTL mode, iteration 1 : 78/630 places, 115/647 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5594 ms. Remains : 78/630 places, 115/647 transitions.
[2026-05-25 18:33:00] [INFO ] Flatten gal took : 4 ms
[2026-05-25 18:33:00] [INFO ] Flatten gal took : 1 ms
[2026-05-25 18:33:00] [INFO ] Input system was already deterministic with 115 transitions.
RANDOM walk for 394 steps (4 resets) in 13 ms. (28 steps per ms) remains 0/1 properties
FORMULA GPUForwardProgress-PT-36b-CTLFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-25 18:33:00] [INFO ] Flatten gal took : 4 ms
[2026-05-25 18:33:00] [INFO ] Flatten gal took : 2 ms
[2026-05-25 18:33:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4639384103435445445.gal : 1 ms
[2026-05-25 18:33:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2750474883106823761.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.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4639384103435445445.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2750474883106823761.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 630/630 places, 647/647 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 611 transition count 628
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 611 transition count 628
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 48 place count 611 transition count 618
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 52 place count 607 transition count 614
Iterating global reduction 1 with 4 rules applied. Total rules applied 56 place count 607 transition count 614
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 59 place count 607 transition count 611
Applied a total of 59 rules in 45 ms. Remains 607 /630 variables (removed 23) and now considering 611/647 (removed 36) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5118099295648588378.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18031612657043819391.kers'
[2026-05-25 18:33:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5118099295648588378.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18031612657043819391.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 611 rows 607 cols 1583 entries
Finished phase 1 with 569 SingleSign rule and 1 generalized
[2026-05-25 18:33:00] [INFO ] Computed 37 invariants in 2 ms
Computed 37 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-18031612657043819391.kers
Total runtime 5 ms.
[2026-05-25 18:33:00] [INFO ] Implicit Places using invariants in 157 ms returned []
[2026-05-25 18:33:00] [INFO ] Invariant cache hit.
[2026-05-25 18:33:01] [INFO ] Implicit Places using invariants and state equation in 460 ms returned []
Implicit Place search using SMT with State Equation took 620 ms to find 0 implicit places.
Running 610 sub problems to find dead transitions.
[2026-05-25 18:33:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/606 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/606 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 2 (OVERLAPS) 611/1217 variables, 606/643 constraints. Problems are: Problem set: 0 solved, 610 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1217/1218 variables, and 643 constraints, problems are : Problem set: 0 solved, 610 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 606/607 constraints, PredecessorRefiner: 610/610 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 610 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/606 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/606 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 2 (OVERLAPS) 611/1217 variables, 606/643 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1217 variables, 610/1253 constraints. Problems are: Problem set: 0 solved, 610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1217/1218 variables, and 1253 constraints, problems are : Problem set: 0 solved, 610 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 606/607 constraints, PredecessorRefiner: 610/610 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60145ms problems are : Problem set: 0 solved, 610 unsolved
Search for dead transitions found 0 dead transitions in 60148ms
Starting structural reductions in LTL mode, iteration 1 : 607/630 places, 611/647 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60818 ms. Remains : 607/630 places, 611/647 transitions.
[2026-05-25 18:34:01] [INFO ] Flatten gal took : 8 ms
[2026-05-25 18:34:01] [INFO ] Flatten gal took : 8 ms
[2026-05-25 18:34:01] [INFO ] Input system was already deterministic with 611 transitions.
[2026-05-25 18:34:01] [INFO ] Flatten gal took : 6 ms
[2026-05-25 18:34:01] [INFO ] Flatten gal took : 6 ms
[2026-05-25 18:34:01] [INFO ] Time to serialize gal into /tmp/CTLFireability13024637569232002645.gal : 2 ms
[2026-05-25 18:34:01] [INFO ] Time to serialize properties into /tmp/CTLFireability7226593769276494552.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13024637569232002645.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7226593769276494552.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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.
[2026-05-25 18:34:31] [INFO ] Flatten gal took : 11 ms
[2026-05-25 18:34:31] [INFO ] Applying decomposition
[2026-05-25 18:34:31] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph15358786290161287305.txt' '-o' '/tmp/graph15358786290161287305.bin' '-w' '/tmp/graph15358786290161287305.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15358786290161287305.bin' '-l' '-1' '-v' '-w' '/tmp/graph15358786290161287305.weights' '-q' '0' '-e' '0.001'
[2026-05-25 18:34:31] [INFO ] Decomposing Gal with order
[2026-05-25 18:34:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 18:34:31] [INFO ] Removed a total of 195 redundant transitions.
[2026-05-25 18:34:31] [INFO ] Flatten gal took : 48 ms
[2026-05-25 18:34:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2026-05-25 18:34:31] [INFO ] Time to serialize gal into /tmp/CTLFireability13148207456985441593.gal : 4 ms
[2026-05-25 18:34:31] [INFO ] Time to serialize properties into /tmp/CTLFireability1127841854926986825.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13148207456985441593.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1127841854926986825.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.04056e+44,1.0707,37908,2434,29,68893,309,834,80334,35,537,0


Converting to forward existential form...Done !
original formula: AF(((i28.u201.p523==1) * (A(((i20.u141.p375==1)||(i5.u32.p76==1)) U ((i19.u135.p356==1)&&(i6.u38.p101==1))) + EX((A((i1.u151.p405==1) U (...223
=> equivalent forward existential formula: [FwdG(Init,!(((i28.u201.p523==1) * (!((E(!(((i19.u135.p356==1)&&(i6.u38.p101==1))) U (!(((i20.u141.p375==1)||(i5...450
Reverse transition relation is NOT exact ! Due to transitions t537, i1.t252, i1.u155.t242, i2.i1.t434, i2.i1.i2.t427, i3.t532, i3.u17.t525, i4.t519, i4.t51...1016
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 630/630 places, 647/647 transitions.
Graph (trivial) has 520 edges and 630 vertex of which 6 / 630 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 974 edges and 625 vertex of which 585 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.6 ms
Discarding 40 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 294 transitions
Trivial Post-agglo rules discarded 294 transitions
Performed 294 trivial Post agglomeration. Transition count delta: 294
Iterating post reduction 0 with 294 rules applied. Total rules applied 296 place count 584 transition count 343
Reduce places removed 294 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 319 rules applied. Total rules applied 615 place count 290 transition count 318
Reduce places removed 11 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 16 rules applied. Total rules applied 631 place count 279 transition count 313
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 636 place count 274 transition count 313
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 71 Pre rules applied. Total rules applied 636 place count 274 transition count 242
Deduced a syphon composed of 71 places in 1 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 4 with 142 rules applied. Total rules applied 778 place count 203 transition count 242
Discarding 37 places :
Symmetric choice reduction at 4 with 37 rule applications. Total rules 815 place count 166 transition count 205
Iterating global reduction 4 with 37 rules applied. Total rules applied 852 place count 166 transition count 205
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 852 place count 166 transition count 204
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 854 place count 165 transition count 204
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 1000 place count 92 transition count 131
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1001 place count 91 transition count 130
Applied a total of 1001 rules in 42 ms. Remains 91 /630 variables (removed 539) and now considering 130/647 (removed 517) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-585246587764925475.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13424114727555934130.kers'
[2026-05-25 18:35:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-585246587764925475.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13424114727555934130.kers]
Normalized transition count is 129 out of 130 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 129 rows 91 cols 329 entries
Finished phase 1 with 91 SingleSign rule and 0 generalized
[2026-05-25 18:35:01] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13424114727555934130.kers
Total runtime 1 ms.
[2026-05-25 18:35:01] [INFO ] Implicit Places using invariants in 48 ms returned []
[2026-05-25 18:35:01] [INFO ] Invariant cache hit.
[2026-05-25 18:35:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 18:35:01] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2026-05-25 18:35:01] [INFO ] Redundant transitions in 2 ms returned []
Running 93 sub problems to find dead transitions.
[2026-05-25 18:35:01] [INFO ] Invariant cache hit.
[2026-05-25 18:35:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (OVERLAPS) 129/184 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 36/220 variables, 36/91 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (OVERLAPS) 1/221 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (OVERLAPS) 0/221 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 221/221 variables, and 92 constraints, problems are : Problem set: 0 solved, 93 unsolved in 3172 ms.
Refiners :[State Equation: 91/91 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (OVERLAPS) 129/184 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 21/76 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (OVERLAPS) 36/220 variables, 36/112 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 72/184 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (OVERLAPS) 1/221 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 9 (OVERLAPS) 0/221 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 221/221 variables, and 185 constraints, problems are : Problem set: 0 solved, 93 unsolved in 3462 ms.
Refiners :[State Equation: 91/91 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6639ms problems are : Problem set: 0 solved, 93 unsolved
Search for dead transitions found 0 dead transitions in 6639ms
Starting structural reductions in SI_CTL mode, iteration 1 : 91/630 places, 130/647 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6809 ms. Remains : 91/630 places, 130/647 transitions.
[2026-05-25 18:35:08] [INFO ] Flatten gal took : 5 ms
[2026-05-25 18:35:08] [INFO ] Flatten gal took : 2 ms
[2026-05-25 18:35:08] [INFO ] Input system was already deterministic with 130 transitions.
[2026-05-25 18:35:08] [INFO ] Flatten gal took : 1 ms
[2026-05-25 18:35:08] [INFO ] Flatten gal took : 2 ms
[2026-05-25 18:35:08] [INFO ] Time to serialize gal into /tmp/CTLFireability5369724432033238174.gal : 1 ms
[2026-05-25 18:35:08] [INFO ] Time to serialize properties into /tmp/CTLFireability3885885229669133772.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5369724432033238174.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3885885229669133772.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,2.59271e+20,4.26545,101408,2,12420,5,614450,6,0,494,426733,0


Converting to forward existential form...Done !
original formula: E(!(((p224!=1) * (!(EF(((p405==1)||(p80==1)))) + !(E(((p412==1)||(p45==1)) U (p38!=1)))))) U (p175==1))
=> equivalent forward existential formula: [(FwdU(Init,!(((p224!=1) * (!(E(TRUE U ((p405==1)||(p80==1)))) + !(E(((p412==1)||(p45==1)) U (p38!=1))))))) * (p...173
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t13, t19, t21, t24, t26, t28, t30, t32, t34, t37, t39, t42, t44, t46, t48, t50, t52, ...359
Detected timeout of ITS tools.
[2026-05-25 18:35:38] [INFO ] Flatten gal took : 4 ms
[2026-05-25 18:35:38] [INFO ] Applying decomposition
[2026-05-25 18:35:38] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph14749574032595141061.txt' '-o' '/tmp/graph14749574032595141061.bin' '-w' '/tmp/graph14749574032595141061.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14749574032595141061.bin' '-l' '-1' '-v' '-w' '/tmp/graph14749574032595141061.weights' '-q' '0' '-e' '0.001'
[2026-05-25 18:35:38] [INFO ] Decomposing Gal with order
[2026-05-25 18:35:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 18:35:38] [INFO ] Removed a total of 71 redundant transitions.
[2026-05-25 18:35:38] [INFO ] Flatten gal took : 5 ms
[2026-05-25 18:35:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 3 ms.
[2026-05-25 18:35:38] [INFO ] Time to serialize gal into /tmp/CTLFireability4740077116246073111.gal : 1 ms
[2026-05-25 18:35:38] [INFO ] Time to serialize properties into /tmp/CTLFireability9107158165938554495.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4740077116246073111.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9107158165938554495.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.59271e+20,2.64406,90708,958,290,181176,5381,275,402654,43,47939,0


Converting to forward existential form...Done !
original formula: E(!(((u12.p224!=1) * (!(EF(((i17.u22.p405==1)||(u4.p80==1)))) + !(E(((i17.u23.p412==1)||(i0.u2.p45==1)) U (i0.u0.p38!=1)))))) U (u9.p175=...159
=> equivalent forward existential formula: [(FwdU(Init,!(((u12.p224!=1) * (!(E(TRUE U ((i17.u22.p405==1)||(u4.p80==1)))) + !(E(((i17.u23.p412==1)||(i0.u2.p...211
Reverse transition relation is NOT exact ! Due to transitions t5, t13, t19, t21, t26, t28, t30, t32, t34, t37, t39, t42, t44, t46, t50, t54, t58, t60, t64,...402
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 630/630 places, 647/647 transitions.
Graph (trivial) has 527 edges and 630 vertex of which 6 / 630 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 974 edges and 625 vertex of which 585 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.2 ms
Discarding 40 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 302 transitions
Trivial Post-agglo rules discarded 302 transitions
Performed 302 trivial Post agglomeration. Transition count delta: 302
Iterating post reduction 0 with 302 rules applied. Total rules applied 304 place count 584 transition count 335
Reduce places removed 302 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 327 rules applied. Total rules applied 631 place count 282 transition count 310
Reduce places removed 10 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 12 rules applied. Total rules applied 643 place count 272 transition count 308
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 645 place count 270 transition count 308
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 74 Pre rules applied. Total rules applied 645 place count 270 transition count 234
Deduced a syphon composed of 74 places in 1 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 4 with 148 rules applied. Total rules applied 793 place count 196 transition count 234
Discarding 38 places :
Symmetric choice reduction at 4 with 38 rule applications. Total rules 831 place count 158 transition count 196
Iterating global reduction 4 with 38 rules applied. Total rules applied 869 place count 158 transition count 196
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 869 place count 158 transition count 195
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 871 place count 157 transition count 195
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 4 with 140 rules applied. Total rules applied 1011 place count 87 transition count 125
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 1013 place count 87 transition count 125
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1014 place count 86 transition count 124
Applied a total of 1014 rules in 48 ms. Remains 86 /630 variables (removed 544) and now considering 124/647 (removed 523) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9999325210279864605.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15369670934084469514.kers'
[2026-05-25 18:36:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9999325210279864605.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15369670934084469514.kers]
Normalized transition count is 123 out of 124 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 123 rows 86 cols 346 entries
Finished phase 1 with 86 SingleSign rule and 0 generalized
[2026-05-25 18:36:08] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15369670934084469514.kers
Total runtime 1 ms.
[2026-05-25 18:36:08] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-05-25 18:36:08] [INFO ] Invariant cache hit.
[2026-05-25 18:36:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-25 18:36:08] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2026-05-25 18:36:08] [INFO ] Redundant transitions in 3 ms returned []
Running 113 sub problems to find dead transitions.
[2026-05-25 18:36:08] [INFO ] Invariant cache hit.
[2026-05-25 18:36:08] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 123/200 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (OVERLAPS) 9/209 variables, 9/87 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 1/210 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 0/210 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 88 constraints, problems are : Problem set: 0 solved, 113 unsolved in 3978 ms.
Refiners :[State Equation: 86/86 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 123/200 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 97/175 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (OVERLAPS) 9/209 variables, 9/184 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 16/200 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 1/210 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (OVERLAPS) 0/210 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 201 constraints, problems are : Problem set: 0 solved, 113 unsolved in 6864 ms.
Refiners :[State Equation: 86/86 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10855ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 10856ms
Starting structural reductions in SI_CTL mode, iteration 1 : 86/630 places, 124/647 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11040 ms. Remains : 86/630 places, 124/647 transitions.
[2026-05-25 18:36:19] [INFO ] Flatten gal took : 2 ms
[2026-05-25 18:36:19] [INFO ] Flatten gal took : 2 ms
[2026-05-25 18:36:19] [INFO ] Input system was already deterministic with 124 transitions.
[2026-05-25 18:36:19] [INFO ] Flatten gal took : 1 ms
[2026-05-25 18:36:19] [INFO ] Flatten gal took : 1 ms
[2026-05-25 18:36:19] [INFO ] Time to serialize gal into /tmp/CTLFireability336012947306411772.gal : 0 ms
[2026-05-25 18:36:19] [INFO ] Time to serialize properties into /tmp/CTLFireability1101868826115305570.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability336012947306411772.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1101868826115305570.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-25 18:36:49] [INFO ] Flatten gal took : 3 ms
[2026-05-25 18:36:49] [INFO ] Applying decomposition
[2026-05-25 18:36:49] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph1076159392265645830.txt' '-o' '/tmp/graph1076159392265645830.bin' '-w' '/tmp/graph1076159392265645830.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1076159392265645830.bin' '-l' '-1' '-v' '-w' '/tmp/graph1076159392265645830.weights' '-q' '0' '-e' '0.001'
[2026-05-25 18:36:49] [INFO ] Decomposing Gal with order
[2026-05-25 18:36:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 18:36:49] [INFO ] Removed a total of 69 redundant transitions.
[2026-05-25 18:36:49] [INFO ] Flatten gal took : 4 ms
[2026-05-25 18:36:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 7 labels/synchronizations in 1 ms.
[2026-05-25 18:36:49] [INFO ] Time to serialize gal into /tmp/CTLFireability3732294730888054890.gal : 2 ms
[2026-05-25 18:36:49] [INFO ] Time to serialize properties into /tmp/CTLFireability12769270727887321793.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3732294730888054890.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12769270727887321793.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 630/630 places, 647/647 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 610 transition count 627
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 610 transition count 627
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 48 place count 610 transition count 619
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 54 place count 604 transition count 613
Iterating global reduction 1 with 6 rules applied. Total rules applied 60 place count 604 transition count 613
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 64 place count 604 transition count 609
Applied a total of 64 rules in 44 ms. Remains 604 /630 variables (removed 26) and now considering 609/647 (removed 38) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5318574931734624665.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-365367474892197512.kers'
[2026-05-25 18:37:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5318574931734624665.kers, --Pflows, --basisKERS=/tmp/petrispot-output-365367474892197512.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 609 rows 604 cols 1579 entries
Finished phase 1 with 566 SingleSign rule and 1 generalized
[2026-05-25 18:37:19] [INFO ] Computed 37 invariants in 2 ms
Computed 37 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-365367474892197512.kers
Total runtime 4 ms.
[2026-05-25 18:37:19] [INFO ] Implicit Places using invariants in 157 ms returned []
[2026-05-25 18:37:20] [INFO ] Invariant cache hit.
[2026-05-25 18:37:20] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 577 ms to find 0 implicit places.
Running 608 sub problems to find dead transitions.
[2026-05-25 18:37:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/603 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/603 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 2 (OVERLAPS) 609/1212 variables, 603/640 constraints. Problems are: Problem set: 0 solved, 608 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1212/1213 variables, and 640 constraints, problems are : Problem set: 0 solved, 608 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 603/604 constraints, PredecessorRefiner: 608/608 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 608 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/603 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/603 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 2 (OVERLAPS) 609/1212 variables, 603/640 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1212 variables, 608/1248 constraints. Problems are: Problem set: 0 solved, 608 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1212/1213 variables, and 1248 constraints, problems are : Problem set: 0 solved, 608 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 603/604 constraints, PredecessorRefiner: 608/608 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60114ms problems are : Problem set: 0 solved, 608 unsolved
Search for dead transitions found 0 dead transitions in 60115ms
Starting structural reductions in LTL mode, iteration 1 : 604/630 places, 609/647 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60739 ms. Remains : 604/630 places, 609/647 transitions.
[2026-05-25 18:38:20] [INFO ] Flatten gal took : 7 ms
[2026-05-25 18:38:20] [INFO ] Flatten gal took : 7 ms
[2026-05-25 18:38:20] [INFO ] Input system was already deterministic with 609 transitions.
[2026-05-25 18:38:20] [INFO ] Flatten gal took : 6 ms
[2026-05-25 18:38:20] [INFO ] Flatten gal took : 6 ms
[2026-05-25 18:38:20] [INFO ] Time to serialize gal into /tmp/CTLFireability2183881540708801115.gal : 2 ms
[2026-05-25 18:38:20] [INFO ] Time to serialize properties into /tmp/CTLFireability1723674114609724626.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2183881540708801115.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1723674114609724626.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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.
[2026-05-25 18:38:50] [INFO ] Flatten gal took : 9 ms
[2026-05-25 18:38:50] [INFO ] Applying decomposition
[2026-05-25 18:38:50] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph2656173811379573153.txt' '-o' '/tmp/graph2656173811379573153.bin' '-w' '/tmp/graph2656173811379573153.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2656173811379573153.bin' '-l' '-1' '-v' '-w' '/tmp/graph2656173811379573153.weights' '-q' '0' '-e' '0.001'
[2026-05-25 18:38:50] [INFO ] Decomposing Gal with order
[2026-05-25 18:38:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 18:38:50] [INFO ] Removed a total of 190 redundant transitions.
[2026-05-25 18:38:50] [INFO ] Flatten gal took : 21 ms
[2026-05-25 18:38:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2026-05-25 18:38:50] [INFO ] Time to serialize gal into /tmp/CTLFireability2984278647540898865.gal : 5 ms
[2026-05-25 18:38:50] [INFO ] Time to serialize properties into /tmp/CTLFireability10942057635081653330.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2984278647540898865.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10942057635081653330.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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.9208e+44,0.415637,20872,1488,27,32809,330,908,40776,39,663,0


Converting to forward existential form...Done !
original formula: E(A(((E((i2.i0.u16.p35!=1) U AG((i29.i0.u205.p558==1))) + EF((i13.i1.u101.p266==1))) + ((i2.i0.u15.p32==1)||(i16.i0.u116.p317==1))) U AF(...449
=> equivalent forward existential formula: [(((FwdU(Init,!((E(!(!(EG(!(EG((i33.i1.u230.p630!=1)))))) U (!(((E((i2.i0.u16.p35!=1) U !(E(TRUE U !((i29.i0.u20...642
Reverse transition relation is NOT exact ! Due to transitions t535, i1.t530, i1.i1.t523, i2.t517, i2.i3.t510, i3.t503, i3.i2.t496, i4.i0.t482, i4.i0.u41.t4...1132
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 630/630 places, 647/647 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 611 transition count 628
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 611 transition count 628
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 47 place count 611 transition count 619
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 53 place count 605 transition count 613
Iterating global reduction 1 with 6 rules applied. Total rules applied 59 place count 605 transition count 613
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 63 place count 605 transition count 609
Applied a total of 63 rules in 59 ms. Remains 605 /630 variables (removed 25) and now considering 609/647 (removed 38) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14030682039143485119.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13684040401517625037.kers'
[2026-05-25 18:39:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14030682039143485119.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13684040401517625037.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 609 rows 605 cols 1579 entries
Finished phase 1 with 567 SingleSign rule and 1 generalized
[2026-05-25 18:39:20] [INFO ] Computed 37 invariants in 2 ms
Computed 37 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-13684040401517625037.kers
Total runtime 4 ms.
[2026-05-25 18:39:21] [INFO ] Implicit Places using invariants in 141 ms returned []
[2026-05-25 18:39:21] [INFO ] Invariant cache hit.
[2026-05-25 18:39:21] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 547 ms to find 0 implicit places.
Running 608 sub problems to find dead transitions.
[2026-05-25 18:39:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/604 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/604 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 2 (OVERLAPS) 609/1213 variables, 604/641 constraints. Problems are: Problem set: 0 solved, 608 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1213/1214 variables, and 641 constraints, problems are : Problem set: 0 solved, 608 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 604/605 constraints, PredecessorRefiner: 608/608 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 608 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/604 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/604 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 2 (OVERLAPS) 609/1213 variables, 604/641 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1213 variables, 608/1249 constraints. Problems are: Problem set: 0 solved, 608 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1213/1214 variables, and 1249 constraints, problems are : Problem set: 0 solved, 608 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 604/605 constraints, PredecessorRefiner: 608/608 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60122ms problems are : Problem set: 0 solved, 608 unsolved
Search for dead transitions found 0 dead transitions in 60124ms
Starting structural reductions in LTL mode, iteration 1 : 605/630 places, 609/647 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60732 ms. Remains : 605/630 places, 609/647 transitions.
[2026-05-25 18:40:21] [INFO ] Flatten gal took : 7 ms
[2026-05-25 18:40:21] [INFO ] Flatten gal took : 6 ms
[2026-05-25 18:40:21] [INFO ] Input system was already deterministic with 609 transitions.
[2026-05-25 18:40:21] [INFO ] Flatten gal took : 11 ms
[2026-05-25 18:40:21] [INFO ] Flatten gal took : 6 ms
[2026-05-25 18:40:21] [INFO ] Time to serialize gal into /tmp/CTLFireability17168305219216283854.gal : 2 ms
[2026-05-25 18:40:21] [INFO ] Time to serialize properties into /tmp/CTLFireability4199017875900820743.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17168305219216283854.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4199017875900820743.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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.
[2026-05-25 18:40:51] [INFO ] Flatten gal took : 9 ms
[2026-05-25 18:40:51] [INFO ] Applying decomposition
[2026-05-25 18:40:51] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph13159446696828767783.txt' '-o' '/tmp/graph13159446696828767783.bin' '-w' '/tmp/graph13159446696828767783.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13159446696828767783.bin' '-l' '-1' '-v' '-w' '/tmp/graph13159446696828767783.weights' '-q' '0' '-e' '0.001'
[2026-05-25 18:40:51] [INFO ] Decomposing Gal with order
[2026-05-25 18:40:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 18:40:51] [INFO ] Removed a total of 193 redundant transitions.
[2026-05-25 18:40:51] [INFO ] Flatten gal took : 20 ms
[2026-05-25 18:40:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2026-05-25 18:40:51] [INFO ] Time to serialize gal into /tmp/CTLFireability1215097128571427598.gal : 4 ms
[2026-05-25 18:40:51] [INFO ] Time to serialize properties into /tmp/CTLFireability14975306226241682397.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1215097128571427598.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14975306226241682397.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.04796e+44,0.695205,30936,1864,29,50721,366,824,69421,38,768,0


Converting to forward existential form...Done !
original formula: AG(((AG((i26.u177.p488==0)) + AX((((i14.u94.p264==0)||(i37.u253.p701==0))||(i37.u256.p716==0)))) + ((i3.u23.p58==0) + (E((i25.u171.p479==...221
=> equivalent forward existential formula: [(EY(((FwdU(Init,TRUE) * !(((i3.u23.p58==0) + (E((i25.u171.p479==1) U (i11.u77.p215==1)) * ((i7.u55.p154==0)||(i...293
Reverse transition relation is NOT exact ! Due to transitions t535, i1.t345, i1.u98.t338, i2.t530, i2.u16.t523, i3.t510, i3.u23.t518, i4.t488, i4.t481, i5....1014
(forward)formula 0,0,1.59147,52904,1,0,73482,366,5714,113625,176,768,575492
FORMULA GPUForwardProgress-PT-36b-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 630/630 places, 647/647 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 608 transition count 625
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 608 transition count 625
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 53 place count 608 transition count 616
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 60 place count 601 transition count 609
Iterating global reduction 1 with 7 rules applied. Total rules applied 67 place count 601 transition count 609
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 72 place count 601 transition count 604
Applied a total of 72 rules in 39 ms. Remains 601 /630 variables (removed 29) and now considering 604/647 (removed 43) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10165062228183549262.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16657563107226487484.kers'
[2026-05-25 18:40:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10165062228183549262.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16657563107226487484.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 604 rows 601 cols 1569 entries
Finished phase 1 with 563 SingleSign rule and 1 generalized
[2026-05-25 18:40:53] [INFO ] Computed 37 invariants in 2 ms
Computed 37 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16657563107226487484.kers
Total runtime 3 ms.
[2026-05-25 18:40:53] [INFO ] Implicit Places using invariants in 159 ms returned []
[2026-05-25 18:40:53] [INFO ] Invariant cache hit.
[2026-05-25 18:40:54] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 598 ms to find 0 implicit places.
Running 603 sub problems to find dead transitions.
[2026-05-25 18:40:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/600 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 2 (OVERLAPS) 604/1204 variables, 600/637 constraints. Problems are: Problem set: 0 solved, 603 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1204/1205 variables, and 637 constraints, problems are : Problem set: 0 solved, 603 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 600/601 constraints, PredecessorRefiner: 603/603 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 603 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/600 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 2 (OVERLAPS) 604/1204 variables, 600/637 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1204 variables, 603/1240 constraints. Problems are: Problem set: 0 solved, 603 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1204/1205 variables, and 1240 constraints, problems are : Problem set: 0 solved, 603 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 600/601 constraints, PredecessorRefiner: 603/603 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60107ms problems are : Problem set: 0 solved, 603 unsolved
Search for dead transitions found 0 dead transitions in 60112ms
Starting structural reductions in LTL mode, iteration 1 : 601/630 places, 604/647 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60752 ms. Remains : 601/630 places, 604/647 transitions.
[2026-05-25 18:41:54] [INFO ] Flatten gal took : 7 ms
[2026-05-25 18:41:54] [INFO ] Flatten gal took : 6 ms
[2026-05-25 18:41:54] [INFO ] Input system was already deterministic with 604 transitions.
[2026-05-25 18:41:54] [INFO ] Flatten gal took : 5 ms
[2026-05-25 18:41:54] [INFO ] Flatten gal took : 6 ms
[2026-05-25 18:41:54] [INFO ] Time to serialize gal into /tmp/CTLFireability11650937795096823602.gal : 2 ms
[2026-05-25 18:41:54] [INFO ] Time to serialize properties into /tmp/CTLFireability14187775965606802731.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11650937795096823602.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14187775965606802731.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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 : 630/630 places, 647/647 transitions.
Graph (trivial) has 533 edges and 630 vertex of which 6 / 630 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 974 edges and 625 vertex of which 585 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Discarding 40 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 307 transitions
Trivial Post-agglo rules discarded 307 transitions
Performed 307 trivial Post agglomeration. Transition count delta: 307
Iterating post reduction 0 with 307 rules applied. Total rules applied 309 place count 584 transition count 330
Reduce places removed 307 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 334 rules applied. Total rules applied 643 place count 277 transition count 303
Reduce places removed 11 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 13 rules applied. Total rules applied 656 place count 266 transition count 301
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 658 place count 264 transition count 301
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 74 Pre rules applied. Total rules applied 658 place count 264 transition count 227
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 4 with 148 rules applied. Total rules applied 806 place count 190 transition count 227
Discarding 37 places :
Symmetric choice reduction at 4 with 37 rule applications. Total rules 843 place count 153 transition count 190
Iterating global reduction 4 with 37 rules applied. Total rules applied 880 place count 153 transition count 190
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 880 place count 153 transition count 189
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 882 place count 152 transition count 189
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 1028 place count 79 transition count 116
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1029 place count 78 transition count 115
Applied a total of 1029 rules in 23 ms. Remains 78 /630 variables (removed 552) and now considering 115/647 (removed 532) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8127204022597119004.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7353254109966689566.kers'
[2026-05-25 18:42:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8127204022597119004.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7353254109966689566.kers]
Normalized transition count is 114 out of 115 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 114 rows 78 cols 299 entries
Finished phase 1 with 78 SingleSign rule and 0 generalized
[2026-05-25 18:42:54] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7353254109966689566.kers
Total runtime 1 ms.
[2026-05-25 18:42:54] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-25 18:42:54] [INFO ] Invariant cache hit.
[2026-05-25 18:42:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 18:42:54] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2026-05-25 18:42:54] [INFO ] Redundant transitions in 1 ms returned []
Running 78 sub problems to find dead transitions.
[2026-05-25 18:42:54] [INFO ] Invariant cache hit.
[2026-05-25 18:42:54] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 114/156 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (OVERLAPS) 36/192 variables, 36/78 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (OVERLAPS) 1/193 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (OVERLAPS) 0/193 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 79 constraints, problems are : Problem set: 0 solved, 78 unsolved in 2312 ms.
Refiners :[State Equation: 78/78 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 114/156 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 6/48 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 36/192 variables, 36/84 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 72/156 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (OVERLAPS) 1/193 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (OVERLAPS) 0/193 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 157 constraints, problems are : Problem set: 0 solved, 78 unsolved in 2355 ms.
Refiners :[State Equation: 78/78 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4672ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 4673ms
Starting structural reductions in SI_CTL mode, iteration 1 : 78/630 places, 115/647 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4858 ms. Remains : 78/630 places, 115/647 transitions.
[2026-05-25 18:42:59] [INFO ] Flatten gal took : 4 ms
[2026-05-25 18:42:59] [INFO ] Flatten gal took : 3 ms
[2026-05-25 18:42:59] [INFO ] Input system was already deterministic with 115 transitions.
RANDOM walk for 279 steps (3 resets) in 7 ms. (34 steps per ms) remains 0/1 properties
FORMULA GPUForwardProgress-PT-36b-CTLFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-25 18:42:59] [INFO ] Flatten gal took : 4 ms
[2026-05-25 18:42:59] [INFO ] Flatten gal took : 6 ms
[2026-05-25 18:42:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18202876969014125683.gal : 0 ms
[2026-05-25 18:42:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3590412925378840800.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.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality18202876969014125683.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3590412925378840800.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 630/630 places, 647/647 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 607 transition count 624
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 607 transition count 624
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 56 place count 607 transition count 614
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 63 place count 600 transition count 607
Iterating global reduction 1 with 7 rules applied. Total rules applied 70 place count 600 transition count 607
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 75 place count 600 transition count 602
Applied a total of 75 rules in 47 ms. Remains 600 /630 variables (removed 30) and now considering 602/647 (removed 45) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10107481318958908356.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9523295169678570801.kers'
[2026-05-25 18:42:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10107481318958908356.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9523295169678570801.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 602 rows 600 cols 1565 entries
Finished phase 1 with 562 SingleSign rule and 1 generalized
[2026-05-25 18:42:59] [INFO ] Computed 37 invariants in 2 ms
Computed 37 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9523295169678570801.kers
Total runtime 3 ms.
[2026-05-25 18:42:59] [INFO ] Implicit Places using invariants in 277 ms returned []
[2026-05-25 18:42:59] [INFO ] Invariant cache hit.
[2026-05-25 18:43:00] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 724 ms to find 0 implicit places.
Running 601 sub problems to find dead transitions.
[2026-05-25 18:43:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/599 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/599 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (OVERLAPS) 602/1201 variables, 599/636 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1201/1202 variables, and 636 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 599/600 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 601 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/599 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/599 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (OVERLAPS) 602/1201 variables, 599/636 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1201 variables, 601/1237 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1201/1202 variables, and 1237 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 599/600 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60117ms problems are : Problem set: 0 solved, 601 unsolved
Search for dead transitions found 0 dead transitions in 60119ms
Starting structural reductions in LTL mode, iteration 1 : 600/630 places, 602/647 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60894 ms. Remains : 600/630 places, 602/647 transitions.
[2026-05-25 18:44:00] [INFO ] Flatten gal took : 7 ms
[2026-05-25 18:44:00] [INFO ] Flatten gal took : 11 ms
[2026-05-25 18:44:00] [INFO ] Input system was already deterministic with 602 transitions.
[2026-05-25 18:44:00] [INFO ] Flatten gal took : 6 ms
[2026-05-25 18:44:00] [INFO ] Flatten gal took : 6 ms
[2026-05-25 18:44:00] [INFO ] Time to serialize gal into /tmp/CTLFireability2961520816624525653.gal : 2 ms
[2026-05-25 18:44:00] [INFO ] Time to serialize properties into /tmp/CTLFireability9725133820408978399.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2961520816624525653.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9725133820408978399.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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.
[2026-05-25 18:44:30] [INFO ] Flatten gal took : 7 ms
[2026-05-25 18:44:30] [INFO ] Applying decomposition
[2026-05-25 18:44:30] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph11220627239252121773.txt' '-o' '/tmp/graph11220627239252121773.bin' '-w' '/tmp/graph11220627239252121773.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11220627239252121773.bin' '-l' '-1' '-v' '-w' '/tmp/graph11220627239252121773.weights' '-q' '0' '-e' '0.001'
[2026-05-25 18:44:30] [INFO ] Decomposing Gal with order
[2026-05-25 18:44:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 18:44:30] [INFO ] Removed a total of 182 redundant transitions.
[2026-05-25 18:44:30] [INFO ] Flatten gal took : 14 ms
[2026-05-25 18:44:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-25 18:44:30] [INFO ] Time to serialize gal into /tmp/CTLFireability14348851465160769445.gal : 4 ms
[2026-05-25 18:44:30] [INFO ] Time to serialize properties into /tmp/CTLFireability12303424969711912911.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14348851465160769445.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12303424969711912911.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.49039e+44,0.476403,23144,2490,24,36660,296,796,48895,35,526,0


Converting to forward existential form...Done !
original formula: AX(((i2.u20.p44==0) * AG(EF((i9.u60.p180==1)))))
=> equivalent forward existential formula: ([(EY(Init) * !((i2.u20.p44==0)))] = FALSE * [(FwdU(EY(Init),TRUE) * !(E(TRUE U (i9.u60.p180==1))))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions t528, i0.t272, i0.u129.t265, i2.t523, i2.u17.t516, i3.t510, i3.u28.t503, i4.t496, i4.t489, i5...1062
(forward)formula 0,0,2.02231,76980,1,0,111534,296,6302,179225,161,586,807387
FORMULA GPUForwardProgress-PT-36b-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

[2026-05-25 18:44:32] [INFO ] Flatten gal took : 8 ms
[2026-05-25 18:44:32] [INFO ] Flatten gal took : 7 ms
[2026-05-25 18:44:32] [INFO ] Applying decomposition
[2026-05-25 18:44:32] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph10728085381858288459.txt' '-o' '/tmp/graph10728085381858288459.bin' '-w' '/tmp/graph10728085381858288459.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10728085381858288459.bin' '-l' '-1' '-v' '-w' '/tmp/graph10728085381858288459.weights' '-q' '0' '-e' '0.001'
[2026-05-25 18:44:32] [INFO ] Decomposing Gal with order
[2026-05-25 18:44:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 18:44:32] [INFO ] Removed a total of 178 redundant transitions.
[2026-05-25 18:44:32] [INFO ] Flatten gal took : 15 ms
[2026-05-25 18:44:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2026-05-25 18:44:32] [INFO ] Time to serialize gal into /tmp/CTLFireability5855217256555529887.gal : 4 ms
[2026-05-25 18:44:32] [INFO ] Time to serialize properties into /tmp/CTLFireability7806228849951755222.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5855217256555529887.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7806228849951755222.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 9 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.72865e+44,0.567245,24856,2316,25,42785,330,871,57896,39,634,0


Converting to forward existential form...Done !
original formula: (A(((i0.u2.p5==1) + A(EX(E((i37.u258.p708==1) U (i18.u133.p357==1))) U ((((i6.u45.p118==1)||(((i25.u177.p480==1)&&(i37.u256.p701==1))&&(i...608
=> equivalent forward existential formula: (([((FwdU(Init,!(E(TRUE U ((!((E(!((((i27.u188.p510==1)&&(i37.u256.p701==1))&&(i37.u260.p716==1))) U (!((i17.u12...1873
Reverse transition relation is NOT exact ! Due to transitions t4, t573, i1.i1.t446, i1.i1.i1.u73.t439, i2.t568, i2.t558, i3.t543, i3.u26.t553, i4.t536, i4....1050
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
(forward)formula 0,0,170.646,2199328,1,0,3.6285e+06,330,4817,4.45942e+06,128,864,2372662
FORMULA GPUForwardProgress-PT-36b-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AX(AF((EG((i11.u83.p220==1)) * (EF(((i16.u120.p324==1)||(i28.u194.p525==0))) + ((i22.u155.p431==1)&&(i18.u131.p353==1))))))
=> equivalent forward existential formula: [FwdG(EY(Init),!((EG((i11.u83.p220==1)) * (E(TRUE U ((i16.u120.p324==1)||(i28.u194.p525==0))) + ((i22.u155.p431=...192
(forward)formula 1,0,281.827,2423780,1,0,4.14737e+06,335,2019,4.73921e+06,81,893,2190164
FORMULA GPUForwardProgress-PT-36b-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF((EX(EG(((i5.u37.p108==0)&&(((i10.u78.p210==0)||(i37.u256.p701==0))||(i37.u260.p716==0))))) + (i31.u214.p584==1)))
=> equivalent forward existential formula: ([FwdG(EY(FwdU(Init,TRUE)),((i5.u37.p108==0)&&(((i10.u78.p210==0)||(i37.u256.p701==0))||(i37.u260.p716==0))))] !...215
(forward)formula 2,1,285.277,2423780,1,0,4.14737e+06,335,3075,4.73921e+06,103,893,2345575
FORMULA GPUForwardProgress-PT-36b-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AF(AX((((EF((i37.u259.p713==1)) + (i31.u217.p592==1)) + ((i16.u118.p322==1) + (((AG((i3.u24.p64==1)) * (i10.u78.p210==1)) * ((i37.u256.p7...346
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!((((E(TRUE U (i37.u259.p713==1)) + (i31.u217.p592==1)) + ((i16.u118.p322==1) + (((!(E(TRUE U ...421
(forward)formula 3,1,345.314,2668940,1,0,4.90938e+06,335,2063,4.7572e+06,89,893,582425
FORMULA GPUForwardProgress-PT-36b-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AF(((i28.u193.p523==1) * (A(((i19.u139.p375==1)||(i4.u32.p76==1)) U ((i18.u133.p356==1)&&(i5.u38.p101==1))) + EX((A((i21.u151.p405==1) U ...224
=> equivalent forward existential formula: [FwdG(Init,!(((i28.u193.p523==1) * (!((E(!(((i18.u133.p356==1)&&(i5.u38.p101==1))) U (!(((i19.u139.p375==1)||(i4...451
(forward)formula 4,0,523.835,2937480,1,0,5.17621e+06,335,2019,5.05108e+06,81,893,1563161
FORMULA GPUForwardProgress-PT-36b-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: E(!(((i11.u83.p224!=1) * (!(EF(((i21.u151.p405==1)||(i4.u32.p80==1)))) + !(E(((i21.u154.p412==1)||(i2.u20.p45==1)) U (i2.u17.p38!=1))))))...175
=> equivalent forward existential formula: [(FwdU(Init,!(((i11.u83.p224!=1) * (!(E(TRUE U ((i21.u151.p405==1)||(i4.u32.p80==1)))) + !(E(((i21.u154.p412==1)...227
(forward)formula 5,1,657.639,3231348,1,0,6.21273e+06,335,2020,5.47078e+06,82,893,502322
FORMULA GPUForwardProgress-PT-36b-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (AF((i0.u4.p11==0)) * (EG(!(E(EG((i11.u86.p232==1)) U !(AG((i2.u22.p50==1)))))) + EG((EF(EG((i7.u50.p133==0))) * EF((i31.u213.p579==1))))...157
=> equivalent forward existential formula: ([FwdG(Init,!((i0.u4.p11==0)))] = FALSE * [((Init * !(EG((E(TRUE U EG((i7.u50.p133==0))) * E(TRUE U (i31.u213.p5...251
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
(forward)formula 6,1,734.475,3234080,1,0,6.21273e+06,335,4366,5.47078e+06,136,893,3112163
FORMULA GPUForwardProgress-PT-36b-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: E(A(((E((i1.i0.i2.u15.p35!=1) U AG((i29.u205.p558==1))) + EF((i13.u98.p266==1))) + ((i1.i0.i2.u14.p32==1)||(i16.u114.p317==1))) U AF(EG((...418
=> equivalent forward existential formula: [(((FwdU(Init,!((E(!(!(EG(!(EG((i33.u226.p630!=1)))))) U (!(((E((i1.i0.i2.u15.p35!=1) U !(E(TRUE U !((i29.u205.p...605
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 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
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 a local SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found a local SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
(forward)formula 7,1,947.479,3560784,1,0,6.28781e+06,335,4221,6.65096e+06,127,893,4984088
FORMULA GPUForwardProgress-PT-36b-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG((EX((EF(((i1.i1.i0.u70.p191==1)&&(i1.i0.i1.u13.p30==1))) + A(AX((i1.i0.i2.u14.p33==1)) U (i16.u114.p309!=1)))) * EX(EF((i14.u104.p284=...162
=> equivalent forward existential formula: [FwdG(Init,(EX((E(TRUE U ((i1.i1.i0.u70.p191==1)&&(i1.i0.i1.u13.p30==1))) + !((E(!((i16.u114.p309!=1)) U (!(!(EX...288
(forward)formula 8,1,1064.01,3906664,1,0,6.80747e+06,335,2541,7.20563e+06,87,893,2982016
FORMULA GPUForwardProgress-PT-36b-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Total runtime 2448276 ms.

BK_STOP 1779735738551

--------------------
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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /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="GPUForwardProgress-PT-36b"
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-5973"
echo " Executing tool itstools"
echo " Input is GPUForwardProgress-PT-36b, 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 r146-tall-177961074200514"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/GPUForwardProgress-PT-36b.tgz
mv GPUForwardProgress-PT-36b 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 ;