About the Execution of ITS-Tools for DoubleExponent-PT-001
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 434.348 | 14531.00 | 25396.00 | 984.30 | TTFFFFTTTTFTFTFF | 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.r098-tall-177955695800849.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 DoubleExponent-PT-001, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-tall-177955695800849
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 6.6K Mar 6 16:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Mar 6 16:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Mar 6 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 6 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 09:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 09:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 09:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 09:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 6 16:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Mar 6 16:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Mar 6 16:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Mar 6 16:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 09:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:35 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
-rw-r--r-- 1 mcc users 17K 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 DoubleExponent-PT-001-CTLCardinality-2024-00
FORMULA_NAME DoubleExponent-PT-001-CTLCardinality-2024-01
FORMULA_NAME DoubleExponent-PT-001-CTLCardinality-2024-02
FORMULA_NAME DoubleExponent-PT-001-CTLCardinality-2024-03
FORMULA_NAME DoubleExponent-PT-001-CTLCardinality-2024-04
FORMULA_NAME DoubleExponent-PT-001-CTLCardinality-2024-05
FORMULA_NAME DoubleExponent-PT-001-CTLCardinality-2024-06
FORMULA_NAME DoubleExponent-PT-001-CTLCardinality-2024-07
FORMULA_NAME DoubleExponent-PT-001-CTLCardinality-2024-08
FORMULA_NAME DoubleExponent-PT-001-CTLCardinality-2024-09
FORMULA_NAME DoubleExponent-PT-001-CTLCardinality-2024-10
FORMULA_NAME DoubleExponent-PT-001-CTLCardinality-2024-11
FORMULA_NAME DoubleExponent-PT-001-CTLCardinality-2024-12
FORMULA_NAME DoubleExponent-PT-001-CTLCardinality-2024-13
FORMULA_NAME DoubleExponent-PT-001-CTLCardinality-2024-14
FORMULA_NAME DoubleExponent-PT-001-CTLCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1779675518935
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-001
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-25 02:18:40] [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 02:18:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 02:18:40] [INFO ] Load time of PNML (sax parser for PT used): 38 ms
[2026-05-25 02:18:40] [INFO ] Transformed 57 places.
[2026-05-25 02:18:40] [INFO ] Transformed 48 transitions.
[2026-05-25 02:18:40] [INFO ] Parsed PT model containing 57 places and 48 transitions and 135 arcs in 125 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Initial state reduction rules removed 1 formulas.
FORMULA DoubleExponent-PT-001-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 54 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 48/48 transitions.
Applied a total of 0 rules in 9 ms. Remains 57 /57 variables (removed 0) and now considering 48/48 (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-15518290669732294738.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3618034682790803620.kers'
[2026-05-25 02:18:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15518290669732294738.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3618034682790803620.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 48 rows 57 cols 135 entries
Finished phase 1 with 41 SingleSign rule and 7 generalized
[2026-05-25 02:18:40] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-3618034682790803620.kers
Total runtime 4 ms.
[2026-05-25 02:18:40] [INFO ] Implicit Places using invariants in 214 ms returned []
[2026-05-25 02:18:40] [INFO ] Invariant cache hit.
[2026-05-25 02:18:40] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
Running 47 sub problems to find dead transitions.
[2026-05-25 02:18:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 2/54 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (OVERLAPS) 3/57 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/57 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/57 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 11 (OVERLAPS) 48/105 variables, 57/79 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/105 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 13 (OVERLAPS) 0/105 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/105 variables, and 79 constraints, problems are : Problem set: 0 solved, 47 unsolved in 2078 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 2/54 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 3/57 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/57 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 48/105 variables, 57/79 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/105 variables, 47/126 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/105 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/105 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 13 (OVERLAPS) 0/105 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/105 variables, and 127 constraints, problems are : Problem set: 0 solved, 47 unsolved in 5547 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 7656ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 7670ms
Finished structural reductions in LTL mode , in 1 iterations and 8034 ms. Remains : 57/57 places, 48/48 transitions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 57 /57 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2026-05-25 02:18:48] [INFO ] Invariant cache hit.
[2026-05-25 02:18:48] [INFO ] Implicit Places using invariants in 24 ms returned []
[2026-05-25 02:18:48] [INFO ] Invariant cache hit.
[2026-05-25 02:18:48] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 64 ms. Remains : 57/57 places, 48/48 transitions.
Support contains 54 out of 57 places after structural reductions.
[2026-05-25 02:18:48] [INFO ] Flatten gal took : 23 ms
[2026-05-25 02:18:48] [INFO ] Flatten gal took : 7 ms
[2026-05-25 02:18:48] [INFO ] Input system was already deterministic with 48 transitions.
RANDOM walk for 40000 steps (1326 resets) in 1162 ms. (34 steps per ms) remains 21/76 properties
BEST_FIRST walk for 4001 steps (109 resets) in 42 ms. (93 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (116 resets) in 48 ms. (81 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (112 resets) in 54 ms. (72 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (114 resets) in 115 ms. (34 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (116 resets) in 46 ms. (85 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (113 resets) in 40 ms. (97 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (114 resets) in 38 ms. (102 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (114 resets) in 41 ms. (95 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (119 resets) in 41 ms. (95 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (113 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (110 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (114 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (109 resets) in 32 ms. (121 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (120 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (111 resets) in 46 ms. (85 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (114 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (114 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (113 resets) in 28 ms. (137 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (108 resets) in 31 ms. (125 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (114 resets) in 44 ms. (88 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (103 resets) in 31 ms. (125 steps per ms) remains 21/21 properties
[2026-05-25 02:18:49] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp75 is UNSAT
At refinement iteration 1 (OVERLAPS) 26/53 variables, 5/5 constraints. Problems are: Problem set: 13 solved, 8 unsolved
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp64 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 1/6 constraints. Problems are: Problem set: 16 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/7 constraints. Problems are: Problem set: 16 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/7 constraints. Problems are: Problem set: 16 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 4/57 variables, 3/10 constraints. Problems are: Problem set: 16 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 1/11 constraints. Problems are: Problem set: 16 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 0/11 constraints. Problems are: Problem set: 16 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 48/105 variables, 57/68 constraints. Problems are: Problem set: 16 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 0/68 constraints. Problems are: Problem set: 16 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/105 variables, 0/68 constraints. Problems are: Problem set: 16 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/105 variables, and 68 constraints, problems are : Problem set: 16 solved, 5 unsolved in 229 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 16 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 16 solved, 5 unsolved
Problem AtomicPropp62 is UNSAT
At refinement iteration 1 (OVERLAPS) 43/53 variables, 5/5 constraints. Problems are: Problem set: 17 solved, 4 unsolved
Problem AtomicPropp11 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 1/6 constraints. Problems are: Problem set: 18 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/7 constraints. Problems are: Problem set: 18 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/7 constraints. Problems are: Problem set: 18 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 4/57 variables, 3/10 constraints. Problems are: Problem set: 18 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 1/11 constraints. Problems are: Problem set: 18 solved, 3 unsolved
Problem AtomicPropp12 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 1/12 constraints. Problems are: Problem set: 19 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 19 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 48/105 variables, 57/69 constraints. Problems are: Problem set: 19 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/105 variables, 2/71 constraints. Problems are: Problem set: 19 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/105 variables, 1/72 constraints. Problems are: Problem set: 19 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/105 variables, 0/72 constraints. Problems are: Problem set: 19 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/105 variables, 0/72 constraints. Problems are: Problem set: 19 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/105 variables, and 72 constraints, problems are : Problem set: 19 solved, 2 unsolved in 207 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 2/21 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 446ms problems are : Problem set: 19 solved, 2 unsolved
Parikh walk visited 0 properties in 194 ms.
Support contains 4 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 48/48 transitions.
Graph (complete) has 87 edges and 57 vertex of which 53 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 53 transition count 39
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 44 transition count 39
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 19 place count 44 transition count 36
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 25 place count 41 transition count 36
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 43 place count 32 transition count 27
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 46 place count 32 transition count 24
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 49 place count 29 transition count 24
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 50 place count 29 transition count 24
Applied a total of 50 rules in 23 ms. Remains 29 /57 variables (removed 28) and now considering 24/48 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 29/57 places, 24/48 transitions.
RANDOM walk for 40000 steps (3586 resets) in 531 ms. (75 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40000 steps (2482 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7227780002588623240.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17140180275587752356.kers'
[2026-05-25 02:18:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7227780002588623240.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17140180275587752356.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 24 rows 29 cols 89 entries
Finished phase 1 with 18 SingleSign rule and 5 generalized
[2026-05-25 02:18:50] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17140180275587752356.kers
Total runtime 0 ms.
[2026-05-25 02:18:50] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/23 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/27 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 24/51 variables, 27/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/51 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/53 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/53 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/53 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 53/53 variables, and 38 constraints, problems are : Problem set: 0 solved, 1 unsolved in 124 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 29/29 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/23 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/27 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 24/51 variables, 27/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/51 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/51 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/51 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/53 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/53 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/53 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/53 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 53/53 variables, and 41 constraints, problems are : Problem set: 0 solved, 1 unsolved in 95 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 29/29 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 225ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 29 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 29/29 places, 24/24 transitions.
Graph (complete) has 73 edges and 29 vertex of which 27 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 27 transition count 22
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 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 26 transition count 21
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 25 transition count 20
Applied a total of 6 rules in 4 ms. Remains 25 /29 variables (removed 4) and now considering 20/24 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 25/29 places, 20/24 transitions.
RANDOM walk for 40000 steps (4372 resets) in 94 ms. (421 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (2794 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
Probably explored full state space saw : 64 states, properties seen :0
Probabilistic random walk after 127 steps, saw 64 distinct states, run finished after 9 ms. (steps per millisecond=14 ) properties seen :0
Explored full state space saw : 64 states, properties seen :0
Exhaustive walk after 127 steps, saw 64 distinct states, run finished after 1 ms. (steps per millisecond=127 ) properties seen :0
Successfully simplified 20 atomic propositions for a total of 15 simplifications.
Initial state reduction rules removed 2 formulas.
FORMULA DoubleExponent-PT-001-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-001-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 02:18:51] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2026-05-25 02:18:51] [INFO ] Flatten gal took : 5 ms
[2026-05-25 02:18:51] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DoubleExponent-PT-001-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-001-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-001-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 02:18:51] [INFO ] Flatten gal took : 5 ms
[2026-05-25 02:18:51] [INFO ] Input system was already deterministic with 48 transitions.
Support contains 41 out of 57 places (down from 44) after GAL structural reductions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 87 edges and 57 vertex of which 51 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 57/57 places, 48/48 transitions.
Graph (complete) has 87 edges and 57 vertex of which 53 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 52 transition count 39
Reduce places removed 8 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 10 rules applied. Total rules applied 19 place count 44 transition count 37
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 21 place count 42 transition count 37
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 21 place count 42 transition count 35
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 25 place count 40 transition count 35
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 35 place count 35 transition count 30
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 36 place count 34 transition count 29
Applied a total of 36 rules in 9 ms. Remains 34 /57 variables (removed 23) and now considering 29/48 (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-5139519475622263156.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2975326843313514676.kers'
[2026-05-25 02:18:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5139519475622263156.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2975326843313514676.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 29 rows 34 cols 87 entries
Finished phase 1 with 24 SingleSign rule and 4 generalized
[2026-05-25 02:18:51] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2975326843313514676.kers
Total runtime 0 ms.
[2026-05-25 02:18:51] [INFO ] Implicit Places using invariants in 30 ms returned [7, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 32 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 32/57 places, 29/48 transitions.
Graph (complete) has 63 edges and 32 vertex of which 31 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 31 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 30 transition count 27
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 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 29 transition count 26
Applied a total of 5 rules in 8 ms. Remains 29 /32 variables (removed 3) and now considering 26/29 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10767098564036955062.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10294359332501887899.kers'
[2026-05-25 02:18:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10767098564036955062.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10294359332501887899.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 26 rows 29 cols 75 entries
Finished phase 1 with 22 SingleSign rule and 3 generalized
[2026-05-25 02:18:51] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10294359332501887899.kers
Total runtime 1 ms.
[2026-05-25 02:18:51] [INFO ] Implicit Places using invariants in 27 ms returned []
[2026-05-25 02:18:51] [INFO ] Invariant cache hit.
[2026-05-25 02:18:51] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 29/57 places, 26/48 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 114 ms. Remains : 29/57 places, 26/48 transitions.
[2026-05-25 02:18:51] [INFO ] Flatten gal took : 3 ms
[2026-05-25 02:18:51] [INFO ] Flatten gal took : 2 ms
[2026-05-25 02:18:51] [INFO ] Input system was already deterministic with 26 transitions.
[2026-05-25 02:18:51] [INFO ] Flatten gal took : 2 ms
[2026-05-25 02:18:51] [INFO ] Flatten gal took : 2 ms
[2026-05-25 02:18:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality12495748957337365385.gal : 2 ms
[2026-05-25 02:18:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality17268724030268916118.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/CTLCardinality12495748957337365385.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17268724030268916118.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,94,0.014921,4048,2,232,5,934,6,0,144,847,0
Converting to forward existential form...Done !
original formula: (AF(EG(!(A((p16>0) U A((p34>=1) U (p4>=1)))))) * !(E((p35>0) U (p52>=1))))
=> equivalent forward existential formula: ([FwdG(Init,!(EG(!(!((E(!(!((E(!((p4>=1)) U (!((p34>=1)) * !((p4>=1)))) + EG(!((p4>=1)))))) U (!((p16>0)) * !(!(...354
Hit Full ! (commute/partial/dont) 23/0/3
Reverse transition relation is NOT exact ! Due to transitions t0, t6, t10, t12, t16, t19, t20, t24, t25, Intersection with reachable at each step enabled....202
dead was empty
(forward)formula 0,1,0.050494,6120,1,0,174,10015,91,82,867,9308,208
FORMULA DoubleExponent-PT-001-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 48/48 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 55 transition count 48
Applied a total of 2 rules in 5 ms. Remains 55 /57 variables (removed 2) and now considering 48/48 (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-15093498191815804269.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5762622036813023664.kers'
[2026-05-25 02:18:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15093498191815804269.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5762622036813023664.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 48 rows 55 cols 133 entries
Finished phase 1 with 41 SingleSign rule and 7 generalized
[2026-05-25 02:18:51] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5762622036813023664.kers
Total runtime 0 ms.
[2026-05-25 02:18:51] [INFO ] Implicit Places using invariants in 39 ms returned [14, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 40 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 53/57 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 47 ms. Remains : 53/57 places, 48/48 transitions.
[2026-05-25 02:18:51] [INFO ] Flatten gal took : 5 ms
[2026-05-25 02:18:51] [INFO ] Flatten gal took : 3 ms
[2026-05-25 02:18:51] [INFO ] Input system was already deterministic with 48 transitions.
[2026-05-25 02:18:51] [INFO ] Flatten gal took : 3 ms
[2026-05-25 02:18:51] [INFO ] Flatten gal took : 3 ms
[2026-05-25 02:18:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality3963381585279894948.gal : 2 ms
[2026-05-25 02:18:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality8108427341070670652.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/CTLCardinality3963381585279894948.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8108427341070670652.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,149,0.012937,4404,2,549,5,1881,6,0,256,1254,0
Converting to forward existential form...Done !
original formula: (EF(AX(!(E(EX((p57<=p36)) U ((p7<=p38)&&(p21<=1)))))) * (!(E(AX(AX((p5>=1))) U (p41<=p50))) + AF(((EX((p46>p34)) * ((((p25<=1)&&(p30>=1))...202
=> equivalent forward existential formula: ([(Init * !(E(TRUE U !(EX(!(!(E(EX((p57<=p36)) U ((p7<=p38)&&(p21<=1))))))))))] = FALSE * [FwdG((Init * !(!(E(!(...296
Reverse transition relation is NOT exact ! Due to transitions t7, t10, t17, t23, t30, t36, t45, t47, Intersection with reachable at each step enabled. (de...198
(forward)formula 0,0,0.088505,8516,1,0,203,17270,123,62,1549,14088,231
FORMULA DoubleExponent-PT-001-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 48/48 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 53 transition count 48
Applied a total of 4 rules in 1 ms. Remains 53 /57 variables (removed 4) and now considering 48/48 (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-16306384903072062683.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15786920805078930583.kers'
[2026-05-25 02:18:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16306384903072062683.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15786920805078930583.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 48 rows 53 cols 131 entries
Finished phase 1 with 43 SingleSign rule and 4 generalized
[2026-05-25 02:18:51] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15786920805078930583.kers
Total runtime 1 ms.
[2026-05-25 02:18:51] [INFO ] Implicit Places using invariants in 46 ms returned [14, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 47 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 51/57 places, 48/48 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 50 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 50 transition count 47
Applied a total of 2 rules in 3 ms. Remains 50 /51 variables (removed 1) and now considering 47/48 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7267384484456440360.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2025211048660900672.kers'
[2026-05-25 02:18:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7267384484456440360.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2025211048660900672.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 47 rows 50 cols 123 entries
Finished phase 1 with 43 SingleSign rule and 3 generalized
[2026-05-25 02:18:51] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2025211048660900672.kers
Total runtime 0 ms.
[2026-05-25 02:18:51] [INFO ] Implicit Places using invariants in 32 ms returned []
[2026-05-25 02:18:51] [INFO ] Invariant cache hit.
[2026-05-25 02:18:51] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 50/57 places, 47/48 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 141 ms. Remains : 50/57 places, 47/48 transitions.
[2026-05-25 02:18:51] [INFO ] Flatten gal took : 2 ms
[2026-05-25 02:18:51] [INFO ] Flatten gal took : 2 ms
[2026-05-25 02:18:51] [INFO ] Input system was already deterministic with 47 transitions.
[2026-05-25 02:18:51] [INFO ] Flatten gal took : 2 ms
[2026-05-25 02:18:51] [INFO ] Flatten gal took : 3 ms
[2026-05-25 02:18:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality593824005795810058.gal : 1 ms
[2026-05-25 02:18:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality12467886818600057376.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/CTLCardinality593824005795810058.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12467886818600057376.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,149,0.012531,4388,2,415,5,1755,6,0,248,1481,0
Converting to forward existential form...Done !
original formula: ((EG(AX((p23>=1))) + AF(EG((p46<1)))) + (AX((p36>p39)) + AF((p47>p5))))
=> equivalent forward existential formula: [FwdG(((Init * !((EG(!(EX(!((p23>=1))))) + !(EG(!(EG((p46<1)))))))) * !(!(EX(!((p36>p39)))))),!((p47>p5)))] = FA...158
Reverse transition relation is NOT exact ! Due to transitions t7, t12, t17, t23, t29, t30, t36, t44, t46, Intersection with reachable at each step enabled...203
(forward)formula 0,1,0.105684,9612,1,0,341,29139,132,145,1411,24932,386
FORMULA DoubleExponent-PT-001-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 48/48 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 55 transition count 48
Applied a total of 2 rules in 1 ms. Remains 55 /57 variables (removed 2) and now considering 48/48 (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-10702552520956182976.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3001770481783829879.kers'
[2026-05-25 02:18:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10702552520956182976.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3001770481783829879.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 48 rows 55 cols 133 entries
Finished phase 1 with 41 SingleSign rule and 7 generalized
[2026-05-25 02:18:51] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3001770481783829879.kers
Total runtime 0 ms.
[2026-05-25 02:18:51] [INFO ] Implicit Places using invariants in 60 ms returned [14, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 61 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 53/57 places, 48/48 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 52 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 52 transition count 47
Applied a total of 2 rules in 2 ms. Remains 52 /53 variables (removed 1) and now considering 47/48 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14694484818763823704.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9819172265380637064.kers'
[2026-05-25 02:18:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14694484818763823704.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9819172265380637064.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 47 rows 52 cols 125 entries
Finished phase 1 with 40 SingleSign rule and 7 generalized
[2026-05-25 02:18:51] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9819172265380637064.kers
Total runtime 0 ms.
[2026-05-25 02:18:51] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-25 02:18:51] [INFO ] Invariant cache hit.
[2026-05-25 02:18:51] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 52/57 places, 47/48 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 159 ms. Remains : 52/57 places, 47/48 transitions.
[2026-05-25 02:18:51] [INFO ] Flatten gal took : 4 ms
[2026-05-25 02:18:51] [INFO ] Flatten gal took : 2 ms
[2026-05-25 02:18:51] [INFO ] Input system was already deterministic with 47 transitions.
[2026-05-25 02:18:51] [INFO ] Flatten gal took : 2 ms
[2026-05-25 02:18:51] [INFO ] Flatten gal took : 2 ms
[2026-05-25 02:18:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality16830568054124749492.gal : 1 ms
[2026-05-25 02:18:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality7959957381131594867.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/CTLCardinality16830568054124749492.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7959957381131594867.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,149,0.014453,4400,2,541,5,1868,6,0,251,1262,0
Converting to forward existential form...Done !
original formula: (AF(((EX(TRUE) + !(A((p37<=p25) U (p46>=1)))) + ((p3>1)||(p8<1)))) * AF((EG(AX((p49<=p2))) * A((p45<=p48) U (p57<=1)))))
=> equivalent forward existential formula: ([FwdG(Init,!(((EX(TRUE) + !(!((E(!((p46>=1)) U (!((p37<=p25)) * !((p46>=1)))) + EG(!((p46>=1))))))) + ((p3>1)||...299
Reverse transition relation is NOT exact ! Due to transitions t7, t17, t23, t29, t30, t36, t44, t46, Intersection with reachable at each step enabled. (de...198
dead was empty
(forward)formula 0,1,0.262923,15092,1,0,765,66032,138,415,1456,54181,1148
FORMULA DoubleExponent-PT-001-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 48/48 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 53 transition count 48
Applied a total of 4 rules in 4 ms. Remains 53 /57 variables (removed 4) and now considering 48/48 (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-11043480709034410942.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5088974528714224043.kers'
[2026-05-25 02:18:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11043480709034410942.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5088974528714224043.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 48 rows 53 cols 131 entries
Finished phase 1 with 43 SingleSign rule and 4 generalized
[2026-05-25 02:18:52] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5088974528714224043.kers
Total runtime 1 ms.
[2026-05-25 02:18:52] [INFO ] Implicit Places using invariants in 48 ms returned [14, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 50 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 51/57 places, 48/48 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 50 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 50 transition count 47
Applied a total of 2 rules in 1 ms. Remains 50 /51 variables (removed 1) and now considering 47/48 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4647942049184713125.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8080877873487044199.kers'
[2026-05-25 02:18:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4647942049184713125.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8080877873487044199.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 47 rows 50 cols 123 entries
Finished phase 1 with 43 SingleSign rule and 3 generalized
[2026-05-25 02:18:52] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8080877873487044199.kers
Total runtime 1 ms.
[2026-05-25 02:18:52] [INFO ] Implicit Places using invariants in 36 ms returned []
[2026-05-25 02:18:52] [INFO ] Invariant cache hit.
[2026-05-25 02:18:52] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 50/57 places, 47/48 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 139 ms. Remains : 50/57 places, 47/48 transitions.
[2026-05-25 02:18:52] [INFO ] Flatten gal took : 2 ms
[2026-05-25 02:18:52] [INFO ] Flatten gal took : 2 ms
[2026-05-25 02:18:52] [INFO ] Input system was already deterministic with 47 transitions.
[2026-05-25 02:18:52] [INFO ] Flatten gal took : 2 ms
[2026-05-25 02:18:52] [INFO ] Flatten gal took : 2 ms
[2026-05-25 02:18:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality4829599916087912399.gal : 0 ms
[2026-05-25 02:18:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality12278044667581885381.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/CTLCardinality4829599916087912399.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12278044667581885381.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,149,0.012533,4384,2,415,5,1755,6,0,248,1481,0
Converting to forward existential form...Done !
original formula: EG((EG(EF((p12>0))) + EX(A(EX((p46>=1)) U (p50>=1)))))
=> equivalent forward existential formula: [FwdG(Init,(EG(E(TRUE U (p12>0))) + EX(!((E(!((p50>=1)) U (!(EX((p46>=1))) * !((p50>=1)))) + EG(!((p50>=1)))))))...166
Reverse transition relation is NOT exact ! Due to transitions t7, t12, t17, t23, t29, t30, t36, t44, t46, Intersection with reachable at each step enabled...203
(forward)formula 0,1,0.180415,13204,1,0,693,51127,129,430,1461,50327,700
FORMULA DoubleExponent-PT-001-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 57/57 places, 48/48 transitions.
Graph (complete) has 87 edges and 57 vertex of which 53 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 52 transition count 41
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 46 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 45 transition count 40
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 15 place count 45 transition count 37
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 21 place count 42 transition count 37
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 29 place count 38 transition count 33
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 31 place count 38 transition count 33
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 32 place count 37 transition count 32
Iterating global reduction 3 with 1 rules applied. Total rules applied 33 place count 37 transition count 32
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 34 place count 36 transition count 31
Applied a total of 34 rules in 17 ms. Remains 36 /57 variables (removed 21) and now considering 31/48 (removed 17) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-957368248469485101.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13743048804809918964.kers'
[2026-05-25 02:18:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-957368248469485101.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13743048804809918964.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 31 rows 36 cols 92 entries
Finished phase 1 with 26 SingleSign rule and 4 generalized
[2026-05-25 02:18:52] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13743048804809918964.kers
Total runtime 0 ms.
[2026-05-25 02:18:52] [INFO ] Implicit Places using invariants in 30 ms returned [10, 12]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 35 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 34/57 places, 31/48 transitions.
Graph (complete) has 67 edges and 34 vertex of which 33 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 32 transition count 29
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 32 transition count 29
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 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 31 transition count 28
Applied a total of 5 rules in 4 ms. Remains 31 /34 variables (removed 3) and now considering 28/31 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1964568720144134427.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5526569983963481582.kers'
[2026-05-25 02:18:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1964568720144134427.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5526569983963481582.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 28 rows 31 cols 79 entries
Finished phase 1 with 24 SingleSign rule and 3 generalized
[2026-05-25 02:18:52] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5526569983963481582.kers
Total runtime 1 ms.
[2026-05-25 02:18:52] [INFO ] Implicit Places using invariants in 29 ms returned []
[2026-05-25 02:18:52] [INFO ] Invariant cache hit.
[2026-05-25 02:18:52] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 31/57 places, 28/48 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 118 ms. Remains : 31/57 places, 28/48 transitions.
[2026-05-25 02:18:52] [INFO ] Flatten gal took : 1 ms
[2026-05-25 02:18:52] [INFO ] Flatten gal took : 2 ms
[2026-05-25 02:18:52] [INFO ] Input system was already deterministic with 28 transitions.
[2026-05-25 02:18:52] [INFO ] Flatten gal took : 1 ms
[2026-05-25 02:18:52] [INFO ] Flatten gal took : 1 ms
[2026-05-25 02:18:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality9471812848936545110.gal : 0 ms
[2026-05-25 02:18:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality3355021307912740811.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/CTLCardinality9471812848936545110.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3355021307912740811.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,95,0.00802,4156,2,223,5,1032,6,0,154,975,0
Converting to forward existential form...Done !
original formula: (A((p5<=p23) U !(AF(!(EG((p43<=p15)))))) + EG((((p9<=0)&&(p14<=0))&&(p20>p21))))
=> equivalent forward existential formula: ([((Init * !(EG(!(!(!(EG(!(!(EG((p43<=p15))))))))))) * !(E(!(!(!(EG(!(!(EG((p43<=p15)))))))) U (!((p5<=p23)) * !...259
Reverse transition relation is NOT exact ! Due to transitions t4, t7, t10, t13, t17, t20, t24, t27, Intersection with reachable at each step enabled. (des...197
(forward)formula 0,1,0.043792,6568,1,0,219,11152,85,113,901,10416,262
FORMULA DoubleExponent-PT-001-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 48/48 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 53 transition count 48
Applied a total of 4 rules in 2 ms. Remains 53 /57 variables (removed 4) and now considering 48/48 (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-9519065925023485739.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12583570100468494215.kers'
[2026-05-25 02:18:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9519065925023485739.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12583570100468494215.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 48 rows 53 cols 131 entries
Finished phase 1 with 43 SingleSign rule and 4 generalized
[2026-05-25 02:18:52] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12583570100468494215.kers
Total runtime 0 ms.
[2026-05-25 02:18:52] [INFO ] Implicit Places using invariants in 43 ms returned [14, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 44 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 51/57 places, 48/48 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 50 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 50 transition count 47
Applied a total of 2 rules in 1 ms. Remains 50 /51 variables (removed 1) and now considering 47/48 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14325299544677439.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7571690748625090836.kers'
[2026-05-25 02:18:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14325299544677439.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7571690748625090836.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 47 rows 50 cols 123 entries
Finished phase 1 with 43 SingleSign rule and 3 generalized
[2026-05-25 02:18:52] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7571690748625090836.kers
Total runtime 0 ms.
[2026-05-25 02:18:52] [INFO ] Implicit Places using invariants in 28 ms returned []
[2026-05-25 02:18:52] [INFO ] Invariant cache hit.
[2026-05-25 02:18:52] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 50/57 places, 47/48 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 142 ms. Remains : 50/57 places, 47/48 transitions.
[2026-05-25 02:18:52] [INFO ] Flatten gal took : 2 ms
[2026-05-25 02:18:52] [INFO ] Flatten gal took : 2 ms
[2026-05-25 02:18:52] [INFO ] Input system was already deterministic with 47 transitions.
[2026-05-25 02:18:52] [INFO ] Flatten gal took : 2 ms
[2026-05-25 02:18:52] [INFO ] Flatten gal took : 2 ms
[2026-05-25 02:18:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality15981472189308726418.gal : 0 ms
[2026-05-25 02:18:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality16383022852019094813.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/CTLCardinality15981472189308726418.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16383022852019094813.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,149,0.013544,4380,2,415,5,1755,6,0,248,1481,0
Converting to forward existential form...Done !
original formula: AX((p19>0))
=> equivalent forward existential formula: [(EY(Init) * !((p19>0)))] = FALSE
(forward)formula 0,0,0.014638,4644,1,0,8,1755,9,2,320,1481,2
FORMULA DoubleExponent-PT-001-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 48/48 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 53 transition count 48
Applied a total of 4 rules in 2 ms. Remains 53 /57 variables (removed 4) and now considering 48/48 (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-8592258748530155272.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7784852425048165154.kers'
[2026-05-25 02:18:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8592258748530155272.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7784852425048165154.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 48 rows 53 cols 131 entries
Finished phase 1 with 43 SingleSign rule and 4 generalized
[2026-05-25 02:18:52] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7784852425048165154.kers
Total runtime 0 ms.
[2026-05-25 02:18:52] [INFO ] Implicit Places using invariants in 33 ms returned [14, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 34 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 51/57 places, 48/48 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 50 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 50 transition count 47
Applied a total of 2 rules in 2 ms. Remains 50 /51 variables (removed 1) and now considering 47/48 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9668079397984025320.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16172839660100010066.kers'
[2026-05-25 02:18:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9668079397984025320.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16172839660100010066.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 47 rows 50 cols 123 entries
Finished phase 1 with 43 SingleSign rule and 3 generalized
[2026-05-25 02:18:52] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16172839660100010066.kers
Total runtime 0 ms.
[2026-05-25 02:18:52] [INFO ] Implicit Places using invariants in 33 ms returned []
[2026-05-25 02:18:52] [INFO ] Invariant cache hit.
[2026-05-25 02:18:52] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 50/57 places, 47/48 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 117 ms. Remains : 50/57 places, 47/48 transitions.
[2026-05-25 02:18:52] [INFO ] Flatten gal took : 5 ms
[2026-05-25 02:18:52] [INFO ] Flatten gal took : 2 ms
[2026-05-25 02:18:53] [INFO ] Input system was already deterministic with 47 transitions.
[2026-05-25 02:18:53] [INFO ] Flatten gal took : 2 ms
[2026-05-25 02:18:53] [INFO ] Flatten gal took : 2 ms
[2026-05-25 02:18:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality1002988045546183764.gal : 0 ms
[2026-05-25 02:18:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality10053021258931768561.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/CTLCardinality1002988045546183764.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10053021258931768561.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,149,0.017024,4384,2,415,5,1755,6,0,248,1481,0
Converting to forward existential form...Done !
original formula: EF((AX((p27>=1)) * EF((p4<=0))))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !(EX(!((p27>=1))))),TRUE) * (p4<=0))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t12, t17, t23, t29, t30, t36, t44, t46, Intersection with reachable at each step enabled...203
(forward)formula 0,1,0.049412,6400,1,0,90,7220,113,53,1432,4506,104
FORMULA DoubleExponent-PT-001-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 57/57 places, 48/48 transitions.
Graph (complete) has 87 edges and 57 vertex of which 53 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 52 transition count 36
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 41 transition count 36
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 23 place count 41 transition count 34
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 27 place count 39 transition count 34
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 39 place count 33 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 32 transition count 27
Applied a total of 40 rules in 6 ms. Remains 32 /57 variables (removed 25) and now considering 27/48 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17746060555658062006.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14197246709401395290.kers'
[2026-05-25 02:18:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17746060555658062006.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14197246709401395290.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 27 rows 32 cols 85 entries
Finished phase 1 with 22 SingleSign rule and 4 generalized
[2026-05-25 02:18:53] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14197246709401395290.kers
Total runtime 0 ms.
[2026-05-25 02:18:53] [INFO ] Implicit Places using invariants in 28 ms returned [6, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 28 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 30/57 places, 27/48 transitions.
Graph (complete) has 62 edges and 30 vertex of which 29 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 29 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 28 transition count 25
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 26 transition count 23
Applied a total of 7 rules in 2 ms. Remains 26 /30 variables (removed 4) and now considering 23/27 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4302235313880553470.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3705152928828351417.kers'
[2026-05-25 02:18:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4302235313880553470.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3705152928828351417.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 23 rows 26 cols 71 entries
Finished phase 1 with 19 SingleSign rule and 3 generalized
[2026-05-25 02:18:53] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3705152928828351417.kers
Total runtime 0 ms.
[2026-05-25 02:18:53] [INFO ] Implicit Places using invariants in 28 ms returned []
[2026-05-25 02:18:53] [INFO ] Invariant cache hit.
[2026-05-25 02:18:53] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 26/57 places, 23/48 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 97 ms. Remains : 26/57 places, 23/48 transitions.
[2026-05-25 02:18:53] [INFO ] Flatten gal took : 1 ms
[2026-05-25 02:18:53] [INFO ] Flatten gal took : 1 ms
[2026-05-25 02:18:53] [INFO ] Input system was already deterministic with 23 transitions.
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
FORMULA DoubleExponent-PT-001-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-25 02:18:53] [INFO ] Flatten gal took : 2 ms
[2026-05-25 02:18:53] [INFO ] Flatten gal took : 1 ms
[2026-05-25 02:18:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10344315960908913444.gal : 0 ms
[2026-05-25 02:18:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5499278902079708738.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10344315960908913444.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5499278902079708738.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality5499278902079708738.prop.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 48/48 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 54 transition count 48
Applied a total of 3 rules in 1 ms. Remains 54 /57 variables (removed 3) and now considering 48/48 (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-10563624851124117084.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5426126147140538841.kers'
[2026-05-25 02:18:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10563624851124117084.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5426126147140538841.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 48 rows 54 cols 132 entries
Finished phase 1 with 40 SingleSign rule and 8 generalized
[2026-05-25 02:18:53] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5426126147140538841.kers
Total runtime 0 ms.
[2026-05-25 02:18:53] [INFO ] Implicit Places using invariants in 40 ms returned [14, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 42 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 52/57 places, 48/48 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 51 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 51 transition count 47
Applied a total of 2 rules in 1 ms. Remains 51 /52 variables (removed 1) and now considering 47/48 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6987974893130112164.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6415165616744144123.kers'
[2026-05-25 02:18:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6987974893130112164.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6415165616744144123.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 47 rows 51 cols 124 entries
Finished phase 1 with 39 SingleSign rule and 8 generalized
[2026-05-25 02:18:53] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6415165616744144123.kers
Total runtime 0 ms.
[2026-05-25 02:18:53] [INFO ] Implicit Places using invariants in 24 ms returned []
[2026-05-25 02:18:53] [INFO ] Invariant cache hit.
[2026-05-25 02:18:53] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 51/57 places, 47/48 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 112 ms. Remains : 51/57 places, 47/48 transitions.
[2026-05-25 02:18:53] [INFO ] Flatten gal took : 2 ms
[2026-05-25 02:18:53] [INFO ] Flatten gal took : 3 ms
[2026-05-25 02:18:53] [INFO ] Input system was already deterministic with 47 transitions.
[2026-05-25 02:18:53] [INFO ] Flatten gal took : 2 ms
[2026-05-25 02:18:53] [INFO ] Flatten gal took : 2 ms
[2026-05-25 02:18:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality886735892878286551.gal : 1 ms
[2026-05-25 02:18:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality9235972101746039129.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/CTLCardinality886735892878286551.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9235972101746039129.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,149,0.01398,4428,2,499,5,1956,6,0,249,1531,0
Converting to forward existential form...Done !
original formula: AX((((A((p29<=p39) U (p15>=1)) * AF((p52<=p28))) * ((p39<=1)&&(p31<=p32))) * (!(A(((p37>=1)&&(p54<=0)) U (EX(TRUE) + (p37>0)))) + ((p55>p...175
=> equivalent forward existential formula: (((([(FwdU(EY(Init),!((p15>=1))) * (!((p29<=p39)) * !((p15>=1))))] = FALSE * [FwdG(EY(Init),!((p15>=1)))] = FALS...434
Reverse transition relation is NOT exact ! Due to transitions t7, t12, t17, t23, t29, t30, t36, t44, t46, Intersection with reachable at each step enabled...203
(forward)formula 0,0,0.08534,8352,1,0,201,18753,124,63,1501,15327,224
FORMULA DoubleExponent-PT-001-CTLCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-25 02:18:53] [INFO ] Flatten gal took : 2 ms
[2026-05-25 02:18:53] [INFO ] Flatten gal took : 2 ms
Total runtime 13389 ms.
BK_STOP 1779675533466
--------------------
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="DoubleExponent-PT-001"
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 DoubleExponent-PT-001, 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 r098-tall-177955695800849"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-001.tgz
mv DoubleExponent-PT-001 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 ;