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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 6.8K May 27 07:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 27 07:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K May 27 07:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K May 27 07:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 27 10:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 27 10:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 27 10:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 27 10:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 12K May 27 07:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K May 27 07:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K May 27 07:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K May 27 07:03 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 41K 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-00010-CTLFireability-2024-00
FORMULA_NAME SupplyChain-PT-00010-CTLFireability-2024-01
FORMULA_NAME SupplyChain-PT-00010-CTLFireability-2024-02
FORMULA_NAME SupplyChain-PT-00010-CTLFireability-2024-03
FORMULA_NAME SupplyChain-PT-00010-CTLFireability-2024-04
FORMULA_NAME SupplyChain-PT-00010-CTLFireability-2024-05
FORMULA_NAME SupplyChain-PT-00010-CTLFireability-2024-06
FORMULA_NAME SupplyChain-PT-00010-CTLFireability-2024-07
FORMULA_NAME SupplyChain-PT-00010-CTLFireability-2024-08
FORMULA_NAME SupplyChain-PT-00010-CTLFireability-2024-09
FORMULA_NAME SupplyChain-PT-00010-CTLFireability-2024-10
FORMULA_NAME SupplyChain-PT-00010-CTLFireability-2024-11
FORMULA_NAME SupplyChain-PT-00010-CTLFireability-2024-12
FORMULA_NAME SupplyChain-PT-00010-CTLFireability-2024-13
FORMULA_NAME SupplyChain-PT-00010-CTLFireability-2024-14
FORMULA_NAME SupplyChain-PT-00010-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1780250595547

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SupplyChain-PT-00010
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-31 18:03:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-31 18:03:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-31 18:03:17] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2026-05-31 18:03:17] [INFO ] Transformed 134 places.
[2026-05-31 18:03:17] [INFO ] Transformed 83 transitions.
[2026-05-31 18:03:17] [INFO ] Parsed PT model containing 134 places and 83 transitions and 366 arcs in 167 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Support contains 94 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 83/83 transitions.
Ensure Unique test removed 16 places
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 118 transition count 83
Applied a total of 16 rules in 19 ms. Remains 118 /134 variables (removed 16) and now considering 83/83 (removed 0) transitions.
Running 73 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-13371197778857693450.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4430177186932658908.kers'
[2026-05-31 18:03:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13371197778857693450.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4430177186932658908.kers]
Normalized transition count is 82 out of 83 initially.
Culling duplicate invariants (modulo rational): removing 24 columns.
Culled 24 columns in 0 ms.
// Phase 1: matrix 82 rows 94 cols 264 entries
Finished phase 1 with 52 SingleSign rule and 10 generalized
[2026-05-31 18:03:17] [INFO ] Computed 56 invariants in 1 ms
Computed 56 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-4430177186932658908.kers
Total runtime 3 ms.
[2026-05-31 18:03:17] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 28/30 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (OVERLAPS) 10/112 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 6/118 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 82/200 variables, 118/175 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (OVERLAPS) 1/201 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/201 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 12 (OVERLAPS) 0/201 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 176 constraints, problems are : Problem set: 0 solved, 73 unsolved in 4552 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 118/118 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 28/30 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 10/112 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 6/118 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 82/200 variables, 118/175 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 73/248 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 11 (OVERLAPS) 1/201 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/201 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 13 (OVERLAPS) 0/201 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 249 constraints, problems are : Problem set: 0 solved, 73 unsolved in 5880 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 118/118 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10603ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 10621ms
[2026-05-31 18:03:27] [INFO ] Invariant cache hit.
[2026-05-31 18:03:28] [INFO ] Implicit Places using invariants in 71 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 77 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 117/134 places, 83/83 transitions.
Applied a total of 0 rules in 2 ms. Remains 117 /117 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 10785 ms. Remains : 117/134 places, 83/83 transitions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 83/83 transitions.
Applied a total of 0 rules in 1 ms. Remains 117 /117 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Running 73 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-3492553869655331680.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4630054811270187638.kers'
[2026-05-31 18:03:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3492553869655331680.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4630054811270187638.kers]
Normalized transition count is 82 out of 83 initially.
Culling duplicate invariants (modulo rational): removing 24 columns.
Culled 24 columns in 0 ms.
// Phase 1: matrix 82 rows 93 cols 261 entries
Finished phase 1 with 53 SingleSign rule and 9 generalized
[2026-05-31 18:03:28] [INFO ] Computed 55 invariants in 0 ms
Computed 55 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4630054811270187638.kers
Total runtime 0 ms.
[2026-05-31 18:03:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 27/29 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (OVERLAPS) 10/111 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 6/117 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 82/199 variables, 117/173 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (OVERLAPS) 1/200 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 12 (OVERLAPS) 0/200 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 174 constraints, problems are : Problem set: 0 solved, 73 unsolved in 3566 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 117/117 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 27/29 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 10/111 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 6/117 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 82/199 variables, 117/173 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 73/246 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 11 (OVERLAPS) 1/200 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/200 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 13 (OVERLAPS) 0/200 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 247 constraints, problems are : Problem set: 0 solved, 73 unsolved in 5522 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 117/117 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9108ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 9109ms
[2026-05-31 18:03:37] [INFO ] Invariant cache hit.
[2026-05-31 18:03:37] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-05-31 18:03:37] [INFO ] Invariant cache hit.
[2026-05-31 18:03:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 18:03:37] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 9272 ms. Remains : 117/117 places, 83/83 transitions.
Support contains 94 out of 117 places after structural reductions.
[2026-05-31 18:03:37] [INFO ] Flatten gal took : 40 ms
[2026-05-31 18:03:37] [INFO ] Flatten gal took : 13 ms
[2026-05-31 18:03:37] [INFO ] Input system was already deterministic with 83 transitions.
RANDOM walk for 4939 steps (91 resets) in 226 ms. (21 steps per ms) remains 0/46 properties
[2026-05-31 18:03:37] [INFO ] Flatten gal took : 8 ms
[2026-05-31 18:03:37] [INFO ] Flatten gal took : 8 ms
[2026-05-31 18:03:37] [INFO ] Input system was already deterministic with 83 transitions.
Computed a total of 117 stabilizing places and 82 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 83/83 transitions.
Ensure Unique test removed 23 places
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 94 transition count 83
Applied a total of 23 rules in 2 ms. Remains 94 /117 variables (removed 23) and now considering 83/83 (removed 0) transitions.
Running 73 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-5868506583345408326.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3095747300473792495.kers'
[2026-05-31 18:03:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5868506583345408326.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3095747300473792495.kers]
Normalized transition count is 82 out of 83 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 82 rows 93 cols 261 entries
Finished phase 1 with 53 SingleSign rule and 9 generalized
[2026-05-31 18:03:37] [INFO ] Computed 32 invariants in 0 ms
Computed 32 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3095747300473792495.kers
Total runtime 1 ms.
[2026-05-31 18:03:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (OVERLAPS) 10/93 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 1/94 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 82/176 variables, 94/127 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/176 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (OVERLAPS) 1/177 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/177 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 12 (OVERLAPS) 0/177 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/177 variables, and 128 constraints, problems are : Problem set: 0 solved, 73 unsolved in 2994 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 94/94 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 10/93 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 1/94 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 82/176 variables, 94/127 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/176 variables, 73/200 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/176 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 11 (OVERLAPS) 1/177 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/177 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 13 (OVERLAPS) 0/177 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/177 variables, and 201 constraints, problems are : Problem set: 0 solved, 73 unsolved in 4445 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 94/94 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7454ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 7454ms
[2026-05-31 18:03:45] [INFO ] Invariant cache hit.
[2026-05-31 18:03:45] [INFO ] Implicit Places using invariants in 72 ms returned [0, 3, 32, 33, 34, 35, 36, 37, 38, 40, 41, 87, 88, 89, 90, 91, 92, 93]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 74 ms to find 18 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 76/117 places, 83/83 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7533 ms. Remains : 76/117 places, 83/83 transitions.
[2026-05-31 18:03:45] [INFO ] Flatten gal took : 4 ms
[2026-05-31 18:03:45] [INFO ] Flatten gal took : 4 ms
[2026-05-31 18:03:45] [INFO ] Input system was already deterministic with 83 transitions.
[2026-05-31 18:03:45] [INFO ] Flatten gal took : 4 ms
[2026-05-31 18:03:45] [INFO ] Flatten gal took : 4 ms
[2026-05-31 18:03:45] [INFO ] Time to serialize gal into /tmp/CTLFireability3833772988359238885.gal : 2 ms
[2026-05-31 18:03:45] [INFO ] Time to serialize properties into /tmp/CTLFireability310256706590988365.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/CTLFireability3833772988359238885.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability310256706590988365.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.61243e+08,2.38716,66896,2,36601,5,303808,6,0,376,328738,0


Converting to forward existential form...Done !
original formula: EF(((p82>=1) * AX((((((p19>=1)&&(p26>=1))&&((p102>=1)&&(p85>=1)))&&(p77>=1)) + ((((p88<1)||(p11<1))||((p42<1)||(p55<1))) * EG((p91>=1))))...158
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * (p82>=1)) * !(EX(!((((((p19>=1)&&(p26>=1))&&((p102>=1)&&(p85>=1)))&&(p77>=1)) + ((((p88<1)|...216
Reverse transition relation is NOT exact ! Due to transitions t81, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
(forward)formula 0,0,27.0179,751740,1,0,302,4.15391e+06,187,106,2128,3.2066e+06,568
FORMULA SupplyChain-PT-00010-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 117/117 places, 83/83 transitions.
Ensure Unique test removed 21 places
Reduce places removed 24 places and 3 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 93 transition count 74
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 81 transition count 74
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 81 transition count 73
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 20 place count 81 transition count 72
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 21 place count 80 transition count 72
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 25 place count 76 transition count 68
Applied a total of 25 rules in 37 ms. Remains 76 /117 variables (removed 41) and now considering 68/83 (removed 15) transitions.
Running 51 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-13217691055731911121.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2751466058699460550.kers'
[2026-05-31 18:04:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13217691055731911121.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2751466058699460550.kers]
Normalized transition count is 67 out of 68 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 67 rows 73 cols 199 entries
Finished phase 1 with 45 SingleSign rule and 3 generalized
[2026-05-31 18:04:12] [INFO ] Computed 28 invariants in 0 ms
Computed 28 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-2751466058699460550.kers
Total runtime 4 ms.
[2026-05-31 18:04:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (OVERLAPS) 9/74 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (OVERLAPS) 2/76 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 8 (OVERLAPS) 67/143 variables, 76/105 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 10 (OVERLAPS) 1/144 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/144 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 12 (OVERLAPS) 0/144 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 144/144 variables, and 106 constraints, problems are : Problem set: 0 solved, 51 unsolved in 2140 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 76/76 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 51 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (OVERLAPS) 9/74 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (OVERLAPS) 2/76 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 8 (OVERLAPS) 67/143 variables, 76/105 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 51/156 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 11 (OVERLAPS) 1/144 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/144 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 13 (OVERLAPS) 0/144 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 144/144 variables, and 157 constraints, problems are : Problem set: 0 solved, 51 unsolved in 2265 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 76/76 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4432ms problems are : Problem set: 0 solved, 51 unsolved
Search for dead transitions found 0 dead transitions in 4433ms
[2026-05-31 18:04:17] [INFO ] Invariant cache hit.
[2026-05-31 18:04:17] [INFO ] Implicit Places using invariants in 67 ms returned [0, 1, 4, 26, 69, 71, 72, 73, 74, 75]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 70 ms to find 10 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 66/117 places, 68/83 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 66 transition count 62
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 18 place count 60 transition count 56
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 18 place count 60 transition count 50
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 30 place count 54 transition count 50
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 31 place count 54 transition count 49
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 31 place count 54 transition count 48
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 33 place count 53 transition count 48
Applied a total of 33 rules in 11 ms. Remains 53 /66 variables (removed 13) and now considering 48/68 (removed 20) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-534676799741321730.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8201935805698888208.kers'
[2026-05-31 18:04:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-534676799741321730.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8201935805698888208.kers]
Normalized transition count is 47 out of 48 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 47 rows 50 cols 136 entries
Finished phase 1 with 35 SingleSign rule and 0 generalized
[2026-05-31 18:04:17] [INFO ] Computed 18 invariants in 0 ms
Computed 18 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8201935805698888208.kers
Total runtime 0 ms.
[2026-05-31 18:04:17] [INFO ] Implicit Places using invariants in 48 ms returned []
[2026-05-31 18:04:17] [INFO ] Invariant cache hit.
[2026-05-31 18:04:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 18:04:17] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 53/117 places, 48/83 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 4666 ms. Remains : 53/117 places, 48/83 transitions.
[2026-05-31 18:04:17] [INFO ] Flatten gal took : 2 ms
[2026-05-31 18:04:17] [INFO ] Flatten gal took : 2 ms
[2026-05-31 18:04:17] [INFO ] Input system was already deterministic with 48 transitions.
[2026-05-31 18:04:17] [INFO ] Flatten gal took : 3 ms
[2026-05-31 18:04:17] [INFO ] Flatten gal took : 3 ms
[2026-05-31 18:04:17] [INFO ] Time to serialize gal into /tmp/CTLFireability15708929975954764337.gal : 10 ms
[2026-05-31 18:04:17] [INFO ] Time to serialize properties into /tmp/CTLFireability10254154663557177690.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/CTLFireability15708929975954764337.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10254154663557177690.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,220418,0.01648,4456,2,577,5,2860,6,0,249,1663,0


Converting to forward existential form...Done !
original formula: AF(((((p77<1) * EF((p89<1))) * ((p11>=1)&&(p45>=1))) * (((p58>=1) * EG(((p36<1)||(p94<1)))) * ((((p11<1)||(p49<1))||(p52<1)) * ((((p11<1)...245
=> equivalent forward existential formula: [FwdG(Init,!(((((p77<1) * E(TRUE U (p89<1))) * ((p11>=1)&&(p45>=1))) * (((p58>=1) * EG(((p36<1)||(p94<1)))) * ((...302
Reverse transition relation is NOT exact ! Due to transitions t33, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
(forward)formula 0,0,0.311177,19392,1,0,175,78092,133,100,1554,99412,208
FORMULA SupplyChain-PT-00010-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 83/83 transitions.
Ensure Unique test removed 23 places
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 94 transition count 83
Applied a total of 23 rules in 2 ms. Remains 94 /117 variables (removed 23) and now considering 83/83 (removed 0) transitions.
Running 73 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-1884568975283646083.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14772399184886824294.kers'
[2026-05-31 18:04:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1884568975283646083.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14772399184886824294.kers]
Normalized transition count is 82 out of 83 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 82 rows 93 cols 261 entries
Finished phase 1 with 53 SingleSign rule and 9 generalized
[2026-05-31 18:04:17] [INFO ] Computed 32 invariants in 0 ms
Computed 32 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14772399184886824294.kers
Total runtime 0 ms.
[2026-05-31 18:04:17] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (OVERLAPS) 10/93 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 1/94 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 82/176 variables, 94/127 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/176 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (OVERLAPS) 1/177 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/177 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 12 (OVERLAPS) 0/177 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/177 variables, and 128 constraints, problems are : Problem set: 0 solved, 73 unsolved in 3059 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 94/94 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 10/93 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 1/94 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 82/176 variables, 94/127 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/176 variables, 73/200 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/176 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 11 (OVERLAPS) 1/177 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/177 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 13 (OVERLAPS) 0/177 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/177 variables, and 201 constraints, problems are : Problem set: 0 solved, 73 unsolved in 4469 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 94/94 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7550ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 7550ms
[2026-05-31 18:04:25] [INFO ] Invariant cache hit.
[2026-05-31 18:04:25] [INFO ] Implicit Places using invariants in 72 ms returned [0, 1, 3, 31, 32, 33, 35, 38, 40, 41, 87, 89, 91, 92, 93]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 73 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 79/117 places, 83/83 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7628 ms. Remains : 79/117 places, 83/83 transitions.
[2026-05-31 18:04:25] [INFO ] Flatten gal took : 6 ms
[2026-05-31 18:04:25] [INFO ] Flatten gal took : 3 ms
[2026-05-31 18:04:25] [INFO ] Input system was already deterministic with 83 transitions.
[2026-05-31 18:04:25] [INFO ] Flatten gal took : 3 ms
[2026-05-31 18:04:25] [INFO ] Flatten gal took : 3 ms
[2026-05-31 18:04:25] [INFO ] Time to serialize gal into /tmp/CTLFireability13709064316197462877.gal : 1 ms
[2026-05-31 18:04:25] [INFO ] Time to serialize properties into /tmp/CTLFireability7081436995689623008.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/CTLFireability13709064316197462877.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7081436995689623008.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.61243e+08,2.45738,83996,2,54171,5,435985,6,0,388,418808,0


Converting to forward existential form...Done !
original formula: AF((E(EF((((p11>=1)&&(p47>=1))&&(p60>=1))) U (((p11>=1)&&(p45>=1))&&(p58>=1))) * ((((p11>=1)&&(p48>=1))&&(p61>=1)) + ((AX((((p87<1)||(p94...208
=> equivalent forward existential formula: [FwdG(Init,!((E(E(TRUE U (((p11>=1)&&(p47>=1))&&(p60>=1))) U (((p11>=1)&&(p45>=1))&&(p58>=1))) * ((((p11>=1)&&(p...265
Reverse transition relation is NOT exact ! Due to transitions t81, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
Detected timeout of ITS tools.
[2026-05-31 18:04:55] [INFO ] Flatten gal took : 7 ms
[2026-05-31 18:04:55] [INFO ] Applying decomposition
[2026-05-31 18:04:55] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph10726833755897190250.txt' '-o' '/tmp/graph10726833755897190250.bin' '-w' '/tmp/graph10726833755897190250.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10726833755897190250.bin' '-l' '-1' '-v' '-w' '/tmp/graph10726833755897190250.weights' '-q' '0' '-e' '0.001'
[2026-05-31 18:04:55] [INFO ] Decomposing Gal with order
[2026-05-31 18:04:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-31 18:04:55] [INFO ] Removed a total of 18 redundant transitions.
[2026-05-31 18:04:55] [INFO ] Flatten gal took : 61 ms
[2026-05-31 18:04:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 4 ms.
[2026-05-31 18:04:55] [INFO ] Time to serialize gal into /tmp/CTLFireability2931809714561644360.gal : 2 ms
[2026-05-31 18:04:55] [INFO ] Time to serialize properties into /tmp/CTLFireability4346464644861935960.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/CTLFireability2931809714561644360.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4346464644861935960.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.61243e+08,7.97634,241532,3236,9982,105350,127555,161,1.49791e+06,161,2.06198e+06,0


Converting to forward existential form...Done !
original formula: AF((E(EF((((i0.u0.p11>=1)&&(i3.u3.p47>=1))&&(i3.u10.p60>=1))) U (((i0.u0.p11>=1)&&(i2.u2.p45>=1))&&(i2.u9.p58>=1))) * ((((i0.u0.p11>=1)&&...303
=> equivalent forward existential formula: [FwdG(Init,!((E(E(TRUE U (((i0.u0.p11>=1)&&(i3.u3.p47>=1))&&(i3.u10.p60>=1))) U (((i0.u0.p11>=1)&&(i2.u2.p45>=1)...360
Reverse transition relation is NOT exact ! Due to transitions i0.t81, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total...167
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
(forward)formula 0,0,28.2241,623044,1,0,379809,333545,977,3.4556e+06,776,4.59752e+06,350455
FORMULA SupplyChain-PT-00010-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 83/83 transitions.
Ensure Unique test removed 24 places
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 93 transition count 83
Applied a total of 24 rules in 3 ms. Remains 93 /117 variables (removed 24) and now considering 83/83 (removed 0) transitions.
Running 73 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-1317277439490986770.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16512928642837438103.kers'
[2026-05-31 18:05:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1317277439490986770.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16512928642837438103.kers]
Normalized transition count is 82 out of 83 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 82 rows 93 cols 261 entries
Finished phase 1 with 53 SingleSign rule and 9 generalized
[2026-05-31 18:05:24] [INFO ] Computed 31 invariants in 0 ms
Computed 31 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16512928642837438103.kers
Total runtime 1 ms.
[2026-05-31 18:05:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (OVERLAPS) 10/93 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 82/175 variables, 93/125 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 1/176 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/176 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (OVERLAPS) 0/176 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 176/176 variables, and 126 constraints, problems are : Problem set: 0 solved, 73 unsolved in 2591 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 93/93 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 10/93 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 82/175 variables, 93/125 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 73/198 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (OVERLAPS) 1/176 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/176 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 11 (OVERLAPS) 0/176 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 176/176 variables, and 199 constraints, problems are : Problem set: 0 solved, 73 unsolved in 4172 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 93/93 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6785ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 6786ms
[2026-05-31 18:05:30] [INFO ] Invariant cache hit.
[2026-05-31 18:05:30] [INFO ] Implicit Places using invariants in 60 ms returned [1, 3, 30, 31, 32, 33, 34, 35, 36, 37, 39, 40, 86, 87, 88, 89, 90, 92]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 61 ms to find 18 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 75/117 places, 83/83 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6852 ms. Remains : 75/117 places, 83/83 transitions.
[2026-05-31 18:05:30] [INFO ] Flatten gal took : 3 ms
[2026-05-31 18:05:30] [INFO ] Flatten gal took : 3 ms
[2026-05-31 18:05:30] [INFO ] Input system was already deterministic with 83 transitions.
[2026-05-31 18:05:30] [INFO ] Flatten gal took : 3 ms
[2026-05-31 18:05:30] [INFO ] Flatten gal took : 3 ms
[2026-05-31 18:05:30] [INFO ] Time to serialize gal into /tmp/CTLFireability18399817155700465525.gal : 1 ms
[2026-05-31 18:05:30] [INFO ] Time to serialize properties into /tmp/CTLFireability17798722601026557919.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/CTLFireability18399817155700465525.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17798722601026557919.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.61243e+08,1.62121,58732,2,33937,5,258685,6,0,373,285361,0


Converting to forward existential form...Done !
original formula: EG(EF(!(A(EX(((p40>=1)&&(p98>=1))) U ((p101>=1)&&(p33>=1))))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U !(!((E(!(((p101>=1)&&(p33>=1))) U (!(EX(((p40>=1)&&(p98>=1)))) * !(((p101>=1)&&(p33>=1))))) ...200
Reverse transition relation is NOT exact ! Due to transitions t81, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
(forward)formula 0,1,19.06,491420,1,0,164,2.37985e+06,194,77,2335,2.46435e+06,260
FORMULA SupplyChain-PT-00010-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 83/83 transitions.
Ensure Unique test removed 22 places
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 95 transition count 83
Applied a total of 22 rules in 3 ms. Remains 95 /117 variables (removed 22) and now considering 83/83 (removed 0) transitions.
Running 73 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-12041463196263189680.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10764043936404095586.kers'
[2026-05-31 18:05:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12041463196263189680.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10764043936404095586.kers]
Normalized transition count is 82 out of 83 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 82 rows 93 cols 261 entries
Finished phase 1 with 53 SingleSign rule and 9 generalized
[2026-05-31 18:05:50] [INFO ] Computed 33 invariants in 1 ms
Computed 33 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10764043936404095586.kers
Total runtime 2 ms.
[2026-05-31 18:05:50] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (OVERLAPS) 10/95 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 82/177 variables, 95/129 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 1/178 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/178 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (OVERLAPS) 0/178 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 130 constraints, problems are : Problem set: 0 solved, 73 unsolved in 2779 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 95/95 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 10/95 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 82/177 variables, 95/129 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 73/202 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (OVERLAPS) 1/178 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/178 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 11 (OVERLAPS) 0/178 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/178 variables, and 203 constraints, problems are : Problem set: 0 solved, 73 unsolved in 4273 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 95/95 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7074ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 7076ms
[2026-05-31 18:05:57] [INFO ] Invariant cache hit.
[2026-05-31 18:05:57] [INFO ] Implicit Places using invariants in 72 ms returned [0, 4, 32, 33, 34, 35, 36, 37, 38, 39, 41, 42, 88, 89, 90, 91, 92, 93, 94]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 73 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 76/117 places, 83/83 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7156 ms. Remains : 76/117 places, 83/83 transitions.
[2026-05-31 18:05:57] [INFO ] Flatten gal took : 3 ms
[2026-05-31 18:05:57] [INFO ] Flatten gal took : 3 ms
[2026-05-31 18:05:57] [INFO ] Input system was already deterministic with 83 transitions.
[2026-05-31 18:05:57] [INFO ] Flatten gal took : 3 ms
[2026-05-31 18:05:57] [INFO ] Flatten gal took : 3 ms
[2026-05-31 18:05:57] [INFO ] Time to serialize gal into /tmp/CTLFireability3075547459219954398.gal : 1 ms
[2026-05-31 18:05:57] [INFO ] Time to serialize properties into /tmp/CTLFireability13787876247868616273.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/CTLFireability3075547459219954398.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13787876247868616273.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.61243e+08,1.67426,56416,2,36896,5,271585,6,0,377,258784,0


Converting to forward existential form...Done !
original formula: AX(AG(AF((EF((((p109<1)||(p124<1))||(p68<1))) + ((p77<1)&&((p102<1)||(p34<1)))))))
=> equivalent forward existential formula: [FwdG(FwdU(EY(Init),TRUE),!((E(TRUE U (((p109<1)||(p124<1))||(p68<1))) + ((p77<1)&&((p102<1)||(p34<1))))))] = FA...158
Reverse transition relation is NOT exact ! Due to transitions t81, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
(forward)formula 0,1,19.4956,588988,1,0,156,2.99074e+06,192,68,2297,2.99961e+06,242
FORMULA SupplyChain-PT-00010-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 83/83 transitions.
Ensure Unique test removed 24 places
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 93 transition count 83
Applied a total of 24 rules in 4 ms. Remains 93 /117 variables (removed 24) and now considering 83/83 (removed 0) transitions.
Running 73 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-5666805426778979334.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3718846271933524824.kers'
[2026-05-31 18:06:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5666805426778979334.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3718846271933524824.kers]
Normalized transition count is 82 out of 83 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 82 rows 93 cols 261 entries
Finished phase 1 with 53 SingleSign rule and 9 generalized
[2026-05-31 18:06:17] [INFO ] Computed 31 invariants in 0 ms
Computed 31 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3718846271933524824.kers
Total runtime 0 ms.
[2026-05-31 18:06:17] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (OVERLAPS) 10/93 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 82/175 variables, 93/125 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 1/176 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/176 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (OVERLAPS) 0/176 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 176/176 variables, and 126 constraints, problems are : Problem set: 0 solved, 73 unsolved in 2620 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 93/93 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 10/93 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 82/175 variables, 93/125 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 73/198 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (OVERLAPS) 1/176 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/176 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 11 (OVERLAPS) 0/176 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 176/176 variables, and 199 constraints, problems are : Problem set: 0 solved, 73 unsolved in 4257 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 93/93 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6891ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 6896ms
[2026-05-31 18:06:23] [INFO ] Invariant cache hit.
[2026-05-31 18:06:24] [INFO ] Implicit Places using invariants in 79 ms returned [0, 1, 3, 30, 31, 32, 33, 34, 35, 36, 37, 39, 40, 86, 87, 88, 89, 90, 91, 92]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 80 ms to find 20 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 73/117 places, 83/83 transitions.
Applied a total of 0 rules in 2 ms. Remains 73 /73 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6983 ms. Remains : 73/117 places, 83/83 transitions.
[2026-05-31 18:06:24] [INFO ] Flatten gal took : 3 ms
[2026-05-31 18:06:24] [INFO ] Flatten gal took : 2 ms
[2026-05-31 18:06:24] [INFO ] Input system was already deterministic with 83 transitions.
[2026-05-31 18:06:24] [INFO ] Flatten gal took : 2 ms
[2026-05-31 18:06:24] [INFO ] Flatten gal took : 3 ms
[2026-05-31 18:06:24] [INFO ] Time to serialize gal into /tmp/CTLFireability17251328998302388673.gal : 1 ms
[2026-05-31 18:06:24] [INFO ] Time to serialize properties into /tmp/CTLFireability6095258713033899559.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/CTLFireability17251328998302388673.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6095258713033899559.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.61243e+08,1.48957,57640,2,34438,5,258776,6,0,365,279559,0


Converting to forward existential form...Done !
original formula: AG(AF(AX((p89<1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(!(EX(!((p89<1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t81, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
(forward)formula 0,1,16.7152,501676,1,0,155,2.54658e+06,186,69,2035,2.51099e+06,240
FORMULA SupplyChain-PT-00010-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 117/117 places, 83/83 transitions.
Ensure Unique test removed 7 places
Reduce places removed 11 places and 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 106 transition count 78
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 4 place count 105 transition count 76
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 104 transition count 76
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 5 place count 104 transition count 67
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 27 rules applied. Total rules applied 32 place count 86 transition count 67
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 34 place count 84 transition count 65
Applied a total of 34 rules in 15 ms. Remains 84 /117 variables (removed 33) and now considering 65/83 (removed 18) transitions.
Running 49 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-13032535139544546425.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7662473158731409629.kers'
[2026-05-31 18:06:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13032535139544546425.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7662473158731409629.kers]
Normalized transition count is 64 out of 65 initially.
Culling duplicate invariants (modulo rational): removing 17 columns.
Culled 17 columns in 0 ms.
// Phase 1: matrix 64 rows 67 cols 183 entries
Finished phase 1 with 44 SingleSign rule and 1 generalized
[2026-05-31 18:06:40] [INFO ] Computed 39 invariants in 0 ms
Computed 39 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7662473158731409629.kers
Total runtime 0 ms.
[2026-05-31 18:06:40] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (OVERLAPS) 10/81 variables, 14/35 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 3/84 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (OVERLAPS) 64/148 variables, 84/124 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/148 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 11 (OVERLAPS) 1/149 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/149 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 13 (OVERLAPS) 0/149 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 149/149 variables, and 125 constraints, problems are : Problem set: 0 solved, 49 unsolved in 1889 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 84/84 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 10/81 variables, 14/36 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 3/84 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (OVERLAPS) 64/148 variables, 84/124 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/148 variables, 49/173 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/148 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 12 (OVERLAPS) 1/149 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/149 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 14 (OVERLAPS) 0/149 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 149/149 variables, and 174 constraints, problems are : Problem set: 0 solved, 49 unsolved in 2554 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 84/84 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4455ms problems are : Problem set: 0 solved, 49 unsolved
Search for dead transitions found 0 dead transitions in 4455ms
[2026-05-31 18:06:45] [INFO ] Invariant cache hit.
[2026-05-31 18:06:45] [INFO ] Implicit Places using invariants in 59 ms returned [2, 3, 77, 78, 79, 80, 81, 82, 83]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 61 ms to find 9 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 75/117 places, 65/83 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 75 transition count 58
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 17 rules applied. Total rules applied 24 place count 68 transition count 48
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 28 place count 65 transition count 47
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 28 place count 65 transition count 42
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 38 place count 60 transition count 42
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 39 place count 60 transition count 41
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 39 place count 60 transition count 40
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 41 place count 59 transition count 40
Applied a total of 41 rules in 7 ms. Remains 59 /75 variables (removed 16) and now considering 40/65 (removed 25) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4690800612939324360.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1608472367794008502.kers'
[2026-05-31 18:06:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4690800612939324360.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1608472367794008502.kers]
Normalized transition count is 39 out of 40 initially.
Culling duplicate invariants (modulo rational): removing 17 columns.
Culled 17 columns in 0 ms.
// Phase 1: matrix 39 rows 42 cols 111 entries
Finished phase 1 with 29 SingleSign rule and 0 generalized
[2026-05-31 18:06:45] [INFO ] Computed 30 invariants in 0 ms
Computed 30 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1608472367794008502.kers
Total runtime 0 ms.
[2026-05-31 18:06:45] [INFO ] Implicit Places using invariants in 42 ms returned []
[2026-05-31 18:06:45] [INFO ] Invariant cache hit.
[2026-05-31 18:06:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 18:06:45] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 59/117 places, 40/83 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 4630 ms. Remains : 59/117 places, 40/83 transitions.
[2026-05-31 18:06:45] [INFO ] Flatten gal took : 3 ms
[2026-05-31 18:06:45] [INFO ] Flatten gal took : 2 ms
[2026-05-31 18:06:45] [INFO ] Input system was already deterministic with 40 transitions.
[2026-05-31 18:06:45] [INFO ] Flatten gal took : 2 ms
[2026-05-31 18:06:45] [INFO ] Flatten gal took : 2 ms
[2026-05-31 18:06:45] [INFO ] Time to serialize gal into /tmp/CTLFireability8274995927749160170.gal : 0 ms
[2026-05-31 18:06:45] [INFO ] Time to serialize properties into /tmp/CTLFireability13439948589101058529.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/CTLFireability8274995927749160170.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13439948589101058529.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,69122,0.020582,4808,2,966,5,4324,6,0,262,2150,0


Converting to forward existential form...Done !
original formula: (A(AG(((((((p1>=1)&&(p10>=1))&&((p113>=1)&&(p125>=1)))&&(((p126>=1)&&(p127>=1))&&((p128>=1)&&(p129>=1))))&&((((p130>=1)&&(p131>=1))&&((p1...537
=> equivalent forward existential formula: ([((Init * !(EG(!((!(EG(!(!(E(TRUE U !((((p11>=1)&&(p43>=1))&&((p56>=1)&&(p92>=1))))))))) * EG(E(TRUE U (((p111>...921
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 38/0/2
(forward)formula 0,0,0.389254,23176,1,0,41,99900,36,3,1515,68825,48
FORMULA SupplyChain-PT-00010-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 117/117 places, 83/83 transitions.
Ensure Unique test removed 24 places
Reduce places removed 28 places and 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 89 transition count 68
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
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 1 with 27 rules applied. Total rules applied 38 place count 76 transition count 54
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 41 place count 73 transition count 54
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 41 place count 73 transition count 36
Deduced a syphon composed of 18 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 45 rules applied. Total rules applied 86 place count 46 transition count 36
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 91 place count 41 transition count 31
Applied a total of 91 rules in 13 ms. Remains 41 /117 variables (removed 76) and now considering 31/83 (removed 52) transitions.
Running 13 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-15855488689269934061.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-171742669356372528.kers'
[2026-05-31 18:06:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15855488689269934061.kers, --Pflows, --basisKERS=/tmp/petrispot-output-171742669356372528.kers]
Normalized transition count is 30 out of 31 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 30 rows 41 cols 90 entries
Finished phase 1 with 20 SingleSign rule and 1 generalized
[2026-05-31 18:06:46] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-171742669356372528.kers
Total runtime 0 ms.
[2026-05-31 18:06:46] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 9/41 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 30/71 variables, 41/61 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 1/72 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 0/72 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 62 constraints, problems are : Problem set: 0 solved, 13 unsolved in 253 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 41/41 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 9/41 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 30/71 variables, 41/61 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 13/74 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 1/72 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 0/72 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 75 constraints, problems are : Problem set: 0 solved, 13 unsolved in 252 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 41/41 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 510ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 510ms
[2026-05-31 18:06:46] [INFO ] Invariant cache hit.
[2026-05-31 18:06:46] [INFO ] Implicit Places using invariants in 42 ms returned [0, 1, 3, 13, 34, 35, 36, 37, 38, 39, 40]
[2026-05-31 18:06:46] [INFO ] Actually due to overlaps returned [0, 1, 34, 35, 36, 37, 38, 39, 40, 3]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 43 ms to find 10 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 31/117 places, 31/83 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 31 transition count 23
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 24 place count 23 transition count 15
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 24 place count 23 transition count 7
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 23 rules applied. Total rules applied 47 place count 8 transition count 7
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 48 place count 8 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 48 place count 8 transition count 5
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 50 place count 7 transition count 5
Applied a total of 50 rules in 2 ms. Remains 7 /31 variables (removed 24) and now considering 5/31 (removed 26) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16383739523518707490.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12990408550205583427.kers'
[2026-05-31 18:06:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16383739523518707490.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12990408550205583427.kers]
Normalized transition count is 4 out of 5 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 4 rows 7 cols 11 entries
Finished phase 1 with 4 SingleSign rule and 0 generalized
[2026-05-31 18:06:46] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12990408550205583427.kers
Total runtime 0 ms.
[2026-05-31 18:06:46] [INFO ] Implicit Places using invariants in 19 ms returned [1, 6]
[2026-05-31 18:06:46] [INFO ] Actually due to overlaps returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 20 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 6/117 places, 5/83 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 589 ms. Remains : 6/117 places, 5/83 transitions.
[2026-05-31 18:06:46] [INFO ] Flatten gal took : 0 ms
[2026-05-31 18:06:46] [INFO ] Flatten gal took : 0 ms
[2026-05-31 18:06:46] [INFO ] Input system was already deterministic with 5 transitions.
[2026-05-31 18:06:46] [INFO ] Flatten gal took : 1 ms
[2026-05-31 18:06:46] [INFO ] Flatten gal took : 0 ms
[2026-05-31 18:06:46] [INFO ] Time to serialize gal into /tmp/CTLFireability14411772677106858751.gal : 0 ms
[2026-05-31 18:06:46] [INFO ] Time to serialize properties into /tmp/CTLFireability16405426449778100106.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/CTLFireability14411772677106858751.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16405426449778100106.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5,0.003119,3748,2,12,5,43,6,0,27,24,0


Converting to forward existential form...Done !
original formula: EG(AG(EF((p77>=1))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(E(TRUE U (p77>=1))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.005122,4100,1,0,11,105,20,1,121,82,13
FORMULA SupplyChain-PT-00010-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 83/83 transitions.
Ensure Unique test removed 23 places
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 94 transition count 83
Applied a total of 23 rules in 1 ms. Remains 94 /117 variables (removed 23) and now considering 83/83 (removed 0) transitions.
Running 73 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-11043900582369365051.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7970591192655155681.kers'
[2026-05-31 18:06:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11043900582369365051.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7970591192655155681.kers]
Normalized transition count is 82 out of 83 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 82 rows 93 cols 261 entries
Finished phase 1 with 53 SingleSign rule and 9 generalized
[2026-05-31 18:06:46] [INFO ] Computed 32 invariants in 0 ms
Computed 32 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7970591192655155681.kers
Total runtime 1 ms.
[2026-05-31 18:06:46] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (OVERLAPS) 10/93 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 1/94 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 82/176 variables, 94/127 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/176 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (OVERLAPS) 1/177 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/177 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 12 (OVERLAPS) 0/177 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/177 variables, and 128 constraints, problems are : Problem set: 0 solved, 73 unsolved in 3017 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 94/94 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 10/93 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 1/94 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 82/176 variables, 94/127 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/176 variables, 73/200 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/176 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 11 (OVERLAPS) 1/177 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/177 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 13 (OVERLAPS) 0/177 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/177 variables, and 201 constraints, problems are : Problem set: 0 solved, 73 unsolved in 4411 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 94/94 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7439ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 7439ms
[2026-05-31 18:06:54] [INFO ] Invariant cache hit.
[2026-05-31 18:06:54] [INFO ] Implicit Places using invariants in 77 ms returned [0, 1, 3, 31, 32, 33, 34, 35, 36, 37, 38, 40, 41, 87, 88, 89, 90, 91, 92, 93]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 79 ms to find 20 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 74/117 places, 83/83 transitions.
Applied a total of 0 rules in 1 ms. Remains 74 /74 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7521 ms. Remains : 74/117 places, 83/83 transitions.
[2026-05-31 18:06:54] [INFO ] Flatten gal took : 2 ms
[2026-05-31 18:06:54] [INFO ] Flatten gal took : 2 ms
[2026-05-31 18:06:54] [INFO ] Input system was already deterministic with 83 transitions.
[2026-05-31 18:06:54] [INFO ] Flatten gal took : 3 ms
[2026-05-31 18:06:54] [INFO ] Flatten gal took : 2 ms
[2026-05-31 18:06:54] [INFO ] Time to serialize gal into /tmp/CTLFireability13424555555623637353.gal : 0 ms
[2026-05-31 18:06:54] [INFO ] Time to serialize properties into /tmp/CTLFireability12361366262826707875.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/CTLFireability13424555555623637353.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12361366262826707875.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.61243e+08,1.39438,55156,2,33476,5,254837,6,0,368,266166,0


Converting to forward existential form...Done !
original formula: EX(EG(((p21<1)||(p28<1))))
=> equivalent forward existential formula: [FwdG(EY(Init),((p21<1)||(p28<1)))] != FALSE
Hit Full ! (commute/partial/dont) 82/0/1
(forward)formula 0,1,15.4973,476692,1,0,71,2.43797e+06,19,2,1723,2.39554e+06,71
FORMULA SupplyChain-PT-00010-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 83/83 transitions.
Ensure Unique test removed 24 places
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 93 transition count 83
Applied a total of 24 rules in 1 ms. Remains 93 /117 variables (removed 24) and now considering 83/83 (removed 0) transitions.
Running 73 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-6007969167311583605.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10990462386265296665.kers'
[2026-05-31 18:07:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6007969167311583605.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10990462386265296665.kers]
Normalized transition count is 82 out of 83 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 82 rows 93 cols 261 entries
Finished phase 1 with 53 SingleSign rule and 9 generalized
[2026-05-31 18:07:09] [INFO ] Computed 31 invariants in 4 ms
Computed 31 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-10990462386265296665.kers
Total runtime 6 ms.
[2026-05-31 18:07:09] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (OVERLAPS) 10/93 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 82/175 variables, 93/125 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 1/176 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/176 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (OVERLAPS) 0/176 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 176/176 variables, and 126 constraints, problems are : Problem set: 0 solved, 73 unsolved in 3073 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 93/93 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 10/93 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 82/175 variables, 93/125 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 73/198 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (OVERLAPS) 1/176 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/176 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 11 (OVERLAPS) 0/176 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 176/176 variables, and 199 constraints, problems are : Problem set: 0 solved, 73 unsolved in 4287 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 93/93 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7376ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 7379ms
[2026-05-31 18:07:17] [INFO ] Invariant cache hit.
[2026-05-31 18:07:17] [INFO ] Implicit Places using invariants in 71 ms returned [0, 3, 30, 31, 32, 33, 34, 35, 36, 37, 39, 40, 86, 87, 88, 89, 90, 91, 92]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 83 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 74/117 places, 83/83 transitions.
Applied a total of 0 rules in 1 ms. Remains 74 /74 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7466 ms. Remains : 74/117 places, 83/83 transitions.
[2026-05-31 18:07:17] [INFO ] Flatten gal took : 3 ms
[2026-05-31 18:07:17] [INFO ] Flatten gal took : 2 ms
[2026-05-31 18:07:17] [INFO ] Input system was already deterministic with 83 transitions.
[2026-05-31 18:07:17] [INFO ] Flatten gal took : 2 ms
[2026-05-31 18:07:17] [INFO ] Flatten gal took : 2 ms
[2026-05-31 18:07:17] [INFO ] Time to serialize gal into /tmp/CTLFireability18311616027981220466.gal : 1 ms
[2026-05-31 18:07:17] [INFO ] Time to serialize properties into /tmp/CTLFireability18407876189240090131.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/CTLFireability18311616027981220466.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18407876189240090131.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.61243e+08,1.50344,53200,2,31667,5,244078,6,0,369,258316,0


Converting to forward existential form...Done !
original formula: AF(AX(((p102>=1)&&(p85>=1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(((p102>=1)&&(p85>=1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t81, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
(forward)formula 0,0,23.7607,658216,1,0,245,3.46503e+06,186,153,2054,3.75652e+06,324
FORMULA SupplyChain-PT-00010-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 117/117 places, 83/83 transitions.
Ensure Unique test removed 22 places
Reduce places removed 26 places and 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 91 transition count 78
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 4 place count 90 transition count 76
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 89 transition count 76
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 5 place count 89 transition count 67
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 27 rules applied. Total rules applied 32 place count 71 transition count 67
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 32 place count 71 transition count 66
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 34 place count 70 transition count 66
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 38 place count 66 transition count 62
Applied a total of 38 rules in 16 ms. Remains 66 /117 variables (removed 51) and now considering 62/83 (removed 21) transitions.
Running 43 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-14049648378522509377.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7632206178501857332.kers'
[2026-05-31 18:07:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14049648378522509377.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7632206178501857332.kers]
Normalized transition count is 61 out of 62 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 61 rows 64 cols 175 entries
Finished phase 1 with 41 SingleSign rule and 1 generalized
[2026-05-31 18:07:41] [INFO ] Computed 24 invariants in 0 ms
Computed 24 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7632206178501857332.kers
Total runtime 0 ms.
[2026-05-31 18:07:41] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 10/66 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 61/127 variables, 66/91 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (OVERLAPS) 1/128 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/128 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 11 (OVERLAPS) 0/128 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 92 constraints, problems are : Problem set: 0 solved, 43 unsolved in 1198 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 66/66 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 10/66 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 61/127 variables, 66/91 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 43/134 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 10 (OVERLAPS) 1/128 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/128 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 12 (OVERLAPS) 0/128 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 135 constraints, problems are : Problem set: 0 solved, 43 unsolved in 1867 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 66/66 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3081ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 3081ms
[2026-05-31 18:07:44] [INFO ] Invariant cache hit.
[2026-05-31 18:07:44] [INFO ] Implicit Places using invariants in 56 ms returned [0, 1, 4, 59, 60, 61, 62, 63, 64]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 57 ms to find 9 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 57/117 places, 62/83 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 57 transition count 55
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 21 place count 50 transition count 48
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 21 place count 50 transition count 41
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 35 place count 43 transition count 41
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 36 place count 43 transition count 40
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 36 place count 43 transition count 39
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 38 place count 42 transition count 39
Applied a total of 38 rules in 5 ms. Remains 42 /57 variables (removed 15) and now considering 39/62 (removed 23) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7869432955213139390.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10292494115961321868.kers'
[2026-05-31 18:07:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7869432955213139390.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10292494115961321868.kers]
Normalized transition count is 38 out of 39 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 38 rows 40 cols 111 entries
Finished phase 1 with 27 SingleSign rule and 0 generalized
[2026-05-31 18:07:44] [INFO ] Computed 15 invariants in 1 ms
Computed 15 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10292494115961321868.kers
Total runtime 2 ms.
[2026-05-31 18:07:44] [INFO ] Implicit Places using invariants in 59 ms returned []
[2026-05-31 18:07:44] [INFO ] Invariant cache hit.
[2026-05-31 18:07:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 18:07:44] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 42/117 places, 39/83 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 3270 ms. Remains : 42/117 places, 39/83 transitions.
[2026-05-31 18:07:44] [INFO ] Flatten gal took : 2 ms
[2026-05-31 18:07:44] [INFO ] Flatten gal took : 1 ms
[2026-05-31 18:07:44] [INFO ] Input system was already deterministic with 39 transitions.
[2026-05-31 18:07:44] [INFO ] Flatten gal took : 2 ms
[2026-05-31 18:07:44] [INFO ] Flatten gal took : 2 ms
[2026-05-31 18:07:44] [INFO ] Time to serialize gal into /tmp/CTLFireability6564345918836207776.gal : 0 ms
[2026-05-31 18:07:44] [INFO ] Time to serialize properties into /tmp/CTLFireability5174658317041642332.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/CTLFireability6564345918836207776.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5174658317041642332.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,27906,0.011361,4184,2,199,5,1321,6,0,197,688,0


Converting to forward existential form...Done !
original formula: EF(EG(!(E((((p41>=1)&&(p99>=1)) * AF(((p92>=1)&&(p99>=1)))) U (AG((((p11>=1)&&(p42>=1))&&(p55>=1))) * !((((p111>=1)&&(p116>=1))&&(p70>=1)...162
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(E((((p41>=1)&&(p99>=1)) * !(EG(!(((p92>=1)&&(p99>=1)))))) U (!(E(TRUE U !((((p11>=1)&&(p...230
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.085349,7648,1,0,147,19123,113,61,1278,14382,253
FORMULA SupplyChain-PT-00010-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 83/83 transitions.
Ensure Unique test removed 20 places
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 97 transition count 83
Applied a total of 20 rules in 2 ms. Remains 97 /117 variables (removed 20) and now considering 83/83 (removed 0) transitions.
Running 73 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-190437042154040451.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15317755142499329474.kers'
[2026-05-31 18:07:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-190437042154040451.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15317755142499329474.kers]
Normalized transition count is 82 out of 83 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 82 rows 93 cols 261 entries
Finished phase 1 with 53 SingleSign rule and 9 generalized
[2026-05-31 18:07:44] [INFO ] Computed 35 invariants in 1 ms
Computed 35 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15317755142499329474.kers
Total runtime 2 ms.
[2026-05-31 18:07:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (OVERLAPS) 10/97 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 82/179 variables, 97/133 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 1/180 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (OVERLAPS) 0/180 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 180/180 variables, and 134 constraints, problems are : Problem set: 0 solved, 73 unsolved in 2725 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 97/97 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 10/97 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 82/179 variables, 97/133 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 73/206 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (OVERLAPS) 1/180 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/180 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 11 (OVERLAPS) 0/180 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 180/180 variables, and 207 constraints, problems are : Problem set: 0 solved, 73 unsolved in 4033 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 97/97 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6775ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 6776ms
[2026-05-31 18:07:51] [INFO ] Invariant cache hit.
[2026-05-31 18:07:51] [INFO ] Implicit Places using invariants in 62 ms returned [0, 1, 5, 34, 36, 37, 39, 40, 41, 43, 90, 91, 92, 93, 95, 96]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 63 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 81/117 places, 83/83 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6842 ms. Remains : 81/117 places, 83/83 transitions.
[2026-05-31 18:07:51] [INFO ] Flatten gal took : 7 ms
[2026-05-31 18:07:51] [INFO ] Flatten gal took : 3 ms
[2026-05-31 18:07:51] [INFO ] Input system was already deterministic with 83 transitions.
[2026-05-31 18:07:51] [INFO ] Flatten gal took : 3 ms
[2026-05-31 18:07:51] [INFO ] Flatten gal took : 3 ms
[2026-05-31 18:07:51] [INFO ] Time to serialize gal into /tmp/CTLFireability15720661937855972550.gal : 1 ms
[2026-05-31 18:07:51] [INFO ] Time to serialize properties into /tmp/CTLFireability15623143303102713972.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/CTLFireability15720661937855972550.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15623143303102713972.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.61243e+08,3.03097,87964,2,58162,5,422280,6,0,397,420670,0


Converting to forward existential form...Done !
original formula: (EG(((EG(((((p109<1)||(p124<1))||(p68<1))&&(((p11<1)||(p51<1))||(p54<1)))) * ((((EG((p79<1)) * (p11>=1)) * ((p46>=1)&&(p59>=1))) + (p90<1...306
=> equivalent forward existential formula: ([FwdG(Init,((EG(((((p109<1)||(p124<1))||(p68<1))&&(((p11<1)||(p51<1))||(p54<1)))) * ((((EG((p79<1)) * (p11>=1))...379
Reverse transition relation is NOT exact ! Due to transitions t81, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
Detected timeout of ITS tools.
[2026-05-31 18:08:21] [INFO ] Flatten gal took : 3 ms
[2026-05-31 18:08:21] [INFO ] Applying decomposition
[2026-05-31 18:08:21] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph1647954038561571723.txt' '-o' '/tmp/graph1647954038561571723.bin' '-w' '/tmp/graph1647954038561571723.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1647954038561571723.bin' '-l' '-1' '-v' '-w' '/tmp/graph1647954038561571723.weights' '-q' '0' '-e' '0.001'
[2026-05-31 18:08:21] [INFO ] Decomposing Gal with order
[2026-05-31 18:08:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-31 18:08:21] [INFO ] Removed a total of 25 redundant transitions.
[2026-05-31 18:08:21] [INFO ] Flatten gal took : 6 ms
[2026-05-31 18:08:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 2 ms.
[2026-05-31 18:08:21] [INFO ] Time to serialize gal into /tmp/CTLFireability18174119961214116814.gal : 1 ms
[2026-05-31 18:08:21] [INFO ] Time to serialize properties into /tmp/CTLFireability17531990406007887884.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/CTLFireability18174119961214116814.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17531990406007887884.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.61243e+08,0.028026,5256,181,333,1110,1644,182,2719,104,8244,0


Converting to forward existential form...Done !
original formula: (EG(((EG(((((i11.u14.p109<1)||(i11.u14.p124<1))||(i11.u14.p68<1))&&(((u0.p11<1)||(i7.u15.p51<1))||(i7.u6.p54<1)))) * ((((EG((i9.u17.p79<1...431
=> equivalent forward existential formula: ([FwdG(Init,((EG(((((i11.u14.p109<1)||(i11.u14.p124<1))||(i11.u14.p68<1))&&(((u0.p11<1)||(i7.u15.p51<1))||(i7.u6...504
Reverse transition relation is NOT exact ! Due to transitions t81, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 10
Fast SCC detection found an SCC at level 11
(forward)formula 0,0,0.638658,37404,1,0,81338,4975,1104,61944,565,23471,122694
FORMULA SupplyChain-PT-00010-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 83/83 transitions.
Ensure Unique test removed 22 places
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 95 transition count 83
Applied a total of 22 rules in 2 ms. Remains 95 /117 variables (removed 22) and now considering 83/83 (removed 0) transitions.
Running 73 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-3409105095300844248.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2917572417209050929.kers'
[2026-05-31 18:08:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3409105095300844248.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2917572417209050929.kers]
Normalized transition count is 82 out of 83 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 82 rows 93 cols 261 entries
Finished phase 1 with 53 SingleSign rule and 9 generalized
[2026-05-31 18:08:22] [INFO ] Computed 33 invariants in 1 ms
Computed 33 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2917572417209050929.kers
Total runtime 1 ms.
[2026-05-31 18:08:22] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (OVERLAPS) 10/95 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 82/177 variables, 95/129 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 1/178 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/178 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (OVERLAPS) 0/178 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 130 constraints, problems are : Problem set: 0 solved, 73 unsolved in 2596 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 95/95 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 10/95 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 82/177 variables, 95/129 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 73/202 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (OVERLAPS) 1/178 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/178 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 11 (OVERLAPS) 0/178 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/178 variables, and 203 constraints, problems are : Problem set: 0 solved, 73 unsolved in 4076 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 95/95 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6683ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 6684ms
[2026-05-31 18:08:28] [INFO ] Invariant cache hit.
[2026-05-31 18:08:29] [INFO ] Implicit Places using invariants in 78 ms returned [0, 1, 4, 32, 33, 35, 36, 37, 38, 39, 41, 42, 88, 90, 91, 92, 93, 94]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 79 ms to find 18 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 77/117 places, 83/83 transitions.
Applied a total of 0 rules in 1 ms. Remains 77 /77 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6768 ms. Remains : 77/117 places, 83/83 transitions.
[2026-05-31 18:08:29] [INFO ] Flatten gal took : 2 ms
[2026-05-31 18:08:29] [INFO ] Flatten gal took : 2 ms
[2026-05-31 18:08:29] [INFO ] Input system was already deterministic with 83 transitions.
[2026-05-31 18:08:29] [INFO ] Flatten gal took : 2 ms
[2026-05-31 18:08:29] [INFO ] Flatten gal took : 2 ms
[2026-05-31 18:08:29] [INFO ] Time to serialize gal into /tmp/CTLFireability10140007389222962479.gal : 0 ms
[2026-05-31 18:08:29] [INFO ] Time to serialize properties into /tmp/CTLFireability16287602402370804281.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/CTLFireability10140007389222962479.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16287602402370804281.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.61243e+08,2.16489,70540,2,44770,5,338155,6,0,381,345661,0


Converting to forward existential form...Done !
original formula: (!(A(EX(EX(EG((p77>=1)))) U ((((p11>=1)&&(p44>=1))&&(p57>=1))||(p84>=1)))) * !(E(AF((!(EF((((p111>=1)&&(p116>=1))&&(p70>=1)))) * !(((p87>...220
=> equivalent forward existential formula: ([((Init * !(EG(!(((((p11>=1)&&(p44>=1))&&(p57>=1))||(p84>=1)))))) * !(E(!(((((p11>=1)&&(p44>=1))&&(p57>=1))||(p...410
Reverse transition relation is NOT exact ! Due to transitions t81, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
Using saturation style SCC detection
Detected timeout of ITS tools.
[2026-05-31 18:08:59] [INFO ] Flatten gal took : 5 ms
[2026-05-31 18:08:59] [INFO ] Applying decomposition
[2026-05-31 18:08:59] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph14220354500514927747.txt' '-o' '/tmp/graph14220354500514927747.bin' '-w' '/tmp/graph14220354500514927747.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14220354500514927747.bin' '-l' '-1' '-v' '-w' '/tmp/graph14220354500514927747.weights' '-q' '0' '-e' '0.001'
[2026-05-31 18:08:59] [INFO ] Decomposing Gal with order
[2026-05-31 18:08:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-31 18:08:59] [INFO ] Removed a total of 12 redundant transitions.
[2026-05-31 18:08:59] [INFO ] Flatten gal took : 4 ms
[2026-05-31 18:08:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 1 ms.
[2026-05-31 18:08:59] [INFO ] Time to serialize gal into /tmp/CTLFireability15408199689995606728.gal : 0 ms
[2026-05-31 18:08:59] [INFO ] Time to serialize properties into /tmp/CTLFireability15755919198551438103.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/CTLFireability15408199689995606728.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15755919198551438103.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.61243e+08,1.88858,73832,3375,10110,50101,89477,164,252511,152,609802,0


Converting to forward existential form...Done !
original formula: (!(A(EX(EX(EG((i8.u11.p77>=1)))) U ((((i5.u0.p11>=1)&&(i10.u14.p44>=1))&&(i10.u12.p57>=1))||(u10.p84>=1)))) * !(E(AF((!(EF((((i5.u0.p111>...300
=> equivalent forward existential formula: ([((Init * !(EG(!(((((i5.u0.p11>=1)&&(i10.u14.p44>=1))&&(i10.u12.p57>=1))||(u10.p84>=1)))))) * !(E(!(((((i5.u0.p...542
Reverse transition relation is NOT exact ! Due to transitions t81, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,5.27948,161460,1,0,162160,183353,1162,449599,784,964595,413923
FORMULA SupplyChain-PT-00010-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 83/83 transitions.
Ensure Unique test removed 24 places
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 93 transition count 83
Applied a total of 24 rules in 3 ms. Remains 93 /117 variables (removed 24) and now considering 83/83 (removed 0) transitions.
Running 73 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-11879436689465935449.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18253112351072344145.kers'
[2026-05-31 18:09:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11879436689465935449.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18253112351072344145.kers]
Normalized transition count is 82 out of 83 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 82 rows 93 cols 261 entries
Finished phase 1 with 53 SingleSign rule and 9 generalized
[2026-05-31 18:09:04] [INFO ] Computed 31 invariants in 1 ms
Computed 31 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18253112351072344145.kers
Total runtime 1 ms.
[2026-05-31 18:09:04] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (OVERLAPS) 10/93 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 82/175 variables, 93/125 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 1/176 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/176 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (OVERLAPS) 0/176 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 176/176 variables, and 126 constraints, problems are : Problem set: 0 solved, 73 unsolved in 2717 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 93/93 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 10/93 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 82/175 variables, 93/125 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 73/198 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (OVERLAPS) 1/176 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/176 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 11 (OVERLAPS) 0/176 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 176/176 variables, and 199 constraints, problems are : Problem set: 0 solved, 73 unsolved in 4342 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 93/93 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7073ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 7073ms
[2026-05-31 18:09:11] [INFO ] Invariant cache hit.
[2026-05-31 18:09:11] [INFO ] Implicit Places using invariants in 66 ms returned [0, 1, 3, 30, 32, 33, 34, 37, 39, 40, 86, 89, 90, 91, 92]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 66 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 78/117 places, 83/83 transitions.
Applied a total of 0 rules in 1 ms. Remains 78 /78 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7144 ms. Remains : 78/117 places, 83/83 transitions.
[2026-05-31 18:09:11] [INFO ] Flatten gal took : 6 ms
[2026-05-31 18:09:11] [INFO ] Flatten gal took : 2 ms
[2026-05-31 18:09:11] [INFO ] Input system was already deterministic with 83 transitions.
[2026-05-31 18:09:11] [INFO ] Flatten gal took : 1 ms
[2026-05-31 18:09:11] [INFO ] Flatten gal took : 2 ms
[2026-05-31 18:09:11] [INFO ] Time to serialize gal into /tmp/CTLFireability11894018600687747565.gal : 1 ms
[2026-05-31 18:09:11] [INFO ] Time to serialize properties into /tmp/CTLFireability303850861386172080.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/CTLFireability11894018600687747565.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability303850861386172080.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.61243e+08,2.99298,94092,2,59930,5,497537,6,0,385,471556,0


Converting to forward existential form...Done !
original formula: EG(AX(((EX((((p11<1)||(p47<1))||(p60<1))) * (!(A(((p36>=1)&&(p94>=1)) U ((p37>=1)&&(p95>=1)))) + ((p88>=1)&&(p95>=1)))) + (((((p11<1)||(p...227
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(((EX((((p11<1)||(p47<1))||(p60<1))) * (!(!((E(!(((p37>=1)&&(p95>=1))) U (!(((p36>=1)&&(p94>=1)...345
Reverse transition relation is NOT exact ! Due to transitions t81, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
Detected timeout of ITS tools.
[2026-05-31 18:09:41] [INFO ] Flatten gal took : 4 ms
[2026-05-31 18:09:41] [INFO ] Applying decomposition
[2026-05-31 18:09:41] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph12029471506217566229.txt' '-o' '/tmp/graph12029471506217566229.bin' '-w' '/tmp/graph12029471506217566229.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12029471506217566229.bin' '-l' '-1' '-v' '-w' '/tmp/graph12029471506217566229.weights' '-q' '0' '-e' '0.001'
[2026-05-31 18:09:41] [INFO ] Decomposing Gal with order
[2026-05-31 18:09:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-31 18:09:41] [INFO ] Removed a total of 28 redundant transitions.
[2026-05-31 18:09:41] [INFO ] Flatten gal took : 5 ms
[2026-05-31 18:09:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 1 ms.
[2026-05-31 18:09:41] [INFO ] Time to serialize gal into /tmp/CTLFireability1733218115625644503.gal : 1 ms
[2026-05-31 18:09:41] [INFO ] Time to serialize properties into /tmp/CTLFireability782383433674223875.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/CTLFireability1733218115625644503.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability782383433674223875.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.61243e+08,0.02688,5228,189,308,1162,1594,175,2558,96,8571,0


Converting to forward existential form...Done !
original formula: EG(AX(((EX((((u0.p11<1)||(i5.u20.p47<1))||(i5.u8.p60<1))) * (!(A(((i11.u17.p36>=1)&&(i11.u1.p94>=1)) U ((i10.u18.p37>=1)&&(i10.u16.p95>=1...340
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(((EX((((u0.p11<1)||(i5.u20.p47<1))||(i5.u8.p60<1))) * (!(!((E(!(((i10.u18.p37>=1)&&(i10.u16.p9...490
Reverse transition relation is NOT exact ! Due to transitions t81, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 10
Fast SCC detection found an SCC at level 11
(forward)formula 0,1,0.631673,33112,1,0,62948,5144,1013,61354,470,21425,102942
FORMULA SupplyChain-PT-00010-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 117/117 places, 83/83 transitions.
Ensure Unique test removed 24 places
Reduce places removed 26 places and 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 91 transition count 80
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 4 place count 90 transition count 78
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 89 transition count 78
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 5 place count 89 transition count 70
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 29 place count 73 transition count 70
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 29 place count 73 transition count 69
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 31 place count 72 transition count 69
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 35 place count 68 transition count 65
Applied a total of 35 rules in 15 ms. Remains 68 /117 variables (removed 49) and now considering 65/83 (removed 18) transitions.
Running 48 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-5727246134638390706.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17277319091708925234.kers'
[2026-05-31 18:09:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5727246134638390706.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17277319091708925234.kers]
Normalized transition count is 64 out of 65 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 64 rows 68 cols 187 entries
Finished phase 1 with 43 SingleSign rule and 2 generalized
[2026-05-31 18:09:42] [INFO ] Computed 23 invariants in 0 ms
Computed 23 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17277319091708925234.kers
Total runtime 1 ms.
[2026-05-31 18:09:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 9/67 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 1/68 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 64/132 variables, 68/92 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (OVERLAPS) 1/133 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/133 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 12 (OVERLAPS) 0/133 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 93 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1596 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 68/68 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 9/67 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 1/68 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 64/132 variables, 68/92 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 48/140 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/132 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 11 (OVERLAPS) 1/133 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/133 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 13 (OVERLAPS) 0/133 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/133 variables, and 141 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1938 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 68/68 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3546ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 3546ms
[2026-05-31 18:09:45] [INFO ] Invariant cache hit.
[2026-05-31 18:09:46] [INFO ] Implicit Places using invariants in 48 ms returned [0, 1, 3, 23, 63, 64, 65, 66, 67]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 49 ms to find 9 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 59/117 places, 65/83 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 59 transition count 60
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 54 transition count 55
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 54 transition count 50
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 25 place count 49 transition count 50
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 26 place count 49 transition count 49
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 26 place count 49 transition count 48
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 28 place count 48 transition count 48
Applied a total of 28 rules in 4 ms. Remains 48 /59 variables (removed 11) and now considering 48/65 (removed 17) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14418269129199008366.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14083124078645862162.kers'
[2026-05-31 18:09:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14418269129199008366.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14083124078645862162.kers]
Normalized transition count is 47 out of 48 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 47 rows 48 cols 132 entries
Finished phase 1 with 34 SingleSign rule and 0 generalized
[2026-05-31 18:09:46] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14083124078645862162.kers
Total runtime 1 ms.
[2026-05-31 18:09:46] [INFO ] Implicit Places using invariants in 34 ms returned []
[2026-05-31 18:09:46] [INFO ] Invariant cache hit.
[2026-05-31 18:09:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 18:09:46] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 48/117 places, 48/83 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 3694 ms. Remains : 48/117 places, 48/83 transitions.
[2026-05-31 18:09:46] [INFO ] Flatten gal took : 1 ms
[2026-05-31 18:09:46] [INFO ] Flatten gal took : 1 ms
[2026-05-31 18:09:46] [INFO ] Input system was already deterministic with 48 transitions.
[2026-05-31 18:09:46] [INFO ] Flatten gal took : 1 ms
[2026-05-31 18:09:46] [INFO ] Flatten gal took : 1 ms
[2026-05-31 18:09:46] [INFO ] Time to serialize gal into /tmp/CTLFireability880301863595406069.gal : 0 ms
[2026-05-31 18:09:46] [INFO ] Time to serialize properties into /tmp/CTLFireability7057312495006657092.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/CTLFireability880301863595406069.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7057312495006657092.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,184962,0.0204,4484,2,660,5,3030,6,0,230,2138,0


Converting to forward existential form...Done !
original formula: AF(E(A(AF(((((p36>=1)&&(p94>=1))&&((p11>=1)&&(p51>=1)))&&(p54>=1))) U A(AG((p91>=1)) U ((p87>=1)||(p81>=1)))) U ((p86>=1)&&(p93>=1))))
=> equivalent forward existential formula: [FwdG(Init,!(E(!((E(!(!((E(!(((p87>=1)||(p81>=1))) U (!(!(E(TRUE U !((p91>=1))))) * !(((p87>=1)||(p81>=1))))) + ...551
Reverse transition relation is NOT exact ! Due to transitions t29, 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
(forward)formula 0,1,0.317461,19248,1,0,237,83448,143,151,1486,73627,393
FORMULA SupplyChain-PT-00010-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 83/83 transitions.
Ensure Unique test removed 22 places
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 95 transition count 83
Applied a total of 22 rules in 2 ms. Remains 95 /117 variables (removed 22) and now considering 83/83 (removed 0) transitions.
Running 73 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-16640558979800386687.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8216914970495248279.kers'
[2026-05-31 18:09:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16640558979800386687.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8216914970495248279.kers]
Normalized transition count is 82 out of 83 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 82 rows 93 cols 261 entries
Finished phase 1 with 53 SingleSign rule and 9 generalized
[2026-05-31 18:09:46] [INFO ] Computed 33 invariants in 0 ms
Computed 33 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8216914970495248279.kers
Total runtime 1 ms.
[2026-05-31 18:09:46] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (OVERLAPS) 10/93 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 2/95 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 82/177 variables, 95/129 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (OVERLAPS) 1/178 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/178 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 12 (OVERLAPS) 0/178 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 130 constraints, problems are : Problem set: 0 solved, 73 unsolved in 3123 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 95/95 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 10/93 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 2/95 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 82/177 variables, 95/129 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 73/202 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/177 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 11 (OVERLAPS) 1/178 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/178 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 13 (OVERLAPS) 0/178 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/178 variables, and 203 constraints, problems are : Problem set: 0 solved, 73 unsolved in 4520 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 95/95 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7666ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 7667ms
[2026-05-31 18:09:54] [INFO ] Invariant cache hit.
[2026-05-31 18:09:54] [INFO ] Implicit Places using invariants in 73 ms returned [0, 1, 3, 32, 34, 35, 36, 37, 38, 39, 41, 42, 88, 89, 90, 91, 92, 93, 94]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 83 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 76/117 places, 83/83 transitions.
Applied a total of 0 rules in 1 ms. Remains 76 /76 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7755 ms. Remains : 76/117 places, 83/83 transitions.
[2026-05-31 18:09:54] [INFO ] Flatten gal took : 3 ms
[2026-05-31 18:09:54] [INFO ] Flatten gal took : 2 ms
[2026-05-31 18:09:54] [INFO ] Input system was already deterministic with 83 transitions.
[2026-05-31 18:09:54] [INFO ] Flatten gal took : 2 ms
[2026-05-31 18:09:54] [INFO ] Flatten gal took : 1 ms
[2026-05-31 18:09:54] [INFO ] Time to serialize gal into /tmp/CTLFireability15063590174595258885.gal : 0 ms
[2026-05-31 18:09:54] [INFO ] Time to serialize properties into /tmp/CTLFireability16081928109344168606.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/CTLFireability15063590174595258885.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16081928109344168606.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.61243e+08,1.82275,68432,2,37932,5,304871,6,0,375,330317,0


Converting to forward existential form...Done !
original formula: A(!(E((((p11>=1)&&(p43>=1))&&(p56>=1)) U (p77>=1))) U EG((AX(((p12>=1)&&(p29>=1))) + EF(((p16>=1)&&(p23>=1))))))
=> equivalent forward existential formula: [((Init * !(EG(!(EG((!(EX(!(((p12>=1)&&(p29>=1))))) + E(TRUE U ((p16>=1)&&(p23>=1))))))))) * !(E(!(EG((!(EX(!(((...357
Reverse transition relation is NOT exact ! Due to transitions t81, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
Using saturation style SCC detection
Detected timeout of ITS tools.
[2026-05-31 18:10:24] [INFO ] Flatten gal took : 4 ms
[2026-05-31 18:10:24] [INFO ] Applying decomposition
[2026-05-31 18:10:24] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph11178364899518402571.txt' '-o' '/tmp/graph11178364899518402571.bin' '-w' '/tmp/graph11178364899518402571.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11178364899518402571.bin' '-l' '-1' '-v' '-w' '/tmp/graph11178364899518402571.weights' '-q' '0' '-e' '0.001'
[2026-05-31 18:10:24] [INFO ] Decomposing Gal with order
[2026-05-31 18:10:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-31 18:10:24] [INFO ] Removed a total of 16 redundant transitions.
[2026-05-31 18:10:24] [INFO ] Flatten gal took : 4 ms
[2026-05-31 18:10:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 1 ms.
[2026-05-31 18:10:24] [INFO ] Time to serialize gal into /tmp/CTLFireability10402455032104418765.gal : 1 ms
[2026-05-31 18:10:24] [INFO ] Time to serialize properties into /tmp/CTLFireability12639261489116290099.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/CTLFireability10402455032104418765.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12639261489116290099.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.61243e+08,0.217199,13828,437,1650,5708,13000,149,25498,125,104164,0


Converting to forward existential form...Done !
original formula: A(!(E((((u0.p11>=1)&&(i10.u5.p43>=1))&&(i10.u14.p56>=1)) U (i10.u14.p77>=1))) U EG((AX(((u12.p12>=1)&&(u12.p29>=1))) + EF(((i10.u5.p16>=1...178
=> equivalent forward existential formula: [((Init * !(EG(!(EG((!(EX(!(((u12.p12>=1)&&(u12.p29>=1))))) + E(TRUE U ((i10.u5.p16>=1)&&(i10.u5.p23>=1)))))))))...449
Reverse transition relation is NOT exact ! Due to transitions t81, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,1.02035,37636,1,0,54547,33393,963,55322,679,166669,94890
FORMULA SupplyChain-PT-00010-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

[2026-05-31 18:10:25] [INFO ] Flatten gal took : 4 ms
[2026-05-31 18:10:25] [INFO ] Flatten gal took : 2 ms
Total runtime 428396 ms.

BK_STOP 1780251025397

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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