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.r354-tall-178024402800169.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 SupplyChain-PT-00005, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r354-tall-178024402800169
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 8.4K May 27 07:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K May 27 07:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 27 07:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 27 07:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 27 10:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 27 10:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 27 10:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 27 10:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 13K May 27 07:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K May 27 07:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K May 27 07:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 118K May 27 07:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 27 10:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 27 10:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 6 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 21K May 26 18:17 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 SupplyChain-PT-00005-CTLCardinality-2024-00
FORMULA_NAME SupplyChain-PT-00005-CTLCardinality-2024-01
FORMULA_NAME SupplyChain-PT-00005-CTLCardinality-2024-02
FORMULA_NAME SupplyChain-PT-00005-CTLCardinality-2024-03
FORMULA_NAME SupplyChain-PT-00005-CTLCardinality-2024-04
FORMULA_NAME SupplyChain-PT-00005-CTLCardinality-2024-05
FORMULA_NAME SupplyChain-PT-00005-CTLCardinality-2024-06
FORMULA_NAME SupplyChain-PT-00005-CTLCardinality-2024-07
FORMULA_NAME SupplyChain-PT-00005-CTLCardinality-2024-08
FORMULA_NAME SupplyChain-PT-00005-CTLCardinality-2024-09
FORMULA_NAME SupplyChain-PT-00005-CTLCardinality-2024-10
FORMULA_NAME SupplyChain-PT-00005-CTLCardinality-2024-11
FORMULA_NAME SupplyChain-PT-00005-CTLCardinality-2024-12
FORMULA_NAME SupplyChain-PT-00005-CTLCardinality-2024-13
FORMULA_NAME SupplyChain-PT-00005-CTLCardinality-2024-14
FORMULA_NAME SupplyChain-PT-00005-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1780250560768

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SupplyChain-PT-00005
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-31 18:02:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-31 18:02:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-31 18:02:42] [INFO ] Load time of PNML (sax parser for PT used): 48 ms
[2026-05-31 18:02:42] [INFO ] Transformed 69 places.
[2026-05-31 18:02:42] [INFO ] Transformed 43 transitions.
[2026-05-31 18:02:42] [INFO ] Parsed PT model containing 69 places and 43 transitions and 186 arcs in 155 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 21 ms.
Support contains 62 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 43/43 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 65 transition count 43
Applied a total of 4 rules in 17 ms. Remains 65 /69 variables (removed 4) and now considering 43/43 (removed 0) transitions.
Running 38 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16928150355031559002.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3766625875779873844.kers'
[2026-05-31 18:02:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16928150355031559002.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3766625875779873844.kers]
Normalized transition count is 42 out of 43 initially.
Culling duplicate invariants (modulo rational): removing 16 columns.
Culled 16 columns in 0 ms.
// Phase 1: matrix 42 rows 49 cols 134 entries
Finished phase 1 with 27 SingleSign rule and 5 generalized
[2026-05-31 18:02:42] [INFO ] Computed 33 invariants in 0 ms
Computed 33 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3766625875779873844.kers
Total runtime 1 ms.
[2026-05-31 18:02:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 5/62 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 3/65 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 42/107 variables, 65/99 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (OVERLAPS) 1/108 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/108 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 12 (OVERLAPS) 0/108 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 108/108 variables, and 100 constraints, problems are : Problem set: 0 solved, 38 unsolved in 1776 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 65/65 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 5/62 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 3/65 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 42/107 variables, 65/99 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 38/137 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/107 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 11 (OVERLAPS) 1/108 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/108 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 13 (OVERLAPS) 0/108 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 108/108 variables, and 138 constraints, problems are : Problem set: 0 solved, 38 unsolved in 1629 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 65/65 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3514ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 3530ms
[2026-05-31 18:02:46] [INFO ] Invariant cache hit.
[2026-05-31 18:02:46] [INFO ] Implicit Places using invariants in 100 ms returned []
[2026-05-31 18:02:46] [INFO ] Invariant cache hit.
[2026-05-31 18:02:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 18:02:46] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 65/69 places, 43/43 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3783 ms. Remains : 65/69 places, 43/43 transitions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 43/43 transitions.
Applied a total of 0 rules in 1 ms. Remains 65 /65 variables (removed 0) and now considering 43/43 (removed 0) transitions.
Skipped dead transition search.
[2026-05-31 18:02:46] [INFO ] Invariant cache hit.
[2026-05-31 18:02:46] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-31 18:02:46] [INFO ] Invariant cache hit.
[2026-05-31 18:02:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 18:02:46] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 83 ms. Remains : 65/65 places, 43/43 transitions.
Support contains 62 out of 65 places after structural reductions.
[2026-05-31 18:02:46] [INFO ] Flatten gal took : 24 ms
[2026-05-31 18:02:46] [INFO ] Flatten gal took : 9 ms
[2026-05-31 18:02:46] [INFO ] Input system was already deterministic with 43 transitions.
RANDOM walk for 40000 steps (1431 resets) in 2741 ms. (14 steps per ms) remains 23/103 properties
BEST_FIRST walk for 4004 steps (26 resets) in 33 ms. (117 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (24 resets) in 40 ms. (97 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (27 resets) in 47 ms. (83 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (28 resets) in 69 ms. (57 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (24 resets) in 27 ms. (143 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (24 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (24 resets) in 85 ms. (46 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (26 resets) in 30 ms. (129 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (25 resets) in 27 ms. (143 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (24 resets) in 13 ms. (286 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (24 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (25 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (28 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (28 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (24 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (28 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (24 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (26 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (25 resets) in 13 ms. (286 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (24 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (28 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (24 resets) in 52 ms. (75 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (24 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
[2026-05-31 18:02:47] [INFO ] Invariant cache hit.
[2026-05-31 18:02:47] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp78 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 6/6 constraints. Problems are: Problem set: 3 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 20 unsolved
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp84 is UNSAT
At refinement iteration 2 (OVERLAPS) 24/56 variables, 12/18 constraints. Problems are: Problem set: 6 solved, 17 unsolved
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp75 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 6/24 constraints. Problems are: Problem set: 9 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/24 constraints. Problems are: Problem set: 9 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 9/65 variables, 9/33 constraints. Problems are: Problem set: 9 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/33 constraints. Problems are: Problem set: 9 solved, 14 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp82 is UNSAT
Problem AtomicPropp85 is UNSAT
Problem AtomicPropp97 is UNSAT
At refinement iteration 7 (OVERLAPS) 42/107 variables, 65/98 constraints. Problems are: Problem set: 21 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 0/98 constraints. Problems are: Problem set: 21 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/108 variables, 1/99 constraints. Problems are: Problem set: 21 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/108 variables, 0/99 constraints. Problems are: Problem set: 21 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/108 variables, 0/99 constraints. Problems are: Problem set: 21 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 108/108 variables, and 99 constraints, problems are : Problem set: 21 solved, 2 unsolved in 204 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 65/65 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 21 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 21 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 14/19 variables, 4/4 constraints. Problems are: Problem set: 21 solved, 2 unsolved
Problem AtomicPropp52 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 1/5 constraints. Problems are: Problem set: 22 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/5 constraints. Problems are: Problem set: 22 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 24/43 variables, 8/13 constraints. Problems are: Problem set: 22 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 1/14 constraints. Problems are: Problem set: 22 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/14 constraints. Problems are: Problem set: 22 solved, 1 unsolved
Problem AtomicPropp77 is UNSAT
After SMT solving in domain Int declared 65/108 variables, and 34 constraints, problems are : Problem set: 23 solved, 0 unsolved in 73 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/65 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/23 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 286ms problems are : Problem set: 23 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 23 atomic propositions for a total of 16 simplifications.
[2026-05-31 18:02:47] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2026-05-31 18:02:47] [INFO ] Flatten gal took : 7 ms
[2026-05-31 18:02:47] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
FORMULA SupplyChain-PT-00005-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SupplyChain-PT-00005-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SupplyChain-PT-00005-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SupplyChain-PT-00005-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SupplyChain-PT-00005-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SupplyChain-PT-00005-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-31 18:02:47] [INFO ] Flatten gal took : 5 ms
[2026-05-31 18:02:47] [INFO ] Input system was already deterministic with 43 transitions.
Support contains 41 out of 65 places (down from 51) after GAL structural reductions.
Computed a total of 65 stabilizing places and 42 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 65/65 places, 43/43 transitions.
Ensure Unique test removed 16 places
Reduce places removed 18 places and 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 47 transition count 38
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 9 place count 44 transition count 35
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 9 place count 44 transition count 30
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 15 rules applied. Total rules applied 24 place count 34 transition count 30
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 32 transition count 28
Applied a total of 26 rules in 15 ms. Remains 32 /65 variables (removed 33) and now considering 28/43 (removed 15) transitions.
Running 19 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1854080709645176601.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16477977900259600214.kers'
[2026-05-31 18:02:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1854080709645176601.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16477977900259600214.kers]
Normalized transition count is 27 out of 28 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 27 rows 32 cols 74 entries
Finished phase 1 with 20 SingleSign rule and 0 generalized
[2026-05-31 18:02:47] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16477977900259600214.kers
Total runtime 0 ms.
[2026-05-31 18:02:47] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 5/32 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 27/59 variables, 32/45 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 1/60 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 0/60 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 46 constraints, problems are : Problem set: 0 solved, 19 unsolved in 400 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 32/32 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 5/32 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 27/59 variables, 32/45 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 19/64 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 1/60 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/60 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 0/60 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 65 constraints, problems are : Problem set: 0 solved, 19 unsolved in 352 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 32/32 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 762ms problems are : Problem set: 0 solved, 19 unsolved
Search for dead transitions found 0 dead transitions in 762ms
[2026-05-31 18:02:48] [INFO ] Invariant cache hit.
[2026-05-31 18:02:48] [INFO ] Implicit Places using invariants in 65 ms returned [18, 19, 20, 21, 22, 24]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 69 ms to find 6 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 26/65 places, 28/43 transitions.
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 5 rules applied. Total rules applied 5 place count 26 transition count 23
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 11 rules applied. Total rules applied 16 place count 21 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 20 transition count 17
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 17 place count 20 transition count 13
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 25 place count 16 transition count 13
Applied a total of 25 rules in 3 ms. Remains 16 /26 variables (removed 10) and now considering 13/28 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14101522465767968877.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4245416880326359311.kers'
[2026-05-31 18:02:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14101522465767968877.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4245416880326359311.kers]
Normalized transition count is 12 out of 13 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 12 rows 16 cols 32 entries
Finished phase 1 with 10 SingleSign rule and 0 generalized
[2026-05-31 18:02:48] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4245416880326359311.kers
Total runtime 0 ms.
[2026-05-31 18:02:48] [INFO ] Implicit Places using invariants in 31 ms returned []
[2026-05-31 18:02:48] [INFO ] Invariant cache hit.
[2026-05-31 18:02:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 18:02:48] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 16/65 places, 13/43 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 922 ms. Remains : 16/65 places, 13/43 transitions.
[2026-05-31 18:02:48] [INFO ] Flatten gal took : 2 ms
[2026-05-31 18:02:48] [INFO ] Flatten gal took : 2 ms
[2026-05-31 18:02:48] [INFO ] Input system was already deterministic with 13 transitions.
[2026-05-31 18:02:48] [INFO ] Flatten gal took : 1 ms
[2026-05-31 18:02:48] [INFO ] Flatten gal took : 1 ms
[2026-05-31 18:02:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality13645586107187932205.gal : 1 ms
[2026-05-31 18:02:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality11807340336493288627.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/CTLCardinality13645586107187932205.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11807340336493288627.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,98,0.014597,3780,2,72,5,236,6,0,72,143,0


Converting to forward existential form...Done !
original formula: EF(EG(AG((!(E((p33>=1) U (p14>=1))) + (p68<=p56)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(E(TRUE U !((!(E((p33>=1) U (p14>=1))) + (p68<=p56))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0...163
(forward)formula 0,1,0.020877,4352,1,0,41,1410,55,21,432,1370,57
FORMULA SupplyChain-PT-00005-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 65/65 places, 43/43 transitions.
Ensure Unique test removed 16 places
Reduce places removed 17 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 48 transition count 39
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 42 transition count 39
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 42 transition count 37
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 13 place count 40 transition count 35
Applied a total of 13 rules in 8 ms. Remains 40 /65 variables (removed 25) and now considering 35/43 (removed 8) transitions.
Running 27 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10867351148676652905.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7235420802286779685.kers'
[2026-05-31 18:02:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10867351148676652905.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7235420802286779685.kers]
Normalized transition count is 34 out of 35 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 34 rows 40 cols 103 entries
Finished phase 1 with 24 SingleSign rule and 2 generalized
[2026-05-31 18:02:48] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7235420802286779685.kers
Total runtime 0 ms.
[2026-05-31 18:02:48] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (OVERLAPS) 5/40 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (OVERLAPS) 34/74 variables, 40/55 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/74 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (OVERLAPS) 1/75 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/75 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 11 (OVERLAPS) 0/75 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 75/75 variables, and 56 constraints, problems are : Problem set: 0 solved, 27 unsolved in 604 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 40/40 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (OVERLAPS) 5/40 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (OVERLAPS) 34/74 variables, 40/55 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/74 variables, 27/82 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/74 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (OVERLAPS) 1/75 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/75 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 12 (OVERLAPS) 0/75 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 75/75 variables, and 83 constraints, problems are : Problem set: 0 solved, 27 unsolved in 671 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 40/40 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1283ms problems are : Problem set: 0 solved, 27 unsolved
Search for dead transitions found 0 dead transitions in 1283ms
[2026-05-31 18:02:50] [INFO ] Invariant cache hit.
[2026-05-31 18:02:50] [INFO ] Implicit Places using invariants in 35 ms returned [8, 9, 26, 27, 28, 30, 33]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 36 ms to find 7 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 33/65 places, 35/43 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 33 transition count 33
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 6 place count 31 transition count 31
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 31 transition count 29
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 29 transition count 29
Applied a total of 10 rules in 2 ms. Remains 29 /33 variables (removed 4) and now considering 29/35 (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-5237678709878509368.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17274030645355461517.kers'
[2026-05-31 18:02:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5237678709878509368.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17274030645355461517.kers]
Normalized transition count is 28 out of 29 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 28 rows 29 cols 73 entries
Finished phase 1 with 22 SingleSign rule and 0 generalized
[2026-05-31 18:02:50] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17274030645355461517.kers
Total runtime 0 ms.
[2026-05-31 18:02:50] [INFO ] Implicit Places using invariants in 31 ms returned []
[2026-05-31 18:02:50] [INFO ] Invariant cache hit.
[2026-05-31 18:02:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 18:02:50] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 29/65 places, 29/43 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 1397 ms. Remains : 29/65 places, 29/43 transitions.
[2026-05-31 18:02:50] [INFO ] Flatten gal took : 2 ms
[2026-05-31 18:02:50] [INFO ] Flatten gal took : 2 ms
[2026-05-31 18:02:50] [INFO ] Input system was already deterministic with 29 transitions.
[2026-05-31 18:02:50] [INFO ] Flatten gal took : 2 ms
[2026-05-31 18:02:50] [INFO ] Flatten gal took : 2 ms
[2026-05-31 18:02:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality14022963142496106984.gal : 1 ms
[2026-05-31 18:02:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality15606244196141668514.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/CTLCardinality14022963142496106984.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15606244196141668514.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,1766,0.00608,4012,2,169,5,630,6,0,140,432,0


Converting to forward existential form...Done !
original formula: A((!((!(E(((p18<=p46)&&(p4<=p26)) U (p47<1))) + EF(((AF((p55<=p29)) * (p65<=p36)) * (p51>=1))))) + !(AF(((p30>=1)&&(p1>=1))))) U (p3>=1))
=> equivalent forward existential formula: [((Init * !(EG(!((p3>=1))))) * !(E(!((p3>=1)) U (!((!((!(E(((p18<=p46)&&(p4<=p26)) U (p47<1))) + E(TRUE U ((!(EG...264
Reverse transition relation is NOT exact ! Due to transitions t20, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
(forward)formula 0,0,0.077033,7616,1,0,248,20629,102,137,850,17421,428
FORMULA SupplyChain-PT-00005-CTLCardinality-2024-01 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 : 65/65 places, 43/43 transitions.
Ensure Unique test removed 15 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 50 transition count 41
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 6 place count 48 transition count 39
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 6 place count 48 transition count 35
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 18 place count 40 transition count 35
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 40 transition count 34
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 38 transition count 32
Applied a total of 21 rules in 7 ms. Remains 38 /65 variables (removed 27) and now considering 32/43 (removed 11) transitions.
Running 25 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8384531056260816213.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3542790801317570450.kers'
[2026-05-31 18:02:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8384531056260816213.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3542790801317570450.kers]
Normalized transition count is 31 out of 32 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 31 rows 37 cols 90 entries
Finished phase 1 with 23 SingleSign rule and 1 generalized
[2026-05-31 18:02:50] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3542790801317570450.kers
Total runtime 0 ms.
[2026-05-31 18:02:50] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 5/38 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (OVERLAPS) 31/69 variables, 38/53 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (OVERLAPS) 1/70 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/70 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 10 (OVERLAPS) 0/70 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 70/70 variables, and 54 constraints, problems are : Problem set: 0 solved, 25 unsolved in 533 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 38/38 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 5/38 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (OVERLAPS) 31/69 variables, 38/53 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 25/78 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 9 (OVERLAPS) 1/70 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/70 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 11 (OVERLAPS) 0/70 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 70/70 variables, and 79 constraints, problems are : Problem set: 0 solved, 25 unsolved in 564 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 38/38 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1104ms problems are : Problem set: 0 solved, 25 unsolved
Search for dead transitions found 0 dead transitions in 1104ms
[2026-05-31 18:02:51] [INFO ] Invariant cache hit.
[2026-05-31 18:02:51] [INFO ] Implicit Places using invariants in 38 ms returned [22, 23, 24, 25, 26, 29]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 38 ms to find 6 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 32/65 places, 32/43 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 32 transition count 29
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 8 rules applied. Total rules applied 11 place count 29 transition count 24
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 14 place count 27 transition count 23
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 14 place count 27 transition count 21
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 18 place count 25 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 25 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 20 place count 25 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 21 place count 24 transition count 19
Applied a total of 21 rules in 5 ms. Remains 24 /32 variables (removed 8) and now considering 19/32 (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-310130104737051913.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11870937122891280910.kers'
[2026-05-31 18:02:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-310130104737051913.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11870937122891280910.kers]
Normalized transition count is 18 out of 19 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 18 rows 23 cols 49 entries
Finished phase 1 with 16 SingleSign rule and 0 generalized
[2026-05-31 18:02:51] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11870937122891280910.kers
Total runtime 0 ms.
[2026-05-31 18:02:51] [INFO ] Implicit Places using invariants in 28 ms returned []
[2026-05-31 18:02:51] [INFO ] Invariant cache hit.
[2026-05-31 18:02:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 18:02:51] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 24/65 places, 19/43 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 1218 ms. Remains : 24/65 places, 19/43 transitions.
[2026-05-31 18:02:51] [INFO ] Flatten gal took : 1 ms
[2026-05-31 18:02:51] [INFO ] Flatten gal took : 3 ms
[2026-05-31 18:02:51] [INFO ] Input system was already deterministic with 19 transitions.
[2026-05-31 18:02:51] [INFO ] Flatten gal took : 1 ms
[2026-05-31 18:02:51] [INFO ] Flatten gal took : 1 ms
[2026-05-31 18:02:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality2609060498346044296.gal : 1 ms
[2026-05-31 18:02:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality2372147002503945918.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/CTLCardinality2609060498346044296.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2372147002503945918.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,490,0.007439,4004,2,218,5,666,6,0,110,400,0


Converting to forward existential form...Done !
original formula: (EG(((p1>p64) + EG((((p45<=p57) + AF((p42>=1))) + A((p33<=0) U (p12>=1)))))) + AG(A((p12<=0) U (p26>p16))))
=> equivalent forward existential formula: ([(FwdU(FwdU((Init * !(EG(((p1>p64) + EG((((p45<=p57) + !(EG(!((p42>=1))))) + !((E(!((p12>=1)) U (!((p33<=0)) * ...437
Reverse transition relation is NOT exact ! Due to transitions t10, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,0.067812,7240,1,0,135,16920,96,71,679,14928,204
FORMULA SupplyChain-PT-00005-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 65/65 places, 43/43 transitions.
Ensure Unique test removed 16 places
Reduce places removed 17 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 48 transition count 40
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 6 place count 46 transition count 38
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 6 place count 46 transition count 33
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 15 rules applied. Total rules applied 21 place count 36 transition count 33
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 23 place count 36 transition count 31
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 35 transition count 30
Applied a total of 24 rules in 9 ms. Remains 35 /65 variables (removed 30) and now considering 30/43 (removed 13) transitions.
Running 23 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-954400308809464439.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-594472954648295077.kers'
[2026-05-31 18:02:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-954400308809464439.kers, --Pflows, --basisKERS=/tmp/petrispot-output-594472954648295077.kers]
Normalized transition count is 29 out of 30 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 29 rows 35 cols 82 entries
Finished phase 1 with 23 SingleSign rule and 0 generalized
[2026-05-31 18:02:51] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-594472954648295077.kers
Total runtime 0 ms.
[2026-05-31 18:02:51] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 5/35 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 29/64 variables, 35/48 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 1/65 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (OVERLAPS) 0/65 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 49 constraints, problems are : Problem set: 0 solved, 23 unsolved in 486 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 35/35 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 5/35 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 29/64 variables, 35/48 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 23/71 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 1/65 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (OVERLAPS) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 72 constraints, problems are : Problem set: 0 solved, 23 unsolved in 485 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 35/35 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 979ms problems are : Problem set: 0 solved, 23 unsolved
Search for dead transitions found 0 dead transitions in 979ms
[2026-05-31 18:02:52] [INFO ] Invariant cache hit.
[2026-05-31 18:02:52] [INFO ] Implicit Places using invariants in 37 ms returned [19, 20, 25]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 38 ms to find 3 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 32/65 places, 30/43 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 32 transition count 28
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 6 place count 30 transition count 26
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 30 transition count 24
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 28 transition count 24
Applied a total of 10 rules in 3 ms. Remains 28 /32 variables (removed 4) and now considering 24/30 (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-3561838400584206908.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3247652505935527710.kers'
[2026-05-31 18:02:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3561838400584206908.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3247652505935527710.kers]
Normalized transition count is 23 out of 24 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 23 rows 28 cols 65 entries
Finished phase 1 with 19 SingleSign rule and 0 generalized
[2026-05-31 18:02:52] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3247652505935527710.kers
Total runtime 0 ms.
[2026-05-31 18:02:52] [INFO ] Implicit Places using invariants in 28 ms returned []
[2026-05-31 18:02:52] [INFO ] Invariant cache hit.
[2026-05-31 18:02:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 18:02:52] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 28/65 places, 24/43 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 1100 ms. Remains : 28/65 places, 24/43 transitions.
[2026-05-31 18:02:52] [INFO ] Flatten gal took : 2 ms
[2026-05-31 18:02:52] [INFO ] Flatten gal took : 2 ms
[2026-05-31 18:02:52] [INFO ] Input system was already deterministic with 24 transitions.
[2026-05-31 18:02:52] [INFO ] Flatten gal took : 2 ms
[2026-05-31 18:02:52] [INFO ] Flatten gal took : 2 ms
[2026-05-31 18:02:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality15338246439386472759.gal : 1 ms
[2026-05-31 18:02:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality3095931198058491377.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/CTLCardinality15338246439386472759.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3095931198058491377.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,952,0.005504,4020,2,211,5,707,6,0,131,376,0


Converting to forward existential form...Done !
original formula: EF(!(E(((p50>=1)&&(p52<=1)) U E(A((p47<=p1) U (p63<=p69)) U !(EG((p51>=1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(((p50>=1)&&(p52<=1)) U E(!((E(!((p63<=p69)) U (!((p47<=p1)) * !((p63<=p69)))) + EG(!((p6...198
Reverse transition relation is NOT exact ! Due to transitions t16, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
(forward)formula 0,0,0.043816,6180,1,0,121,12122,84,48,771,8953,222
FORMULA SupplyChain-PT-00005-CTLCardinality-2024-05 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 : 65/65 places, 43/43 transitions.
Ensure Unique test removed 16 places
Reduce places removed 18 places and 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 47 transition count 38
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 10 place count 44 transition count 34
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 43 transition count 33
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 12 place count 43 transition count 29
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 24 place count 35 transition count 29
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 27 place count 32 transition count 26
Applied a total of 27 rules in 7 ms. Remains 32 /65 variables (removed 33) and now considering 26/43 (removed 17) transitions.
Running 16 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7158560040423215772.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14853700177915478824.kers'
[2026-05-31 18:02:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7158560040423215772.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14853700177915478824.kers]
Normalized transition count is 25 out of 26 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 25 rows 31 cols 68 entries
Finished phase 1 with 18 SingleSign rule and 1 generalized
[2026-05-31 18:02:52] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14853700177915478824.kers
Total runtime 0 ms.
[2026-05-31 18:02:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 5/32 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 25/57 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 1/58 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/58 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 0/58 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 58/58 variables, and 47 constraints, problems are : Problem set: 0 solved, 16 unsolved in 308 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 32/32 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 5/32 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 25/57 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 16/62 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/57 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 1/58 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/58 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 0/58 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 58/58 variables, and 63 constraints, problems are : Problem set: 0 solved, 16 unsolved in 310 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 32/32 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 627ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 627ms
[2026-05-31 18:02:53] [INFO ] Invariant cache hit.
[2026-05-31 18:02:53] [INFO ] Implicit Places using invariants in 40 ms returned [5, 18, 19, 20, 21, 22, 24]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 40 ms to find 7 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 25/65 places, 26/43 transitions.
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 5 rules applied. Total rules applied 5 place count 25 transition count 21
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 15 place count 20 transition count 16
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 15 place count 20 transition count 11
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 25 place count 15 transition count 11
Applied a total of 25 rules in 1 ms. Remains 15 /25 variables (removed 10) and now considering 11/26 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9783702431655113375.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13567648454609680228.kers'
[2026-05-31 18:02:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9783702431655113375.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13567648454609680228.kers]
Normalized transition count is 10 out of 11 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 10 rows 14 cols 24 entries
Finished phase 1 with 9 SingleSign rule and 0 generalized
[2026-05-31 18:02:53] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13567648454609680228.kers
Total runtime 1 ms.
[2026-05-31 18:02:53] [INFO ] Implicit Places using invariants in 24 ms returned []
[2026-05-31 18:02:53] [INFO ] Invariant cache hit.
[2026-05-31 18:02:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 18:02:53] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 15/65 places, 11/43 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 732 ms. Remains : 15/65 places, 11/43 transitions.
[2026-05-31 18:02:53] [INFO ] Flatten gal took : 1 ms
[2026-05-31 18:02:53] [INFO ] Flatten gal took : 1 ms
[2026-05-31 18:02:53] [INFO ] Input system was already deterministic with 11 transitions.
[2026-05-31 18:02:53] [INFO ] Flatten gal took : 1 ms
[2026-05-31 18:02:53] [INFO ] Flatten gal took : 0 ms
[2026-05-31 18:02:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality13537127359358592187.gal : 0 ms
[2026-05-31 18:02:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality8035702848658161595.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/CTLCardinality13537127359358592187.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8035702848658161595.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,74,0.003427,3828,2,48,5,167,6,0,66,103,0


Converting to forward existential form...Done !
original formula: EG(EF(((p53<1)||(p29<1))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((p53<1)||(p29<1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0...163
(forward)formula 0,1,0.008486,4116,1,0,34,814,44,15,407,721,44
FORMULA SupplyChain-PT-00005-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 65/65 places, 43/43 transitions.
Ensure Unique test removed 16 places
Reduce places removed 18 places and 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 47 transition count 38
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 9 place count 44 transition count 35
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 9 place count 44 transition count 30
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 15 rules applied. Total rules applied 24 place count 34 transition count 30
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 27 place count 31 transition count 27
Applied a total of 27 rules in 4 ms. Remains 31 /65 variables (removed 34) and now considering 27/43 (removed 16) transitions.
Running 17 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9545920195677290094.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7568293883986634688.kers'
[2026-05-31 18:02:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9545920195677290094.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7568293883986634688.kers]
Normalized transition count is 26 out of 27 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 26 rows 31 cols 71 entries
Finished phase 1 with 19 SingleSign rule and 0 generalized
[2026-05-31 18:02:53] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7568293883986634688.kers
Total runtime 0 ms.
[2026-05-31 18:02:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 5/31 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 26/57 variables, 31/43 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 1/58 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/58 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/58 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 58/58 variables, and 44 constraints, problems are : Problem set: 0 solved, 17 unsolved in 258 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 31/31 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 5/31 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 26/57 variables, 31/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 17/61 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 1/58 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/58 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 0/58 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 58/58 variables, and 62 constraints, problems are : Problem set: 0 solved, 17 unsolved in 352 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 31/31 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 614ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 614ms
[2026-05-31 18:02:54] [INFO ] Invariant cache hit.
[2026-05-31 18:02:54] [INFO ] Implicit Places using invariants in 42 ms returned [17, 18, 19, 20, 21, 22]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 44 ms to find 6 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 25/65 places, 27/43 transitions.
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 5 rules applied. Total rules applied 5 place count 25 transition count 22
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 15 place count 20 transition count 17
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 15 place count 20 transition count 12
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 25 place count 15 transition count 12
Applied a total of 25 rules in 2 ms. Remains 15 /25 variables (removed 10) and now considering 12/27 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10398981055248937126.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13890234932390803727.kers'
[2026-05-31 18:02:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10398981055248937126.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13890234932390803727.kers]
Normalized transition count is 11 out of 12 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 11 rows 15 cols 30 entries
Finished phase 1 with 9 SingleSign rule and 0 generalized
[2026-05-31 18:02:54] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13890234932390803727.kers
Total runtime 0 ms.
[2026-05-31 18:02:54] [INFO ] Implicit Places using invariants in 22 ms returned []
[2026-05-31 18:02:54] [INFO ] Invariant cache hit.
[2026-05-31 18:02:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 18:02:54] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 15/65 places, 12/43 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 716 ms. Remains : 15/65 places, 12/43 transitions.
[2026-05-31 18:02:54] [INFO ] Flatten gal took : 0 ms
[2026-05-31 18:02:54] [INFO ] Flatten gal took : 0 ms
[2026-05-31 18:02:54] [INFO ] Input system was already deterministic with 12 transitions.
[2026-05-31 18:02:54] [INFO ] Flatten gal took : 1 ms
[2026-05-31 18:02:54] [INFO ] Flatten gal took : 1 ms
[2026-05-31 18:02:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality17211768418403327501.gal : 0 ms
[2026-05-31 18:02:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality18291936319269859401.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/CTLCardinality17211768418403327501.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18291936319269859401.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,66,0.00265,3836,2,47,5,154,6,0,67,93,0


Converting to forward existential form...Done !
original formula: EF(EG((p61>p36)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(p61>p36))] != FALSE
Hit Full ! (commute/partial/dont) 8/0/4
(forward)formula 0,0,0.00501,4104,1,0,16,623,19,1,353,423,17
FORMULA SupplyChain-PT-00005-CTLCardinality-2024-08 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 : 65/65 places, 43/43 transitions.
Ensure Unique test removed 16 places
Reduce places removed 18 places and 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 47 transition count 37
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 13 place count 43 transition count 32
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 16 place count 41 transition count 31
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 16 place count 41 transition count 23
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 36 place count 29 transition count 23
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 37 place count 28 transition count 22
Applied a total of 37 rules in 4 ms. Remains 28 /65 variables (removed 37) and now considering 22/43 (removed 21) transitions.
Running 14 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17323080987972928005.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7881404456581227496.kers'
[2026-05-31 18:02:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17323080987972928005.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7881404456581227496.kers]
Normalized transition count is 21 out of 22 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 21 rows 28 cols 62 entries
Finished phase 1 with 15 SingleSign rule and 1 generalized
[2026-05-31 18:02:54] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7881404456581227496.kers
Total runtime 0 ms.
[2026-05-31 18:02:54] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 5/28 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 21/49 variables, 28/41 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/49 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 1/50 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/50 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 0/50 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 50/50 variables, and 42 constraints, problems are : Problem set: 0 solved, 14 unsolved in 280 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 28/28 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 5/28 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 21/49 variables, 28/41 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/49 variables, 14/55 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/49 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 1/50 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/50 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 0/50 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 50/50 variables, and 56 constraints, problems are : Problem set: 0 solved, 14 unsolved in 242 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 28/28 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 535ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 536ms
[2026-05-31 18:02:54] [INFO ] Invariant cache hit.
[2026-05-31 18:02:54] [INFO ] Implicit Places using invariants in 30 ms returned [7, 19, 21, 23, 24]
[2026-05-31 18:02:54] [INFO ] Actually due to overlaps returned [19, 21, 23, 7]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 33 ms to find 4 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 24/65 places, 22/43 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 24 transition count 20
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 6 place count 22 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 22 transition count 16
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 18 transition count 16
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 18 transition count 15
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 13 place count 18 transition count 14
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 17 transition count 14
Applied a total of 15 rules in 2 ms. Remains 17 /24 variables (removed 7) and now considering 14/22 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6820507607571104056.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6343416783968542411.kers'
[2026-05-31 18:02:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6820507607571104056.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6343416783968542411.kers]
Normalized transition count is 13 out of 14 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 13 rows 17 cols 35 entries
Finished phase 1 with 11 SingleSign rule and 0 generalized
[2026-05-31 18:02:54] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6343416783968542411.kers
Total runtime 0 ms.
[2026-05-31 18:02:54] [INFO ] Implicit Places using invariants in 20 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 26 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 16/65 places, 14/43 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 602 ms. Remains : 16/65 places, 14/43 transitions.
[2026-05-31 18:02:54] [INFO ] Flatten gal took : 1 ms
[2026-05-31 18:02:54] [INFO ] Flatten gal took : 1 ms
[2026-05-31 18:02:54] [INFO ] Input system was already deterministic with 14 transitions.
[2026-05-31 18:02:54] [INFO ] Flatten gal took : 3 ms
[2026-05-31 18:02:54] [INFO ] Flatten gal took : 1 ms
[2026-05-31 18:02:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality10658843705539373839.gal : 0 ms
[2026-05-31 18:02:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality727283782247143500.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/CTLCardinality10658843705539373839.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality727283782247143500.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,62,0.003044,3848,2,63,5,199,6,0,75,113,0


Converting to forward existential form...Done !
original formula: EG((AF((p46<=p49)) * EG(A(EF((p22>=1)) U (p51>p41)))))
=> equivalent forward existential formula: [FwdG(Init,(!(EG(!((p46<=p49)))) * EG(!((E(!((p51>p41)) U (!(E(TRUE U (p22>=1))) * !((p51>p41)))) + EG(!((p51>p4...174
Reverse transition relation is NOT exact ! Due to transitions t12, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
Using saturation style SCC detection
(forward)formula 0,0,0.011797,4396,1,0,85,2288,66,50,454,1720,142
FORMULA SupplyChain-PT-00005-CTLCardinality-2024-10 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 : 65/65 places, 43/43 transitions.
Ensure Unique test removed 15 places
Reduce places removed 16 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 49 transition count 41
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 47 transition count 41
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 44 transition count 38
Applied a total of 6 rules in 4 ms. Remains 44 /65 variables (removed 21) and now considering 38/43 (removed 5) transitions.
Running 29 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13551099324827975351.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9435098768453881921.kers'
[2026-05-31 18:02:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13551099324827975351.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9435098768453881921.kers]
Normalized transition count is 37 out of 38 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 37 rows 43 cols 116 entries
Finished phase 1 with 23 SingleSign rule and 4 generalized
[2026-05-31 18:02:55] [INFO ] Computed 17 invariants in 0 ms
Computed 17 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-9435098768453881921.kers
Total runtime 6 ms.
[2026-05-31 18:02:55] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 5/44 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 37/81 variables, 44/62 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 1/82 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/82 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (OVERLAPS) 0/82 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 82/82 variables, and 63 constraints, problems are : Problem set: 0 solved, 29 unsolved in 617 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 44/44 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 5/44 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 37/81 variables, 44/62 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 29/91 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/81 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (OVERLAPS) 1/82 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/82 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (OVERLAPS) 0/82 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 82/82 variables, and 92 constraints, problems are : Problem set: 0 solved, 29 unsolved in 810 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 44/44 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1442ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 1443ms
[2026-05-31 18:02:56] [INFO ] Invariant cache hit.
[2026-05-31 18:02:56] [INFO ] Implicit Places using invariants in 39 ms returned [7, 8, 9, 10, 28, 29, 30, 31, 32, 35]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 40 ms to find 10 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 34/65 places, 38/43 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 34 transition count 35
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 9 place count 31 transition count 32
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 9 place count 31 transition count 29
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 28 transition count 29
Applied a total of 15 rules in 2 ms. Remains 28 /34 variables (removed 6) and now considering 29/38 (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-12774740334152571915.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15205821027132503722.kers'
[2026-05-31 18:02:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12774740334152571915.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15205821027132503722.kers]
Normalized transition count is 28 out of 29 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 28 rows 27 cols 70 entries
Finished phase 1 with 21 SingleSign rule and 0 generalized
[2026-05-31 18:02:56] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15205821027132503722.kers
Total runtime 0 ms.
[2026-05-31 18:02:56] [INFO ] Implicit Places using invariants in 23 ms returned []
[2026-05-31 18:02:56] [INFO ] Invariant cache hit.
[2026-05-31 18:02:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 18:02:56] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 28/65 places, 29/43 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 1554 ms. Remains : 28/65 places, 29/43 transitions.
[2026-05-31 18:02:56] [INFO ] Flatten gal took : 1 ms
[2026-05-31 18:02:56] [INFO ] Flatten gal took : 1 ms
[2026-05-31 18:02:56] [INFO ] Input system was already deterministic with 29 transitions.
[2026-05-31 18:02:56] [INFO ] Flatten gal took : 1 ms
[2026-05-31 18:02:56] [INFO ] Flatten gal took : 2 ms
[2026-05-31 18:02:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality1253339160425939836.gal : 0 ms
[2026-05-31 18:02:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality9836469774001304862.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/CTLCardinality1253339160425939836.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9836469774001304862.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,1568,0.006932,4068,2,248,5,884,6,0,136,437,0


Converting to forward existential form...Done !
original formula: (E((p47>=1) U EG(AF((((p65<1)||(p30<=p55))||(p68>=1))))) + (AG((AF((p27<=p36)) + EF((p42<=p28)))) * AF(((p1<=p19) * AG((p34>=1))))))
=> equivalent forward existential formula: ([FwdG((FwdU((Init * !(E((p47>=1) U EG(!(EG(!((((p65<1)||(p30<=p55))||(p68>=1))))))))),TRUE) * !(E(TRUE U (p42<=...321
Reverse transition relation is NOT exact ! Due to transitions t19, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
(forward)formula 0,1,0.050095,6728,1,0,91,12756,100,28,836,9723,179
FORMULA SupplyChain-PT-00005-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 43/43 transitions.
Ensure Unique test removed 16 places
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 49 transition count 43
Applied a total of 16 rules in 1 ms. Remains 49 /65 variables (removed 16) and now considering 43/43 (removed 0) transitions.
Running 38 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17863812840477969275.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3406184833049127140.kers'
[2026-05-31 18:02:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17863812840477969275.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3406184833049127140.kers]
Normalized transition count is 42 out of 43 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 42 rows 49 cols 134 entries
Finished phase 1 with 27 SingleSign rule and 5 generalized
[2026-05-31 18:02:56] [INFO ] Computed 17 invariants in 0 ms
Computed 17 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3406184833049127140.kers
Total runtime 0 ms.
[2026-05-31 18:02:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 5/49 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 42/91 variables, 49/67 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 1/92 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (OVERLAPS) 0/92 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 92/92 variables, and 68 constraints, problems are : Problem set: 0 solved, 38 unsolved in 923 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 5/49 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 42/91 variables, 49/67 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 38/105 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/91 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (OVERLAPS) 1/92 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 11 (OVERLAPS) 0/92 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 92/92 variables, and 106 constraints, problems are : Problem set: 0 solved, 38 unsolved in 1160 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2090ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 2090ms
[2026-05-31 18:02:58] [INFO ] Invariant cache hit.
[2026-05-31 18:02:58] [INFO ] Implicit Places using invariants in 50 ms returned [8, 10, 12, 30, 32, 33, 34, 36]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 52 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 41/65 places, 43/43 transitions.
Applied a total of 0 rules in 0 ms. Remains 41 /41 variables (removed 0) and now considering 43/43 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2146 ms. Remains : 41/65 places, 43/43 transitions.
[2026-05-31 18:02:58] [INFO ] Flatten gal took : 2 ms
[2026-05-31 18:02:58] [INFO ] Flatten gal took : 2 ms
[2026-05-31 18:02:58] [INFO ] Input system was already deterministic with 43 transitions.
[2026-05-31 18:02:58] [INFO ] Flatten gal took : 2 ms
[2026-05-31 18:02:58] [INFO ] Flatten gal took : 2 ms
[2026-05-31 18:02:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality2840214742854102178.gal : 0 ms
[2026-05-31 18:02:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality15058712604279044998.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/CTLCardinality2840214742854102178.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15058712604279044998.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,14258,0.010399,4244,2,440,5,1554,6,0,202,803,0


Converting to forward existential form...Done !
original formula: (AG(EX((!(A((p49>=1) U (p25<=p62))) + AF((p35>p12))))) * EF((p20>p23)))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EX((!(!((E(!((p25<=p62)) U (!((p49>=1)) * !((p25<=p62)))) + EG(!((p25<=p62)))))) + !(EG(!...226
Reverse transition relation is NOT exact ! Due to transitions t37, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
(forward)formula 0,0,0.160419,11284,1,0,167,39034,122,67,1210,33964,299
FORMULA SupplyChain-PT-00005-CTLCardinality-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 65/65 places, 43/43 transitions.
Ensure Unique test removed 16 places
Reduce places removed 18 places and 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 47 transition count 37
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 12 place count 43 transition count 33
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 12 place count 43 transition count 29
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 24 place count 35 transition count 29
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 27 place count 32 transition count 26
Applied a total of 27 rules in 8 ms. Remains 32 /65 variables (removed 33) and now considering 26/43 (removed 17) transitions.
Running 16 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-404264757175298707.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4903074497534142956.kers'
[2026-05-31 18:02:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-404264757175298707.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4903074497534142956.kers]
Normalized transition count is 25 out of 26 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 25 rows 31 cols 69 entries
Finished phase 1 with 17 SingleSign rule and 2 generalized
[2026-05-31 18:02:58] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4903074497534142956.kers
Total runtime 0 ms.
[2026-05-31 18:02:58] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 4/31 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 1/32 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 25/57 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/57 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 1/58 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/58 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 0/58 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 58/58 variables, and 47 constraints, problems are : Problem set: 0 solved, 16 unsolved in 360 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 32/32 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 4/31 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 1/32 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 25/57 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/57 variables, 16/62 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/57 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 1/58 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/58 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (OVERLAPS) 0/58 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 58/58 variables, and 63 constraints, problems are : Problem set: 0 solved, 16 unsolved in 335 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 32/32 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 708ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 709ms
[2026-05-31 18:02:59] [INFO ] Invariant cache hit.
[2026-05-31 18:02:59] [INFO ] Implicit Places using invariants in 42 ms returned [5, 18, 19, 20, 21, 22, 23]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 43 ms to find 7 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 25/65 places, 26/43 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 25 transition count 22
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 12 place count 21 transition count 18
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 12 place count 21 transition count 14
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 20 place count 17 transition count 14
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 17 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 21 place count 17 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 16 transition count 12
Applied a total of 23 rules in 2 ms. Remains 16 /25 variables (removed 9) and now considering 12/26 (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-10522938871432716376.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2671282694913806511.kers'
[2026-05-31 18:02:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10522938871432716376.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2671282694913806511.kers]
Normalized transition count is 11 out of 12 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 11 rows 15 cols 26 entries
Finished phase 1 with 9 SingleSign rule and 1 generalized
[2026-05-31 18:02:59] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2671282694913806511.kers
Total runtime 1 ms.
[2026-05-31 18:02:59] [INFO ] Implicit Places using invariants in 25 ms returned []
[2026-05-31 18:02:59] [INFO ] Invariant cache hit.
[2026-05-31 18:02:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 18:02:59] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 16/65 places, 12/43 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 819 ms. Remains : 16/65 places, 12/43 transitions.
[2026-05-31 18:02:59] [INFO ] Flatten gal took : 1 ms
[2026-05-31 18:02:59] [INFO ] Flatten gal took : 0 ms
[2026-05-31 18:02:59] [INFO ] Input system was already deterministic with 12 transitions.
[2026-05-31 18:02:59] [INFO ] Flatten gal took : 1 ms
[2026-05-31 18:02:59] [INFO ] Flatten gal took : 1 ms
[2026-05-31 18:02:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality1942989078662850168.gal : 1 ms
[2026-05-31 18:02:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality1942981235317038242.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/CTLCardinality1942989078662850168.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1942981235317038242.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,82,0.00542,3836,2,49,5,171,6,0,71,108,0


Converting to forward existential form...Done !
original formula: EG((AF(AG((p63<=0))) * EF((p41>=1))))
=> equivalent forward existential formula: [FwdG(Init,(!(EG(!(!(E(TRUE U !((p63<=0))))))) * E(TRUE U (p41>=1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t5, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0...163
Using saturation style SCC detection
(forward)formula 0,0,0.014052,4380,1,0,56,1530,56,38,434,1785,104
FORMULA SupplyChain-PT-00005-CTLCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-31 18:02:59] [INFO ] Flatten gal took : 3 ms
[2026-05-31 18:02:59] [INFO ] Flatten gal took : 3 ms
Total runtime 17643 ms.

BK_STOP 1780250579862

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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