fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r050-smll-177946901000082
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for Champagne-PT-H07T1U

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
14718.399 3600000.00 3801247.00 7926.30 T?F?T??FTFT?T?T? normal

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.r050-smll-177946901000082.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 Champagne-PT-H07T1U, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r050-smll-177946901000082
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 840K
-rw-r--r-- 1 mcc users 8.6K Mar 6 10:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Mar 6 10:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Mar 6 10:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Mar 6 10:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Mar 6 10:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 213K Mar 6 10:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Mar 6 10:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 123K Mar 6 10:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 208K 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 Champagne-PT-H07T1U-CTLFireability-2024-00
FORMULA_NAME Champagne-PT-H07T1U-CTLFireability-2024-01
FORMULA_NAME Champagne-PT-H07T1U-CTLFireability-2024-02
FORMULA_NAME Champagne-PT-H07T1U-CTLFireability-2024-03
FORMULA_NAME Champagne-PT-H07T1U-CTLFireability-2024-04
FORMULA_NAME Champagne-PT-H07T1U-CTLFireability-2024-05
FORMULA_NAME Champagne-PT-H07T1U-CTLFireability-2024-06
FORMULA_NAME Champagne-PT-H07T1U-CTLFireability-2024-07
FORMULA_NAME Champagne-PT-H07T1U-CTLFireability-2024-08
FORMULA_NAME Champagne-PT-H07T1U-CTLFireability-2024-09
FORMULA_NAME Champagne-PT-H07T1U-CTLFireability-2024-10
FORMULA_NAME Champagne-PT-H07T1U-CTLFireability-2024-11
FORMULA_NAME Champagne-PT-H07T1U-CTLFireability-2024-12
FORMULA_NAME Champagne-PT-H07T1U-CTLFireability-2024-13
FORMULA_NAME Champagne-PT-H07T1U-CTLFireability-2024-14
FORMULA_NAME Champagne-PT-H07T1U-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779501702143

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Champagne-PT-H07T1U
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-23 02:01:44] [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-23 02:01:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 02:01:44] [INFO ] Load time of PNML (sax parser for PT used): 244 ms
[2026-05-23 02:01:44] [INFO ] Transformed 701 places.
[2026-05-23 02:01:44] [INFO ] Transformed 931 transitions.
[2026-05-23 02:01:44] [INFO ] Found NUPN structural information;
[2026-05-23 02:01:45] [INFO ] Parsed PT model containing 701 places and 931 transitions and 2312 arcs in 505 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 27 ms.
Support contains 163 out of 701 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 701/701 places, 931/931 transitions.
Discarding 127 places :
Symmetric choice reduction at 0 with 127 rule applications. Total rules 127 place count 574 transition count 804
Iterating global reduction 0 with 127 rules applied. Total rules applied 254 place count 574 transition count 804
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 318 place count 510 transition count 740
Iterating global reduction 0 with 64 rules applied. Total rules applied 382 place count 510 transition count 740
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 408 place count 484 transition count 714
Iterating global reduction 0 with 26 rules applied. Total rules applied 434 place count 484 transition count 714
Applied a total of 434 rules in 291 ms. Remains 484 /701 variables (removed 217) and now considering 714/931 (removed 217) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6608014225320359422.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6395083115317781920.kers'
[2026-05-23 02:01:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6608014225320359422.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6395083115317781920.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 714 rows 484 cols 1878 entries
Finished phase 1 with 457 SingleSign rule and 0 generalized
[2026-05-23 02:01:45] [INFO ] Computed 27 invariants in 5 ms
Computed 27 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-6395083115317781920.kers
Total runtime 8 ms.
[2026-05-23 02:01:46] [INFO ] Implicit Places using invariants in 695 ms returned []
[2026-05-23 02:01:46] [INFO ] Invariant cache hit.
[2026-05-23 02:01:47] [INFO ] Implicit Places using invariants and state equation in 855 ms returned []
Implicit Place search using SMT with State Equation took 1618 ms to find 0 implicit places.
Running 713 sub problems to find dead transitions.
[2026-05-23 02:01:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/483 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 713 unsolved
At refinement iteration 1 (OVERLAPS) 1/484 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 713 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 484/1198 variables, and 27 constraints, problems are : Problem set: 0 solved, 713 unsolved in 30063 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/484 constraints, PredecessorRefiner: 713/713 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 713 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/483 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 713 unsolved
At refinement iteration 1 (OVERLAPS) 1/484 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 713 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 484/1198 variables, and 35 constraints, problems are : Problem set: 0 solved, 713 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/484 constraints, PredecessorRefiner: 0/713 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60584ms problems are : Problem set: 0 solved, 713 unsolved
Search for dead transitions found 0 dead transitions in 60627ms
Starting structural reductions in LTL mode, iteration 1 : 484/701 places, 714/931 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62638 ms. Remains : 484/701 places, 714/931 transitions.
Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 714/714 transitions.
Applied a total of 0 rules in 13 ms. Remains 484 /484 variables (removed 0) and now considering 714/714 (removed 0) transitions.
[2026-05-23 02:02:47] [INFO ] Invariant cache hit.
[2026-05-23 02:02:48] [INFO ] Implicit Places using invariants in 212 ms returned []
[2026-05-23 02:02:48] [INFO ] Invariant cache hit.
[2026-05-23 02:02:48] [INFO ] Implicit Places using invariants and state equation in 637 ms returned []
Implicit Place search using SMT with State Equation took 851 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 865 ms. Remains : 484/484 places, 714/714 transitions.
Support contains 163 out of 484 places after structural reductions.
[2026-05-23 02:02:49] [INFO ] Flatten gal took : 173 ms
[2026-05-23 02:02:49] [INFO ] Flatten gal took : 87 ms
[2026-05-23 02:02:49] [INFO ] Input system was already deterministic with 714 transitions.
Reduction of identical properties reduced properties to check from 102 to 101
RANDOM walk for 40000 steps (85 resets) in 3383 ms. (11 steps per ms) remains 8/101 properties
BEST_FIRST walk for 40002 steps (8 resets) in 175 ms. (227 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 100 ms. (396 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 2/6 properties
[2026-05-23 02:02:51] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 111/117 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 367/484 variables, 21/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/484 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 714/1198 variables, 484/511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1198 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/1198 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1198/1198 variables, and 511 constraints, problems are : Problem set: 0 solved, 2 unsolved in 652 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 484/484 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 111/117 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 367/484 variables, 21/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/484 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 714/1198 variables, 484/511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1198 variables, 2/513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1198 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1198 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1198/1198 variables, and 513 constraints, problems are : Problem set: 0 solved, 2 unsolved in 978 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 484/484 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1643ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 11447 steps, including 73 resets, run visited all 2 properties in 83 ms. (steps per millisecond=137 )
Parikh walk visited 2 properties in 94 ms.
[2026-05-23 02:02:52] [INFO ] Flatten gal took : 61 ms
[2026-05-23 02:02:52] [INFO ] Flatten gal took : 56 ms
[2026-05-23 02:02:53] [INFO ] Input system was already deterministic with 714 transitions.
Computed a total of 53 stabilizing places and 53 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 714/714 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 436 transition count 666
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 436 transition count 666
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 120 place count 412 transition count 642
Iterating global reduction 0 with 24 rules applied. Total rules applied 144 place count 412 transition count 642
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 158 place count 398 transition count 628
Iterating global reduction 0 with 14 rules applied. Total rules applied 172 place count 398 transition count 628
Applied a total of 172 rules in 82 ms. Remains 398 /484 variables (removed 86) and now considering 628/714 (removed 86) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3309005545411200406.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16211018968742694984.kers'
[2026-05-23 02:02:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3309005545411200406.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16211018968742694984.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 628 rows 398 cols 1706 entries
Finished phase 1 with 371 SingleSign rule and 0 generalized
[2026-05-23 02:02:53] [INFO ] Computed 27 invariants in 5 ms
Computed 27 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-16211018968742694984.kers
Total runtime 7 ms.
[2026-05-23 02:02:53] [INFO ] Implicit Places using invariants in 277 ms returned []
[2026-05-23 02:02:53] [INFO ] Invariant cache hit.
[2026-05-23 02:02:54] [INFO ] Implicit Places using invariants and state equation in 638 ms returned []
Implicit Place search using SMT with State Equation took 924 ms to find 0 implicit places.
Running 627 sub problems to find dead transitions.
[2026-05-23 02:02:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/397 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 1 (OVERLAPS) 1/398 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/398 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 627 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 398/1026 variables, and 29 constraints, problems are : Problem set: 0 solved, 627 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/398 constraints, PredecessorRefiner: 627/627 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 627 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/397 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 1 (OVERLAPS) 1/398 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/398 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/398 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 4 (OVERLAPS) 628/1026 variables, 398/427 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1026 variables, 627/1054 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1026 variables, 2/1056 constraints. Problems are: Problem set: 0 solved, 627 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1026/1026 variables, and 1056 constraints, problems are : Problem set: 0 solved, 627 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 398/398 constraints, PredecessorRefiner: 627/627 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60246ms problems are : Problem set: 0 solved, 627 unsolved
Search for dead transitions found 0 dead transitions in 60253ms
Starting structural reductions in LTL mode, iteration 1 : 398/484 places, 628/714 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61264 ms. Remains : 398/484 places, 628/714 transitions.
[2026-05-23 02:03:54] [INFO ] Flatten gal took : 26 ms
[2026-05-23 02:03:54] [INFO ] Flatten gal took : 26 ms
[2026-05-23 02:03:54] [INFO ] Input system was already deterministic with 628 transitions.
[2026-05-23 02:03:54] [INFO ] Flatten gal took : 23 ms
[2026-05-23 02:03:54] [INFO ] Flatten gal took : 22 ms
[2026-05-23 02:03:54] [INFO ] Time to serialize gal into /tmp/CTLFireability13194743767435508291.gal : 17 ms
[2026-05-23 02:03:54] [INFO ] Time to serialize properties into /tmp/CTLFireability13609193160210484108.ctl : 8 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/CTLFireability13194743767435508291.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13609193160210484108.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-23 02:04:24] [INFO ] Flatten gal took : 21 ms
[2026-05-23 02:04:24] [INFO ] Applying decomposition
[2026-05-23 02:04:24] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph15178199587798711065.txt' '-o' '/tmp/graph15178199587798711065.bin' '-w' '/tmp/graph15178199587798711065.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15178199587798711065.bin' '-l' '-1' '-v' '-w' '/tmp/graph15178199587798711065.weights' '-q' '0' '-e' '0.001'
[2026-05-23 02:04:24] [INFO ] Decomposing Gal with order
[2026-05-23 02:04:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 02:04:25] [INFO ] Removed a total of 471 redundant transitions.
[2026-05-23 02:04:25] [INFO ] Flatten gal took : 204 ms
[2026-05-23 02:04:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 29 ms.
[2026-05-23 02:04:25] [INFO ] Time to serialize gal into /tmp/CTLFireability11004905425287024110.gal : 25 ms
[2026-05-23 02:04:25] [INFO ] Time to serialize properties into /tmp/CTLFireability15072913265272584893.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11004905425287024110.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15072913265272584893.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,5.39698e+30,0.354231,13256,2008,21,17850,688,989,18223,64,1655,0


Converting to forward existential form...Done !
original formula: (EF((AF(((((i18.i0.u97.p449==1)||(i5.i0.u29.p114==1)) + AF((i0.i2.u71.p315==1))) * (((i20.i1.u105.p517==0)||(i23.u120.p578==0))||(((i4.i1...1221
=> equivalent forward existential formula: ((([((FwdU(Init,TRUE) * !(EG(!(((((i18.i0.u97.p449==1)||(i5.i0.u29.p114==1)) + !(EG(!((i0.i2.u71.p315==1))))) * ...3448
Reverse transition relation is NOT exact ! Due to transitions t6, t37, t66, t81, t110, t143, t173, t236, t314, t397, i1.i1.t419, i2.i1.t403, i3.i0.t384, i3...623
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 714/714 transitions.
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 58 place count 426 transition count 656
Iterating global reduction 0 with 58 rules applied. Total rules applied 116 place count 426 transition count 656
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 149 place count 393 transition count 623
Iterating global reduction 0 with 33 rules applied. Total rules applied 182 place count 393 transition count 623
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 198 place count 377 transition count 607
Iterating global reduction 0 with 16 rules applied. Total rules applied 214 place count 377 transition count 607
Applied a total of 214 rules in 60 ms. Remains 377 /484 variables (removed 107) and now considering 607/714 (removed 107) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8439172726300826983.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1347349170189943825.kers'
[2026-05-23 02:04:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8439172726300826983.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1347349170189943825.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 607 rows 377 cols 1664 entries
Finished phase 1 with 350 SingleSign rule and 0 generalized
[2026-05-23 02:04:55] [INFO ] Computed 27 invariants in 6 ms
Computed 27 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-1347349170189943825.kers
Total runtime 8 ms.
[2026-05-23 02:04:55] [INFO ] Implicit Places using invariants in 265 ms returned []
[2026-05-23 02:04:55] [INFO ] Invariant cache hit.
[2026-05-23 02:04:56] [INFO ] Implicit Places using invariants and state equation in 475 ms returned []
Implicit Place search using SMT with State Equation took 750 ms to find 0 implicit places.
Running 606 sub problems to find dead transitions.
[2026-05-23 02:04:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/376 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 1 (OVERLAPS) 1/377 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/377 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 606 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (OVERLAPS) 607/984 variables, 377/404 constraints. Problems are: Problem set: 0 solved, 606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 984/984 variables, and 404 constraints, problems are : Problem set: 0 solved, 606 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 377/377 constraints, PredecessorRefiner: 606/606 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 606 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/376 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 1 (OVERLAPS) 1/377 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/377 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 3 (OVERLAPS) 607/984 variables, 377/404 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/984 variables, 606/1010 constraints. Problems are: Problem set: 0 solved, 606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 984/984 variables, and 1010 constraints, problems are : Problem set: 0 solved, 606 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 377/377 constraints, PredecessorRefiner: 606/606 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60113ms problems are : Problem set: 0 solved, 606 unsolved
Search for dead transitions found 0 dead transitions in 60115ms
Starting structural reductions in LTL mode, iteration 1 : 377/484 places, 607/714 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60930 ms. Remains : 377/484 places, 607/714 transitions.
[2026-05-23 02:05:56] [INFO ] Flatten gal took : 16 ms
[2026-05-23 02:05:56] [INFO ] Flatten gal took : 16 ms
[2026-05-23 02:05:56] [INFO ] Input system was already deterministic with 607 transitions.
[2026-05-23 02:05:56] [INFO ] Flatten gal took : 16 ms
[2026-05-23 02:05:56] [INFO ] Flatten gal took : 16 ms
[2026-05-23 02:05:56] [INFO ] Time to serialize gal into /tmp/CTLFireability13390132128391190171.gal : 5 ms
[2026-05-23 02:05:56] [INFO ] Time to serialize properties into /tmp/CTLFireability11931311184958823711.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/CTLFireability13390132128391190171.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11931311184958823711.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-23 02:06:26] [INFO ] Flatten gal took : 15 ms
[2026-05-23 02:06:26] [INFO ] Applying decomposition
[2026-05-23 02:06:26] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph1448232480136604709.txt' '-o' '/tmp/graph1448232480136604709.bin' '-w' '/tmp/graph1448232480136604709.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1448232480136604709.bin' '-l' '-1' '-v' '-w' '/tmp/graph1448232480136604709.weights' '-q' '0' '-e' '0.001'
[2026-05-23 02:06:26] [INFO ] Decomposing Gal with order
[2026-05-23 02:06:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 02:06:26] [INFO ] Removed a total of 487 redundant transitions.
[2026-05-23 02:06:26] [INFO ] Flatten gal took : 42 ms
[2026-05-23 02:06:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 9 ms.
[2026-05-23 02:06:26] [INFO ] Time to serialize gal into /tmp/CTLFireability7465561021429406998.gal : 8 ms
[2026-05-23 02:06:26] [INFO ] Time to serialize properties into /tmp/CTLFireability11884788558854133498.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/CTLFireability7465561021429406998.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11884788558854133498.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.17843e+30,1.0508,37892,8387,20,48996,697,847,131722,63,1457,0


Converting to forward existential form...Done !
original formula: E(EF((i17.u83.p442==1)) U ((AX(AG(((i6.i1.u33.p154==1)&&(i8.i0.u43.p198==1)))) + EG(EX(((i10.i0.u54.p259==1)&&(i13.i0.u68.p324==1))))) + ...326
=> equivalent forward existential formula: (([(FwdU(Init,E(TRUE U (i17.u83.p442==1))) * !(EX(!(!(E(TRUE U !(((i6.i1.u33.p154==1)&&(i8.i0.u43.p198==1)))))))...625
Reverse transition relation is NOT exact ! Due to transitions t6, t35, t64, t126, t170, t231, i1.i1.t401, i2.i1.t387, i3.i1.t372, i4.i1.t355, i5.i1.t340, i...474
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 714/714 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 423 transition count 653
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 423 transition count 653
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 154 place count 391 transition count 621
Iterating global reduction 0 with 32 rules applied. Total rules applied 186 place count 391 transition count 621
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 202 place count 375 transition count 605
Iterating global reduction 0 with 16 rules applied. Total rules applied 218 place count 375 transition count 605
Applied a total of 218 rules in 27 ms. Remains 375 /484 variables (removed 109) and now considering 605/714 (removed 109) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13834912028357391957.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13835047747622282896.kers'
[2026-05-23 02:06:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13834912028357391957.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13835047747622282896.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 605 rows 375 cols 1660 entries
Finished phase 1 with 348 SingleSign rule and 0 generalized
[2026-05-23 02:06:56] [INFO ] Computed 27 invariants in 3 ms
Computed 27 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-13835047747622282896.kers
Total runtime 4 ms.
[2026-05-23 02:06:57] [INFO ] Implicit Places using invariants in 258 ms returned []
[2026-05-23 02:06:57] [INFO ] Invariant cache hit.
[2026-05-23 02:06:57] [INFO ] Implicit Places using invariants and state equation in 562 ms returned []
Implicit Place search using SMT with State Equation took 824 ms to find 0 implicit places.
Running 604 sub problems to find dead transitions.
[2026-05-23 02:06:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/374 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 1 (OVERLAPS) 1/375 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/375 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 3 (OVERLAPS) 605/980 variables, 375/402 constraints. Problems are: Problem set: 0 solved, 604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 980/980 variables, and 402 constraints, problems are : Problem set: 0 solved, 604 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 375/375 constraints, PredecessorRefiner: 604/604 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 604 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/374 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 1 (OVERLAPS) 1/375 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/375 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 3 (OVERLAPS) 605/980 variables, 375/402 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/980 variables, 604/1006 constraints. Problems are: Problem set: 0 solved, 604 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 980/980 variables, and 1007 constraints, problems are : Problem set: 0 solved, 604 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 375/375 constraints, PredecessorRefiner: 604/604 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60126ms problems are : Problem set: 0 solved, 604 unsolved
Search for dead transitions found 0 dead transitions in 60130ms
Starting structural reductions in LTL mode, iteration 1 : 375/484 places, 605/714 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60984 ms. Remains : 375/484 places, 605/714 transitions.
[2026-05-23 02:07:57] [INFO ] Flatten gal took : 20 ms
[2026-05-23 02:07:57] [INFO ] Flatten gal took : 20 ms
[2026-05-23 02:07:57] [INFO ] Input system was already deterministic with 605 transitions.
[2026-05-23 02:07:57] [INFO ] Flatten gal took : 20 ms
[2026-05-23 02:07:58] [INFO ] Flatten gal took : 24 ms
[2026-05-23 02:07:58] [INFO ] Time to serialize gal into /tmp/CTLFireability9629161513575344460.gal : 7 ms
[2026-05-23 02:07:58] [INFO ] Time to serialize properties into /tmp/CTLFireability17530783654427447428.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/CTLFireability9629161513575344460.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17530783654427447428.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-23 02:08:28] [INFO ] Flatten gal took : 14 ms
[2026-05-23 02:08:28] [INFO ] Applying decomposition
[2026-05-23 02:08:28] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph14404541269425296808.txt' '-o' '/tmp/graph14404541269425296808.bin' '-w' '/tmp/graph14404541269425296808.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14404541269425296808.bin' '-l' '-1' '-v' '-w' '/tmp/graph14404541269425296808.weights' '-q' '0' '-e' '0.001'
[2026-05-23 02:08:28] [INFO ] Decomposing Gal with order
[2026-05-23 02:08:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 02:08:28] [INFO ] Removed a total of 487 redundant transitions.
[2026-05-23 02:08:28] [INFO ] Flatten gal took : 35 ms
[2026-05-23 02:08:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 8 ms.
[2026-05-23 02:08:28] [INFO ] Time to serialize gal into /tmp/CTLFireability7347113162837137314.gal : 8 ms
[2026-05-23 02:08:28] [INFO ] Time to serialize properties into /tmp/CTLFireability4504002132139089978.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/CTLFireability7347113162837137314.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4504002132139089978.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,1.01419e+30,0.268444,11216,1513,22,11511,491,837,18015,57,1018,0


Converting to forward existential form...Done !
original formula: AG(((EG(AG((i11.i0.u55.p270==0))) + AG(((i3.i1.u17.p79==0)||(i9.i0.u47.p223==0)))) + !(E(E(((i11.i1.u57.p284==1)&&(i16.i0.u76.p396==1)) U...207
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !((EG(!(E(TRUE U !((i11.i0.u55.p270==0))))) + !(E(TRUE U !(((i3.i1.u17.p79==0)||(i9.i0...289
Reverse transition relation is NOT exact ! Due to transitions t6, t35, t66, t112, t171, t230, i1.i1.t399, i2.i1.t385, i3.i1.t370, i4.i1.t355, i5.i1.t340, i...481
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
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
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
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
(forward)formula 0,0,25.4237,458732,1,0,858555,491,5708,1.4413e+06,306,1215,1024853
FORMULA Champagne-PT-H07T1U-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 714/714 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 427 transition count 657
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 427 transition count 657
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 146 place count 395 transition count 625
Iterating global reduction 0 with 32 rules applied. Total rules applied 178 place count 395 transition count 625
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 192 place count 381 transition count 611
Iterating global reduction 0 with 14 rules applied. Total rules applied 206 place count 381 transition count 611
Applied a total of 206 rules in 31 ms. Remains 381 /484 variables (removed 103) and now considering 611/714 (removed 103) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7542576952028323681.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14573691778513997611.kers'
[2026-05-23 02:08:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7542576952028323681.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14573691778513997611.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 611 rows 381 cols 1672 entries
Finished phase 1 with 354 SingleSign rule and 0 generalized
[2026-05-23 02:08:53] [INFO ] Computed 27 invariants in 2 ms
Computed 27 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-14573691778513997611.kers
Total runtime 3 ms.
[2026-05-23 02:08:54] [INFO ] Implicit Places using invariants in 257 ms returned []
[2026-05-23 02:08:54] [INFO ] Invariant cache hit.
[2026-05-23 02:08:54] [INFO ] Implicit Places using invariants and state equation in 619 ms returned []
Implicit Place search using SMT with State Equation took 879 ms to find 0 implicit places.
Running 610 sub problems to find dead transitions.
[2026-05-23 02:08:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/380 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 1 (OVERLAPS) 1/381 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/381 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 610 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 381/992 variables, and 29 constraints, problems are : Problem set: 0 solved, 610 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/381 constraints, PredecessorRefiner: 610/610 constraints, Known Traps: 2/2 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/380 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 1 (OVERLAPS) 1/381 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/381 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/381 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 4 (OVERLAPS) 611/992 variables, 381/410 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/992 variables, 610/1020 constraints. Problems are: Problem set: 0 solved, 610 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 992/992 variables, and 1028 constraints, problems are : Problem set: 0 solved, 610 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 381/381 constraints, PredecessorRefiner: 610/610 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60180ms problems are : Problem set: 0 solved, 610 unsolved
Search for dead transitions found 0 dead transitions in 60186ms
Starting structural reductions in LTL mode, iteration 1 : 381/484 places, 611/714 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61100 ms. Remains : 381/484 places, 611/714 transitions.
[2026-05-23 02:09:54] [INFO ] Flatten gal took : 17 ms
[2026-05-23 02:09:54] [INFO ] Flatten gal took : 17 ms
[2026-05-23 02:09:55] [INFO ] Input system was already deterministic with 611 transitions.
[2026-05-23 02:09:55] [INFO ] Flatten gal took : 17 ms
[2026-05-23 02:09:55] [INFO ] Flatten gal took : 17 ms
[2026-05-23 02:09:55] [INFO ] Time to serialize gal into /tmp/CTLFireability10139336999798180587.gal : 8 ms
[2026-05-23 02:09:55] [INFO ] Time to serialize properties into /tmp/CTLFireability16216717149056090347.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/CTLFireability10139336999798180587.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16216717149056090347.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-23 02:10:25] [INFO ] Flatten gal took : 10 ms
[2026-05-23 02:10:25] [INFO ] Applying decomposition
[2026-05-23 02:10:25] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph11898021871803179593.txt' '-o' '/tmp/graph11898021871803179593.bin' '-w' '/tmp/graph11898021871803179593.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11898021871803179593.bin' '-l' '-1' '-v' '-w' '/tmp/graph11898021871803179593.weights' '-q' '0' '-e' '0.001'
[2026-05-23 02:10:25] [INFO ] Decomposing Gal with order
[2026-05-23 02:10:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 02:10:25] [INFO ] Removed a total of 491 redundant transitions.
[2026-05-23 02:10:25] [INFO ] Flatten gal took : 30 ms
[2026-05-23 02:10:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 7 ms.
[2026-05-23 02:10:25] [INFO ] Time to serialize gal into /tmp/CTLFireability8769240189426612877.gal : 7 ms
[2026-05-23 02:10:25] [INFO ] Time to serialize properties into /tmp/CTLFireability6664143043262782788.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/CTLFireability8769240189426612877.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6664143043262782788.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,1.59987e+30,0.763894,24356,4823,23,32594,682,894,73067,63,1436,0


Converting to forward existential form...Done !
original formula: EX(((!(E((i5.i1.u26.p108!=1) U (A((i7.i0.u35.p170==1) U (i2.u8.p40==1)) * AX((i12.i0.u62.p295==1))))) * AG(((((i15.i1.u74.p363==0)||(i19....243
=> equivalent forward existential formula: [FwdG((EY(Init) * (!(E((i5.i1.u26.p108!=1) U (!((E(!((i2.u8.p40==1)) U (!((i7.i0.u35.p170==1)) * !((i2.u8.p40==1...373
Reverse transition relation is NOT exact ! Due to transitions t6, t36, t65, t80, t109, t139, t168, t198, t227, t243, t276, t385, i1.i1.t405, i2.u10.t390, i...549
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 484/484 places, 714/714 transitions.
Graph (trivial) has 498 edges and 484 vertex of which 223 / 484 are part of one of the 27 SCC in 5 ms
Free SCC test removed 196 places
Ensure Unique test removed 212 transitions
Reduce isomorphic transitions removed 212 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 78 place count 287 transition count 424
Reduce places removed 77 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 123 rules applied. Total rules applied 201 place count 210 transition count 378
Reduce places removed 21 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 22 rules applied. Total rules applied 223 place count 189 transition count 377
Reduce places removed 1 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 3 rules applied. Total rules applied 226 place count 188 transition count 375
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 227 place count 187 transition count 375
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 227 place count 187 transition count 374
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 229 place count 186 transition count 374
Discarding 36 places :
Symmetric choice reduction at 5 with 36 rule applications. Total rules 265 place count 150 transition count 321
Iterating global reduction 5 with 36 rules applied. Total rules applied 301 place count 150 transition count 321
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 306 place count 150 transition count 316
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 307 place count 149 transition count 311
Iterating global reduction 6 with 1 rules applied. Total rules applied 308 place count 149 transition count 311
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 309 place count 149 transition count 310
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 7 with 116 rules applied. Total rules applied 425 place count 91 transition count 252
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 439 place count 77 transition count 186
Iterating global reduction 7 with 14 rules applied. Total rules applied 453 place count 77 transition count 186
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 467 place count 77 transition count 172
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 469 place count 75 transition count 170
Applied a total of 469 rules in 152 ms. Remains 75 /484 variables (removed 409) and now considering 170/714 (removed 544) transitions.
[2026-05-23 02:10:55] [INFO ] Flow matrix only has 71 transitions (discarded 99 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6321286502418166151.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6329749479615739853.kers'
[2026-05-23 02:10:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6321286502418166151.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6329749479615739853.kers]
Normalized transition count is 70 out of 71 initially.
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 70 rows 68 cols 178 entries
Finished phase 1 with 48 SingleSign rule and 0 generalized
[2026-05-23 02:10:55] [INFO ] Computed 27 invariants in 0 ms
Computed 27 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6329749479615739853.kers
Total runtime 1 ms.
[2026-05-23 02:10:55] [INFO ] Implicit Places using invariants in 139 ms returned []
[2026-05-23 02:10:55] [INFO ] Flow matrix only has 71 transitions (discarded 99 similar events)
[2026-05-23 02:10:55] [INFO ] Invariant cache hit.
[2026-05-23 02:10:55] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
[2026-05-23 02:10:55] [INFO ] Redundant transitions in 10 ms returned []
Running 95 sub problems to find dead transitions.
[2026-05-23 02:10:55] [INFO ] Flow matrix only has 71 transitions (discarded 99 similar events)
[2026-05-23 02:10:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 2/75 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (OVERLAPS) 70/145 variables, 75/102 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 0/145 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/146 variables, and 102 constraints, problems are : Problem set: 0 solved, 95 unsolved in 4585 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 2/75 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (OVERLAPS) 70/145 variables, 75/102 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 95/197 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (OVERLAPS) 0/145 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/146 variables, and 197 constraints, problems are : Problem set: 0 solved, 95 unsolved in 4789 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9394ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 9395ms
Starting structural reductions in SI_CTL mode, iteration 1 : 75/484 places, 170/714 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9907 ms. Remains : 75/484 places, 170/714 transitions.
[2026-05-23 02:11:05] [INFO ] Flatten gal took : 7 ms
[2026-05-23 02:11:05] [INFO ] Flatten gal took : 6 ms
[2026-05-23 02:11:05] [INFO ] Input system was already deterministic with 170 transitions.
RANDOM walk for 446 steps (9 resets) in 21 ms. (20 steps per ms) remains 0/1 properties
FORMULA Champagne-PT-H07T1U-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-23 02:11:05] [INFO ] Flatten gal took : 5 ms
[2026-05-23 02:11:05] [INFO ] Flatten gal took : 7 ms
[2026-05-23 02:11:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16346915889560603516.gal : 2 ms
[2026-05-23 02:11:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3565642135972618856.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/ReachabilityCardinality16346915889560603516.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3565642135972618856.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 : 484/484 places, 714/714 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 428 transition count 658
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 428 transition count 658
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 144 place count 396 transition count 626
Iterating global reduction 0 with 32 rules applied. Total rules applied 176 place count 396 transition count 626
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 190 place count 382 transition count 612
Iterating global reduction 0 with 14 rules applied. Total rules applied 204 place count 382 transition count 612
Applied a total of 204 rules in 58 ms. Remains 382 /484 variables (removed 102) and now considering 612/714 (removed 102) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11365328377719555157.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2688346153334254519.kers'
[2026-05-23 02:11:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11365328377719555157.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2688346153334254519.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 612 rows 382 cols 1674 entries
Finished phase 1 with 355 SingleSign rule and 0 generalized
[2026-05-23 02:11:05] [INFO ] Computed 27 invariants in 5 ms
Computed 27 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-2688346153334254519.kers
Total runtime 6 ms.
[2026-05-23 02:11:05] [INFO ] Implicit Places using invariants in 261 ms returned []
[2026-05-23 02:11:05] [INFO ] Invariant cache hit.
[2026-05-23 02:11:06] [INFO ] Implicit Places using invariants and state equation in 549 ms returned []
Implicit Place search using SMT with State Equation took 812 ms to find 0 implicit places.
Running 611 sub problems to find dead transitions.
[2026-05-23 02:11:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/381 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 611 unsolved
At refinement iteration 1 (OVERLAPS) 1/382 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 611 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 382/994 variables, and 27 constraints, problems are : Problem set: 0 solved, 611 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/382 constraints, PredecessorRefiner: 611/611 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 611 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/381 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 611 unsolved
At refinement iteration 1 (OVERLAPS) 1/382 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 611 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/382 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 611 unsolved
At refinement iteration 3 (OVERLAPS) 612/994 variables, 382/409 constraints. Problems are: Problem set: 0 solved, 611 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/994 variables, 611/1020 constraints. Problems are: Problem set: 0 solved, 611 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 994/994 variables, and 1020 constraints, problems are : Problem set: 0 solved, 611 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 382/382 constraints, PredecessorRefiner: 611/611 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60152ms problems are : Problem set: 0 solved, 611 unsolved
Search for dead transitions found 0 dead transitions in 60154ms
Starting structural reductions in LTL mode, iteration 1 : 382/484 places, 612/714 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61026 ms. Remains : 382/484 places, 612/714 transitions.
[2026-05-23 02:12:06] [INFO ] Flatten gal took : 19 ms
[2026-05-23 02:12:06] [INFO ] Flatten gal took : 19 ms
[2026-05-23 02:12:06] [INFO ] Input system was already deterministic with 612 transitions.
[2026-05-23 02:12:06] [INFO ] Flatten gal took : 18 ms
[2026-05-23 02:12:06] [INFO ] Flatten gal took : 18 ms
[2026-05-23 02:12:06] [INFO ] Time to serialize gal into /tmp/CTLFireability12506900550493989702.gal : 5 ms
[2026-05-23 02:12:06] [INFO ] Time to serialize properties into /tmp/CTLFireability16537657726574212051.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/CTLFireability12506900550493989702.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16537657726574212051.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-23 02:12:36] [INFO ] Flatten gal took : 10 ms
[2026-05-23 02:12:36] [INFO ] Applying decomposition
[2026-05-23 02:12:36] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph5596544398551389301.txt' '-o' '/tmp/graph5596544398551389301.bin' '-w' '/tmp/graph5596544398551389301.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5596544398551389301.bin' '-l' '-1' '-v' '-w' '/tmp/graph5596544398551389301.weights' '-q' '0' '-e' '0.001'
[2026-05-23 02:12:36] [INFO ] Decomposing Gal with order
[2026-05-23 02:12:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 02:12:36] [INFO ] Removed a total of 472 redundant transitions.
[2026-05-23 02:12:36] [INFO ] Flatten gal took : 32 ms
[2026-05-23 02:12:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 7 ms.
[2026-05-23 02:12:36] [INFO ] Time to serialize gal into /tmp/CTLFireability3675969821121913419.gal : 6 ms
[2026-05-23 02:12:36] [INFO ] Time to serialize properties into /tmp/CTLFireability5680447129515040763.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/CTLFireability3675969821121913419.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5680447129515040763.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,1.67244e+30,1.14816,39252,8509,22,53824,530,823,133756,57,1149,0


Converting to forward existential form...Done !
original formula: EG(((EG(AG((i2.i1.u17.p79==0))) * ((AX(((i19.u88.p467==0)||(i22.i0.u103.p528==0))) + AG((i26.i1.u126.p657==1))) + EG((i9.i1.u53.p260==1))...388
=> equivalent forward existential formula: [FwdG(Init,((EG(!(E(TRUE U !((i2.i1.u17.p79==0))))) * ((!(EX(!(((i19.u88.p467==0)||(i22.i0.u103.p528==0))))) + !...485
Reverse transition relation is NOT exact ! Due to transitions t6, t38, t67, t112, t187, t232, i0.i1.t405, i1.i1.t391, i2.i1.t376, i3.i1.t361, i4.i1.t346, i...491
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 714/714 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 434 transition count 664
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 434 transition count 664
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 129 place count 405 transition count 635
Iterating global reduction 0 with 29 rules applied. Total rules applied 158 place count 405 transition count 635
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 173 place count 390 transition count 620
Iterating global reduction 0 with 15 rules applied. Total rules applied 188 place count 390 transition count 620
Applied a total of 188 rules in 33 ms. Remains 390 /484 variables (removed 94) and now considering 620/714 (removed 94) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1129440023348363326.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14660528585527212327.kers'
[2026-05-23 02:13:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1129440023348363326.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14660528585527212327.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 620 rows 390 cols 1690 entries
Finished phase 1 with 363 SingleSign rule and 0 generalized
[2026-05-23 02:13:06] [INFO ] Computed 27 invariants in 3 ms
Computed 27 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-14660528585527212327.kers
Total runtime 4 ms.
[2026-05-23 02:13:07] [INFO ] Implicit Places using invariants in 221 ms returned []
[2026-05-23 02:13:07] [INFO ] Invariant cache hit.
[2026-05-23 02:13:07] [INFO ] Implicit Places using invariants and state equation in 515 ms returned []
Implicit Place search using SMT with State Equation took 750 ms to find 0 implicit places.
Running 619 sub problems to find dead transitions.
[2026-05-23 02:13:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/389 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 1 (OVERLAPS) 1/390 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 619 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 390/1010 variables, and 27 constraints, problems are : Problem set: 0 solved, 619 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/390 constraints, PredecessorRefiner: 619/619 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 619 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/389 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 1 (OVERLAPS) 1/390 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/390 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 3 (OVERLAPS) 620/1010 variables, 390/417 constraints. Problems are: Problem set: 0 solved, 619 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1010/1010 variables, and 1036 constraints, problems are : Problem set: 0 solved, 619 unsolved in 30081 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 390/390 constraints, PredecessorRefiner: 619/619 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60181ms problems are : Problem set: 0 solved, 619 unsolved
Search for dead transitions found 0 dead transitions in 60183ms
Starting structural reductions in LTL mode, iteration 1 : 390/484 places, 620/714 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60969 ms. Remains : 390/484 places, 620/714 transitions.
[2026-05-23 02:14:07] [INFO ] Flatten gal took : 18 ms
[2026-05-23 02:14:07] [INFO ] Flatten gal took : 17 ms
[2026-05-23 02:14:07] [INFO ] Input system was already deterministic with 620 transitions.
[2026-05-23 02:14:07] [INFO ] Flatten gal took : 17 ms
[2026-05-23 02:14:07] [INFO ] Flatten gal took : 17 ms
[2026-05-23 02:14:07] [INFO ] Time to serialize gal into /tmp/CTLFireability14763695375277433323.gal : 5 ms
[2026-05-23 02:14:07] [INFO ] Time to serialize properties into /tmp/CTLFireability3617779080605346218.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/CTLFireability14763695375277433323.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3617779080605346218.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-23 02:14:37] [INFO ] Flatten gal took : 15 ms
[2026-05-23 02:14:37] [INFO ] Applying decomposition
[2026-05-23 02:14:38] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph15271346115244521150.txt' '-o' '/tmp/graph15271346115244521150.bin' '-w' '/tmp/graph15271346115244521150.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15271346115244521150.bin' '-l' '-1' '-v' '-w' '/tmp/graph15271346115244521150.weights' '-q' '0' '-e' '0.001'
[2026-05-23 02:14:38] [INFO ] Decomposing Gal with order
[2026-05-23 02:14:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 02:14:38] [INFO ] Removed a total of 468 redundant transitions.
[2026-05-23 02:14:38] [INFO ] Flatten gal took : 43 ms
[2026-05-23 02:14:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 14 ms.
[2026-05-23 02:14:38] [INFO ] Time to serialize gal into /tmp/CTLFireability6577941520728023636.gal : 9 ms
[2026-05-23 02:14:38] [INFO ] Time to serialize properties into /tmp/CTLFireability18443938670224699982.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/CTLFireability6577941520728023636.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18443938670224699982.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,3.08117e+30,1.62356,39400,8574,20,51947,597,955,135494,60,1402,0


Converting to forward existential form...Done !
original formula: EG((((((AG(((i11.i0.u60.p284==1)&&(i14.i0.u67.p321==1))) * E((i21.i0.u103.p517==1) U (i15.i1.u75.p360==1))) * ((i21.i0.u100.p499==0)&&(i4...583
=> equivalent forward existential formula: [FwdG(Init,(((((!(E(TRUE U !(((i11.i0.u60.p284==1)&&(i14.i0.u67.p321==1))))) * E((i21.i0.u103.p517==1) U (i15.i1...737
Reverse transition relation is NOT exact ! Due to transitions t6, t35, t66, t112, t175, t236, i0.i1.u6.t410, i1.i1.u12.t396, i2.i1.t380, i3.i1.t365, i4.i1....555
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 484/484 places, 714/714 transitions.
Graph (trivial) has 483 edges and 484 vertex of which 205 / 484 are part of one of the 25 SCC in 1 ms
Free SCC test removed 180 places
Ensure Unique test removed 195 transitions
Reduce isomorphic transitions removed 195 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 303 transition count 439
Reduce places removed 79 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 123 rules applied. Total rules applied 203 place count 224 transition count 395
Reduce places removed 20 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 21 rules applied. Total rules applied 224 place count 204 transition count 394
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 225 place count 203 transition count 394
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 225 place count 203 transition count 391
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 231 place count 200 transition count 391
Discarding 32 places :
Symmetric choice reduction at 4 with 32 rule applications. Total rules 263 place count 168 transition count 346
Iterating global reduction 4 with 32 rules applied. Total rules applied 295 place count 168 transition count 346
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 299 place count 168 transition count 342
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 300 place count 167 transition count 337
Iterating global reduction 5 with 1 rules applied. Total rules applied 301 place count 167 transition count 337
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 302 place count 167 transition count 336
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 6 with 120 rules applied. Total rules applied 422 place count 107 transition count 276
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 433 place count 96 transition count 226
Iterating global reduction 6 with 11 rules applied. Total rules applied 444 place count 96 transition count 226
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 455 place count 96 transition count 215
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 457 place count 94 transition count 213
Applied a total of 457 rules in 73 ms. Remains 94 /484 variables (removed 390) and now considering 213/714 (removed 501) transitions.
[2026-05-23 02:15:08] [INFO ] Flow matrix only has 109 transitions (discarded 104 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5932225995882652728.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6420310018732508483.kers'
[2026-05-23 02:15:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5932225995882652728.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6420310018732508483.kers]
Normalized transition count is 108 out of 109 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 108 rows 90 cols 280 entries
Finished phase 1 with 67 SingleSign rule and 0 generalized
[2026-05-23 02:15:08] [INFO ] Computed 27 invariants in 0 ms
Computed 27 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6420310018732508483.kers
Total runtime 1 ms.
[2026-05-23 02:15:08] [INFO ] Implicit Places using invariants in 100 ms returned []
[2026-05-23 02:15:08] [INFO ] Flow matrix only has 109 transitions (discarded 104 similar events)
[2026-05-23 02:15:08] [INFO ] Invariant cache hit.
[2026-05-23 02:15:08] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
[2026-05-23 02:15:08] [INFO ] Redundant transitions in 9 ms returned []
Running 136 sub problems to find dead transitions.
[2026-05-23 02:15:08] [INFO ] Flow matrix only has 109 transitions (discarded 104 similar events)
[2026-05-23 02:15:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 3/94 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 108/202 variables, 94/121 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 0/202 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/203 variables, and 121 constraints, problems are : Problem set: 0 solved, 136 unsolved in 7643 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 3/94 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 108/202 variables, 94/121 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 136/257 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (OVERLAPS) 0/202 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/203 variables, and 257 constraints, problems are : Problem set: 0 solved, 136 unsolved in 7022 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14681ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 14682ms
Starting structural reductions in SI_CTL mode, iteration 1 : 94/484 places, 213/714 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15017 ms. Remains : 94/484 places, 213/714 transitions.
[2026-05-23 02:15:23] [INFO ] Flatten gal took : 5 ms
[2026-05-23 02:15:23] [INFO ] Flatten gal took : 4 ms
[2026-05-23 02:15:23] [INFO ] Input system was already deterministic with 213 transitions.
[2026-05-23 02:15:23] [INFO ] Flatten gal took : 5 ms
[2026-05-23 02:15:23] [INFO ] Flatten gal took : 5 ms
[2026-05-23 02:15:23] [INFO ] Time to serialize gal into /tmp/CTLFireability906992869746029391.gal : 2 ms
[2026-05-23 02:15:23] [INFO ] Time to serialize properties into /tmp/CTLFireability17359289370648511189.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/CTLFireability906992869746029391.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17359289370648511189.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,8.33109e+13,0.073806,5196,2,162,5,2343,6,0,567,1248,0


Converting to forward existential form...Done !
original formula: AG((((p319==0) + EF(((((p111==1)&&(p293==1))&&(p10==0))||(((p43==1)&&(p388==1))&&(p232==1))))) + (p576==1)))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * !((p576==1))) * !((p319==0))) * !(E(TRUE U ((((p111==1)&&(p293==1))&&(p10==0))||(((p43==1)...192
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.276374,8180,1,0,15,23035,18,7,2557,12870,7
FORMULA Champagne-PT-H07T1U-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 714/714 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 423 transition count 653
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 423 transition count 653
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 156 place count 389 transition count 619
Iterating global reduction 0 with 34 rules applied. Total rules applied 190 place count 389 transition count 619
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 206 place count 373 transition count 603
Iterating global reduction 0 with 16 rules applied. Total rules applied 222 place count 373 transition count 603
Applied a total of 222 rules in 36 ms. Remains 373 /484 variables (removed 111) and now considering 603/714 (removed 111) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13893287172913541349.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11701404100344087504.kers'
[2026-05-23 02:15:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13893287172913541349.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11701404100344087504.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 603 rows 373 cols 1656 entries
Finished phase 1 with 346 SingleSign rule and 0 generalized
[2026-05-23 02:15:23] [INFO ] Computed 27 invariants in 5 ms
Computed 27 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-11701404100344087504.kers
Total runtime 6 ms.
[2026-05-23 02:15:23] [INFO ] Implicit Places using invariants in 274 ms returned []
[2026-05-23 02:15:23] [INFO ] Invariant cache hit.
[2026-05-23 02:15:24] [INFO ] Implicit Places using invariants and state equation in 565 ms returned []
Implicit Place search using SMT with State Equation took 841 ms to find 0 implicit places.
Running 602 sub problems to find dead transitions.
[2026-05-23 02:15:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 1 (OVERLAPS) 1/373 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 602 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 373/976 variables, and 27 constraints, problems are : Problem set: 0 solved, 602 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/373 constraints, PredecessorRefiner: 602/602 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 602 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 1 (OVERLAPS) 1/373 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/373 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 3 (OVERLAPS) 603/976 variables, 373/400 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/976 variables, 602/1002 constraints. Problems are: Problem set: 0 solved, 602 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 976/976 variables, and 1002 constraints, problems are : Problem set: 0 solved, 602 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 373/373 constraints, PredecessorRefiner: 602/602 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60149ms problems are : Problem set: 0 solved, 602 unsolved
Search for dead transitions found 0 dead transitions in 60151ms
Starting structural reductions in LTL mode, iteration 1 : 373/484 places, 603/714 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61033 ms. Remains : 373/484 places, 603/714 transitions.
[2026-05-23 02:16:24] [INFO ] Flatten gal took : 13 ms
[2026-05-23 02:16:24] [INFO ] Flatten gal took : 13 ms
[2026-05-23 02:16:24] [INFO ] Input system was already deterministic with 603 transitions.
[2026-05-23 02:16:24] [INFO ] Flatten gal took : 14 ms
[2026-05-23 02:16:24] [INFO ] Flatten gal took : 13 ms
[2026-05-23 02:16:24] [INFO ] Time to serialize gal into /tmp/CTLFireability4697149205024784137.gal : 4 ms
[2026-05-23 02:16:24] [INFO ] Time to serialize properties into /tmp/CTLFireability13586240719647411812.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/CTLFireability4697149205024784137.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13586240719647411812.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-23 02:16:54] [INFO ] Flatten gal took : 9 ms
[2026-05-23 02:16:54] [INFO ] Applying decomposition
[2026-05-23 02:16:54] [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/graph13649911594795565584.txt' '-o' '/tmp/graph13649911594795565584.bin' '-w' '/tmp/graph13649911594795565584.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13649911594795565584.bin' '-l' '-1' '-v' '-w' '/tmp/graph13649911594795565584.weights' '-q' '0' '-e' '0.001'
[2026-05-23 02:16:54] [INFO ] Decomposing Gal with order
[2026-05-23 02:16:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 02:16:54] [INFO ] Removed a total of 465 redundant transitions.
[2026-05-23 02:16:54] [INFO ] Flatten gal took : 26 ms
[2026-05-23 02:16:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 5 ms.
[2026-05-23 02:16:54] [INFO ] Time to serialize gal into /tmp/CTLFireability3242455697848925702.gal : 5 ms
[2026-05-23 02:16:54] [INFO ] Time to serialize properties into /tmp/CTLFireability13195147599900655275.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/CTLFireability3242455697848925702.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13195147599900655275.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,8.69982e+29,0.225201,7924,524,20,5462,555,835,5949,59,1173,0


Converting to forward existential form...Done !
original formula: EF(((EG(AX(((i3.i1.u21.p104==0)||(i8.i1.u43.p223==0)))) * AX(((i20.i1.u98.p539==1)&&(i23.i1.u115.p637==1)))) * ((i13.i0.u61.p338==0)||(i1...175
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * ((i13.i0.u61.p338==0)||(i17.i2.u82.p450==0))) * EG(!(EX(!(((i3.i1.u21.p104==0)||(i8.i1.u43...239
Reverse transition relation is NOT exact ! Due to transitions t6, t35, t64, t111, t170, t229, i0.i1.t397, i1.i1.t383, i2.i1.t368, i3.i1.t353, i4.t338, i5.i...457
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
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
(forward)formula 0,1,8.5175,176344,1,0,342434,555,4827,427073,287,1173,348151
FORMULA Champagne-PT-H07T1U-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 714/714 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 423 transition count 653
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 423 transition count 653
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 156 place count 389 transition count 619
Iterating global reduction 0 with 34 rules applied. Total rules applied 190 place count 389 transition count 619
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 207 place count 372 transition count 602
Iterating global reduction 0 with 17 rules applied. Total rules applied 224 place count 372 transition count 602
Applied a total of 224 rules in 21 ms. Remains 372 /484 variables (removed 112) and now considering 602/714 (removed 112) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15875447067393210228.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9835426281361985192.kers'
[2026-05-23 02:17:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15875447067393210228.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9835426281361985192.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 602 rows 372 cols 1654 entries
Finished phase 1 with 345 SingleSign rule and 0 generalized
[2026-05-23 02:17:03] [INFO ] Computed 27 invariants in 2 ms
Computed 27 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9835426281361985192.kers
Total runtime 4 ms.
[2026-05-23 02:17:03] [INFO ] Implicit Places using invariants in 165 ms returned []
[2026-05-23 02:17:03] [INFO ] Invariant cache hit.
[2026-05-23 02:17:04] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 564 ms to find 0 implicit places.
Running 601 sub problems to find dead transitions.
[2026-05-23 02:17:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/371 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (OVERLAPS) 1/372 variables, 27/27 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 372/974 variables, and 27 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/372 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/371 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (OVERLAPS) 1/372 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/372 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 3 (OVERLAPS) 602/974 variables, 372/399 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/974 variables, 601/1000 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 974/974 variables, and 1000 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 372/372 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60155ms problems are : Problem set: 0 solved, 601 unsolved
Search for dead transitions found 0 dead transitions in 60159ms
Starting structural reductions in LTL mode, iteration 1 : 372/484 places, 602/714 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60747 ms. Remains : 372/484 places, 602/714 transitions.
[2026-05-23 02:18:04] [INFO ] Flatten gal took : 13 ms
[2026-05-23 02:18:04] [INFO ] Flatten gal took : 14 ms
[2026-05-23 02:18:04] [INFO ] Input system was already deterministic with 602 transitions.
[2026-05-23 02:18:04] [INFO ] Flatten gal took : 13 ms
[2026-05-23 02:18:04] [INFO ] Flatten gal took : 17 ms
[2026-05-23 02:18:04] [INFO ] Time to serialize gal into /tmp/CTLFireability10911536836629920953.gal : 4 ms
[2026-05-23 02:18:04] [INFO ] Time to serialize properties into /tmp/CTLFireability8082849440598929971.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/CTLFireability10911536836629920953.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8082849440598929971.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-23 02:18:34] [INFO ] Flatten gal took : 9 ms
[2026-05-23 02:18:34] [INFO ] Applying decomposition
[2026-05-23 02:18:34] [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/graph13816928586860488406.txt' '-o' '/tmp/graph13816928586860488406.bin' '-w' '/tmp/graph13816928586860488406.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13816928586860488406.bin' '-l' '-1' '-v' '-w' '/tmp/graph13816928586860488406.weights' '-q' '0' '-e' '0.001'
[2026-05-23 02:18:34] [INFO ] Decomposing Gal with order
[2026-05-23 02:18:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 02:18:34] [INFO ] Removed a total of 469 redundant transitions.
[2026-05-23 02:18:34] [INFO ] Flatten gal took : 42 ms
[2026-05-23 02:18:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 8 ms.
[2026-05-23 02:18:34] [INFO ] Time to serialize gal into /tmp/CTLFireability17013669406489514830.gal : 8 ms
[2026-05-23 02:18:34] [INFO ] Time to serialize properties into /tmp/CTLFireability18092258358426435070.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/CTLFireability17013669406489514830.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18092258358426435070.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,8.16947e+29,1.49841,39956,8721,25,52540,626,807,135611,63,1225,0


Converting to forward existential form...Done !
original formula: AG(EX((EF((((i0.i1.u7.p29==0)||(i11.i0.u52.p267==0))||((i23.u103.p570==0)||(i13.u114.p611==0)))) * (!(A((i16.i0.u74.p386==1) U (i17.i1.u7...218
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX((E(TRUE U (((i0.i1.u7.p29==0)||(i11.i0.u52.p267==0))||((i23.u103.p570==0)||(i13.u114.p6...353
Reverse transition relation is NOT exact ! Due to transitions t6, t35, t64, t108, t167, t228, i0.i1.t396, i1.i1.t382, i2.i1.t367, i3.i1.t352, i4.i1.t337, i...478
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
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
(forward)formula 0,0,24.6039,378656,1,0,789307,626,5247,1.26208e+06,314,1225,1658500
FORMULA Champagne-PT-H07T1U-CTLFireability-2024-09 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 : 484/484 places, 714/714 transitions.
Discarding 62 places :
Symmetric choice reduction at 0 with 62 rule applications. Total rules 62 place count 422 transition count 652
Iterating global reduction 0 with 62 rules applied. Total rules applied 124 place count 422 transition count 652
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 159 place count 387 transition count 617
Iterating global reduction 0 with 35 rules applied. Total rules applied 194 place count 387 transition count 617
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 211 place count 370 transition count 600
Iterating global reduction 0 with 17 rules applied. Total rules applied 228 place count 370 transition count 600
Applied a total of 228 rules in 27 ms. Remains 370 /484 variables (removed 114) and now considering 600/714 (removed 114) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11918696911366110379.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12974249809816289723.kers'
[2026-05-23 02:18:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11918696911366110379.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12974249809816289723.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 600 rows 370 cols 1650 entries
Finished phase 1 with 343 SingleSign rule and 0 generalized
[2026-05-23 02:18:59] [INFO ] Computed 27 invariants in 2 ms
Computed 27 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-12974249809816289723.kers
Total runtime 4 ms.
[2026-05-23 02:18:59] [INFO ] Implicit Places using invariants in 205 ms returned []
[2026-05-23 02:18:59] [INFO ] Invariant cache hit.
[2026-05-23 02:19:00] [INFO ] Implicit Places using invariants and state equation in 515 ms returned []
Implicit Place search using SMT with State Equation took 722 ms to find 0 implicit places.
Running 599 sub problems to find dead transitions.
[2026-05-23 02:19:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/369 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 1 (OVERLAPS) 1/370 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 599 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 370/970 variables, and 27 constraints, problems are : Problem set: 0 solved, 599 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/370 constraints, PredecessorRefiner: 599/599 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 599 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/369 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 1 (OVERLAPS) 1/370 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 3 (OVERLAPS) 600/970 variables, 370/397 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/970 variables, 599/996 constraints. Problems are: Problem set: 0 solved, 599 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 970/970 variables, and 996 constraints, problems are : Problem set: 0 solved, 599 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 370/370 constraints, PredecessorRefiner: 599/599 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60111ms problems are : Problem set: 0 solved, 599 unsolved
Search for dead transitions found 0 dead transitions in 60114ms
Starting structural reductions in LTL mode, iteration 1 : 370/484 places, 600/714 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60866 ms. Remains : 370/484 places, 600/714 transitions.
[2026-05-23 02:20:00] [INFO ] Flatten gal took : 13 ms
[2026-05-23 02:20:00] [INFO ] Flatten gal took : 14 ms
[2026-05-23 02:20:00] [INFO ] Input system was already deterministic with 600 transitions.
[2026-05-23 02:20:00] [INFO ] Flatten gal took : 14 ms
[2026-05-23 02:20:00] [INFO ] Flatten gal took : 14 ms
[2026-05-23 02:20:00] [INFO ] Time to serialize gal into /tmp/CTLFireability11173560910011487614.gal : 4 ms
[2026-05-23 02:20:00] [INFO ] Time to serialize properties into /tmp/CTLFireability17264879972911290561.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/CTLFireability11173560910011487614.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17264879972911290561.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-23 02:20:30] [INFO ] Flatten gal took : 8 ms
[2026-05-23 02:20:30] [INFO ] Applying decomposition
[2026-05-23 02:20:30] [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/graph10037308305546070639.txt' '-o' '/tmp/graph10037308305546070639.bin' '-w' '/tmp/graph10037308305546070639.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10037308305546070639.bin' '-l' '-1' '-v' '-w' '/tmp/graph10037308305546070639.weights' '-q' '0' '-e' '0.001'
[2026-05-23 02:20:30] [INFO ] Decomposing Gal with order
[2026-05-23 02:20:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 02:20:30] [INFO ] Removed a total of 491 redundant transitions.
[2026-05-23 02:20:30] [INFO ] Flatten gal took : 27 ms
[2026-05-23 02:20:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 4 ms.
[2026-05-23 02:20:30] [INFO ] Time to serialize gal into /tmp/CTLFireability4697107635427680261.gal : 4 ms
[2026-05-23 02:20:30] [INFO ] Time to serialize properties into /tmp/CTLFireability14377538806601704589.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/CTLFireability4697107635427680261.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14377538806601704589.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,7.08021e+29,0.971069,37596,8292,20,48548,528,839,130598,57,1021,0


Converting to forward existential form...Done !
original formula: EX(((i14.i1.u67.p363==1) + EF(((i22.i1.u102.p544==1)&&(i16.i1.u76.p403==1)))))
=> equivalent forward existential formula: ([(EY(Init) * (i14.i1.u67.p363==1))] != FALSE + [(FwdU(EY(Init),TRUE) * ((i22.i1.u102.p544==1)&&(i16.i1.u76.p403...172
(forward)formula 0,1,1.5191,39264,1,0,48643,528,1864,130598,106,1021,283066
FORMULA Champagne-PT-H07T1U-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 714/714 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 423 transition count 653
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 423 transition count 653
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 157 place count 388 transition count 618
Iterating global reduction 0 with 35 rules applied. Total rules applied 192 place count 388 transition count 618
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 209 place count 371 transition count 601
Iterating global reduction 0 with 17 rules applied. Total rules applied 226 place count 371 transition count 601
Applied a total of 226 rules in 20 ms. Remains 371 /484 variables (removed 113) and now considering 601/714 (removed 113) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17476325049457696971.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-174757712130206757.kers'
[2026-05-23 02:20:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17476325049457696971.kers, --Pflows, --basisKERS=/tmp/petrispot-output-174757712130206757.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 601 rows 371 cols 1652 entries
Finished phase 1 with 344 SingleSign rule and 0 generalized
[2026-05-23 02:20:31] [INFO ] Computed 27 invariants in 3 ms
Computed 27 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-174757712130206757.kers
Total runtime 4 ms.
[2026-05-23 02:20:32] [INFO ] Implicit Places using invariants in 168 ms returned []
[2026-05-23 02:20:32] [INFO ] Invariant cache hit.
[2026-05-23 02:20:32] [INFO ] Implicit Places using invariants and state equation in 414 ms returned []
Implicit Place search using SMT with State Equation took 584 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2026-05-23 02:20:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/371 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 371/972 variables, and 27 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/371 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/371 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/371 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 601/972 variables, 371/398 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/972 variables, 600/998 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 972/972 variables, and 998 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 371/371 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60159ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60161ms
Starting structural reductions in LTL mode, iteration 1 : 371/484 places, 601/714 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60769 ms. Remains : 371/484 places, 601/714 transitions.
[2026-05-23 02:21:32] [INFO ] Flatten gal took : 14 ms
[2026-05-23 02:21:32] [INFO ] Flatten gal took : 13 ms
[2026-05-23 02:21:32] [INFO ] Input system was already deterministic with 601 transitions.
[2026-05-23 02:21:32] [INFO ] Flatten gal took : 14 ms
[2026-05-23 02:21:32] [INFO ] Flatten gal took : 14 ms
[2026-05-23 02:21:32] [INFO ] Time to serialize gal into /tmp/CTLFireability12854697667572973236.gal : 4 ms
[2026-05-23 02:21:32] [INFO ] Time to serialize properties into /tmp/CTLFireability4062359408194540484.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/CTLFireability12854697667572973236.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4062359408194540484.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-23 02:22:02] [INFO ] Flatten gal took : 9 ms
[2026-05-23 02:22:02] [INFO ] Applying decomposition
[2026-05-23 02:22:02] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph10570874166914059508.txt' '-o' '/tmp/graph10570874166914059508.bin' '-w' '/tmp/graph10570874166914059508.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10570874166914059508.bin' '-l' '-1' '-v' '-w' '/tmp/graph10570874166914059508.weights' '-q' '0' '-e' '0.001'
[2026-05-23 02:22:02] [INFO ] Decomposing Gal with order
[2026-05-23 02:22:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 02:22:02] [INFO ] Removed a total of 501 redundant transitions.
[2026-05-23 02:22:02] [INFO ] Flatten gal took : 22 ms
[2026-05-23 02:22:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 3 ms.
[2026-05-23 02:22:02] [INFO ] Time to serialize gal into /tmp/CTLFireability10452089077641425277.gal : 5 ms
[2026-05-23 02:22:02] [INFO ] Time to serialize properties into /tmp/CTLFireability12858424345614695351.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/CTLFireability10452089077641425277.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12858424345614695351.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,7.62483e+29,0.240529,11136,1394,20,11414,567,858,20061,59,1117,0


Converting to forward existential form...Done !
original formula: EG(EF(EX((i17.i0.u80.p406==1))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U EX((i17.i0.u80.p406==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t35, t64, t108, t167, t227, i0.i1.t395, i1.i1.t381, i2.i1.t366, i3.i1.t351, i4.i1.t336, i...487
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 714/714 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 427 transition count 657
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 427 transition count 657
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 145 place count 396 transition count 626
Iterating global reduction 0 with 31 rules applied. Total rules applied 176 place count 396 transition count 626
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 192 place count 380 transition count 610
Iterating global reduction 0 with 16 rules applied. Total rules applied 208 place count 380 transition count 610
Applied a total of 208 rules in 23 ms. Remains 380 /484 variables (removed 104) and now considering 610/714 (removed 104) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7082563703431211150.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10377069646328623521.kers'
[2026-05-23 02:22:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7082563703431211150.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10377069646328623521.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 610 rows 380 cols 1670 entries
Finished phase 1 with 353 SingleSign rule and 0 generalized
[2026-05-23 02:22:33] [INFO ] Computed 27 invariants in 2 ms
Computed 27 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-10377069646328623521.kers
Total runtime 3 ms.
[2026-05-23 02:22:33] [INFO ] Implicit Places using invariants in 170 ms returned []
[2026-05-23 02:22:33] [INFO ] Invariant cache hit.
[2026-05-23 02:22:33] [INFO ] Implicit Places using invariants and state equation in 407 ms returned []
Implicit Place search using SMT with State Equation took 588 ms to find 0 implicit places.
Running 609 sub problems to find dead transitions.
[2026-05-23 02:22:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/379 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 609 unsolved
At refinement iteration 1 (OVERLAPS) 1/380 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 609 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 8/35 constraints. Problems are: Problem set: 0 solved, 609 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/990 variables, and 35 constraints, problems are : Problem set: 0 solved, 609 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/380 constraints, PredecessorRefiner: 609/609 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 609 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/379 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 609 unsolved
At refinement iteration 1 (OVERLAPS) 1/380 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 609 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 8/35 constraints. Problems are: Problem set: 0 solved, 609 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 609 unsolved
At refinement iteration 4 (OVERLAPS) 610/990 variables, 380/415 constraints. Problems are: Problem set: 0 solved, 609 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/990 variables, 609/1024 constraints. Problems are: Problem set: 0 solved, 609 unsolved
SMT process timed out in 60494ms, After SMT, problems are : Problem set: 0 solved, 609 unsolved
Search for dead transitions found 0 dead transitions in 60495ms
Starting structural reductions in LTL mode, iteration 1 : 380/484 places, 610/714 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61108 ms. Remains : 380/484 places, 610/714 transitions.
[2026-05-23 02:23:34] [INFO ] Flatten gal took : 14 ms
[2026-05-23 02:23:34] [INFO ] Flatten gal took : 14 ms
[2026-05-23 02:23:34] [INFO ] Input system was already deterministic with 610 transitions.
[2026-05-23 02:23:34] [INFO ] Flatten gal took : 19 ms
[2026-05-23 02:23:34] [INFO ] Flatten gal took : 14 ms
[2026-05-23 02:23:34] [INFO ] Time to serialize gal into /tmp/CTLFireability5202719003105639841.gal : 4 ms
[2026-05-23 02:23:34] [INFO ] Time to serialize properties into /tmp/CTLFireability2860146455307820988.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/CTLFireability5202719003105639841.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2860146455307820988.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-23 02:24:04] [INFO ] Flatten gal took : 8 ms
[2026-05-23 02:24:04] [INFO ] Applying decomposition
[2026-05-23 02:24:04] [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/graph1970985584818725460.txt' '-o' '/tmp/graph1970985584818725460.bin' '-w' '/tmp/graph1970985584818725460.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1970985584818725460.bin' '-l' '-1' '-v' '-w' '/tmp/graph1970985584818725460.weights' '-q' '0' '-e' '0.001'
[2026-05-23 02:24:04] [INFO ] Decomposing Gal with order
[2026-05-23 02:24:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 02:24:04] [INFO ] Removed a total of 492 redundant transitions.
[2026-05-23 02:24:04] [INFO ] Flatten gal took : 23 ms
[2026-05-23 02:24:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 4 ms.
[2026-05-23 02:24:04] [INFO ] Time to serialize gal into /tmp/CTLFireability16086311348095562324.gal : 4 ms
[2026-05-23 02:24:04] [INFO ] Time to serialize properties into /tmp/CTLFireability17920013568117068652.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/CTLFireability16086311348095562324.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17920013568117068652.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.43531e+30,0.300193,12008,1991,26,15075,670,892,13894,66,1482,0


Converting to forward existential form...Done !
original formula: AG(((AX((i26.i1.u129.p667==1)) + EG((i25.i1.u120.p628==0))) + (EX(EG(EF((i9.i1.u46.p221==1)))) + EF(!(A((i22.i1.u107.p549==1) U (i11.i0.u...172
=> equivalent forward existential formula: [(EY(((FwdU(Init,TRUE) * !((EX(EG(E(TRUE U (i9.i1.u46.p221==1)))) + E(TRUE U !(!((E(!((i11.i0.u56.p269==1)) U (!...313
Reverse transition relation is NOT exact ! Due to transitions t6, t38, t69, t114, t144, t173, t203, t232, t279, t310, t385, i1.i1.t404, i2.i1.t390, i3.i1.t...547
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
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
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
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
(forward)formula 0,1,4.08442,123472,1,0,277185,697,6081,354245,343,1482,680117
FORMULA Champagne-PT-H07T1U-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 714/714 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 427 transition count 657
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 427 transition count 657
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 148 place count 393 transition count 623
Iterating global reduction 0 with 34 rules applied. Total rules applied 182 place count 393 transition count 623
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 198 place count 377 transition count 607
Iterating global reduction 0 with 16 rules applied. Total rules applied 214 place count 377 transition count 607
Applied a total of 214 rules in 22 ms. Remains 377 /484 variables (removed 107) and now considering 607/714 (removed 107) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16769675411046294985.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15183192375935845379.kers'
[2026-05-23 02:24:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16769675411046294985.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15183192375935845379.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 607 rows 377 cols 1664 entries
Finished phase 1 with 350 SingleSign rule and 0 generalized
[2026-05-23 02:24:08] [INFO ] Computed 27 invariants in 2 ms
Computed 27 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15183192375935845379.kers
Total runtime 3 ms.
[2026-05-23 02:24:08] [INFO ] Implicit Places using invariants in 177 ms returned []
[2026-05-23 02:24:08] [INFO ] Invariant cache hit.
[2026-05-23 02:24:09] [INFO ] Implicit Places using invariants and state equation in 412 ms returned []
Implicit Place search using SMT with State Equation took 594 ms to find 0 implicit places.
Running 606 sub problems to find dead transitions.
[2026-05-23 02:24:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/376 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 1 (OVERLAPS) 1/377 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/377 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 606 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (OVERLAPS) 607/984 variables, 377/404 constraints. Problems are: Problem set: 0 solved, 606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 984/984 variables, and 404 constraints, problems are : Problem set: 0 solved, 606 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 377/377 constraints, PredecessorRefiner: 606/606 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 606 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/376 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 1 (OVERLAPS) 1/377 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/377 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 3 (OVERLAPS) 607/984 variables, 377/404 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/984 variables, 606/1010 constraints. Problems are: Problem set: 0 solved, 606 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 984/984 variables, and 1010 constraints, problems are : Problem set: 0 solved, 606 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 377/377 constraints, PredecessorRefiner: 606/606 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60119ms problems are : Problem set: 0 solved, 606 unsolved
Search for dead transitions found 0 dead transitions in 60120ms
Starting structural reductions in LTL mode, iteration 1 : 377/484 places, 607/714 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60739 ms. Remains : 377/484 places, 607/714 transitions.
[2026-05-23 02:25:09] [INFO ] Flatten gal took : 13 ms
[2026-05-23 02:25:09] [INFO ] Flatten gal took : 14 ms
[2026-05-23 02:25:09] [INFO ] Input system was already deterministic with 607 transitions.
[2026-05-23 02:25:09] [INFO ] Flatten gal took : 13 ms
[2026-05-23 02:25:09] [INFO ] Flatten gal took : 14 ms
[2026-05-23 02:25:09] [INFO ] Time to serialize gal into /tmp/CTLFireability9391004541338357447.gal : 4 ms
[2026-05-23 02:25:09] [INFO ] Time to serialize properties into /tmp/CTLFireability6461863586238657278.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/CTLFireability9391004541338357447.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6461863586238657278.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-23 02:25:39] [INFO ] Flatten gal took : 8 ms
[2026-05-23 02:25:39] [INFO ] Applying decomposition
[2026-05-23 02:25:39] [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/graph16016195565055547588.txt' '-o' '/tmp/graph16016195565055547588.bin' '-w' '/tmp/graph16016195565055547588.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16016195565055547588.bin' '-l' '-1' '-v' '-w' '/tmp/graph16016195565055547588.weights' '-q' '0' '-e' '0.001'
[2026-05-23 02:25:39] [INFO ] Decomposing Gal with order
[2026-05-23 02:25:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 02:25:39] [INFO ] Removed a total of 490 redundant transitions.
[2026-05-23 02:25:39] [INFO ] Flatten gal took : 22 ms
[2026-05-23 02:25:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 4 ms.
[2026-05-23 02:25:39] [INFO ] Time to serialize gal into /tmp/CTLFireability15143698696153636210.gal : 5 ms
[2026-05-23 02:25:39] [INFO ] Time to serialize properties into /tmp/CTLFireability4499727534652724764.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/CTLFireability15143698696153636210.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4499727534652724764.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.20336e+30,1.18163,37656,8358,20,50044,485,776,129246,60,877,0


Converting to forward existential form...Done !
original formula: EX((((EF((i3.u24.p101==1)) + EG((i11.u63.p299==1))) + (EG((i14.u74.p362==1)) * A((i12.i1.i1.u116.p650==1) U (i18.u90.p442==1)))) * ((AF((...297
=> equivalent forward existential formula: (([((EY(Init) * ((E(TRUE U (i3.u24.p101==1)) + EG((i11.u63.p299==1))) + (EG((i14.u74.p362==1)) * !((E(!((i18.u90...861
Reverse transition relation is NOT exact ! Due to transitions t6, t35, t64, t108, t168, t228, i0.t400, i1.t386, i2.t369, i3.t351, i3.u20.t353, i4.t337, i5....464
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 484/484 places, 714/714 transitions.
Graph (trivial) has 499 edges and 484 vertex of which 219 / 484 are part of one of the 26 SCC in 2 ms
Free SCC test removed 193 places
Ensure Unique test removed 211 transitions
Reduce isomorphic transitions removed 211 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 290 transition count 424
Reduce places removed 78 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 124 rules applied. Total rules applied 203 place count 212 transition count 378
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 224 place count 191 transition count 378
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 224 place count 191 transition count 376
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 228 place count 189 transition count 376
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 263 place count 154 transition count 324
Iterating global reduction 3 with 35 rules applied. Total rules applied 298 place count 154 transition count 324
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 303 place count 154 transition count 319
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 303 place count 154 transition count 318
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 305 place count 153 transition count 318
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 306 place count 152 transition count 313
Iterating global reduction 4 with 1 rules applied. Total rules applied 307 place count 152 transition count 313
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 308 place count 152 transition count 312
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 5 with 120 rules applied. Total rules applied 428 place count 92 transition count 252
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 441 place count 79 transition count 193
Iterating global reduction 5 with 13 rules applied. Total rules applied 454 place count 79 transition count 193
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 467 place count 79 transition count 180
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 469 place count 77 transition count 178
Applied a total of 469 rules in 54 ms. Remains 77 /484 variables (removed 407) and now considering 178/714 (removed 536) transitions.
[2026-05-23 02:26:09] [INFO ] Flow matrix only has 74 transitions (discarded 104 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17646121644997379254.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8653864572855412702.kers'
[2026-05-23 02:26:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17646121644997379254.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8653864572855412702.kers]
Normalized transition count is 73 out of 74 initially.
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 73 rows 70 cols 184 entries
Finished phase 1 with 50 SingleSign rule and 0 generalized
[2026-05-23 02:26:09] [INFO ] Computed 27 invariants in 0 ms
Computed 27 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8653864572855412702.kers
Total runtime 1 ms.
[2026-05-23 02:26:09] [INFO ] Implicit Places using invariants in 133 ms returned []
[2026-05-23 02:26:09] [INFO ] Flow matrix only has 74 transitions (discarded 104 similar events)
[2026-05-23 02:26:09] [INFO ] Invariant cache hit.
[2026-05-23 02:26:09] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
[2026-05-23 02:26:09] [INFO ] Redundant transitions in 2 ms returned []
Running 104 sub problems to find dead transitions.
[2026-05-23 02:26:09] [INFO ] Flow matrix only has 74 transitions (discarded 104 similar events)
[2026-05-23 02:26:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 2/77 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (OVERLAPS) 73/150 variables, 77/104 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (OVERLAPS) 0/150 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 150/151 variables, and 104 constraints, problems are : Problem set: 0 solved, 104 unsolved in 3332 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 2/77 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (OVERLAPS) 73/150 variables, 77/104 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 104/208 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (OVERLAPS) 0/150 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 150/151 variables, and 208 constraints, problems are : Problem set: 0 solved, 104 unsolved in 3305 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6646ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 6646ms
Starting structural reductions in SI_CTL mode, iteration 1 : 77/484 places, 178/714 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6969 ms. Remains : 77/484 places, 178/714 transitions.
[2026-05-23 02:26:16] [INFO ] Flatten gal took : 3 ms
[2026-05-23 02:26:16] [INFO ] Flatten gal took : 3 ms
[2026-05-23 02:26:16] [INFO ] Input system was already deterministic with 178 transitions.
[2026-05-23 02:26:16] [INFO ] Flatten gal took : 2 ms
RANDOM walk for 381 steps (9 resets) in 7 ms. (47 steps per ms) remains 0/1 properties
FORMULA Champagne-PT-H07T1U-CTLFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-23 02:26:16] [INFO ] Flatten gal took : 2 ms
[2026-05-23 02:26:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5449821154671034573.gal : 0 ms
[2026-05-23 02:26:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14583048273820213653.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/ReachabilityCardinality5449821154671034573.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14583048273820213653.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 : 484/484 places, 714/714 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 424 transition count 654
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 424 transition count 654
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 153 place count 391 transition count 621
Iterating global reduction 0 with 33 rules applied. Total rules applied 186 place count 391 transition count 621
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 201 place count 376 transition count 606
Iterating global reduction 0 with 15 rules applied. Total rules applied 216 place count 376 transition count 606
Applied a total of 216 rules in 18 ms. Remains 376 /484 variables (removed 108) and now considering 606/714 (removed 108) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13776747863431213134.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3516566459349886750.kers'
[2026-05-23 02:26:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13776747863431213134.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3516566459349886750.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 606 rows 376 cols 1662 entries
Finished phase 1 with 349 SingleSign rule and 0 generalized
[2026-05-23 02:26:16] [INFO ] Computed 27 invariants in 2 ms
Computed 27 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-3516566459349886750.kers
Total runtime 3 ms.
[2026-05-23 02:26:16] [INFO ] Implicit Places using invariants in 133 ms returned []
[2026-05-23 02:26:16] [INFO ] Invariant cache hit.
[2026-05-23 02:26:17] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 479 ms to find 0 implicit places.
Running 605 sub problems to find dead transitions.
[2026-05-23 02:26:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/375 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 1 (OVERLAPS) 1/376 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 3 (OVERLAPS) 606/982 variables, 376/403 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 982/982 variables, and 403 constraints, problems are : Problem set: 0 solved, 605 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 376/376 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/375 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 1 (OVERLAPS) 1/376 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 3 (OVERLAPS) 606/982 variables, 376/403 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/982 variables, 605/1008 constraints. Problems are: Problem set: 0 solved, 605 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 982/982 variables, and 1009 constraints, problems are : Problem set: 0 solved, 605 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 376/376 constraints, PredecessorRefiner: 605/605 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60107ms problems are : Problem set: 0 solved, 605 unsolved
Search for dead transitions found 0 dead transitions in 60108ms
Starting structural reductions in LTL mode, iteration 1 : 376/484 places, 606/714 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60608 ms. Remains : 376/484 places, 606/714 transitions.
[2026-05-23 02:27:17] [INFO ] Flatten gal took : 7 ms
[2026-05-23 02:27:17] [INFO ] Flatten gal took : 18 ms
[2026-05-23 02:27:17] [INFO ] Input system was already deterministic with 606 transitions.
[2026-05-23 02:27:17] [INFO ] Flatten gal took : 8 ms
[2026-05-23 02:27:17] [INFO ] Flatten gal took : 8 ms
[2026-05-23 02:27:17] [INFO ] Time to serialize gal into /tmp/CTLFireability9724097838780628736.gal : 2 ms
[2026-05-23 02:27:17] [INFO ] Time to serialize properties into /tmp/CTLFireability14528013394404720432.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/CTLFireability9724097838780628736.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14528013394404720432.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-23 02:27:47] [INFO ] Flatten gal took : 9 ms
[2026-05-23 02:27:47] [INFO ] Applying decomposition
[2026-05-23 02:27:47] [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/graph13010769837046618428.txt' '-o' '/tmp/graph13010769837046618428.bin' '-w' '/tmp/graph13010769837046618428.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13010769837046618428.bin' '-l' '-1' '-v' '-w' '/tmp/graph13010769837046618428.weights' '-q' '0' '-e' '0.001'
[2026-05-23 02:27:47] [INFO ] Decomposing Gal with order
[2026-05-23 02:27:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 02:27:47] [INFO ] Removed a total of 488 redundant transitions.
[2026-05-23 02:27:47] [INFO ] Flatten gal took : 20 ms
[2026-05-23 02:27:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 3 ms.
[2026-05-23 02:27:47] [INFO ] Time to serialize gal into /tmp/CTLFireability14624228512617067933.gal : 5 ms
[2026-05-23 02:27:47] [INFO ] Time to serialize properties into /tmp/CTLFireability12443543953847100109.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/CTLFireability14624228512617067933.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12443543953847100109.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.0715e+30,1.11793,37660,8316,20,48768,563,818,130838,57,1138,0


Converting to forward existential form...Done !
original formula: AF(((AX(AG(AX((i23.u104.p570==1)))) + E((i24.u111.p596==1) U ((((((i0.i1.u7.p9==1)&&(i1.i1.u12.p34==1))&&((i3.i1.u17.p59==1)&&(i4.i1.u22....813
=> equivalent forward existential formula: [FwdG(Init,!(((!(EX(!(!(E(TRUE U !(!(EX(!((i23.u104.p570==1)))))))))) + E((i24.u111.p596==1) U ((((((i0.i1.u7.p9...900
Reverse transition relation is NOT exact ! Due to transitions t6, t35, t85, t114, t173, t232, i0.i1.t400, i1.i1.t386, i3.i1.t371, i4.i1.t356, i5.i1.t341, i...475
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
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
Detected timeout of ITS tools.
[2026-05-23 02:28:17] [INFO ] Flatten gal took : 10 ms
[2026-05-23 02:28:17] [INFO ] Flatten gal took : 9 ms
[2026-05-23 02:28:17] [INFO ] Applying decomposition
[2026-05-23 02:28:17] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph9163969961251129626.txt' '-o' '/tmp/graph9163969961251129626.bin' '-w' '/tmp/graph9163969961251129626.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9163969961251129626.bin' '-l' '-1' '-v' '-w' '/tmp/graph9163969961251129626.weights' '-q' '0' '-e' '0.001'
[2026-05-23 02:28:17] [INFO ] Decomposing Gal with order
[2026-05-23 02:28:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 02:28:17] [INFO ] Removed a total of 474 redundant transitions.
[2026-05-23 02:28:17] [INFO ] Flatten gal took : 30 ms
[2026-05-23 02:28:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 3 ms.
[2026-05-23 02:28:17] [INFO ] Time to serialize gal into /tmp/CTLFireability2364727038434660086.gal : 4 ms
[2026-05-23 02:28:17] [INFO ] Time to serialize properties into /tmp/CTLFireability3362336701079068597.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/CTLFireability2364727038434660086.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3362336701079068597.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 8 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.17106e+33,1.86429,51248,10381,32,82252,642,991,158408,74,1599,0


Converting to forward existential form...Done !
original formula: (EF((AF(((((i18.u118.p449==1)||(i4.u36.p114==1)) + AF((i7.i1.i0.u86.p315==1))) * (((i20.u131.p517==0)||(i24.u150.p578==0))||(((i3.u33.p10...1126
=> equivalent forward existential formula: ((([((FwdU(Init,TRUE) * !(EG(!(((((i18.u118.p449==1)||(i4.u36.p114==1)) + !(EG(!((i7.i1.i0.u86.p315==1))))) * ((...3230
Reverse transition relation is NOT exact ! Due to transitions t44, t100, t160, t177, t283, t341, t374, i0.t498, i1.t480, i1.u11.t475, i2.t460, i3.t436, i3....934
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
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 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
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
(forward)formula 0,1,1333.09,14131464,1,0,2.41431e+07,642,2308,2.98575e+07,141,1599,205598
FORMULA Champagne-PT-H07T1U-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
Detected timeout of ITS tools.
[2026-05-23 02:57:09] [INFO ] Applying decomposition
[2026-05-23 02:57:09] [INFO ] Flatten gal took : 12 ms
[2026-05-23 02:57:09] [INFO ] Decomposing Gal with order
[2026-05-23 02:57:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 02:57:09] [INFO ] Removed a total of 307 redundant transitions.
[2026-05-23 02:57:09] [INFO ] Flatten gal took : 23 ms
[2026-05-23 02:57:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 204 labels/synchronizations in 5 ms.
[2026-05-23 02:57:09] [INFO ] Time to serialize gal into /tmp/CTLFireability4478115098492772605.gal : 4 ms
[2026-05-23 02:57:09] [INFO ] Time to serialize properties into /tmp/CTLFireability10083052587763134822.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/CTLFireability4478115098492772605.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10083052587763134822.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 7 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.17106e+33,0.337242,13252,788,706,14192,3882,615,36401,338,20955,0


Converting to forward existential form...Done !
original formula: E(EF((i1.i1.i1.i0.i0.i0.u36.p442==1)) U ((AX(AG(((i0.i0.u12.p154==1)&&(i1.i0.i0.i0.i0.u19.p198==1)))) + EG(EX(((i1.i0.i0.i0.u21.p259==1)&...403
=> equivalent forward existential formula: (([(FwdU(Init,E(TRUE U (i1.i1.i1.i0.i0.i0.u36.p442==1))) * !(EX(!(!(E(TRUE U !(((i0.i0.u12.p154==1)&&(i1.i0.i0.i...761
Reverse transition relation is NOT exact ! Due to transitions i0.t374, i0.u13.t379, i0.i0.u12.t392, i0.i0.u12.t395, i0.i0.i0.u11.t418, i0.i0.i0.u11.t431, i...1807

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.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="Champagne-PT-H07T1U"
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 Champagne-PT-H07T1U, 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 r050-smll-177946901000082"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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