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-177955695800859.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-002, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-tall-177955695800859
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.8K Mar 6 16:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Mar 6 16:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Mar 6 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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.7K Mar 15 09:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 09:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 09:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 09:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Mar 6 16:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K Mar 6 16:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 6 16:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K Mar 6 16:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 09:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:36 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 33K 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-002-LTLCardinality-00
FORMULA_NAME DoubleExponent-PT-002-LTLCardinality-01
FORMULA_NAME DoubleExponent-PT-002-LTLCardinality-02
FORMULA_NAME DoubleExponent-PT-002-LTLCardinality-03
FORMULA_NAME DoubleExponent-PT-002-LTLCardinality-04
FORMULA_NAME DoubleExponent-PT-002-LTLCardinality-05
FORMULA_NAME DoubleExponent-PT-002-LTLCardinality-06
FORMULA_NAME DoubleExponent-PT-002-LTLCardinality-07
FORMULA_NAME DoubleExponent-PT-002-LTLCardinality-08
FORMULA_NAME DoubleExponent-PT-002-LTLCardinality-09
FORMULA_NAME DoubleExponent-PT-002-LTLCardinality-10
FORMULA_NAME DoubleExponent-PT-002-LTLCardinality-11
FORMULA_NAME DoubleExponent-PT-002-LTLCardinality-12
FORMULA_NAME DoubleExponent-PT-002-LTLCardinality-13
FORMULA_NAME DoubleExponent-PT-002-LTLCardinality-14
FORMULA_NAME DoubleExponent-PT-002-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779675938433

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-002
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-25 02:25:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 02:25:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 02:25:39] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2026-05-25 02:25:39] [INFO ] Transformed 110 places.
[2026-05-25 02:25:39] [INFO ] Transformed 98 transitions.
[2026-05-25 02:25:39] [INFO ] Parsed PT model containing 110 places and 98 transitions and 276 arcs in 138 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA DoubleExponent-PT-002-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 98/98 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 107 transition count 98
Applied a total of 3 rules in 18 ms. Remains 107 /110 variables (removed 3) and now considering 98/98 (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-1842392224496492942.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2751366527686339887.kers'
[2026-05-25 02:25:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1842392224496492942.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2751366527686339887.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 98 rows 107 cols 273 entries
Finished phase 1 with 89 SingleSign rule and 7 generalized
[2026-05-25 02:25:39] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2751366527686339887.kers
Total runtime 2 ms.
[2026-05-25 02:25:40] [INFO ] Implicit Places using invariants in 198 ms returned []
[2026-05-25 02:25:40] [INFO ] Invariant cache hit.
[2026-05-25 02:25:40] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2026-05-25 02:25:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/204 variables, 106/119 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/204 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/204 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/204 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (OVERLAPS) 1/205 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/205 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 15 (OVERLAPS) 0/205 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/205 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/205 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 18 (OVERLAPS) 0/205 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 130 constraints, problems are : Problem set: 0 solved, 97 unsolved in 18000 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/204 variables, 106/126 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 95/221 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 3/224 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (OVERLAPS) 1/205 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/205 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/205 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (OVERLAPS) 0/205 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 227 constraints, problems are : Problem set: 0 solved, 97 unsolved in 23688 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 41735ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 41752ms
Starting structural reductions in LTL mode, iteration 1 : 107/110 places, 98/98 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42197 ms. Remains : 107/110 places, 98/98 transitions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 98/98 transitions.
Applied a total of 0 rules in 5 ms. Remains 107 /107 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2026-05-25 02:26:22] [INFO ] Invariant cache hit.
[2026-05-25 02:26:22] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-25 02:26:22] [INFO ] Invariant cache hit.
[2026-05-25 02:26:22] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 150 ms. Remains : 107/107 places, 98/98 transitions.
Support contains 38 out of 107 places after structural reductions.
[2026-05-25 02:26:22] [INFO ] Flatten gal took : 25 ms
[2026-05-25 02:26:22] [INFO ] Flatten gal took : 11 ms
[2026-05-25 02:26:22] [INFO ] Input system was already deterministic with 98 transitions.
RANDOM walk for 40000 steps (1325 resets) in 2073 ms. (19 steps per ms) remains 20/30 properties
BEST_FIRST walk for 4001 steps (114 resets) in 91 ms. (43 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (110 resets) in 89 ms. (44 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (108 resets) in 41 ms. (95 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (120 resets) in 105 ms. (37 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (114 resets) in 63 ms. (62 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (108 resets) in 40 ms. (97 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (119 resets) in 39 ms. (100 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (109 resets) in 53 ms. (74 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (113 resets) in 22 ms. (173 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (117 resets) in 22 ms. (173 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (115 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (114 resets) in 27 ms. (142 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (116 resets) in 32 ms. (121 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (115 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (107 resets) in 38 ms. (102 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (114 resets) in 47 ms. (83 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (114 resets) in 23 ms. (166 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (111 resets) in 25 ms. (153 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (121 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (107 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
[2026-05-25 02:26:23] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Problem AtomicPropp15 is UNSAT
At refinement iteration 1 (OVERLAPS) 13/42 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 53/95 variables, 9/11 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 94/189 variables, 95/106 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/106 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 15/204 variables, 11/117 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 0/117 constraints. Problems are: Problem set: 1 solved, 19 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
At refinement iteration 9 (OVERLAPS) 1/205 variables, 1/118 constraints. Problems are: Problem set: 9 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 0/118 constraints. Problems are: Problem set: 9 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 0/205 variables, 0/118 constraints. Problems are: Problem set: 9 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 118 constraints, problems are : Problem set: 9 solved, 11 unsolved in 543 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 15/39 variables, 2/2 constraints. Problems are: Problem set: 9 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 9 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 56/95 variables, 9/11 constraints. Problems are: Problem set: 9 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 1/12 constraints. Problems are: Problem set: 9 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/12 constraints. Problems are: Problem set: 9 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 94/189 variables, 95/107 constraints. Problems are: Problem set: 9 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 7/114 constraints. Problems are: Problem set: 9 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/114 constraints. Problems are: Problem set: 9 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 15/204 variables, 11/125 constraints. Problems are: Problem set: 9 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/204 variables, 4/129 constraints. Problems are: Problem set: 9 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/204 variables, 0/129 constraints. Problems are: Problem set: 9 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 1/205 variables, 1/130 constraints. Problems are: Problem set: 9 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/205 variables, 3/133 constraints. Problems are: Problem set: 9 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/205 variables, 0/133 constraints. Problems are: Problem set: 9 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 0/205 variables, 0/133 constraints. Problems are: Problem set: 9 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 133 constraints, problems are : Problem set: 9 solved, 11 unsolved in 1655 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 11/20 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2205ms problems are : Problem set: 9 solved, 11 unsolved
Parikh walk visited 0 properties in 5623 ms.
Support contains 24 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 98/98 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 107 transition count 88
Reduce places removed 10 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 13 rules applied. Total rules applied 23 place count 97 transition count 85
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 26 place count 94 transition count 85
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 26 place count 94 transition count 80
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 36 place count 89 transition count 80
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 58 place count 78 transition count 69
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
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 62 place count 76 transition count 69
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 63 place count 76 transition count 68
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 64 place count 75 transition count 68
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 66 place count 75 transition count 66
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 68 place count 73 transition count 66
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 74 place count 73 transition count 66
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 75 place count 72 transition count 65
Applied a total of 75 rules in 633 ms. Remains 72 /107 variables (removed 35) and now considering 65/98 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 634 ms. Remains : 72/107 places, 65/98 transitions.
RANDOM walk for 40000 steps (3583 resets) in 593 ms. (67 steps per ms) remains 8/11 properties
BEST_FIRST walk for 40002 steps (2521 resets) in 194 ms. (205 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (2449 resets) in 193 ms. (206 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40000 steps (2498 resets) in 139 ms. (285 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (2485 resets) in 117 ms. (339 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (2445 resets) in 144 ms. (275 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (2458 resets) in 103 ms. (384 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (2484 resets) in 75 ms. (526 steps per ms) remains 7/7 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7941846023969545653.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9066628660590908520.kers'
[2026-05-25 02:26:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7941846023969545653.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9066628660590908520.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 65 rows 72 cols 226 entries
Finished phase 1 with 52 SingleSign rule and 9 generalized
[2026-05-25 02:26:32] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9066628660590908520.kers
Total runtime 0 ms.
[2026-05-25 02:26:32] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 6/24 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 39/63 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1/64 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 64/128 variables, 64/75 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 8/136 variables, 7/83 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/136 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 1/137 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/137 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 0/137 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 137/137 variables, and 84 constraints, problems are : Problem set: 0 solved, 7 unsolved in 167 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 72/72 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 6/24 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 39/63 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1/64 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 64/128 variables, 64/75 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/128 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/128 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 8/136 variables, 7/87 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/136 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/136 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/136 variables, 4/97 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/136 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/136 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 1/137 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/137 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (OVERLAPS) 0/137 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/137 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (OVERLAPS) 0/137 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 137/137 variables, and 100 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1559 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 72/72 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 1737ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 0 properties in 1243 ms.
Support contains 18 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 65/65 transitions.
Graph (complete) has 159 edges and 72 vertex of which 71 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 71 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 70 transition count 64
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 70 transition count 63
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 69 transition count 63
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 9 place count 67 transition count 61
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 12 place count 67 transition count 58
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 15 place count 64 transition count 58
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 16 place count 64 transition count 58
Applied a total of 16 rules in 13 ms. Remains 64 /72 variables (removed 8) and now considering 58/65 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 64/72 places, 58/65 transitions.
RANDOM walk for 40000 steps (3342 resets) in 120 ms. (330 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (2529 resets) in 107 ms. (370 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (2504 resets) in 94 ms. (421 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (2461 resets) in 104 ms. (380 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (2459 resets) in 60 ms. (655 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (2500 resets) in 67 ms. (588 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (2476 resets) in 58 ms. (677 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (2519 resets) in 79 ms. (500 steps per ms) remains 7/7 properties
Finished probabilistic random walk after 2454 steps, run visited all 7 properties in 25 ms. (steps per millisecond=98 )
Probabilistic random walk after 2454 steps, saw 1257 distinct states, run finished after 28 ms. (steps per millisecond=87 ) properties seen :7
FORMULA DoubleExponent-PT-002-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA DoubleExponent-PT-002-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 9 atomic propositions for a total of 10 simplifications.
FORMULA DoubleExponent-PT-002-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 174 edges and 107 vertex of which 104 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.5 ms
FORMULA DoubleExponent-PT-002-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U G(p1)) U X(X(X((!p0||F(p2)))))))'
Support contains 5 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 98/98 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 106 transition count 98
Applied a total of 1 rules in 3 ms. Remains 106 /107 variables (removed 1) and now considering 98/98 (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-13920590326326092277.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16874355740334245819.kers'
[2026-05-25 02:26:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13920590326326092277.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16874355740334245819.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 98 rows 106 cols 272 entries
Finished phase 1 with 83 SingleSign rule and 12 generalized
[2026-05-25 02:26:36] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16874355740334245819.kers
Total runtime 0 ms.
[2026-05-25 02:26:36] [INFO ] Implicit Places using invariants in 56 ms returned [73]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 57 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 105/107 places, 98/98 transitions.
Applied a total of 0 rules in 4 ms. Remains 105 /105 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 64 ms. Remains : 105/107 places, 98/98 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U G(p1)) U X(X(X((!p0||F(p2)))))))'
Stuttering acceptance computed with spot in 737 ms :[(AND (NOT p2) (NOT p1)), (AND p0 (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p2) p0), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p2) p0), (AND p0 (NOT p2)), (NOT p2), (AND (NOT p2) p0), (AND p0 (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)))]
Running random walk in product with property : DoubleExponent-PT-002-LTLCardinality-02
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 4 ms.
FORMULA DoubleExponent-PT-002-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-LTLCardinality-02 finished in 886 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 98/98 transitions.
Graph (complete) has 174 edges and 107 vertex of which 106 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 105 transition count 76
Reduce places removed 21 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 23 rules applied. Total rules applied 45 place count 84 transition count 74
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 47 place count 82 transition count 74
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 47 place count 82 transition count 70
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 55 place count 78 transition count 70
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 95 place count 58 transition count 50
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
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 99 place count 56 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 100 place count 55 transition count 49
Applied a total of 100 rules in 18 ms. Remains 55 /107 variables (removed 52) and now considering 49/98 (removed 49) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16347566362108222858.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3355068832718353366.kers'
[2026-05-25 02:26:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16347566362108222858.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3355068832718353366.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 49 rows 54 cols 176 entries
Finished phase 1 with 32 SingleSign rule and 12 generalized
[2026-05-25 02:26:37] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3355068832718353366.kers
Total runtime 0 ms.
[2026-05-25 02:26:37] [INFO ] Implicit Places using invariants in 45 ms returned [37, 38]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 46 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 53/107 places, 49/98 transitions.
Graph (complete) has 145 edges and 53 vertex of which 52 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
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 49 transition count 45
Applied a total of 7 rules in 4 ms. Remains 49 /53 variables (removed 4) and now considering 45/49 (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-17910341484647488162.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5597736307719302673.kers'
[2026-05-25 02:26:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17910341484647488162.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5597736307719302673.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 45 rows 48 cols 160 entries
Finished phase 1 with 30 SingleSign rule and 10 generalized
[2026-05-25 02:26:37] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5597736307719302673.kers
Total runtime 0 ms.
[2026-05-25 02:26:37] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-25 02:26:37] [INFO ] Invariant cache hit.
[2026-05-25 02:26:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-25 02:26:37] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 49/107 places, 45/98 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 161 ms. Remains : 49/107 places, 45/98 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-002-LTLCardinality-05
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-002-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-LTLCardinality-05 finished in 225 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 98/98 transitions.
Graph (complete) has 174 edges and 107 vertex of which 106 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 105 transition count 75
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 83 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 47 place count 82 transition count 74
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 47 place count 82 transition count 70
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 55 place count 78 transition count 70
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 93 place count 59 transition count 51
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
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 97 place count 57 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 place count 56 transition count 50
Applied a total of 98 rules in 22 ms. Remains 56 /107 variables (removed 51) and now considering 50/98 (removed 48) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14619452372800932585.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1996478397635801443.kers'
[2026-05-25 02:26:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14619452372800932585.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1996478397635801443.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 50 rows 56 cols 188 entries
Finished phase 1 with 34 SingleSign rule and 11 generalized
[2026-05-25 02:26:37] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1996478397635801443.kers
Total runtime 0 ms.
[2026-05-25 02:26:37] [INFO ] Implicit Places using invariants in 36 ms returned [38, 39]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 36 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/107 places, 50/98 transitions.
Graph (complete) has 152 edges and 54 vertex of which 53 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
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 50 transition count 46
Applied a total of 7 rules in 4 ms. Remains 50 /54 variables (removed 4) and now considering 46/50 (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-8186916022591887804.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9755758577400370081.kers'
[2026-05-25 02:26:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8186916022591887804.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9755758577400370081.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 46 rows 50 cols 172 entries
Finished phase 1 with 31 SingleSign rule and 10 generalized
[2026-05-25 02:26:37] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9755758577400370081.kers
Total runtime 0 ms.
[2026-05-25 02:26:37] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-25 02:26:37] [INFO ] Invariant cache hit.
[2026-05-25 02:26:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-25 02:26:37] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 50/107 places, 46/98 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 170 ms. Remains : 50/107 places, 46/98 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-002-LTLCardinality-06
Product exploration explored 100000 steps with 15061 reset in 147 ms.
Product exploration explored 100000 steps with 15042 reset in 133 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Graph (complete) has 148 edges and 50 vertex of which 49 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge based reduction with 3 factoid took 51 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 47 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 209 ms.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 46/46 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 46/46 (removed 0) transitions.
[2026-05-25 02:26:38] [INFO ] Invariant cache hit.
[2026-05-25 02:26:38] [INFO ] Implicit Places using invariants in 39 ms returned []
[2026-05-25 02:26:38] [INFO ] Invariant cache hit.
[2026-05-25 02:26:38] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-25 02:26:38] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2026-05-25 02:26:38] [INFO ] Redundant transitions in 0 ms returned []
Running 45 sub problems to find dead transitions.
[2026-05-25 02:26:38] [INFO ] Invariant cache hit.
[2026-05-25 02:26:38] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (OVERLAPS) 46/96 variables, 50/59 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (OVERLAPS) 0/96 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/96 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 10 (OVERLAPS) 0/96 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/96 variables, and 63 constraints, problems are : Problem set: 0 solved, 45 unsolved in 1155 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 50/50 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (OVERLAPS) 1/50 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (OVERLAPS) 46/96 variables, 50/61 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/96 variables, 45/108 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/96 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 11 (OVERLAPS) 0/96 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/96 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 13 (OVERLAPS) 0/96 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/96 variables, and 109 constraints, problems are : Problem set: 0 solved, 45 unsolved in 3955 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 50/50 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5119ms problems are : Problem set: 0 solved, 45 unsolved
Search for dead transitions found 0 dead transitions in 5119ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 5227 ms. Remains : 50/50 places, 46/46 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Graph (complete) has 148 edges and 50 vertex of which 49 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge based reduction with 3 factoid took 41 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 51 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 172 ms.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 15225 reset in 71 ms.
Product exploration explored 100000 steps with 15059 reset in 158 ms.
Built C files in :
/tmp/ltsmin6116398486231218252
[2026-05-25 02:26:44] [INFO ] Computing symmetric may disable matrix : 46 transitions.
[2026-05-25 02:26:44] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 02:26:44] [INFO ] Computing symmetric may enable matrix : 46 transitions.
[2026-05-25 02:26:44] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 02:26:44] [INFO ] Computing Do-Not-Accords matrix : 46 transitions.
[2026-05-25 02:26:44] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 02:26:44] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6116398486231218252
Running compilation step : cd /tmp/ltsmin6116398486231218252;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 219 ms.
Running link step : cd /tmp/ltsmin6116398486231218252;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin6116398486231218252;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16052270552130319440.hoa' '--buchi-type=spotba'
LTSmin run took 61 ms.
FORMULA DoubleExponent-PT-002-LTLCardinality-06 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DoubleExponent-PT-002-LTLCardinality-06 finished in 7039 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p0)||F(G(p1))) U X(p2))))'
Support contains 5 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 98/98 transitions.
Applied a total of 0 rules in 4 ms. Remains 107 /107 variables (removed 0) and now considering 98/98 (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-11613032353700255735.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12088067201126431659.kers'
[2026-05-25 02:26:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11613032353700255735.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12088067201126431659.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 98 rows 107 cols 273 entries
Finished phase 1 with 89 SingleSign rule and 7 generalized
[2026-05-25 02:26:44] [INFO ] Computed 11 invariants in 2 ms
Computed 11 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12088067201126431659.kers
Total runtime 2 ms.
[2026-05-25 02:26:44] [INFO ] Implicit Places using invariants in 50 ms returned [74, 77]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 51 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 105/107 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 104 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 104 transition count 97
Applied a total of 2 rules in 3 ms. Remains 104 /105 variables (removed 1) and now considering 97/98 (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-5848856035800289401.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11726778647428674659.kers'
[2026-05-25 02:26:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5848856035800289401.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11726778647428674659.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 97 rows 104 cols 265 entries
Finished phase 1 with 89 SingleSign rule and 6 generalized
[2026-05-25 02:26:44] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11726778647428674659.kers
Total runtime 0 ms.
[2026-05-25 02:26:44] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-05-25 02:26:44] [INFO ] Invariant cache hit.
[2026-05-25 02:26:44] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 104/107 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 230 ms. Remains : 104/107 places, 97/98 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p0)||F(G(p1))) U X(p2))))'
Stuttering acceptance computed with spot in 264 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-002-LTLCardinality-08
Product exploration explored 100000 steps with 33333 reset in 74 ms.
Product exploration explored 100000 steps with 33333 reset in 68 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 168 edges and 104 vertex of which 101 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 6 factoid took 19 ms. Proved property starting from automaton with 7 states, 14 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 24 ms.
FORMULA DoubleExponent-PT-002-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-002-LTLCardinality-08 finished in 700 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)||((p0&&G(p1)) U X(X(p0))))))'
Support contains 4 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 98/98 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 106 transition count 98
Applied a total of 1 rules in 3 ms. Remains 106 /107 variables (removed 1) and now considering 98/98 (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-16808709159670778087.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10836493642717426781.kers'
[2026-05-25 02:26:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16808709159670778087.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10836493642717426781.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 98 rows 106 cols 272 entries
Finished phase 1 with 83 SingleSign rule and 12 generalized
[2026-05-25 02:26:45] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10836493642717426781.kers
Total runtime 1 ms.
[2026-05-25 02:26:45] [INFO ] Implicit Places using invariants in 60 ms returned [73, 76]
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 : 104/107 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 2 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (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-10644916617653210378.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1345681555883425657.kers'
[2026-05-25 02:26:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10644916617653210378.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1345681555883425657.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 97 rows 103 cols 264 entries
Finished phase 1 with 83 SingleSign rule and 11 generalized
[2026-05-25 02:26:45] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1345681555883425657.kers
Total runtime 0 ms.
[2026-05-25 02:26:45] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-25 02:26:45] [INFO ] Invariant cache hit.
[2026-05-25 02:26:45] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/107 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 237 ms. Remains : 103/107 places, 97/98 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)||((p0&&G(p1)) U X(X(p0))))))'
Stuttering acceptance computed with spot in 310 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-002-LTLCardinality-09
Product exploration explored 100000 steps with 33333 reset in 66 ms.
Product exploration explored 100000 steps with 33333 reset in 70 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 167 edges and 103 vertex of which 101 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 9 factoid took 20 ms. Proved property starting from automaton with 8 states, 13 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 22 ms.
FORMULA DoubleExponent-PT-002-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-002-LTLCardinality-09 finished in 733 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 98/98 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 106 transition count 98
Applied a total of 1 rules in 3 ms. Remains 106 /107 variables (removed 1) and now considering 98/98 (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-3452200059296488928.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4052423031519828727.kers'
[2026-05-25 02:26:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3452200059296488928.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4052423031519828727.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 98 rows 106 cols 272 entries
Finished phase 1 with 83 SingleSign rule and 12 generalized
[2026-05-25 02:26:45] [INFO ] Computed 11 invariants in 2 ms
Computed 11 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4052423031519828727.kers
Total runtime 2 ms.
[2026-05-25 02:26:45] [INFO ] Implicit Places using invariants in 46 ms returned [73, 76]
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 : 104/107 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 2 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (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-10564821825759486401.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1844332271407173411.kers'
[2026-05-25 02:26:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10564821825759486401.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1844332271407173411.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 97 rows 103 cols 264 entries
Finished phase 1 with 83 SingleSign rule and 11 generalized
[2026-05-25 02:26:45] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1844332271407173411.kers
Total runtime 1 ms.
[2026-05-25 02:26:45] [INFO ] Implicit Places using invariants in 39 ms returned []
[2026-05-25 02:26:45] [INFO ] Invariant cache hit.
[2026-05-25 02:26:46] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/107 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 208 ms. Remains : 103/107 places, 97/98 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-002-LTLCardinality-11
Product exploration explored 100000 steps with 25000 reset in 134 ms.
Product exploration explored 100000 steps with 25000 reset in 163 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 167 edges and 103 vertex of which 101 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge based reduction with 1 factoid took 48 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (1310 resets) in 140 ms. (283 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (1159 resets) in 58 ms. (677 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1729 steps, run visited all 1 properties in 9 ms. (steps per millisecond=192 )
Probabilistic random walk after 1729 steps, saw 874 distinct states, run finished after 9 ms. (steps per millisecond=192 ) properties seen :1
Knowledge based reduction with 1 factoid took 41 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 316 ms.
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 97/97 transitions.
Applied a total of 0 rules in 1 ms. Remains 103 /103 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2026-05-25 02:26:46] [INFO ] Invariant cache hit.
[2026-05-25 02:26:46] [INFO ] Implicit Places using invariants in 43 ms returned []
[2026-05-25 02:26:47] [INFO ] Invariant cache hit.
[2026-05-25 02:26:47] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2026-05-25 02:26:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 97/200 variables, 103/114 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 5/119 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 12 (OVERLAPS) 0/200 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 123 constraints, problems are : Problem set: 0 solved, 96 unsolved in 9540 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 97/200 variables, 103/120 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 96/216 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 3/219 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (OVERLAPS) 0/200 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/200 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 13 (OVERLAPS) 0/200 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 221 constraints, problems are : Problem set: 0 solved, 96 unsolved in 18945 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 28500ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 28501ms
Finished structural reductions in LTL mode , in 1 iterations and 28658 ms. Remains : 103/103 places, 97/97 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 167 edges and 103 vertex of which 101 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge based reduction with 1 factoid took 47 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (1334 resets) in 83 ms. (476 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (1134 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1729 steps, run visited all 1 properties in 7 ms. (steps per millisecond=247 )
Probabilistic random walk after 1729 steps, saw 874 distinct states, run finished after 7 ms. (steps per millisecond=247 ) properties seen :1
Knowledge based reduction with 1 factoid took 52 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 288 ms.
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 60 ms.
Product exploration explored 100000 steps with 25000 reset in 62 ms.
Spot run failed in 88 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin7414581923705173411
[2026-05-25 02:27:16] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7414581923705173411
Running compilation step : cd /tmp/ltsmin7414581923705173411;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 174 ms.
Running link step : cd /tmp/ltsmin7414581923705173411;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin7414581923705173411;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased4433123122924808397.hoa' '--buchi-type=spotba'
LTSmin run took 16 ms.
FORMULA DoubleExponent-PT-002-LTLCardinality-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DoubleExponent-PT-002-LTLCardinality-11 finished in 30893 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(X(X(X(X(p0)))))||F(p1)))))'
Support contains 3 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 98/98 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 106 transition count 98
Applied a total of 1 rules in 1 ms. Remains 106 /107 variables (removed 1) and now considering 98/98 (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-12299398125808192238.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1997864986078263253.kers'
[2026-05-25 02:27:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12299398125808192238.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1997864986078263253.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 98 rows 106 cols 272 entries
Finished phase 1 with 83 SingleSign rule and 12 generalized
[2026-05-25 02:27:16] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1997864986078263253.kers
Total runtime 1 ms.
[2026-05-25 02:27:16] [INFO ] Implicit Places using invariants in 50 ms returned [73, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 51 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/107 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 1 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (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-14008012798866806727.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18370152137114314770.kers'
[2026-05-25 02:27:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14008012798866806727.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18370152137114314770.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 97 rows 103 cols 264 entries
Finished phase 1 with 83 SingleSign rule and 11 generalized
[2026-05-25 02:27:16] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18370152137114314770.kers
Total runtime 0 ms.
[2026-05-25 02:27:16] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-05-25 02:27:16] [INFO ] Invariant cache hit.
[2026-05-25 02:27:16] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/107 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 228 ms. Remains : 103/107 places, 97/98 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(X(X(X(X(p0)))))||F(p1)))))'
Stuttering acceptance computed with spot in 351 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-002-LTLCardinality-14
Product exploration explored 100000 steps with 33333 reset in 66 ms.
Product exploration explored 100000 steps with 33333 reset in 61 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 167 edges and 103 vertex of which 101 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 2 factoid took 17 ms. Proved property starting from automaton with 9 states, 9 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 19 ms.
FORMULA DoubleExponent-PT-002-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-002-LTLCardinality-14 finished in 756 ms.
All properties solved by simple procedures.
Total runtime 97868 ms.

BK_STOP 1779676037480

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-002"
export BK_EXAMINATION="LTLCardinality"
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-002, examination is LTLCardinality"
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-177955695800859"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-002.tgz
mv DoubleExponent-PT-002 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;