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-177955695400234.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-06a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-tall-177955695400234
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.0K Mar 6 16:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Mar 6 16:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Mar 6 16:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Mar 6 16:11 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.7K Mar 15 09:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 09:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 09:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 09:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 6 16:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Mar 6 16:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Mar 6 16:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Mar 6 16:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:10 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 22K 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-06a-CTLFireability-2024-00
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-2024-01
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-2024-02
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-2024-03
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-2024-04
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-2024-05
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-2024-06
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-2024-07
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-2024-08
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-2024-09
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-2024-10
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-2024-11
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-2024-12
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-2024-13
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-2024-14
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779594367019

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-06a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-24 03:46:08] [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 03:46:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 03:46:08] [INFO ] Load time of PNML (sax parser for PT used): 48 ms
[2026-05-24 03:46:08] [INFO ] Transformed 63 places.
[2026-05-24 03:46:08] [INFO ] Transformed 85 transitions.
[2026-05-24 03:46:08] [INFO ] Found NUPN structural information;
[2026-05-24 03:46:08] [INFO ] Parsed PT model containing 63 places and 85 transitions and 273 arcs in 134 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Initial state reduction rules removed 1 formulas.
FORMULA DiscoveryGPU-PT-06a-CTLFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 85/85 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 62 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 62 transition count 84
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 8 place count 62 transition count 78
Applied a total of 8 rules in 20 ms. Remains 62 /63 variables (removed 1) and now considering 78/85 (removed 7) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1546694509318799348.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8135834221495633691.kers'
[2026-05-24 03:46:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1546694509318799348.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8135834221495633691.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 78 rows 60 cols 150 entries
Finished phase 1 with 60 SingleSign rule and 0 generalized
[2026-05-24 03:46:08] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8135834221495633691.kers
Total runtime 1 ms.
[2026-05-24 03:46:08] [INFO ] Implicit Places using invariants in 182 ms returned []
[2026-05-24 03:46:08] [INFO ] Invariant cache hit.
[2026-05-24 03:46:08] [INFO ] State equation strengthened by 48 read => feed constraints.
[2026-05-24 03:46:08] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
Running 77 sub problems to find dead transitions.
[2026-05-24 03:46:08] [INFO ] Invariant cache hit.
[2026-05-24 03:46:08] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (OVERLAPS) 78/140 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 48/112 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (OVERLAPS) 0/140 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 112 constraints, problems are : Problem set: 0 solved, 77 unsolved in 1947 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (OVERLAPS) 78/140 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 48/112 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 77/189 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (OVERLAPS) 0/140 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 189 constraints, problems are : Problem set: 0 solved, 77 unsolved in 1741 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3724ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 3737ms
Starting structural reductions in LTL mode, iteration 1 : 62/63 places, 78/85 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4091 ms. Remains : 62/63 places, 78/85 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2026-05-24 03:46:12] [INFO ] Invariant cache hit.
[2026-05-24 03:46:12] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-24 03:46:12] [INFO ] Invariant cache hit.
[2026-05-24 03:46:12] [INFO ] State equation strengthened by 48 read => feed constraints.
[2026-05-24 03:46:12] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 89 ms. Remains : 62/62 places, 78/78 transitions.
Support contains 49 out of 62 places after structural reductions.
[2026-05-24 03:46:12] [INFO ] Flatten gal took : 22 ms
[2026-05-24 03:46:12] [INFO ] Flatten gal took : 8 ms
[2026-05-24 03:46:12] [INFO ] Input system was already deterministic with 78 transitions.
RANDOM walk for 40000 steps (613 resets) in 1145 ms. (34 steps per ms) remains 2/58 properties
BEST_FIRST walk for 40001 steps (8 resets) in 339 ms. (117 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (100 resets) in 109 ms. (363 steps per ms) remains 2/2 properties
[2026-05-24 03:46:13] [INFO ] Invariant cache hit.
[2026-05-24 03:46:13] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/18 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 30/48 variables, 14/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 11/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp42 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 22/70 variables, 9/50 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/70 variables, 7/57 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/70 variables, 0/57 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp27 is UNSAT
After SMT solving in domain Real declared 83/140 variables, and 64 constraints, problems are : Problem set: 2 solved, 0 unsolved in 55 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 37/62 constraints, ReadFeed: 25/48 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
[2026-05-24 03:46:13] [INFO ] Flatten gal took : 5 ms
[2026-05-24 03:46:13] [INFO ] Flatten gal took : 6 ms
[2026-05-24 03:46:13] [INFO ] Input system was already deterministic with 78 transitions.
Computed a total of 9 stabilizing places and 7 stable transitions
Graph (complete) has 171 edges and 62 vertex of which 57 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 57 transition count 73
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 57 transition count 73
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 54 transition count 70
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 54 transition count 70
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 53 transition count 69
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 53 transition count 69
Applied a total of 18 rules in 5 ms. Remains 53 /62 variables (removed 9) and now considering 69/78 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13033703695784025166.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15203244728845621034.kers'
[2026-05-24 03:46:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13033703695784025166.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15203244728845621034.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 69 rows 51 cols 136 entries
Finished phase 1 with 51 SingleSign rule and 0 generalized
[2026-05-24 03:46:13] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15203244728845621034.kers
Total runtime 0 ms.
[2026-05-24 03:46:13] [INFO ] Implicit Places using invariants in 29 ms returned []
[2026-05-24 03:46:13] [INFO ] Invariant cache hit.
[2026-05-24 03:46:13] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-24 03:46:13] [INFO ] Implicit Places using invariants and state equation in 53 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 83 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 52/62 places, 69/78 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 69/69 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 89 ms. Remains : 52/62 places, 69/78 transitions.
[2026-05-24 03:46:13] [INFO ] Flatten gal took : 3 ms
[2026-05-24 03:46:13] [INFO ] Flatten gal took : 3 ms
[2026-05-24 03:46:13] [INFO ] Input system was already deterministic with 69 transitions.
[2026-05-24 03:46:13] [INFO ] Flatten gal took : 3 ms
[2026-05-24 03:46:13] [INFO ] Flatten gal took : 3 ms
[2026-05-24 03:46:13] [INFO ] Time to serialize gal into /tmp/CTLFireability16435046616745629959.gal : 2 ms
[2026-05-24 03:46:13] [INFO ] Time to serialize properties into /tmp/CTLFireability11957371901106978282.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/CTLFireability16435046616745629959.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11957371901106978282.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.38698e+06,0.058223,6132,2,948,5,13432,6,0,270,9506,0


Converting to forward existential form...Done !
original formula: AX(EF((EX((AG(((p32==1)&&(p61==1))) * (p3==0))) * A(((EX(((p40==1)&&(p61==1))) * (p52==1)) * (p61==1)) U (E(((p25==1)&&(p61==1)) U ((p45=...186
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U (EX((!(E(TRUE U !(((p32==1)&&(p61==1))))) * (p3==0))) * !((E(!((E(((p25==1)&&(p61==1)) U...398
Reverse transition relation is NOT exact ! Due to transitions t11, t14, t22, t25, t27, t54, t56, t59, t62, t63, t64, t65, t66, t67, t68, Intersection with...235
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,1.70396,65256,1,0,411,330880,178,279,1704,455231,468
FORMULA DiscoveryGPU-PT-06a-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Graph (complete) has 171 edges and 62 vertex of which 57 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 1 place count 57 transition count 69
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 53 transition count 69
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 13 place count 49 transition count 65
Iterating global reduction 0 with 4 rules applied. Total rules applied 17 place count 49 transition count 65
Applied a total of 17 rules in 17 ms. Remains 49 /62 variables (removed 13) and now considering 65/78 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11432286001225682028.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9906663575796209802.kers'
[2026-05-24 03:46:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11432286001225682028.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9906663575796209802.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 65 rows 47 cols 127 entries
Finished phase 1 with 47 SingleSign rule and 0 generalized
[2026-05-24 03:46:15] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9906663575796209802.kers
Total runtime 0 ms.
[2026-05-24 03:46:15] [INFO ] Implicit Places using invariants in 30 ms returned []
[2026-05-24 03:46:15] [INFO ] Invariant cache hit.
[2026-05-24 03:46:15] [INFO ] State equation strengthened by 44 read => feed constraints.
[2026-05-24 03:46:15] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2026-05-24 03:46:15] [INFO ] Redundant transitions in 1 ms returned []
Running 64 sub problems to find dead transitions.
[2026-05-24 03:46:15] [INFO ] Invariant cache hit.
[2026-05-24 03:46:15] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (OVERLAPS) 65/114 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 44/95 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 64 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/114 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/114 variables, and 95 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1428 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (OVERLAPS) 65/114 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 44/95 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 64/159 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 0/114 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 114/114 variables, and 159 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1209 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2646ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 2647ms
Starting structural reductions in SI_CTL mode, iteration 1 : 49/62 places, 65/78 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2760 ms. Remains : 49/62 places, 65/78 transitions.
[2026-05-24 03:46:18] [INFO ] Flatten gal took : 3 ms
[2026-05-24 03:46:18] [INFO ] Flatten gal took : 4 ms
[2026-05-24 03:46:18] [INFO ] Input system was already deterministic with 65 transitions.
[2026-05-24 03:46:18] [INFO ] Flatten gal took : 3 ms
[2026-05-24 03:46:18] [INFO ] Flatten gal took : 3 ms
[2026-05-24 03:46:18] [INFO ] Time to serialize gal into /tmp/CTLFireability4898366630546520330.gal : 1 ms
[2026-05-24 03:46:18] [INFO ] Time to serialize properties into /tmp/CTLFireability180345033259592328.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/CTLFireability4898366630546520330.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability180345033259592328.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
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,593921,0.035347,5548,2,377,5,9033,6,0,253,5422,0


Converting to forward existential form...Done !
original formula: EF(AG(E((E(((p17==1)&&(p61==1)) U (p36==1)) + ((p53==1)&&(p62==1))) U (EF(((p55==1)&&(p61==1))) * (((p5==1)&&(p61==1))||(((p26==1)&&(p61=...174
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(E((E(((p17==1)&&(p61==1)) U (p36==1)) + ((p53==1)&&(p62==1))) U (E(TRUE U ((p55...244
Reverse transition relation is NOT exact ! Due to transitions t1, t18, t20, t23, t25, t55, t58, t59, t60, t61, t62, t63, t64, Intersection with reachable ...224
(forward)formula 0,0,0.299478,17520,1,0,158,78502,161,104,1519,84887,213
FORMULA DiscoveryGPU-PT-06a-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Graph (complete) has 171 edges and 62 vertex of which 57 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 1 place count 57 transition count 69
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 53 transition count 69
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 14 place count 48 transition count 64
Iterating global reduction 0 with 5 rules applied. Total rules applied 19 place count 48 transition count 64
Applied a total of 19 rules in 6 ms. Remains 48 /62 variables (removed 14) and now considering 64/78 (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-16766994578645557098.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10173404720133939974.kers'
[2026-05-24 03:46:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16766994578645557098.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10173404720133939974.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 64 rows 46 cols 126 entries
Finished phase 1 with 46 SingleSign rule and 0 generalized
[2026-05-24 03:46:18] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10173404720133939974.kers
Total runtime 0 ms.
[2026-05-24 03:46:18] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-24 03:46:18] [INFO ] Invariant cache hit.
[2026-05-24 03:46:18] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-24 03:46:18] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2026-05-24 03:46:18] [INFO ] Redundant transitions in 1 ms returned []
Running 63 sub problems to find dead transitions.
[2026-05-24 03:46:18] [INFO ] Invariant cache hit.
[2026-05-24 03:46:18] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 64/112 variables, 48/50 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 43/93 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (OVERLAPS) 0/112 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 112/112 variables, and 93 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1162 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 48/48 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 64/112 variables, 48/50 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 43/93 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 63/156 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 0/112 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 112/112 variables, and 156 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1185 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 48/48 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2356ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 2357ms
Starting structural reductions in SI_CTL mode, iteration 1 : 48/62 places, 64/78 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2474 ms. Remains : 48/62 places, 64/78 transitions.
[2026-05-24 03:46:20] [INFO ] Flatten gal took : 5 ms
[2026-05-24 03:46:20] [INFO ] Flatten gal took : 5 ms
[2026-05-24 03:46:20] [INFO ] Input system was already deterministic with 64 transitions.
[2026-05-24 03:46:20] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:46:20] [INFO ] Flatten gal took : 3 ms
[2026-05-24 03:46:20] [INFO ] Time to serialize gal into /tmp/CTLFireability4332240306104438951.gal : 1 ms
[2026-05-24 03:46:20] [INFO ] Time to serialize properties into /tmp/CTLFireability7347739103554033936.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/CTLFireability4332240306104438951.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7347739103554033936.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,571393,0.042485,5788,2,625,5,10666,6,0,248,7331,0


Converting to forward existential form...Done !
original formula: EF((AF((p33==1)) * (EF((((p58==1)&&(p3==1))&&(p62==1))) + (((p6==1)&&(p61==1))&&(p59==1)))))
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,TRUE) * !(EG(!((p33==1))))),TRUE) * (((p58==1)&&(p3==1))&&(p62==1)))] != FALSE + [((FwdU(Init...229
Reverse transition relation is NOT exact ! Due to transitions t5, t12, t16, t20, t23, t25, t55, t58, t59, t60, t61, t62, t63, Intersection with reachable ...224
(forward)formula 0,1,0.543296,25204,1,0,312,118438,153,175,1538,157098,385
FORMULA DiscoveryGPU-PT-06a-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Graph (complete) has 171 edges and 62 vertex of which 57 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 60 edges and 54 vertex of which 42 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Graph (trivial) has 46 edges and 42 vertex of which 24 / 42 are part of one of the 12 SCC in 2 ms
Free SCC test removed 12 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 30 transition count 55
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 27 place count 25 transition count 43
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 32 place count 20 transition count 33
Iterating global reduction 2 with 5 rules applied. Total rules applied 37 place count 20 transition count 33
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 41 place count 16 transition count 25
Iterating global reduction 2 with 4 rules applied. Total rules applied 45 place count 16 transition count 25
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 49 place count 12 transition count 17
Iterating global reduction 2 with 4 rules applied. Total rules applied 53 place count 12 transition count 17
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 57 place count 8 transition count 13
Iterating global reduction 2 with 4 rules applied. Total rules applied 61 place count 8 transition count 13
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 8 transition count 11
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 64 place count 8 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 65 place count 7 transition count 10
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 67 place count 5 transition count 8
Applied a total of 67 rules in 15 ms. Remains 5 /62 variables (removed 57) and now considering 8/78 (removed 70) transitions.
[2026-05-24 03:46:21] [INFO ] Flow matrix only has 6 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-162422630071450215.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3841775261793453144.kers'
[2026-05-24 03:46:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-162422630071450215.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3841775261793453144.kers]
Normalized transition count is 5 out of 6 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 5 rows 5 cols 9 entries
Finished phase 1 with 5 SingleSign rule and 0 generalized
[2026-05-24 03:46:21] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3841775261793453144.kers
Total runtime 0 ms.
[2026-05-24 03:46:21] [INFO ] Implicit Places using invariants in 21 ms returned []
[2026-05-24 03:46:21] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
[2026-05-24 03:46:21] [INFO ] Invariant cache hit.
[2026-05-24 03:46:21] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2026-05-24 03:46:21] [INFO ] Redundant transitions in 1 ms returned []
Running 4 sub problems to find dead transitions.
[2026-05-24 03:46:21] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
[2026-05-24 03:46:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/10 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10/11 variables, and 5 constraints, problems are : Problem set: 0 solved, 4 unsolved in 48 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 2/10 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10/11 variables, and 9 constraints, problems are : Problem set: 0 solved, 4 unsolved in 40 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 91ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 92ms
Starting structural reductions in SI_CTL mode, iteration 1 : 5/62 places, 8/78 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 156 ms. Remains : 5/62 places, 8/78 transitions.
[2026-05-24 03:46:21] [INFO ] Flatten gal took : 1 ms
[2026-05-24 03:46:21] [INFO ] Flatten gal took : 0 ms
[2026-05-24 03:46:21] [INFO ] Input system was already deterministic with 8 transitions.
[2026-05-24 03:46:21] [INFO ] Flatten gal took : 0 ms
[2026-05-24 03:46:21] [INFO ] Flatten gal took : 1 ms
[2026-05-24 03:46:21] [INFO ] Time to serialize gal into /tmp/CTLFireability11556360723898298121.gal : 0 ms
[2026-05-24 03:46:21] [INFO ] Time to serialize properties into /tmp/CTLFireability15844962159697132587.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/CTLFireability11556360723898298121.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15844962159697132587.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,90,0.002522,3796,2,39,5,170,6,0,25,155,0


Converting to forward existential form...Done !
original formula: AG(EF((p6==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (p6==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t3, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total...165
(forward)formula 0,0,0.004849,4072,1,0,24,577,34,11,130,673,23
FORMULA DiscoveryGPU-PT-06a-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 58 transition count 74
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 58 transition count 74
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 54 transition count 70
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 54 transition count 70
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 51 transition count 67
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 51 transition count 67
Applied a total of 22 rules in 4 ms. Remains 51 /62 variables (removed 11) and now considering 67/78 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9979441034338737184.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9756683502346805788.kers'
[2026-05-24 03:46:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9979441034338737184.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9756683502346805788.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 67 rows 49 cols 131 entries
Finished phase 1 with 49 SingleSign rule and 0 generalized
[2026-05-24 03:46:21] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9756683502346805788.kers
Total runtime 0 ms.
[2026-05-24 03:46:21] [INFO ] Implicit Places using invariants in 31 ms returned []
[2026-05-24 03:46:21] [INFO ] Invariant cache hit.
[2026-05-24 03:46:21] [INFO ] State equation strengthened by 44 read => feed constraints.
[2026-05-24 03:46:21] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Running 66 sub problems to find dead transitions.
[2026-05-24 03:46:21] [INFO ] Invariant cache hit.
[2026-05-24 03:46:21] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 67/118 variables, 51/53 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 44/97 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 0/118 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 118/118 variables, and 97 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1322 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 51/51 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 67/118 variables, 51/53 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 44/97 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 66/163 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 0/118 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 118/118 variables, and 163 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1300 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 51/51 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2628ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 2629ms
Starting structural reductions in LTL mode, iteration 1 : 51/62 places, 67/78 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2718 ms. Remains : 51/62 places, 67/78 transitions.
[2026-05-24 03:46:24] [INFO ] Flatten gal took : 6 ms
[2026-05-24 03:46:24] [INFO ] Flatten gal took : 6 ms
[2026-05-24 03:46:24] [INFO ] Input system was already deterministic with 67 transitions.
[2026-05-24 03:46:24] [INFO ] Flatten gal took : 3 ms
[2026-05-24 03:46:24] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:46:24] [INFO ] Time to serialize gal into /tmp/CTLFireability10459688483963209369.gal : 1 ms
[2026-05-24 03:46:24] [INFO ] Time to serialize properties into /tmp/CTLFireability7441631801282917727.ctl : 4 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/CTLFireability10459688483963209369.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7441631801282917727.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.21229e+06,0.051713,6208,2,452,5,13611,6,0,261,8967,0


Converting to forward existential form...Done !
original formula: EX((EF(((p51==1) * EG(((p45==0)||(p61==0))))) + ((p38==1)&&(p62==1))))
=> equivalent forward existential formula: ([FwdG((FwdU(EY(Init),TRUE) * (p51==1)),((p45==0)||(p61==0)))] != FALSE + [(EY(Init) * ((p38==1)&&(p62==1)))] !=...162
Hit Full ! (commute/partial/dont) 33/0/34
(forward)formula 0,1,0.128034,8652,1,0,15,24256,21,5,1334,20740,14
FORMULA DiscoveryGPU-PT-06a-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 58 transition count 74
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 58 transition count 74
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 54 transition count 70
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 54 transition count 70
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 51 transition count 67
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 51 transition count 67
Applied a total of 22 rules in 4 ms. Remains 51 /62 variables (removed 11) and now considering 67/78 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2035904525832172104.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7435727567337560700.kers'
[2026-05-24 03:46:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2035904525832172104.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7435727567337560700.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 67 rows 49 cols 131 entries
Finished phase 1 with 49 SingleSign rule and 0 generalized
[2026-05-24 03:46:24] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7435727567337560700.kers
Total runtime 1 ms.
[2026-05-24 03:46:24] [INFO ] Implicit Places using invariants in 47 ms returned []
[2026-05-24 03:46:24] [INFO ] Invariant cache hit.
[2026-05-24 03:46:24] [INFO ] State equation strengthened by 44 read => feed constraints.
[2026-05-24 03:46:24] [INFO ] Implicit Places using invariants and state equation in 66 ms returned [50]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 114 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 50/62 places, 67/78 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 67/67 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 119 ms. Remains : 50/62 places, 67/78 transitions.
[2026-05-24 03:46:24] [INFO ] Flatten gal took : 3 ms
[2026-05-24 03:46:24] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:46:24] [INFO ] Input system was already deterministic with 67 transitions.
[2026-05-24 03:46:24] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:46:24] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:46:24] [INFO ] Time to serialize gal into /tmp/CTLFireability12711167838067106915.gal : 1 ms
[2026-05-24 03:46:24] [INFO ] Time to serialize properties into /tmp/CTLFireability16737916430843858507.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/CTLFireability12711167838067106915.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16737916430843858507.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.21229e+06,0.042308,5844,2,691,5,11615,6,0,259,7230,0


Converting to forward existential form...Done !
original formula: EX(EF((p31==1)))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * (p31==1))] != FALSE
(forward)formula 0,1,0.064535,6104,1,0,9,11741,9,1,525,7230,4
FORMULA DiscoveryGPU-PT-06a-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Graph (complete) has 171 edges and 62 vertex of which 57 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 1 place count 57 transition count 67
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 13 place count 51 transition count 67
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 18 place count 46 transition count 62
Iterating global reduction 0 with 5 rules applied. Total rules applied 23 place count 46 transition count 62
Applied a total of 23 rules in 8 ms. Remains 46 /62 variables (removed 16) and now considering 62/78 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13699630584679849600.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-189526166128155983.kers'
[2026-05-24 03:46:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13699630584679849600.kers, --Pflows, --basisKERS=/tmp/petrispot-output-189526166128155983.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 62 rows 44 cols 122 entries
Finished phase 1 with 44 SingleSign rule and 0 generalized
[2026-05-24 03:46:24] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-189526166128155983.kers
Total runtime 0 ms.
[2026-05-24 03:46:24] [INFO ] Implicit Places using invariants in 34 ms returned []
[2026-05-24 03:46:24] [INFO ] Invariant cache hit.
[2026-05-24 03:46:24] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-24 03:46:24] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2026-05-24 03:46:24] [INFO ] Redundant transitions in 1 ms returned []
Running 61 sub problems to find dead transitions.
[2026-05-24 03:46:24] [INFO ] Invariant cache hit.
[2026-05-24 03:46:24] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 62/108 variables, 46/48 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 43/91 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 0/108 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 108/108 variables, and 91 constraints, problems are : Problem set: 0 solved, 61 unsolved in 1095 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 46/46 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 62/108 variables, 46/48 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 43/91 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 61/152 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 0/108 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 108/108 variables, and 152 constraints, problems are : Problem set: 0 solved, 61 unsolved in 1022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 46/46 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2124ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 2124ms
Starting structural reductions in SI_CTL mode, iteration 1 : 46/62 places, 62/78 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2218 ms. Remains : 46/62 places, 62/78 transitions.
[2026-05-24 03:46:26] [INFO ] Flatten gal took : 6 ms
[2026-05-24 03:46:26] [INFO ] Flatten gal took : 3 ms
[2026-05-24 03:46:26] [INFO ] Input system was already deterministic with 62 transitions.
[2026-05-24 03:46:26] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:46:26] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:46:26] [INFO ] Time to serialize gal into /tmp/CTLFireability10306755165653101094.gal : 1 ms
[2026-05-24 03:46:26] [INFO ] Time to serialize properties into /tmp/CTLFireability16447301590607004604.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/CTLFireability10306755165653101094.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16447301590607004604.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,458753,0.031691,5280,2,396,5,7932,6,0,238,5177,0


Converting to forward existential form...Done !
original formula: (AG(AF(EG(((p34==0)||(p62==0))))) + EG((((p18==0)||(p62==0)) * AG(((p19==1)&&(p61==1))))))
=> equivalent forward existential formula: [FwdG(FwdU((Init * !(EG((((p18==0)||(p62==0)) * !(E(TRUE U !(((p19==1)&&(p61==1))))))))),TRUE),!(EG(((p34==0)||(...175
Reverse transition relation is NOT exact ! Due to transitions t14, t16, t18, t20, t21, t23, t55, t56, t57, t58, t59, t60, t61, Intersection with reachable...225
(forward)formula 0,0,0.497081,22688,1,0,318,107811,164,179,1522,129732,391
FORMULA DiscoveryGPU-PT-06a-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 57 transition count 73
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 57 transition count 73
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 52 transition count 68
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 52 transition count 68
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 50 transition count 66
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 50 transition count 66
Applied a total of 24 rules in 12 ms. Remains 50 /62 variables (removed 12) and now considering 66/78 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1455456490822325807.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8958429493246235534.kers'
[2026-05-24 03:46:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1455456490822325807.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8958429493246235534.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 66 rows 48 cols 130 entries
Finished phase 1 with 48 SingleSign rule and 0 generalized
[2026-05-24 03:46:27] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8958429493246235534.kers
Total runtime 0 ms.
[2026-05-24 03:46:27] [INFO ] Implicit Places using invariants in 28 ms returned []
[2026-05-24 03:46:27] [INFO ] Invariant cache hit.
[2026-05-24 03:46:27] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-24 03:46:27] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Running 65 sub problems to find dead transitions.
[2026-05-24 03:46:27] [INFO ] Invariant cache hit.
[2026-05-24 03:46:27] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (OVERLAPS) 66/116 variables, 50/52 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 43/95 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 0/116 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 116/116 variables, and 95 constraints, problems are : Problem set: 0 solved, 65 unsolved in 1349 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (OVERLAPS) 66/116 variables, 50/52 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 43/95 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 65/160 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 0/116 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 116/116 variables, and 160 constraints, problems are : Problem set: 0 solved, 65 unsolved in 1244 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2598ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 2599ms
Starting structural reductions in LTL mode, iteration 1 : 50/62 places, 66/78 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2684 ms. Remains : 50/62 places, 66/78 transitions.
[2026-05-24 03:46:30] [INFO ] Flatten gal took : 9 ms
[2026-05-24 03:46:30] [INFO ] Flatten gal took : 5 ms
[2026-05-24 03:46:30] [INFO ] Input system was already deterministic with 66 transitions.
[2026-05-24 03:46:30] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:46:30] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:46:30] [INFO ] Time to serialize gal into /tmp/CTLFireability15916945226624467272.gal : 1 ms
[2026-05-24 03:46:30] [INFO ] Time to serialize properties into /tmp/CTLFireability13347637296609228111.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/CTLFireability15916945226624467272.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13347637296609228111.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.19645e+06,0.085313,7696,2,905,5,22482,6,0,257,15485,0


Converting to forward existential form...Done !
original formula: AG((((EX(((p53==0)||(p62==0))) + AF(AX(((p35==1)&&(p61==1))))) + (AF((((EX(((p47==0)||(p61==0))) * (p57==1)) * ((p61==1)&&(p3==1))) * (p6...199
=> equivalent forward existential formula: [FwdG((((FwdU(Init,TRUE) * !(((p57==1)&&(p61==1)))) * !((EX(((p53==0)||(p62==0))) + !(EG(!(!(EX(!(((p35==1)&&(p6...272
Reverse transition relation is NOT exact ! Due to transitions t1, t10, t13, t19, t21, t24, t26, t59, t60, t61, t62, t63, t64, t65, Intersection with reach...229
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,0.390693,19676,1,0,186,87120,168,129,1594,102293,253
FORMULA DiscoveryGPU-PT-06a-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 58 transition count 74
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 58 transition count 74
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 54 transition count 70
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 54 transition count 70
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 51 transition count 67
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 51 transition count 67
Applied a total of 22 rules in 4 ms. Remains 51 /62 variables (removed 11) and now considering 67/78 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11857152336825124559.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4696712692668459401.kers'
[2026-05-24 03:46:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11857152336825124559.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4696712692668459401.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 67 rows 49 cols 131 entries
Finished phase 1 with 49 SingleSign rule and 0 generalized
[2026-05-24 03:46:30] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4696712692668459401.kers
Total runtime 0 ms.
[2026-05-24 03:46:30] [INFO ] Implicit Places using invariants in 28 ms returned []
[2026-05-24 03:46:30] [INFO ] Invariant cache hit.
[2026-05-24 03:46:30] [INFO ] State equation strengthened by 44 read => feed constraints.
[2026-05-24 03:46:30] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Running 66 sub problems to find dead transitions.
[2026-05-24 03:46:30] [INFO ] Invariant cache hit.
[2026-05-24 03:46:30] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 67/118 variables, 51/53 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 44/97 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 0/118 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 118/118 variables, and 97 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1264 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 51/51 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 67/118 variables, 51/53 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 44/97 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 66/163 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 0/118 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 118/118 variables, and 163 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1312 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 51/51 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2586ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 2587ms
Starting structural reductions in LTL mode, iteration 1 : 51/62 places, 67/78 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2669 ms. Remains : 51/62 places, 67/78 transitions.
[2026-05-24 03:46:33] [INFO ] Flatten gal took : 3 ms
[2026-05-24 03:46:33] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:46:33] [INFO ] Input system was already deterministic with 67 transitions.
[2026-05-24 03:46:33] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:46:33] [INFO ] Flatten gal took : 3 ms
[2026-05-24 03:46:33] [INFO ] Time to serialize gal into /tmp/CTLFireability6729959015010335075.gal : 1 ms
[2026-05-24 03:46:33] [INFO ] Time to serialize properties into /tmp/CTLFireability13126843402461537653.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/CTLFireability6729959015010335075.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13126843402461537653.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.21229e+06,0.043169,5876,2,550,5,11453,6,0,261,7284,0


Converting to forward existential form...Done !
original formula: EF(AX((EF(!(A((p1==1) U (p4==1)))) * (AF(EX(((p3==1)&&(p62==1)))) + ((p56==1)&&(p61==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!((E(TRUE U !(!((E(!((p4==1)) U (!((p1==1)) * !((p4==1)))) + EG(!((p4==1))))))) * (!(EG...223
Reverse transition relation is NOT exact ! Due to transitions t16, t18, t20, t23, t25, t59, t60, t61, t62, t63, t64, t65, t66, Intersection with reachable...225
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,1.80711,69312,1,0,625,368198,174,390,1661,492338,720
FORMULA DiscoveryGPU-PT-06a-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 57 transition count 73
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 57 transition count 73
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 53 transition count 69
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 53 transition count 69
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 49 transition count 65
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 49 transition count 65
Applied a total of 26 rules in 11 ms. Remains 49 /62 variables (removed 13) and now considering 65/78 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11436649028225316258.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11360794465402440814.kers'
[2026-05-24 03:46:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11436649028225316258.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11360794465402440814.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 65 rows 47 cols 128 entries
Finished phase 1 with 47 SingleSign rule and 0 generalized
[2026-05-24 03:46:35] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11360794465402440814.kers
Total runtime 0 ms.
[2026-05-24 03:46:35] [INFO ] Implicit Places using invariants in 31 ms returned []
[2026-05-24 03:46:35] [INFO ] Invariant cache hit.
[2026-05-24 03:46:35] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-24 03:46:35] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2026-05-24 03:46:35] [INFO ] Invariant cache hit.
[2026-05-24 03:46:35] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (OVERLAPS) 65/114 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 43/94 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 64 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/114 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/114 variables, and 94 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1167 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (OVERLAPS) 65/114 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 43/94 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 64/158 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 0/114 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 114/114 variables, and 158 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1214 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2386ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 2387ms
Starting structural reductions in LTL mode, iteration 1 : 49/62 places, 65/78 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2483 ms. Remains : 49/62 places, 65/78 transitions.
[2026-05-24 03:46:37] [INFO ] Flatten gal took : 7 ms
[2026-05-24 03:46:37] [INFO ] Flatten gal took : 5 ms
[2026-05-24 03:46:37] [INFO ] Input system was already deterministic with 65 transitions.
[2026-05-24 03:46:37] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:46:37] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:46:37] [INFO ] Time to serialize gal into /tmp/CTLFireability13172081083662699801.gal : 1 ms
[2026-05-24 03:46:37] [INFO ] Time to serialize properties into /tmp/CTLFireability591968242476013271.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/CTLFireability13172081083662699801.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability591968242476013271.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.12397e+06,0.064734,7056,2,955,5,18875,6,0,252,12912,0


Converting to forward existential form...Done !
original formula: EF(((AX((p28==1)) * (p43==1)) * (p62==1)))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * (p62==1)) * (p43==1)) * !(EX(!((p28==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t12, t16, t18, t20, t22, t23, t58, t59, t60, t61, t62, t63, t64, Intersection with reach...229
(forward)formula 0,0,0.23179,13664,1,0,102,50279,149,65,1476,61882,139
FORMULA DiscoveryGPU-PT-06a-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Graph (complete) has 171 edges and 62 vertex of which 59 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 59 transition count 73
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 57 transition count 73
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6 place count 56 transition count 72
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 56 transition count 72
Applied a total of 7 rules in 13 ms. Remains 56 /62 variables (removed 6) and now considering 72/78 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16711996290308365151.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14474472799884007139.kers'
[2026-05-24 03:46:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16711996290308365151.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14474472799884007139.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 72 rows 54 cols 138 entries
Finished phase 1 with 54 SingleSign rule and 0 generalized
[2026-05-24 03:46:37] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14474472799884007139.kers
Total runtime 0 ms.
[2026-05-24 03:46:37] [INFO ] Implicit Places using invariants in 31 ms returned []
[2026-05-24 03:46:37] [INFO ] Invariant cache hit.
[2026-05-24 03:46:37] [INFO ] State equation strengthened by 47 read => feed constraints.
[2026-05-24 03:46:37] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2026-05-24 03:46:37] [INFO ] Redundant transitions in 1 ms returned []
Running 71 sub problems to find dead transitions.
[2026-05-24 03:46:37] [INFO ] Invariant cache hit.
[2026-05-24 03:46:37] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (OVERLAPS) 72/128 variables, 56/58 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 47/105 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (OVERLAPS) 0/128 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 105 constraints, problems are : Problem set: 0 solved, 71 unsolved in 1411 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 56/56 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (OVERLAPS) 72/128 variables, 56/58 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 47/105 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 71/176 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (OVERLAPS) 0/128 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 176 constraints, problems are : Problem set: 0 solved, 71 unsolved in 1460 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 56/56 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2876ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 2877ms
Starting structural reductions in SI_CTL mode, iteration 1 : 56/62 places, 72/78 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2969 ms. Remains : 56/62 places, 72/78 transitions.
[2026-05-24 03:46:40] [INFO ] Flatten gal took : 6 ms
[2026-05-24 03:46:40] [INFO ] Flatten gal took : 5 ms
[2026-05-24 03:46:40] [INFO ] Input system was already deterministic with 72 transitions.
[2026-05-24 03:46:40] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:46:40] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:46:40] [INFO ] Time to serialize gal into /tmp/CTLFireability2667407163668701809.gal : 1 ms
[2026-05-24 03:46:40] [INFO ] Time to serialize properties into /tmp/CTLFireability15056881325063345601.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/CTLFireability2667407163668701809.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15056881325063345601.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,990001,0.028986,5304,2,250,5,8205,6,0,286,4259,0


Converting to forward existential form...Done !
original formula: AG((((EF(((((p2==1)&&(p61==1))&&((p37==1)&&(p61==1)))&&(p44==1))) + A(((p42==1)&&(p61==1)) U (((p34==1)||((p24==1)&&(p62==1)))||(!((p6==1...503
=> equivalent forward existential formula: ([((((FwdU(Init,TRUE) * !(((p21==1) * ((!((E(!((p53==1)) U (!(((p56==1)&&(p61==1))) * !((p53==1)))) + EG(!((p53=...2245
Reverse transition relation is NOT exact ! Due to transitions t1, t11, t56, t58, t60, t62, t63, t64, t65, t66, t67, t68, t69, Intersection with reachable ...224
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,1.00163,43340,1,0,890,225135,225,482,1831,296231,1074
FORMULA DiscoveryGPU-PT-06a-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Graph (complete) has 171 edges and 62 vertex of which 59 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 1 place count 59 transition count 70
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 11 place count 54 transition count 70
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 14 place count 51 transition count 67
Iterating global reduction 0 with 3 rules applied. Total rules applied 17 place count 51 transition count 67
Applied a total of 17 rules in 15 ms. Remains 51 /62 variables (removed 11) and now considering 67/78 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2501766630565040010.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15326004873260185248.kers'
[2026-05-24 03:46:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2501766630565040010.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15326004873260185248.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 67 rows 49 cols 130 entries
Finished phase 1 with 49 SingleSign rule and 0 generalized
[2026-05-24 03:46:41] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15326004873260185248.kers
Total runtime 0 ms.
[2026-05-24 03:46:41] [INFO ] Implicit Places using invariants in 31 ms returned []
[2026-05-24 03:46:41] [INFO ] Invariant cache hit.
[2026-05-24 03:46:41] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-24 03:46:41] [INFO ] Implicit Places using invariants and state equation in 54 ms returned [50]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 87 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 50/62 places, 67/78 transitions.
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 50 transition count 67
Applied a total of 2 rules in 7 ms. Remains 50 /50 variables (removed 0) and now considering 67/67 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12073199692540226932.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5286303782739165842.kers'
[2026-05-24 03:46:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12073199692540226932.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5286303782739165842.kers]
Normalized transition count is 66 out of 67 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 66 rows 49 cols 128 entries
Finished phase 1 with 49 SingleSign rule and 0 generalized
[2026-05-24 03:46:42] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5286303782739165842.kers
Total runtime 0 ms.
[2026-05-24 03:46:42] [INFO ] Implicit Places using invariants in 29 ms returned []
[2026-05-24 03:46:42] [INFO ] Invariant cache hit.
[2026-05-24 03:46:42] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-24 03:46:42] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 50/62 places, 67/78 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 184 ms. Remains : 50/62 places, 67/78 transitions.
[2026-05-24 03:46:42] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:46:42] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:46:42] [INFO ] Input system was already deterministic with 67 transitions.
[2026-05-24 03:46:42] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:46:42] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:46:42] [INFO ] Time to serialize gal into /tmp/CTLFireability15364437584288831284.gal : 0 ms
[2026-05-24 03:46:42] [INFO ] Time to serialize properties into /tmp/CTLFireability9990586152128520665.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/CTLFireability15364437584288831284.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9990586152128520665.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,675841,0.030463,5360,2,378,5,8213,6,0,259,4795,0


Converting to forward existential form...Done !
original formula: E(!(AG(!(E((p1==1) U (p16==1))))) U AG(!(A(((!((p45==1)&&(p61==1)))&&((p6==1)||(p31==1))) U (p33!=1)))))
=> equivalent forward existential formula: [(FwdU(Init,!(!(E(TRUE U !(!(E((p1==1) U (p16==1)))))))) * !(E(TRUE U !(!(!((E(!((p33!=1)) U (!(((!((p45==1)&&(p...237
Reverse transition relation is NOT exact ! Due to transitions t14, t18, t21, t55, t56, t57, t58, t59, t60, t61, t62, t64, t65, Intersection with reachable...225
(forward)formula 0,0,0.15223,11012,1,0,139,38421,165,86,1560,37635,204
FORMULA DiscoveryGPU-PT-06a-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 57 transition count 73
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 57 transition count 73
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 52 transition count 68
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 52 transition count 68
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 48 transition count 64
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 48 transition count 64
Applied a total of 28 rules in 5 ms. Remains 48 /62 variables (removed 14) and now considering 64/78 (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-1609718565136789076.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6483995050100184826.kers'
[2026-05-24 03:46:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1609718565136789076.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6483995050100184826.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 64 rows 46 cols 126 entries
Finished phase 1 with 46 SingleSign rule and 0 generalized
[2026-05-24 03:46:42] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6483995050100184826.kers
Total runtime 1 ms.
[2026-05-24 03:46:42] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-24 03:46:42] [INFO ] Invariant cache hit.
[2026-05-24 03:46:42] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-24 03:46:42] [INFO ] Implicit Places using invariants and state equation in 52 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 91 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 47/62 places, 64/78 transitions.
Applied a total of 0 rules in 0 ms. Remains 47 /47 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 96 ms. Remains : 47/62 places, 64/78 transitions.
[2026-05-24 03:46:42] [INFO ] Flatten gal took : 1 ms
[2026-05-24 03:46:42] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:46:42] [INFO ] Input system was already deterministic with 64 transitions.
[2026-05-24 03:46:42] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:46:42] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:46:42] [INFO ] Time to serialize gal into /tmp/CTLFireability14292518037306077261.gal : 0 ms
[2026-05-24 03:46:42] [INFO ] Time to serialize properties into /tmp/CTLFireability6712582592927558737.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/CTLFireability14292518037306077261.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6712582592927558737.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.04653e+06,0.054524,6412,2,889,5,15700,6,0,245,9290,0


Converting to forward existential form...Done !
original formula: EX((AG((AX(((p6==0)||(p61==0))) + (p46==1))) * (p58==1)))
=> equivalent forward existential formula: [((EY(Init) * (p58==1)) * !(E(TRUE U !((!(EX(!(((p6==0)||(p61==0))))) + (p46==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t15, t17, t19, t21, t22, t24, t57, t58, t59, t60, t61, t62, t63, Intersection with reachable...225
(forward)formula 0,0,0.311869,18440,1,0,104,82905,152,68,1495,77900,145
FORMULA DiscoveryGPU-PT-06a-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 57 transition count 73
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 57 transition count 73
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 52 transition count 68
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 52 transition count 68
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 48 transition count 64
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 48 transition count 64
Applied a total of 28 rules in 6 ms. Remains 48 /62 variables (removed 14) and now considering 64/78 (removed 14) transitions.
[2026-05-24 03:46:42] [INFO ] Invariant cache hit.
[2026-05-24 03:46:42] [INFO ] Implicit Places using invariants in 27 ms returned []
[2026-05-24 03:46:42] [INFO ] Invariant cache hit.
[2026-05-24 03:46:42] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-24 03:46:42] [INFO ] Implicit Places using invariants and state equation in 53 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 80 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 47/62 places, 64/78 transitions.
Applied a total of 0 rules in 1 ms. Remains 47 /47 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 87 ms. Remains : 47/62 places, 64/78 transitions.
[2026-05-24 03:46:42] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:46:42] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:46:42] [INFO ] Input system was already deterministic with 64 transitions.
[2026-05-24 03:46:42] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:46:42] [INFO ] Flatten gal took : 3 ms
[2026-05-24 03:46:42] [INFO ] Time to serialize gal into /tmp/CTLFireability407174047229202095.gal : 1 ms
[2026-05-24 03:46:42] [INFO ] Time to serialize properties into /tmp/CTLFireability15240428068696952933.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/CTLFireability407174047229202095.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15240428068696952933.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.04653e+06,0.051143,6388,2,889,5,15700,6,0,245,9290,0


Converting to forward existential form...Done !
original formula: EG(EX(((p37==1)&&(p61==1))))
=> equivalent forward existential formula: [FwdG(Init,EX(((p37==1)&&(p61==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t15, t17, t19, t21, t22, t24, t57, t58, t59, t60, t61, t62, t63, Intersection with reachable...225
(forward)formula 0,0,0.190324,12076,1,0,99,40930,150,63,1436,51911,139
FORMULA DiscoveryGPU-PT-06a-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 57 transition count 73
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 57 transition count 73
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 52 transition count 68
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 52 transition count 68
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 49 transition count 65
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 49 transition count 65
Applied a total of 26 rules in 5 ms. Remains 49 /62 variables (removed 13) and now considering 65/78 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6489052061473906774.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9700986705079608120.kers'
[2026-05-24 03:46:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6489052061473906774.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9700986705079608120.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 65 rows 47 cols 128 entries
Finished phase 1 with 47 SingleSign rule and 0 generalized
[2026-05-24 03:46:42] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9700986705079608120.kers
Total runtime 0 ms.
[2026-05-24 03:46:43] [INFO ] Implicit Places using invariants in 29 ms returned []
[2026-05-24 03:46:43] [INFO ] Invariant cache hit.
[2026-05-24 03:46:43] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-24 03:46:43] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2026-05-24 03:46:43] [INFO ] Invariant cache hit.
[2026-05-24 03:46:43] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (OVERLAPS) 65/114 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 43/94 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 0/114 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/114 variables, and 94 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1181 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (OVERLAPS) 65/114 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 43/94 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 64/158 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 0/114 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 114/114 variables, and 158 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1239 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2424ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 2425ms
Starting structural reductions in LTL mode, iteration 1 : 49/62 places, 65/78 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2509 ms. Remains : 49/62 places, 65/78 transitions.
[2026-05-24 03:46:45] [INFO ] Flatten gal took : 6 ms
[2026-05-24 03:46:45] [INFO ] Flatten gal took : 3 ms
[2026-05-24 03:46:45] [INFO ] Input system was already deterministic with 65 transitions.
[2026-05-24 03:46:45] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:46:45] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:46:45] [INFO ] Time to serialize gal into /tmp/CTLFireability4630789312013115628.gal : 1 ms
[2026-05-24 03:46:45] [INFO ] Time to serialize properties into /tmp/CTLFireability357871381076511260.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/CTLFireability4630789312013115628.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability357871381076511260.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
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.12397e+06,0.050318,6172,2,730,5,12926,6,0,252,9640,0


Converting to forward existential form...Done !
original formula: (EX((AX((p6==1)) * AG(!(E(((p27==1)&&(p61==1)) U ((p29==1)&&(p61==1))))))) + EF(((EF((((p6==1)&&(p61==1))&&((p23==1)&&(p62==1)))) * (p10=...173
=> equivalent forward existential formula: ([((EY(Init) * !(EX(!((p6==1))))) * !(E(TRUE U !(!(E(((p27==1)&&(p61==1)) U ((p29==1)&&(p61==1))))))))] != FALSE...270
Reverse transition relation is NOT exact ! Due to transitions t7, t12, t16, t18, t20, t22, t25, t58, t59, t60, t61, t62, t63, t64, Intersection with reach...229
(forward)formula 0,1,0.291894,16504,1,0,113,67082,161,71,1633,71648,159
FORMULA DiscoveryGPU-PT-06a-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-24 03:46:45] [INFO ] Flatten gal took : 6 ms
[2026-05-24 03:46:45] [INFO ] Flatten gal took : 3 ms
Total runtime 37675 ms.

BK_STOP 1779594405862

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

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