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.r194-tall-177969914200585.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 PermAdmissibility-COL-20, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-tall-177969914200585
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.4K Mar 8 07:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Mar 8 07:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Mar 8 07:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 8 07:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Mar 16 08:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 16 08:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 16 08:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 16 08:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 8 07:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Mar 8 07:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 8 07:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Mar 8 07:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 16 08:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 16 08:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 54K Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME PermAdmissibility-COL-20-CTLCardinality-2024-00
FORMULA_NAME PermAdmissibility-COL-20-CTLCardinality-2024-01
FORMULA_NAME PermAdmissibility-COL-20-CTLCardinality-2024-02
FORMULA_NAME PermAdmissibility-COL-20-CTLCardinality-2024-03
FORMULA_NAME PermAdmissibility-COL-20-CTLCardinality-2024-04
FORMULA_NAME PermAdmissibility-COL-20-CTLCardinality-2024-05
FORMULA_NAME PermAdmissibility-COL-20-CTLCardinality-2024-06
FORMULA_NAME PermAdmissibility-COL-20-CTLCardinality-2024-07
FORMULA_NAME PermAdmissibility-COL-20-CTLCardinality-2024-08
FORMULA_NAME PermAdmissibility-COL-20-CTLCardinality-2024-09
FORMULA_NAME PermAdmissibility-COL-20-CTLCardinality-2024-10
FORMULA_NAME PermAdmissibility-COL-20-CTLCardinality-2024-11
FORMULA_NAME PermAdmissibility-COL-20-CTLCardinality-2024-12
FORMULA_NAME PermAdmissibility-COL-20-CTLCardinality-2024-13
FORMULA_NAME PermAdmissibility-COL-20-CTLCardinality-2024-14
FORMULA_NAME PermAdmissibility-COL-20-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779789672304

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PermAdmissibility-COL-20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
CTLCardinality COL
Running Version 202604301425
[2026-05-26 10:01:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-26 10:01:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 10:01:13] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2026-05-26 10:01:13] [WARNING] Using fallBack plugin, rng conformance not checked
[2026-05-26 10:01:14] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 584 ms
[2026-05-26 10:01:14] [INFO ] Imported 40 HL places and 16 HL transitions for a total of 208 PT places and 1024.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
FORMULA PermAdmissibility-COL-20-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-26 10:01:14] [INFO ] Built PT skeleton of HLPN with 40 places and 16 transitions 83 arcs in 4 ms.
[2026-05-26 10:01:14] [INFO ] Skeletonized 15 HLPN properties in 3 ms.
Computed a total of 40 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 2 formulas.
FORMULA PermAdmissibility-COL-20-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-20-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 40 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
RANDOM walk for 40016 steps (116 resets) in 519 ms. (76 steps per ms) remains 39/71 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 38/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (8 resets) in 38 ms. (102 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 38/38 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4776025120090951396.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16250752081842754342.kers'
[2026-05-26 10:01:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4776025120090951396.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16250752081842754342.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 3 ms.
// Phase 1: matrix 16 rows 34 cols 75 entries
Finished phase 1 with 1 SingleSign rule and 15 generalized
[2026-05-26 10:01:15] [INFO ] Computed 24 invariants in 3 ms
Computed 24 P flows in 19 ms.
Exported basis to /tmp/petrispot-output-16250752081842754342.kers
Total runtime 19 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 38 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp70 is UNSAT
After SMT solving in domain Real declared 40/56 variables, and 24 constraints, problems are : Problem set: 38 solved, 0 unsolved in 448 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/40 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 606ms problems are : Problem set: 38 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 38 atomic propositions for a total of 13 simplifications.
FORMULA PermAdmissibility-COL-20-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-20-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-20-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-26 10:01:15] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2026-05-26 10:01:15] [INFO ] Flatten gal took : 18 ms
[2026-05-26 10:01:15] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA PermAdmissibility-COL-20-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-26 10:01:15] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PermAdmissibility-COL-20-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-20-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-20-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-20-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-26 10:01:15] [INFO ] Flatten gal took : 5 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :input
Symmetric sort wr.t. initial detected :input
Symmetric sort wr.t. initial and guards detected :input
Applying symmetric unfolding of full symmetric sort :input domain size was 8
[2026-05-26 10:01:15] [INFO ] Unfolded HLPN to a Petri net with 40 places and 16 transitions 83 arcs in 9 ms.
[2026-05-26 10:01:15] [INFO ] Unfolded 5 HLPN properties in 0 ms.
Support contains 29 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 16/16 transitions.
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 37 transition count 16
Applied a total of 3 rules in 12 ms. Remains 37 /40 variables (removed 3) and now considering 16/16 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8148273355255067367.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15452785646129262609.kers'
[2026-05-26 10:01:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8148273355255067367.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15452785646129262609.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 16 rows 34 cols 75 entries
Finished phase 1 with 1 SingleSign rule and 15 generalized
[2026-05-26 10:01:15] [INFO ] Computed 21 invariants in 0 ms
Computed 21 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15452785646129262609.kers
Total runtime 0 ms.
[2026-05-26 10:01:15] [INFO ] Implicit Places using invariants in 53 ms returned [4, 7, 19, 26]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 64 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 33/40 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 83 ms. Remains : 33/40 places, 16/16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 33 /33 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4569304213759811089.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5134521794716966144.kers'
[2026-05-26 10:01:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4569304213759811089.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5134521794716966144.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 16 rows 30 cols 63 entries
Finished phase 1 with 5 SingleSign rule and 11 generalized
[2026-05-26 10:01:15] [INFO ] Computed 17 invariants in 0 ms
Computed 17 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5134521794716966144.kers
Total runtime 0 ms.
[2026-05-26 10:01:15] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-26 10:01:15] [INFO ] Invariant cache hit.
[2026-05-26 10:01:15] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Running 15 sub problems to find dead transitions.
[2026-05-26 10:01:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 2/28 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 3/31 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 2/33 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/33 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 16/49 variables, 33/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/49 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 0/49 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 49/49 variables, and 50 constraints, problems are : Problem set: 0 solved, 15 unsolved in 370 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 2/28 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 3/31 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 2/33 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/33 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 16/49 variables, 33/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/49 variables, 15/65 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/49 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 0/49 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 49/49 variables, and 65 constraints, problems are : Problem set: 0 solved, 15 unsolved in 458 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 834ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 835ms
Finished structural reductions in LTL mode , in 1 iterations and 927 ms. Remains : 33/33 places, 16/16 transitions.
Support contains 29 out of 33 places after structural reductions.
[2026-05-26 10:01:16] [INFO ] Flatten gal took : 5 ms
[2026-05-26 10:01:16] [INFO ] Flatten gal took : 11 ms
[2026-05-26 10:01:16] [INFO ] Input system was already deterministic with 16 transitions.
RANDOM walk for 40017 steps (116 resets) in 50 ms. (784 steps per ms) remains 10/30 properties
BEST_FIRST walk for 40002 steps (18 resets) in 82 ms. (481 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (19 resets) in 159 ms. (250 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (16 resets) in 92 ms. (430 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (16 resets) in 131 ms. (303 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (16 resets) in 84 ms. (470 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (36 resets) in 141 ms. (281 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (16 resets) in 112 ms. (353 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (40 resets) in 109 ms. (363 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (20 resets) in 117 ms. (339 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (32 resets) in 89 ms. (444 steps per ms) remains 10/10 properties
[2026-05-26 10:01:17] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp27 is UNSAT
At refinement iteration 1 (OVERLAPS) 13/23 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 8 unsolved
Problem AtomicPropp16 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 3/6 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 7 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp26 is UNSAT
After SMT solving in domain Real declared 32/49 variables, and 16 constraints, problems are : Problem set: 10 solved, 0 unsolved in 56 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 13/14 constraints, State Equation: 0/33 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63ms problems are : Problem set: 10 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 10 atomic propositions for a total of 5 simplifications.
[2026-05-26 10:01:17] [INFO ] Flatten gal took : 4 ms
[2026-05-26 10:01:17] [INFO ] Flatten gal took : 2 ms
[2026-05-26 10:01:17] [INFO ] Input system was already deterministic with 16 transitions.
Support contains 16 out of 33 places (down from 25) after GAL structural reductions.
Computed a total of 33 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 33 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Starting structural reductions in SI_CTL mode, iteration 0 : 33/33 places, 16/16 transitions.
Graph (complete) has 69 edges and 33 vertex of which 28 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Applied a total of 1 rules in 6 ms. Remains 27 /33 variables (removed 6) and now considering 16/16 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2211986535224003685.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16461968771520216122.kers'
[2026-05-26 10:01:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2211986535224003685.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16461968771520216122.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 16 rows 27 cols 60 entries
Finished phase 1 with 8 SingleSign rule and 8 generalized
[2026-05-26 10:01:17] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16461968771520216122.kers
Total runtime 0 ms.
[2026-05-26 10:01:17] [INFO ] Implicit Places using invariants in 36 ms returned [4, 10, 12, 13, 19, 20, 22]
[2026-05-26 10:01:17] [INFO ] Actually due to overlaps returned [4, 10, 12, 19, 20]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 38 ms to find 5 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 22/33 places, 16/16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 20 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 20 transition count 13
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 6 place count 19 transition count 13
Applied a total of 6 rules in 9 ms. Remains 19 /22 variables (removed 3) and now considering 13/16 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12682282564818509746.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8130239465531554380.kers'
[2026-05-26 10:01:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12682282564818509746.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8130239465531554380.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 13 rows 19 cols 40 entries
Finished phase 1 with 10 SingleSign rule and 3 generalized
[2026-05-26 10:01:17] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8130239465531554380.kers
Total runtime 0 ms.
[2026-05-26 10:01:17] [INFO ] Implicit Places using invariants in 24 ms returned [9, 15]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 27 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 17/33 places, 13/16 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 17 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 16 transition count 12
Applied a total of 2 rules in 1 ms. Remains 16 /17 variables (removed 1) and now considering 12/13 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7773504426136436927.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16661466348303418962.kers'
[2026-05-26 10:01:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7773504426136436927.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16661466348303418962.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 12 rows 16 cols 32 entries
Finished phase 1 with 10 SingleSign rule and 2 generalized
[2026-05-26 10:01:17] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16661466348303418962.kers
Total runtime 0 ms.
[2026-05-26 10:01:17] [INFO ] Implicit Places using invariants in 21 ms returned []
[2026-05-26 10:01:17] [INFO ] Invariant cache hit.
[2026-05-26 10:01:17] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 16/33 places, 12/16 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 133 ms. Remains : 16/33 places, 12/16 transitions.
[2026-05-26 10:01:17] [INFO ] Flatten gal took : 1 ms
[2026-05-26 10:01:17] [INFO ] Flatten gal took : 1 ms
[2026-05-26 10:01:17] [INFO ] Input system was already deterministic with 12 transitions.
[2026-05-26 10:01:17] [INFO ] Flatten gal took : 1 ms
[2026-05-26 10:01:17] [INFO ] Flatten gal took : 1 ms
[2026-05-26 10:01:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality1044502706936121003.gal : 1 ms
[2026-05-26 10:01:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality14956967561219177518.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/CTLCardinality1044502706936121003.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14956967561219177518.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,2.25793e+08,0.070255,6264,2,1577,5,18384,6,0,74,17113,0


Converting to forward existential form...Done !
original formula: EG((AF(E((c19<5) U (c9>c8))) + EF(((aux11>=17) + E(AF((out8<=c6)) U ((aux7<=33)&&(in4<=92)))))))
=> equivalent forward existential formula: [FwdG(Init,(!(EG(!(E((c19<5) U (c9>c8))))) + E(TRUE U ((aux11>=17) + E(!(EG(!((out8<=c6)))) U ((aux7<=33)&&(in4<...175
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 10/0/2
Hit Full ! (commute/partial/dont) 9/0/3
(forward)formula 0,1,3.74693,103932,1,0,695,578271,40,316,867,650704,566
FORMULA PermAdmissibility-COL-20-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 16/16 transitions.
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 26 transition count 16
Applied a total of 7 rules in 1 ms. Remains 26 /33 variables (removed 7) and now considering 16/16 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7500718164231353224.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8679859527704002198.kers'
[2026-05-26 10:01:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7500718164231353224.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8679859527704002198.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 16 rows 26 cols 59 entries
Finished phase 1 with 7 SingleSign rule and 9 generalized
[2026-05-26 10:01:21] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8679859527704002198.kers
Total runtime 0 ms.
[2026-05-26 10:01:21] [INFO ] Implicit Places using invariants in 39 ms returned [5, 10, 11, 14, 19, 20]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 41 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/33 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42 ms. Remains : 20/33 places, 16/16 transitions.
[2026-05-26 10:01:21] [INFO ] Flatten gal took : 3 ms
[2026-05-26 10:01:21] [INFO ] Flatten gal took : 1 ms
[2026-05-26 10:01:21] [INFO ] Input system was already deterministic with 16 transitions.
[2026-05-26 10:01:21] [INFO ] Flatten gal took : 2 ms
[2026-05-26 10:01:21] [INFO ] Flatten gal took : 1 ms
[2026-05-26 10:01:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality7215839547188832527.gal : 1 ms
[2026-05-26 10:01:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality5563438799581989410.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/CTLCardinality7215839547188832527.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5563438799581989410.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.30787e+09,4.39403,108276,2,13421,5,600191,6,0,98,737303,0


Converting to forward existential form...Done !
original formula: EF((EF((((aux6<96)||(aux10<32))&&(c14>aux8))) * EF(EX((c9>aux14)))))
=> equivalent forward existential formula: [(EY(FwdU((FwdU(Init,TRUE) * E(TRUE U (((aux6<96)||(aux10<32))&&(c14>aux8)))),TRUE)) * (c9>aux14))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
(forward)formula 0,1,7.06281,108280,1,0,33,600191,53,21,1179,737303,46
FORMULA PermAdmissibility-COL-20-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 33/33 places, 16/16 transitions.
Graph (complete) has 69 edges and 33 vertex of which 17 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Ensure Unique test removed 1 places
Applied a total of 1 rules in 4 ms. Remains 16 /33 variables (removed 17) and now considering 10/16 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10199450429734015456.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2850272428930239786.kers'
[2026-05-26 10:01:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10199450429734015456.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2850272428930239786.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 10 rows 16 cols 35 entries
Finished phase 1 with 5 SingleSign rule and 5 generalized
[2026-05-26 10:01:28] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2850272428930239786.kers
Total runtime 1 ms.
[2026-05-26 10:01:28] [INFO ] Implicit Places using invariants in 40 ms returned [8, 9, 10, 11]
[2026-05-26 10:01:28] [INFO ] Actually due to overlaps returned [8, 9, 11]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 41 ms to find 3 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 13/33 places, 10/16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 13 transition count 7
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 10 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 10 transition count 6
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 8 place count 9 transition count 6
Applied a total of 8 rules in 2 ms. Remains 9 /13 variables (removed 4) and now considering 6/10 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15033496366765851625.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11378998054072630419.kers'
[2026-05-26 10:01:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15033496366765851625.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11378998054072630419.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 6 rows 9 cols 19 entries
Finished phase 1 with 3 SingleSign rule and 3 generalized
[2026-05-26 10:01:28] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11378998054072630419.kers
Total runtime 0 ms.
[2026-05-26 10:01:28] [INFO ] Implicit Places using invariants in 22 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 8/33 places, 6/16 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 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 0 with 2 rules applied. Total rules applied 2 place count 7 transition count 5
Applied a total of 2 rules in 2 ms. Remains 7 /8 variables (removed 1) and now considering 5/6 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13987341178241699821.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16575160170227437857.kers'
[2026-05-26 10:01:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13987341178241699821.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16575160170227437857.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 5 rows 7 cols 14 entries
Finished phase 1 with 3 SingleSign rule and 2 generalized
[2026-05-26 10:01:28] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16575160170227437857.kers
Total runtime 0 ms.
[2026-05-26 10:01:28] [INFO ] Implicit Places using invariants in 21 ms returned []
[2026-05-26 10:01:28] [INFO ] Invariant cache hit.
[2026-05-26 10:01:28] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 7/33 places, 5/16 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 117 ms. Remains : 7/33 places, 5/16 transitions.
[2026-05-26 10:01:28] [INFO ] Flatten gal took : 0 ms
[2026-05-26 10:01:28] [INFO ] Flatten gal took : 0 ms
[2026-05-26 10:01:28] [INFO ] Input system was already deterministic with 5 transitions.
[2026-05-26 10:01:28] [INFO ] Flatten gal took : 1 ms
[2026-05-26 10:01:28] [INFO ] Flatten gal took : 1 ms
[2026-05-26 10:01:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality2288928617393617372.gal : 1 ms
[2026-05-26 10:01:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality7089043161637594310.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/CTLCardinality2288928617393617372.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7089043161637594310.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,53130,0.094964,7180,2,548,5,15427,6,0,34,22060,0


Converting to forward existential form...Done !
original formula: A((in3<=c6) U EG(EF((aux11<=8))))
=> equivalent forward existential formula: [((Init * !(EG(!(EG(E(TRUE U (aux11<=8))))))) * !(E(!(EG(E(TRUE U (aux11<=8)))) U (!((in3<=c6)) * !(EG(E(TRUE U ...182
Reverse transition relation is NOT exact ! Due to transitions t0, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0...161
(forward)formula 0,1,0.299767,11928,1,0,218,40986,36,75,362,52966,279
FORMULA PermAdmissibility-COL-20-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 16/16 transitions.
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 26 transition count 16
Applied a total of 7 rules in 3 ms. Remains 26 /33 variables (removed 7) and now considering 16/16 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15075412054970934974.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2179254351905132929.kers'
[2026-05-26 10:01:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15075412054970934974.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2179254351905132929.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 16 rows 26 cols 59 entries
Finished phase 1 with 7 SingleSign rule and 9 generalized
[2026-05-26 10:01:28] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2179254351905132929.kers
Total runtime 1 ms.
[2026-05-26 10:01:28] [INFO ] Implicit Places using invariants in 40 ms returned [5, 10, 11, 12, 19, 20]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 42 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/33 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 45 ms. Remains : 20/33 places, 16/16 transitions.
[2026-05-26 10:01:28] [INFO ] Flatten gal took : 1 ms
[2026-05-26 10:01:28] [INFO ] Flatten gal took : 2 ms
[2026-05-26 10:01:28] [INFO ] Input system was already deterministic with 16 transitions.
[2026-05-26 10:01:28] [INFO ] Flatten gal took : 1 ms
[2026-05-26 10:01:28] [INFO ] Flatten gal took : 1 ms
[2026-05-26 10:01:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality6793457992039273594.gal : 0 ms
[2026-05-26 10:01:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality17548317717199219696.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/CTLCardinality6793457992039273594.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17548317717199219696.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.30787e+09,14.3775,284748,2,44396,5,1.52348e+06,6,0,98,2.02579e+06,0


Converting to forward existential form...Done !
original formula: (AG((AF((aux6>14)) * EF(((aux7<=aux14)||(aux14<=c110))))) * EG((EX(TRUE) + EF(EG((aux10<9))))))
=> equivalent forward existential formula: (([FwdG(FwdU(Init,TRUE),!((aux6>14)))] = FALSE * [(FwdU(Init,TRUE) * !(E(TRUE U ((aux7<=aux14)||(aux14<=c110))))...232
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
Detected timeout of ITS tools.
[2026-05-26 10:01:58] [INFO ] Flatten gal took : 2 ms
[2026-05-26 10:01:58] [INFO ] Applying decomposition
[2026-05-26 10:01:58] [INFO ] Flatten gal took : 1 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/graph9103083799344975503.txt' '-o' '/tmp/graph9103083799344975503.bin' '-w' '/tmp/graph9103083799344975503.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9103083799344975503.bin' '-l' '-1' '-v' '-w' '/tmp/graph9103083799344975503.weights' '-q' '0' '-e' '0.001'
[2026-05-26 10:01:58] [INFO ] Decomposing Gal with order
[2026-05-26 10:01:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 10:01:59] [INFO ] Removed a total of 1 redundant transitions.
[2026-05-26 10:01:59] [INFO ] Flatten gal took : 28 ms
[2026-05-26 10:01:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 3 ms.
[2026-05-26 10:01:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality13986926651522873284.gal : 1 ms
[2026-05-26 10:01:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality13269353929916737783.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/CTLCardinality13986926651522873284.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13269353929916737783.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,7.30787e+09,17.3239,351496,2,53461,5,1.88744e+06,6,0,99,2.4332e+06,0


Converting to forward existential form...Done !
original formula: (AG((AF((gi1.gi2.gu5.aux6>14)) * EF(((gu4.aux7<=gu4.aux14)||(gu4.aux14<=gu4.c110))))) * EG((EX(TRUE) + EF(EG((gi1.gi0.gu0.aux10<9))))))
=> equivalent forward existential formula: (([FwdG(FwdU(Init,TRUE),!((gi1.gi2.gu5.aux6>14)))] = FALSE * [(FwdU(Init,TRUE) * !(E(TRUE U ((gu4.aux7<=gu4.aux1...272
Reverse transition relation is NOT exact ! Due to transitions t14, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 33/33 places, 16/16 transitions.
Graph (complete) has 69 edges and 33 vertex of which 28 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Applied a total of 1 rules in 4 ms. Remains 27 /33 variables (removed 6) and now considering 16/16 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14666274724237068479.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12552017126680599439.kers'
[2026-05-26 10:02:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14666274724237068479.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12552017126680599439.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 16 rows 27 cols 60 entries
Finished phase 1 with 6 SingleSign rule and 10 generalized
[2026-05-26 10:02:29] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12552017126680599439.kers
Total runtime 1 ms.
[2026-05-26 10:02:29] [INFO ] Implicit Places using invariants in 65 ms returned [4, 5, 10, 11, 13, 14, 19, 20, 22]
[2026-05-26 10:02:29] [INFO ] Actually due to overlaps returned [4, 5, 10, 11, 13, 14, 19, 20]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 66 ms to find 8 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 19/33 places, 16/16 transitions.
Reduce places removed 1 places and 1 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 18 transition count 9
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 12 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 11 transition count 8
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 14 place count 11 transition count 5
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 20 place count 8 transition count 5
Applied a total of 20 rules in 4 ms. Remains 8 /19 variables (removed 11) and now considering 5/16 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7511281704871631405.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7333033355560696995.kers'
[2026-05-26 10:02:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7511281704871631405.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7333033355560696995.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 5 rows 8 cols 16 entries
Finished phase 1 with 2 SingleSign rule and 3 generalized
[2026-05-26 10:02:29] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7333033355560696995.kers
Total runtime 0 ms.
[2026-05-26 10:02:29] [INFO ] Implicit Places using invariants in 34 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 7/33 places, 5/16 transitions.
Graph (complete) has 8 edges and 7 vertex of which 6 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Applied a total of 1 rules in 1 ms. Remains 6 /7 variables (removed 1) and now considering 4/5 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9898592204019352155.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9616501065215545904.kers'
[2026-05-26 10:02:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9898592204019352155.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9616501065215545904.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 4 rows 6 cols 11 entries
Finished phase 1 with 4 SingleSign rule and 0 generalized
[2026-05-26 10:02:29] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9616501065215545904.kers
Total runtime 0 ms.
[2026-05-26 10:02:29] [INFO ] Implicit Places using invariants in 18 ms returned []
[2026-05-26 10:02:29] [INFO ] Invariant cache hit.
[2026-05-26 10:02:29] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 6/33 places, 4/16 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 149 ms. Remains : 6/33 places, 4/16 transitions.
[2026-05-26 10:02:29] [INFO ] Flatten gal took : 1 ms
[2026-05-26 10:02:29] [INFO ] Flatten gal took : 1 ms
[2026-05-26 10:02:29] [INFO ] Input system was already deterministic with 4 transitions.
[2026-05-26 10:02:29] [INFO ] Flatten gal took : 1 ms
[2026-05-26 10:02:29] [INFO ] Flatten gal took : 1 ms
[2026-05-26 10:02:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality8382576136309624376.gal : 0 ms
[2026-05-26 10:02:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality4857316990464840542.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/CTLCardinality8382576136309624376.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4857316990464840542.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,10626,0.013154,4352,2,527,5,3460,6,0,27,3385,0


Converting to forward existential form...Done !
original formula: EG((out6<=aux8))
=> equivalent forward existential formula: [FwdG(Init,(out6<=aux8))] != FALSE
dead was empty
(forward)formula 0,0,0.105854,6944,1,0,87,15409,12,2,295,16736,85
FORMULA PermAdmissibility-COL-20-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2026-05-26 10:02:29] [INFO ] Flatten gal took : 3 ms
[2026-05-26 10:02:29] [INFO ] Flatten gal took : 3 ms
[2026-05-26 10:02:29] [INFO ] Applying decomposition
[2026-05-26 10:02:29] [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/graph7195981235931400611.txt' '-o' '/tmp/graph7195981235931400611.bin' '-w' '/tmp/graph7195981235931400611.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7195981235931400611.bin' '-l' '-1' '-v' '-w' '/tmp/graph7195981235931400611.weights' '-q' '0' '-e' '0.001'
[2026-05-26 10:02:29] [INFO ] Decomposing Gal with order
[2026-05-26 10:02:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 10:02:29] [INFO ] Removed a total of 2 redundant transitions.
[2026-05-26 10:02:29] [INFO ] Flatten gal took : 3 ms
[2026-05-26 10:02:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 2 ms.
[2026-05-26 10:02:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality10289639778170666751.gal : 1 ms
[2026-05-26 10:02:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality8525621221306176791.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/CTLCardinality10289639778170666751.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8525621221306176791.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.30787e+09,30.3617,665612,2,603745,5,4.44482e+06,6,0,131,3.80434e+06,0


Converting to forward existential form...Done !
original formula: (AG((AF((gi0.gi0.gu4.aux6>14)) * EF(((gu6.aux7<=gu6.aux14)||(gu6.aux14<=gu6.c110))))) * EG((EX(TRUE) + EF(EG((gi0.gi1.gu0.aux10<9))))))
=> equivalent forward existential formula: (([FwdG(FwdU(Init,TRUE),!((gi0.gi0.gu4.aux6>14)))] = FALSE * [(FwdU(Init,TRUE) * !(E(TRUE U ((gu6.aux7<=gu6.aux1...272
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 12/0/3
Detected timeout of ITS tools.
[2026-05-26 10:22:59] [INFO ] Applying decomposition
[2026-05-26 10:22:59] [INFO ] Flatten gal took : 90 ms
[2026-05-26 10:22:59] [INFO ] Decomposing Gal with order
[2026-05-26 10:22:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 10:22:59] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to c16 in partition

at fr.lip6.move.gal.instantiate.CompositeBuilder$Partition.getIndex(CompositeBuilder.java:1421)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:556)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:133)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:124)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:834)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
[2026-05-26 10:22:59] [INFO ] Flatten gal took : 5 ms
[2026-05-26 10:23:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality11948676719726785169.gal : 21 ms
[2026-05-26 10:23:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality13253004799509382626.ctl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11948676719726785169.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13253004799509382626.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,7.30787e+09,9.19057,202576,2,265967,5,1.30727e+06,6,0,129,1.10177e+06,0


Converting to forward existential form...Done !
original formula: (AG((AF((aux6>14)) * EF(((aux7<=aux14)||(aux14<=c110))))) * EG((EX(TRUE) + EF(EG((aux10<9))))))
=> equivalent forward existential formula: (([FwdG(FwdU(Init,TRUE),!((aux6>14)))] = FALSE * [(FwdU(Init,TRUE) * !(E(TRUE U ((aux7<=aux14)||(aux14<=c110))))...232
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 13/0/3
Hit Full ! (commute/partial/dont) 13/0/3
(forward)formula 0,0,486.088,7097668,1,0,327,4.33365e+07,18,3,1568,4.16106e+07,10
FORMULA PermAdmissibility-COL-20-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Total runtime 1795110 ms.

BK_STOP 1779791469189

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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