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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 7.4K Mar 8 07:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Mar 8 07:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Mar 8 07:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Mar 8 07:01 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.9K Mar 16 08:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 16 08:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 16 08:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 16 08:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Mar 8 07:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Mar 8 07:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Mar 8 07:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Mar 8 07:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 16 08:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 16 08:27 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-02-CTLCardinality-2024-00
FORMULA_NAME PermAdmissibility-COL-02-CTLCardinality-2024-01
FORMULA_NAME PermAdmissibility-COL-02-CTLCardinality-2024-02
FORMULA_NAME PermAdmissibility-COL-02-CTLCardinality-2024-03
FORMULA_NAME PermAdmissibility-COL-02-CTLCardinality-2024-04
FORMULA_NAME PermAdmissibility-COL-02-CTLCardinality-2024-05
FORMULA_NAME PermAdmissibility-COL-02-CTLCardinality-2024-06
FORMULA_NAME PermAdmissibility-COL-02-CTLCardinality-2024-07
FORMULA_NAME PermAdmissibility-COL-02-CTLCardinality-2024-08
FORMULA_NAME PermAdmissibility-COL-02-CTLCardinality-2024-09
FORMULA_NAME PermAdmissibility-COL-02-CTLCardinality-2024-10
FORMULA_NAME PermAdmissibility-COL-02-CTLCardinality-2024-11
FORMULA_NAME PermAdmissibility-COL-02-CTLCardinality-2024-12
FORMULA_NAME PermAdmissibility-COL-02-CTLCardinality-2024-13
FORMULA_NAME PermAdmissibility-COL-02-CTLCardinality-2024-14
FORMULA_NAME PermAdmissibility-COL-02-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779789253956

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-02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
CTLCardinality COL
Running Version 202604301425
[2026-05-26 09:54:15] [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 09:54:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 09:54:15] [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 09:54:15] [WARNING] Using fallBack plugin, rng conformance not checked
[2026-05-26 09:54:15] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 548 ms
[2026-05-26 09:54:15] [INFO ] Imported 40 HL places and 16 HL transitions for a total of 208 PT places and 1024.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 18 ms.
[2026-05-26 09:54:15] [INFO ] Built PT skeleton of HLPN with 40 places and 16 transitions 83 arcs in 5 ms.
[2026-05-26 09:54:15] [INFO ] Skeletonized 16 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 1 formulas.
FORMULA PermAdmissibility-COL-02-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Remains 15 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 40001 steps (833 resets) in 1974 ms. (20 steps per ms) remains 55/85 properties
BEST_FIRST walk for 4002 steps (50 resets) in 34 ms. (114 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (56 resets) in 56 ms. (70 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (52 resets) in 61 ms. (64 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (52 resets) in 37 ms. (105 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (60 resets) in 24 ms. (160 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (48 resets) in 21 ms. (182 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (60 resets) in 25 ms. (153 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (60 resets) in 28 ms. (138 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (56 resets) in 32 ms. (121 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (49 resets) in 28 ms. (138 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (48 resets) in 32 ms. (121 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (60 resets) in 45 ms. (87 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (60 resets) in 26 ms. (148 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (60 resets) in 23 ms. (166 steps per ms) remains 54/55 properties
BEST_FIRST walk for 4003 steps (52 resets) in 35 ms. (111 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (52 resets) in 21 ms. (181 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (48 resets) in 18 ms. (210 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (56 resets) in 19 ms. (200 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (51 resets) in 17 ms. (222 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4000 steps (60 resets) in 21 ms. (181 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (56 resets) in 52 ms. (75 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4000 steps (60 resets) in 42 ms. (93 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (60 resets) in 24 ms. (160 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (48 resets) in 24 ms. (160 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (49 resets) in 18 ms. (210 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (56 resets) in 30 ms. (129 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (51 resets) in 25 ms. (153 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (50 resets) in 27 ms. (142 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (60 resets) in 29 ms. (133 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4000 steps (44 resets) in 44 ms. (88 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (56 resets) in 27 ms. (142 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4000 steps (60 resets) in 31 ms. (125 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4000 steps (56 resets) in 25 ms. (153 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (44 resets) in 26 ms. (148 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (60 resets) in 38 ms. (102 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (45 resets) in 30 ms. (129 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (49 resets) in 34 ms. (114 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (52 resets) in 33 ms. (117 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4000 steps (56 resets) in 47 ms. (83 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (48 resets) in 25 ms. (153 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (48 resets) in 29 ms. (133 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (51 resets) in 33 ms. (117 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4000 steps (56 resets) in 33 ms. (117 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (45 resets) in 30 ms. (129 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4000 steps (60 resets) in 33 ms. (117 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (45 resets) in 28 ms. (138 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (48 resets) in 33 ms. (117 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (60 resets) in 29 ms. (133 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (51 resets) in 26 ms. (148 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (51 resets) in 29 ms. (133 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (60 resets) in 31 ms. (125 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (46 resets) in 27 ms. (142 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4000 steps (60 resets) in 33 ms. (117 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (56 resets) in 47 ms. (83 steps per ms) remains 54/54 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17050330105434666047.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11481949386383946697.kers'
[2026-05-26 09:54:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17050330105434666047.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11481949386383946697.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 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 09:54:17] [INFO ] Computed 24 invariants in 0 ms
Computed 24 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11481949386383946697.kers
Total runtime 1 ms.
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp76 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp79 is UNSAT
Problem AtomicPropp81 is UNSAT
Problem AtomicPropp82 is UNSAT
Problem AtomicPropp83 is UNSAT
Problem AtomicPropp84 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 21/21 constraints. Problems are: Problem set: 53 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/21 constraints. Problems are: Problem set: 53 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 3/40 variables, 3/24 constraints. Problems are: Problem set: 53 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/24 constraints. Problems are: Problem set: 53 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 16/56 variables, 40/64 constraints. Problems are: Problem set: 53 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/64 constraints. Problems are: Problem set: 53 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/56 variables, 0/64 constraints. Problems are: Problem set: 53 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 64 constraints, problems are : Problem set: 53 solved, 1 unsolved in 217 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 53 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 53 solved, 1 unsolved
Problem AtomicPropp78 is UNSAT
After SMT solving in domain Int declared 30/56 variables, and 14 constraints, problems are : Problem set: 54 solved, 0 unsolved in 38 ms.
Refiners :[Generalized P Invariants (flows): 14/24 constraints, State Equation: 0/40 constraints, PredecessorRefiner: 0/54 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 338ms problems are : Problem set: 54 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 54 atomic propositions for a total of 15 simplifications.
FORMULA PermAdmissibility-COL-02-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-02-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-02-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-02-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-26 09:54:17] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2026-05-26 09:54:17] [INFO ] Flatten gal took : 24 ms
FORMULA PermAdmissibility-COL-02-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-02-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-02-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-02-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-02-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-02-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-26 09:54:17] [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 09:54:17] [INFO ] Unfolded HLPN to a Petri net with 40 places and 16 transitions 83 arcs in 9 ms.
[2026-05-26 09:54:17] [INFO ] Unfolded 5 HLPN properties in 0 ms.
Support contains 35 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-11182010458850506775.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18103246875359105187.kers'
[2026-05-26 09:54:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11182010458850506775.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18103246875359105187.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 09:54:17] [INFO ] Computed 21 invariants in 0 ms
Computed 21 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-18103246875359105187.kers
Total runtime 4 ms.
[2026-05-26 09:54:17] [INFO ] Implicit Places using invariants in 55 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 68 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 36/40 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 36 /36 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 87 ms. Remains : 36/40 places, 16/16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 36/36 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 36 /36 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-7267724060017085918.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8337168184192304630.kers'
[2026-05-26 09:54:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7267724060017085918.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8337168184192304630.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 16 rows 33 cols 72 entries
Finished phase 1 with 2 SingleSign rule and 14 generalized
[2026-05-26 09:54:17] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8337168184192304630.kers
Total runtime 0 ms.
[2026-05-26 09:54:17] [INFO ] Implicit Places using invariants in 51 ms returned []
[2026-05-26 09:54:17] [INFO ] Invariant cache hit.
[2026-05-26 09:54:17] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
Running 15 sub problems to find dead transitions.
[2026-05-26 09:54:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 5/34 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 2/36 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 16/52 variables, 36/56 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 0/52 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 56 constraints, problems are : Problem set: 0 solved, 15 unsolved in 575 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 36/36 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/29 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 5/34 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 2/36 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 16/52 variables, 36/56 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 15/71 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 0/52 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 71 constraints, problems are : Problem set: 0 solved, 15 unsolved in 539 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 36/36 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1120ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 1121ms
Finished structural reductions in LTL mode , in 1 iterations and 1266 ms. Remains : 36/36 places, 16/16 transitions.
Support contains 35 out of 36 places after structural reductions.
[2026-05-26 09:54:19] [INFO ] Flatten gal took : 5 ms
[2026-05-26 09:54:19] [INFO ] Flatten gal took : 4 ms
[2026-05-26 09:54:19] [INFO ] Input system was already deterministic with 16 transitions.
RANDOM walk for 40000 steps (829 resets) in 411 ms. (97 steps per ms) remains 25/44 properties
BEST_FIRST walk for 4003 steps (60 resets) in 21 ms. (181 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (60 resets) in 20 ms. (190 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (56 resets) in 20 ms. (190 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (48 resets) in 25 ms. (153 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (48 resets) in 21 ms. (181 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (60 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (60 resets) in 38 ms. (102 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4000 steps (60 resets) in 22 ms. (173 steps per ms) remains 24/25 properties
BEST_FIRST walk for 4002 steps (52 resets) in 28 ms. (138 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (50 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (48 resets) in 21 ms. (181 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (56 resets) in 25 ms. (153 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (52 resets) in 26 ms. (148 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (60 resets) in 33 ms. (117 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (56 resets) in 29 ms. (133 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (60 resets) in 28 ms. (137 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (60 resets) in 27 ms. (143 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (44 resets) in 25 ms. (153 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (49 resets) in 28 ms. (138 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (49 resets) in 25 ms. (153 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (56 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (48 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (48 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (52 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
[2026-05-26 09:54:19] [INFO ] Invariant cache hit.
Problem AtomicPropp38 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 23 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp41 is UNSAT
After SMT solving in domain Real declared 36/52 variables, and 20 constraints, problems are : Problem set: 24 solved, 0 unsolved in 88 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 0/36 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 94ms problems are : Problem set: 24 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 24 atomic propositions for a total of 5 simplifications.
[2026-05-26 09:54:19] [INFO ] Flatten gal took : 4 ms
[2026-05-26 09:54:19] [INFO ] Flatten gal took : 2 ms
[2026-05-26 09:54:19] [INFO ] Input system was already deterministic with 16 transitions.
Support contains 21 out of 36 places (down from 27) after GAL structural reductions.
Computed a total of 36 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 36 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 1 formulas.
FORMULA PermAdmissibility-COL-02-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 36/36 places, 16/16 transitions.
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 30 transition count 16
Applied a total of 6 rules in 1 ms. Remains 30 /36 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-12242294931948564126.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14938585503171532694.kers'
[2026-05-26 09:54:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12242294931948564126.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14938585503171532694.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 16 rows 30 cols 69 entries
Finished phase 1 with 3 SingleSign rule and 13 generalized
[2026-05-26 09:54:19] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14938585503171532694.kers
Total runtime 0 ms.
[2026-05-26 09:54:19] [INFO ] Implicit Places using invariants in 52 ms returned [4, 6, 8, 14, 15, 19, 20, 24, 25]
[2026-05-26 09:54:19] [INFO ] Actually due to overlaps returned [4, 8, 14, 15, 19, 20, 24]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 53 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/36 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55 ms. Remains : 23/36 places, 16/16 transitions.
[2026-05-26 09:54:19] [INFO ] Flatten gal took : 2 ms
[2026-05-26 09:54:19] [INFO ] Flatten gal took : 1 ms
[2026-05-26 09:54:19] [INFO ] Input system was already deterministic with 16 transitions.
[2026-05-26 09:54:19] [INFO ] Flatten gal took : 1 ms
[2026-05-26 09:54:19] [INFO ] Flatten gal took : 2 ms
[2026-05-26 09:54:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality8995156799936215126.gal : 1 ms
[2026-05-26 09:54:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality15666091209536524621.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/CTLCardinality8995156799936215126.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15666091209536524621.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,153,0.014126,3876,2,161,5,604,6,0,106,448,0


Converting to forward existential form...Done !
original formula: (AG(AF((((aux5<=aux14)&&(out2<=in4)) * AG((aux11>aux5))))) * EX(TRUE))
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),!((((aux5<=aux14)&&(out2<=in4)) * !(E(TRUE U !((aux11>aux5)))))))] = FALSE * [(Init * !(E...174
Reverse transition relation is NOT exact ! Due to transitions t0, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0...163
(forward)formula 0,0,0.030455,4728,1,0,60,3722,56,24,722,3897,79
FORMULA PermAdmissibility-COL-02-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 36/36 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 29 transition count 16
Applied a total of 7 rules in 1 ms. Remains 29 /36 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-12125906751125628446.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2529399889313447047.kers'
[2026-05-26 09:54:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12125906751125628446.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2529399889313447047.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 16 rows 29 cols 68 entries
Finished phase 1 with 4 SingleSign rule and 12 generalized
[2026-05-26 09:54:19] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2529399889313447047.kers
Total runtime 0 ms.
[2026-05-26 09:54:19] [INFO ] Implicit Places using invariants in 49 ms returned [3, 5, 13, 14, 15, 18, 19, 23, 24, 25]
[2026-05-26 09:54:19] [INFO ] Actually due to overlaps returned [3, 13, 14, 15, 18, 19, 23]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 50 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/36 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 52 ms. Remains : 22/36 places, 16/16 transitions.
[2026-05-26 09:54:19] [INFO ] Flatten gal took : 3 ms
[2026-05-26 09:54:19] [INFO ] Flatten gal took : 3 ms
[2026-05-26 09:54:19] [INFO ] Input system was already deterministic with 16 transitions.
[2026-05-26 09:54:19] [INFO ] Flatten gal took : 2 ms
[2026-05-26 09:54:19] [INFO ] Flatten gal took : 1 ms
[2026-05-26 09:54:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality16449038713860111727.gal : 2 ms
[2026-05-26 09:54:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality12841104582976883947.ctl : 2 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/CTLCardinality16449038713860111727.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12841104582976883947.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,153,0.005324,4028,2,163,5,729,6,0,106,673,0


Converting to forward existential form...Done !
original formula: AF(((AX(FALSE) * (aux14>aux5)) * ((aux16>c13)||(c17<=90))))
=> equivalent forward existential formula: [FwdG(Init,!(((!(EX(!(FALSE))) * (aux14>aux5)) * ((aux16>c13)||(c17<=90)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0...163
(forward)formula 0,0,0.021649,4924,1,0,60,4439,50,24,691,5064,75
FORMULA PermAdmissibility-COL-02-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 36/36 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 29 transition count 16
Applied a total of 7 rules in 2 ms. Remains 29 /36 variables (removed 7) and now considering 16/16 (removed 0) transitions.
[2026-05-26 09:54:19] [INFO ] Invariant cache hit.
[2026-05-26 09:54:19] [INFO ] Implicit Places using invariants in 44 ms returned [3, 5, 6, 7, 11, 13, 14, 15, 18, 19, 23, 24, 25]
[2026-05-26 09:54:19] [INFO ] Actually due to overlaps returned [3, 6, 11, 13, 15, 18, 19, 23]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 45 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/36 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 48 ms. Remains : 21/36 places, 16/16 transitions.
[2026-05-26 09:54:19] [INFO ] Flatten gal took : 1 ms
[2026-05-26 09:54:19] [INFO ] Flatten gal took : 1 ms
[2026-05-26 09:54:19] [INFO ] Input system was already deterministic with 16 transitions.
[2026-05-26 09:54:19] [INFO ] Flatten gal took : 1 ms
[2026-05-26 09:54:19] [INFO ] Flatten gal took : 1 ms
[2026-05-26 09:54:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality7652061704577071998.gal : 1 ms
[2026-05-26 09:54:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality9127689482315194368.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/CTLCardinality7652061704577071998.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9127689482315194368.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,153,0.005078,4000,2,127,5,625,6,0,102,615,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,0.005306,4000,1,0,6,625,7,1,133,615,1
FORMULA PermAdmissibility-COL-02-CTLCardinality-2024-09 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 : 36/36 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 29 transition count 16
Applied a total of 7 rules in 1 ms. Remains 29 /36 variables (removed 7) and now considering 16/16 (removed 0) transitions.
[2026-05-26 09:54:19] [INFO ] Invariant cache hit.
[2026-05-26 09:54:19] [INFO ] Implicit Places using invariants in 41 ms returned [3, 5, 6, 7, 11, 13, 14, 15, 18, 19, 25]
[2026-05-26 09:54:19] [INFO ] Actually due to overlaps returned [3, 6, 11, 13, 15, 18, 19, 25]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 42 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/36 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 44 ms. Remains : 21/36 places, 16/16 transitions.
[2026-05-26 09:54:19] [INFO ] Flatten gal took : 1 ms
[2026-05-26 09:54:19] [INFO ] Flatten gal took : 1 ms
[2026-05-26 09:54:19] [INFO ] Input system was already deterministic with 16 transitions.
[2026-05-26 09:54:19] [INFO ] Flatten gal took : 1 ms
[2026-05-26 09:54:19] [INFO ] Flatten gal took : 1 ms
[2026-05-26 09:54:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality890055230511506512.gal : 1 ms
[2026-05-26 09:54:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality9874692487199302048.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/CTLCardinality890055230511506512.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9874692487199302048.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,153,0.005221,4020,2,141,5,649,6,0,102,636,0


Converting to forward existential form...Done !
original formula: (EX(TRUE) * EG(AX((aux9<=aux10))))
=> equivalent forward existential formula: [FwdG((Init * EX(TRUE)),!(EX(!((aux9<=aux10)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0...163
(forward)formula 0,0,0.021281,4880,1,0,81,4508,52,41,615,5477,91
FORMULA PermAdmissibility-COL-02-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2026-05-26 09:54:19] [INFO ] Flatten gal took : 2 ms
[2026-05-26 09:54:19] [INFO ] Flatten gal took : 2 ms
Total runtime 4870 ms.

BK_STOP 1779789260061

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

tar xzf /home/mcc/BenchKit/INPUTS/PermAdmissibility-COL-02.tgz
mv PermAdmissibility-COL-02 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 ;