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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 6.2K Mar 8 06:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Mar 8 06:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 8 06:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 8 06:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 16 08:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 16 08:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 16 08:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 16 08:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 8 06:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Mar 8 06:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 8 06:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 8 06:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 16 08:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 16 08:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 81K 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 NoC3x3-PT-1A-CTLCardinality-2024-00
FORMULA_NAME NoC3x3-PT-1A-CTLCardinality-2024-01
FORMULA_NAME NoC3x3-PT-1A-CTLCardinality-2024-02
FORMULA_NAME NoC3x3-PT-1A-CTLCardinality-2024-03
FORMULA_NAME NoC3x3-PT-1A-CTLCardinality-2024-04
FORMULA_NAME NoC3x3-PT-1A-CTLCardinality-2024-05
FORMULA_NAME NoC3x3-PT-1A-CTLCardinality-2024-06
FORMULA_NAME NoC3x3-PT-1A-CTLCardinality-2024-07
FORMULA_NAME NoC3x3-PT-1A-CTLCardinality-2024-08
FORMULA_NAME NoC3x3-PT-1A-CTLCardinality-2024-09
FORMULA_NAME NoC3x3-PT-1A-CTLCardinality-2024-10
FORMULA_NAME NoC3x3-PT-1A-CTLCardinality-2024-11
FORMULA_NAME NoC3x3-PT-1A-CTLCardinality-2024-12
FORMULA_NAME NoC3x3-PT-1A-CTLCardinality-2024-13
FORMULA_NAME NoC3x3-PT-1A-CTLCardinality-2024-14
FORMULA_NAME NoC3x3-PT-1A-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779739477849

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-1A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-25 20:04:38] [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-25 20:04:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 20:04:39] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2026-05-25 20:04:39] [INFO ] Transformed 165 places.
[2026-05-25 20:04:39] [INFO ] Transformed 355 transitions.
[2026-05-25 20:04:39] [INFO ] Found NUPN structural information;
[2026-05-25 20:04:39] [INFO ] Parsed PT model containing 165 places and 355 transitions and 1069 arcs in 172 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 108 transitions
Reduce redundant transitions removed 108 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA NoC3x3-PT-1A-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-1A-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-1A-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 58 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 247/247 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 157 transition count 235
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 157 transition count 235
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 0 with 30 rules applied. Total rules applied 46 place count 157 transition count 205
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 50 place count 153 transition count 205
Applied a total of 50 rules in 33 ms. Remains 153 /165 variables (removed 12) and now considering 205/247 (removed 42) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3563883649524486910.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14510670213082566123.kers'
[2026-05-25 20:04:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3563883649524486910.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14510670213082566123.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 205 rows 151 cols 679 entries
Finished phase 1 with 117 SingleSign rule and 0 generalized
[2026-05-25 20:04:39] [INFO ] Computed 36 invariants in 2 ms
Computed 36 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-14510670213082566123.kers
Total runtime 3 ms.
[2026-05-25 20:04:39] [INFO ] Implicit Places using invariants in 269 ms returned []
[2026-05-25 20:04:39] [INFO ] Invariant cache hit.
[2026-05-25 20:04:39] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
Running 204 sub problems to find dead transitions.
[2026-05-25 20:04:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (OVERLAPS) 2/153 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (OVERLAPS) 205/358 variables, 153/189 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (OVERLAPS) 0/358 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 358/358 variables, and 189 constraints, problems are : Problem set: 0 solved, 204 unsolved in 9664 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (OVERLAPS) 2/153 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (OVERLAPS) 205/358 variables, 153/189 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 204/393 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/358 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (OVERLAPS) 0/358 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Int declared 358/358 variables, and 393 constraints, problems are : Problem set: 0 solved, 204 unsolved in 11671 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21408ms problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 21427ms
Starting structural reductions in LTL mode, iteration 1 : 153/165 places, 205/247 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21971 ms. Remains : 153/165 places, 205/247 transitions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 205/205 transitions.
Applied a total of 0 rules in 3 ms. Remains 153 /153 variables (removed 0) and now considering 205/205 (removed 0) transitions.
[2026-05-25 20:05:01] [INFO ] Invariant cache hit.
[2026-05-25 20:05:01] [INFO ] Implicit Places using invariants in 83 ms returned []
[2026-05-25 20:05:01] [INFO ] Invariant cache hit.
[2026-05-25 20:05:01] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 201 ms. Remains : 153/153 places, 205/205 transitions.
Support contains 58 out of 153 places after structural reductions.
[2026-05-25 20:05:01] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-05-25 20:05:01] [INFO ] Flatten gal took : 42 ms
FORMULA NoC3x3-PT-1A-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 20:05:01] [INFO ] Flatten gal took : 17 ms
[2026-05-25 20:05:01] [INFO ] Input system was already deterministic with 205 transitions.
Support contains 57 out of 153 places (down from 58) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1348 ms. (29 steps per ms) remains 2/48 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 2/2 properties
[2026-05-25 20:05:02] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp40 is UNSAT
At refinement iteration 1 (OVERLAPS) 5/8 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 145/153 variables, 33/36 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/36 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 205/358 variables, 153/189 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 0/189 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/358 variables, 0/189 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 358/358 variables, and 189 constraints, problems are : Problem set: 1 solved, 1 unsolved in 92 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp29 is UNSAT
After SMT solving in domain Int declared 5/358 variables, and 2 constraints, problems are : Problem set: 2 solved, 0 unsolved in 19 ms.
Refiners :[Positive P Invariants (semi-flows): 2/36 constraints, State Equation: 0/153 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 116ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
[2026-05-25 20:05:02] [INFO ] Flatten gal took : 11 ms
[2026-05-25 20:05:02] [INFO ] Flatten gal took : 17 ms
[2026-05-25 20:05:02] [INFO ] Input system was already deterministic with 205 transitions.
Computed a total of 3 stabilizing places and 1 stable transitions
Graph (complete) has 470 edges and 153 vertex of which 151 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 205/205 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 151 transition count 205
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 21 place count 132 transition count 186
Iterating global reduction 1 with 19 rules applied. Total rules applied 40 place count 132 transition count 186
Applied a total of 40 rules in 8 ms. Remains 132 /153 variables (removed 21) and now considering 186/205 (removed 19) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8788827792284013404.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2243650559971017557.kers'
[2026-05-25 20:05:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8788827792284013404.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2243650559971017557.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 186 rows 132 cols 603 entries
Finished phase 1 with 98 SingleSign rule and 0 generalized
[2026-05-25 20:05:02] [INFO ] Computed 34 invariants in 0 ms
Computed 34 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2243650559971017557.kers
Total runtime 1 ms.
[2026-05-25 20:05:02] [INFO ] Implicit Places using invariants in 61 ms returned []
[2026-05-25 20:05:02] [INFO ] Invariant cache hit.
[2026-05-25 20:05:02] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Running 185 sub problems to find dead transitions.
[2026-05-25 20:05:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 186/318 variables, 132/166 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (OVERLAPS) 0/318 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 318/318 variables, and 166 constraints, problems are : Problem set: 0 solved, 185 unsolved in 6500 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 186/318 variables, 132/166 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 185/351 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (OVERLAPS) 0/318 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Int declared 318/318 variables, and 351 constraints, problems are : Problem set: 0 solved, 185 unsolved in 8678 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15198ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 15201ms
Starting structural reductions in LTL mode, iteration 1 : 132/153 places, 186/205 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15378 ms. Remains : 132/153 places, 186/205 transitions.
[2026-05-25 20:05:17] [INFO ] Flatten gal took : 10 ms
[2026-05-25 20:05:17] [INFO ] Flatten gal took : 11 ms
[2026-05-25 20:05:17] [INFO ] Input system was already deterministic with 186 transitions.
[2026-05-25 20:05:17] [INFO ] Flatten gal took : 9 ms
[2026-05-25 20:05:17] [INFO ] Flatten gal took : 9 ms
[2026-05-25 20:05:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality17915812780480779406.gal : 4 ms
[2026-05-25 20:05:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality4242031962885457122.ctl : 3 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/CTLCardinality17915812780480779406.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4242031962885457122.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.45165e+19,0.160631,9164,2,359,5,23998,6,0,716,29941,0


Converting to forward existential form...Done !
original formula: EG(AX(E(!(((p158!=1) * EG((p100==0)))) U (p5==1))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(E(!(((p158!=1) * EG((p100==0)))) U (p5==1))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2026-05-25 20:05:47] [INFO ] Flatten gal took : 11 ms
[2026-05-25 20:05:47] [INFO ] Applying decomposition
[2026-05-25 20:05:47] [INFO ] Flatten gal took : 8 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/graph7876742275630488725.txt' '-o' '/tmp/graph7876742275630488725.bin' '-w' '/tmp/graph7876742275630488725.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7876742275630488725.bin' '-l' '-1' '-v' '-w' '/tmp/graph7876742275630488725.weights' '-q' '0' '-e' '0.001'
[2026-05-25 20:05:48] [INFO ] Decomposing Gal with order
[2026-05-25 20:05:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 20:05:48] [INFO ] Removed a total of 44 redundant transitions.
[2026-05-25 20:05:48] [INFO ] Flatten gal took : 59 ms
[2026-05-25 20:05:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2026-05-25 20:05:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality14822045518823519972.gal : 6 ms
[2026-05-25 20:05:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality4479776991520327790.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/CTLCardinality14822045518823519972.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4479776991520327790.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
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.45165e+19,0.049713,5740,70,29,3195,374,328,4625,51,2031,0


Converting to forward existential form...Done !
original formula: EG(AX(E(!(((i7.u31.p158!=1) * EG((i4.u21.p100==0)))) U (i0.i1.u0.p5==1))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(E(!(((i7.u31.p158!=1) * EG((i4.u21.p100==0)))) U (i0.i1.u0.p5==1))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 205/205 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 151 transition count 205
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 20 place count 133 transition count 187
Iterating global reduction 1 with 18 rules applied. Total rules applied 38 place count 133 transition count 187
Applied a total of 38 rules in 20 ms. Remains 133 /153 variables (removed 20) and now considering 187/205 (removed 18) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3147260439874182147.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4308821394784680926.kers'
[2026-05-25 20:06:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3147260439874182147.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4308821394784680926.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 187 rows 133 cols 607 entries
Finished phase 1 with 99 SingleSign rule and 0 generalized
[2026-05-25 20:06:18] [INFO ] Computed 34 invariants in 0 ms
Computed 34 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4308821394784680926.kers
Total runtime 1 ms.
[2026-05-25 20:06:18] [INFO ] Implicit Places using invariants in 77 ms returned []
[2026-05-25 20:06:18] [INFO ] Invariant cache hit.
[2026-05-25 20:06:18] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
Running 186 sub problems to find dead transitions.
[2026-05-25 20:06:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (OVERLAPS) 187/320 variables, 133/167 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 0/320 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 320/320 variables, and 167 constraints, problems are : Problem set: 0 solved, 186 unsolved in 6470 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (OVERLAPS) 187/320 variables, 133/167 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 186/353 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (OVERLAPS) 0/320 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 320/320 variables, and 353 constraints, problems are : Problem set: 0 solved, 186 unsolved in 8268 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14759ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 14761ms
Starting structural reductions in LTL mode, iteration 1 : 133/153 places, 187/205 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14999 ms. Remains : 133/153 places, 187/205 transitions.
[2026-05-25 20:06:33] [INFO ] Flatten gal took : 15 ms
[2026-05-25 20:06:33] [INFO ] Flatten gal took : 7 ms
[2026-05-25 20:06:33] [INFO ] Input system was already deterministic with 187 transitions.
[2026-05-25 20:06:33] [INFO ] Flatten gal took : 9 ms
[2026-05-25 20:06:33] [INFO ] Flatten gal took : 8 ms
[2026-05-25 20:06:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality2086192844947674176.gal : 5 ms
[2026-05-25 20:06:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality6116337855951741322.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/CTLCardinality2086192844947674176.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6116337855951741322.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,2.94197e+19,0.11117,9276,2,362,5,24131,6,0,721,30371,0


Converting to forward existential form...Done !
original formula: EX(AG(EF(EG(((p31==0)||(p129==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(E(TRUE U EG(((p31==0)||(p129==1))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.177165,9544,1,0,8,24131,22,1,3719,30371,10
FORMULA NoC3x3-PT-1A-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 153/153 places, 205/205 transitions.
Graph (trivial) has 80 edges and 153 vertex of which 43 / 153 are part of one of the 19 SCC in 3 ms
Free SCC test removed 24 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Graph (complete) has 422 edges and 129 vertex of which 127 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 19 place count 110 transition count 140
Iterating global reduction 0 with 17 rules applied. Total rules applied 36 place count 110 transition count 140
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 37 place count 110 transition count 139
Applied a total of 37 rules in 25 ms. Remains 110 /153 variables (removed 43) and now considering 139/205 (removed 66) transitions.
[2026-05-25 20:06:33] [INFO ] Flow matrix only has 121 transitions (discarded 18 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1870619657422283769.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7395258423333267016.kers'
[2026-05-25 20:06:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1870619657422283769.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7395258423333267016.kers]
Normalized transition count is 120 out of 121 initially.
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 120 rows 105 cols 366 entries
Finished phase 1 with 76 SingleSign rule and 0 generalized
[2026-05-25 20:06:33] [INFO ] Computed 34 invariants in 0 ms
Computed 34 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7395258423333267016.kers
Total runtime 0 ms.
[2026-05-25 20:06:33] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-05-25 20:06:33] [INFO ] Flow matrix only has 121 transitions (discarded 18 similar events)
[2026-05-25 20:06:33] [INFO ] Invariant cache hit.
[2026-05-25 20:06:33] [INFO ] State equation strengthened by 53 read => feed constraints.
[2026-05-25 20:06:33] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2026-05-25 20:06:33] [INFO ] Redundant transitions in 4 ms returned []
Running 138 sub problems to find dead transitions.
[2026-05-25 20:06:33] [INFO ] Flow matrix only has 121 transitions (discarded 18 similar events)
[2026-05-25 20:06:33] [INFO ] Invariant cache hit.
[2026-05-25 20:06:33] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (OVERLAPS) 120/230 variables, 110/144 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 52/196 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (OVERLAPS) 1/231 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (OVERLAPS) 0/231 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/231 variables, and 197 constraints, problems are : Problem set: 0 solved, 138 unsolved in 4377 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 110/110 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (OVERLAPS) 120/230 variables, 110/144 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 52/196 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 138/334 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (OVERLAPS) 1/231 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (OVERLAPS) 0/231 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 231/231 variables, and 335 constraints, problems are : Problem set: 0 solved, 138 unsolved in 6764 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 110/110 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11157ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 11158ms
Starting structural reductions in SI_CTL mode, iteration 1 : 110/153 places, 139/205 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11361 ms. Remains : 110/153 places, 139/205 transitions.
[2026-05-25 20:06:44] [INFO ] Flatten gal took : 6 ms
[2026-05-25 20:06:44] [INFO ] Flatten gal took : 6 ms
[2026-05-25 20:06:44] [INFO ] Input system was already deterministic with 139 transitions.
[2026-05-25 20:06:44] [INFO ] Flatten gal took : 8 ms
[2026-05-25 20:06:44] [INFO ] Flatten gal took : 5 ms
[2026-05-25 20:06:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality4460465970773191327.gal : 1 ms
[2026-05-25 20:06:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality16947917423680407285.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/CTLCardinality4460465970773191327.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16947917423680407285.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,5.184e+14,0.085402,8020,2,295,5,20637,6,0,552,20975,0


Converting to forward existential form...Done !
original formula: AG(((E(((p31==0)||(p140==1)) U ((p121==0)||(p42==1))) + ((p88==0)&&(p144==1))) + (AG((p85==1)) * A((p11==0) U ((p140==0)||(p7==1))))))
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,TRUE) * !((E(((p31==0)||(p140==1)) U ((p121==0)||(p42==1))) + ((p88==0)&&(p144==1))))),TRUE) ...505
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 132/0/7
Hit Full ! (commute/partial/dont) 132/7/7
(forward)formula 0,0,2.25799,85100,1,0,15,325721,29,4,2995,500226,14
FORMULA NoC3x3-PT-1A-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 153/153 places, 205/205 transitions.
Graph (trivial) has 82 edges and 153 vertex of which 43 / 153 are part of one of the 19 SCC in 1 ms
Free SCC test removed 24 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Graph (complete) has 422 edges and 129 vertex of which 127 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 20 rules applied. Total rules applied 22 place count 121 transition count 141
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 33 place count 110 transition count 141
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 51 place count 92 transition count 123
Iterating global reduction 2 with 18 rules applied. Total rules applied 69 place count 92 transition count 123
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 2 with 16 rules applied. Total rules applied 85 place count 92 transition count 107
Applied a total of 85 rules in 19 ms. Remains 92 /153 variables (removed 61) and now considering 107/205 (removed 98) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8233413399548776751.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3394177358538907848.kers'
[2026-05-25 20:06:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8233413399548776751.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3394177358538907848.kers]
Normalized transition count is 106 out of 107 initially.
Culling duplicate invariants (modulo rational): removing 14 columns.
Culled 14 columns in 0 ms.
// Phase 1: matrix 106 rows 78 cols 250 entries
Finished phase 1 with 63 SingleSign rule and 0 generalized
[2026-05-25 20:06:47] [INFO ] Computed 29 invariants in 0 ms
Computed 29 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3394177358538907848.kers
Total runtime 1 ms.
[2026-05-25 20:06:47] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-25 20:06:47] [INFO ] Invariant cache hit.
[2026-05-25 20:06:47] [INFO ] State equation strengthened by 28 read => feed constraints.
[2026-05-25 20:06:47] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
[2026-05-25 20:06:47] [INFO ] Redundant transitions in 42 ms returned []
Running 93 sub problems to find dead transitions.
[2026-05-25 20:06:47] [INFO ] Invariant cache hit.
[2026-05-25 20:06:47] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (OVERLAPS) 106/198 variables, 92/121 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 28/149 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (OVERLAPS) 0/198 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/199 variables, and 149 constraints, problems are : Problem set: 0 solved, 93 unsolved in 2554 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, State Equation: 92/92 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (OVERLAPS) 106/198 variables, 92/121 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 28/149 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 93/242 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (OVERLAPS) 0/198 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/199 variables, and 242 constraints, problems are : Problem set: 0 solved, 93 unsolved in 2469 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, State Equation: 92/92 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5031ms problems are : Problem set: 0 solved, 93 unsolved
Search for dead transitions found 0 dead transitions in 5032ms
Starting structural reductions in SI_CTL mode, iteration 1 : 92/153 places, 107/205 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5233 ms. Remains : 92/153 places, 107/205 transitions.
[2026-05-25 20:06:52] [INFO ] Flatten gal took : 7 ms
[2026-05-25 20:06:52] [INFO ] Flatten gal took : 4 ms
[2026-05-25 20:06:52] [INFO ] Input system was already deterministic with 107 transitions.
[2026-05-25 20:06:52] [INFO ] Flatten gal took : 4 ms
[2026-05-25 20:06:52] [INFO ] Flatten gal took : 4 ms
[2026-05-25 20:06:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality9882968825108121348.gal : 1 ms
[2026-05-25 20:06:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality14985929416959805542.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/CTLCardinality9882968825108121348.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14985929416959805542.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,3.86547e+13,0.031024,5172,2,334,5,5962,5,0,476,5510,0


Converting to forward existential form...Done !
original formula: AF(AG(E(((p66==0)||(p50==1)) U EF((p21==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(E(((p66==0)||(p50==1)) U E(TRUE U (p21==1))))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 102/0/5
(forward)formula 0,1,0.085999,7288,1,0,7,19902,25,0,2427,6546,10
FORMULA NoC3x3-PT-1A-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 205/205 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 151 transition count 205
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 17 place count 136 transition count 190
Iterating global reduction 1 with 15 rules applied. Total rules applied 32 place count 136 transition count 190
Applied a total of 32 rules in 8 ms. Remains 136 /153 variables (removed 17) and now considering 190/205 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14932007518210397716.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7658041179741924005.kers'
[2026-05-25 20:06:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14932007518210397716.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7658041179741924005.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 190 rows 136 cols 619 entries
Finished phase 1 with 102 SingleSign rule and 0 generalized
[2026-05-25 20:06:52] [INFO ] Computed 34 invariants in 1 ms
Computed 34 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7658041179741924005.kers
Total runtime 1 ms.
[2026-05-25 20:06:52] [INFO ] Implicit Places using invariants in 58 ms returned []
[2026-05-25 20:06:52] [INFO ] Invariant cache hit.
[2026-05-25 20:06:52] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Running 189 sub problems to find dead transitions.
[2026-05-25 20:06:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (OVERLAPS) 190/326 variables, 136/170 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (OVERLAPS) 0/326 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 170 constraints, problems are : Problem set: 0 solved, 189 unsolved in 6596 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (OVERLAPS) 190/326 variables, 136/170 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 189/359 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (OVERLAPS) 0/326 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 359 constraints, problems are : Problem set: 0 solved, 189 unsolved in 8804 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15412ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 15413ms
Starting structural reductions in LTL mode, iteration 1 : 136/153 places, 190/205 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15578 ms. Remains : 136/153 places, 190/205 transitions.
[2026-05-25 20:07:08] [INFO ] Flatten gal took : 7 ms
[2026-05-25 20:07:08] [INFO ] Flatten gal took : 7 ms
[2026-05-25 20:07:08] [INFO ] Input system was already deterministic with 190 transitions.
[2026-05-25 20:07:08] [INFO ] Flatten gal took : 6 ms
[2026-05-25 20:07:08] [INFO ] Flatten gal took : 6 ms
[2026-05-25 20:07:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality8586190993511059739.gal : 2 ms
[2026-05-25 20:07:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality7979490849932315760.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/CTLCardinality8586190993511059739.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7979490849932315760.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,5.08373e+19,0.142992,10268,2,371,5,28348,6,0,736,36290,0


Converting to forward existential form...Done !
original formula: AX(E(!(((p142==0)||(p4==1))) U E((E((p62==0) U ((p60==0)||(p30==1))) + !(AX(((p109==0)||(p154==1))))) U AG(((p125==0)||(p151==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(!(((p142==0)||(p4==1))) U E((E((p62==0) U ((p60==0)||(p30==1))) + !(!(EX(!(((p109==0)||(p154==1...216
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 188/0/2
Detected timeout of ITS tools.
[2026-05-25 20:07:38] [INFO ] Flatten gal took : 6 ms
[2026-05-25 20:07:38] [INFO ] Applying decomposition
[2026-05-25 20:07:38] [INFO ] Flatten gal took : 6 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/graph17738821404871169996.txt' '-o' '/tmp/graph17738821404871169996.bin' '-w' '/tmp/graph17738821404871169996.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17738821404871169996.bin' '-l' '-1' '-v' '-w' '/tmp/graph17738821404871169996.weights' '-q' '0' '-e' '0.001'
[2026-05-25 20:07:38] [INFO ] Decomposing Gal with order
[2026-05-25 20:07:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 20:07:38] [INFO ] Removed a total of 32 redundant transitions.
[2026-05-25 20:07:38] [INFO ] Flatten gal took : 11 ms
[2026-05-25 20:07:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 6 ms.
[2026-05-25 20:07:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality9828738294836086281.gal : 3 ms
[2026-05-25 20:07:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality11706294926264194273.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/CTLCardinality9828738294836086281.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11706294926264194273.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.08373e+19,0.088845,7012,130,98,5828,1494,451,6834,110,5013,0


Converting to forward existential form...Done !
original formula: AX(E(!(((i8.u25.p142==0)||(i0.i0.u3.p4==1))) U E((E((u11.p62==0) U ((i4.u10.p60==0)||(i3.u6.p30==1))) + !(AX(((i2.u17.p109==0)||(i8.u27.p...212
=> equivalent forward existential formula: [(EY(Init) * !(E(!(((i8.u25.p142==0)||(i0.i0.u3.p4==1))) U E((E((u11.p62==0) U ((i4.u10.p60==0)||(i3.u6.p30==1))...277
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 205/205 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 152 transition count 205
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 21 place count 132 transition count 185
Iterating global reduction 1 with 20 rules applied. Total rules applied 41 place count 132 transition count 185
Applied a total of 41 rules in 7 ms. Remains 132 /153 variables (removed 21) and now considering 185/205 (removed 20) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5557366676624069392.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13799186002331317318.kers'
[2026-05-25 20:08:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5557366676624069392.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13799186002331317318.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 185 rows 131 cols 599 entries
Finished phase 1 with 97 SingleSign rule and 0 generalized
[2026-05-25 20:08:08] [INFO ] Computed 35 invariants in 0 ms
Computed 35 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13799186002331317318.kers
Total runtime 1 ms.
[2026-05-25 20:08:08] [INFO ] Implicit Places using invariants in 62 ms returned []
[2026-05-25 20:08:08] [INFO ] Invariant cache hit.
[2026-05-25 20:08:08] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2026-05-25 20:08:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (OVERLAPS) 1/132 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (OVERLAPS) 185/317 variables, 132/167 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (OVERLAPS) 0/317 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 167 constraints, problems are : Problem set: 0 solved, 184 unsolved in 7308 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (OVERLAPS) 1/132 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (OVERLAPS) 185/317 variables, 132/167 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 184/351 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (OVERLAPS) 0/317 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 317/317 variables, and 351 constraints, problems are : Problem set: 0 solved, 184 unsolved in 9394 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16716ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 16716ms
Starting structural reductions in LTL mode, iteration 1 : 132/153 places, 185/205 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16905 ms. Remains : 132/153 places, 185/205 transitions.
[2026-05-25 20:08:25] [INFO ] Flatten gal took : 4 ms
[2026-05-25 20:08:25] [INFO ] Flatten gal took : 7 ms
[2026-05-25 20:08:25] [INFO ] Input system was already deterministic with 185 transitions.
[2026-05-25 20:08:25] [INFO ] Flatten gal took : 4 ms
[2026-05-25 20:08:25] [INFO ] Flatten gal took : 4 ms
[2026-05-25 20:08:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality16202465782454009015.gal : 1 ms
[2026-05-25 20:08:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality13823670680570223706.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/CTLCardinality16202465782454009015.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13823670680570223706.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,2.04304e+19,0.111282,9160,2,358,5,23613,6,0,712,29532,0


Converting to forward existential form...Done !
original formula: AG(AF(((p104==0) + ((p10==0) * EX(((p75==0)||(p154==1)))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((p104==0) + ((p10==0) * EX(((p75==0)||(p154==1)))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.176039,9424,1,0,10,23613,18,5,3588,29532,13
FORMULA NoC3x3-PT-1A-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 153/153 places, 205/205 transitions.
Graph (trivial) has 78 edges and 153 vertex of which 42 / 153 are part of one of the 18 SCC in 1 ms
Free SCC test removed 24 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Graph (complete) has 422 edges and 129 vertex of which 127 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 20 place count 109 transition count 139
Iterating global reduction 0 with 18 rules applied. Total rules applied 38 place count 109 transition count 139
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 109 transition count 137
Applied a total of 40 rules in 14 ms. Remains 109 /153 variables (removed 44) and now considering 137/205 (removed 68) transitions.
[2026-05-25 20:08:25] [INFO ] Flow matrix only has 120 transitions (discarded 17 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9995712524146523801.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18013838441527757769.kers'
[2026-05-25 20:08:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9995712524146523801.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18013838441527757769.kers]
Normalized transition count is 119 out of 120 initially.
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 119 rows 103 cols 361 entries
Finished phase 1 with 75 SingleSign rule and 0 generalized
[2026-05-25 20:08:25] [INFO ] Computed 34 invariants in 0 ms
Computed 34 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18013838441527757769.kers
Total runtime 0 ms.
[2026-05-25 20:08:25] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-05-25 20:08:25] [INFO ] Flow matrix only has 120 transitions (discarded 17 similar events)
[2026-05-25 20:08:25] [INFO ] Invariant cache hit.
[2026-05-25 20:08:25] [INFO ] State equation strengthened by 53 read => feed constraints.
[2026-05-25 20:08:25] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2026-05-25 20:08:25] [INFO ] Redundant transitions in 3 ms returned []
Running 136 sub problems to find dead transitions.
[2026-05-25 20:08:25] [INFO ] Flow matrix only has 120 transitions (discarded 17 similar events)
[2026-05-25 20:08:25] [INFO ] Invariant cache hit.
[2026-05-25 20:08:25] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (OVERLAPS) 119/228 variables, 109/143 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 52/195 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 1/229 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (OVERLAPS) 0/229 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 229/229 variables, and 196 constraints, problems are : Problem set: 0 solved, 136 unsolved in 5711 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 109/109 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (OVERLAPS) 119/228 variables, 109/143 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 52/195 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 136/331 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (OVERLAPS) 1/229 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/229 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 9 (OVERLAPS) 0/229 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 229/229 variables, and 332 constraints, problems are : Problem set: 0 solved, 136 unsolved in 6880 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 109/109 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12599ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 12600ms
Starting structural reductions in SI_CTL mode, iteration 1 : 109/153 places, 137/205 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12822 ms. Remains : 109/153 places, 137/205 transitions.
[2026-05-25 20:08:38] [INFO ] Flatten gal took : 7 ms
[2026-05-25 20:08:38] [INFO ] Flatten gal took : 5 ms
[2026-05-25 20:08:38] [INFO ] Input system was already deterministic with 137 transitions.
[2026-05-25 20:08:38] [INFO ] Flatten gal took : 3 ms
[2026-05-25 20:08:38] [INFO ] Flatten gal took : 3 ms
[2026-05-25 20:08:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality497554258494440478.gal : 1 ms
[2026-05-25 20:08:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality671443446749374165.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/CTLCardinality497554258494440478.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality671443446749374165.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 -...281
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,3.1104e+14,0.0702,7124,2,908,5,15162,6,0,545,14914,0


Converting to forward existential form...Done !
original formula: (EF((AF(((p156==0)||(p69==1))) + EF((((p35==0)||(p55==1))&&(p23==1))))) * E((p113==1) U !(AG(EF((p148==1))))))
=> equivalent forward existential formula: [(FwdU(FwdU((Init * E(TRUE U (!(EG(!(((p156==0)||(p69==1))))) + E(TRUE U (((p35==0)||(p55==1))&&(p23==1)))))),(p...205
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 132/0/5
(forward)formula 0,1,1.48699,60684,1,0,15,285137,33,5,3057,304589,20
FORMULA NoC3x3-PT-1A-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 153/153 places, 205/205 transitions.
Graph (trivial) has 83 edges and 153 vertex of which 44 / 153 are part of one of the 19 SCC in 0 ms
Free SCC test removed 25 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Graph (complete) has 420 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 25 rules applied. Total rules applied 27 place count 119 transition count 135
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 41 place count 105 transition count 135
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 60 place count 86 transition count 116
Iterating global reduction 2 with 19 rules applied. Total rules applied 79 place count 86 transition count 116
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 2 with 14 rules applied. Total rules applied 93 place count 86 transition count 102
Applied a total of 93 rules in 17 ms. Remains 86 /153 variables (removed 67) and now considering 102/205 (removed 103) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12809912006387674211.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5928319235464139875.kers'
[2026-05-25 20:08:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12809912006387674211.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5928319235464139875.kers]
Normalized transition count is 101 out of 102 initially.
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 0 ms.
// Phase 1: matrix 101 rows 73 cols 239 entries
Finished phase 1 with 58 SingleSign rule and 0 generalized
[2026-05-25 20:08:39] [INFO ] Computed 28 invariants in 0 ms
Computed 28 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5928319235464139875.kers
Total runtime 0 ms.
[2026-05-25 20:08:40] [INFO ] Implicit Places using invariants in 51 ms returned []
[2026-05-25 20:08:40] [INFO ] Invariant cache hit.
[2026-05-25 20:08:40] [INFO ] State equation strengthened by 26 read => feed constraints.
[2026-05-25 20:08:40] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2026-05-25 20:08:40] [INFO ] Redundant transitions in 29 ms returned []
Running 87 sub problems to find dead transitions.
[2026-05-25 20:08:40] [INFO ] Invariant cache hit.
[2026-05-25 20:08:40] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (OVERLAPS) 101/187 variables, 86/114 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 26/140 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (OVERLAPS) 0/187 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/188 variables, and 140 constraints, problems are : Problem set: 0 solved, 87 unsolved in 1833 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 86/86 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (OVERLAPS) 101/187 variables, 86/114 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 26/140 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 87/227 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (OVERLAPS) 0/187 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/188 variables, and 227 constraints, problems are : Problem set: 0 solved, 87 unsolved in 1891 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 86/86 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3731ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 3731ms
Starting structural reductions in SI_CTL mode, iteration 1 : 86/153 places, 102/205 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3904 ms. Remains : 86/153 places, 102/205 transitions.
[2026-05-25 20:08:43] [INFO ] Flatten gal took : 2 ms
[2026-05-25 20:08:43] [INFO ] Flatten gal took : 3 ms
[2026-05-25 20:08:43] [INFO ] Input system was already deterministic with 102 transitions.
[2026-05-25 20:08:43] [INFO ] Flatten gal took : 1 ms
[2026-05-25 20:08:43] [INFO ] Flatten gal took : 1 ms
[2026-05-25 20:08:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality2360500832689113376.gal : 1 ms
[2026-05-25 20:08:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality10379139370124233469.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/CTLCardinality2360500832689113376.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10379139370124233469.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.73094e+12,0.02595,4948,2,279,5,5044,5,0,447,4551,0


Converting to forward existential form...Done !
original formula: AG(!(E((p132==1) U (p31==1))))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,TRUE),(p132==1)) * (p31==1))] = FALSE
Hit Full ! (commute/partial/dont) 95/0/7
(forward)formula 0,0,0.031275,5212,1,0,8,5044,14,1,827,4551,4
FORMULA NoC3x3-PT-1A-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 205/205 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 151 transition count 205
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 18 place count 135 transition count 189
Iterating global reduction 1 with 16 rules applied. Total rules applied 34 place count 135 transition count 189
Applied a total of 34 rules in 12 ms. Remains 135 /153 variables (removed 18) and now considering 189/205 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7029065813930708552.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11248712902349786441.kers'
[2026-05-25 20:08:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7029065813930708552.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11248712902349786441.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 189 rows 135 cols 615 entries
Finished phase 1 with 101 SingleSign rule and 0 generalized
[2026-05-25 20:08:43] [INFO ] Computed 34 invariants in 0 ms
Computed 34 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11248712902349786441.kers
Total runtime 0 ms.
[2026-05-25 20:08:43] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-05-25 20:08:43] [INFO ] Invariant cache hit.
[2026-05-25 20:08:44] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Running 188 sub problems to find dead transitions.
[2026-05-25 20:08:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (OVERLAPS) 189/324 variables, 135/169 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/324 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (OVERLAPS) 0/324 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Real declared 324/324 variables, and 169 constraints, problems are : Problem set: 0 solved, 188 unsolved in 6657 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 188 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (OVERLAPS) 189/324 variables, 135/169 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/324 variables, 188/357 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (OVERLAPS) 0/324 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Int declared 324/324 variables, and 357 constraints, problems are : Problem set: 0 solved, 188 unsolved in 8705 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15374ms problems are : Problem set: 0 solved, 188 unsolved
Search for dead transitions found 0 dead transitions in 15375ms
Starting structural reductions in LTL mode, iteration 1 : 135/153 places, 189/205 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15545 ms. Remains : 135/153 places, 189/205 transitions.
[2026-05-25 20:08:59] [INFO ] Flatten gal took : 5 ms
[2026-05-25 20:08:59] [INFO ] Flatten gal took : 4 ms
[2026-05-25 20:08:59] [INFO ] Input system was already deterministic with 189 transitions.
[2026-05-25 20:08:59] [INFO ] Flatten gal took : 3 ms
[2026-05-25 20:08:59] [INFO ] Flatten gal took : 3 ms
[2026-05-25 20:08:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality7354079379939241731.gal : 1 ms
[2026-05-25 20:08:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality17284159953542052569.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/CTLCardinality7354079379939241731.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17284159953542052569.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,3.92263e+19,0.139713,9984,2,368,5,27433,6,0,731,34077,0


Converting to forward existential form...Done !
original formula: A(((!(((p88!=1)&&(p162!=1))) * !(AX(!(((p59==0)||(p111==1)))))) * (AX((p113==0)) * AX(((A((p95==1) U (p56==1)) + (((p54==0)||(p7==1))&&((...245
=> equivalent forward existential formula: [((Init * !(EG(!(EG((EX((p59==0)) * EX(!(E(TRUE U !((p3==0))))))))))) * !(E(!(EG((EX((p59==0)) * EX(!(E(TRUE U !...540
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 187/0/2
Hit Full ! (commute/partial/dont) 187/0/2
Using saturation style SCC detection
(forward)formula 0,0,26.6761,830964,1,0,31,2.96417e+06,58,14,3991,6.29513e+06,30
FORMULA NoC3x3-PT-1A-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 205/205 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 151 transition count 205
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 20 place count 133 transition count 187
Iterating global reduction 1 with 18 rules applied. Total rules applied 38 place count 133 transition count 187
Applied a total of 38 rules in 6 ms. Remains 133 /153 variables (removed 20) and now considering 187/205 (removed 18) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9800895765161753606.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3669092760750393051.kers'
[2026-05-25 20:09:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9800895765161753606.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3669092760750393051.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 187 rows 133 cols 607 entries
Finished phase 1 with 99 SingleSign rule and 0 generalized
[2026-05-25 20:09:26] [INFO ] Computed 34 invariants in 1 ms
Computed 34 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3669092760750393051.kers
Total runtime 2 ms.
[2026-05-25 20:09:26] [INFO ] Implicit Places using invariants in 57 ms returned []
[2026-05-25 20:09:26] [INFO ] Invariant cache hit.
[2026-05-25 20:09:26] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
Running 186 sub problems to find dead transitions.
[2026-05-25 20:09:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (OVERLAPS) 187/320 variables, 133/167 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 0/320 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 320/320 variables, and 167 constraints, problems are : Problem set: 0 solved, 186 unsolved in 6205 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (OVERLAPS) 187/320 variables, 133/167 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 186/353 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (OVERLAPS) 0/320 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 320/320 variables, and 353 constraints, problems are : Problem set: 0 solved, 186 unsolved in 8327 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14542ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 14542ms
Starting structural reductions in LTL mode, iteration 1 : 133/153 places, 187/205 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14701 ms. Remains : 133/153 places, 187/205 transitions.
[2026-05-25 20:09:41] [INFO ] Flatten gal took : 4 ms
[2026-05-25 20:09:41] [INFO ] Flatten gal took : 4 ms
[2026-05-25 20:09:41] [INFO ] Input system was already deterministic with 187 transitions.
[2026-05-25 20:09:41] [INFO ] Flatten gal took : 3 ms
[2026-05-25 20:09:41] [INFO ] Flatten gal took : 3 ms
[2026-05-25 20:09:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality8517627236079595210.gal : 1 ms
[2026-05-25 20:09:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality12922540261176172543.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/CTLCardinality8517627236079595210.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12922540261176172543.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.94197e+19,0.132517,9812,2,362,5,26255,6,0,721,33182,0


Converting to forward existential form...Done !
original formula: (EX((p53==1)) + ((AX(AF(((p122==1)&&(p99==0)))) * EF((p16==1))) * (AX((p30==0)) + A((p42==1) U AX((p59==1))))))
=> equivalent forward existential formula: (([FwdG(EY((Init * !(EX((p53==1))))),!(((p122==1)&&(p99==0))))] = FALSE * [((Init * !(EX((p53==1)))) * !(E(TRUE ...341
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,0,0.206558,10060,1,0,19,29099,23,9,3718,33182,18
FORMULA NoC3x3-PT-1A-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 205/205 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 151 transition count 205
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 21 place count 132 transition count 186
Iterating global reduction 1 with 19 rules applied. Total rules applied 40 place count 132 transition count 186
Applied a total of 40 rules in 2 ms. Remains 132 /153 variables (removed 21) and now considering 186/205 (removed 19) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2176851731395343536.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13104227279877360458.kers'
[2026-05-25 20:09:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2176851731395343536.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13104227279877360458.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 186 rows 132 cols 603 entries
Finished phase 1 with 98 SingleSign rule and 0 generalized
[2026-05-25 20:09:41] [INFO ] Computed 34 invariants in 0 ms
Computed 34 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13104227279877360458.kers
Total runtime 1 ms.
[2026-05-25 20:09:41] [INFO ] Implicit Places using invariants in 58 ms returned []
[2026-05-25 20:09:41] [INFO ] Invariant cache hit.
[2026-05-25 20:09:41] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Running 185 sub problems to find dead transitions.
[2026-05-25 20:09:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 186/318 variables, 132/166 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (OVERLAPS) 0/318 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 318/318 variables, and 166 constraints, problems are : Problem set: 0 solved, 185 unsolved in 6346 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 186/318 variables, 132/166 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 185/351 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (OVERLAPS) 0/318 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Int declared 318/318 variables, and 351 constraints, problems are : Problem set: 0 solved, 185 unsolved in 8650 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15006ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 15006ms
Starting structural reductions in LTL mode, iteration 1 : 132/153 places, 186/205 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15164 ms. Remains : 132/153 places, 186/205 transitions.
[2026-05-25 20:09:56] [INFO ] Flatten gal took : 11 ms
[2026-05-25 20:09:56] [INFO ] Flatten gal took : 3 ms
[2026-05-25 20:09:56] [INFO ] Input system was already deterministic with 186 transitions.
[2026-05-25 20:09:56] [INFO ] Flatten gal took : 3 ms
[2026-05-25 20:09:56] [INFO ] Flatten gal took : 3 ms
[2026-05-25 20:09:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality4731332994044947702.gal : 1 ms
[2026-05-25 20:09:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality18304863619880087764.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/CTLCardinality4731332994044947702.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18304863619880087764.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.45165e+19,0.11539,9240,2,359,5,23865,6,0,716,30035,0


Converting to forward existential form...Done !
original formula: EF(AX(EF(((p129==0)||(p44==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(E(TRUE U ((p129==0)||(p44==1)))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.163709,9484,1,0,6,23865,14,0,3414,30035,5
FORMULA NoC3x3-PT-1A-CTLCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 153/153 places, 205/205 transitions.
Graph (trivial) has 83 edges and 153 vertex of which 44 / 153 are part of one of the 19 SCC in 0 ms
Free SCC test removed 25 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Graph (complete) has 420 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 23 rules applied. Total rules applied 25 place count 119 transition count 137
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 37 place count 107 transition count 137
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 54 place count 90 transition count 120
Iterating global reduction 2 with 17 rules applied. Total rules applied 71 place count 90 transition count 120
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 2 with 14 rules applied. Total rules applied 85 place count 90 transition count 106
Applied a total of 85 rules in 10 ms. Remains 90 /153 variables (removed 63) and now considering 106/205 (removed 99) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2493519241516478911.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3407417741818000917.kers'
[2026-05-25 20:09:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2493519241516478911.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3407417741818000917.kers]
Normalized transition count is 105 out of 106 initially.
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 0 ms.
// Phase 1: matrix 105 rows 77 cols 250 entries
Finished phase 1 with 62 SingleSign rule and 0 generalized
[2026-05-25 20:09:56] [INFO ] Computed 28 invariants in 0 ms
Computed 28 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3407417741818000917.kers
Total runtime 2 ms.
[2026-05-25 20:09:56] [INFO ] Implicit Places using invariants in 45 ms returned []
[2026-05-25 20:09:56] [INFO ] Invariant cache hit.
[2026-05-25 20:09:56] [INFO ] State equation strengthened by 26 read => feed constraints.
[2026-05-25 20:09:56] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2026-05-25 20:09:56] [INFO ] Redundant transitions in 31 ms returned []
Running 91 sub problems to find dead transitions.
[2026-05-25 20:09:56] [INFO ] Invariant cache hit.
[2026-05-25 20:09:56] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 105/195 variables, 90/118 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 26/144 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 0/195 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/196 variables, and 144 constraints, problems are : Problem set: 0 solved, 91 unsolved in 2010 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 90/90 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 105/195 variables, 90/118 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 26/144 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 91/235 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 0/195 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/196 variables, and 235 constraints, problems are : Problem set: 0 solved, 91 unsolved in 2071 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 90/90 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4087ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 4087ms
Starting structural reductions in SI_CTL mode, iteration 1 : 90/153 places, 106/205 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4249 ms. Remains : 90/153 places, 106/205 transitions.
[2026-05-25 20:10:00] [INFO ] Flatten gal took : 1 ms
[2026-05-25 20:10:00] [INFO ] Flatten gal took : 1 ms
[2026-05-25 20:10:00] [INFO ] Input system was already deterministic with 106 transitions.
[2026-05-25 20:10:00] [INFO ] Flatten gal took : 2 ms
[2026-05-25 20:10:00] [INFO ] Flatten gal took : 2 ms
[2026-05-25 20:10:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality10259756235568861186.gal : 1 ms
[2026-05-25 20:10:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality8979280059685849018.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/CTLCardinality10259756235568861186.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8979280059685849018.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.93274e+13,0.03398,5256,2,348,5,6484,5,0,467,5865,0


Converting to forward existential form...Done !
original formula: EF(((AG((AF(((p32==0)&&(p129==1))) * (((p9==1)||(p145==0))||(p42==1)))) * (p2==0)) * (p103==1)))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * (p103==1)) * (p2==0)) * !(E(TRUE U !((!(EG(!(((p32==0)&&(p129==1))))) * (((p9==1)||(p145==...184
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.16601,11036,1,0,10,39534,22,3,2297,29013,9
FORMULA NoC3x3-PT-1A-CTLCardinality-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2026-05-25 20:10:01] [INFO ] Flatten gal took : 5 ms
[2026-05-25 20:10:01] [INFO ] Flatten gal took : 4 ms
[2026-05-25 20:10:01] [INFO ] Applying decomposition
[2026-05-25 20:10:01] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph14025584595299105817.txt' '-o' '/tmp/graph14025584595299105817.bin' '-w' '/tmp/graph14025584595299105817.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14025584595299105817.bin' '-l' '-1' '-v' '-w' '/tmp/graph14025584595299105817.weights' '-q' '0' '-e' '0.001'
[2026-05-25 20:10:01] [INFO ] Decomposing Gal with order
[2026-05-25 20:10:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 20:10:01] [INFO ] Removed a total of 37 redundant transitions.
[2026-05-25 20:10:01] [INFO ] Flatten gal took : 8 ms
[2026-05-25 20:10:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 3 ms.
[2026-05-25 20:10:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality14862030324309077275.gal : 2 ms
[2026-05-25 20:10:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality17952079213894867087.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/CTLCardinality14862030324309077275.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17952079213894867087.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 2 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,6.37736e+20,1.0881,44184,563,232,89148,8034,514,118559,144,48413,0


Converting to forward existential form...Done !
original formula: EG(AX(E(!(((i9.u23.p158!=1) * EG((i1.u4.p100==0)))) U (i4.u1.p5==1))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(E(!(((i9.u23.p158!=1) * EG((i1.u4.p100==0)))) U (i4.u1.p5==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t65, t90, t117, t136, t147, t185, u5.t101, u5.t102, u16.t66, u16.t67, u16.t167, u16.t169, u24...565
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Detected timeout of ITS tools.
[2026-05-25 20:31:48] [INFO ] Applying decomposition
[2026-05-25 20:31:48] [INFO ] Flatten gal took : 4 ms
[2026-05-25 20:31:48] [INFO ] Decomposing Gal with order
[2026-05-25 20:31:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 20:31:48] [INFO ] Removed a total of 64 redundant transitions.
[2026-05-25 20:31:48] [INFO ] Flatten gal took : 10 ms
[2026-05-25 20:31:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 2 ms.
[2026-05-25 20:31:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality3801848210233823414.gal : 1 ms
[2026-05-25 20:31:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality9444540822803522317.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/CTLCardinality3801848210233823414.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9444540822803522317.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 2 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,6.37736e+20,0.180087,13692,282,56,18920,514,374,32850,70,2738,0


Converting to forward existential form...Done !
original formula: EG(AX(E(!(((u38.p158!=1) * EG((u23.p100==0)))) U (u1.p5==1))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(E(!(((u38.p158!=1) * EG((u23.p100==0)))) U (u1.p5==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t34, t50, t65, t66, t67, t90, t104, t117, t136, t146, t147, t156, t157, t185, t201, u4.t121, ...474
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Detected timeout of ITS tools.
[2026-05-25 20:53:35] [INFO ] Flatten gal took : 7 ms
[2026-05-25 20:53:35] [INFO ] Input system was already deterministic with 205 transitions.
[2026-05-25 20:53:35] [INFO ] Transformed 153 places.
[2026-05-25 20:53:35] [INFO ] Transformed 205 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2026-05-25 20:53:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality2464388606886962752.gal : 1 ms
[2026-05-25 20:53:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality11877771917629979584.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/CTLCardinality2464388606886962752.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11877771917629979584.ctl' '--load-order' '/home/mcc/execution/model.ord' '--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 -...329
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 2 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,6.37736e+20,5.7316,170844,2,15859,5,902702,6,0,813,820762,0


Converting to forward existential form...Done !
original formula: EG(AX(E(!(((p158!=1) * EG((p100==0)))) U (p5==1))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(E(!(((p158!=1) * EG((p100==0)))) U (p5==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t32, t33, t34, t47, t48, t50, t65, t66, t67, t87, t88, t90, t94, t95, t101, t102, t104, t115,...382

BK_TIME_CONFINEMENT_REACHED

--------------------
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="NoC3x3-PT-1A"
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 NoC3x3-PT-1A, 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-177969914000257"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-1A.tgz
mv NoC3x3-PT-1A 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 ;