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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 7.5K Mar 6 10:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Mar 6 10:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 6 10:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 6 10:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 15 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 6 10:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Mar 6 10:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Mar 6 10:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Mar 6 10:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:58 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 108K 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-H05T1U-CTLFireability-2024-00
FORMULA_NAME Champagne-PT-H05T1U-CTLFireability-2024-01
FORMULA_NAME Champagne-PT-H05T1U-CTLFireability-2024-02
FORMULA_NAME Champagne-PT-H05T1U-CTLFireability-2024-03
FORMULA_NAME Champagne-PT-H05T1U-CTLFireability-2024-04
FORMULA_NAME Champagne-PT-H05T1U-CTLFireability-2024-05
FORMULA_NAME Champagne-PT-H05T1U-CTLFireability-2024-06
FORMULA_NAME Champagne-PT-H05T1U-CTLFireability-2024-07
FORMULA_NAME Champagne-PT-H05T1U-CTLFireability-2024-08
FORMULA_NAME Champagne-PT-H05T1U-CTLFireability-2024-09
FORMULA_NAME Champagne-PT-H05T1U-CTLFireability-2024-10
FORMULA_NAME Champagne-PT-H05T1U-CTLFireability-2024-11
FORMULA_NAME Champagne-PT-H05T1U-CTLFireability-2024-12
FORMULA_NAME Champagne-PT-H05T1U-CTLFireability-2024-13
FORMULA_NAME Champagne-PT-H05T1U-CTLFireability-2024-14
FORMULA_NAME Champagne-PT-H05T1U-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779484241008

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-H05T1U
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-22 21:10:43] [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-22 21:10:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 21:10:43] [INFO ] Load time of PNML (sax parser for PT used): 160 ms
[2026-05-22 21:10:43] [INFO ] Transformed 389 places.
[2026-05-22 21:10:43] [INFO ] Transformed 491 transitions.
[2026-05-22 21:10:43] [INFO ] Found NUPN structural information;
[2026-05-22 21:10:43] [INFO ] Parsed PT model containing 389 places and 491 transitions and 1176 arcs in 325 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 20 ms.
Support contains 114 out of 389 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 389/389 places, 491/491 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 326 transition count 428
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 326 transition count 428
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 156 place count 296 transition count 398
Iterating global reduction 0 with 30 rules applied. Total rules applied 186 place count 296 transition count 398
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 191 place count 291 transition count 393
Iterating global reduction 0 with 5 rules applied. Total rules applied 196 place count 291 transition count 393
Applied a total of 196 rules in 143 ms. Remains 291 /389 variables (removed 98) and now considering 393/491 (removed 98) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6791306650528968621.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4352137280699308104.kers'
[2026-05-22 21:10:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6791306650528968621.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4352137280699308104.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 393 rows 291 cols 980 entries
Finished phase 1 with 276 SingleSign rule and 0 generalized
[2026-05-22 21:10:44] [INFO ] Computed 15 invariants in 2 ms
Computed 15 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-4352137280699308104.kers
Total runtime 4 ms.
[2026-05-22 21:10:44] [INFO ] Implicit Places using invariants in 532 ms returned []
[2026-05-22 21:10:44] [INFO ] Invariant cache hit.
[2026-05-22 21:10:45] [INFO ] Implicit Places using invariants and state equation in 507 ms returned []
Implicit Place search using SMT with State Equation took 1112 ms to find 0 implicit places.
Running 392 sub problems to find dead transitions.
[2026-05-22 21:10:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/290 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (OVERLAPS) 1/291 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/291 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/291 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 4 (OVERLAPS) 393/684 variables, 291/308 constraints. Problems are: Problem set: 0 solved, 392 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 684/684 variables, and 308 constraints, problems are : Problem set: 0 solved, 392 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 291/291 constraints, PredecessorRefiner: 392/392 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 392 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/290 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (OVERLAPS) 1/291 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/291 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/291 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 4 (OVERLAPS) 393/684 variables, 291/308 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/684 variables, 392/700 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/684 variables, 11/711 constraints. Problems are: Problem set: 0 solved, 392 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 684/684 variables, and 712 constraints, problems are : Problem set: 0 solved, 392 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 291/291 constraints, PredecessorRefiner: 392/392 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60322ms problems are : Problem set: 0 solved, 392 unsolved
Search for dead transitions found 0 dead transitions in 60363ms
Starting structural reductions in LTL mode, iteration 1 : 291/389 places, 393/491 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61702 ms. Remains : 291/389 places, 393/491 transitions.
Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 393/393 transitions.
Applied a total of 0 rules in 9 ms. Remains 291 /291 variables (removed 0) and now considering 393/393 (removed 0) transitions.
[2026-05-22 21:11:45] [INFO ] Invariant cache hit.
[2026-05-22 21:11:45] [INFO ] Implicit Places using invariants in 173 ms returned []
[2026-05-22 21:11:45] [INFO ] Invariant cache hit.
[2026-05-22 21:11:46] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 583 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 594 ms. Remains : 291/291 places, 393/393 transitions.
Support contains 114 out of 291 places after structural reductions.
[2026-05-22 21:11:46] [INFO ] Flatten gal took : 118 ms
[2026-05-22 21:11:46] [INFO ] Flatten gal took : 49 ms
[2026-05-22 21:11:47] [INFO ] Input system was already deterministic with 393 transitions.
Support contains 113 out of 291 places (down from 114) after GAL structural reductions.
RANDOM walk for 40000 steps (166 resets) in 2906 ms. (13 steps per ms) remains 6/88 properties
BEST_FIRST walk for 40004 steps (13 resets) in 278 ms. (143 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40002 steps (16 resets) in 209 ms. (190 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (13 resets) in 209 ms. (190 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (12 resets) in 142 ms. (279 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (17 resets) in 113 ms. (350 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (18 resets) in 135 ms. (294 steps per ms) remains 4/4 properties
[2026-05-22 21:11:48] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp4 is UNSAT
At refinement iteration 1 (OVERLAPS) 175/186 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 105/291 variables, 6/15 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/291 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 393/684 variables, 291/306 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/684 variables, 0/306 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/684 variables, 0/306 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 684/684 variables, and 306 constraints, problems are : Problem set: 1 solved, 3 unsolved in 369 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 291/291 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem AtomicPropp21 is UNSAT
At refinement iteration 1 (OVERLAPS) 131/140 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 151/291 variables, 8/15 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/291 variables, 0/15 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 393/684 variables, 291/306 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/684 variables, 2/308 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/684 variables, 0/308 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/684 variables, 0/308 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 684/684 variables, and 308 constraints, problems are : Problem set: 2 solved, 2 unsolved in 432 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 291/291 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 814ms problems are : Problem set: 2 solved, 2 unsolved
Finished Parikh walk after 178 steps, including 1 resets, run visited all 2 properties in 8 ms. (steps per millisecond=22 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 17 ms.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2026-05-22 21:11:49] [INFO ] Flatten gal took : 33 ms
[2026-05-22 21:11:49] [INFO ] Flatten gal took : 33 ms
[2026-05-22 21:11:49] [INFO ] Input system was already deterministic with 393 transitions.
Computed a total of 35 stabilizing places and 35 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 393/393 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 243 transition count 345
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 243 transition count 345
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 121 place count 218 transition count 320
Iterating global reduction 0 with 25 rules applied. Total rules applied 146 place count 218 transition count 320
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 154 place count 210 transition count 312
Iterating global reduction 0 with 8 rules applied. Total rules applied 162 place count 210 transition count 312
Applied a total of 162 rules in 28 ms. Remains 210 /291 variables (removed 81) and now considering 312/393 (removed 81) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-960432927684673506.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10671307838371498804.kers'
[2026-05-22 21:11:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-960432927684673506.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10671307838371498804.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 312 rows 210 cols 818 entries
Finished phase 1 with 195 SingleSign rule and 0 generalized
[2026-05-22 21:11:49] [INFO ] Computed 15 invariants in 2 ms
Computed 15 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10671307838371498804.kers
Total runtime 3 ms.
[2026-05-22 21:11:49] [INFO ] Implicit Places using invariants in 124 ms returned []
[2026-05-22 21:11:49] [INFO ] Invariant cache hit.
[2026-05-22 21:11:49] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
Running 311 sub problems to find dead transitions.
[2026-05-22 21:11:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (OVERLAPS) 1/210 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 3 (OVERLAPS) 312/522 variables, 210/225 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/522 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 522/522 variables, and 225 constraints, problems are : Problem set: 0 solved, 311 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 311 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (OVERLAPS) 1/210 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 3 (OVERLAPS) 312/522 variables, 210/225 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/522 variables, 311/536 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/522 variables, 1/537 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 4/541 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/522 variables, 1/542 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 522/522 variables, and 542 constraints, problems are : Problem set: 0 solved, 311 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60106ms problems are : Problem set: 0 solved, 311 unsolved
Search for dead transitions found 0 dead transitions in 60110ms
Starting structural reductions in LTL mode, iteration 1 : 210/291 places, 312/393 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60549 ms. Remains : 210/291 places, 312/393 transitions.
[2026-05-22 21:12:49] [INFO ] Flatten gal took : 29 ms
[2026-05-22 21:12:49] [INFO ] Flatten gal took : 26 ms
[2026-05-22 21:12:49] [INFO ] Input system was already deterministic with 312 transitions.
[2026-05-22 21:12:50] [INFO ] Flatten gal took : 24 ms
[2026-05-22 21:12:50] [INFO ] Flatten gal took : 23 ms
[2026-05-22 21:12:50] [INFO ] Time to serialize gal into /tmp/CTLFireability9294162256024498555.gal : 16 ms
[2026-05-22 21:12:50] [INFO ] Time to serialize properties into /tmp/CTLFireability9964371839030031877.ctl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9294162256024498555.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9964371839030031877.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.43479e+16,0.253571,7412,2,1172,5,14997,6,0,1154,13261,0


Converting to forward existential form...Done !
original formula: (E(!(((p252==1)&&(((p51==1)&&(p188==1))||((p162==1)&&(p358==1))))) U E(AG(!(AX((p91==1)))) U EG(AF(((p76==1)&&(p119==1)))))) + AX((p75==1...158
=> equivalent forward existential formula: [(EY((Init * !(E(!(((p252==1)&&(((p51==1)&&(p188==1))||((p162==1)&&(p358==1))))) U E(!(E(TRUE U !(!(!(EX(!((p91=...232
Reverse transition relation is NOT exact ! Due to transitions t4, t34, t39, t53, t63, t68, t84, t100, t110, t115, t130, t138, t146, t160, t170, t175, t190,...268
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2026-05-22 21:13:20] [INFO ] Flatten gal took : 13 ms
[2026-05-22 21:13:20] [INFO ] Applying decomposition
[2026-05-22 21:13:20] [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/graph6620188421692140023.txt' '-o' '/tmp/graph6620188421692140023.bin' '-w' '/tmp/graph6620188421692140023.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6620188421692140023.bin' '-l' '-1' '-v' '-w' '/tmp/graph6620188421692140023.weights' '-q' '0' '-e' '0.001'
[2026-05-22 21:13:20] [INFO ] Decomposing Gal with order
[2026-05-22 21:13:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 21:13:20] [INFO ] Removed a total of 225 redundant transitions.
[2026-05-22 21:13:20] [INFO ] Flatten gal took : 114 ms
[2026-05-22 21:13:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 21 ms.
[2026-05-22 21:13:20] [INFO ] Time to serialize gal into /tmp/CTLFireability3841625648782462520.gal : 21 ms
[2026-05-22 21:13:20] [INFO ] Time to serialize properties into /tmp/CTLFireability12493271899316336594.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/CTLFireability3841625648782462520.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12493271899316336594.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,5.43479e+16,0.148769,6696,518,25,4146,632,552,5111,68,1424,0


Converting to forward existential form...Done !
original formula: (E(!(((i10.i2.u45.p252==1)&&(((i1.i1.u7.p51==1)&&(i8.u31.p188==1))||((i7.i1.u26.p162==1)&&(i14.i1.u63.p358==1))))) U E(AG(!(AX((i3.u13.p9...242
=> equivalent forward existential formula: [(EY((Init * !(E(!(((i10.i2.u45.p252==1)&&(((i1.i1.u7.p51==1)&&(i8.u31.p188==1))||((i7.i1.u26.p162==1)&&(i14.i1....316
Reverse transition relation is NOT exact ! Due to transitions t4, t34, t63, t110, t170, i0.t219, i1.i1.u7.t205, i2.i1.t190, i3.t175, i5.t160, i6.t146, i7.i...332
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 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
(forward)formula 0,1,7.67779,204216,1,0,369093,944,3631,552966,352,2252,487652
FORMULA Champagne-PT-H05T1U-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 291/291 places, 393/393 transitions.
Graph (trivial) has 292 edges and 291 vertex of which 115 / 291 are part of one of the 15 SCC in 4 ms
Free SCC test removed 100 places
Ensure Unique test removed 109 transitions
Reduce isomorphic transitions removed 109 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 190 transition count 225
Reduce places removed 58 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 84 rules applied. Total rules applied 143 place count 132 transition count 199
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 14 rules applied. Total rules applied 157 place count 119 transition count 198
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 158 place count 118 transition count 198
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 158 place count 118 transition count 197
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 160 place count 117 transition count 197
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 185 place count 92 transition count 160
Iterating global reduction 4 with 25 rules applied. Total rules applied 210 place count 92 transition count 160
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 214 place count 92 transition count 156
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 214 place count 92 transition count 155
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 216 place count 91 transition count 155
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 219 place count 88 transition count 144
Iterating global reduction 5 with 3 rules applied. Total rules applied 222 place count 88 transition count 144
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 225 place count 88 transition count 141
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 6 with 62 rules applied. Total rules applied 287 place count 57 transition count 110
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 289 place count 55 transition count 105
Iterating global reduction 6 with 2 rules applied. Total rules applied 291 place count 55 transition count 105
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 293 place count 55 transition count 103
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 295 place count 53 transition count 101
Applied a total of 295 rules in 69 ms. Remains 53 /291 variables (removed 238) and now considering 101/393 (removed 292) transitions.
[2026-05-22 21:13:28] [INFO ] Flow matrix only has 56 transitions (discarded 45 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-851832487043974076.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9632896789043555466.kers'
[2026-05-22 21:13:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-851832487043974076.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9632896789043555466.kers]
Normalized transition count is 55 out of 56 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 55 rows 50 cols 133 entries
Finished phase 1 with 38 SingleSign rule and 0 generalized
[2026-05-22 21:13:28] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9632896789043555466.kers
Total runtime 4 ms.
[2026-05-22 21:13:28] [INFO ] Implicit Places using invariants in 95 ms returned []
[2026-05-22 21:13:28] [INFO ] Flow matrix only has 56 transitions (discarded 45 similar events)
[2026-05-22 21:13:28] [INFO ] Invariant cache hit.
[2026-05-22 21:13:28] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-22 21:13:28] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2026-05-22 21:13:28] [INFO ] Redundant transitions in 4 ms returned []
Running 63 sub problems to find dead transitions.
[2026-05-22 21:13:28] [INFO ] Flow matrix only has 56 transitions (discarded 45 similar events)
[2026-05-22 21:13:28] [INFO ] Invariant cache hit.
[2026-05-22 21:13:28] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (OVERLAPS) 3/53 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 55/108 variables, 53/68 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 0/108 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 108/109 variables, and 71 constraints, problems are : Problem set: 0 solved, 63 unsolved in 2397 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 53/53 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (OVERLAPS) 3/53 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 55/108 variables, 53/68 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 63/134 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (OVERLAPS) 0/108 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 108/109 variables, and 134 constraints, problems are : Problem set: 0 solved, 63 unsolved in 2463 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 53/53 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4880ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 4882ms
Starting structural reductions in SI_CTL mode, iteration 1 : 53/291 places, 101/393 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5179 ms. Remains : 53/291 places, 101/393 transitions.
[2026-05-22 21:13:33] [INFO ] Flatten gal took : 9 ms
[2026-05-22 21:13:33] [INFO ] Flatten gal took : 8 ms
[2026-05-22 21:13:33] [INFO ] Input system was already deterministic with 101 transitions.
[2026-05-22 21:13:33] [INFO ] Flatten gal took : 7 ms
[2026-05-22 21:13:33] [INFO ] Flatten gal took : 7 ms
[2026-05-22 21:13:33] [INFO ] Time to serialize gal into /tmp/CTLFireability12047929632364921526.gal : 1 ms
[2026-05-22 21:13:33] [INFO ] Time to serialize properties into /tmp/CTLFireability4878848886325704019.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/CTLFireability12047929632364921526.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4878848886325704019.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.
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,4.78691e+07,0.027288,4404,2,95,5,869,6,0,300,497,0


Converting to forward existential form...Done !
original formula: A(AF(E(AG((p62==1)) U (EG((p313==1)) + E((p122==1) U (p336==1))))) U (p351==1))
=> equivalent forward existential formula: [((Init * !(EG(!((p351==1))))) * !(E(!((p351==1)) U (!(!(EG(!(E(!(E(TRUE U !((p62==1)))) U (EG((p313==1)) + E((p...210
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 99/0/2
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 98/0/3
Hit Full ! (commute/partial/dont) 98/0/3
(forward)formula 0,0,0.288985,9356,1,0,91,28178,49,59,1541,34088,71
FORMULA Champagne-PT-H05T1U-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 291/291 places, 393/393 transitions.
Graph (trivial) has 294 edges and 291 vertex of which 114 / 291 are part of one of the 14 SCC in 2 ms
Free SCC test removed 100 places
Ensure Unique test removed 110 transitions
Reduce isomorphic transitions removed 110 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 190 transition count 221
Reduce places removed 61 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 87 rules applied. Total rules applied 149 place count 129 transition count 195
Reduce places removed 13 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 16 rules applied. Total rules applied 165 place count 116 transition count 192
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 168 place count 113 transition count 192
Discarding 26 places :
Symmetric choice reduction at 4 with 26 rule applications. Total rules 194 place count 87 transition count 157
Iterating global reduction 4 with 26 rules applied. Total rules applied 220 place count 87 transition count 157
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 223 place count 87 transition count 154
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 226 place count 84 transition count 142
Iterating global reduction 5 with 3 rules applied. Total rules applied 229 place count 84 transition count 142
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 232 place count 84 transition count 139
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 6 with 64 rules applied. Total rules applied 296 place count 52 transition count 107
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 299 place count 49 transition count 100
Iterating global reduction 6 with 3 rules applied. Total rules applied 302 place count 49 transition count 100
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 305 place count 49 transition count 97
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 306 place count 49 transition count 96
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 308 place count 47 transition count 94
Applied a total of 308 rules in 72 ms. Remains 47 /291 variables (removed 244) and now considering 94/393 (removed 299) transitions.
[2026-05-22 21:13:33] [INFO ] Flow matrix only has 54 transitions (discarded 40 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2806743078544284318.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9701951204796547605.kers'
[2026-05-22 21:13:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2806743078544284318.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9701951204796547605.kers]
Normalized transition count is 53 out of 54 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 53 rows 44 cols 138 entries
Finished phase 1 with 32 SingleSign rule and 0 generalized
[2026-05-22 21:13:33] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9701951204796547605.kers
Total runtime 1 ms.
[2026-05-22 21:13:34] [INFO ] Implicit Places using invariants in 91 ms returned []
[2026-05-22 21:13:34] [INFO ] Flow matrix only has 54 transitions (discarded 40 similar events)
[2026-05-22 21:13:34] [INFO ] Invariant cache hit.
[2026-05-22 21:13:34] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2026-05-22 21:13:34] [INFO ] Redundant transitions in 3 ms returned []
Running 53 sub problems to find dead transitions.
[2026-05-22 21:13:34] [INFO ] Flow matrix only has 54 transitions (discarded 40 similar events)
[2026-05-22 21:13:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 3/47 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (OVERLAPS) 53/100 variables, 47/62 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (OVERLAPS) 0/100 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 100/101 variables, and 62 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1642 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 47/47 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 3/47 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (OVERLAPS) 53/100 variables, 47/62 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 53/115 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 0/100 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 100/101 variables, and 115 constraints, problems are : Problem set: 0 solved, 53 unsolved in 2007 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 47/47 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3662ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 3662ms
Starting structural reductions in SI_CTL mode, iteration 1 : 47/291 places, 94/393 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3932 ms. Remains : 47/291 places, 94/393 transitions.
[2026-05-22 21:13:37] [INFO ] Flatten gal took : 3 ms
[2026-05-22 21:13:37] [INFO ] Flatten gal took : 4 ms
[2026-05-22 21:13:37] [INFO ] Input system was already deterministic with 94 transitions.
[2026-05-22 21:13:37] [INFO ] Flatten gal took : 4 ms
[2026-05-22 21:13:37] [INFO ] Flatten gal took : 5 ms
[2026-05-22 21:13:37] [INFO ] Time to serialize gal into /tmp/CTLFireability6152472018684653729.gal : 1 ms
[2026-05-22 21:13:37] [INFO ] Time to serialize properties into /tmp/CTLFireability14739573034534897851.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/CTLFireability6152472018684653729.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14739573034534897851.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.
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.51165e+07,0.015428,4368,2,80,5,756,6,0,271,430,0


Converting to forward existential form...Done !
original formula: A(AF(AG((p302==1))) U ((p76==1)&&(p144==1)))
=> equivalent forward existential formula: [((Init * !(EG(!(((p76==1)&&(p144==1)))))) * !(E(!(((p76==1)&&(p144==1))) U (!(!(EG(!(!(E(TRUE U !((p302==1)))))...199
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 82/0/12
Hit Full ! (commute/partial/dont) 82/0/12
(forward)formula 0,0,0.06058,5416,1,0,14,7907,27,11,1352,6435,17
FORMULA Champagne-PT-H05T1U-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 393/393 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 246 transition count 348
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 246 transition count 348
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 114 place count 222 transition count 324
Iterating global reduction 0 with 24 rules applied. Total rules applied 138 place count 222 transition count 324
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 146 place count 214 transition count 316
Iterating global reduction 0 with 8 rules applied. Total rules applied 154 place count 214 transition count 316
Applied a total of 154 rules in 13 ms. Remains 214 /291 variables (removed 77) and now considering 316/393 (removed 77) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4056606399878797690.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1202221238621605628.kers'
[2026-05-22 21:13:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4056606399878797690.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1202221238621605628.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 316 rows 214 cols 826 entries
Finished phase 1 with 199 SingleSign rule and 0 generalized
[2026-05-22 21:13:37] [INFO ] Computed 15 invariants in 1 ms
Computed 15 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1202221238621605628.kers
Total runtime 2 ms.
[2026-05-22 21:13:38] [INFO ] Implicit Places using invariants in 90 ms returned []
[2026-05-22 21:13:38] [INFO ] Invariant cache hit.
[2026-05-22 21:13:38] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
Running 315 sub problems to find dead transitions.
[2026-05-22 21:13:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (OVERLAPS) 1/214 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 3 (OVERLAPS) 316/530 variables, 214/229 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/530 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 315 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 530/530 variables, and 229 constraints, problems are : Problem set: 0 solved, 315 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 315 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (OVERLAPS) 1/214 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 3 (OVERLAPS) 316/530 variables, 214/229 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/530 variables, 315/544 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/530 variables, 2/546 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/530 variables, 2/548 constraints. Problems are: Problem set: 0 solved, 315 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 530/530 variables, and 548 constraints, problems are : Problem set: 0 solved, 315 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60106ms problems are : Problem set: 0 solved, 315 unsolved
Search for dead transitions found 0 dead transitions in 60108ms
Starting structural reductions in LTL mode, iteration 1 : 214/291 places, 316/393 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60506 ms. Remains : 214/291 places, 316/393 transitions.
[2026-05-22 21:14:38] [INFO ] Flatten gal took : 17 ms
[2026-05-22 21:14:38] [INFO ] Flatten gal took : 15 ms
[2026-05-22 21:14:38] [INFO ] Input system was already deterministic with 316 transitions.
[2026-05-22 21:14:38] [INFO ] Flatten gal took : 15 ms
[2026-05-22 21:14:38] [INFO ] Flatten gal took : 15 ms
[2026-05-22 21:14:38] [INFO ] Time to serialize gal into /tmp/CTLFireability1230091746207707135.gal : 5 ms
[2026-05-22 21:14:38] [INFO ] Time to serialize properties into /tmp/CTLFireability4047218168285642803.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/CTLFireability1230091746207707135.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4047218168285642803.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,7.25705e+16,0.224752,7268,2,1133,5,14167,6,0,1174,11795,0


Converting to forward existential form...Done !
original formula: (EX((EX(EF((p205==0))) * A((!(A((p22==1) U (p322==1))) + (((p91==1)&&(p361==1))&&((p29==1)||(p155==1)))) U AX(AF((p337==1)))))) * EG((AF(...184
=> equivalent forward existential formula: [FwdG((Init * EX((EX(E(TRUE U (p205==0))) * !((E(!(!(EX(!(!(EG(!((p337==1)))))))) U (!((!(!((E(!((p322==1)) U (!...385
Reverse transition relation is NOT exact ! Due to transitions t4, t35, t41, t47, t58, t68, t73, t88, t102, t112, t117, t132, t147, t162, t177, t192, t207, ...261
Detected timeout of ITS tools.
[2026-05-22 21:15:08] [INFO ] Flatten gal took : 10 ms
[2026-05-22 21:15:08] [INFO ] Applying decomposition
[2026-05-22 21:15:08] [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/graph5654310478797439354.txt' '-o' '/tmp/graph5654310478797439354.bin' '-w' '/tmp/graph5654310478797439354.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5654310478797439354.bin' '-l' '-1' '-v' '-w' '/tmp/graph5654310478797439354.weights' '-q' '0' '-e' '0.001'
[2026-05-22 21:15:08] [INFO ] Decomposing Gal with order
[2026-05-22 21:15:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 21:15:08] [INFO ] Removed a total of 205 redundant transitions.
[2026-05-22 21:15:08] [INFO ] Flatten gal took : 27 ms
[2026-05-22 21:15:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 14 ms.
[2026-05-22 21:15:08] [INFO ] Time to serialize gal into /tmp/CTLFireability18332121990465249051.gal : 6 ms
[2026-05-22 21:15:08] [INFO ] Time to serialize properties into /tmp/CTLFireability6872665070974968000.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/CTLFireability18332121990465249051.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6872665070974968000.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.25705e+16,0.084346,6084,262,27,3091,799,596,3702,71,1949,0


Converting to forward existential form...Done !
original formula: (EX((EX(EF((i7.u31.p205==0))) * A((!(A((i1.u2.p22==1) U (i13.i1.u56.p322==1))) + (((i3.i0.u14.p91==1)&&(i8.i1.u64.p361==1))&&((i0.u5.p29=...276
=> equivalent forward existential formula: [FwdG((Init * EX((EX(E(TRUE U (i7.u31.p205==0))) * !((E(!(!(EX(!(!(EG(!((i13.i0.u54.p337==1)))))))) U (!((!(!((E...521
Reverse transition relation is NOT exact ! Due to transitions t4, t35, t68, t112, i0.u7.t207, i1.u2.t220, i2.i2.u11.t192, i3.i1.u15.t177, i4.i1.t162, i5.i0...351
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
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
(forward)formula 0,0,3.46944,92524,1,0,167095,799,3902,269736,397,1949,190442
FORMULA Champagne-PT-H05T1U-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 393/393 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 242 transition count 344
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 242 transition count 344
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 123 place count 217 transition count 319
Iterating global reduction 0 with 25 rules applied. Total rules applied 148 place count 217 transition count 319
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 156 place count 209 transition count 311
Iterating global reduction 0 with 8 rules applied. Total rules applied 164 place count 209 transition count 311
Applied a total of 164 rules in 12 ms. Remains 209 /291 variables (removed 82) and now considering 311/393 (removed 82) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7727964995784898535.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16115093138146484506.kers'
[2026-05-22 21:15:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7727964995784898535.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16115093138146484506.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 311 rows 209 cols 816 entries
Finished phase 1 with 194 SingleSign rule and 0 generalized
[2026-05-22 21:15:12] [INFO ] Computed 15 invariants in 1 ms
Computed 15 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16115093138146484506.kers
Total runtime 2 ms.
[2026-05-22 21:15:12] [INFO ] Implicit Places using invariants in 108 ms returned []
[2026-05-22 21:15:12] [INFO ] Invariant cache hit.
[2026-05-22 21:15:12] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
Running 310 sub problems to find dead transitions.
[2026-05-22 21:15:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (OVERLAPS) 1/209 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (OVERLAPS) 311/520 variables, 209/224 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/520 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (OVERLAPS) 0/520 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 310 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 224 constraints, problems are : Problem set: 0 solved, 310 unsolved in 27809 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 310 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (OVERLAPS) 1/209 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (OVERLAPS) 311/520 variables, 209/224 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/520 variables, 310/534 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 2/536 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/520 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 310 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 520/520 variables, and 537 constraints, problems are : Problem set: 0 solved, 310 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 57882ms problems are : Problem set: 0 solved, 310 unsolved
Search for dead transitions found 0 dead transitions in 57883ms
Starting structural reductions in LTL mode, iteration 1 : 209/291 places, 311/393 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58335 ms. Remains : 209/291 places, 311/393 transitions.
[2026-05-22 21:16:10] [INFO ] Flatten gal took : 13 ms
[2026-05-22 21:16:10] [INFO ] Flatten gal took : 13 ms
[2026-05-22 21:16:10] [INFO ] Input system was already deterministic with 311 transitions.
[2026-05-22 21:16:10] [INFO ] Flatten gal took : 13 ms
[2026-05-22 21:16:10] [INFO ] Flatten gal took : 11 ms
[2026-05-22 21:16:10] [INFO ] Time to serialize gal into /tmp/CTLFireability1665412626057363277.gal : 4 ms
[2026-05-22 21:16:10] [INFO ] Time to serialize properties into /tmp/CTLFireability6089730499019403616.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/CTLFireability1665412626057363277.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6089730499019403616.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.07457e+16,0.226445,7152,2,1044,5,13667,6,0,1149,11331,0


Converting to forward existential form...Done !
original formula: AG((((p278==1) + AF(AX(((p233==1)&&(p299==1))))) + AF(AX((p388==1)))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !(((p278==1) + !(EG(!(!(EX(!(((p233==1)&&(p299==1))))))))))),!(!(EX(!((p388==1))))))] =...161
Reverse transition relation is NOT exact ! Due to transitions t4, t35, t40, t54, t64, t69, t86, t100, t110, t115, t130, t145, t159, t174, t189, t204, t218,...256
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,1.5861,36996,1,0,468,183806,654,278,7179,143043,679
FORMULA Champagne-PT-H05T1U-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 393/393 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 241 transition count 343
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 241 transition count 343
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 127 place count 214 transition count 316
Iterating global reduction 0 with 27 rules applied. Total rules applied 154 place count 214 transition count 316
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 163 place count 205 transition count 307
Iterating global reduction 0 with 9 rules applied. Total rules applied 172 place count 205 transition count 307
Applied a total of 172 rules in 16 ms. Remains 205 /291 variables (removed 86) and now considering 307/393 (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-1459935229296624434.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13475770428132012128.kers'
[2026-05-22 21:16:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1459935229296624434.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13475770428132012128.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 307 rows 205 cols 808 entries
Finished phase 1 with 190 SingleSign rule and 0 generalized
[2026-05-22 21:16:12] [INFO ] Computed 15 invariants in 2 ms
Computed 15 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-13475770428132012128.kers
Total runtime 4 ms.
[2026-05-22 21:16:12] [INFO ] Implicit Places using invariants in 164 ms returned []
[2026-05-22 21:16:12] [INFO ] Invariant cache hit.
[2026-05-22 21:16:12] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 498 ms to find 0 implicit places.
Running 306 sub problems to find dead transitions.
[2026-05-22 21:16:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (OVERLAPS) 307/512 variables, 205/220 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/512 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 512/512 variables, and 220 constraints, problems are : Problem set: 0 solved, 306 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 306 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (OVERLAPS) 307/512 variables, 205/220 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/512 variables, 306/526 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/512 variables, 1/527 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 2/529 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 1/530 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 512/512 variables, and 530 constraints, problems are : Problem set: 0 solved, 306 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60074ms problems are : Problem set: 0 solved, 306 unsolved
Search for dead transitions found 0 dead transitions in 60076ms
Starting structural reductions in LTL mode, iteration 1 : 205/291 places, 307/393 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60591 ms. Remains : 205/291 places, 307/393 transitions.
[2026-05-22 21:17:12] [INFO ] Flatten gal took : 6 ms
[2026-05-22 21:17:12] [INFO ] Flatten gal took : 6 ms
[2026-05-22 21:17:12] [INFO ] Input system was already deterministic with 307 transitions.
[2026-05-22 21:17:12] [INFO ] Flatten gal took : 11 ms
[2026-05-22 21:17:12] [INFO ] Flatten gal took : 6 ms
[2026-05-22 21:17:12] [INFO ] Time to serialize gal into /tmp/CTLFireability17695914362433923755.gal : 2 ms
[2026-05-22 21:17:12] [INFO ] Time to serialize properties into /tmp/CTLFireability4148432775758266555.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/CTLFireability17695914362433923755.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4148432775758266555.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.
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.81481e+16,0.12642,7032,2,1030,5,13306,6,0,1129,10935,0


Converting to forward existential form...Done !
original formula: AG(AX(!(E(EX((p248==1)) U (((p335==1)&&(p369==1))||(p65==1))))))
=> equivalent forward existential formula: [(FwdU(EY(FwdU(Init,TRUE)),EX((p248==1))) * (((p335==1)&&(p369==1))||(p65==1)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t33, t38, t52, t62, t67, t82, t96, t106, t111, t126, t141, t155, t170, t185, t200, t214, ...255
(forward)formula 0,0,1.16323,33204,1,0,429,161843,635,251,6796,120218,627
FORMULA Champagne-PT-H05T1U-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 393/393 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 243 transition count 345
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 243 transition count 345
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 120 place count 219 transition count 321
Iterating global reduction 0 with 24 rules applied. Total rules applied 144 place count 219 transition count 321
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 152 place count 211 transition count 313
Iterating global reduction 0 with 8 rules applied. Total rules applied 160 place count 211 transition count 313
Applied a total of 160 rules in 12 ms. Remains 211 /291 variables (removed 80) and now considering 313/393 (removed 80) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6410411327076299079.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1219391702321667015.kers'
[2026-05-22 21:17:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6410411327076299079.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1219391702321667015.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 313 rows 211 cols 820 entries
Finished phase 1 with 196 SingleSign rule and 0 generalized
[2026-05-22 21:17:14] [INFO ] Computed 15 invariants in 1 ms
Computed 15 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1219391702321667015.kers
Total runtime 2 ms.
[2026-05-22 21:17:14] [INFO ] Implicit Places using invariants in 99 ms returned []
[2026-05-22 21:17:14] [INFO ] Invariant cache hit.
[2026-05-22 21:17:14] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
Running 312 sub problems to find dead transitions.
[2026-05-22 21:17:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (OVERLAPS) 1/211 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 3 (OVERLAPS) 313/524 variables, 211/226 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/524 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 5 (OVERLAPS) 0/524 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 312 unsolved
No progress, stopping.
After SMT solving in domain Real declared 524/524 variables, and 226 constraints, problems are : Problem set: 0 solved, 312 unsolved in 25525 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 211/211 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 312 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (OVERLAPS) 1/211 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 3 (OVERLAPS) 313/524 variables, 211/226 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/524 variables, 312/538 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/524 variables, 1/539 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/524 variables, 2/541 constraints. Problems are: Problem set: 0 solved, 312 unsolved
SMT process timed out in 55728ms, After SMT, problems are : Problem set: 0 solved, 312 unsolved
Search for dead transitions found 0 dead transitions in 55729ms
Starting structural reductions in LTL mode, iteration 1 : 211/291 places, 313/393 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56139 ms. Remains : 211/291 places, 313/393 transitions.
[2026-05-22 21:18:10] [INFO ] Flatten gal took : 9 ms
[2026-05-22 21:18:10] [INFO ] Flatten gal took : 8 ms
[2026-05-22 21:18:10] [INFO ] Input system was already deterministic with 313 transitions.
[2026-05-22 21:18:10] [INFO ] Flatten gal took : 8 ms
[2026-05-22 21:18:10] [INFO ] Flatten gal took : 8 ms
[2026-05-22 21:18:10] [INFO ] Time to serialize gal into /tmp/CTLFireability17880348587278191795.gal : 3 ms
[2026-05-22 21:18:10] [INFO ] Time to serialize properties into /tmp/CTLFireability5919263629924989615.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/CTLFireability17880348587278191795.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5919263629924989615.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.
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.82504e+16,0.235651,7560,2,1099,5,15732,6,0,1159,13680,0


Converting to forward existential form...Done !
original formula: (EF(EX((p132==0))) * A((p361==1) U EF((((((p233==1)&&(p101==1))||(p368!=1)) * AF((p294==1))) + AF(((p180==1)&&(p216==1)))))))
=> equivalent forward existential formula: [(((Init * E(TRUE U EX((p132==0)))) * !(EG(!(E(TRUE U (((((p233==1)&&(p101==1))||(p368!=1)) * !(EG(!((p294==1)))...456
Reverse transition relation is NOT exact ! Due to transitions t4, t17, t34, t39, t53, t66, t71, t86, t100, t110, t115, t130, t145, t160, t176, t191, t206, ...261
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,29.3345,679628,1,0,2165,3.58181e+06,670,1210,7503,5.50396e+06,2433
FORMULA Champagne-PT-H05T1U-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 393/393 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 243 transition count 345
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 243 transition count 345
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 120 place count 219 transition count 321
Iterating global reduction 0 with 24 rules applied. Total rules applied 144 place count 219 transition count 321
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 152 place count 211 transition count 313
Iterating global reduction 0 with 8 rules applied. Total rules applied 160 place count 211 transition count 313
Applied a total of 160 rules in 12 ms. Remains 211 /291 variables (removed 80) and now considering 313/393 (removed 80) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2641566659472746038.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13172589844684595373.kers'
[2026-05-22 21:18:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2641566659472746038.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13172589844684595373.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 313 rows 211 cols 820 entries
Finished phase 1 with 196 SingleSign rule and 0 generalized
[2026-05-22 21:18:39] [INFO ] Computed 15 invariants in 1 ms
Computed 15 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13172589844684595373.kers
Total runtime 2 ms.
[2026-05-22 21:18:40] [INFO ] Implicit Places using invariants in 103 ms returned []
[2026-05-22 21:18:40] [INFO ] Invariant cache hit.
[2026-05-22 21:18:40] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 211/291 places, 313/393 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 457 ms. Remains : 211/291 places, 313/393 transitions.
[2026-05-22 21:18:40] [INFO ] Flatten gal took : 8 ms
[2026-05-22 21:18:40] [INFO ] Flatten gal took : 8 ms
[2026-05-22 21:18:40] [INFO ] Input system was already deterministic with 313 transitions.
[2026-05-22 21:18:40] [INFO ] Flatten gal took : 8 ms
[2026-05-22 21:18:40] [INFO ] Flatten gal took : 8 ms
[2026-05-22 21:18:40] [INFO ] Time to serialize gal into /tmp/CTLFireability10538186806382657512.gal : 3 ms
[2026-05-22 21:18:40] [INFO ] Time to serialize properties into /tmp/CTLFireability13710386619705022870.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/CTLFireability10538186806382657512.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13710386619705022870.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.
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.98203e+16,0.163632,7272,2,1063,5,14451,6,0,1159,11973,0


Converting to forward existential form...Done !
original formula: A(AX(E(EF(EX((p15==1))) U (p13==1))) U !(((EF(EX((p155==1))) * (p154==1)) + A(EF(((p233==1)||(p108==1))) U !(EX((p95==1)))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(((E(TRUE U EX((p155==1))) * (p154==1)) + !((E(!(!(EX((p95==1)))) U (!(E(TRUE U ((p233==1)||(p...618
Reverse transition relation is NOT exact ! Due to transitions t4, t33, t38, t52, t62, t67, t82, t96, t106, t111, t126, t141, t155, t172, t189, t204, t218, ...255
Detected timeout of ITS tools.
[2026-05-22 21:19:10] [INFO ] Flatten gal took : 7 ms
[2026-05-22 21:19:10] [INFO ] Applying decomposition
[2026-05-22 21:19:10] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph12616398128501837665.txt' '-o' '/tmp/graph12616398128501837665.bin' '-w' '/tmp/graph12616398128501837665.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12616398128501837665.bin' '-l' '-1' '-v' '-w' '/tmp/graph12616398128501837665.weights' '-q' '0' '-e' '0.001'
[2026-05-22 21:19:10] [INFO ] Decomposing Gal with order
[2026-05-22 21:19:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 21:19:10] [INFO ] Removed a total of 233 redundant transitions.
[2026-05-22 21:19:10] [INFO ] Flatten gal took : 41 ms
[2026-05-22 21:19:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2026-05-22 21:19:10] [INFO ] Time to serialize gal into /tmp/CTLFireability1221091262984161841.gal : 7 ms
[2026-05-22 21:19:10] [INFO ] Time to serialize properties into /tmp/CTLFireability15531614445143448830.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/CTLFireability1221091262984161841.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15531614445143448830.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,5.98203e+16,0.097491,6556,531,19,4119,343,543,4476,57,699,0


Converting to forward existential form...Done !
original formula: A(AX(E(EF(EX((i1.i0.u3.p15==1))) U (i1.i0.u4.p13==1))) U !(((EF(EX((i5.u27.p155==1))) * (i5.u30.p154==1)) + A(EF(((i9.u43.p233==1)||(i4.i...200
=> equivalent forward existential formula: [((Init * !(EG(!(!(((E(TRUE U EX((i5.u27.p155==1))) * (i5.u30.p154==1)) + !((E(!(!(EX((i0.u18.p95==1)))) U (!(E(...792
Reverse transition relation is NOT exact ! Due to transitions t4, t33, t62, t106, i0.t172, i1.i1.t218, i2.i1.t204, i3.i0.t189, i4.t155, i5.t141, i6.t126, i...313
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 393/393 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 242 transition count 344
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 242 transition count 344
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 123 place count 217 transition count 319
Iterating global reduction 0 with 25 rules applied. Total rules applied 148 place count 217 transition count 319
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 156 place count 209 transition count 311
Iterating global reduction 0 with 8 rules applied. Total rules applied 164 place count 209 transition count 311
Applied a total of 164 rules in 10 ms. Remains 209 /291 variables (removed 82) and now considering 311/393 (removed 82) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8420223918719648300.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12588995869569087598.kers'
[2026-05-22 21:19:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8420223918719648300.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12588995869569087598.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 311 rows 209 cols 816 entries
Finished phase 1 with 194 SingleSign rule and 0 generalized
[2026-05-22 21:19:40] [INFO ] Computed 15 invariants in 1 ms
Computed 15 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12588995869569087598.kers
Total runtime 2 ms.
[2026-05-22 21:19:40] [INFO ] Implicit Places using invariants in 127 ms returned []
[2026-05-22 21:19:40] [INFO ] Invariant cache hit.
[2026-05-22 21:19:41] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
Running 310 sub problems to find dead transitions.
[2026-05-22 21:19:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (OVERLAPS) 1/209 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (OVERLAPS) 311/520 variables, 209/224 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/520 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 310 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 520/520 variables, and 224 constraints, problems are : Problem set: 0 solved, 310 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 310 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (OVERLAPS) 1/209 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (OVERLAPS) 311/520 variables, 209/224 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/520 variables, 310/534 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 1/535 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/520 variables, 4/539 constraints. Problems are: Problem set: 0 solved, 310 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 520/520 variables, and 540 constraints, problems are : Problem set: 0 solved, 310 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60084ms problems are : Problem set: 0 solved, 310 unsolved
Search for dead transitions found 0 dead transitions in 60086ms
Starting structural reductions in LTL mode, iteration 1 : 209/291 places, 311/393 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60499 ms. Remains : 209/291 places, 311/393 transitions.
[2026-05-22 21:20:41] [INFO ] Flatten gal took : 9 ms
[2026-05-22 21:20:41] [INFO ] Flatten gal took : 11 ms
[2026-05-22 21:20:41] [INFO ] Input system was already deterministic with 311 transitions.
[2026-05-22 21:20:41] [INFO ] Flatten gal took : 8 ms
[2026-05-22 21:20:41] [INFO ] Flatten gal took : 8 ms
[2026-05-22 21:20:41] [INFO ] Time to serialize gal into /tmp/CTLFireability1264422389327149674.gal : 3 ms
[2026-05-22 21:20:41] [INFO ] Time to serialize properties into /tmp/CTLFireability16852428667130210939.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/CTLFireability1264422389327149674.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16852428667130210939.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.
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.12888e+16,0.255754,7104,2,1054,5,13584,6,0,1149,11173,0


Converting to forward existential form...Done !
original formula: (EF((AG((p253==0)) * EX((((p248==0)||(p78==0))&&((p310==0)||(p344==0)))))) * EF(((p180==0)||(p222==0))))
=> equivalent forward existential formula: [(FwdU((Init * E(TRUE U (!(E(TRUE U !((p253==0)))) * EX((((p248==0)||(p78==0))&&((p310==0)||(p344==0))))))),TRUE...192
Reverse transition relation is NOT exact ! Due to transitions t4, t33, t38, t52, t62, t67, t82, t98, t108, t113, t128, t143, t157, t172, t188, t203, t217, ...255
(forward)formula 0,1,8.69333,203180,1,0,515,1.1264e+06,647,297,7333,1.10264e+06,739
FORMULA Champagne-PT-H05T1U-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 393/393 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 246 transition count 348
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 246 transition count 348
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 114 place count 222 transition count 324
Iterating global reduction 0 with 24 rules applied. Total rules applied 138 place count 222 transition count 324
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 146 place count 214 transition count 316
Iterating global reduction 0 with 8 rules applied. Total rules applied 154 place count 214 transition count 316
Applied a total of 154 rules in 17 ms. Remains 214 /291 variables (removed 77) and now considering 316/393 (removed 77) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13038267224155480742.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14360629946152790805.kers'
[2026-05-22 21:20:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13038267224155480742.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14360629946152790805.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 316 rows 214 cols 826 entries
Finished phase 1 with 199 SingleSign rule and 0 generalized
[2026-05-22 21:20:50] [INFO ] Computed 15 invariants in 3 ms
Computed 15 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-14360629946152790805.kers
Total runtime 4 ms.
[2026-05-22 21:20:50] [INFO ] Implicit Places using invariants in 163 ms returned []
[2026-05-22 21:20:50] [INFO ] Invariant cache hit.
[2026-05-22 21:20:50] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 494 ms to find 0 implicit places.
Running 315 sub problems to find dead transitions.
[2026-05-22 21:20:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (OVERLAPS) 1/214 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 3 (OVERLAPS) 316/530 variables, 214/229 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/530 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 315 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 530/530 variables, and 229 constraints, problems are : Problem set: 0 solved, 315 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 315 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (OVERLAPS) 1/214 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 3 (OVERLAPS) 316/530 variables, 214/229 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/530 variables, 315/544 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/530 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 315 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 530/530 variables, and 544 constraints, problems are : Problem set: 0 solved, 315 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60077ms problems are : Problem set: 0 solved, 315 unsolved
Search for dead transitions found 0 dead transitions in 60079ms
Starting structural reductions in LTL mode, iteration 1 : 214/291 places, 316/393 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60592 ms. Remains : 214/291 places, 316/393 transitions.
[2026-05-22 21:21:50] [INFO ] Flatten gal took : 9 ms
[2026-05-22 21:21:50] [INFO ] Flatten gal took : 9 ms
[2026-05-22 21:21:50] [INFO ] Input system was already deterministic with 316 transitions.
[2026-05-22 21:21:50] [INFO ] Flatten gal took : 9 ms
[2026-05-22 21:21:50] [INFO ] Flatten gal took : 9 ms
[2026-05-22 21:21:50] [INFO ] Time to serialize gal into /tmp/CTLFireability1841404697405270104.gal : 2 ms
[2026-05-22 21:21:50] [INFO ] Time to serialize properties into /tmp/CTLFireability15905345960402617876.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/CTLFireability1841404697405270104.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15905345960402617876.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.
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.4769e+16,0.257938,7708,2,1235,5,16298,6,0,1174,14721,0


Converting to forward existential form...Done !
original formula: EG(E(!(EX(E((p47==1) U (p120==1)))) U (!(((E((p59==1) U (p153==1)) * (p130==1)) * (p216==1))) * (!(((p86==1) * EG((p161==1)))) + !(A((p36...178
=> equivalent forward existential formula: [FwdG(Init,E(!(EX(E((p47==1) U (p120==1)))) U (!(((E((p59==1) U (p153==1)) * (p130==1)) * (p216==1))) * (!(((p86...268
Reverse transition relation is NOT exact ! Due to transitions t4, t18, t35, t40, t54, t65, t70, t85, t99, t109, t114, t129, t138, t146, t160, t170, t175, t...272
(forward)formula 0,1,28.2382,593096,1,0,1647,2.85927e+06,684,965,7042,4.79319e+06,1791
FORMULA Champagne-PT-H05T1U-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 291/291 places, 393/393 transitions.
Graph (trivial) has 257 edges and 291 vertex of which 91 / 291 are part of one of the 11 SCC in 2 ms
Free SCC test removed 80 places
Ensure Unique test removed 89 transitions
Reduce isomorphic transitions removed 89 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 210 transition count 252
Reduce places removed 51 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 71 rules applied. Total rules applied 123 place count 159 transition count 232
Reduce places removed 10 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 16 rules applied. Total rules applied 139 place count 149 transition count 226
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 145 place count 143 transition count 226
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 145 place count 143 transition count 222
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 153 place count 139 transition count 222
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 171 place count 121 transition count 195
Iterating global reduction 4 with 18 rules applied. Total rules applied 189 place count 121 transition count 195
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 193 place count 121 transition count 191
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 193 place count 121 transition count 189
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 197 place count 119 transition count 189
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 5 with 68 rules applied. Total rules applied 265 place count 85 transition count 155
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 267 place count 83 transition count 150
Iterating global reduction 5 with 2 rules applied. Total rules applied 269 place count 83 transition count 150
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 271 place count 83 transition count 148
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 273 place count 81 transition count 146
Applied a total of 273 rules in 49 ms. Remains 81 /291 variables (removed 210) and now considering 146/393 (removed 247) transitions.
[2026-05-22 21:22:19] [INFO ] Flow matrix only has 119 transitions (discarded 27 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3393945617531535808.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16916093297053528498.kers'
[2026-05-22 21:22:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3393945617531535808.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16916093297053528498.kers]
Normalized transition count is 118 out of 119 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 118 rows 81 cols 316 entries
Finished phase 1 with 66 SingleSign rule and 0 generalized
[2026-05-22 21:22:19] [INFO ] Computed 15 invariants in 1 ms
Computed 15 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16916093297053528498.kers
Total runtime 2 ms.
[2026-05-22 21:22:19] [INFO ] Implicit Places using invariants in 93 ms returned []
[2026-05-22 21:22:19] [INFO ] Flow matrix only has 119 transitions (discarded 27 similar events)
[2026-05-22 21:22:19] [INFO ] Invariant cache hit.
[2026-05-22 21:22:19] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-22 21:22:19] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2026-05-22 21:22:19] [INFO ] Redundant transitions in 4 ms returned []
Running 116 sub problems to find dead transitions.
[2026-05-22 21:22:19] [INFO ] Flow matrix only has 119 transitions (discarded 27 similar events)
[2026-05-22 21:22:19] [INFO ] Invariant cache hit.
[2026-05-22 21:22:19] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 7/81 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 118/199 variables, 81/96 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (OVERLAPS) 0/199 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/200 variables, and 99 constraints, problems are : Problem set: 0 solved, 116 unsolved in 6362 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 7/81 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 118/199 variables, 81/96 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 116/215 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (OVERLAPS) 0/199 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/200 variables, and 215 constraints, problems are : Problem set: 0 solved, 116 unsolved in 6045 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12419ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 12420ms
Starting structural reductions in SI_CTL mode, iteration 1 : 81/291 places, 146/393 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12688 ms. Remains : 81/291 places, 146/393 transitions.
[2026-05-22 21:22:31] [INFO ] Flatten gal took : 5 ms
[2026-05-22 21:22:31] [INFO ] Flatten gal took : 5 ms
[2026-05-22 21:22:31] [INFO ] Input system was already deterministic with 146 transitions.
[2026-05-22 21:22:31] [INFO ] Flatten gal took : 5 ms
[2026-05-22 21:22:31] [INFO ] Flatten gal took : 4 ms
[2026-05-22 21:22:31] [INFO ] Time to serialize gal into /tmp/CTLFireability17781668253804687031.gal : 1 ms
[2026-05-22 21:22:31] [INFO ] Time to serialize properties into /tmp/CTLFireability12948262661852490525.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/CTLFireability17781668253804687031.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12948262661852490525.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.
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.37077e+10,0.049734,4732,2,162,5,2446,6,0,459,1662,0


Converting to forward existential form...Done !
original formula: (AF(((p310==1) + E((!(AG((p307==1))) * (((p4==1)||(p233==1))||(p157!=1))) U A((p60!=1) U AG((p218==1)))))) + (AF((AF(((p277==0)||(p61==0)...319
=> equivalent forward existential formula: ([FwdG((Init * !(!(EG(!(((p310==1) + E((!(!(E(TRUE U !((p307==1))))) * (((p4==1)||(p233==1))||(p157!=1))) U !((E...738
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,0.718669,19356,1,0,129,87106,46,86,2340,101180,96
FORMULA Champagne-PT-H05T1U-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 393/393 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 248 transition count 350
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 248 transition count 350
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 108 place count 226 transition count 328
Iterating global reduction 0 with 22 rules applied. Total rules applied 130 place count 226 transition count 328
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 137 place count 219 transition count 321
Iterating global reduction 0 with 7 rules applied. Total rules applied 144 place count 219 transition count 321
Applied a total of 144 rules in 18 ms. Remains 219 /291 variables (removed 72) and now considering 321/393 (removed 72) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4020016305183197809.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8037456041177683339.kers'
[2026-05-22 21:22:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4020016305183197809.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8037456041177683339.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 321 rows 219 cols 836 entries
Finished phase 1 with 204 SingleSign rule and 0 generalized
[2026-05-22 21:22:32] [INFO ] Computed 15 invariants in 2 ms
Computed 15 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8037456041177683339.kers
Total runtime 3 ms.
[2026-05-22 21:22:32] [INFO ] Implicit Places using invariants in 117 ms returned []
[2026-05-22 21:22:32] [INFO ] Invariant cache hit.
[2026-05-22 21:22:33] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
Running 320 sub problems to find dead transitions.
[2026-05-22 21:22:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (OVERLAPS) 1/219 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (OVERLAPS) 321/540 variables, 219/234 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 540/540 variables, and 234 constraints, problems are : Problem set: 0 solved, 320 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 219/219 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 320 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (OVERLAPS) 1/219 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (OVERLAPS) 321/540 variables, 219/234 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 320/554 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 1/555 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 1/556 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 3/559 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 540/540 variables, and 559 constraints, problems are : Problem set: 0 solved, 320 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 219/219 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60077ms problems are : Problem set: 0 solved, 320 unsolved
Search for dead transitions found 0 dead transitions in 60079ms
Starting structural reductions in LTL mode, iteration 1 : 219/291 places, 321/393 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60479 ms. Remains : 219/291 places, 321/393 transitions.
[2026-05-22 21:23:33] [INFO ] Flatten gal took : 5 ms
[2026-05-22 21:23:33] [INFO ] Flatten gal took : 5 ms
[2026-05-22 21:23:33] [INFO ] Input system was already deterministic with 321 transitions.
[2026-05-22 21:23:33] [INFO ] Flatten gal took : 5 ms
[2026-05-22 21:23:33] [INFO ] Flatten gal took : 5 ms
[2026-05-22 21:23:33] [INFO ] Time to serialize gal into /tmp/CTLFireability870961463993646514.gal : 2 ms
[2026-05-22 21:23:33] [INFO ] Time to serialize properties into /tmp/CTLFireability704995139656889078.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/CTLFireability870961463993646514.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability704995139656889078.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 -...281
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.0223e+17,0.247266,7668,2,1225,5,15793,6,0,1199,14213,0


Converting to forward existential form...Done !
original formula: EF((((AX(E(E((p22==1) U ((p258==1)&&(p324==1))) U (p19!=1))) * EG((((p180==1)&&(p241==1))&&(p191==1)))) * ((p111==1)&&(p8==0))) * ((E((p1...316
=> equivalent forward existential formula: ([((((FwdU(Init,TRUE) * ((!(EX(!(E(E((p22==1) U ((p258==1)&&(p324==1))) U (p19!=1))))) * EG((((p180==1)&&(p241==...757
Reverse transition relation is NOT exact ! Due to transitions t4, t20, t37, t42, t56, t66, t70, t87, t101, t107, t113, t114, t118, t129, t134, t149, t163, ...291
(forward)formula 0,1,23.7585,527704,1,0,1133,2.66202e+06,692,614,7483,3.99069e+06,1397
FORMULA Champagne-PT-H05T1U-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 393/393 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 251 transition count 353
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 251 transition count 353
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 101 place count 230 transition count 332
Iterating global reduction 0 with 21 rules applied. Total rules applied 122 place count 230 transition count 332
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 128 place count 224 transition count 326
Iterating global reduction 0 with 6 rules applied. Total rules applied 134 place count 224 transition count 326
Applied a total of 134 rules in 10 ms. Remains 224 /291 variables (removed 67) and now considering 326/393 (removed 67) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14102582841919609103.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11665151643644590153.kers'
[2026-05-22 21:23:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14102582841919609103.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11665151643644590153.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 326 rows 224 cols 846 entries
Finished phase 1 with 209 SingleSign rule and 0 generalized
[2026-05-22 21:23:57] [INFO ] Computed 15 invariants in 3 ms
Computed 15 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-11665151643644590153.kers
Total runtime 4 ms.
[2026-05-22 21:23:57] [INFO ] Implicit Places using invariants in 116 ms returned []
[2026-05-22 21:23:57] [INFO ] Invariant cache hit.
[2026-05-22 21:23:57] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
Running 325 sub problems to find dead transitions.
[2026-05-22 21:23:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 1 (OVERLAPS) 1/224 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/224 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 4 (OVERLAPS) 326/550 variables, 224/243 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 325 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 550/550 variables, and 243 constraints, problems are : Problem set: 0 solved, 325 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 224/224 constraints, PredecessorRefiner: 325/325 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 325 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 1 (OVERLAPS) 1/224 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/224 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 4 (OVERLAPS) 326/550 variables, 224/243 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 325/568 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/550 variables, 3/571 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/550 variables, 1/572 constraints. Problems are: Problem set: 0 solved, 325 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 550/550 variables, and 574 constraints, problems are : Problem set: 0 solved, 325 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 224/224 constraints, PredecessorRefiner: 325/325 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60072ms problems are : Problem set: 0 solved, 325 unsolved
Search for dead transitions found 0 dead transitions in 60074ms
Starting structural reductions in LTL mode, iteration 1 : 224/291 places, 326/393 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60421 ms. Remains : 224/291 places, 326/393 transitions.
[2026-05-22 21:24:57] [INFO ] Flatten gal took : 5 ms
[2026-05-22 21:24:57] [INFO ] Flatten gal took : 5 ms
[2026-05-22 21:24:57] [INFO ] Input system was already deterministic with 326 transitions.
[2026-05-22 21:24:57] [INFO ] Flatten gal took : 4 ms
[2026-05-22 21:24:57] [INFO ] Flatten gal took : 5 ms
[2026-05-22 21:24:57] [INFO ] Time to serialize gal into /tmp/CTLFireability16202815807108801062.gal : 2 ms
[2026-05-22 21:24:57] [INFO ] Time to serialize properties into /tmp/CTLFireability15944604128368546979.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/CTLFireability16202815807108801062.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15944604128368546979.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.
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.43418e+17,0.328551,9376,2,1520,5,24673,6,0,1224,23567,0


Converting to forward existential form...Done !
original formula: E(EX(((EF(((p87==1)&&(p349==1))) + (((p101==1)&&(p169==1)) * ((EF((p76==1)) + (p311==1)) * ((p367==1)||(p64==1))))) + (A(EX((p254==1)) U ...323
=> equivalent forward existential formula: ([(FwdU(Init,EX(((E(TRUE U ((p87==1)&&(p349==1))) + (((p101==1)&&(p169==1)) * ((E(TRUE U (p76==1)) + (p311==1)) ...889
Reverse transition relation is NOT exact ! Due to transitions t4, t18, t29, t36, t37, t41, t56, t60, t66, t73, t78, t88, t90, t93, t110, t120, t125, t140, ...309
Detected timeout of ITS tools.
[2026-05-22 21:25:27] [INFO ] Flatten gal took : 9 ms
[2026-05-22 21:25:27] [INFO ] Applying decomposition
[2026-05-22 21:25:27] [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/graph12366738916589750239.txt' '-o' '/tmp/graph12366738916589750239.bin' '-w' '/tmp/graph12366738916589750239.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12366738916589750239.bin' '-l' '-1' '-v' '-w' '/tmp/graph12366738916589750239.weights' '-q' '0' '-e' '0.001'
[2026-05-22 21:25:27] [INFO ] Decomposing Gal with order
[2026-05-22 21:25:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 21:25:27] [INFO ] Removed a total of 206 redundant transitions.
[2026-05-22 21:25:27] [INFO ] Flatten gal took : 26 ms
[2026-05-22 21:25:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 6 ms.
[2026-05-22 21:25:27] [INFO ] Time to serialize gal into /tmp/CTLFireability1201216185055579416.gal : 6 ms
[2026-05-22 21:25:27] [INFO ] Time to serialize properties into /tmp/CTLFireability13249172298969173517.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/CTLFireability1201216185055579416.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13249172298969173517.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.43418e+17,0.103727,6828,481,29,4800,562,598,5735,78,1380,0


Converting to forward existential form...Done !
original formula: E(EX(((EF(((i3.u11.p87==1)&&(i14.u65.p349==1))) + (((i3.u13.p101==1)&&(i7.i0.u28.p169==1)) * ((EF((i2.u10.p76==1)) + (i12.i0.u52.p311==1)...512
=> equivalent forward existential formula: ([(FwdU(Init,EX(((E(TRUE U ((i3.u11.p87==1)&&(i14.u65.p349==1))) + (((i3.u13.p101==1)&&(i7.i0.u28.p169==1)) * ((...1282
Reverse transition relation is NOT exact ! Due to transitions t4, t36, t73, t120, t152, t214, i0.i1.u4.t233, i1.t219, i2.u10.t203, i3.u13.t187, i4.t172, i5...457
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 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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 291/291 places, 393/393 transitions.
Graph (trivial) has 300 edges and 291 vertex of which 129 / 291 are part of one of the 15 SCC in 1 ms
Free SCC test removed 114 places
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 56 place count 176 transition count 211
Reduce places removed 55 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 79 rules applied. Total rules applied 135 place count 121 transition count 187
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 147 place count 109 transition count 187
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 174 place count 82 transition count 148
Iterating global reduction 3 with 27 rules applied. Total rules applied 201 place count 82 transition count 148
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 205 place count 82 transition count 144
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 209 place count 78 transition count 129
Iterating global reduction 4 with 4 rules applied. Total rules applied 213 place count 78 transition count 129
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 217 place count 78 transition count 125
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 5 with 60 rules applied. Total rules applied 277 place count 48 transition count 95
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 280 place count 45 transition count 88
Iterating global reduction 5 with 3 rules applied. Total rules applied 283 place count 45 transition count 88
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 286 place count 45 transition count 85
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 288 place count 43 transition count 83
Applied a total of 288 rules in 30 ms. Remains 43 /291 variables (removed 248) and now considering 83/393 (removed 310) transitions.
[2026-05-22 21:25:57] [INFO ] Flow matrix only has 46 transitions (discarded 37 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18288108868900371230.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7120889686856827258.kers'
[2026-05-22 21:25:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18288108868900371230.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7120889686856827258.kers]
Normalized transition count is 45 out of 46 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 45 rows 40 cols 120 entries
Finished phase 1 with 28 SingleSign rule and 0 generalized
[2026-05-22 21:25:57] [INFO ] Computed 15 invariants in 1 ms
Computed 15 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7120889686856827258.kers
Total runtime 2 ms.
[2026-05-22 21:25:57] [INFO ] Implicit Places using invariants in 74 ms returned []
[2026-05-22 21:25:57] [INFO ] Flow matrix only has 46 transitions (discarded 37 similar events)
[2026-05-22 21:25:57] [INFO ] Invariant cache hit.
[2026-05-22 21:25:58] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2026-05-22 21:25:58] [INFO ] Redundant transitions in 1 ms returned []
Running 42 sub problems to find dead transitions.
[2026-05-22 21:25:58] [INFO ] Flow matrix only has 46 transitions (discarded 37 similar events)
[2026-05-22 21:25:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (OVERLAPS) 2/43 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (OVERLAPS) 45/88 variables, 43/58 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (OVERLAPS) 0/88 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 88/89 variables, and 58 constraints, problems are : Problem set: 0 solved, 42 unsolved in 1597 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (OVERLAPS) 2/43 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (OVERLAPS) 45/88 variables, 43/58 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 42/100 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (OVERLAPS) 0/88 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 88/89 variables, and 100 constraints, problems are : Problem set: 0 solved, 42 unsolved in 1527 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3141ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 3142ms
Starting structural reductions in SI_CTL mode, iteration 1 : 43/291 places, 83/393 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3336 ms. Remains : 43/291 places, 83/393 transitions.
[2026-05-22 21:26:01] [INFO ] Flatten gal took : 3 ms
[2026-05-22 21:26:01] [INFO ] Flatten gal took : 2 ms
[2026-05-22 21:26:01] [INFO ] Input system was already deterministic with 83 transitions.
[2026-05-22 21:26:01] [INFO ] Flatten gal took : 6 ms
[2026-05-22 21:26:01] [INFO ] Flatten gal took : 2 ms
[2026-05-22 21:26:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12676551565676049540.gal : 1 ms
[2026-05-22 21:26:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1675548288826269899.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/ReachabilityCardinality12676551565676049540.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1675548288826269899.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 411 steps (15 resets) in 38 ms. (10 steps per ms) remains 0/1 properties
FORMULA Champagne-PT-H05T1U-CTLFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 393/393 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 242 transition count 344
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 242 transition count 344
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 125 place count 215 transition count 317
Iterating global reduction 0 with 27 rules applied. Total rules applied 152 place count 215 transition count 317
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 161 place count 206 transition count 308
Iterating global reduction 0 with 9 rules applied. Total rules applied 170 place count 206 transition count 308
Applied a total of 170 rules in 14 ms. Remains 206 /291 variables (removed 85) and now considering 308/393 (removed 85) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2623281224228836482.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18146741083379597551.kers'
[2026-05-22 21:26:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2623281224228836482.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18146741083379597551.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 308 rows 206 cols 810 entries
Finished phase 1 with 191 SingleSign rule and 0 generalized
[2026-05-22 21:26:01] [INFO ] Computed 15 invariants in 2 ms
Computed 15 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-18146741083379597551.kers
Total runtime 3 ms.
[2026-05-22 21:26:01] [INFO ] Implicit Places using invariants in 227 ms returned []
[2026-05-22 21:26:01] [INFO ] Invariant cache hit.
[2026-05-22 21:26:01] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 590 ms to find 0 implicit places.
Running 307 sub problems to find dead transitions.
[2026-05-22 21:26:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (OVERLAPS) 308/514 variables, 206/221 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/514 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (OVERLAPS) 0/514 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 307 unsolved
No progress, stopping.
After SMT solving in domain Real declared 514/514 variables, and 221 constraints, problems are : Problem set: 0 solved, 307 unsolved in 27748 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 307 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (OVERLAPS) 308/514 variables, 206/221 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/514 variables, 307/528 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 1/529 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 1/530 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/514 variables, 1/531 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/514 variables, and 531 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 57792ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 57793ms
Starting structural reductions in LTL mode, iteration 1 : 206/291 places, 308/393 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58399 ms. Remains : 206/291 places, 308/393 transitions.
[2026-05-22 21:26:59] [INFO ] Flatten gal took : 7 ms
[2026-05-22 21:26:59] [INFO ] Flatten gal took : 7 ms
[2026-05-22 21:26:59] [INFO ] Input system was already deterministic with 308 transitions.
[2026-05-22 21:26:59] [INFO ] Flatten gal took : 7 ms
[2026-05-22 21:26:59] [INFO ] Flatten gal took : 13 ms
[2026-05-22 21:26:59] [INFO ] Time to serialize gal into /tmp/CTLFireability11564204174306089206.gal : 3 ms
[2026-05-22 21:26:59] [INFO ] Time to serialize properties into /tmp/CTLFireability7214403669061921816.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/CTLFireability11564204174306089206.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7214403669061921816.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.
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,4.10569e+16,0.193989,7080,2,1036,5,13376,6,0,1134,10978,0


Converting to forward existential form...Done !
original formula: E(AF(!((!(EX((p230==1))) + !(EX((p361==1)))))) U ((EX(EX((p195==1))) * (p101==1)) * (p169==1)))
=> equivalent forward existential formula: [(EY(EY(((FwdU(Init,!(EG(!(!((!(EX((p230==1))) + !(EX((p361==1))))))))) * (p169==1)) * (p101==1)))) * (p195==1))...165
Reverse transition relation is NOT exact ! Due to transitions t4, t33, t38, t52, t62, t67, t82, t95, t97, t107, t112, t127, t142, t156, t171, t186, t201, t...260
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,9.8069,233068,1,0,1004,1.24733e+06,648,644,7099,1.75257e+06,1144
FORMULA Champagne-PT-H05T1U-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 393/393 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 242 transition count 344
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 242 transition count 344
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 125 place count 215 transition count 317
Iterating global reduction 0 with 27 rules applied. Total rules applied 152 place count 215 transition count 317
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 161 place count 206 transition count 308
Iterating global reduction 0 with 9 rules applied. Total rules applied 170 place count 206 transition count 308
Applied a total of 170 rules in 13 ms. Remains 206 /291 variables (removed 85) and now considering 308/393 (removed 85) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2616619053983645395.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17578633438462951977.kers'
[2026-05-22 21:27:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2616619053983645395.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17578633438462951977.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 308 rows 206 cols 810 entries
Finished phase 1 with 191 SingleSign rule and 0 generalized
[2026-05-22 21:27:09] [INFO ] Computed 15 invariants in 1 ms
Computed 15 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17578633438462951977.kers
Total runtime 2 ms.
[2026-05-22 21:27:09] [INFO ] Implicit Places using invariants in 107 ms returned []
[2026-05-22 21:27:09] [INFO ] Invariant cache hit.
[2026-05-22 21:27:09] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 206/291 places, 308/393 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 332 ms. Remains : 206/291 places, 308/393 transitions.
[2026-05-22 21:27:09] [INFO ] Flatten gal took : 4 ms
[2026-05-22 21:27:09] [INFO ] Flatten gal took : 4 ms
[2026-05-22 21:27:10] [INFO ] Input system was already deterministic with 308 transitions.
[2026-05-22 21:27:10] [INFO ] Flatten gal took : 5 ms
[2026-05-22 21:27:10] [INFO ] Flatten gal took : 4 ms
[2026-05-22 21:27:10] [INFO ] Time to serialize gal into /tmp/CTLFireability2371911085313538834.gal : 2 ms
[2026-05-22 21:27:10] [INFO ] Time to serialize properties into /tmp/CTLFireability12404466974948934088.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/CTLFireability2371911085313538834.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12404466974948934088.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.
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,4.10068e+16,0.271751,8556,2,1287,5,21052,6,0,1134,19442,0


Converting to forward existential form...Done !
original formula: EG(AG(EX((p212==0))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(EX((p212==0))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t33, t38, t52, t62, t67, t82, t96, t106, t107, t112, t127, t137, t142, t156, t171, t186, ...273
(forward)formula 0,0,3.29143,82688,1,0,490,454752,643,279,7081,388425,700
FORMULA Champagne-PT-H05T1U-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-22 21:27:13] [INFO ] Flatten gal took : 5 ms
[2026-05-22 21:27:13] [INFO ] Flatten gal took : 6 ms
[2026-05-22 21:27:13] [INFO ] Applying decomposition
[2026-05-22 21:27:13] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph7039391136072429686.txt' '-o' '/tmp/graph7039391136072429686.bin' '-w' '/tmp/graph7039391136072429686.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7039391136072429686.bin' '-l' '-1' '-v' '-w' '/tmp/graph7039391136072429686.weights' '-q' '0' '-e' '0.001'
[2026-05-22 21:27:13] [INFO ] Decomposing Gal with order
[2026-05-22 21:27:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 21:27:13] [INFO ] Removed a total of 207 redundant transitions.
[2026-05-22 21:27:13] [INFO ] Flatten gal took : 19 ms
[2026-05-22 21:27:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 4 ms.
[2026-05-22 21:27:13] [INFO ] Time to serialize gal into /tmp/CTLFireability7680838135886196863.gal : 5 ms
[2026-05-22 21:27:13] [INFO ] Time to serialize properties into /tmp/CTLFireability11023128723827313136.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/CTLFireability7680838135886196863.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11023128723827313136.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 2 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.0261e+18,0.215701,9764,996,32,10991,375,746,15981,62,1012,0


Converting to forward existential form...Done !
original formula: A(AX(E(EF(EX((i0.i0.u4.p15==1))) U (i0.i0.u5.p13==1))) U !(((EF(EX((i5.i1.u37.p155==1))) * (i5.i1.u37.p154==1)) + A(EF(((i8.i2.u58.p233==...206
=> equivalent forward existential formula: [((Init * !(EG(!(!(((E(TRUE U EX((i5.i1.u37.p155==1))) * (i5.i1.u37.p154==1)) + !((E(!(!(EX((i3.u22.p95==1)))) U...810
Reverse transition relation is NOT exact ! Due to transitions t4, t90, i0.i1.t290, i0.i1.u3.t286, i1.u10.t271, i1.u10.t274, i2.i0.u13.t254, i2.i0.u18.t251,...690
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 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
Detected timeout of ITS tools.
[2026-05-22 21:52:43] [INFO ] Applying decomposition
[2026-05-22 21:52:43] [INFO ] Flatten gal took : 11 ms
[2026-05-22 21:52:43] [INFO ] Decomposing Gal with order
[2026-05-22 21:52:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 21:52:43] [INFO ] Removed a total of 117 redundant transitions.
[2026-05-22 21:52:43] [INFO ] Flatten gal took : 22 ms
[2026-05-22 21:52:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 100 labels/synchronizations in 8 ms.
[2026-05-22 21:52:43] [INFO ] Time to serialize gal into /tmp/CTLFireability6926908290058893688.gal : 4 ms
[2026-05-22 21:52:43] [INFO ] Time to serialize properties into /tmp/CTLFireability3233784128618622739.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/CTLFireability6926908290058893688.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3233784128618622739.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 2 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.0261e+18,0.157586,8000,374,651,4739,3503,325,10617,310,15271,0


Converting to forward existential form...Done !
original formula: A(AX(E(EF(EX((i0.i0.i0.u4.p15==1))) U (i0.i0.i0.u4.p13==1))) U !(((EF(EX((i1.i0.i0.i0.u13.p155==1))) * (i1.i0.i0.i0.u13.p154==1)) + A(EF(...238
=> equivalent forward existential formula: [((Init * !(EG(!(!(((E(TRUE U EX((i1.i0.i0.i0.u13.p155==1))) * (i1.i0.i0.i0.u13.p154==1)) + !((E(!(!(EX((i0.u7.p...888
Reverse transition relation is NOT exact ! Due to transitions i0.u7.t230, i0.u7.t235, i0.i0.u6.t251, i0.i0.u6.t254, i0.i0.i0.u4.t286, i0.i0.i0.u4.t290, i0....957

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-H05T1U"
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-H05T1U, 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-177946901000034"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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