About the Execution of ITS-Tools for HexagonalGrid-PT-110
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 435.384 | 6466.00 | 15700.00 | 40.00 | FTTFTFFTTFFFFTTF | normal |
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.r146-tall-177961074300673.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 HexagonalGrid-PT-110, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074300673
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 6.1K Mar 7 13:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Mar 7 13:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Mar 7 13:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Mar 7 13:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Mar 15 10:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 10:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 15 10:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 10:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 7 13:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Mar 7 13:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 7 13:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Mar 7 13:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rwxr-xr-x 1 mcc users 29K 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 HexagonalGrid-PT-110-CTLCardinality-2024-00
FORMULA_NAME HexagonalGrid-PT-110-CTLCardinality-2024-01
FORMULA_NAME HexagonalGrid-PT-110-CTLCardinality-2024-02
FORMULA_NAME HexagonalGrid-PT-110-CTLCardinality-2024-03
FORMULA_NAME HexagonalGrid-PT-110-CTLCardinality-2024-04
FORMULA_NAME HexagonalGrid-PT-110-CTLCardinality-2024-05
FORMULA_NAME HexagonalGrid-PT-110-CTLCardinality-2024-06
FORMULA_NAME HexagonalGrid-PT-110-CTLCardinality-2024-07
FORMULA_NAME HexagonalGrid-PT-110-CTLCardinality-2024-08
FORMULA_NAME HexagonalGrid-PT-110-CTLCardinality-2024-09
FORMULA_NAME HexagonalGrid-PT-110-CTLCardinality-2024-10
FORMULA_NAME HexagonalGrid-PT-110-CTLCardinality-2024-11
FORMULA_NAME HexagonalGrid-PT-110-CTLCardinality-2024-12
FORMULA_NAME HexagonalGrid-PT-110-CTLCardinality-2024-13
FORMULA_NAME HexagonalGrid-PT-110-CTLCardinality-2024-14
FORMULA_NAME HexagonalGrid-PT-110-CTLCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1779738575983
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HexagonalGrid-PT-110
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-25 19:49:37] [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 19:49:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 19:49:37] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2026-05-25 19:49:37] [INFO ] Transformed 31 places.
[2026-05-25 19:49:37] [INFO ] Transformed 42 transitions.
[2026-05-25 19:49:37] [INFO ] Parsed PT model containing 31 places and 42 transitions and 168 arcs in 142 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 12 ms.
Initial state reduction rules removed 1 formulas.
FORMULA HexagonalGrid-PT-110-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 7 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4153478810582079694.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15478922228155548204.kers'
[2026-05-25 19:49:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4153478810582079694.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15478922228155548204.kers]
Culling duplicate invariants (modulo rational): removing 12 columns.
Culled 12 columns in 0 ms.
// Phase 1: matrix 42 rows 19 cols 120 entries
Finished phase 1 with 17 SingleSign rule and 0 generalized
[2026-05-25 19:49:37] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15478922228155548204.kers
Total runtime 1 ms.
[2026-05-25 19:49:37] [INFO ] Implicit Places using invariants in 159 ms returned []
[2026-05-25 19:49:37] [INFO ] Invariant cache hit.
[2026-05-25 19:49:37] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
Running 36 sub problems to find dead transitions.
[2026-05-25 19:49:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 12/31 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 42/73 variables, 31/45 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 0/73 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 73/73 variables, and 45 constraints, problems are : Problem set: 0 solved, 36 unsolved in 648 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 12/31 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 42/73 variables, 31/45 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 36/81 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 0/73 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 73/73 variables, and 81 constraints, problems are : Problem set: 0 solved, 36 unsolved in 857 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1561ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 1574ms
Finished structural reductions in LTL mode , in 1 iterations and 1873 ms. Remains : 31/31 places, 42/42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 0 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2026-05-25 19:49:39] [INFO ] Invariant cache hit.
[2026-05-25 19:49:39] [INFO ] Implicit Places using invariants in 25 ms returned []
[2026-05-25 19:49:39] [INFO ] Invariant cache hit.
[2026-05-25 19:49:39] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 59 ms. Remains : 31/31 places, 42/42 transitions.
Support contains 29 out of 31 places after structural reductions.
[2026-05-25 19:49:39] [INFO ] Flatten gal took : 20 ms
[2026-05-25 19:49:39] [INFO ] Flatten gal took : 9 ms
[2026-05-25 19:49:39] [INFO ] Input system was already deterministic with 42 transitions.
RANDOM walk for 40000 steps (8 resets) in 1236 ms. (32 steps per ms) remains 8/47 properties
BEST_FIRST walk for 40002 steps (8 resets) in 187 ms. (212 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 150 ms. (264 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 129 ms. (307 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 326 ms. (122 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 170 ms. (233 steps per ms) remains 8/8 properties
[2026-05-25 19:49:40] [INFO ] Invariant cache hit.
Problem AtomicPropp11 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp46 is UNSAT
At refinement iteration 2 (OVERLAPS) 16/25 variables, 7/8 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 6/31 variables, 6/14 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/14 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 42/73 variables, 31/45 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 0/45 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/73 variables, 0/45 constraints. Problems are: Problem set: 7 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 73/73 variables, and 45 constraints, problems are : Problem set: 7 solved, 1 unsolved in 60 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 1 unsolved
Problem AtomicPropp45 is UNSAT
After SMT solving in domain Int declared 2/73 variables, and 0 constraints, problems are : Problem set: 8 solved, 0 unsolved in 15 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, State Equation: 0/31 constraints, PredecessorRefiner: 0/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 81ms problems are : Problem set: 8 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 8 atomic propositions for a total of 15 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA HexagonalGrid-PT-110-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HexagonalGrid-PT-110-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 19:49:40] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-05-25 19:49:40] [INFO ] Flatten gal took : 10 ms
FORMULA HexagonalGrid-PT-110-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 19:49:40] [INFO ] Flatten gal took : 9 ms
[2026-05-25 19:49:40] [INFO ] Input system was already deterministic with 42 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 3 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2026-05-25 19:49:40] [INFO ] Invariant cache hit.
[2026-05-25 19:49:40] [INFO ] Implicit Places using invariants in 38 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 41 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 30/31 places, 42/42 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 30 transition count 39
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 24 transition count 39
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 9 place count 24 transition count 36
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 18 transition count 36
Graph (trivial) has 9 edges and 18 vertex of which 3 / 18 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 16 transition count 36
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 36 place count 16 transition count 19
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 40 place count 16 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 43 place count 14 transition count 14
Applied a total of 43 rules in 20 ms. Remains 14 /30 variables (removed 16) and now considering 14/42 (removed 28) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4948032815330517134.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7698642546949044869.kers'
[2026-05-25 19:49:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4948032815330517134.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7698642546949044869.kers]
Normalized transition count is 13 out of 14 initially.
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 13 rows 9 cols 26 entries
Finished phase 1 with 8 SingleSign rule and 0 generalized
[2026-05-25 19:49:40] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7698642546949044869.kers
Total runtime 0 ms.
[2026-05-25 19:49:40] [INFO ] Implicit Places using invariants in 20 ms returned []
[2026-05-25 19:49:40] [INFO ] Invariant cache hit.
[2026-05-25 19:49:40] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 14/31 places, 14/42 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 111 ms. Remains : 14/31 places, 14/42 transitions.
[2026-05-25 19:49:40] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:49:40] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:49:40] [INFO ] Input system was already deterministic with 14 transitions.
[2026-05-25 19:49:40] [INFO ] Flatten gal took : 1 ms
[2026-05-25 19:49:40] [INFO ] Flatten gal took : 1 ms
[2026-05-25 19:49:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality12882544270764594020.gal : 1 ms
[2026-05-25 19:49:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality18219608379977926750.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/CTLCardinality12882544270764594020.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18219608379977926750.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,968,0.01118,3844,2,78,5,608,6,0,72,521,0
Converting to forward existential form...Done !
original formula: EF(!(E(E(EF((pil4_1_1>=1)) U ((po1_1_1<1)||(pb4_1_1>0))) U (!(EG((pi1_1_1<=pol6_1_1))) * !(EG((pb1_1_1>=1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(E(E(TRUE U (pil4_1_1>=1)) U ((po1_1_1<1)||(pb4_1_1>0))) U (!(EG((pi1_1_1<=pol6_1_1))) * ...188
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.020352,4548,1,0,12,2402,31,3,364,2149,16
FORMULA HexagonalGrid-PT-110-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12728428577171312820.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5052618321499547201.kers'
[2026-05-25 19:49:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12728428577171312820.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5052618321499547201.kers]
Culling duplicate invariants (modulo rational): removing 12 columns.
Culled 12 columns in 0 ms.
// Phase 1: matrix 42 rows 19 cols 120 entries
Finished phase 1 with 17 SingleSign rule and 0 generalized
[2026-05-25 19:49:40] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5052618321499547201.kers
Total runtime 1 ms.
[2026-05-25 19:49:40] [INFO ] Implicit Places using invariants in 33 ms returned []
[2026-05-25 19:49:40] [INFO ] Invariant cache hit.
[2026-05-25 19:49:40] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 73 ms. Remains : 31/31 places, 42/42 transitions.
[2026-05-25 19:49:40] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:49:40] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:49:40] [INFO ] Input system was already deterministic with 42 transitions.
[2026-05-25 19:49:40] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:49:40] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:49:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality15935614769062929140.gal : 1 ms
[2026-05-25 19:49:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality12366503614466674986.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/CTLCardinality15935614769062929140.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12366503614466674986.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,40193,0.035363,5476,2,377,5,8491,6,0,169,8100,0
Converting to forward existential form...Done !
original formula: A((EG(A((pbl_1_1<1) U ((((pb1_1_1<=pb3_1_1)&&(pil2_1_1<=1))||(pil2_1_1<=0))||(pi4_1_1>=1)))) * !((AF(((pi2_1_1>1)||(pil3_1_1>pbl_1_1))) +...296
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !(E(TRUE U !((po2_1_1<=pi2_1_1)))))))))) * !(E(!(!(E(TRUE U !(E(TRUE U !((po2_1_1<=p...821
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.09089,7068,1,0,6,14259,28,1,991,14926,7
FORMULA HexagonalGrid-PT-110-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 5 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2026-05-25 19:49:40] [INFO ] Invariant cache hit.
[2026-05-25 19:49:40] [INFO ] Implicit Places using invariants in 66 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 67 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 30/31 places, 42/42 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 30 transition count 38
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 22 transition count 38
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 12 place count 22 transition count 34
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 14 transition count 34
Graph (trivial) has 20 edges and 14 vertex of which 4 / 14 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
Iterating global reduction 0 with 1 rules applied. Total rules applied 25 place count 11 transition count 34
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 48 place count 11 transition count 11
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 11 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 53 place count 9 transition count 8
Applied a total of 53 rules in 3 ms. Remains 9 /30 variables (removed 21) and now considering 8/42 (removed 34) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1021380128323126757.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10480941749089639250.kers'
[2026-05-25 19:49:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1021380128323126757.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10480941749089639250.kers]
Normalized transition count is 7 out of 8 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 7 rows 6 cols 14 entries
Finished phase 1 with 5 SingleSign rule and 0 generalized
[2026-05-25 19:49:40] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10480941749089639250.kers
Total runtime 0 ms.
[2026-05-25 19:49:40] [INFO ] Implicit Places using invariants in 25 ms returned []
[2026-05-25 19:49:40] [INFO ] Invariant cache hit.
[2026-05-25 19:49:40] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 9/31 places, 8/42 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 125 ms. Remains : 9/31 places, 8/42 transitions.
[2026-05-25 19:49:40] [INFO ] Flatten gal took : 1 ms
[2026-05-25 19:49:40] [INFO ] Flatten gal took : 1 ms
[2026-05-25 19:49:40] [INFO ] Input system was already deterministic with 8 transitions.
[2026-05-25 19:49:40] [INFO ] Flatten gal took : 1 ms
[2026-05-25 19:49:40] [INFO ] Flatten gal took : 5 ms
[2026-05-25 19:49:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality13461085857053688183.gal : 0 ms
[2026-05-25 19:49:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality9900521197909942346.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/CTLCardinality13461085857053688183.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9900521197909942346.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,146,0.002789,3844,2,37,5,302,6,0,46,245,0
Converting to forward existential form...Done !
original formula: AG(EF((((pol6_1_1>0)&&(po1_1_1<=1))&&((pi1_1_1<=0)||(pol1_1_1<=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((pol6_1_1>0)&&(po1_1_1<=1))&&((pi1_1_1<=0)||(pol1_1_1<=1))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.004999,4120,1,0,6,453,14,0,215,344,5
FORMULA HexagonalGrid-PT-110-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4012266197728510979.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13616804506435581254.kers'
[2026-05-25 19:49:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4012266197728510979.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13616804506435581254.kers]
Culling duplicate invariants (modulo rational): removing 12 columns.
Culled 12 columns in 0 ms.
// Phase 1: matrix 42 rows 19 cols 120 entries
Finished phase 1 with 17 SingleSign rule and 0 generalized
[2026-05-25 19:49:41] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13616804506435581254.kers
Total runtime 2 ms.
[2026-05-25 19:49:41] [INFO ] Implicit Places using invariants in 61 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 62 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 30/31 places, 42/42 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 30 transition count 40
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 26 transition count 40
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 6 place count 26 transition count 38
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 22 transition count 38
Graph (trivial) has 4 edges and 22 vertex of which 2 / 22 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 21 transition count 38
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 22 place count 21 transition count 29
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 32 place count 21 transition count 19
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 9 rules applied. Total rules applied 41 place count 15 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1 rules applied. Total rules applied 42 place count 15 transition count 15
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 44 place count 13 transition count 15
Applied a total of 44 rules in 4 ms. Remains 13 /30 variables (removed 17) and now considering 15/42 (removed 27) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1211193428671492276.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14429501744357061743.kers'
[2026-05-25 19:49:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1211193428671492276.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14429501744357061743.kers]
Normalized transition count is 14 out of 15 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 14 rows 9 cols 28 entries
Finished phase 1 with 8 SingleSign rule and 0 generalized
[2026-05-25 19:49:41] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14429501744357061743.kers
Total runtime 0 ms.
[2026-05-25 19:49:41] [INFO ] Implicit Places using invariants in 18 ms returned []
[2026-05-25 19:49:41] [INFO ] Invariant cache hit.
[2026-05-25 19:49:41] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 13/31 places, 15/42 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 111 ms. Remains : 13/31 places, 15/42 transitions.
[2026-05-25 19:49:41] [INFO ] Flatten gal took : 1 ms
[2026-05-25 19:49:41] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:49:41] [INFO ] Input system was already deterministic with 15 transitions.
[2026-05-25 19:49:41] [INFO ] Flatten gal took : 1 ms
[2026-05-25 19:49:41] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:49:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality3789835832960655662.gal : 1 ms
[2026-05-25 19:49:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality3751074688355647511.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/CTLCardinality3789835832960655662.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3751074688355647511.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,1289,0.005243,4000,2,94,5,803,6,0,69,746,0
Converting to forward existential form...Done !
original formula: EF(AG((((pb6_1_1<=0)||(pi4_1_1<=pol5_1_1))||((pb2_1_1<=po2_1_1)||((pb4_1_1<=1)&&(po5_1_1>1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((((pb6_1_1<=0)||(pi4_1_1<=pol5_1_1))||((pb2_1_1<=po2_1_1)||((pb4_1_1<=1)&&(po5_...178
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.012806,4272,1,0,6,2199,15,0,343,1651,5
FORMULA HexagonalGrid-PT-110-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 0 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1553377701765599233.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14552281338629530496.kers'
[2026-05-25 19:49:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1553377701765599233.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14552281338629530496.kers]
Culling duplicate invariants (modulo rational): removing 12 columns.
Culled 12 columns in 0 ms.
// Phase 1: matrix 42 rows 19 cols 120 entries
Finished phase 1 with 17 SingleSign rule and 0 generalized
[2026-05-25 19:49:41] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14552281338629530496.kers
Total runtime 2 ms.
[2026-05-25 19:49:41] [INFO ] Implicit Places using invariants in 41 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 42 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/31 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 44 ms. Remains : 30/31 places, 42/42 transitions.
[2026-05-25 19:49:41] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:49:41] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:49:41] [INFO ] Input system was already deterministic with 42 transitions.
[2026-05-25 19:49:41] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:49:41] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:49:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality11809819210927047895.gal : 1 ms
[2026-05-25 19:49:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality5525873456738859859.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/CTLCardinality11809819210927047895.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5525873456738859859.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,40193,0.024884,5044,2,210,5,6578,6,0,165,5448,0
Converting to forward existential form...Done !
original formula: AG(E(EX(E(((pil1_1_1>=1)&&(po6_1_1<=pol2_1_1)) U (pil4_1_1>0))) U (!(AF((pb2_1_1<=1))) * EG(AX((pi5_1_1<=0))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(EX(E(((pil1_1_1>=1)&&(po6_1_1<=pol2_1_1)) U (pil4_1_1>0))) U (!(!(EG(!((pb2_1_1<=1))))) ...196
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 32/7/10
Using saturation style SCC detection
(forward)formula 0,1,0.119175,9116,1,0,15,30650,38,2,929,25495,16
FORMULA HexagonalGrid-PT-110-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 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2026-05-25 19:49:41] [INFO ] Invariant cache hit.
[2026-05-25 19:49:41] [INFO ] Implicit Places using invariants in 32 ms returned []
[2026-05-25 19:49:41] [INFO ] Invariant cache hit.
[2026-05-25 19:49:41] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 91 ms. Remains : 31/31 places, 42/42 transitions.
[2026-05-25 19:49:41] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:49:41] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:49:41] [INFO ] Input system was already deterministic with 42 transitions.
[2026-05-25 19:49:41] [INFO ] Flatten gal took : 6 ms
[2026-05-25 19:49:41] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:49:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality608920425515810205.gal : 1 ms
[2026-05-25 19:49:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality17615206406674679355.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/CTLCardinality608920425515810205.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17615206406674679355.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,40193,0.035048,5468,2,377,5,8491,6,0,169,8100,0
Converting to forward existential form...Done !
original formula: EX(EF((A(A((pi4_1_1>=1) U (pil3_1_1<=po6_1_1)) U AG((po5_1_1>=1))) * (EG((pbl_1_1>1)) + EX((pi3_1_1>=1))))))
=> equivalent forward existential formula: ([FwdG((FwdU(EY(Init),TRUE) * !((E(!(!(E(TRUE U !((po5_1_1>=1))))) U (!(!((E(!((pil3_1_1<=po6_1_1)) U (!((pi4_1_...603
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 34/0/8
(forward)formula 0,0,0.080242,6844,1,0,12,11935,39,2,1021,12746,17
FORMULA HexagonalGrid-PT-110-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2026-05-25 19:49:41] [INFO ] Invariant cache hit.
[2026-05-25 19:49:41] [INFO ] Implicit Places using invariants in 34 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/31 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 39 ms. Remains : 30/31 places, 42/42 transitions.
[2026-05-25 19:49:41] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:49:41] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:49:41] [INFO ] Input system was already deterministic with 42 transitions.
[2026-05-25 19:49:41] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:49:41] [INFO ] Flatten gal took : 1 ms
[2026-05-25 19:49:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality5779565422720756146.gal : 0 ms
[2026-05-25 19:49:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality12296582494708102732.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/CTLCardinality5779565422720756146.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12296582494708102732.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,40193,0.024784,5044,2,210,5,6578,6,0,165,5448,0
Converting to forward existential form...Done !
original formula: E((pol1_1_1<=0) U ((pil3_1_1<=pi3_1_1) + AG(((EX((pol6_1_1>=1)) + (((po1_1_1>=1)||(pi5_1_1<=pb5_1_1))&&(pol2_1_1>po5_1_1))) + (pi6_1_1<=p...167
=> equivalent forward existential formula: ([(FwdU(Init,(pol1_1_1<=0)) * (pil3_1_1<=pi3_1_1))] != FALSE + [(FwdU(Init,(pol1_1_1<=0)) * !(E(TRUE U !(((EX((p...265
Hit Full ! (commute/partial/dont) 40/0/2
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.078328,6992,1,0,15,17949,24,4,811,13942,12
FORMULA HexagonalGrid-PT-110-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2026-05-25 19:49:41] [INFO ] Invariant cache hit.
[2026-05-25 19:49:41] [INFO ] Implicit Places using invariants in 34 ms returned []
[2026-05-25 19:49:41] [INFO ] Invariant cache hit.
[2026-05-25 19:49:41] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 70 ms. Remains : 31/31 places, 42/42 transitions.
[2026-05-25 19:49:41] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:49:41] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:49:41] [INFO ] Input system was already deterministic with 42 transitions.
[2026-05-25 19:49:41] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:49:41] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:49:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality1235790946646621897.gal : 1 ms
[2026-05-25 19:49:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality7305958394665216721.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/CTLCardinality1235790946646621897.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7305958394665216721.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,40193,0.039362,5452,2,377,5,8491,6,0,169,8100,0
Converting to forward existential form...Done !
original formula: (!(A((pil4_1_1>=1) U (pbl_1_1<=1))) + EX(((pol1_1_1<=pb4_1_1) * EG((po2_1_1>0)))))
=> equivalent forward existential formula: (([(FwdU(Init,!((pbl_1_1<=1))) * (!((pil4_1_1>=1)) * !((pbl_1_1<=1))))] != FALSE + [FwdG(Init,!((pbl_1_1<=1)))] ...229
Hit Full ! (commute/partial/dont) 6/0/36
Hit Full ! (commute/partial/dont) 40/0/2
(forward)formula 0,1,0.086092,6780,1,0,16,13747,37,6,1003,13718,15
FORMULA HexagonalGrid-PT-110-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 0 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2026-05-25 19:49:41] [INFO ] Invariant cache hit.
[2026-05-25 19:49:41] [INFO ] Implicit Places using invariants in 39 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 40 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/31 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41 ms. Remains : 30/31 places, 42/42 transitions.
[2026-05-25 19:49:41] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:49:41] [INFO ] Flatten gal took : 1 ms
[2026-05-25 19:49:41] [INFO ] Input system was already deterministic with 42 transitions.
[2026-05-25 19:49:41] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:49:41] [INFO ] Flatten gal took : 1 ms
[2026-05-25 19:49:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality14486118131482486972.gal : 0 ms
[2026-05-25 19:49:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality13558773738781223692.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/CTLCardinality14486118131482486972.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13558773738781223692.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,40193,0.025645,5048,2,210,5,6578,6,0,165,5448,0
Converting to forward existential form...Done !
original formula: EX(AF((pil6_1_1<=0)))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!((pil6_1_1<=0)))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.04324,5308,1,0,9,7211,19,2,807,5980,7
FORMULA HexagonalGrid-PT-110-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2026-05-25 19:49:41] [INFO ] Invariant cache hit.
[2026-05-25 19:49:42] [INFO ] Implicit Places using invariants in 40 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 41 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/31 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43 ms. Remains : 30/31 places, 42/42 transitions.
[2026-05-25 19:49:42] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:49:42] [INFO ] Flatten gal took : 1 ms
[2026-05-25 19:49:42] [INFO ] Input system was already deterministic with 42 transitions.
[2026-05-25 19:49:42] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:49:42] [INFO ] Flatten gal took : 1 ms
[2026-05-25 19:49:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality8449268240780802368.gal : 1 ms
[2026-05-25 19:49:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality6708904243470146030.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/CTLCardinality8449268240780802368.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6708904243470146030.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,40193,0.027688,5040,2,210,5,6578,6,0,165,5448,0
Converting to forward existential form...Done !
original formula: AX((pb5_1_1>0))
=> equivalent forward existential formula: [(EY(Init) * !((pb5_1_1>0)))] = FALSE
(forward)formula 0,0,0.02889,5296,1,0,10,6578,9,2,255,5448,2
FORMULA HexagonalGrid-PT-110-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 3 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2026-05-25 19:49:42] [INFO ] Invariant cache hit.
[2026-05-25 19:49:42] [INFO ] Implicit Places using invariants in 33 ms returned []
[2026-05-25 19:49:42] [INFO ] Invariant cache hit.
[2026-05-25 19:49:42] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2026-05-25 19:49:42] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_CTL mode , in 1 iterations and 82 ms. Remains : 31/31 places, 42/42 transitions.
[2026-05-25 19:49:42] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:49:42] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:49:42] [INFO ] Input system was already deterministic with 42 transitions.
[2026-05-25 19:49:42] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:49:42] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:49:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality13328732757474007385.gal : 0 ms
[2026-05-25 19:49:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality14654128445662322592.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/CTLCardinality13328732757474007385.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14654128445662322592.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,40193,0.038167,5468,2,377,5,8491,6,0,169,8100,0
Converting to forward existential form...Done !
original formula: EG(EF(AG(!(E((pbl_1_1<=pil2_1_1) U (pb4_1_1<=pol5_1_1))))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U !(E(TRUE U !(!(E((pbl_1_1<=pil2_1_1) U (pb4_1_1<=pol5_1_1))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 5/0/37
(forward)formula 0,0,0.119658,7800,1,0,8,19400,27,0,1019,18294,10
FORMULA HexagonalGrid-PT-110-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 5 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2026-05-25 19:49:42] [INFO ] Invariant cache hit.
[2026-05-25 19:49:42] [INFO ] Implicit Places using invariants in 48 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 49 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 30/31 places, 42/42 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 30 transition count 37
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 15 rules applied. Total rules applied 15 place count 20 transition count 37
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 15 place count 20 transition count 35
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 21 place count 16 transition count 35
Graph (trivial) has 8 edges and 16 vertex of which 2 / 16 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 15 transition count 35
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 31 place count 15 transition count 26
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 1 with 9 rules applied. Total rules applied 40 place count 15 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 43 place count 13 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1 rules applied. Total rules applied 44 place count 13 transition count 15
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 46 place count 11 transition count 15
Applied a total of 46 rules in 4 ms. Remains 11 /30 variables (removed 19) and now considering 15/42 (removed 27) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15093642247961246503.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3972769228131755872.kers'
[2026-05-25 19:49:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15093642247961246503.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3972769228131755872.kers]
Normalized transition count is 14 out of 15 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 14 rows 8 cols 28 entries
Finished phase 1 with 7 SingleSign rule and 0 generalized
[2026-05-25 19:49:42] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3972769228131755872.kers
Total runtime 0 ms.
[2026-05-25 19:49:42] [INFO ] Implicit Places using invariants in 18 ms returned []
[2026-05-25 19:49:42] [INFO ] Invariant cache hit.
[2026-05-25 19:49:42] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 11/31 places, 15/42 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 97 ms. Remains : 11/31 places, 15/42 transitions.
[2026-05-25 19:49:42] [INFO ] Flatten gal took : 1 ms
[2026-05-25 19:49:42] [INFO ] Flatten gal took : 1 ms
[2026-05-25 19:49:42] [INFO ] Input system was already deterministic with 15 transitions.
[2026-05-25 19:49:42] [INFO ] Flatten gal took : 1 ms
[2026-05-25 19:49:42] [INFO ] Flatten gal took : 1 ms
[2026-05-25 19:49:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality17879505724505036220.gal : 0 ms
[2026-05-25 19:49:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality2869555746843297030.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/CTLCardinality17879505724505036220.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2869555746843297030.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,833,0.003793,3912,2,74,5,520,6,0,61,418,0
Converting to forward existential form...Done !
original formula: EF(!(E((EF((pi6_1_1>pb1_1_1)) + !(AF((pi5_1_1<=0)))) U (pil4_1_1<=pb1_1_1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E((E(TRUE U (pi6_1_1>pb1_1_1)) + !(!(EG(!((pi5_1_1<=0)))))) U (pil4_1_1<=pb1_1_1))))] != F...159
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.010044,4468,1,0,9,1434,25,1,321,1139,12
FORMULA HexagonalGrid-PT-110-CTLCardinality-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
[2026-05-25 19:49:42] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:49:42] [INFO ] Flatten gal took : 2 ms
Total runtime 5305 ms.
BK_STOP 1779738582449
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
++ perl -pe 's/.*\.//g'
+ 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="HexagonalGrid-PT-110"
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 HexagonalGrid-PT-110, 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 r146-tall-177961074300673"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HexagonalGrid-PT-110.tgz
mv HexagonalGrid-PT-110 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 '
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 ;