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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2479.991 1136252.00 1254322.00 2790.00 FTFTTFFFTTTTTTTT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r050-smll-177946901000033.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 CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r050-smll-177946901000033
=====================================================================

--------------------
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-CTLCardinality-2024-00
FORMULA_NAME Champagne-PT-H05T1U-CTLCardinality-2024-01
FORMULA_NAME Champagne-PT-H05T1U-CTLCardinality-2024-02
FORMULA_NAME Champagne-PT-H05T1U-CTLCardinality-2024-03
FORMULA_NAME Champagne-PT-H05T1U-CTLCardinality-2024-04
FORMULA_NAME Champagne-PT-H05T1U-CTLCardinality-2024-05
FORMULA_NAME Champagne-PT-H05T1U-CTLCardinality-2024-06
FORMULA_NAME Champagne-PT-H05T1U-CTLCardinality-2024-07
FORMULA_NAME Champagne-PT-H05T1U-CTLCardinality-2024-08
FORMULA_NAME Champagne-PT-H05T1U-CTLCardinality-2024-09
FORMULA_NAME Champagne-PT-H05T1U-CTLCardinality-2024-10
FORMULA_NAME Champagne-PT-H05T1U-CTLCardinality-2024-11
FORMULA_NAME Champagne-PT-H05T1U-CTLCardinality-2024-12
FORMULA_NAME Champagne-PT-H05T1U-CTLCardinality-2024-13
FORMULA_NAME Champagne-PT-H05T1U-CTLCardinality-2024-14
FORMULA_NAME Champagne-PT-H05T1U-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779484119139

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
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
CTLCardinality PT
Running Version 202604301425
[2026-05-22 21:08:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-22 21:08:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 21:08:41] [INFO ] Load time of PNML (sax parser for PT used): 181 ms
[2026-05-22 21:08:41] [INFO ] Transformed 389 places.
[2026-05-22 21:08:41] [INFO ] Transformed 491 transitions.
[2026-05-22 21:08:41] [INFO ] Found NUPN structural information;
[2026-05-22 21:08:41] [INFO ] Parsed PT model containing 389 places and 491 transitions and 1176 arcs in 355 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 36 ms.
Support contains 126 out of 389 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 389/389 places, 491/491 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 340 transition count 442
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 340 transition count 442
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 122 place count 316 transition count 418
Iterating global reduction 0 with 24 rules applied. Total rules applied 146 place count 316 transition count 418
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 154 place count 308 transition count 410
Iterating global reduction 0 with 8 rules applied. Total rules applied 162 place count 308 transition count 410
Applied a total of 162 rules in 156 ms. Remains 308 /389 variables (removed 81) and now considering 410/491 (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-16519334662191387595.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1025528963721142717.kers'
[2026-05-22 21:08:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16519334662191387595.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1025528963721142717.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 410 rows 308 cols 1014 entries
Finished phase 1 with 293 SingleSign rule and 0 generalized
[2026-05-22 21:08:41] [INFO ] Computed 15 invariants in 2 ms
Computed 15 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-1025528963721142717.kers
Total runtime 4 ms.
[2026-05-22 21:08:42] [INFO ] Implicit Places using invariants in 609 ms returned []
[2026-05-22 21:08:42] [INFO ] Invariant cache hit.
[2026-05-22 21:08:43] [INFO ] Implicit Places using invariants and state equation in 593 ms returned []
Implicit Place search using SMT with State Equation took 1276 ms to find 0 implicit places.
Running 409 sub problems to find dead transitions.
[2026-05-22 21:08:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/307 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (OVERLAPS) 1/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 14/29 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 410/718 variables, 308/337 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 718/718 variables, and 337 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 308/308 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/307 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (OVERLAPS) 1/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 14/29 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 410/718 variables, 308/337 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/718 variables, 409/746 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/718 variables, 20/766 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 718/718 variables, and 772 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 308/308 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60291ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 60324ms
Starting structural reductions in LTL mode, iteration 1 : 308/389 places, 410/491 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61833 ms. Remains : 308/389 places, 410/491 transitions.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 410/410 transitions.
Applied a total of 0 rules in 5 ms. Remains 308 /308 variables (removed 0) and now considering 410/410 (removed 0) transitions.
[2026-05-22 21:09:43] [INFO ] Invariant cache hit.
[2026-05-22 21:09:43] [INFO ] Implicit Places using invariants in 117 ms returned []
[2026-05-22 21:09:43] [INFO ] Invariant cache hit.
[2026-05-22 21:09:43] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 406 ms. Remains : 308/308 places, 410/410 transitions.
Support contains 126 out of 308 places after structural reductions.
[2026-05-22 21:09:44] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2026-05-22 21:09:44] [INFO ] Flatten gal took : 84 ms
FORMULA Champagne-PT-H05T1U-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H05T1U-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-22 21:09:44] [INFO ] Flatten gal took : 36 ms
[2026-05-22 21:09:44] [INFO ] Input system was already deterministic with 410 transitions.
Support contains 103 out of 308 places (down from 126) after GAL structural reductions.
RANDOM walk for 39264 steps (159 resets) in 1646 ms. (23 steps per ms) remains 0/65 properties
[2026-05-22 21:09:44] [INFO ] Flatten gal took : 25 ms
[2026-05-22 21:09:44] [INFO ] Flatten gal took : 26 ms
[2026-05-22 21:09:45] [INFO ] Input system was already deterministic with 410 transitions.
Computed a total of 37 stabilizing places and 37 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 410/410 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 59 place count 249 transition count 351
Iterating global reduction 0 with 59 rules applied. Total rules applied 118 place count 249 transition count 351
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 147 place count 220 transition count 322
Iterating global reduction 0 with 29 rules applied. Total rules applied 176 place count 220 transition count 322
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 187 place count 209 transition count 311
Iterating global reduction 0 with 11 rules applied. Total rules applied 198 place count 209 transition count 311
Applied a total of 198 rules in 15 ms. Remains 209 /308 variables (removed 99) and now considering 311/410 (removed 99) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16475838786393755001.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14458758150475770906.kers'
[2026-05-22 21:09:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16475838786393755001.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14458758150475770906.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:09:45] [INFO ] Computed 15 invariants in 1 ms
Computed 15 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14458758150475770906.kers
Total runtime 2 ms.
[2026-05-22 21:09:45] [INFO ] Implicit Places using invariants in 97 ms returned []
[2026-05-22 21:09:45] [INFO ] Invariant cache hit.
[2026-05-22 21:09:45] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
Running 310 sub problems to find dead transitions.
[2026-05-22 21:09:45] [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 27024 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, 1/536 constraints. Problems are: Problem set: 0 solved, 310 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 520/520 variables, and 536 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: 1/1 constraints]
After SMT, in 57105ms problems are : Problem set: 0 solved, 310 unsolved
Search for dead transitions found 0 dead transitions in 57108ms
Starting structural reductions in LTL mode, iteration 1 : 209/308 places, 311/410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57445 ms. Remains : 209/308 places, 311/410 transitions.
[2026-05-22 21:10:42] [INFO ] Flatten gal took : 34 ms
[2026-05-22 21:10:42] [INFO ] Flatten gal took : 32 ms
[2026-05-22 21:10:42] [INFO ] Input system was already deterministic with 311 transitions.
[2026-05-22 21:10:42] [INFO ] Flatten gal took : 30 ms
[2026-05-22 21:10:42] [INFO ] Flatten gal took : 29 ms
[2026-05-22 21:10:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality5071975928993248927.gal : 13 ms
[2026-05-22 21:10:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality4565057318650307622.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/CTLCardinality5071975928993248927.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4565057318650307622.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.05574e+16,0.247022,7064,2,1098,5,13836,6,0,1149,11400,0


Converting to forward existential form...Done !
original formula: EX(AF((EF(EG((p174==1))) * AF((p191==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!((E(TRUE U EG((p174==1))) * !(EG(!((p191==1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t33, t38, t52, t62, t67, t82, t96, t106, t107, t111, t122, t128, t145, t159, t174, t189, ...267
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,22.748,511952,1,0,1485,2.81811e+06,661,987,7414,3.78447e+06,1895
FORMULA Champagne-PT-H05T1U-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 308/308 places, 410/410 transitions.
Graph (trivial) has 316 edges and 308 vertex of which 124 / 308 are part of one of the 16 SCC in 7 ms
Free SCC test removed 108 places
Ensure Unique test removed 118 transitions
Reduce isomorphic transitions removed 118 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 69 place count 199 transition count 223
Reduce places removed 68 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 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 91 rules applied. Total rules applied 160 place count 131 transition count 200
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 170 place count 121 transition count 200
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 200 place count 91 transition count 167
Iterating global reduction 3 with 30 rules applied. Total rules applied 230 place count 91 transition count 167
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 231 place count 91 transition count 166
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 236 place count 86 transition count 148
Iterating global reduction 4 with 5 rules applied. Total rules applied 241 place count 86 transition count 148
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 246 place count 86 transition count 143
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 314 place count 52 transition count 109
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 319 place count 47 transition count 93
Iterating global reduction 5 with 5 rules applied. Total rules applied 324 place count 47 transition count 93
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 329 place count 47 transition count 88
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 331 place count 45 transition count 86
Applied a total of 331 rules in 120 ms. Remains 45 /308 variables (removed 263) and now considering 86/410 (removed 324) transitions.
[2026-05-22 21:11:05] [INFO ] Flow matrix only has 44 transitions (discarded 42 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3248183578053565675.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9782721524739506678.kers'
[2026-05-22 21:11:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3248183578053565675.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9782721524739506678.kers]
Normalized transition count is 43 out of 44 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 43 rows 42 cols 108 entries
Finished phase 1 with 30 SingleSign rule and 0 generalized
[2026-05-22 21:11:05] [INFO ] Computed 15 invariants in 1 ms
Computed 15 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9782721524739506678.kers
Total runtime 3 ms.
[2026-05-22 21:11:05] [INFO ] Implicit Places using invariants in 111 ms returned []
[2026-05-22 21:11:05] [INFO ] Flow matrix only has 44 transitions (discarded 42 similar events)
[2026-05-22 21:11:05] [INFO ] Invariant cache hit.
[2026-05-22 21:11:06] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
[2026-05-22 21:11:06] [INFO ] Redundant transitions in 4 ms returned []
Running 44 sub problems to find dead transitions.
[2026-05-22 21:11:06] [INFO ] Flow matrix only has 44 transitions (discarded 42 similar events)
[2026-05-22 21:11:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 2/45 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 43/88 variables, 45/60 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 0/88 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 88/89 variables, and 60 constraints, problems are : Problem set: 0 solved, 44 unsolved in 1592 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 45/45 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 2/45 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 43/88 variables, 45/60 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 44/104 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 0/88 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 88/89 variables, and 104 constraints, problems are : Problem set: 0 solved, 44 unsolved in 1626 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 45/45 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3232ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 3233ms
Starting structural reductions in SI_CTL mode, iteration 1 : 45/308 places, 86/410 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3607 ms. Remains : 45/308 places, 86/410 transitions.
[2026-05-22 21:11:09] [INFO ] Flatten gal took : 8 ms
[2026-05-22 21:11:09] [INFO ] Flatten gal took : 7 ms
[2026-05-22 21:11:09] [INFO ] Input system was already deterministic with 86 transitions.
[2026-05-22 21:11:09] [INFO ] Flatten gal took : 6 ms
[2026-05-22 21:11:09] [INFO ] Flatten gal took : 6 ms
[2026-05-22 21:11:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality13666010899130112096.gal : 3 ms
[2026-05-22 21:11:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality16586518993981600863.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/CTLCardinality13666010899130112096.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16586518993981600863.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,9.44784e+06,0.02948,4376,2,76,5,1160,6,0,253,835,0


Converting to forward existential form...Done !
original formula: EG(((p109==0)||(p92==1)))
=> equivalent forward existential formula: [FwdG(Init,((p109==0)||(p92==1)))] != FALSE
Hit Full ! (commute/partial/dont) 82/0/4
(forward)formula 0,1,0.062252,4728,1,0,9,4379,19,4,1228,2634,8
FORMULA Champagne-PT-H05T1U-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 308/308 places, 410/410 transitions.
Graph (trivial) has 296 edges and 308 vertex of which 104 / 308 are part of one of the 13 SCC in 2 ms
Free SCC test removed 91 places
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 69 place count 216 transition count 242
Reduce places removed 68 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 87 rules applied. Total rules applied 156 place count 148 transition count 223
Reduce places removed 8 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 14 rules applied. Total rules applied 170 place count 140 transition count 217
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 176 place count 134 transition count 217
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 176 place count 134 transition count 215
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 180 place count 132 transition count 215
Discarding 26 places :
Symmetric choice reduction at 4 with 26 rule applications. Total rules 206 place count 106 transition count 186
Iterating global reduction 4 with 26 rules applied. Total rules applied 232 place count 106 transition count 186
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 234 place count 106 transition count 184
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 234 place count 106 transition count 183
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 236 place count 105 transition count 183
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 239 place count 102 transition count 171
Iterating global reduction 5 with 3 rules applied. Total rules applied 242 place count 102 transition count 171
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 245 place count 102 transition count 168
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 6 with 66 rules applied. Total rules applied 311 place count 69 transition count 135
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 315 place count 65 transition count 122
Iterating global reduction 6 with 4 rules applied. Total rules applied 319 place count 65 transition count 122
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 323 place count 65 transition count 118
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 324 place count 65 transition count 117
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 325 place count 64 transition count 116
Applied a total of 325 rules in 99 ms. Remains 64 /308 variables (removed 244) and now considering 116/410 (removed 294) transitions.
[2026-05-22 21:11:09] [INFO ] Flow matrix only has 82 transitions (discarded 34 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13010175728510481096.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12834545151137609640.kers'
[2026-05-22 21:11:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13010175728510481096.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12834545151137609640.kers]
Normalized transition count is 81 out of 82 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 81 rows 64 cols 215 entries
Finished phase 1 with 49 SingleSign rule and 0 generalized
[2026-05-22 21:11:09] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12834545151137609640.kers
Total runtime 2 ms.
[2026-05-22 21:11:09] [INFO ] Implicit Places using invariants in 111 ms returned []
[2026-05-22 21:11:09] [INFO ] Flow matrix only has 82 transitions (discarded 34 similar events)
[2026-05-22 21:11:09] [INFO ] Invariant cache hit.
[2026-05-22 21:11:09] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-22 21:11:09] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
[2026-05-22 21:11:09] [INFO ] Redundant transitions in 5 ms returned []
Running 83 sub problems to find dead transitions.
[2026-05-22 21:11:09] [INFO ] Flow matrix only has 82 transitions (discarded 34 similar events)
[2026-05-22 21:11:09] [INFO ] Invariant cache hit.
[2026-05-22 21:11:09] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (OVERLAPS) 3/64 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (OVERLAPS) 81/145 variables, 64/79 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 4/83 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/145 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/145 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/145 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/145 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/145 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 15 (OVERLAPS) 0/145 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/146 variables, and 91 constraints, problems are : Problem set: 0 solved, 83 unsolved in 12007 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 64/64 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (OVERLAPS) 3/64 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (OVERLAPS) 81/145 variables, 64/79 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 4/83 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 83/166 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 8/174 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (OVERLAPS) 0/145 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/146 variables, and 174 constraints, problems are : Problem set: 0 solved, 83 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 64/64 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 17046ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 17048ms
Starting structural reductions in SI_CTL mode, iteration 1 : 64/308 places, 116/410 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17438 ms. Remains : 64/308 places, 116/410 transitions.
[2026-05-22 21:11:26] [INFO ] Flatten gal took : 9 ms
[2026-05-22 21:11:26] [INFO ] Flatten gal took : 8 ms
[2026-05-22 21:11:26] [INFO ] Input system was already deterministic with 116 transitions.
[2026-05-22 21:11:26] [INFO ] Flatten gal took : 10 ms
[2026-05-22 21:11:26] [INFO ] Flatten gal took : 8 ms
[2026-05-22 21:11:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality7719916100393369033.gal : 4 ms
[2026-05-22 21:11:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality10964011224100988920.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/CTLCardinality7719916100393369033.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10964011224100988920.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.96012e+08,0.048214,4596,2,223,5,3076,6,0,360,2408,0


Converting to forward existential form...Done !
original formula: A((AG(((p44==0)||(p387==1))) + (AF(((AF((p224==0)) * A((p386==0) U ((p30==0)||(p90==1)))) + (p2!=1))) * ((p84==0)||(p323==1)))) U ((p306=...171
=> equivalent forward existential formula: [((Init * !(EG(!(((p306==1)&&(p152==0)))))) * !(E(!(((p306==1)&&(p152==0))) U (!((!(E(TRUE U !(((p44==0)||(p387=...385
Reverse transition relation is NOT exact ! Due to transitions t0, t47, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tota...170
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,5.35994,116448,1,0,624,448561,273,341,2419,953399,787
FORMULA Champagne-PT-H05T1U-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 410/410 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 253 transition count 355
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 253 transition count 355
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 138 place count 225 transition count 327
Iterating global reduction 0 with 28 rules applied. Total rules applied 166 place count 225 transition count 327
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 176 place count 215 transition count 317
Iterating global reduction 0 with 10 rules applied. Total rules applied 186 place count 215 transition count 317
Applied a total of 186 rules in 22 ms. Remains 215 /308 variables (removed 93) and now considering 317/410 (removed 93) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15531528941097288353.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4564886770122058743.kers'
[2026-05-22 21:11:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15531528941097288353.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4564886770122058743.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 317 rows 215 cols 828 entries
Finished phase 1 with 200 SingleSign rule and 0 generalized
[2026-05-22 21:11:32] [INFO ] Computed 15 invariants in 1 ms
Computed 15 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4564886770122058743.kers
Total runtime 3 ms.
[2026-05-22 21:11:32] [INFO ] Implicit Places using invariants in 162 ms returned []
[2026-05-22 21:11:32] [INFO ] Invariant cache hit.
[2026-05-22 21:11:32] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 508 ms to find 0 implicit places.
Running 316 sub problems to find dead transitions.
[2026-05-22 21:11:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 1 (OVERLAPS) 1/215 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 3 (OVERLAPS) 317/532 variables, 215/230 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/532 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 316 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/532 variables, and 230 constraints, problems are : Problem set: 0 solved, 316 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 316/316 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 316 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 1 (OVERLAPS) 1/215 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 3 (OVERLAPS) 317/532 variables, 215/230 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/532 variables, 316/546 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/532 variables, 1/547 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/532 variables, 1/548 constraints. Problems are: Problem set: 0 solved, 316 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 532/532 variables, and 548 constraints, problems are : Problem set: 0 solved, 316 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 316/316 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60111ms problems are : Problem set: 0 solved, 316 unsolved
Search for dead transitions found 0 dead transitions in 60113ms
Starting structural reductions in LTL mode, iteration 1 : 215/308 places, 317/410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60647 ms. Remains : 215/308 places, 317/410 transitions.
[2026-05-22 21:12:33] [INFO ] Flatten gal took : 21 ms
[2026-05-22 21:12:33] [INFO ] Flatten gal took : 22 ms
[2026-05-22 21:12:33] [INFO ] Input system was already deterministic with 317 transitions.
[2026-05-22 21:12:33] [INFO ] Flatten gal took : 34 ms
[2026-05-22 21:12:33] [INFO ] Flatten gal took : 20 ms
[2026-05-22 21:12:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality11851447606850048839.gal : 8 ms
[2026-05-22 21:12:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality7081839859659391964.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11851447606850048839.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7081839859659391964.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.92207e+16,0.24152,7420,2,1082,5,15046,6,0,1179,12825,0


Converting to forward existential form...Done !
original formula: (E(AX(EX(!(A(((p294==0)||(p79==1)) U ((p195==0)||(p87==1)))))) U E(EX((A(((p6==0)||(p358==1)) U (p157==1)) + AX((p29==1)))) U (p204==0)))...180
=> equivalent forward existential formula: ([(Init * !(E(!(EX(!(EX(!(!((E(!(((p195==0)||(p87==1))) U (!(((p294==0)||(p79==1))) * !(((p195==0)||(p87==1)))))...385
Reverse transition relation is NOT exact ! Due to transitions t4, t34, t39, t53, t66, t71, t86, t101, t111, t116, t131, t147, t162, t177, t193, t208, t222,...256
(forward)formula 0,1,11.4119,266488,1,0,1267,1.55808e+06,690,704,7350,1.93378e+06,1561
FORMULA Champagne-PT-H05T1U-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 308/308 places, 410/410 transitions.
Graph (trivial) has 317 edges and 308 vertex of which 122 / 308 are part of one of the 14 SCC in 1 ms
Free SCC test removed 108 places
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 69 place count 199 transition count 221
Reduce places removed 68 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 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 91 rules applied. Total rules applied 160 place count 131 transition count 198
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 170 place count 121 transition count 198
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 170 place count 121 transition count 197
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 172 place count 120 transition count 197
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 203 place count 89 transition count 163
Iterating global reduction 3 with 31 rules applied. Total rules applied 234 place count 89 transition count 163
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 235 place count 89 transition count 162
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 235 place count 89 transition count 161
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 237 place count 88 transition count 161
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 242 place count 83 transition count 143
Iterating global reduction 4 with 5 rules applied. Total rules applied 247 place count 83 transition count 143
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 252 place count 83 transition count 138
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 5 with 64 rules applied. Total rules applied 316 place count 51 transition count 106
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 320 place count 47 transition count 94
Iterating global reduction 5 with 4 rules applied. Total rules applied 324 place count 47 transition count 94
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 328 place count 47 transition count 90
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 330 place count 45 transition count 88
Applied a total of 330 rules in 51 ms. Remains 45 /308 variables (removed 263) and now considering 88/410 (removed 322) transitions.
[2026-05-22 21:12:44] [INFO ] Flow matrix only has 45 transitions (discarded 43 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12464509209930479152.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5039537597902715572.kers'
[2026-05-22 21:12:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12464509209930479152.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5039537597902715572.kers]
Normalized transition count is 44 out of 45 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 44 rows 41 cols 108 entries
Finished phase 1 with 30 SingleSign rule and 0 generalized
[2026-05-22 21:12:44] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5039537597902715572.kers
Total runtime 1 ms.
[2026-05-22 21:12:45] [INFO ] Implicit Places using invariants in 281 ms returned []
[2026-05-22 21:12:45] [INFO ] Flow matrix only has 45 transitions (discarded 43 similar events)
[2026-05-22 21:12:45] [INFO ] Invariant cache hit.
[2026-05-22 21:12:45] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
[2026-05-22 21:12:45] [INFO ] Redundant transitions in 1 ms returned []
Running 47 sub problems to find dead transitions.
[2026-05-22 21:12:45] [INFO ] Flow matrix only has 45 transitions (discarded 43 similar events)
[2026-05-22 21:12:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 2/45 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (OVERLAPS) 44/89 variables, 45/60 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 0/89 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 89/90 variables, and 60 constraints, problems are : Problem set: 0 solved, 47 unsolved in 1635 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 45/45 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 2/45 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (OVERLAPS) 44/89 variables, 45/60 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 47/107 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 0/89 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 89/90 variables, and 107 constraints, problems are : Problem set: 0 solved, 47 unsolved in 1734 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 45/45 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3374ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 3375ms
Starting structural reductions in SI_CTL mode, iteration 1 : 45/308 places, 88/410 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3845 ms. Remains : 45/308 places, 88/410 transitions.
[2026-05-22 21:12:48] [INFO ] Flatten gal took : 6 ms
[2026-05-22 21:12:48] [INFO ] Flatten gal took : 4 ms
[2026-05-22 21:12:48] [INFO ] Input system was already deterministic with 88 transitions.
[2026-05-22 21:12:48] [INFO ] Flatten gal took : 5 ms
[2026-05-22 21:12:48] [INFO ] Flatten gal took : 5 ms
[2026-05-22 21:12:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality9799708287173002239.gal : 2 ms
[2026-05-22 21:12:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality14862236435678618955.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/CTLCardinality9799708287173002239.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14862236435678618955.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,6.61349e+06,0.024608,4392,2,76,5,727,6,0,257,408,0


Converting to forward existential form...Done !
original formula: EG(AG(EF((p146==0))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(E(TRUE U (p146==0))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.059613,4676,1,0,8,2902,18,5,1280,1641,10
FORMULA Champagne-PT-H05T1U-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 410/410 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 59 place count 249 transition count 351
Iterating global reduction 0 with 59 rules applied. Total rules applied 118 place count 249 transition count 351
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 148 place count 219 transition count 321
Iterating global reduction 0 with 30 rules applied. Total rules applied 178 place count 219 transition count 321
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 190 place count 207 transition count 309
Iterating global reduction 0 with 12 rules applied. Total rules applied 202 place count 207 transition count 309
Applied a total of 202 rules in 49 ms. Remains 207 /308 variables (removed 101) and now considering 309/410 (removed 101) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2658422993645016489.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15843330245745309532.kers'
[2026-05-22 21:12:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2658422993645016489.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15843330245745309532.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 309 rows 207 cols 812 entries
Finished phase 1 with 192 SingleSign rule and 0 generalized
[2026-05-22 21:12:48] [INFO ] Computed 15 invariants in 2 ms
Computed 15 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15843330245745309532.kers
Total runtime 3 ms.
[2026-05-22 21:12:48] [INFO ] Implicit Places using invariants in 124 ms returned []
[2026-05-22 21:12:48] [INFO ] Invariant cache hit.
[2026-05-22 21:12:49] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
Running 308 sub problems to find dead transitions.
[2026-05-22 21:12:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (OVERLAPS) 1/207 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (OVERLAPS) 309/516 variables, 207/222 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/516 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (OVERLAPS) 0/516 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 308 unsolved
No progress, stopping.
After SMT solving in domain Real declared 516/516 variables, and 222 constraints, problems are : Problem set: 0 solved, 308 unsolved in 27353 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 308 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (OVERLAPS) 1/207 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (OVERLAPS) 309/516 variables, 207/222 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/516 variables, 308/530 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/516 variables, 1/531 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 1/532 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/516 variables, 1/533 constraints. Problems are: Problem set: 0 solved, 308 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 516/516 variables, and 534 constraints, problems are : Problem set: 0 solved, 308 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 57416ms problems are : Problem set: 0 solved, 308 unsolved
Search for dead transitions found 0 dead transitions in 57417ms
Starting structural reductions in LTL mode, iteration 1 : 207/308 places, 309/410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57902 ms. Remains : 207/308 places, 309/410 transitions.
[2026-05-22 21:13:46] [INFO ] Flatten gal took : 15 ms
[2026-05-22 21:13:46] [INFO ] Flatten gal took : 16 ms
[2026-05-22 21:13:46] [INFO ] Input system was already deterministic with 309 transitions.
[2026-05-22 21:13:46] [INFO ] Flatten gal took : 15 ms
[2026-05-22 21:13:46] [INFO ] Flatten gal took : 16 ms
[2026-05-22 21:13:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality3064821328141396606.gal : 4 ms
[2026-05-22 21:13:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality14486707109223078520.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/CTLCardinality3064821328141396606.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14486707109223078520.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.44858e+16,0.228651,7224,2,1100,5,13990,6,0,1139,11824,0


Converting to forward existential form...Done !
original formula: (EG(AF(((p338==0)&&(p143==1)))) + AG((AG(AX(((p300!=0)&&(p359!=1)))) + (p87==0))))
=> equivalent forward existential formula: [(EY(FwdU((FwdU((Init * !(EG(!(EG(!(((p338==0)&&(p143==1)))))))),TRUE) * !((p87==0))),TRUE)) * !(((p300!=0)&&(p3...173
Reverse transition relation is NOT exact ! Due to transitions t4, t33, t38, t52, t62, t67, t82, t96, t106, t111, t126, t141, t145, t156, t166, t171, t187, ...267
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,10.9041,258300,1,0,1011,1.46729e+06,652,552,7394,1.81924e+06,1246
FORMULA Champagne-PT-H05T1U-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 308/308 places, 410/410 transitions.
Graph (trivial) has 301 edges and 308 vertex of which 110 / 308 are part of one of the 13 SCC in 1 ms
Free SCC test removed 97 places
Ensure Unique test removed 107 transitions
Reduce isomorphic transitions removed 107 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 210 transition count 240
Reduce places removed 62 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 82 rules applied. Total rules applied 145 place count 148 transition count 220
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 154 place count 140 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 155 place count 139 transition count 219
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 155 place count 139 transition count 215
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 163 place count 135 transition count 215
Discarding 27 places :
Symmetric choice reduction at 4 with 27 rule applications. Total rules 190 place count 108 transition count 185
Iterating global reduction 4 with 27 rules applied. Total rules applied 217 place count 108 transition count 185
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 221 place count 108 transition count 181
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 222 place count 107 transition count 181
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 222 place count 107 transition count 179
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 226 place count 105 transition count 179
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 229 place count 102 transition count 169
Iterating global reduction 6 with 3 rules applied. Total rules applied 232 place count 102 transition count 169
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 235 place count 102 transition count 166
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 7 with 64 rules applied. Total rules applied 299 place count 70 transition count 134
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 303 place count 66 transition count 122
Iterating global reduction 7 with 4 rules applied. Total rules applied 307 place count 66 transition count 122
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 311 place count 66 transition count 118
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 313 place count 64 transition count 116
Applied a total of 313 rules in 45 ms. Remains 64 /308 variables (removed 244) and now considering 116/410 (removed 294) transitions.
[2026-05-22 21:13:57] [INFO ] Flow matrix only has 85 transitions (discarded 31 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17973828232794857728.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9301962387773229966.kers'
[2026-05-22 21:13:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17973828232794857728.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9301962387773229966.kers]
Normalized transition count is 84 out of 85 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 84 rows 64 cols 232 entries
Finished phase 1 with 49 SingleSign rule and 0 generalized
[2026-05-22 21:13:57] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9301962387773229966.kers
Total runtime 1 ms.
[2026-05-22 21:13:57] [INFO ] Implicit Places using invariants in 79 ms returned []
[2026-05-22 21:13:57] [INFO ] Flow matrix only has 85 transitions (discarded 31 similar events)
[2026-05-22 21:13:57] [INFO ] Invariant cache hit.
[2026-05-22 21:13:57] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-22 21:13:57] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2026-05-22 21:13:57] [INFO ] Redundant transitions in 3 ms returned []
Running 78 sub problems to find dead transitions.
[2026-05-22 21:13:57] [INFO ] Flow matrix only has 85 transitions (discarded 31 similar events)
[2026-05-22 21:13:57] [INFO ] Invariant cache hit.
[2026-05-22 21:13:57] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 3/64 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 84/148 variables, 64/79 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 5/84 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/148 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/148 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/148 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/148 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/148 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/148 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/148 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/148 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 17 (OVERLAPS) 0/148 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 148/149 variables, and 94 constraints, problems are : Problem set: 0 solved, 78 unsolved in 13327 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 64/64 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 3/64 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 84/148 variables, 64/79 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 5/84 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 78/162 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 10/172 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (OVERLAPS) 0/148 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 148/149 variables, and 172 constraints, problems are : Problem set: 0 solved, 78 unsolved in 4133 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 64/64 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 10/10 constraints]
After SMT, in 17480ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 17481ms
Starting structural reductions in SI_CTL mode, iteration 1 : 64/308 places, 116/410 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17738 ms. Remains : 64/308 places, 116/410 transitions.
[2026-05-22 21:14:15] [INFO ] Flatten gal took : 6 ms
[2026-05-22 21:14:15] [INFO ] Flatten gal took : 6 ms
[2026-05-22 21:14:15] [INFO ] Input system was already deterministic with 116 transitions.
[2026-05-22 21:14:15] [INFO ] Flatten gal took : 6 ms
[2026-05-22 21:14:15] [INFO ] Flatten gal took : 5 ms
[2026-05-22 21:14:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality8278008205216119583.gal : 1 ms
[2026-05-22 21:14:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality14832376087591601998.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/CTLCardinality8278008205216119583.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14832376087591601998.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.05197e+08,0.036609,4528,2,121,5,1535,6,0,361,959,0


Converting to forward existential form...Done !
original formula: AF(((p270==0) * (EG(((((p3==0)&&(p357==1))&&(p150==0))||(((p249==0)&&(p95==0))&&(p304==1)))) + ((p176==0)&&(p146==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(((p270==0) * (EG(((((p3==0)&&(p357==1))&&(p150==0))||(((p249==0)&&(p95==0))&&(p304==1)))) + ((p176=...183
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.921849,27032,1,0,75,94480,24,72,1723,196829,74
FORMULA Champagne-PT-H05T1U-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 410/410 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 254 transition count 356
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 254 transition count 356
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 132 place count 230 transition count 332
Iterating global reduction 0 with 24 rules applied. Total rules applied 156 place count 230 transition count 332
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 167 place count 219 transition count 321
Iterating global reduction 0 with 11 rules applied. Total rules applied 178 place count 219 transition count 321
Applied a total of 178 rules in 11 ms. Remains 219 /308 variables (removed 89) and now considering 321/410 (removed 89) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14222210738100955302.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6853286614389065922.kers'
[2026-05-22 21:14:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14222210738100955302.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6853286614389065922.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:14:16] [INFO ] Computed 15 invariants in 1 ms
Computed 15 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6853286614389065922.kers
Total runtime 2 ms.
[2026-05-22 21:14:16] [INFO ] Implicit Places using invariants in 120 ms returned []
[2026-05-22 21:14:16] [INFO ] Invariant cache hit.
[2026-05-22 21:14:16] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
Running 320 sub problems to find dead transitions.
[2026-05-22 21:14:16] [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 30014 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, 2/557 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 2/559 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 Int declared 540/540 variables, and 559 constraints, problems are : Problem set: 0 solved, 320 unsolved in 30026 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 60068ms problems are : Problem set: 0 solved, 320 unsolved
Search for dead transitions found 0 dead transitions in 60069ms
Starting structural reductions in LTL mode, iteration 1 : 219/308 places, 321/410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60442 ms. Remains : 219/308 places, 321/410 transitions.
[2026-05-22 21:15:16] [INFO ] Flatten gal took : 14 ms
[2026-05-22 21:15:16] [INFO ] Flatten gal took : 13 ms
[2026-05-22 21:15:16] [INFO ] Input system was already deterministic with 321 transitions.
[2026-05-22 21:15:16] [INFO ] Flatten gal took : 13 ms
[2026-05-22 21:15:16] [INFO ] Flatten gal took : 17 ms
[2026-05-22 21:15:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality4454689265765220290.gal : 3 ms
[2026-05-22 21:15:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality17674228969261950581.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/CTLCardinality4454689265765220290.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17674228969261950581.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.04248e+17,0.276318,8276,2,1489,5,18078,6,0,1199,17861,0


Converting to forward existential form...Done !
original formula: (EF((AG(((((p106!=0)&&(p188!=1))&&((p233!=1)&&(p332!=1)))&&((p361!=0)&&(p146!=1)))) * (p282==0))) * !(E(((!(EX(TRUE)) + !(((p182==0)||(p1...299
=> equivalent forward existential formula: ([(Init * !(E(TRUE U (!(E(TRUE U !(((((p106!=0)&&(p188!=1))&&((p233!=1)&&(p332!=1)))&&((p361!=0)&&(p146!=1))))))...1013
Reverse transition relation is NOT exact ! Due to transitions t4, t33, t37, t39, t53, t63, t67, t69, t84, t100, t106, t114, t118, t131, t135, t139, t147, t...302
Detected timeout of ITS tools.
[2026-05-22 21:15:47] [INFO ] Flatten gal took : 9 ms
[2026-05-22 21:15:47] [INFO ] Applying decomposition
[2026-05-22 21:15:47] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph1259902075257655622.txt' '-o' '/tmp/graph1259902075257655622.bin' '-w' '/tmp/graph1259902075257655622.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1259902075257655622.bin' '-l' '-1' '-v' '-w' '/tmp/graph1259902075257655622.weights' '-q' '0' '-e' '0.001'
[2026-05-22 21:15:47] [INFO ] Decomposing Gal with order
[2026-05-22 21:15:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 21:15:47] [INFO ] Removed a total of 220 redundant transitions.
[2026-05-22 21:15:47] [INFO ] Flatten gal took : 150 ms
[2026-05-22 21:15:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 33 ms.
[2026-05-22 21:15:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality11702391465564017748.gal : 9 ms
[2026-05-22 21:15:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality13143147121156616762.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/CTLCardinality11702391465564017748.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13143147121156616762.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.04248e+17,0.212547,7684,775,27,6733,774,641,7478,76,2213,0


Converting to forward existential form...Done !
original formula: (EF((AG(((((i5.i1.u17.p106!=0)&&(i8.i0.u33.p188!=1))&&((i9.i1.u42.p233!=1)&&(i13.i1.u62.p332!=1)))&&((i14.u65.p361!=0)&&(i6.i1.u25.p146!=...466
=> equivalent forward existential formula: ([(Init * !(E(TRUE U (!(E(TRUE U !(((((i5.i1.u17.p106!=0)&&(i8.i0.u33.p188!=1))&&((i9.i1.u42.p233!=1)&&(i13.i1.u...1422
Reverse transition relation is NOT exact ! Due to transitions t4, t33, t63, t147, t178, i1.i1.t228, i2.i1.t214, i3.u12.t198, i4.i0.t183, i5.t168, i6.i0.u26...445
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 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,0,10.1912,226504,1,0,417201,814,4126,616927,446,2213,589859
FORMULA Champagne-PT-H05T1U-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 410/410 transitions.
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 58 place count 250 transition count 352
Iterating global reduction 0 with 58 rules applied. Total rules applied 116 place count 250 transition count 352
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 147 place count 219 transition count 321
Iterating global reduction 0 with 31 rules applied. Total rules applied 178 place count 219 transition count 321
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 190 place count 207 transition count 309
Iterating global reduction 0 with 12 rules applied. Total rules applied 202 place count 207 transition count 309
Applied a total of 202 rules in 12 ms. Remains 207 /308 variables (removed 101) and now considering 309/410 (removed 101) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-347216687677955891.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3267008753299792555.kers'
[2026-05-22 21:15:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-347216687677955891.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3267008753299792555.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 309 rows 207 cols 812 entries
Finished phase 1 with 192 SingleSign rule and 0 generalized
[2026-05-22 21:15:57] [INFO ] Computed 15 invariants in 1 ms
Computed 15 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3267008753299792555.kers
Total runtime 2 ms.
[2026-05-22 21:15:57] [INFO ] Implicit Places using invariants in 111 ms returned []
[2026-05-22 21:15:57] [INFO ] Invariant cache hit.
[2026-05-22 21:15:58] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
Running 308 sub problems to find dead transitions.
[2026-05-22 21:15:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (OVERLAPS) 1/207 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (OVERLAPS) 309/516 variables, 207/230 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/516 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 308 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 516/516 variables, and 230 constraints, problems are : Problem set: 0 solved, 308 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 308 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (OVERLAPS) 1/207 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (OVERLAPS) 309/516 variables, 207/230 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/516 variables, 308/538 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 1/539 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/516 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 8 (OVERLAPS) 0/516 variables, 1/540 constraints. Problems are: Problem set: 0 solved, 308 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 516/516 variables, and 540 constraints, problems are : Problem set: 0 solved, 308 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60069ms problems are : Problem set: 0 solved, 308 unsolved
Search for dead transitions found 0 dead transitions in 60070ms
Starting structural reductions in LTL mode, iteration 1 : 207/308 places, 309/410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60419 ms. Remains : 207/308 places, 309/410 transitions.
[2026-05-22 21:16:58] [INFO ] Flatten gal took : 11 ms
[2026-05-22 21:16:58] [INFO ] Flatten gal took : 16 ms
[2026-05-22 21:16:58] [INFO ] Input system was already deterministic with 309 transitions.
[2026-05-22 21:16:58] [INFO ] Flatten gal took : 11 ms
[2026-05-22 21:16:58] [INFO ] Flatten gal took : 10 ms
[2026-05-22 21:16:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality16277485650224850460.gal : 3 ms
[2026-05-22 21:16:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality16187232189917907502.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/CTLCardinality16277485650224850460.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16187232189917907502.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,4.39363e+16,0.283557,8488,2,1333,5,21408,6,0,1139,18573,0


Converting to forward existential form...Done !
original formula: EG(((p313==0) + (AF(EX((p340!=1))) * ((p129==1) + EG(((p384==0)&&(p110==1)))))))
=> equivalent forward existential formula: [FwdG(Init,((p313==0) + (!(EG(!(EX((p340!=1))))) * ((p129==1) + EG(((p384==0)&&(p110==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t33, t34, t35, t39, t54, t64, t69, t79, t84, t98, t108, t113, t128, t138, t143, t157, t17...282
Using saturation style SCC detection
Detected timeout of ITS tools.
[2026-05-22 21:17:28] [INFO ] Flatten gal took : 10 ms
[2026-05-22 21:17:28] [INFO ] Applying decomposition
[2026-05-22 21:17:28] [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/graph16066244847774320424.txt' '-o' '/tmp/graph16066244847774320424.bin' '-w' '/tmp/graph16066244847774320424.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16066244847774320424.bin' '-l' '-1' '-v' '-w' '/tmp/graph16066244847774320424.weights' '-q' '0' '-e' '0.001'
[2026-05-22 21:17:28] [INFO ] Decomposing Gal with order
[2026-05-22 21:17:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 21:17:28] [INFO ] Removed a total of 238 redundant transitions.
[2026-05-22 21:17:28] [INFO ] Flatten gal took : 40 ms
[2026-05-22 21:17:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 7 ms.
[2026-05-22 21:17:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality10798347567905930738.gal : 7 ms
[2026-05-22 21:17:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality2390790972460134454.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/CTLCardinality10798347567905930738.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2390790972460134454.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,4.39363e+16,0.135708,6160,402,23,3775,406,506,3685,57,784,0


Converting to forward existential form...Done !
original formula: EG(((i13.u54.p313==0) + (AF(EX((i14.i1.u63.p340!=1))) * ((i4.i0.u22.p129==1) + EG(((i15.u68.p384==0)&&(i4.i0.u23.p110==1)))))))
=> equivalent forward existential formula: [FwdG(Init,((i13.u54.p313==0) + (!(EG(!(EX((i14.i1.u63.p340!=1))))) * ((i4.i0.u22.p129==1) + EG(((i15.u68.p384==...194
Reverse transition relation is NOT exact ! Due to transitions t4, t34, t64, t79, t108, t138, t197, i0.i1.t216, i1.i0.t202, i2.i1.t187, i3.i1.t172, i4.t157,...360
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,7.73883,178812,1,0,384742,406,3445,440252,317,1125,325811
FORMULA Champagne-PT-H05T1U-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 410/410 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 260 transition count 362
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 260 transition count 362
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 117 place count 239 transition count 341
Iterating global reduction 0 with 21 rules applied. Total rules applied 138 place count 239 transition count 341
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 146 place count 231 transition count 333
Iterating global reduction 0 with 8 rules applied. Total rules applied 154 place count 231 transition count 333
Applied a total of 154 rules in 20 ms. Remains 231 /308 variables (removed 77) and now considering 333/410 (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-458262821897500983.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14781602675771979912.kers'
[2026-05-22 21:17:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-458262821897500983.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14781602675771979912.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 333 rows 231 cols 860 entries
Finished phase 1 with 216 SingleSign rule and 0 generalized
[2026-05-22 21:17:36] [INFO ] Computed 15 invariants in 2 ms
Computed 15 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-14781602675771979912.kers
Total runtime 4 ms.
[2026-05-22 21:17:36] [INFO ] Implicit Places using invariants in 153 ms returned []
[2026-05-22 21:17:36] [INFO ] Invariant cache hit.
[2026-05-22 21:17:36] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2026-05-22 21:17:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (OVERLAPS) 1/231 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (OVERLAPS) 333/564 variables, 231/246 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/564 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 564/564 variables, and 246 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (OVERLAPS) 1/231 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (OVERLAPS) 333/564 variables, 231/246 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/564 variables, 332/578 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/564 variables, 1/579 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/564 variables, 2/581 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 564/564 variables, and 582 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60105ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60107ms
Starting structural reductions in LTL mode, iteration 1 : 231/308 places, 333/410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60574 ms. Remains : 231/308 places, 333/410 transitions.
[2026-05-22 21:18:37] [INFO ] Flatten gal took : 14 ms
[2026-05-22 21:18:37] [INFO ] Flatten gal took : 11 ms
[2026-05-22 21:18:37] [INFO ] Input system was already deterministic with 333 transitions.
[2026-05-22 21:18:37] [INFO ] Flatten gal took : 12 ms
[2026-05-22 21:18:37] [INFO ] Flatten gal took : 11 ms
[2026-05-22 21:18:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality15476154118672976555.gal : 3 ms
[2026-05-22 21:18:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality15576613022904115979.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/CTLCardinality15476154118672976555.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15576613022904115979.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,2.27852e+17,0.334548,9064,2,1621,5,21285,6,0,1259,22031,0


Converting to forward existential form...Done !
original formula: E(((E(((AF((p329!=1)) + (p265==0)) + ((p51==1) + EF((p265==1)))) U ((p294==0)||(p256==1))) + (p119==0)) + (p172==1)) U E(((EF(((p322==0)|...334
=> equivalent forward existential formula: [(FwdU(FwdU(Init,((E(((!(EG(!((p329!=1)))) + (p265==0)) + ((p51==1) + E(TRUE U (p265==1)))) U ((p294==0)||(p256=...429
Reverse transition relation is NOT exact ! Due to transitions t4, t35, t42, t50, t60, t73, t78, t86, t94, t108, t121, t125, t136, t137, t140, t142, t146, t...302
Detected timeout of ITS tools.
[2026-05-22 21:19:07] [INFO ] Flatten gal took : 6 ms
[2026-05-22 21:19:07] [INFO ] Applying decomposition
[2026-05-22 21:19:07] [INFO ] Flatten gal took : 5 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/graph13775348715054482774.txt' '-o' '/tmp/graph13775348715054482774.bin' '-w' '/tmp/graph13775348715054482774.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13775348715054482774.bin' '-l' '-1' '-v' '-w' '/tmp/graph13775348715054482774.weights' '-q' '0' '-e' '0.001'
[2026-05-22 21:19:07] [INFO ] Decomposing Gal with order
[2026-05-22 21:19:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 21:19:07] [INFO ] Removed a total of 218 redundant transitions.
[2026-05-22 21:19:07] [INFO ] Flatten gal took : 30 ms
[2026-05-22 21:19:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2026-05-22 21:19:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality8396129722293696170.gal : 4 ms
[2026-05-22 21:19:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality12329897343600824486.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/CTLCardinality8396129722293696170.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12329897343600824486.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.27852e+17,0.129338,7208,640,25,5874,441,624,6839,74,981,0


Converting to forward existential form...Done !
original formula: E(((E(((AF((i13.i1.u69.p329!=1)) + (i11.i0.u54.p265==0)) + ((i1.i0.u7.p51==1) + EF((i11.i0.u54.p265==1)))) U ((i12.u61.p294==0)||(i10.i0....540
=> equivalent forward existential formula: [(FwdU(FwdU(Init,((E(((!(EG(!((i13.i1.u69.p329!=1)))) + (i11.i0.u54.p265==0)) + ((i1.i0.u7.p51==1) + E(TRUE U (i...635
Reverse transition relation is NOT exact ! Due to transitions t4, t35, t73, t136, t155, t184, i0.i0.t239, i1.i0.t223, i2.i0.u16.t204, i3.i0.t189, i5.t174, ...415
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 0,1,2.95944,73840,1,0,147356,814,4685,199865,421,1965,270905
FORMULA Champagne-PT-H05T1U-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 410/410 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 255 transition count 357
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 255 transition count 357
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 133 place count 228 transition count 330
Iterating global reduction 0 with 27 rules applied. Total rules applied 160 place count 228 transition count 330
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 169 place count 219 transition count 321
Iterating global reduction 0 with 9 rules applied. Total rules applied 178 place count 219 transition count 321
Applied a total of 178 rules in 10 ms. Remains 219 /308 variables (removed 89) and now considering 321/410 (removed 89) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17770459622859635464.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2650729146146188462.kers'
[2026-05-22 21:19:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17770459622859635464.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2650729146146188462.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:19:10] [INFO ] Computed 15 invariants in 1 ms
Computed 15 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2650729146146188462.kers
Total runtime 2 ms.
[2026-05-22 21:19:10] [INFO ] Implicit Places using invariants in 110 ms returned []
[2026-05-22 21:19:10] [INFO ] Invariant cache hit.
[2026-05-22 21:19:10] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
Running 320 sub problems to find dead transitions.
[2026-05-22 21:19:10] [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
At refinement iteration 5 (OVERLAPS) 0/540 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 320 unsolved
No progress, stopping.
After SMT solving in domain Real declared 540/540 variables, and 234 constraints, problems are : Problem set: 0 solved, 320 unsolved in 26456 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, 5/559 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 1/560 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 Int declared 540/540 variables, and 560 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: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 56511ms problems are : Problem set: 0 solved, 320 unsolved
Search for dead transitions found 0 dead transitions in 56513ms
Starting structural reductions in LTL mode, iteration 1 : 219/308 places, 321/410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56877 ms. Remains : 219/308 places, 321/410 transitions.
[2026-05-22 21:20:07] [INFO ] Flatten gal took : 14 ms
[2026-05-22 21:20:07] [INFO ] Flatten gal took : 8 ms
[2026-05-22 21:20:07] [INFO ] Input system was already deterministic with 321 transitions.
[2026-05-22 21:20:07] [INFO ] Flatten gal took : 9 ms
[2026-05-22 21:20:07] [INFO ] Flatten gal took : 10 ms
[2026-05-22 21:20:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality14638959196190681529.gal : 3 ms
[2026-05-22 21:20:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality6082776740518997270.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/CTLCardinality14638959196190681529.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6082776740518997270.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.04993e+17,0.38528,10300,2,1684,5,27738,6,0,1199,29972,0


Converting to forward existential form...Done !
original formula: E(!(AG(!(A(EF(((p15==0)||(p171==1))) U (((p255==0)||(p219==1))||(p5==1)))))) U AX(((EG((p284!=1)) + AG(!(((p15==0)||(p4==1))))) + A((p230...204
=> equivalent forward existential formula: [(FwdU(Init,!(!(E(TRUE U !(!(!((E(!((((p255==0)||(p219==1))||(p5==1))) U (!(E(TRUE U ((p15==0)||(p171==1)))) * !...522
Reverse transition relation is NOT exact ! Due to transitions t4, t33, t38, t52, t65, t69, t80, t84, t86, t99, t101, t112, t116, t133, t139, t145, t150, t1...295
Detected timeout of ITS tools.
[2026-05-22 21:20:37] [INFO ] Flatten gal took : 5 ms
[2026-05-22 21:20:37] [INFO ] Applying decomposition
[2026-05-22 21:20:37] [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/graph13188597553309283395.txt' '-o' '/tmp/graph13188597553309283395.bin' '-w' '/tmp/graph13188597553309283395.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13188597553309283395.bin' '-l' '-1' '-v' '-w' '/tmp/graph13188597553309283395.weights' '-q' '0' '-e' '0.001'
[2026-05-22 21:20:37] [INFO ] Decomposing Gal with order
[2026-05-22 21:20:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 21:20:37] [INFO ] Removed a total of 238 redundant transitions.
[2026-05-22 21:20:37] [INFO ] Flatten gal took : 19 ms
[2026-05-22 21:20:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2026-05-22 21:20:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality10164754777655914862.gal : 3 ms
[2026-05-22 21:20:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality6061834884461407287.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/CTLCardinality10164754777655914862.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6061834884461407287.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.04993e+17,0.113226,6908,578,21,5137,427,604,6308,65,902,0


Converting to forward existential form...Done !
original formula: E(!(AG(!(A(EF(((i1.u3.p15==0)||(i7.i1.u30.p171==1))) U (((i11.i2.u47.p255==0)||(i10.i2.u40.p219==1))||(i1.u5.p5==1)))))) U AX(((EG((i12.u...305
=> equivalent forward existential formula: [(FwdU(Init,!(!(E(TRUE U !(!(!((E(!((((i11.i2.u47.p255==0)||(i10.i2.u40.p219==1))||(i1.u5.p5==1))) U (!(E(TRUE U...731
Reverse transition relation is NOT exact ! Due to transitions t4, t33, t80, t112, t145, t174, i1.t226, i1.u5.t236, i2.u7.t210, i3.i0.t196, i4.i1.t179, i5.t...405
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 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
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 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,13.7867,297928,1,0,562854,772,4409,755534,366,1819,557044
FORMULA Champagne-PT-H05T1U-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 410/410 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 251 transition count 353
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 251 transition count 353
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 143 place count 222 transition count 324
Iterating global reduction 0 with 29 rules applied. Total rules applied 172 place count 222 transition count 324
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 184 place count 210 transition count 312
Iterating global reduction 0 with 12 rules applied. Total rules applied 196 place count 210 transition count 312
Applied a total of 196 rules in 19 ms. Remains 210 /308 variables (removed 98) and now considering 312/410 (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-12772343855375824711.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14732581472562195308.kers'
[2026-05-22 21:20:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12772343855375824711.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14732581472562195308.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:20:51] [INFO ] Computed 15 invariants in 2 ms
Computed 15 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-14732581472562195308.kers
Total runtime 3 ms.
[2026-05-22 21:20:51] [INFO ] Implicit Places using invariants in 134 ms returned []
[2026-05-22 21:20:51] [INFO ] Invariant cache hit.
[2026-05-22 21:20:51] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
Running 311 sub problems to find dead transitions.
[2026-05-22 21:20:51] [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
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 30033 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, 1/538 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 538 constraints, problems are : Problem set: 0 solved, 311 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60093ms problems are : Problem set: 0 solved, 311 unsolved
Search for dead transitions found 0 dead transitions in 60095ms
Starting structural reductions in LTL mode, iteration 1 : 210/308 places, 312/410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60553 ms. Remains : 210/308 places, 312/410 transitions.
[2026-05-22 21:21:51] [INFO ] Flatten gal took : 8 ms
[2026-05-22 21:21:51] [INFO ] Flatten gal took : 8 ms
[2026-05-22 21:21:51] [INFO ] Input system was already deterministic with 312 transitions.
[2026-05-22 21:21:51] [INFO ] Flatten gal took : 9 ms
[2026-05-22 21:21:51] [INFO ] Flatten gal took : 7 ms
[2026-05-22 21:21:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality9588969631158377322.gal : 2 ms
[2026-05-22 21:21:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality14926090334361883051.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/CTLCardinality9588969631158377322.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14926090334361883051.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.46743e+16,0.260588,7532,2,1171,5,15372,6,0,1154,13852,0


Converting to forward existential form...Done !
original formula: !(A(!(EG(EX(AX(((p202==0)||(p270==1)))))) U ((p381==1)&&(p248==1))))
=> equivalent forward existential formula: ([FwdG((FwdU(Init,!(((p381==1)&&(p248==1)))) * !(((p381==1)&&(p248==1)))),EX(!(EX(!(((p202==0)||(p270==1)))))))]...215
Hit Full ! (commute/partial/dont) 307/0/5
Reverse transition relation is NOT exact ! Due to transitions t4, t35, t40, t54, t64, t69, t75, t86, t100, t110, t114, t116, t131, t146, t160, t175, t190, ...267
(forward)formula 0,1,1.86923,44092,1,0,454,210026,655,265,7250,185457,652
FORMULA Champagne-PT-H05T1U-CTLCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 410/410 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 258 transition count 360
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 258 transition count 360
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 125 place count 233 transition count 335
Iterating global reduction 0 with 25 rules applied. Total rules applied 150 place count 233 transition count 335
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 161 place count 222 transition count 324
Iterating global reduction 0 with 11 rules applied. Total rules applied 172 place count 222 transition count 324
Applied a total of 172 rules in 10 ms. Remains 222 /308 variables (removed 86) and now considering 324/410 (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-4556012800420632340.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4622111345887312564.kers'
[2026-05-22 21:21:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4556012800420632340.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4622111345887312564.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 324 rows 222 cols 842 entries
Finished phase 1 with 207 SingleSign rule and 0 generalized
[2026-05-22 21:21:53] [INFO ] Computed 15 invariants in 1 ms
Computed 15 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4622111345887312564.kers
Total runtime 2 ms.
[2026-05-22 21:21:53] [INFO ] Implicit Places using invariants in 101 ms returned []
[2026-05-22 21:21:53] [INFO ] Invariant cache hit.
[2026-05-22 21:21:54] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
Running 323 sub problems to find dead transitions.
[2026-05-22 21:21:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 1 (OVERLAPS) 1/222 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 4 (OVERLAPS) 324/546 variables, 222/239 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/546 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 323 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 546/546 variables, and 239 constraints, problems are : Problem set: 0 solved, 323 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 222/222 constraints, PredecessorRefiner: 323/323 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 323 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 1 (OVERLAPS) 1/222 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 4 (OVERLAPS) 324/546 variables, 222/239 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/546 variables, 323/562 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/546 variables, 4/566 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 1/567 constraints. Problems are: Problem set: 0 solved, 323 unsolved
SMT process timed out in 60227ms, After SMT, problems are : Problem set: 0 solved, 323 unsolved
Search for dead transitions found 0 dead transitions in 60230ms
Starting structural reductions in LTL mode, iteration 1 : 222/308 places, 324/410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60577 ms. Remains : 222/308 places, 324/410 transitions.
[2026-05-22 21:22:54] [INFO ] Flatten gal took : 7 ms
[2026-05-22 21:22:54] [INFO ] Flatten gal took : 7 ms
[2026-05-22 21:22:54] [INFO ] Input system was already deterministic with 324 transitions.
[2026-05-22 21:22:54] [INFO ] Flatten gal took : 7 ms
[2026-05-22 21:22:54] [INFO ] Flatten gal took : 7 ms
[2026-05-22 21:22:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality16314275658425840707.gal : 2 ms
[2026-05-22 21:22:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality9320528916785150168.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/CTLCardinality16314275658425840707.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9320528916785150168.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.30795e+17,0.379818,9892,2,1684,5,26363,6,0,1214,27288,0


Converting to forward existential form...Done !
original formula: EX((!(A(!(EG(((p250==0)||(p55==1)))) U AG((((p335==0)||(p29==1))&&((p190==0)||(p230==1)))))) + (!(E(((p313!=1)||(p264!=0)) U (((p1==0)&&(...255
=> equivalent forward existential formula: (([(FwdU((FwdU(EY(Init),!(!(E(TRUE U !((((p335==0)||(p29==1))&&((p190==0)||(p230==1)))))))) * !(!(EG(((p250==0)|...631
Reverse transition relation is NOT exact ! Due to transitions t4, t13, t36, t37, t41, t55, t57, t67, t72, t81, t84, t89, t93, t103, t105, t115, t116, t120,...328
Detected timeout of ITS tools.
[2026-05-22 21:23:24] [INFO ] Flatten gal took : 6 ms
[2026-05-22 21:23:24] [INFO ] Applying decomposition
[2026-05-22 21:23:24] [INFO ] Flatten gal took : 5 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/graph2501428603538943191.txt' '-o' '/tmp/graph2501428603538943191.bin' '-w' '/tmp/graph2501428603538943191.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2501428603538943191.bin' '-l' '-1' '-v' '-w' '/tmp/graph2501428603538943191.weights' '-q' '0' '-e' '0.001'
[2026-05-22 21:23:24] [INFO ] Decomposing Gal with order
[2026-05-22 21:23:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 21:23:24] [INFO ] Removed a total of 217 redundant transitions.
[2026-05-22 21:23:24] [INFO ] Flatten gal took : 16 ms
[2026-05-22 21:23:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 4 ms.
[2026-05-22 21:23:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality11159089369721104273.gal : 4 ms
[2026-05-22 21:23:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality18383363150004101869.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/CTLCardinality11159089369721104273.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18383363150004101869.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.30795e+17,0.132107,7748,868,30,7054,615,618,7441,73,1446,0


Converting to forward existential form...Done !
original formula: EX((!(A(!(EG(((i10.u50.p250==0)||(i3.i0.u16.p55==1)))) U AG((((i13.u66.p335==0)||(i2.i1.u6.p29==1))&&((i8.i1.u35.p190==0)||(i9.i2.u45.p23...411
=> equivalent forward existential formula: (([(FwdU((FwdU(EY(Init),!(!(E(TRUE U !((((i13.u66.p335==0)||(i2.i1.u6.p29==1))&&((i8.i1.u35.p190==0)||(i9.i2.u45...931
Reverse transition relation is NOT exact ! Due to transitions t4, t36, t67, t84, t115, t132, t147, i0.i0.u5.t229, i2.i1.t213, i2.i1.u6.t210, i2.i1.u9.t215,...491
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 LTL mode, iteration 0 : 308/308 places, 410/410 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 59 place count 249 transition count 351
Iterating global reduction 0 with 59 rules applied. Total rules applied 118 place count 249 transition count 351
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 149 place count 218 transition count 320
Iterating global reduction 0 with 31 rules applied. Total rules applied 180 place count 218 transition count 320
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 192 place count 206 transition count 308
Iterating global reduction 0 with 12 rules applied. Total rules applied 204 place count 206 transition count 308
Applied a total of 204 rules in 11 ms. Remains 206 /308 variables (removed 102) and now considering 308/410 (removed 102) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6871370663735738825.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9395587376165041732.kers'
[2026-05-22 21:23:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6871370663735738825.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9395587376165041732.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:23:54] [INFO ] Computed 15 invariants in 2 ms
Computed 15 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-9395587376165041732.kers
Total runtime 5 ms.
[2026-05-22 21:23:54] [INFO ] Implicit Places using invariants in 163 ms returned []
[2026-05-22 21:23:54] [INFO ] Invariant cache hit.
[2026-05-22 21:23:55] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
Running 307 sub problems to find dead transitions.
[2026-05-22 21:23:55] [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, 7/22 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 308/514 variables, 206/228 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 307 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 514/514 variables, and 228 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 7/7 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, 7/22 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 308/514 variables, 206/228 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 307/535 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 1/536 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/514 variables, 0/536 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 536 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60064ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 60065ms
Starting structural reductions in LTL mode, iteration 1 : 206/308 places, 308/410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60471 ms. Remains : 206/308 places, 308/410 transitions.
[2026-05-22 21:24:55] [INFO ] Flatten gal took : 4 ms
[2026-05-22 21:24:55] [INFO ] Flatten gal took : 5 ms
[2026-05-22 21:24:55] [INFO ] Input system was already deterministic with 308 transitions.
[2026-05-22 21:24:55] [INFO ] Flatten gal took : 4 ms
[2026-05-22 21:24:55] [INFO ] Flatten gal took : 4 ms
[2026-05-22 21:24:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality15986078055755290590.gal : 1 ms
[2026-05-22 21:24:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality2198468449132495530.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/CTLCardinality15986078055755290590.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2198468449132495530.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.170243,8420,2,1351,5,21140,6,0,1134,18051,0


Converting to forward existential form...Done !
original formula: AX(AX(AG(EF((p365==0)))))
=> equivalent forward existential formula: [(FwdU(EY(EY(Init)),TRUE) * !(E(TRUE U (p365==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t19, t34, t39, t53, t63, t68, t78, t83, t97, t107, t112, t127, t137, t142, t156, t171, t1...277
(forward)formula 0,1,1.59891,45616,1,0,433,227892,637,251,6811,167577,629
FORMULA Champagne-PT-H05T1U-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-22 21:24:56] [INFO ] Flatten gal took : 10 ms
[2026-05-22 21:24:56] [INFO ] Flatten gal took : 10 ms
[2026-05-22 21:24:56] [INFO ] Applying decomposition
[2026-05-22 21:24:56] [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/graph9588020764749233581.txt' '-o' '/tmp/graph9588020764749233581.bin' '-w' '/tmp/graph9588020764749233581.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9588020764749233581.bin' '-l' '-1' '-v' '-w' '/tmp/graph9588020764749233581.weights' '-q' '0' '-e' '0.001'
[2026-05-22 21:24:56] [INFO ] Decomposing Gal with order
[2026-05-22 21:24:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 21:24:56] [INFO ] Removed a total of 236 redundant transitions.
[2026-05-22 21:24:56] [INFO ] Flatten gal took : 33 ms
[2026-05-22 21:24:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 7 ms.
[2026-05-22 21:24:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality6059655111608111832.gal : 8 ms
[2026-05-22 21:24:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality12882893965131051195.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/CTLCardinality6059655111608111832.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12882893965131051195.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.7626e+19,0.469135,12324,1611,27,16672,617,769,23774,63,1705,0


Converting to forward existential form...Done !
original formula: EX((!(A(!(EG(((i10.i0.u75.p250==0)||(i3.i1.u22.p55==1)))) U AG((((i13.i1.u95.p335==0)||(i2.i1.u9.p29==1))&&((i8.i1.u56.p190==0)||(i9.i0.u...422
=> equivalent forward existential formula: (([(FwdU((FwdU(EY(Init),!(!(E(TRUE U !((((i13.i1.u95.p335==0)||(i2.i1.u9.p29==1))&&((i8.i1.u56.p190==0)||(i9.i0....952
Reverse transition relation is NOT exact ! Due to transitions t114, t202, t264, i1.i1.t306, i1.i1.t311, i1.i1.u7.t323, i2.i1.t286, i2.i1.t290, i2.i1.u14.t3...900
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 0,1,157.689,2015344,1,0,3.60738e+06,828,6225,5.10309e+06,325,2499,3226089
FORMULA Champagne-PT-H05T1U-CTLCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Total runtime 1134252 ms.

BK_STOP 1779485255391

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is Champagne-PT-H05T1U, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r050-smll-177946901000033"
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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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