fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r098-tall-177955695500314
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for DiscoveryGPU-PT-11a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1266.020 388810.00 419460.00 760.00 TTTFFTTFFTTTTTTF 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.r098-tall-177955695500314.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 DiscoveryGPU-PT-11a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-tall-177955695500314
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 5.6K Mar 6 16:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Mar 6 16:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Mar 6 16:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Mar 6 16:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 09:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 09:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 09:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 15 09:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 6 16:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Mar 6 16:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Mar 6 16:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Mar 6 16:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 09:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 39K 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 DiscoveryGPU-PT-11a-CTLFireability-2024-00
FORMULA_NAME DiscoveryGPU-PT-11a-CTLFireability-2024-01
FORMULA_NAME DiscoveryGPU-PT-11a-CTLFireability-2024-02
FORMULA_NAME DiscoveryGPU-PT-11a-CTLFireability-2024-03
FORMULA_NAME DiscoveryGPU-PT-11a-CTLFireability-2024-04
FORMULA_NAME DiscoveryGPU-PT-11a-CTLFireability-2024-05
FORMULA_NAME DiscoveryGPU-PT-11a-CTLFireability-2024-06
FORMULA_NAME DiscoveryGPU-PT-11a-CTLFireability-2024-07
FORMULA_NAME DiscoveryGPU-PT-11a-CTLFireability-2024-08
FORMULA_NAME DiscoveryGPU-PT-11a-CTLFireability-2024-09
FORMULA_NAME DiscoveryGPU-PT-11a-CTLFireability-2024-10
FORMULA_NAME DiscoveryGPU-PT-11a-CTLFireability-2024-11
FORMULA_NAME DiscoveryGPU-PT-11a-CTLFireability-2024-12
FORMULA_NAME DiscoveryGPU-PT-11a-CTLFireability-2024-13
FORMULA_NAME DiscoveryGPU-PT-11a-CTLFireability-2024-14
FORMULA_NAME DiscoveryGPU-PT-11a-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779599315867

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-11a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-24 05:08:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 05:08:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 05:08:37] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2026-05-24 05:08:37] [INFO ] Transformed 113 places.
[2026-05-24 05:08:37] [INFO ] Transformed 155 transitions.
[2026-05-24 05:08:37] [INFO ] Found NUPN structural information;
[2026-05-24 05:08:37] [INFO ] Parsed PT model containing 113 places and 155 transitions and 498 arcs in 146 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Support contains 63 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 155/155 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 110 transition count 152
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 110 transition count 152
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 0 with 11 rules applied. Total rules applied 17 place count 110 transition count 141
Applied a total of 17 rules in 24 ms. Remains 110 /113 variables (removed 3) and now considering 141/155 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5314155038695491613.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5196238530164897962.kers'
[2026-05-24 05:08:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5314155038695491613.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5196238530164897962.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 141 rows 108 cols 273 entries
Finished phase 1 with 108 SingleSign rule and 0 generalized
[2026-05-24 05:08:37] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-5196238530164897962.kers
Total runtime 4 ms.
[2026-05-24 05:08:37] [INFO ] Implicit Places using invariants in 198 ms returned []
[2026-05-24 05:08:37] [INFO ] Invariant cache hit.
[2026-05-24 05:08:37] [INFO ] State equation strengthened by 88 read => feed constraints.
[2026-05-24 05:08:37] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
Running 140 sub problems to find dead transitions.
[2026-05-24 05:08:37] [INFO ] Invariant cache hit.
[2026-05-24 05:08:37] [INFO ] State equation strengthened by 88 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 141/251 variables, 110/112 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 88/200 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (OVERLAPS) 0/251 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 200 constraints, problems are : Problem set: 0 solved, 140 unsolved in 5224 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 110/110 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 141/251 variables, 110/112 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 88/200 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 140/340 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (OVERLAPS) 0/251 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 340 constraints, problems are : Problem set: 0 solved, 140 unsolved in 4898 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 110/110 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10183ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 10200ms
Starting structural reductions in LTL mode, iteration 1 : 110/113 places, 141/155 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10615 ms. Remains : 110/113 places, 141/155 transitions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 141/141 transitions.
Applied a total of 0 rules in 2 ms. Remains 110 /110 variables (removed 0) and now considering 141/141 (removed 0) transitions.
[2026-05-24 05:08:47] [INFO ] Invariant cache hit.
[2026-05-24 05:08:47] [INFO ] Implicit Places using invariants in 36 ms returned []
[2026-05-24 05:08:47] [INFO ] Invariant cache hit.
[2026-05-24 05:08:47] [INFO ] State equation strengthened by 88 read => feed constraints.
[2026-05-24 05:08:48] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 122 ms. Remains : 110/110 places, 141/141 transitions.
Support contains 63 out of 110 places after structural reductions.
[2026-05-24 05:08:48] [INFO ] Flatten gal took : 26 ms
[2026-05-24 05:08:48] [INFO ] Flatten gal took : 12 ms
[2026-05-24 05:08:48] [INFO ] Input system was already deterministic with 141 transitions.
Support contains 61 out of 110 places (down from 63) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 56 to 55
RANDOM walk for 40000 steps (337 resets) in 753 ms. (53 steps per ms) remains 1/55 properties
BEST_FIRST walk for 15829 steps (9 resets) in 69 ms. (226 steps per ms) remains 0/1 properties
[2026-05-24 05:08:48] [INFO ] Flatten gal took : 7 ms
[2026-05-24 05:08:48] [INFO ] Flatten gal took : 19 ms
[2026-05-24 05:08:48] [INFO ] Input system was already deterministic with 141 transitions.
Computed a total of 14 stabilizing places and 12 stable transitions
Graph (complete) has 309 edges and 110 vertex of which 102 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 141/141 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 102 transition count 133
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 102 transition count 133
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 95 transition count 126
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 95 transition count 126
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 36 place count 89 transition count 120
Iterating global reduction 0 with 6 rules applied. Total rules applied 42 place count 89 transition count 120
Applied a total of 42 rules in 10 ms. Remains 89 /110 variables (removed 21) and now considering 120/141 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13389262435880930718.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9656616029099982513.kers'
[2026-05-24 05:08:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13389262435880930718.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9656616029099982513.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 120 rows 87 cols 238 entries
Finished phase 1 with 87 SingleSign rule and 0 generalized
[2026-05-24 05:08:48] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9656616029099982513.kers
Total runtime 0 ms.
[2026-05-24 05:08:48] [INFO ] Implicit Places using invariants in 116 ms returned []
[2026-05-24 05:08:48] [INFO ] Invariant cache hit.
[2026-05-24 05:08:48] [INFO ] State equation strengthened by 81 read => feed constraints.
[2026-05-24 05:08:48] [INFO ] Implicit Places using invariants and state equation in 131 ms returned [88]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 251 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 88/110 places, 120/141 transitions.
Applied a total of 0 rules in 4 ms. Remains 88 /88 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 265 ms. Remains : 88/110 places, 120/141 transitions.
[2026-05-24 05:08:48] [INFO ] Flatten gal took : 5 ms
[2026-05-24 05:08:48] [INFO ] Flatten gal took : 5 ms
[2026-05-24 05:08:48] [INFO ] Input system was already deterministic with 120 transitions.
[2026-05-24 05:08:48] [INFO ] Flatten gal took : 8 ms
[2026-05-24 05:08:49] [INFO ] Flatten gal took : 5 ms
[2026-05-24 05:08:49] [INFO ] Time to serialize gal into /tmp/CTLFireability9696168025783646912.gal : 3 ms
[2026-05-24 05:08:49] [INFO ] Time to serialize properties into /tmp/CTLFireability5943776444729026998.ctl : 9 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/CTLFireability9696168025783646912.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5943776444729026998.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,1.08265e+11,3.22769,107732,2,31588,5,668280,6,0,460,404463,0


Converting to forward existential form...Done !
original formula: EF((AX(AX(E(((p82==1)&&(p111==1)) U ((p46==1)&&(p111==1))))) + ((EG(AX(EF(((p42==1)&&(p111==1))))) * (p22==1)) * (p111==1))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EX(!(!(EX(!(E(((p82==1)&&(p111==1)) U ((p46==1)&&(p111==1))))))))))] != FALSE + [FwdG(((F...248
Reverse transition relation is NOT exact ! Due to transitions t28, t32, t37, t39, t41, t43, t45, t47, t95, t98, t100, t101, t108, t109, t110, t111, t112, t...295
(forward)formula 0,1,24.0151,645636,1,0,203,3.2264e+06,260,129,2634,4.3061e+06,283
FORMULA DiscoveryGPU-PT-11a-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 110/110 places, 141/141 transitions.
Graph (complete) has 309 edges and 110 vertex of which 102 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 1 place count 102 transition count 123
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 21 place count 92 transition count 123
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 30 place count 83 transition count 114
Iterating global reduction 0 with 9 rules applied. Total rules applied 39 place count 83 transition count 114
Applied a total of 39 rules in 38 ms. Remains 83 /110 variables (removed 27) and now considering 114/141 (removed 27) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12609054564069983801.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5346144501827821802.kers'
[2026-05-24 05:09:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12609054564069983801.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5346144501827821802.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 114 rows 81 cols 225 entries
Finished phase 1 with 81 SingleSign rule and 0 generalized
[2026-05-24 05:09:13] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5346144501827821802.kers
Total runtime 0 ms.
[2026-05-24 05:09:13] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-24 05:09:13] [INFO ] Invariant cache hit.
[2026-05-24 05:09:13] [INFO ] State equation strengthened by 79 read => feed constraints.
[2026-05-24 05:09:13] [INFO ] Implicit Places using invariants and state equation in 125 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 179 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 82/110 places, 114/141 transitions.
Applied a total of 0 rules in 6 ms. Remains 82 /82 variables (removed 0) and now considering 114/114 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 223 ms. Remains : 82/110 places, 114/141 transitions.
[2026-05-24 05:09:13] [INFO ] Flatten gal took : 4 ms
[2026-05-24 05:09:13] [INFO ] Flatten gal took : 4 ms
[2026-05-24 05:09:13] [INFO ] Input system was already deterministic with 114 transitions.
RANDOM walk for 912 steps (5 resets) in 7 ms. (114 steps per ms) remains 0/1 properties
FORMULA DiscoveryGPU-PT-11a-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-24 05:09:13] [INFO ] Flatten gal took : 4 ms
[2026-05-24 05:09:13] [INFO ] Flatten gal took : 4 ms
[2026-05-24 05:09:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9237000395515422180.gal : 1 ms
[2026-05-24 05:09:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17868358258909391821.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9237000395515422180.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17868358258909391821.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 141/141 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 101 transition count 132
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 101 transition count 132
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 27 place count 92 transition count 123
Iterating global reduction 0 with 9 rules applied. Total rules applied 36 place count 92 transition count 123
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 87 transition count 118
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 87 transition count 118
Applied a total of 46 rules in 7 ms. Remains 87 /110 variables (removed 23) and now considering 118/141 (removed 23) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7508804598680878873.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12212608220048493683.kers'
[2026-05-24 05:09:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7508804598680878873.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12212608220048493683.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 118 rows 85 cols 233 entries
Finished phase 1 with 85 SingleSign rule and 0 generalized
[2026-05-24 05:09:13] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12212608220048493683.kers
Total runtime 0 ms.
[2026-05-24 05:09:13] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-24 05:09:13] [INFO ] Invariant cache hit.
[2026-05-24 05:09:13] [INFO ] State equation strengthened by 79 read => feed constraints.
[2026-05-24 05:09:13] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Running 117 sub problems to find dead transitions.
[2026-05-24 05:09:13] [INFO ] Invariant cache hit.
[2026-05-24 05:09:13] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (OVERLAPS) 118/205 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 79/168 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (OVERLAPS) 0/205 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 168 constraints, problems are : Problem set: 0 solved, 117 unsolved in 3179 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (OVERLAPS) 118/205 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 79/168 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 117/285 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (OVERLAPS) 0/205 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 285 constraints, problems are : Problem set: 0 solved, 117 unsolved in 3408 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6614ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 6615ms
Starting structural reductions in LTL mode, iteration 1 : 87/110 places, 118/141 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6775 ms. Remains : 87/110 places, 118/141 transitions.
[2026-05-24 05:09:20] [INFO ] Flatten gal took : 6 ms
[2026-05-24 05:09:20] [INFO ] Flatten gal took : 11 ms
[2026-05-24 05:09:20] [INFO ] Input system was already deterministic with 118 transitions.
[2026-05-24 05:09:20] [INFO ] Flatten gal took : 20 ms
[2026-05-24 05:09:20] [INFO ] Flatten gal took : 4 ms
[2026-05-24 05:09:20] [INFO ] Time to serialize gal into /tmp/CTLFireability2567562647152806250.gal : 2 ms
[2026-05-24 05:09:20] [INFO ] Time to serialize properties into /tmp/CTLFireability17068790561860724718.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/CTLFireability2567562647152806250.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17068790561860724718.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,9.15019e+10,1.11333,40684,2,7323,5,235106,6,0,451,132871,0


Converting to forward existential form...Done !
original formula: E(EF((p56==1)) U (!(((!(EG(((p22==1)&&(p111==1)))) + ((((p14==1)&&(p112==1))||(p21==1))&&(!((p58==1)&&(p112==1))))) * ((!(((p38==1)&&(p11...279
=> equivalent forward existential formula: (([FwdG((FwdU(Init,E(TRUE U (p56==1))) * !(((((p14==1)&&(p112==1))||(p21==1))&&(!((p58==1)&&(p112==1)))))),((p22...487
Reverse transition relation is NOT exact ! Due to transitions t15, t23, t27, t29, t31, t33, t36, t38, t42, t44, t46, t105, t106, t107, t108, t109, t110, t1...294
Hit Full ! (commute/partial/dont) 59/58/59
(forward)formula 0,1,20.1543,553996,1,0,454,2.90646e+06,273,307,2958,3.46354e+06,546
FORMULA DiscoveryGPU-PT-11a-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 110/110 places, 141/141 transitions.
Graph (complete) has 309 edges and 110 vertex of which 103 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 111 edges and 100 vertex of which 80 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 places :
Also discarding 20 output transitions
Drop transitions (Output transitions of discarded places.) removed 20 transitions
Graph (trivial) has 90 edges and 80 vertex of which 44 / 80 are part of one of the 22 SCC in 4 ms
Free SCC test removed 22 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 58 transition count 101
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 51 place count 46 transition count 79
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 60 place count 37 transition count 61
Iterating global reduction 2 with 9 rules applied. Total rules applied 69 place count 37 transition count 61
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 78 place count 28 transition count 43
Iterating global reduction 2 with 9 rules applied. Total rules applied 87 place count 28 transition count 43
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 96 place count 19 transition count 25
Iterating global reduction 2 with 9 rules applied. Total rules applied 105 place count 19 transition count 25
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 114 place count 10 transition count 16
Iterating global reduction 2 with 9 rules applied. Total rules applied 123 place count 10 transition count 16
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 10 transition count 15
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 2 with 1 rules applied. Total rules applied 125 place count 10 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 126 place count 9 transition count 14
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 128 place count 7 transition count 12
Applied a total of 128 rules in 30 ms. Remains 7 /110 variables (removed 103) and now considering 12/141 (removed 129) transitions.
[2026-05-24 05:09:40] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14477654307039722228.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10073406090307759464.kers'
[2026-05-24 05:09:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14477654307039722228.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10073406090307759464.kers]
Normalized transition count is 8 out of 9 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 8 rows 7 cols 13 entries
Finished phase 1 with 7 SingleSign rule and 0 generalized
[2026-05-24 05:09:40] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10073406090307759464.kers
Total runtime 0 ms.
[2026-05-24 05:09:40] [INFO ] Implicit Places using invariants in 18 ms returned []
[2026-05-24 05:09:40] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
[2026-05-24 05:09:40] [INFO ] Invariant cache hit.
[2026-05-24 05:09:40] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2026-05-24 05:09:40] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2026-05-24 05:09:40] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
[2026-05-24 05:09:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 2/15 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 0/15 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/16 variables, and 7 constraints, problems are : Problem set: 0 solved, 8 unsolved in 64 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 2/15 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/16 variables, and 15 constraints, problems are : Problem set: 0 solved, 8 unsolved in 60 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 125ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 126ms
Starting structural reductions in SI_CTL mode, iteration 1 : 7/110 places, 12/141 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 197 ms. Remains : 7/110 places, 12/141 transitions.
[2026-05-24 05:09:40] [INFO ] Flatten gal took : 1 ms
[2026-05-24 05:09:40] [INFO ] Flatten gal took : 0 ms
[2026-05-24 05:09:40] [INFO ] Input system was already deterministic with 12 transitions.
RANDOM walk for 146 steps (3 resets) in 5 ms. (24 steps per ms) remains 0/1 properties
FORMULA DiscoveryGPU-PT-11a-CTLFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-24 05:09:40] [INFO ] Flatten gal took : 0 ms
[2026-05-24 05:09:40] [INFO ] Flatten gal took : 0 ms
[2026-05-24 05:09:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7098680537076724858.gal : 0 ms
[2026-05-24 05:09:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1080635268298808787.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7098680537076724858.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1080635268298808787.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 141/141 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 100 transition count 131
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 100 transition count 131
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 29 place count 91 transition count 122
Iterating global reduction 0 with 9 rules applied. Total rules applied 38 place count 91 transition count 122
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 45 place count 84 transition count 115
Iterating global reduction 0 with 7 rules applied. Total rules applied 52 place count 84 transition count 115
Applied a total of 52 rules in 4 ms. Remains 84 /110 variables (removed 26) and now considering 115/141 (removed 26) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-366219220168266061.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5374986501833438563.kers'
[2026-05-24 05:09:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-366219220168266061.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5374986501833438563.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 115 rows 82 cols 228 entries
Finished phase 1 with 82 SingleSign rule and 0 generalized
[2026-05-24 05:09:40] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5374986501833438563.kers
Total runtime 1 ms.
[2026-05-24 05:09:40] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-24 05:09:40] [INFO ] Invariant cache hit.
[2026-05-24 05:09:40] [INFO ] State equation strengthened by 78 read => feed constraints.
[2026-05-24 05:09:41] [INFO ] Implicit Places using invariants and state equation in 105 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 160 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 83/110 places, 115/141 transitions.
Applied a total of 0 rules in 1 ms. Remains 83 /83 variables (removed 0) and now considering 115/115 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 165 ms. Remains : 83/110 places, 115/141 transitions.
[2026-05-24 05:09:41] [INFO ] Flatten gal took : 3 ms
[2026-05-24 05:09:41] [INFO ] Flatten gal took : 3 ms
[2026-05-24 05:09:41] [INFO ] Input system was already deterministic with 115 transitions.
[2026-05-24 05:09:41] [INFO ] Flatten gal took : 4 ms
[2026-05-24 05:09:41] [INFO ] Flatten gal took : 4 ms
[2026-05-24 05:09:41] [INFO ] Time to serialize gal into /tmp/CTLFireability1078369669312779772.gal : 1 ms
[2026-05-24 05:09:41] [INFO ] Time to serialize properties into /tmp/CTLFireability2425172180928250810.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/CTLFireability1078369669312779772.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2425172180928250810.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.54807e+10,2.95444,96608,2,23721,5,606664,6,0,435,345087,0


Converting to forward existential form...Done !
original formula: AG(EX(A(EG((p13!=1)) U EX(EF((p54==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!((E(!(EX(E(TRUE U (p54==1)))) U (!(EG((p13!=1))) * !(EX(E(TRUE U (p54==1)))))) + EG(!(...193
Reverse transition relation is NOT exact ! Due to transitions t19, t22, t26, t28, t30, t32, t34, t35, t39, t41, t43, t45, t103, t104, t105, t106, t107, t10...293
Detected timeout of ITS tools.
[2026-05-24 05:10:11] [INFO ] Flatten gal took : 4 ms
[2026-05-24 05:10:11] [INFO ] Applying decomposition
[2026-05-24 05:10:11] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph8922935091992444489.txt' '-o' '/tmp/graph8922935091992444489.bin' '-w' '/tmp/graph8922935091992444489.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8922935091992444489.bin' '-l' '-1' '-v' '-w' '/tmp/graph8922935091992444489.weights' '-q' '0' '-e' '0.001'
[2026-05-24 05:10:11] [INFO ] Decomposing Gal with order
[2026-05-24 05:10:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 05:10:11] [INFO ] Removed a total of 60 redundant transitions.
[2026-05-24 05:10:11] [INFO ] Flatten gal took : 57 ms
[2026-05-24 05:10:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 76 labels/synchronizations in 5 ms.
[2026-05-24 05:10:11] [INFO ] Time to serialize gal into /tmp/CTLFireability2669612690516383518.gal : 3 ms
[2026-05-24 05:10:11] [INFO ] Time to serialize properties into /tmp/CTLFireability12080609077679923709.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/CTLFireability2669612690516383518.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12080609077679923709.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.54807e+10,0.113264,9104,427,228,8687,2425,206,22344,50,14194,0


Converting to forward existential form...Done !
original formula: AG(EX(A(EG((i1.u2.p13!=1)) U EX(EF((i7.u10.p54==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!((E(!(EX(E(TRUE U (i7.u10.p54==1)))) U (!(EG((i1.u2.p13!=1))) * !(EX(E(TRUE U (i7.u10....220
Reverse transition relation is NOT exact ! Due to transitions t22, t26, t28, t30, t35, t39, t41, t45, u9.t106, i0.u0.t109, i1.u2.t19, i1.u2.t108, i1.u3.t11...380
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 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
(forward)formula 0,0,10.4293,264684,1,0,401397,105073,1209,1.06561e+06,297,733551,209966
FORMULA DiscoveryGPU-PT-11a-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 110/110 places, 141/141 transitions.
Graph (complete) has 309 edges and 110 vertex of which 102 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 110 edges and 99 vertex of which 77 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.1 ms
Discarding 22 places :
Also discarding 22 output transitions
Drop transitions (Output transitions of discarded places.) removed 22 transitions
Graph (trivial) has 86 edges and 77 vertex of which 42 / 77 are part of one of the 21 SCC in 0 ms
Free SCC test removed 21 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 56 transition count 99
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 48 place count 45 transition count 78
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 57 place count 36 transition count 60
Iterating global reduction 2 with 9 rules applied. Total rules applied 66 place count 36 transition count 60
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 75 place count 27 transition count 42
Iterating global reduction 2 with 9 rules applied. Total rules applied 84 place count 27 transition count 42
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 93 place count 18 transition count 24
Iterating global reduction 2 with 9 rules applied. Total rules applied 102 place count 18 transition count 24
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 111 place count 9 transition count 15
Iterating global reduction 2 with 9 rules applied. Total rules applied 120 place count 9 transition count 15
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 121 place count 9 transition count 14
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 2 with 1 rules applied. Total rules applied 122 place count 9 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 123 place count 8 transition count 13
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 125 place count 6 transition count 11
Applied a total of 125 rules in 7 ms. Remains 6 /110 variables (removed 104) and now considering 11/141 (removed 130) transitions.
[2026-05-24 05:10:21] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12537457340862539205.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4386116828469637000.kers'
[2026-05-24 05:10:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12537457340862539205.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4386116828469637000.kers]
Normalized transition count is 8 out of 9 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 8 rows 6 cols 13 entries
Finished phase 1 with 6 SingleSign rule and 0 generalized
[2026-05-24 05:10:21] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4386116828469637000.kers
Total runtime 0 ms.
[2026-05-24 05:10:21] [INFO ] Implicit Places using invariants in 15 ms returned []
[2026-05-24 05:10:21] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
[2026-05-24 05:10:21] [INFO ] Invariant cache hit.
[2026-05-24 05:10:21] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2026-05-24 05:10:21] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2026-05-24 05:10:21] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
[2026-05-24 05:10:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 2/14 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 0/14 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/15 variables, and 6 constraints, problems are : Problem set: 0 solved, 7 unsolved in 70 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 2/14 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/14 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/15 variables, and 13 constraints, problems are : Problem set: 0 solved, 7 unsolved in 53 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 135ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 135ms
Starting structural reductions in SI_CTL mode, iteration 1 : 6/110 places, 11/141 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 179 ms. Remains : 6/110 places, 11/141 transitions.
[2026-05-24 05:10:22] [INFO ] Flatten gal took : 0 ms
[2026-05-24 05:10:22] [INFO ] Flatten gal took : 0 ms
[2026-05-24 05:10:22] [INFO ] Input system was already deterministic with 11 transitions.
RANDOM walk for 225 steps (5 resets) in 12 ms. (17 steps per ms) remains 0/1 properties
FORMULA DiscoveryGPU-PT-11a-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-24 05:10:22] [INFO ] Flatten gal took : 1 ms
[2026-05-24 05:10:22] [INFO ] Flatten gal took : 0 ms
[2026-05-24 05:10:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15217977007658568566.gal : 0 ms
[2026-05-24 05:10:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2149279949873975762.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15217977007658568566.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2149279949873975762.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :
ITS runner timed out or was interrupted.

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 141/141 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 100 transition count 131
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 100 transition count 131
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 29 place count 91 transition count 122
Iterating global reduction 0 with 9 rules applied. Total rules applied 38 place count 91 transition count 122
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 45 place count 84 transition count 115
Iterating global reduction 0 with 7 rules applied. Total rules applied 52 place count 84 transition count 115
Applied a total of 52 rules in 5 ms. Remains 84 /110 variables (removed 26) and now considering 115/141 (removed 26) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11791402432084320219.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13615878586780825976.kers'
[2026-05-24 05:10:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11791402432084320219.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13615878586780825976.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 115 rows 82 cols 228 entries
Finished phase 1 with 82 SingleSign rule and 0 generalized
[2026-05-24 05:10:22] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13615878586780825976.kers
Total runtime 1 ms.
[2026-05-24 05:10:22] [INFO ] Implicit Places using invariants in 58 ms returned []
[2026-05-24 05:10:22] [INFO ] Invariant cache hit.
[2026-05-24 05:10:22] [INFO ] State equation strengthened by 78 read => feed constraints.
[2026-05-24 05:10:22] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Running 114 sub problems to find dead transitions.
[2026-05-24 05:10:22] [INFO ] Invariant cache hit.
[2026-05-24 05:10:22] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (OVERLAPS) 115/199 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 78/164 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (OVERLAPS) 0/199 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 164 constraints, problems are : Problem set: 0 solved, 114 unsolved in 3019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (OVERLAPS) 115/199 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 78/164 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 114/278 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (OVERLAPS) 0/199 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 278 constraints, problems are : Problem set: 0 solved, 114 unsolved in 3058 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6086ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 6087ms
Starting structural reductions in LTL mode, iteration 1 : 84/110 places, 115/141 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6250 ms. Remains : 84/110 places, 115/141 transitions.
[2026-05-24 05:10:28] [INFO ] Flatten gal took : 9 ms
[2026-05-24 05:10:28] [INFO ] Flatten gal took : 11 ms
[2026-05-24 05:10:28] [INFO ] Input system was already deterministic with 115 transitions.
[2026-05-24 05:10:28] [INFO ] Flatten gal took : 4 ms
[2026-05-24 05:10:28] [INFO ] Flatten gal took : 4 ms
[2026-05-24 05:10:28] [INFO ] Time to serialize gal into /tmp/CTLFireability6499779437916174277.gal : 1 ms
[2026-05-24 05:10:28] [INFO ] Time to serialize properties into /tmp/CTLFireability10432248647907839536.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/CTLFireability6499779437916174277.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10432248647907839536.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.54807e+10,1.2979,50568,2,6859,5,269424,6,0,437,175966,0


Converting to forward existential form...Done !
original formula: EG(EX(AG(EF(((p43==0)||(p112==0))))))
=> equivalent forward existential formula: [FwdG(Init,EX(!(E(TRUE U !(E(TRUE U ((p43==0)||(p112==0))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t13, t22, t26, t28, t30, t34, t35, t37, t39, t41, t43, t45, t103, t104, t105, t106, t107, t10...293
(forward)formula 0,1,27.5383,715160,1,0,412,3.69268e+06,257,313,2700,4.46199e+06,453
FORMULA DiscoveryGPU-PT-11a-CTLFireability-2024-06 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 : 110/110 places, 141/141 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 103 transition count 134
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 103 transition count 134
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 97 transition count 128
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 97 transition count 128
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 92 transition count 123
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 92 transition count 123
Applied a total of 36 rules in 5 ms. Remains 92 /110 variables (removed 18) and now considering 123/141 (removed 18) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12851912327689671796.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3891810537595581987.kers'
[2026-05-24 05:10:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12851912327689671796.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3891810537595581987.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 123 rows 90 cols 242 entries
Finished phase 1 with 90 SingleSign rule and 0 generalized
[2026-05-24 05:10:56] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3891810537595581987.kers
Total runtime 1 ms.
[2026-05-24 05:10:56] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-05-24 05:10:56] [INFO ] Invariant cache hit.
[2026-05-24 05:10:56] [INFO ] State equation strengthened by 81 read => feed constraints.
[2026-05-24 05:10:56] [INFO ] Implicit Places using invariants and state equation in 100 ms returned [91]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 148 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 91/110 places, 123/141 transitions.
Applied a total of 0 rules in 1 ms. Remains 91 /91 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 155 ms. Remains : 91/110 places, 123/141 transitions.
[2026-05-24 05:10:56] [INFO ] Flatten gal took : 3 ms
[2026-05-24 05:10:56] [INFO ] Flatten gal took : 4 ms
[2026-05-24 05:10:56] [INFO ] Input system was already deterministic with 123 transitions.
[2026-05-24 05:10:56] [INFO ] Flatten gal took : 4 ms
[2026-05-24 05:10:56] [INFO ] Flatten gal took : 3 ms
[2026-05-24 05:10:56] [INFO ] Time to serialize gal into /tmp/CTLFireability14729222676923633059.gal : 1 ms
[2026-05-24 05:10:56] [INFO ] Time to serialize properties into /tmp/CTLFireability12242075899006015143.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/CTLFireability14729222676923633059.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12242075899006015143.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.26904e+11,1.60138,60820,2,13305,5,380859,6,0,473,202423,0


Converting to forward existential form...Done !
original formula: !(E(EF(!(AF(((p96==1)&&(p111==1))))) U (AX(((((p57==1)&&(p111==1))&&((p61==1)&&(((p12==1)&&(p111==1))||(p6==1))))&&((p101==1)&&(p14!=1)))...264
=> equivalent forward existential formula: ([(FwdU(Init,E(TRUE U !(!(EG(!(((p96==1)&&(p111==1)))))))) * !(EX(!(((((p57==1)&&(p111==1))&&((p61==1)&&(((p12==...556
Reverse transition relation is NOT exact ! Due to transitions t6, t25, t35, t37, t38, t42, t44, t46, t48, t101, t103, t109, t110, t111, t112, t113, t114, t...301
Detected timeout of ITS tools.
[2026-05-24 05:11:26] [INFO ] Flatten gal took : 9 ms
[2026-05-24 05:11:26] [INFO ] Applying decomposition
[2026-05-24 05:11:26] [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/graph10620335733300566697.txt' '-o' '/tmp/graph10620335733300566697.bin' '-w' '/tmp/graph10620335733300566697.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10620335733300566697.bin' '-l' '-1' '-v' '-w' '/tmp/graph10620335733300566697.weights' '-q' '0' '-e' '0.001'
[2026-05-24 05:11:26] [INFO ] Decomposing Gal with order
[2026-05-24 05:11:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 05:11:26] [INFO ] Removed a total of 63 redundant transitions.
[2026-05-24 05:11:26] [INFO ] Flatten gal took : 12 ms
[2026-05-24 05:11:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 79 labels/synchronizations in 7 ms.
[2026-05-24 05:11:26] [INFO ] Time to serialize gal into /tmp/CTLFireability6504875253299305310.gal : 15 ms
[2026-05-24 05:11:26] [INFO ] Time to serialize properties into /tmp/CTLFireability15569032340971677273.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/CTLFireability6504875253299305310.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15569032340971677273.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.26904e+11,0.990177,41988,1053,83,71403,2730,230,202246,45,20616,0


Converting to forward existential form...Done !
original formula: !(E(EF(!(AF(((i10.u22.p96==1)&&(i0.i1.u0.p111==1))))) U (AX(((((i6.u14.p57==1)&&(i0.i1.u0.p111==1))&&((i7.u15.p61==1)&&(((i2.u4.p12==1)&&...394
=> equivalent forward existential formula: ([(FwdU(Init,E(TRUE U !(!(EG(!(((i10.u22.p96==1)&&(i0.i1.u0.p111==1)))))))) * !(EX(!(((((i6.u14.p57==1)&&(i0.i1....727
Reverse transition relation is NOT exact ! Due to transitions t6, t44, t46, t48, t103, i0.t101, i0.t38, i0.i0.t35, i0.i0.t42, i0.i0.u1.t25, i0.i0.u9.t119, ...433
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 110/110 places, 141/141 transitions.
Graph (complete) has 309 edges and 110 vertex of which 103 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 1 place count 103 transition count 124
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 21 place count 93 transition count 124
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 30 place count 84 transition count 115
Iterating global reduction 0 with 9 rules applied. Total rules applied 39 place count 84 transition count 115
Applied a total of 39 rules in 21 ms. Remains 84 /110 variables (removed 26) and now considering 115/141 (removed 26) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9118637001522170712.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13841207537144120506.kers'
[2026-05-24 05:11:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9118637001522170712.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13841207537144120506.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 115 rows 82 cols 227 entries
Finished phase 1 with 82 SingleSign rule and 0 generalized
[2026-05-24 05:11:56] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13841207537144120506.kers
Total runtime 1 ms.
[2026-05-24 05:11:56] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-24 05:11:56] [INFO ] Invariant cache hit.
[2026-05-24 05:11:56] [INFO ] State equation strengthened by 79 read => feed constraints.
[2026-05-24 05:11:56] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2026-05-24 05:11:56] [INFO ] Redundant transitions in 5 ms returned []
Running 114 sub problems to find dead transitions.
[2026-05-24 05:11:56] [INFO ] Invariant cache hit.
[2026-05-24 05:11:56] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (OVERLAPS) 115/199 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 79/165 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (OVERLAPS) 0/199 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 165 constraints, problems are : Problem set: 0 solved, 114 unsolved in 3334 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (OVERLAPS) 115/199 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 79/165 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 114/279 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (OVERLAPS) 0/199 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 279 constraints, problems are : Problem set: 0 solved, 114 unsolved in 3097 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6442ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 6443ms
Starting structural reductions in SI_CTL mode, iteration 1 : 84/110 places, 115/141 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6607 ms. Remains : 84/110 places, 115/141 transitions.
[2026-05-24 05:12:03] [INFO ] Flatten gal took : 8 ms
[2026-05-24 05:12:03] [INFO ] Flatten gal took : 3 ms
[2026-05-24 05:12:03] [INFO ] Input system was already deterministic with 115 transitions.
[2026-05-24 05:12:03] [INFO ] Flatten gal took : 2 ms
[2026-05-24 05:12:03] [INFO ] Flatten gal took : 2 ms
[2026-05-24 05:12:03] [INFO ] Time to serialize gal into /tmp/CTLFireability17459087375025946541.gal : 1 ms
[2026-05-24 05:12:03] [INFO ] Time to serialize properties into /tmp/CTLFireability16891003625351813982.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/CTLFireability17459087375025946541.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16891003625351813982.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.70113e+10,0.514369,23184,2,4082,5,121688,6,0,437,65808,0


Converting to forward existential form...Done !
original formula: EF(AG((((p101==0)&&(p85==1))&&((p111==1)&&((p66==1)||((p53==1)&&(p112==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((((p101==0)&&(p85==1))&&((p111==1)&&((p66==1)||((p53==1)&&(p112==1)))))))))] !=...161
Reverse transition relation is NOT exact ! Due to transitions t11, t27, t29, t31, t33, t34, t36, t38, t42, t44, t101, t102, t103, t104, t105, t106, t107, t...289
(forward)formula 0,0,2.89643,86040,1,0,160,432049,252,105,2620,441390,240
FORMULA DiscoveryGPU-PT-11a-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 110/110 places, 141/141 transitions.
Graph (complete) has 309 edges and 110 vertex of which 102 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 110 edges and 99 vertex of which 77 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.0 ms
Discarding 22 places :
Also discarding 22 output transitions
Drop transitions (Output transitions of discarded places.) removed 22 transitions
Graph (trivial) has 86 edges and 77 vertex of which 42 / 77 are part of one of the 21 SCC in 0 ms
Free SCC test removed 21 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 56 transition count 99
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 48 place count 45 transition count 78
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 57 place count 36 transition count 60
Iterating global reduction 2 with 9 rules applied. Total rules applied 66 place count 36 transition count 60
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 75 place count 27 transition count 42
Iterating global reduction 2 with 9 rules applied. Total rules applied 84 place count 27 transition count 42
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 93 place count 18 transition count 24
Iterating global reduction 2 with 9 rules applied. Total rules applied 102 place count 18 transition count 24
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 111 place count 9 transition count 15
Iterating global reduction 2 with 9 rules applied. Total rules applied 120 place count 9 transition count 15
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 121 place count 9 transition count 14
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 2 with 1 rules applied. Total rules applied 122 place count 9 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 123 place count 8 transition count 13
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 125 place count 6 transition count 11
Applied a total of 125 rules in 5 ms. Remains 6 /110 variables (removed 104) and now considering 11/141 (removed 130) transitions.
[2026-05-24 05:12:06] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2298362433091424519.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4728023757577199243.kers'
[2026-05-24 05:12:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2298362433091424519.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4728023757577199243.kers]
Normalized transition count is 8 out of 9 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 8 rows 6 cols 13 entries
Finished phase 1 with 6 SingleSign rule and 0 generalized
[2026-05-24 05:12:06] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4728023757577199243.kers
Total runtime 0 ms.
[2026-05-24 05:12:06] [INFO ] Implicit Places using invariants in 17 ms returned []
[2026-05-24 05:12:06] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
[2026-05-24 05:12:06] [INFO ] Invariant cache hit.
[2026-05-24 05:12:06] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2026-05-24 05:12:06] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2026-05-24 05:12:06] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
[2026-05-24 05:12:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 2/14 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 0/14 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/15 variables, and 6 constraints, problems are : Problem set: 0 solved, 7 unsolved in 50 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 2/14 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/14 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/15 variables, and 13 constraints, problems are : Problem set: 0 solved, 7 unsolved in 55 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 106ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 106ms
Starting structural reductions in SI_CTL mode, iteration 1 : 6/110 places, 11/141 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 152 ms. Remains : 6/110 places, 11/141 transitions.
[2026-05-24 05:12:06] [INFO ] Flatten gal took : 1 ms
[2026-05-24 05:12:06] [INFO ] Flatten gal took : 0 ms
[2026-05-24 05:12:06] [INFO ] Input system was already deterministic with 11 transitions.
RANDOM walk for 214 steps (5 resets) in 4 ms. (42 steps per ms) remains 0/1 properties
FORMULA DiscoveryGPU-PT-11a-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-24 05:12:06] [INFO ] Flatten gal took : 1 ms
[2026-05-24 05:12:06] [INFO ] Flatten gal took : 0 ms
[2026-05-24 05:12:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8259525163394461675.gal : 0 ms
[2026-05-24 05:12:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5470542861773231972.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8259525163394461675.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5470542861773231972.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality5470542861773231972.prop.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,6,0.002762,3848,2,9,5,35,6,0,31,20,0
Total reachable state count : 6

ITS runner timed out or was interrupted.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 141/141 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 102 transition count 133
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 102 transition count 133
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 94 transition count 125
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 94 transition count 125
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 89 transition count 120
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 89 transition count 120
Applied a total of 42 rules in 2 ms. Remains 89 /110 variables (removed 21) and now considering 120/141 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6609033441990480630.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15315975030041980227.kers'
[2026-05-24 05:12:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6609033441990480630.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15315975030041980227.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 120 rows 87 cols 236 entries
Finished phase 1 with 87 SingleSign rule and 0 generalized
[2026-05-24 05:12:06] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15315975030041980227.kers
Total runtime 0 ms.
[2026-05-24 05:12:06] [INFO ] Implicit Places using invariants in 34 ms returned []
[2026-05-24 05:12:06] [INFO ] Invariant cache hit.
[2026-05-24 05:12:06] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-05-24 05:12:06] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Running 119 sub problems to find dead transitions.
[2026-05-24 05:12:06] [INFO ] Invariant cache hit.
[2026-05-24 05:12:06] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (OVERLAPS) 120/209 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 80/171 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 119 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/209 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 171 constraints, problems are : Problem set: 0 solved, 119 unsolved in 3317 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (OVERLAPS) 120/209 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 80/171 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 119/290 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (OVERLAPS) 0/209 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 290 constraints, problems are : Problem set: 0 solved, 119 unsolved in 3402 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6729ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 6729ms
Starting structural reductions in LTL mode, iteration 1 : 89/110 places, 120/141 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6862 ms. Remains : 89/110 places, 120/141 transitions.
[2026-05-24 05:12:13] [INFO ] Flatten gal took : 8 ms
[2026-05-24 05:12:13] [INFO ] Flatten gal took : 5 ms
[2026-05-24 05:12:13] [INFO ] Input system was already deterministic with 120 transitions.
[2026-05-24 05:12:13] [INFO ] Flatten gal took : 3 ms
[2026-05-24 05:12:13] [INFO ] Flatten gal took : 3 ms
[2026-05-24 05:12:13] [INFO ] Time to serialize gal into /tmp/CTLFireability9128891505028682869.gal : 0 ms
[2026-05-24 05:12:13] [INFO ] Time to serialize properties into /tmp/CTLFireability8254712641239576540.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/CTLFireability9128891505028682869.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8254712641239576540.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,1.01122e+11,1.05013,38072,2,4441,5,209750,6,0,460,131000,0


Converting to forward existential form...Done !
original formula: (EG(((AX((p71==1)) + E(((p88==1)&&(p112==1)) U (p4==1))) * AF(((p89==0)||(p111==0))))) + (EF(((p16==1)&&(p111==1))) * (AX(((p44==1) + (EX...257
=> equivalent forward existential formula: ([((Init * !(EG(((!(EX(!((p71==1)))) + E(((p88==1)&&(p112==1)) U (p4==1))) * !(EG(!(((p89==0)||(p111==0)))))))))...677
Reverse transition relation is NOT exact ! Due to transitions t27, t29, t31, t33, t35, t36, t38, t42, t46, t106, t107, t108, t109, t110, t111, t112, t113, ...290
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,12.4277,356280,1,0,509,2.20924e+06,295,316,2948,2.02459e+06,684
FORMULA DiscoveryGPU-PT-11a-CTLFireability-2024-10 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 : 110/110 places, 141/141 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 101 transition count 132
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 101 transition count 132
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 26 place count 93 transition count 124
Iterating global reduction 0 with 8 rules applied. Total rules applied 34 place count 93 transition count 124
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 41 place count 86 transition count 117
Iterating global reduction 0 with 7 rules applied. Total rules applied 48 place count 86 transition count 117
Applied a total of 48 rules in 6 ms. Remains 86 /110 variables (removed 24) and now considering 117/141 (removed 24) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14764717368319737192.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11010934128717847994.kers'
[2026-05-24 05:12:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14764717368319737192.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11010934128717847994.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 117 rows 84 cols 232 entries
Finished phase 1 with 84 SingleSign rule and 0 generalized
[2026-05-24 05:12:25] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11010934128717847994.kers
Total runtime 1 ms.
[2026-05-24 05:12:25] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-05-24 05:12:25] [INFO ] Invariant cache hit.
[2026-05-24 05:12:25] [INFO ] State equation strengthened by 79 read => feed constraints.
[2026-05-24 05:12:25] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Running 116 sub problems to find dead transitions.
[2026-05-24 05:12:25] [INFO ] Invariant cache hit.
[2026-05-24 05:12:25] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 117/203 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 79/167 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 0/203 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 167 constraints, problems are : Problem set: 0 solved, 116 unsolved in 3254 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 117/203 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 79/167 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 116/283 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (OVERLAPS) 0/203 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 283 constraints, problems are : Problem set: 0 solved, 116 unsolved in 3299 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6562ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 6562ms
Starting structural reductions in LTL mode, iteration 1 : 86/110 places, 117/141 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6695 ms. Remains : 86/110 places, 117/141 transitions.
[2026-05-24 05:12:32] [INFO ] Flatten gal took : 4 ms
[2026-05-24 05:12:32] [INFO ] Flatten gal took : 5 ms
[2026-05-24 05:12:32] [INFO ] Input system was already deterministic with 117 transitions.
[2026-05-24 05:12:32] [INFO ] Flatten gal took : 2 ms
[2026-05-24 05:12:32] [INFO ] Flatten gal took : 2 ms
[2026-05-24 05:12:32] [INFO ] Time to serialize gal into /tmp/CTLFireability15539537250341958075.gal : 0 ms
[2026-05-24 05:12:32] [INFO ] Time to serialize properties into /tmp/CTLFireability5403222958212432070.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/CTLFireability15539537250341958075.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5403222958212432070.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,8.80741e+10,0.952508,38148,2,5287,5,225711,6,0,447,128609,0


Converting to forward existential form...Done !
original formula: A(!((AF(((p108==1)&&(p112==1))) * EX(((E(((p8==1)&&(p112==1)) U ((p109==1)&&(p111==1))) + (p68==1)) + (((p45==1)&&(p111==1))||((((p13==1)...260
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U ((p52==1)&&(p111==1))))))) * !(E(!(E(TRUE U ((p52==1)&&(p111==1)))) U (!(!((!(EG(!(((p...411
Reverse transition relation is NOT exact ! Due to transitions t20, t23, t27, t29, t31, t33, t35, t36, t40, t44, t46, t97, t101, t105, t106, t107, t108, t10...299
Detected timeout of ITS tools.
[2026-05-24 05:13:02] [INFO ] Flatten gal took : 2 ms
[2026-05-24 05:13:02] [INFO ] Applying decomposition
[2026-05-24 05:13:02] [INFO ] Flatten gal took : 2 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/graph7198908532813242693.txt' '-o' '/tmp/graph7198908532813242693.bin' '-w' '/tmp/graph7198908532813242693.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7198908532813242693.bin' '-l' '-1' '-v' '-w' '/tmp/graph7198908532813242693.weights' '-q' '0' '-e' '0.001'
[2026-05-24 05:13:02] [INFO ] Decomposing Gal with order
[2026-05-24 05:13:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 05:13:02] [INFO ] Removed a total of 75 redundant transitions.
[2026-05-24 05:13:02] [INFO ] Flatten gal took : 6 ms
[2026-05-24 05:13:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 65 labels/synchronizations in 3 ms.
[2026-05-24 05:13:02] [INFO ] Time to serialize gal into /tmp/CTLFireability1617167421314744227.gal : 2 ms
[2026-05-24 05:13:02] [INFO ] Time to serialize properties into /tmp/CTLFireability6445207068061482449.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/CTLFireability1617167421314744227.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6445207068061482449.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.80741e+10,0.337241,21076,466,71,46016,261,234,46893,30,1877,0


Converting to forward existential form...Done !
original formula: A(!((AF(((i10.u34.p108==1)&&(i11.u36.p112==1))) * EX(((E(((i0.u2.p8==1)&&(i11.u36.p112==1)) U ((i10.u34.p109==1)&&(i1.u35.p111==1))) + (i...396
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U ((i5.i0.u16.p52==1)&&(i1.u35.p111==1))))))) * !(E(!(E(TRUE U ((i5.i0.u16.p52==1)&&(i1....581
Reverse transition relation is NOT exact ! Due to transitions t27, t29, t31, t33, t35, t36, t40, t44, t46, t97, t101, i0.u1.t111, i1.u5.t112, i1.u35.t110, ...394
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 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
(forward)formula 0,1,4.20345,167292,1,0,355574,1164,1273,527323,145,8178,273959
FORMULA DiscoveryGPU-PT-11a-CTLFireability-2024-11 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 : 110/110 places, 141/141 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 101 transition count 132
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 101 transition count 132
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 26 place count 93 transition count 124
Iterating global reduction 0 with 8 rules applied. Total rules applied 34 place count 93 transition count 124
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 40 place count 87 transition count 118
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 87 transition count 118
Applied a total of 46 rules in 7 ms. Remains 87 /110 variables (removed 23) and now considering 118/141 (removed 23) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7245415136566887390.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4958626340253749854.kers'
[2026-05-24 05:13:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7245415136566887390.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4958626340253749854.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 118 rows 85 cols 233 entries
Finished phase 1 with 85 SingleSign rule and 0 generalized
[2026-05-24 05:13:06] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4958626340253749854.kers
Total runtime 1 ms.
[2026-05-24 05:13:06] [INFO ] Implicit Places using invariants in 39 ms returned []
[2026-05-24 05:13:06] [INFO ] Invariant cache hit.
[2026-05-24 05:13:06] [INFO ] State equation strengthened by 79 read => feed constraints.
[2026-05-24 05:13:06] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Running 117 sub problems to find dead transitions.
[2026-05-24 05:13:06] [INFO ] Invariant cache hit.
[2026-05-24 05:13:06] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (OVERLAPS) 118/205 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 79/168 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (OVERLAPS) 0/205 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 168 constraints, problems are : Problem set: 0 solved, 117 unsolved in 3160 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (OVERLAPS) 118/205 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 79/168 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 117/285 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (OVERLAPS) 0/205 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 285 constraints, problems are : Problem set: 0 solved, 117 unsolved in 3156 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6327ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 6327ms
Starting structural reductions in LTL mode, iteration 1 : 87/110 places, 118/141 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6453 ms. Remains : 87/110 places, 118/141 transitions.
[2026-05-24 05:13:13] [INFO ] Flatten gal took : 6 ms
[2026-05-24 05:13:13] [INFO ] Flatten gal took : 5 ms
[2026-05-24 05:13:13] [INFO ] Input system was already deterministic with 118 transitions.
[2026-05-24 05:13:13] [INFO ] Flatten gal took : 2 ms
[2026-05-24 05:13:13] [INFO ] Flatten gal took : 2 ms
[2026-05-24 05:13:13] [INFO ] Time to serialize gal into /tmp/CTLFireability6884697575845460428.gal : 1 ms
[2026-05-24 05:13:13] [INFO ] Time to serialize properties into /tmp/CTLFireability3739837349387447314.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/CTLFireability6884697575845460428.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3739837349387447314.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,9.15019e+10,1.56658,59152,2,7627,5,334326,6,0,451,189942,0


Converting to forward existential form...Done !
original formula: EF(EG((AX((((p6==0)||(p111==0))&&((p75==0)||(p111==0)))) * E((((p43!=1)||(p91==1))||(p94==1)) U EF(((p44==1)&&(p112==1)))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(!(EX(!((((p6==0)||(p111==0))&&((p75==0)||(p111==0)))))) * E((((p43!=1)||(p91==1))||(p94==...205
Reverse transition relation is NOT exact ! Due to transitions t14, t23, t27, t29, t31, t35, t36, t38, t40, t42, t44, t105, t106, t107, t108, t109, t110, t1...294
(forward)formula 0,1,8.04844,229012,1,0,180,1.23523e+06,269,118,2802,1.27999e+06,265
FORMULA DiscoveryGPU-PT-11a-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 141/141 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 101 transition count 132
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 101 transition count 132
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 27 place count 92 transition count 123
Iterating global reduction 0 with 9 rules applied. Total rules applied 36 place count 92 transition count 123
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 87 transition count 118
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 87 transition count 118
Applied a total of 46 rules in 9 ms. Remains 87 /110 variables (removed 23) and now considering 118/141 (removed 23) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4126247694818275445.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10398138769053484623.kers'
[2026-05-24 05:13:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4126247694818275445.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10398138769053484623.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 118 rows 85 cols 233 entries
Finished phase 1 with 85 SingleSign rule and 0 generalized
[2026-05-24 05:13:21] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10398138769053484623.kers
Total runtime 1 ms.
[2026-05-24 05:13:21] [INFO ] Implicit Places using invariants in 34 ms returned []
[2026-05-24 05:13:21] [INFO ] Invariant cache hit.
[2026-05-24 05:13:21] [INFO ] State equation strengthened by 79 read => feed constraints.
[2026-05-24 05:13:21] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 87/110 places, 118/141 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 127 ms. Remains : 87/110 places, 118/141 transitions.
[2026-05-24 05:13:21] [INFO ] Flatten gal took : 2 ms
[2026-05-24 05:13:21] [INFO ] Flatten gal took : 2 ms
[2026-05-24 05:13:21] [INFO ] Input system was already deterministic with 118 transitions.
[2026-05-24 05:13:21] [INFO ] Flatten gal took : 6 ms
[2026-05-24 05:13:21] [INFO ] Flatten gal took : 2 ms
[2026-05-24 05:13:21] [INFO ] Time to serialize gal into /tmp/CTLFireability11613375192753923590.gal : 0 ms
[2026-05-24 05:13:21] [INFO ] Time to serialize properties into /tmp/CTLFireability7691074916010634869.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/CTLFireability11613375192753923590.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7691074916010634869.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,9.15019e+10,1.17028,45500,2,5107,5,269735,6,0,451,138764,0


Converting to forward existential form...Done !
original formula: E(((AX(((!(((p35==1)&&(p111==1))) + AG(((p9==1)&&(p111==1)))) + ((!((p58==1)&&(p112==1)))&&(!((p69==1)&&(p111==1)))))) + !(E(AF(((p28==1)...293
=> equivalent forward existential formula: [(FwdU(Init,((!(EX(!(((!(((p35==1)&&(p111==1))) + !(E(TRUE U !(((p9==1)&&(p111==1)))))) + ((!((p58==1)&&(p112==1...464
Reverse transition relation is NOT exact ! Due to transitions t3, t20, t27, t29, t31, t33, t35, t38, t40, t42, t44, t105, t106, t107, t108, t109, t110, t11...293
Detected timeout of ITS tools.
[2026-05-24 05:13:51] [INFO ] Flatten gal took : 2 ms
[2026-05-24 05:13:51] [INFO ] Applying decomposition
[2026-05-24 05:13:51] [INFO ] Flatten gal took : 2 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/graph16284680879629540503.txt' '-o' '/tmp/graph16284680879629540503.bin' '-w' '/tmp/graph16284680879629540503.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16284680879629540503.bin' '-l' '-1' '-v' '-w' '/tmp/graph16284680879629540503.weights' '-q' '0' '-e' '0.001'
[2026-05-24 05:13:51] [INFO ] Decomposing Gal with order
[2026-05-24 05:13:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 05:13:51] [INFO ] Removed a total of 73 redundant transitions.
[2026-05-24 05:13:51] [INFO ] Flatten gal took : 5 ms
[2026-05-24 05:13:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 61 labels/synchronizations in 2 ms.
[2026-05-24 05:13:51] [INFO ] Time to serialize gal into /tmp/CTLFireability15876073104528490693.gal : 1 ms
[2026-05-24 05:13:51] [INFO ] Time to serialize properties into /tmp/CTLFireability7514823254707851413.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/CTLFireability15876073104528490693.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7514823254707851413.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,9.15019e+10,0.069853,6932,208,91,5064,1541,216,11954,36,7297,0


Converting to forward existential form...Done !
original formula: E(((AX(((!(((i4.u11.p35==1)&&(i0.u1.p111==1))) + AG(((i0.u2.p9==1)&&(i0.u1.p111==1)))) + ((!((i6.u19.p58==1)&&(i1.u4.p112==1)))&&(!((i7.u...413
=> equivalent forward existential formula: [(FwdU(Init,((!(EX(!(((!(((i4.u11.p35==1)&&(i0.u1.p111==1))) + !(E(TRUE U !(((i0.u2.p9==1)&&(i0.u1.p111==1))))))...598
Reverse transition relation is NOT exact ! Due to transitions t27, t29, t31, t33, t35, t38, t40, t42, t44, i0.u0.t110, i0.u1.t111, i1.t20, i1.u3.t3, i1.u3....389
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
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
(forward)formula 0,1,11.5861,254872,1,0,344839,20529,1296,1.58817e+06,207,334763,201979
FORMULA DiscoveryGPU-PT-11a-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 110/110 places, 141/141 transitions.
Graph (complete) has 309 edges and 110 vertex of which 102 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 1 place count 102 transition count 123
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 21 place count 92 transition count 123
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 31 place count 82 transition count 113
Iterating global reduction 0 with 10 rules applied. Total rules applied 41 place count 82 transition count 113
Applied a total of 41 rules in 10 ms. Remains 82 /110 variables (removed 28) and now considering 113/141 (removed 28) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2587486389111480313.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9030664325364768032.kers'
[2026-05-24 05:14:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2587486389111480313.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9030664325364768032.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 113 rows 80 cols 224 entries
Finished phase 1 with 80 SingleSign rule and 0 generalized
[2026-05-24 05:14:03] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9030664325364768032.kers
Total runtime 1 ms.
[2026-05-24 05:14:03] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-24 05:14:03] [INFO ] Invariant cache hit.
[2026-05-24 05:14:03] [INFO ] State equation strengthened by 78 read => feed constraints.
[2026-05-24 05:14:03] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2026-05-24 05:14:03] [INFO ] Redundant transitions in 2 ms returned []
Running 112 sub problems to find dead transitions.
[2026-05-24 05:14:03] [INFO ] Invariant cache hit.
[2026-05-24 05:14:03] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (OVERLAPS) 113/195 variables, 82/84 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 78/162 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 0/195 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 162 constraints, problems are : Problem set: 0 solved, 112 unsolved in 3236 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (OVERLAPS) 113/195 variables, 82/84 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 78/162 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 112/274 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (OVERLAPS) 0/195 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 274 constraints, problems are : Problem set: 0 solved, 112 unsolved in 3046 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6287ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 6289ms
Starting structural reductions in SI_CTL mode, iteration 1 : 82/110 places, 113/141 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6432 ms. Remains : 82/110 places, 113/141 transitions.
[2026-05-24 05:14:09] [INFO ] Flatten gal took : 2 ms
[2026-05-24 05:14:09] [INFO ] Flatten gal took : 1 ms
[2026-05-24 05:14:09] [INFO ] Input system was already deterministic with 113 transitions.
[2026-05-24 05:14:09] [INFO ] Flatten gal took : 2 ms
[2026-05-24 05:14:09] [INFO ] Flatten gal took : 2 ms
[2026-05-24 05:14:09] [INFO ] Time to serialize gal into /tmp/CTLFireability7755702349338224788.gal : 1 ms
[2026-05-24 05:14:09] [INFO ] Time to serialize properties into /tmp/CTLFireability3199586568664481573.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/CTLFireability7755702349338224788.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3199586568664481573.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.2817e+10,0.817799,33396,2,6737,5,188392,6,0,428,96533,0


Converting to forward existential form...Done !
original formula: EG(E(EF((((p18==1)&&(p112==1))&&(p108==1))) U ((AG(E((p104==1) U ((p34==1)&&(p112==1)))) + AG(!(((p73==1)&&(p112==1))))) + ((p104==1)&&(p...166
=> equivalent forward existential formula: [FwdG(Init,E(E(TRUE U (((p18==1)&&(p112==1))&&(p108==1))) U ((!(E(TRUE U !(E((p104==1) U ((p34==1)&&(p112==1))))...239
Reverse transition relation is NOT exact ! Due to transitions t7, t25, t27, t29, t31, t33, t34, t36, t38, t40, t44, t101, t102, t103, t104, t105, t106, t10...287
Detected timeout of ITS tools.
[2026-05-24 05:14:39] [INFO ] Flatten gal took : 2 ms
[2026-05-24 05:14:39] [INFO ] Applying decomposition
[2026-05-24 05:14:39] [INFO ] Flatten gal took : 2 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/graph4689079923850070687.txt' '-o' '/tmp/graph4689079923850070687.bin' '-w' '/tmp/graph4689079923850070687.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4689079923850070687.bin' '-l' '-1' '-v' '-w' '/tmp/graph4689079923850070687.weights' '-q' '0' '-e' '0.001'
[2026-05-24 05:14:39] [INFO ] Decomposing Gal with order
[2026-05-24 05:14:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 05:14:39] [INFO ] Removed a total of 71 redundant transitions.
[2026-05-24 05:14:39] [INFO ] Flatten gal took : 10 ms
[2026-05-24 05:14:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 61 labels/synchronizations in 2 ms.
[2026-05-24 05:14:39] [INFO ] Time to serialize gal into /tmp/CTLFireability13015623661040565750.gal : 2 ms
[2026-05-24 05:14:39] [INFO ] Time to serialize properties into /tmp/CTLFireability67292145556570104.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/CTLFireability13015623661040565750.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability67292145556570104.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 -...261
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.2817e+10,0.044794,5924,214,105,3141,473,202,8369,36,3529,0


Converting to forward existential form...Done !
original formula: EG(E(EF((((u4.p18==1)&&(i1.u32.p112==1))&&(i11.u31.p108==1))) U ((AG(E((i11.u29.p104==1) U ((i4.u8.p34==1)&&(i1.u32.p112==1)))) + AG(!(((...234
=> equivalent forward existential formula: [FwdG(Init,E(E(TRUE U (((u4.p18==1)&&(i1.u32.p112==1))&&(i11.u31.p108==1))) U ((!(E(TRUE U !(E((i11.u29.p104==1)...307
Reverse transition relation is NOT exact ! Due to transitions t25, t27, t29, t31, t33, t34, t38, t40, t44, t112, i0.u0.t106, i1.t36, i1.u3.t107, i1.u32.t7,...371
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
(forward)formula 0,1,1.06597,43440,1,0,89929,1357,1141,121831,171,11642,82384
FORMULA DiscoveryGPU-PT-11a-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 110/110 places, 141/141 transitions.
Graph (complete) has 309 edges and 110 vertex of which 102 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 1 place count 102 transition count 123
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 21 place count 92 transition count 123
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 31 place count 82 transition count 113
Iterating global reduction 0 with 10 rules applied. Total rules applied 41 place count 82 transition count 113
Applied a total of 41 rules in 20 ms. Remains 82 /110 variables (removed 28) and now considering 113/141 (removed 28) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5330655655924003031.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12620445361411493942.kers'
[2026-05-24 05:14:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5330655655924003031.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12620445361411493942.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 113 rows 80 cols 224 entries
Finished phase 1 with 80 SingleSign rule and 0 generalized
[2026-05-24 05:14:40] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12620445361411493942.kers
Total runtime 1 ms.
[2026-05-24 05:14:40] [INFO ] Implicit Places using invariants in 39 ms returned []
[2026-05-24 05:14:40] [INFO ] Invariant cache hit.
[2026-05-24 05:14:40] [INFO ] State equation strengthened by 78 read => feed constraints.
[2026-05-24 05:14:41] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2026-05-24 05:14:41] [INFO ] Redundant transitions in 4 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_CTL mode, iteration 1 : 82/110 places, 113/141 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 168 ms. Remains : 82/110 places, 113/141 transitions.
[2026-05-24 05:14:41] [INFO ] Flatten gal took : 2 ms
[2026-05-24 05:14:41] [INFO ] Flatten gal took : 1 ms
[2026-05-24 05:14:41] [INFO ] Input system was already deterministic with 113 transitions.
[2026-05-24 05:14:41] [INFO ] Flatten gal took : 2 ms
[2026-05-24 05:14:41] [INFO ] Flatten gal took : 2 ms
[2026-05-24 05:14:41] [INFO ] Time to serialize gal into /tmp/CTLFireability1102579839836135425.gal : 1 ms
[2026-05-24 05:14:41] [INFO ] Time to serialize properties into /tmp/CTLFireability8012875153426745361.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/CTLFireability1102579839836135425.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8012875153426745361.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.2817e+10,0.672056,29972,2,5982,5,161616,6,0,428,89731,0


Converting to forward existential form...Done !
original formula: EG(AG(E(A(((p77==1)&&(p111==1)) U EF((p88==1))) U EG(!(((p63==1)&&(p112==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(E(!((E(!(E(TRUE U (p88==1))) U (!(((p77==1)&&(p111==1))) * !(E(TRUE U (p88==1))))) + EG(...225
Reverse transition relation is NOT exact ! Due to transitions t9, t25, t27, t31, t33, t34, t36, t38, t40, t42, t44, t101, t102, t103, t104, t105, t106, t10...287
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,22.8808,652876,1,0,911,3.71681e+06,270,567,2724,4.53084e+06,1013
FORMULA DiscoveryGPU-PT-11a-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2026-05-24 05:15:04] [INFO ] Flatten gal took : 3 ms
[2026-05-24 05:15:04] [INFO ] Flatten gal took : 2 ms
[2026-05-24 05:15:04] [INFO ] Applying decomposition
[2026-05-24 05:15:04] [INFO ] Flatten gal took : 2 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/graph6174260263286229102.txt' '-o' '/tmp/graph6174260263286229102.bin' '-w' '/tmp/graph6174260263286229102.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6174260263286229102.bin' '-l' '-1' '-v' '-w' '/tmp/graph6174260263286229102.weights' '-q' '0' '-e' '0.001'
[2026-05-24 05:15:04] [INFO ] Decomposing Gal with order
[2026-05-24 05:15:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 05:15:04] [INFO ] Removed a total of 85 redundant transitions.
[2026-05-24 05:15:04] [INFO ] Flatten gal took : 6 ms
[2026-05-24 05:15:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 87 labels/synchronizations in 3 ms.
[2026-05-24 05:15:04] [INFO ] Time to serialize gal into /tmp/CTLFireability18065650803927201077.gal : 1 ms
[2026-05-24 05:15:04] [INFO ] Time to serialize properties into /tmp/CTLFireability6792864787198854139.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/CTLFireability18065650803927201077.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6792864787198854139.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.7282e+11,0.118289,9176,127,25,12751,168,271,12680,35,722,0


Converting to forward existential form...Done !
original formula: !(E(EF(!(AF(((i10.i1.u38.p96==1)&&(i9.u44.p111==1))))) U (AX(((((i6.i1.u22.p57==1)&&(i9.u44.p111==1))&&((i7.u24.p61==1)&&(((i1.u4.p12==1)...389
=> equivalent forward existential formula: ([(FwdU(Init,E(TRUE U !(!(EG(!(((i10.i1.u38.p96==1)&&(i9.u44.p111==1)))))))) * !(EX(!(((((i6.i1.u22.p57==1)&&(i9...733
Reverse transition relation is NOT exact ! Due to transitions t107, t112, t116, i0.u0.t130, i0.u1.t131, i1.u6.t133, i3.i0.u8.t129, i3.i1.u10.t128, i4.u12.t...453
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
(forward)formula 0,0,0.496709,24280,1,0,44583,270,1685,72222,154,1165,47560
FORMULA DiscoveryGPU-PT-11a-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 387562 ms.

BK_STOP 1779599704677

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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