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.r338-smll-178021499300475.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 FileSystem-PT-N08I32B26, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r338-smll-178021499300475
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 9.7K May 27 10:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 27 10:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 27 10:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 27 10:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Jun 16 12:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 16 12:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 16 12:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 16 12:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 18K May 27 10:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K May 27 10:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 27 10:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K May 27 10:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Jun 16 12:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Jun 16 12:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 10 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 1.9M Jun 10 11:57 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 FileSystem-PT-N08I32B26-LTLCardinality-00
FORMULA_NAME FileSystem-PT-N08I32B26-LTLCardinality-01
FORMULA_NAME FileSystem-PT-N08I32B26-LTLCardinality-02
FORMULA_NAME FileSystem-PT-N08I32B26-LTLCardinality-03
FORMULA_NAME FileSystem-PT-N08I32B26-LTLCardinality-04
FORMULA_NAME FileSystem-PT-N08I32B26-LTLCardinality-05
FORMULA_NAME FileSystem-PT-N08I32B26-LTLCardinality-06
FORMULA_NAME FileSystem-PT-N08I32B26-LTLCardinality-07
FORMULA_NAME FileSystem-PT-N08I32B26-LTLCardinality-08
FORMULA_NAME FileSystem-PT-N08I32B26-LTLCardinality-09
FORMULA_NAME FileSystem-PT-N08I32B26-LTLCardinality-10
FORMULA_NAME FileSystem-PT-N08I32B26-LTLCardinality-11
FORMULA_NAME FileSystem-PT-N08I32B26-LTLCardinality-12
FORMULA_NAME FileSystem-PT-N08I32B26-LTLCardinality-13
FORMULA_NAME FileSystem-PT-N08I32B26-LTLCardinality-14
FORMULA_NAME FileSystem-PT-N08I32B26-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1781616551013

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FileSystem-PT-N08I32B26
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-06-16 13:29:12] [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-06-16 13:29:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-16 13:29:13] [INFO ] Load time of PNML (sax parser for PT used): 564 ms
[2026-06-16 13:29:13] [INFO ] Transformed 4335 places.
[2026-06-16 13:29:13] [INFO ] Transformed 4224 transitions.
[2026-06-16 13:29:13] [INFO ] Parsed PT model containing 4335 places and 4224 transitions and 15136 arcs in 793 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Reduce places removed 32 places and 0 transitions.
FORMULA FileSystem-PT-N08I32B26-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 59 out of 4303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4303/4303 places, 4224/4224 transitions.
Reduce places removed 825 places and 0 transitions.
Iterating post reduction 0 with 825 rules applied. Total rules applied 825 place count 3478 transition count 4224
Discarding 790 places :
Symmetric choice reduction at 1 with 790 rule applications. Total rules 1615 place count 2688 transition count 3434
Iterating global reduction 1 with 790 rules applied. Total rules applied 2405 place count 2688 transition count 3434
Applied a total of 2405 rules in 755 ms. Remains 2688 /4303 variables (removed 1615) and now considering 3434/4224 (removed 790) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13887993064851961687.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7012752665942622606.kers'
[2026-06-16 13:29:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13887993064851961687.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7012752665942622606.kers]
Culling duplicate invariants (modulo rational): removing 26 columns.
Culled 26 columns in 3 ms.
// Phase 1: matrix 3434 rows 2662 cols 9445 entries
Finished phase 1 with 2634 SingleSign rule and 0 generalized
[2026-06-16 13:29:14] [INFO ] Computed 54 invariants in 131 ms
Computed 54 P flows in 132 ms.
Exported basis to /tmp/petrispot-output-7012752665942622606.kers
Total runtime 137 ms.
[2026-06-16 13:29:18] [INFO ] Implicit Places using invariants in 3982 ms returned []
[2026-06-16 13:29:18] [INFO ] Invariant cache hit.
[2026-06-16 13:29:21] [INFO ] State equation strengthened by 832 read => feed constraints.
[2026-06-16 13:29:52] [INFO ] Performed 882/2688 implicitness test of which 0 returned IMPLICIT in 31 seconds.
[2026-06-16 13:30:23] [INFO ] Performed 1016/2688 implicitness test of which 0 returned IMPLICIT in 61 seconds.
[2026-06-16 13:30:53] [INFO ] Performed 2083/2688 implicitness test of which 0 returned IMPLICIT in 91 seconds.
[2026-06-16 13:31:23] [INFO ] Performed 2399/2688 implicitness test of which 0 returned IMPLICIT in 121 seconds.
[2026-06-16 13:31:23] [INFO ] Timeout of Implicit test with SMT after 121 seconds.
[2026-06-16 13:31:23] [INFO ] Implicit Places using invariants and state equation in 124916 ms returned []
Implicit Place search using SMT with State Equation took 128953 ms to find 0 implicit places.
Running 3402 sub problems to find dead transitions.
[2026-06-16 13:31:23] [INFO ] Invariant cache hit.
[2026-06-16 13:31:23] [INFO ] State equation strengthened by 832 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/2648 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 3402 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2648/6122 variables, and 52 constraints, problems are : Problem set: 0 solved, 3402 unsolved in 30125 ms.
Refiners :[Positive P Invariants (semi-flows): 52/54 constraints, State Equation: 0/2688 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 3402/3402 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3402 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2648 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 3402 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2648/6122 variables, and 52 constraints, problems are : Problem set: 0 solved, 3402 unsolved in 30088 ms.
Refiners :[Positive P Invariants (semi-flows): 52/54 constraints, State Equation: 0/2688 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 0/3402 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62652ms problems are : Problem set: 0 solved, 3402 unsolved
Search for dead transitions found 0 dead transitions in 62725ms
Starting structural reductions in LTL mode, iteration 1 : 2688/4303 places, 3434/4224 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 192516 ms. Remains : 2688/4303 places, 3434/4224 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2688/2688 places, 3434/3434 transitions.
Applied a total of 0 rules in 155 ms. Remains 2688 /2688 variables (removed 0) and now considering 3434/3434 (removed 0) transitions.
[2026-06-16 13:32:26] [INFO ] Invariant cache hit.
[2026-06-16 13:32:29] [INFO ] Implicit Places using invariants in 3070 ms returned []
[2026-06-16 13:32:29] [INFO ] Invariant cache hit.
[2026-06-16 13:32:32] [INFO ] State equation strengthened by 832 read => feed constraints.
[2026-06-16 13:33:02] [INFO ] Performed 882/2688 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-06-16 13:33:33] [INFO ] Performed 1016/2688 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-06-16 13:34:03] [INFO ] Performed 2078/2688 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2026-06-16 13:34:33] [INFO ] Performed 2397/2688 implicitness test of which 0 returned IMPLICIT in 121 seconds.
[2026-06-16 13:34:33] [INFO ] Timeout of Implicit test with SMT after 121 seconds.
[2026-06-16 13:34:33] [INFO ] Implicit Places using invariants and state equation in 123821 ms returned []
Implicit Place search using SMT with State Equation took 126893 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 127051 ms. Remains : 2688/2688 places, 3434/3434 transitions.
Support contains 59 out of 2688 places after structural reductions.
[2026-06-16 13:34:34] [INFO ] Flatten gal took : 321 ms
[2026-06-16 13:34:34] [INFO ] Flatten gal took : 221 ms
[2026-06-16 13:34:34] [INFO ] Input system was already deterministic with 3434 transitions.
RANDOM walk for 40000 steps (8 resets) in 3046 ms. (13 steps per ms) remains 19/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 19/19 properties
[2026-06-16 13:34:36] [INFO ] Invariant cache hit.
[2026-06-16 13:34:36] [INFO ] State equation strengthened by 832 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp31 is UNSAT
At refinement iteration 1 (OVERLAPS) 2617/2647 variables, 15/15 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2647 variables, 0/15 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 39/2686 variables, 39/54 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2686 variables, 0/54 constraints. Problems are: Problem set: 5 solved, 14 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp18 is UNSAT
At refinement iteration 5 (OVERLAPS) 3434/6120 variables, 2686/2740 constraints. Problems are: Problem set: 8 solved, 11 unsolved
SMT process timed out in 5098ms, After SMT, problems are : Problem set: 8 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 20 out of 2688 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2688/2688 places, 3434/3434 transitions.
Graph (complete) has 6911 edges and 2688 vertex of which 2685 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.18 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 2685 transition count 3403
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 63 place count 2654 transition count 3403
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 72 place count 2645 transition count 3394
Iterating global reduction 2 with 9 rules applied. Total rules applied 81 place count 2645 transition count 3394
Performed 849 Post agglomeration using F-continuation condition.Transition count delta: 849
Deduced a syphon composed of 849 places in 2 ms
Reduce places removed 849 places and 0 transitions.
Iterating global reduction 2 with 1698 rules applied. Total rules applied 1779 place count 1796 transition count 2545
Free-agglomeration rule (complex) applied 826 times.
Iterating global reduction 2 with 826 rules applied. Total rules applied 2605 place count 1796 transition count 1719
Reduce places removed 836 places and 0 transitions.
Iterating post reduction 2 with 836 rules applied. Total rules applied 3441 place count 960 transition count 1719
Applied a total of 3441 rules in 1461 ms. Remains 960 /2688 variables (removed 1728) and now considering 1719/3434 (removed 1715) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1462 ms. Remains : 960/2688 places, 1719/3434 transitions.
RANDOM walk for 40000 steps (8 resets) in 495 ms. (80 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 106 ms. (373 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 114 ms. (347 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 80 ms. (493 steps per ms) remains 8/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 8/8 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6092712572376632345.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12808927646841213033.kers'
[2026-06-16 13:34:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6092712572376632345.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12808927646841213033.kers]
Culling duplicate invariants (modulo rational): removing 36 columns.
Culled 36 columns in 1 ms.
// Phase 1: matrix 1719 rows 924 cols 4332 entries
Finished phase 1 with 907 SingleSign rule and 9 generalized
[2026-06-16 13:34:43] [INFO ] Computed 44 invariants in 24 ms
Computed 44 P flows in 25 ms.
Exported basis to /tmp/petrispot-output-12808927646841213033.kers
Total runtime 27 ms.
[2026-06-16 13:34:43] [INFO ] State equation strengthened by 832 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 12/25 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 900/925 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/925 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 34/959 variables, 34/44 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/959 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp34 is UNSAT
At refinement iteration 7 (OVERLAPS) 1719/2678 variables, 959/1003 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2678 variables, 832/1835 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2678 variables, 0/1835 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 1/2679 variables, 1/1836 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2679 variables, 0/1836 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/2679 variables, 0/1836 constraints. Problems are: Problem set: 2 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2679/2679 variables, and 1836 constraints, problems are : Problem set: 2 solved, 6 unsolved in 3514 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 960/960 constraints, ReadFeed: 832/832 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 12/23 variables, 8/8 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 1/9 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 902/925 variables, 2/11 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/925 variables, 20/31 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/925 variables, 7/38 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/925 variables, 0/38 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 34/959 variables, 34/72 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/959 variables, 0/72 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 1719/2678 variables, 959/1031 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2678 variables, 832/1863 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2678 variables, 6/1869 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2678 variables, 0/1869 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 1/2679 variables, 1/1870 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2679 variables, 0/1870 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/2679 variables, 0/1870 constraints. Problems are: Problem set: 2 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2679/2679 variables, and 1870 constraints, problems are : Problem set: 2 solved, 6 unsolved in 21575 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 960/960 constraints, ReadFeed: 832/832 constraints, PredecessorRefiner: 6/8 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25157ms problems are : Problem set: 2 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 971 ms.
Support contains 9 out of 960 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 960/960 places, 1719/1719 transitions.
Graph (complete) has 4063 edges and 960 vertex of which 958 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 958 transition count 1718
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 957 transition count 1718
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 25 place count 944 transition count 1709
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 30 place count 944 transition count 1704
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 39 place count 935 transition count 1704
Applied a total of 39 rules in 387 ms. Remains 935 /960 variables (removed 25) and now considering 1704/1719 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 387 ms. Remains : 935/960 places, 1704/1719 transitions.
RANDOM walk for 40000 steps (8 resets) in 424 ms. (94 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 95 ms. (416 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 95 ms. (416 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 96 ms. (412 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 124343 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :0 out of 5
Probabilistic random walk after 124343 steps, saw 103658 distinct states, run finished after 3010 ms. (steps per millisecond=41 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17074672922991240256.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3255675293977845958.kers'
[2026-06-16 13:35:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17074672922991240256.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3255675293977845958.kers]
Culling duplicate invariants (modulo rational): removing 34 columns.
Culled 34 columns in 1 ms.
// Phase 1: matrix 1704 rows 901 cols 4274 entries
Finished phase 1 with 896 SingleSign rule and 3 generalized
[2026-06-16 13:35:13] [INFO ] Computed 36 invariants in 24 ms
Computed 36 P flows in 25 ms.
Exported basis to /tmp/petrispot-output-3255675293977845958.kers
Total runtime 27 ms.
[2026-06-16 13:35:13] [INFO ] State equation strengthened by 832 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 7/16 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 892/908 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/908 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 27/935 variables, 27/36 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/935 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 1704/2639 variables, 935/971 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2639 variables, 832/1803 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2639 variables, 0/1803 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/2639 variables, 0/1803 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2639/2639 variables, and 1803 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1947 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 935/935 constraints, ReadFeed: 832/832 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 7/16 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 892/908 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/908 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/908 variables, 10/39 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/908 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 27/935 variables, 27/66 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/935 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1704/2639 variables, 935/1001 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2639 variables, 832/1833 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2639 variables, 5/1838 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2639 variables, 0/1838 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/2639 variables, 0/1838 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2639/2639 variables, and 1838 constraints, problems are : Problem set: 0 solved, 5 unsolved in 22683 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 935/935 constraints, ReadFeed: 832/832 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24687ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 345 ms.
Support contains 7 out of 935 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 935/935 places, 1704/1704 transitions.
Graph (complete) has 3746 edges and 935 vertex of which 934 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 932 transition count 1703
Applied a total of 4 rules in 118 ms. Remains 932 /935 variables (removed 3) and now considering 1703/1704 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 932/935 places, 1703/1704 transitions.
RANDOM walk for 40000 steps (8 resets) in 307 ms. (129 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 149102 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :1 out of 4
Probabilistic random walk after 149102 steps, saw 124341 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :1
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2366838127668090454.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9893775624461027219.kers'
[2026-06-16 13:35:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2366838127668090454.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9893775624461027219.kers]
Culling duplicate invariants (modulo rational): removing 33 columns.
Culled 33 columns in 1 ms.
// Phase 1: matrix 1703 rows 899 cols 4271 entries
Finished phase 1 with 894 SingleSign rule and 3 generalized
[2026-06-16 13:35:41] [INFO ] Computed 35 invariants in 22 ms
Computed 35 P flows in 22 ms.
Exported basis to /tmp/petrispot-output-9893775624461027219.kers
Total runtime 24 ms.
[2026-06-16 13:35:41] [INFO ] State equation strengthened by 832 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/11 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 893/904 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/904 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 28/932 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/932 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1703/2635 variables, 932/967 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2635 variables, 832/1799 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2635 variables, 0/1799 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/2635 variables, 0/1799 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2635/2635 variables, and 1799 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1492 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 932/932 constraints, ReadFeed: 832/832 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/11 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 893/904 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/904 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/904 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/904 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 28/932 variables, 28/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/932 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1703/2635 variables, 932/991 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2635 variables, 832/1823 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2635 variables, 3/1826 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2635 variables, 0/1826 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/2635 variables, 0/1826 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2635/2635 variables, and 1826 constraints, problems are : Problem set: 0 solved, 3 unsolved in 18238 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 932/932 constraints, ReadFeed: 832/832 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19786ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 479 ms.
Support contains 6 out of 932 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 932/932 places, 1703/1703 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 932 transition count 1702
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 930 transition count 1702
Applied a total of 3 rules in 139 ms. Remains 930 /932 variables (removed 2) and now considering 1702/1703 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 930/932 places, 1702/1703 transitions.
RANDOM walk for 40000 steps (8 resets) in 235 ms. (169 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 119 ms. (333 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 190976 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 3
Probabilistic random walk after 190976 steps, saw 156177 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7386340185544298824.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15041258100485284676.kers'
[2026-06-16 13:36:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7386340185544298824.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15041258100485284676.kers]
Culling duplicate invariants (modulo rational): removing 32 columns.
Culled 32 columns in 1 ms.
// Phase 1: matrix 1702 rows 898 cols 4269 entries
Finished phase 1 with 894 SingleSign rule and 2 generalized
[2026-06-16 13:36:05] [INFO ] Computed 34 invariants in 24 ms
Computed 34 P flows in 25 ms.
Exported basis to /tmp/petrispot-output-15041258100485284676.kers
Total runtime 26 ms.
[2026-06-16 13:36:05] [INFO ] State equation strengthened by 832 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/11 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 892/903 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/903 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 27/930 variables, 27/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/930 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1702/2632 variables, 930/964 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2632 variables, 832/1796 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2632 variables, 0/1796 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/2632 variables, 0/1796 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2632/2632 variables, and 1796 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2066 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 930/930 constraints, ReadFeed: 832/832 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/11 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 892/903 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/903 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/903 variables, 9/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/903 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 27/930 variables, 27/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/930 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1702/2632 variables, 930/993 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2632 variables, 832/1825 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2632 variables, 3/1828 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2632 variables, 0/1828 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/2632 variables, 0/1828 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2632/2632 variables, and 1828 constraints, problems are : Problem set: 0 solved, 3 unsolved in 20782 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 930/930 constraints, ReadFeed: 832/832 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22905ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 267 ms.
Support contains 6 out of 930 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 930/930 places, 1702/1702 transitions.
Applied a total of 0 rules in 64 ms. Remains 930 /930 variables (removed 0) and now considering 1702/1702 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 930/930 places, 1702/1702 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 930/930 places, 1702/1702 transitions.
Applied a total of 0 rules in 62 ms. Remains 930 /930 variables (removed 0) and now considering 1702/1702 (removed 0) transitions.
[2026-06-16 13:36:28] [INFO ] Invariant cache hit.
[2026-06-16 13:36:29] [INFO ] Implicit Places using invariants in 1346 ms returned []
[2026-06-16 13:36:29] [INFO ] Invariant cache hit.
[2026-06-16 13:36:30] [INFO ] State equation strengthened by 832 read => feed constraints.
[2026-06-16 13:36:58] [INFO ] Implicit Places using invariants and state equation in 28528 ms returned []
Implicit Place search using SMT with State Equation took 29878 ms to find 0 implicit places.
[2026-06-16 13:36:58] [INFO ] Redundant transitions in 101 ms returned []
Running 1670 sub problems to find dead transitions.
[2026-06-16 13:36:58] [INFO ] Invariant cache hit.
[2026-06-16 13:36:58] [INFO ] State equation strengthened by 832 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/896 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 1670 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 896/2632 variables, and 32 constraints, problems are : Problem set: 0 solved, 1670 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/930 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 1670/1670 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1670 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/896 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 1670 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 896/2632 variables, and 32 constraints, problems are : Problem set: 0 solved, 1670 unsolved in 30063 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/930 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 0/1670 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60786ms problems are : Problem set: 0 solved, 1670 unsolved
Search for dead transitions found 0 dead transitions in 60792ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90850 ms. Remains : 930/930 places, 1702/1702 transitions.
FORMULA FileSystem-PT-N08I32B26-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA FileSystem-PT-N08I32B26-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 10 atomic propositions for a total of 13 simplifications.
FORMULA FileSystem-PT-N08I32B26-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N08I32B26-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N08I32B26-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N08I32B26-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 166 stabilizing places and 938 stable transitions
Graph (complete) has 6937 edges and 2688 vertex of which 2681 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.42 ms
FORMULA FileSystem-PT-N08I32B26-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N08I32B26-LTLCardinality-15 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' '!(G(F(p0)))'
Support contains 3 out of 2688 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2688/2688 places, 3434/3434 transitions.
Graph (complete) has 6937 edges and 2688 vertex of which 2681 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.15 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 2681 transition count 3402
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 65 place count 2649 transition count 3402
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 81 place count 2633 transition count 3386
Iterating global reduction 2 with 16 rules applied. Total rules applied 97 place count 2633 transition count 3386
Performed 857 Post agglomeration using F-continuation condition.Transition count delta: 857
Deduced a syphon composed of 857 places in 2 ms
Reduce places removed 857 places and 0 transitions.
Iterating global reduction 2 with 1714 rules applied. Total rules applied 1811 place count 1776 transition count 2529
Applied a total of 1811 rules in 962 ms. Remains 1776 /2688 variables (removed 912) and now considering 2529/3434 (removed 905) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8170572196623219539.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6936839697675274595.kers'
[2026-06-16 13:38:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8170572196623219539.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6936839697675274595.kers]
Culling duplicate invariants (modulo rational): removing 26 columns.
Culled 26 columns in 2 ms.
// Phase 1: matrix 2529 rows 1750 cols 8418 entries
Finished phase 1 with 1722 SingleSign rule and 0 generalized
[2026-06-16 13:38:00] [INFO ] Computed 54 invariants in 61 ms
Computed 54 P flows in 62 ms.
Exported basis to /tmp/petrispot-output-6936839697675274595.kers
Total runtime 65 ms.
[2026-06-16 13:38:03] [INFO ] Implicit Places using invariants in 3220 ms returned []
[2026-06-16 13:38:03] [INFO ] Invariant cache hit.
[2026-06-16 13:38:05] [INFO ] State equation strengthened by 832 read => feed constraints.
[2026-06-16 13:38:36] [INFO ] Performed 923/1776 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-06-16 13:39:06] [INFO ] Performed 992/1776 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-06-16 13:39:36] [INFO ] Performed 1378/1776 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2026-06-16 13:40:06] [INFO ] Performed 1754/1776 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2026-06-16 13:40:06] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2026-06-16 13:40:06] [INFO ] Implicit Places using invariants and state equation in 122561 ms returned []
Implicit Place search using SMT with State Equation took 125784 ms to find 0 implicit places.
[2026-06-16 13:40:06] [INFO ] Redundant transitions in 190 ms returned []
Running 2497 sub problems to find dead transitions.
[2026-06-16 13:40:06] [INFO ] Invariant cache hit.
[2026-06-16 13:40:06] [INFO ] State equation strengthened by 832 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1743 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 2497 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1743/4305 variables, and 52 constraints, problems are : Problem set: 0 solved, 2497 unsolved in 30073 ms.
Refiners :[Positive P Invariants (semi-flows): 52/54 constraints, State Equation: 0/1776 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 2497/2497 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2497 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1743 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 2497 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1743/4305 variables, and 52 constraints, problems are : Problem set: 0 solved, 2497 unsolved in 30082 ms.
Refiners :[Positive P Invariants (semi-flows): 52/54 constraints, State Equation: 0/1776 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 0/2497 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61588ms problems are : Problem set: 0 solved, 2497 unsolved
Search for dead transitions found 0 dead transitions in 61599ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1776/2688 places, 2529/3434 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 188591 ms. Remains : 1776/2688 places, 2529/3434 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 370 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FileSystem-PT-N08I32B26-LTLCardinality-04
Product exploration explored 100000 steps with 0 reset in 838 ms.
Product exploration explored 100000 steps with 1 reset in 748 ms.
Computed a total of 85 stabilizing places and 864 stable transitions
Computed a total of 85 stabilizing places and 864 stable transitions
Knowledge based reduction with 3 factoid took 73 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 335 steps (0 resets) in 8 ms. (37 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 60 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 85 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 284 ms.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 1776 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1776/1776 places, 2529/2529 transitions.
Applied a total of 0 rules in 180 ms. Remains 1776 /1776 variables (removed 0) and now considering 2529/2529 (removed 0) transitions.
[2026-06-16 13:41:10] [INFO ] Invariant cache hit.
[2026-06-16 13:41:14] [INFO ] Implicit Places using invariants in 3229 ms returned []
[2026-06-16 13:41:14] [INFO ] Invariant cache hit.
[2026-06-16 13:41:16] [INFO ] State equation strengthened by 832 read => feed constraints.
[2026-06-16 13:41:46] [INFO ] Performed 923/1776 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-06-16 13:42:16] [INFO ] Performed 990/1776 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-06-16 13:42:46] [INFO ] Performed 1354/1776 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2026-06-16 13:43:16] [INFO ] Performed 1738/1776 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2026-06-16 13:43:16] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2026-06-16 13:43:16] [INFO ] Implicit Places using invariants and state equation in 122799 ms returned []
Implicit Place search using SMT with State Equation took 126033 ms to find 0 implicit places.
[2026-06-16 13:43:16] [INFO ] Redundant transitions in 67 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 126290 ms. Remains : 1776/1776 places, 2529/2529 transitions.
Computed a total of 85 stabilizing places and 864 stable transitions
Computed a total of 85 stabilizing places and 864 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 508 steps (0 resets) in 8 ms. (56 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 59 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 85 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 228 ms.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5 reset in 561 ms.
Product exploration explored 100000 steps with 0 reset in 536 ms.
Built C files in :
/tmp/ltsmin10692528374882124034
[2026-06-16 13:43:18] [INFO ] Too many transitions (2529) to apply POR reductions. Disabling POR matrices.
[2026-06-16 13:43:18] [INFO ] Built C files in 95ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10692528374882124034
Running compilation step : cd /tmp/ltsmin10692528374882124034;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10692528374882124034;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10692528374882124034;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 3 out of 1776 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1776/1776 places, 2529/2529 transitions.
Applied a total of 0 rules in 101 ms. Remains 1776 /1776 variables (removed 0) and now considering 2529/2529 (removed 0) transitions.
[2026-06-16 13:43:21] [INFO ] Invariant cache hit.
[2026-06-16 13:43:24] [INFO ] Implicit Places using invariants in 2483 ms returned []
[2026-06-16 13:43:24] [INFO ] Invariant cache hit.
[2026-06-16 13:43:25] [INFO ] State equation strengthened by 832 read => feed constraints.
[2026-06-16 13:43:56] [INFO ] Performed 923/1776 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-06-16 13:44:26] [INFO ] Performed 999/1776 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-06-16 13:44:56] [INFO ] Performed 1376/1776 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2026-06-16 13:45:26] [INFO ] Performed 1770/1776 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2026-06-16 13:45:26] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2026-06-16 13:45:26] [INFO ] Implicit Places using invariants and state equation in 122438 ms returned []
Implicit Place search using SMT with State Equation took 124923 ms to find 0 implicit places.
[2026-06-16 13:45:26] [INFO ] Redundant transitions in 69 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 125102 ms. Remains : 1776/1776 places, 2529/2529 transitions.
Built C files in :
/tmp/ltsmin4924799939368611814
[2026-06-16 13:45:26] [INFO ] Too many transitions (2529) to apply POR reductions. Disabling POR matrices.
[2026-06-16 13:45:26] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4924799939368611814
Running compilation step : cd /tmp/ltsmin4924799939368611814;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4924799939368611814;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4924799939368611814;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-06-16 13:45:30] [INFO ] Flatten gal took : 106 ms
[2026-06-16 13:45:30] [INFO ] Flatten gal took : 118 ms
[2026-06-16 13:45:30] [INFO ] Time to serialize gal into /tmp/LTL2462401845479737806.gal : 41 ms
[2026-06-16 13:45:30] [INFO ] Time to serialize properties into /tmp/LTL7787379215633176470.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2462401845479737806.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5717216198864374388.hoa' '-atoms' '/tmp/LTL7787379215633176470.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL7787379215633176470.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5717216198864374388.hoa
Detected timeout of ITS tools.
[2026-06-16 13:45:45] [INFO ] Flatten gal took : 84 ms
[2026-06-16 13:45:45] [INFO ] Flatten gal took : 84 ms
[2026-06-16 13:45:45] [INFO ] Time to serialize gal into /tmp/LTL3120655429572168614.gal : 26 ms
[2026-06-16 13:45:45] [INFO ] Time to serialize properties into /tmp/LTL12549017293444026960.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3120655429572168614.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12549017293444026960.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((busy_52_59<=beginloop_27_48)&&(testbusy_19_33<3))"))))
Formula 0 simplified : FG!"((busy_52_59<=beginloop_27_48)&&(testbusy_19_33<3))"
Detected timeout of ITS tools.
[2026-06-16 13:46:00] [INFO ] Flatten gal took : 83 ms
[2026-06-16 13:46:00] [INFO ] Applying decomposition
[2026-06-16 13:46:00] [INFO ] Flatten gal took : 78 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph12728464937668377888.txt' '-o' '/tmp/graph12728464937668377888.bin' '-w' '/tmp/graph12728464937668377888.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12728464937668377888.bin' '-l' '-1' '-v' '-w' '/tmp/graph12728464937668377888.weights' '-q' '0' '-e' '0.001'
[2026-06-16 13:46:01] [INFO ] Decomposing Gal with order
[2026-06-16 13:46:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-16 13:46:01] [INFO ] Removed a total of 889 redundant transitions.
[2026-06-16 13:46:01] [INFO ] Flatten gal took : 604 ms
[2026-06-16 13:46:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 1060 labels/synchronizations in 114 ms.
[2026-06-16 13:46:02] [INFO ] Time to serialize gal into /tmp/LTL13257565461383946320.gal : 28 ms
[2026-06-16 13:46:02] [INFO ] Time to serialize properties into /tmp/LTL5790247469989715211.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13257565461383946320.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5790247469989715211.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((gu20.busy_52_59<=gu20.beginloop_27_48)&&(gi1.gi0.gu14.testbusy_19_33<3))"))))
Formula 0 simplified : FG!"((gu20.busy_52_59<=gu20.beginloop_27_48)&&(gi1.gi0.gu14.testbusy_19_33<3))"
Detected timeout of ITS tools.
Treatment of property FileSystem-PT-N08I32B26-LTLCardinality-04 finished in 498042 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 4 out of 2688 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2688/2688 places, 3434/3434 transitions.
Graph (complete) has 6937 edges and 2688 vertex of which 2682 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 2682 transition count 3402
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 65 place count 2650 transition count 3402
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 80 place count 2635 transition count 3387
Iterating global reduction 2 with 15 rules applied. Total rules applied 95 place count 2635 transition count 3387
Performed 855 Post agglomeration using F-continuation condition.Transition count delta: 855
Deduced a syphon composed of 855 places in 3 ms
Reduce places removed 855 places and 0 transitions.
Iterating global reduction 2 with 1710 rules applied. Total rules applied 1805 place count 1780 transition count 2532
Applied a total of 1805 rules in 578 ms. Remains 1780 /2688 variables (removed 908) and now considering 2532/3434 (removed 902) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1081199979109215502.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7900593344525626524.kers'
[2026-06-16 13:46:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1081199979109215502.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7900593344525626524.kers]
Culling duplicate invariants (modulo rational): removing 26 columns.
Culled 26 columns in 2 ms.
// Phase 1: matrix 2532 rows 1754 cols 8425 entries
Finished phase 1 with 1726 SingleSign rule and 0 generalized
[2026-06-16 13:46:18] [INFO ] Computed 54 invariants in 60 ms
Computed 54 P flows in 60 ms.
Exported basis to /tmp/petrispot-output-7900593344525626524.kers
Total runtime 63 ms.
[2026-06-16 13:46:21] [INFO ] Implicit Places using invariants in 2880 ms returned []
[2026-06-16 13:46:21] [INFO ] Invariant cache hit.
[2026-06-16 13:46:23] [INFO ] State equation strengthened by 832 read => feed constraints.
[2026-06-16 13:46:54] [INFO ] Performed 925/1780 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-06-16 13:47:24] [INFO ] Performed 1006/1780 implicitness test of which 0 returned IMPLICIT in 61 seconds.
[2026-06-16 13:47:54] [INFO ] Performed 1399/1780 implicitness test of which 0 returned IMPLICIT in 91 seconds.
[2026-06-16 13:48:24] [INFO ] Performed 1771/1780 implicitness test of which 0 returned IMPLICIT in 121 seconds.
[2026-06-16 13:48:24] [INFO ] Timeout of Implicit test with SMT after 121 seconds.
[2026-06-16 13:48:24] [INFO ] Implicit Places using invariants and state equation in 123244 ms returned []
Implicit Place search using SMT with State Equation took 126128 ms to find 0 implicit places.
[2026-06-16 13:48:24] [INFO ] Redundant transitions in 73 ms returned []
Running 2500 sub problems to find dead transitions.
[2026-06-16 13:48:24] [INFO ] Invariant cache hit.
[2026-06-16 13:48:24] [INFO ] State equation strengthened by 832 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1746 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 2500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1746/4312 variables, and 52 constraints, problems are : Problem set: 0 solved, 2500 unsolved in 30079 ms.
Refiners :[Positive P Invariants (semi-flows): 52/54 constraints, State Equation: 0/1780 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 2500/2500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2500 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1746 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 2500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1746/4312 variables, and 52 constraints, problems are : Problem set: 0 solved, 2500 unsolved in 30090 ms.
Refiners :[Positive P Invariants (semi-flows): 52/54 constraints, State Equation: 0/1780 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 0/2500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61698ms problems are : Problem set: 0 solved, 2500 unsolved
Search for dead transitions found 0 dead transitions in 61708ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1780/2688 places, 2532/3434 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 188507 ms. Remains : 1780/2688 places, 2532/3434 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 61 ms :[(NOT p0)]
Running random walk in product with property : FileSystem-PT-N08I32B26-LTLCardinality-05
Product exploration explored 100000 steps with 0 reset in 682 ms.
Product exploration explored 100000 steps with 0 reset in 678 ms.
Computed a total of 87 stabilizing places and 865 stable transitions
Graph (complete) has 6028 edges and 1780 vertex of which 1779 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 87 stabilizing places and 865 stable transitions
Knowledge based reduction with 3 factoid took 49 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 17891 steps (4 resets) in 114 ms. (155 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 56 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2026-06-16 13:49:27] [INFO ] Invariant cache hit.
[2026-06-16 13:49:34] [INFO ] [Real]Absence check using 54 positive place invariants in 1411 ms returned sat
[2026-06-16 13:49:42] [INFO ] [Real]Absence check using state equation in 7971 ms returned unknown
Could not prove EG (NOT p0)
Knowledge-based reduction took 15260 ms.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Support contains 4 out of 1780 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1780/1780 places, 2532/2532 transitions.
Applied a total of 0 rules in 99 ms. Remains 1780 /1780 variables (removed 0) and now considering 2532/2532 (removed 0) transitions.
[2026-06-16 13:49:42] [INFO ] Invariant cache hit.
[2026-06-16 13:49:45] [INFO ] Implicit Places using invariants in 2805 ms returned []
[2026-06-16 13:49:45] [INFO ] Invariant cache hit.
[2026-06-16 13:49:47] [INFO ] State equation strengthened by 832 read => feed constraints.
[2026-06-16 13:50:18] [INFO ] Performed 925/1780 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-06-16 13:50:48] [INFO ] Performed 1016/1780 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-06-16 13:51:18] [INFO ] Performed 1411/1780 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2026-06-16 13:51:46] [INFO ] Implicit Places using invariants and state equation in 121177 ms returned []
Implicit Place search using SMT with State Equation took 123988 ms to find 0 implicit places.
[2026-06-16 13:51:47] [INFO ] Redundant transitions in 115 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 124214 ms. Remains : 1780/1780 places, 2532/2532 transitions.
Computed a total of 87 stabilizing places and 865 stable transitions
Graph (complete) has 6028 edges and 1780 vertex of which 1779 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Computed a total of 87 stabilizing places and 865 stable transitions
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 30398 steps (6 resets) in 259 ms. (116 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
[2026-06-16 13:51:47] [INFO ] Invariant cache hit.
[2026-06-16 13:51:55] [INFO ] [Real]Absence check using 54 positive place invariants in 1795 ms returned sat
[2026-06-16 13:52:02] [INFO ] [Real]Absence check using state equation in 7435 ms returned unknown
Could not prove EG (NOT p0)
Knowledge-based reduction took 15386 ms.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 497 ms.
Stack based approach found an accepted trace after 97313 steps with 0 reset with depth 97314 and stack size 49645 in 590 ms.
FORMULA FileSystem-PT-N08I32B26-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property FileSystem-PT-N08I32B26-LTLCardinality-05 finished in 346070 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(p0)&&F(p1)&&X(X(p2))) U p3))'
Support contains 8 out of 2688 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2688/2688 places, 3434/3434 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 2682 transition count 3434
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 21 place count 2667 transition count 3419
Iterating global reduction 1 with 15 rules applied. Total rules applied 36 place count 2667 transition count 3419
Applied a total of 36 rules in 304 ms. Remains 2667 /2688 variables (removed 21) and now considering 3419/3434 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8938640598986865471.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12498642966656092152.kers'
[2026-06-16 13:52:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8938640598986865471.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12498642966656092152.kers]
Culling duplicate invariants (modulo rational): removing 26 columns.
Culled 26 columns in 3 ms.
// Phase 1: matrix 3419 rows 2641 cols 9394 entries
Finished phase 1 with 2613 SingleSign rule and 0 generalized
[2026-06-16 13:52:04] [INFO ] Computed 54 invariants in 121 ms
Computed 54 P flows in 121 ms.
Exported basis to /tmp/petrispot-output-12498642966656092152.kers
Total runtime 124 ms.
[2026-06-16 13:52:07] [INFO ] Implicit Places using invariants in 3978 ms returned []
[2026-06-16 13:52:07] [INFO ] Invariant cache hit.
[2026-06-16 13:52:10] [INFO ] State equation strengthened by 832 read => feed constraints.
[2026-06-16 13:52:43] [INFO ] Performed 911/2667 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2026-06-16 13:53:13] [INFO ] Performed 1946/2667 implicitness test of which 0 returned IMPLICIT in 62 seconds.
[2026-06-16 13:53:43] [INFO ] Performed 2358/2667 implicitness test of which 0 returned IMPLICIT in 92 seconds.
[2026-06-16 13:54:04] [INFO ] Implicit Places using invariants and state equation in 116643 ms returned []
Implicit Place search using SMT with State Equation took 120626 ms to find 0 implicit places.
Running 3387 sub problems to find dead transitions.
[2026-06-16 13:54:04] [INFO ] Invariant cache hit.
[2026-06-16 13:54:04] [INFO ] State equation strengthened by 832 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/2633 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 3387 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2633/6086 variables, and 52 constraints, problems are : Problem set: 0 solved, 3387 unsolved in 30103 ms.
Refiners :[Positive P Invariants (semi-flows): 52/54 constraints, State Equation: 0/2667 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 3387/3387 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3387 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2633 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 3387 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2633/6086 variables, and 52 constraints, problems are : Problem set: 0 solved, 3387 unsolved in 30103 ms.
Refiners :[Positive P Invariants (semi-flows): 52/54 constraints, State Equation: 0/2667 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 0/3387 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62153ms problems are : Problem set: 0 solved, 3387 unsolved
Search for dead transitions found 0 dead transitions in 62163ms
Starting structural reductions in LTL mode, iteration 1 : 2667/2688 places, 3419/3434 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 183108 ms. Remains : 2667/2688 places, 3419/3434 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(p0)&&F(p1)&&X(X(p2))) U p3))'
Stuttering acceptance computed with spot in 330 ms :[(NOT p3), true, (NOT p0), (NOT p1), (NOT p2), (NOT p2)]
Running random walk in product with property : FileSystem-PT-N08I32B26-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 337 steps with 0 reset in 5 ms.
FORMULA FileSystem-PT-N08I32B26-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FileSystem-PT-N08I32B26-LTLCardinality-06 finished in 183514 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 U p1))))'
Support contains 5 out of 2688 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2688/2688 places, 3434/3434 transitions.
Graph (complete) has 6937 edges and 2688 vertex of which 2682 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.6 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 2682 transition count 3402
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 65 place count 2650 transition count 3402
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 80 place count 2635 transition count 3387
Iterating global reduction 2 with 15 rules applied. Total rules applied 95 place count 2635 transition count 3387
Performed 855 Post agglomeration using F-continuation condition.Transition count delta: 855
Deduced a syphon composed of 855 places in 2 ms
Reduce places removed 855 places and 0 transitions.
Iterating global reduction 2 with 1710 rules applied. Total rules applied 1805 place count 1780 transition count 2532
Applied a total of 1805 rules in 827 ms. Remains 1780 /2688 variables (removed 908) and now considering 2532/3434 (removed 902) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8507051399793045566.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6648852373603038730.kers'
[2026-06-16 13:55:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8507051399793045566.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6648852373603038730.kers]
Culling duplicate invariants (modulo rational): removing 26 columns.
Culled 26 columns in 4 ms.
// Phase 1: matrix 2532 rows 1754 cols 8425 entries
Finished phase 1 with 1726 SingleSign rule and 0 generalized
[2026-06-16 13:55:08] [INFO ] Computed 54 invariants in 97 ms
Computed 54 P flows in 98 ms.
Exported basis to /tmp/petrispot-output-6648852373603038730.kers
Total runtime 100 ms.
[2026-06-16 13:55:11] [INFO ] Implicit Places using invariants in 3111 ms returned []
[2026-06-16 13:55:11] [INFO ] Invariant cache hit.
[2026-06-16 13:55:12] [INFO ] State equation strengthened by 832 read => feed constraints.
[2026-06-16 13:55:43] [INFO ] Performed 928/1780 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-06-16 13:56:13] [INFO ] Performed 1064/1780 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-06-16 13:56:43] [INFO ] Performed 1301/1780 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2026-06-16 13:57:13] [INFO ] Performed 1547/1780 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2026-06-16 13:57:13] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2026-06-16 13:57:13] [INFO ] Implicit Places using invariants and state equation in 122670 ms returned []
Implicit Place search using SMT with State Equation took 125783 ms to find 0 implicit places.
[2026-06-16 13:57:13] [INFO ] Redundant transitions in 86 ms returned []
Running 2500 sub problems to find dead transitions.
[2026-06-16 13:57:13] [INFO ] Invariant cache hit.
[2026-06-16 13:57:13] [INFO ] State equation strengthened by 832 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1746 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 2500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1746/4312 variables, and 52 constraints, problems are : Problem set: 0 solved, 2500 unsolved in 30077 ms.
Refiners :[Positive P Invariants (semi-flows): 52/54 constraints, State Equation: 0/1780 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 2500/2500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2500 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1746 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 2500 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1746/4312 variables, and 52 constraints, problems are : Problem set: 0 solved, 2500 unsolved in 30078 ms.
Refiners :[Positive P Invariants (semi-flows): 52/54 constraints, State Equation: 0/1780 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 0/2500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61615ms problems are : Problem set: 0 solved, 2500 unsolved
Search for dead transitions found 0 dead transitions in 61620ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1780/2688 places, 2532/3434 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 188329 ms. Remains : 1780/2688 places, 2532/3434 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 U p1))))'
Stuttering acceptance computed with spot in 121 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : FileSystem-PT-N08I32B26-LTLCardinality-09
Product exploration explored 100000 steps with 0 reset in 640 ms.
Product exploration explored 100000 steps with 0 reset in 531 ms.
Computed a total of 87 stabilizing places and 865 stable transitions
Graph (complete) has 6028 edges and 1780 vertex of which 1779 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 87 stabilizing places and 865 stable transitions
Knowledge based reduction with 11 factoid took 75 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (8 resets) in 364 ms. (109 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 226 ms. (176 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 200 ms. (199 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 3/3 properties
[2026-06-16 13:58:17] [INFO ] Invariant cache hit.
[2026-06-16 13:58:17] [INFO ] State equation strengthened by 832 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1726/1731 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1731 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 49/1780 variables, 49/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1780 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2532/4312 variables, 1780/1834 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4312 variables, 832/2666 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4312 variables, 0/2666 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/4312 variables, 0/2666 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4312/4312 variables, and 2666 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2522 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, State Equation: 1780/1780 constraints, ReadFeed: 832/832 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1726/1731 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SMT process timed out in 9760ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 1780 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1780/1780 places, 2532/2532 transitions.
Free-agglomeration rule (complex) applied 830 times.
Iterating global reduction 0 with 830 rules applied. Total rules applied 830 place count 1780 transition count 1702
Reduce places removed 851 places and 0 transitions.
Iterating post reduction 0 with 851 rules applied. Total rules applied 1681 place count 929 transition count 1702
Applied a total of 1681 rules in 652 ms. Remains 929 /1780 variables (removed 851) and now considering 1702/2532 (removed 830) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 653 ms. Remains : 929/1780 places, 1702/2532 transitions.
RANDOM walk for 40000 steps (8 resets) in 323 ms. (123 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 87 ms. (454 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 163485 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :0 out of 3
Probabilistic random walk after 163485 steps, saw 112399 distinct states, run finished after 3001 ms. (steps per millisecond=54 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1830832533494080864.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16613007903845519101.kers'
[2026-06-16 13:58:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1830832533494080864.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16613007903845519101.kers]
Culling duplicate invariants (modulo rational): removing 30 columns.
Culled 30 columns in 1 ms.
// Phase 1: matrix 1702 rows 899 cols 4273 entries
Finished phase 1 with 892 SingleSign rule and 4 generalized
[2026-06-16 13:58:30] [INFO ] Computed 33 invariants in 23 ms
Computed 33 P flows in 24 ms.
Exported basis to /tmp/petrispot-output-16613007903845519101.kers
Total runtime 26 ms.
[2026-06-16 13:58:30] [INFO ] State equation strengthened by 832 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 891/899 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/899 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 29/928 variables, 28/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/928 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/929 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/929 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1702/2631 variables, 929/962 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2631 variables, 832/1794 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2631 variables, 0/1794 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/2631 variables, 0/1794 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2631/2631 variables, and 1794 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1748 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 929/929 constraints, ReadFeed: 832/832 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 891/899 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/899 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/899 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/899 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 29/928 variables, 28/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/928 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/929 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/929 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1702/2631 variables, 929/984 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2631 variables, 832/1816 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2631 variables, 3/1819 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2631 variables, 0/1819 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/2631 variables, 0/1819 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2631/2631 variables, and 1819 constraints, problems are : Problem set: 0 solved, 3 unsolved in 19730 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 929/929 constraints, ReadFeed: 832/832 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21530ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 290 ms.
Support contains 5 out of 929 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 929/929 places, 1702/1702 transitions.
Applied a total of 0 rules in 88 ms. Remains 929 /929 variables (removed 0) and now considering 1702/1702 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 929/929 places, 1702/1702 transitions.
RANDOM walk for 40000 steps (8 resets) in 183 ms. (217 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 316483 steps, run timeout after 3001 ms. (steps per millisecond=105 ) properties seen :0 out of 1
Probabilistic random walk after 316483 steps, saw 239091 distinct states, run finished after 3001 ms. (steps per millisecond=105 ) properties seen :0
[2026-06-16 13:58:55] [INFO ] Invariant cache hit.
[2026-06-16 13:58:55] [INFO ] State equation strengthened by 832 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 891/899 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/899 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/899 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/899 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 29/928 variables, 28/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/928 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/929 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/929 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1702/2631 variables, 929/983 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2631 variables, 832/1815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2631 variables, 0/1815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/2631 variables, 0/1815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2631/2631 variables, and 1815 constraints, problems are : Problem set: 0 solved, 1 unsolved in 17373 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 929/929 constraints, ReadFeed: 832/832 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 891/899 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/899 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/899 variables, 7/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/899 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 29/928 variables, 28/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/928 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/929 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/929 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1702/2631 variables, 929/990 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2631 variables, 832/1822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2631 variables, 1/1823 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2631 variables, 0/1823 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/2631 variables, 0/1823 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2631/2631 variables, and 1823 constraints, problems are : Problem set: 0 solved, 1 unsolved in 7785 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 929/929 constraints, ReadFeed: 832/832 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25182ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 72 ms.
Support contains 5 out of 929 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 929/929 places, 1702/1702 transitions.
Applied a total of 0 rules in 54 ms. Remains 929 /929 variables (removed 0) and now considering 1702/1702 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 929/929 places, 1702/1702 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 929/929 places, 1702/1702 transitions.
Applied a total of 0 rules in 55 ms. Remains 929 /929 variables (removed 0) and now considering 1702/1702 (removed 0) transitions.
[2026-06-16 13:59:21] [INFO ] Invariant cache hit.
[2026-06-16 13:59:22] [INFO ] Implicit Places using invariants in 1538 ms returned []
[2026-06-16 13:59:22] [INFO ] Invariant cache hit.
[2026-06-16 13:59:23] [INFO ] State equation strengthened by 832 read => feed constraints.
[2026-06-16 13:59:47] [INFO ] Implicit Places using invariants and state equation in 24372 ms returned []
Implicit Place search using SMT with State Equation took 25913 ms to find 0 implicit places.
[2026-06-16 13:59:47] [INFO ] Redundant transitions in 33 ms returned []
Running 1670 sub problems to find dead transitions.
[2026-06-16 13:59:47] [INFO ] Invariant cache hit.
[2026-06-16 13:59:47] [INFO ] State equation strengthened by 832 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/895 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 1670 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 895/2631 variables, and 31 constraints, problems are : Problem set: 0 solved, 1670 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/929 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 1670/1670 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1670 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/895 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 1670 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 895/2631 variables, and 31 constraints, problems are : Problem set: 0 solved, 1670 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/929 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 0/1670 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60863ms problems are : Problem set: 0 solved, 1670 unsolved
Search for dead transitions found 0 dead transitions in 60868ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86879 ms. Remains : 929/929 places, 1702/1702 transitions.
Knowledge based reduction with 11 factoid took 141 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (NOT p1)]
Knowledge-based reduction took 151590 ms.
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (NOT p1)]
Support contains 5 out of 1780 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1780/1780 places, 2532/2532 transitions.
Applied a total of 0 rules in 161 ms. Remains 1780 /1780 variables (removed 0) and now considering 2532/2532 (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-9762151681974769495.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2190832445034225406.kers'
[2026-06-16 14:00:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9762151681974769495.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2190832445034225406.kers]
Culling duplicate invariants (modulo rational): removing 26 columns.
Culled 26 columns in 4 ms.
// Phase 1: matrix 2532 rows 1754 cols 8425 entries
Finished phase 1 with 1726 SingleSign rule and 0 generalized
[2026-06-16 14:00:48] [INFO ] Computed 54 invariants in 108 ms
Computed 54 P flows in 109 ms.
Exported basis to /tmp/petrispot-output-2190832445034225406.kers
Total runtime 112 ms.
[2026-06-16 14:00:51] [INFO ] Implicit Places using invariants in 2674 ms returned []
[2026-06-16 14:00:51] [INFO ] Invariant cache hit.
[2026-06-16 14:00:52] [INFO ] State equation strengthened by 832 read => feed constraints.
[2026-06-16 14:01:23] [INFO ] Performed 928/1780 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-06-16 14:01:53] [INFO ] Performed 1068/1780 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-06-16 14:02:24] [INFO ] Performed 1320/1780 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2026-06-16 14:02:54] [INFO ] Performed 1565/1780 implicitness test of which 0 returned IMPLICIT in 121 seconds.
[2026-06-16 14:02:54] [INFO ] Timeout of Implicit test with SMT after 121 seconds.
[2026-06-16 14:02:54] [INFO ] Implicit Places using invariants and state equation in 122728 ms returned []
Implicit Place search using SMT with State Equation took 125410 ms to find 0 implicit places.
[2026-06-16 14:02:54] [INFO ] Redundant transitions in 67 ms returned []
Running 2500 sub problems to find dead transitions.
[2026-06-16 14:02:54] [INFO ] Invariant cache hit.
[2026-06-16 14:02:54] [INFO ] State equation strengthened by 832 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1746 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 2500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1746/4312 variables, and 52 constraints, problems are : Problem set: 0 solved, 2500 unsolved in 30079 ms.
Refiners :[Positive P Invariants (semi-flows): 52/54 constraints, State Equation: 0/1780 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 2500/2500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2500 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1746 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 2500 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1746/4312 variables, and 52 constraints, problems are : Problem set: 0 solved, 2500 unsolved in 30079 ms.
Refiners :[Positive P Invariants (semi-flows): 52/54 constraints, State Equation: 0/1780 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 0/2500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61751ms problems are : Problem set: 0 solved, 2500 unsolved
Search for dead transitions found 0 dead transitions in 61757ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 187411 ms. Remains : 1780/1780 places, 2532/2532 transitions.
Computed a total of 87 stabilizing places and 865 stable transitions
Graph (complete) has 6028 edges and 1780 vertex of which 1779 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Computed a total of 87 stabilizing places and 865 stable transitions
Knowledge based reduction with 11 factoid took 83 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (8 resets) in 530 ms. (75 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 177 ms. (224 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 271 ms. (147 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 3/3 properties
[2026-06-16 14:03:56] [INFO ] Invariant cache hit.
[2026-06-16 14:03:56] [INFO ] State equation strengthened by 832 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1726/1731 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1731 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 49/1780 variables, 49/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1780 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2532/4312 variables, 1780/1834 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4312 variables, 832/2666 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4312 variables, 0/2666 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/4312 variables, 0/2666 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4312/4312 variables, and 2666 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2457 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, State Equation: 1780/1780 constraints, ReadFeed: 832/832 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1726/1731 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SMT process timed out in 9168ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 1780 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1780/1780 places, 2532/2532 transitions.
Free-agglomeration rule (complex) applied 830 times.
Iterating global reduction 0 with 830 rules applied. Total rules applied 830 place count 1780 transition count 1702
Reduce places removed 851 places and 0 transitions.
Iterating post reduction 0 with 851 rules applied. Total rules applied 1681 place count 929 transition count 1702
Applied a total of 1681 rules in 392 ms. Remains 929 /1780 variables (removed 851) and now considering 1702/2532 (removed 830) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 392 ms. Remains : 929/1780 places, 1702/2532 transitions.
RANDOM walk for 40000 steps (8 resets) in 371 ms. (107 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 94 ms. (421 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 187614 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 3
Probabilistic random walk after 187614 steps, saw 132371 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5892820117305946704.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2265573771164263054.kers'
[2026-06-16 14:04:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5892820117305946704.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2265573771164263054.kers]
Culling duplicate invariants (modulo rational): removing 30 columns.
Culled 30 columns in 2 ms.
// Phase 1: matrix 1702 rows 899 cols 4273 entries
Finished phase 1 with 892 SingleSign rule and 4 generalized
[2026-06-16 14:04:09] [INFO ] Computed 33 invariants in 37 ms
Computed 33 P flows in 37 ms.
Exported basis to /tmp/petrispot-output-2265573771164263054.kers
Total runtime 39 ms.
[2026-06-16 14:04:09] [INFO ] State equation strengthened by 832 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 891/899 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/899 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 29/928 variables, 28/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/928 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/929 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/929 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1702/2631 variables, 929/962 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2631 variables, 832/1794 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2631 variables, 0/1794 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/2631 variables, 0/1794 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2631/2631 variables, and 1794 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1970 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 929/929 constraints, ReadFeed: 832/832 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 891/899 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/899 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/899 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/899 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 29/928 variables, 28/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/928 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/929 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/929 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1702/2631 variables, 929/984 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2631 variables, 832/1816 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2631 variables, 3/1819 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2631 variables, 0/1819 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/2631 variables, 0/1819 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2631/2631 variables, and 1819 constraints, problems are : Problem set: 0 solved, 3 unsolved in 21888 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 929/929 constraints, ReadFeed: 832/832 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23921ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 700 ms.
Support contains 5 out of 929 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 929/929 places, 1702/1702 transitions.
Applied a total of 0 rules in 54 ms. Remains 929 /929 variables (removed 0) and now considering 1702/1702 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 929/929 places, 1702/1702 transitions.
RANDOM walk for 40000 steps (8 resets) in 161 ms. (246 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 345169 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :0 out of 1
Probabilistic random walk after 345169 steps, saw 262777 distinct states, run finished after 3001 ms. (steps per millisecond=115 ) properties seen :0
[2026-06-16 14:04:37] [INFO ] Invariant cache hit.
[2026-06-16 14:04:37] [INFO ] State equation strengthened by 832 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 891/899 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/899 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/899 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/899 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 29/928 variables, 28/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/928 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/929 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/929 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1702/2631 variables, 929/983 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2631 variables, 832/1815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2631 variables, 0/1815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/2631 variables, 0/1815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2631/2631 variables, and 1815 constraints, problems are : Problem set: 0 solved, 1 unsolved in 16535 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 929/929 constraints, ReadFeed: 832/832 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 891/899 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/899 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/899 variables, 7/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/899 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 29/928 variables, 28/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/928 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/929 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/929 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1702/2631 variables, 929/990 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2631 variables, 832/1822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2631 variables, 1/1823 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2631 variables, 0/1823 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/2631 variables, 0/1823 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2631/2631 variables, and 1823 constraints, problems are : Problem set: 0 solved, 1 unsolved in 8226 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 929/929 constraints, ReadFeed: 832/832 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24777ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 108 ms.
Support contains 5 out of 929 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 929/929 places, 1702/1702 transitions.
Applied a total of 0 rules in 85 ms. Remains 929 /929 variables (removed 0) and now considering 1702/1702 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 929/929 places, 1702/1702 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 929/929 places, 1702/1702 transitions.
Applied a total of 0 rules in 83 ms. Remains 929 /929 variables (removed 0) and now considering 1702/1702 (removed 0) transitions.
[2026-06-16 14:05:02] [INFO ] Invariant cache hit.
[2026-06-16 14:05:03] [INFO ] Implicit Places using invariants in 1484 ms returned []
[2026-06-16 14:05:03] [INFO ] Invariant cache hit.
[2026-06-16 14:05:04] [INFO ] State equation strengthened by 832 read => feed constraints.
[2026-06-16 14:05:27] [INFO ] Implicit Places using invariants and state equation in 23942 ms returned []
Implicit Place search using SMT with State Equation took 25431 ms to find 0 implicit places.
[2026-06-16 14:05:27] [INFO ] Redundant transitions in 33 ms returned []
Running 1670 sub problems to find dead transitions.
[2026-06-16 14:05:27] [INFO ] Invariant cache hit.
[2026-06-16 14:05:27] [INFO ] State equation strengthened by 832 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/895 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 1670 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 895/2631 variables, and 31 constraints, problems are : Problem set: 0 solved, 1670 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/929 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 1670/1670 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1670 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/895 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 1670 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 895/2631 variables, and 31 constraints, problems are : Problem set: 0 solved, 1670 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/929 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 0/1670 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60957ms problems are : Problem set: 0 solved, 1670 unsolved
Search for dead transitions found 0 dead transitions in 60962ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86520 ms. Remains : 929/929 places, 1702/1702 transitions.
Knowledge based reduction with 11 factoid took 130 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (NOT p1)]
Knowledge-based reduction took 152884 ms.
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 489 ms.
Product exploration explored 100000 steps with 0 reset in 554 ms.
Built C files in :
/tmp/ltsmin9816916412647117621
[2026-06-16 14:06:30] [INFO ] Too many transitions (2532) to apply POR reductions. Disabling POR matrices.
[2026-06-16 14:06:30] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9816916412647117621
Running compilation step : cd /tmp/ltsmin9816916412647117621;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9816916412647117621;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9816916412647117621;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 5 out of 1780 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1780/1780 places, 2532/2532 transitions.
Applied a total of 0 rules in 158 ms. Remains 1780 /1780 variables (removed 0) and now considering 2532/2532 (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-658900521919025502.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10758939301883978814.kers'
[2026-06-16 14:06:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-658900521919025502.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10758939301883978814.kers]
Culling duplicate invariants (modulo rational): removing 26 columns.
Culled 26 columns in 4 ms.
// Phase 1: matrix 2532 rows 1754 cols 8425 entries
Finished phase 1 with 1726 SingleSign rule and 0 generalized
[2026-06-16 14:06:33] [INFO ] Computed 54 invariants in 105 ms
Computed 54 P flows in 106 ms.
Exported basis to /tmp/petrispot-output-10758939301883978814.kers
Total runtime 110 ms.
[2026-06-16 14:06:36] [INFO ] Implicit Places using invariants in 2966 ms returned []
[2026-06-16 14:06:36] [INFO ] Invariant cache hit.
[2026-06-16 14:06:38] [INFO ] State equation strengthened by 832 read => feed constraints.
[2026-06-16 14:07:08] [INFO ] Performed 926/1780 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-06-16 14:07:38] [INFO ] Performed 1036/1780 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-06-16 14:08:08] [INFO ] Performed 1282/1780 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2026-06-16 14:08:38] [INFO ] Performed 1533/1780 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2026-06-16 14:08:38] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2026-06-16 14:08:38] [INFO ] Implicit Places using invariants and state equation in 122344 ms returned []
Implicit Place search using SMT with State Equation took 125313 ms to find 0 implicit places.
[2026-06-16 14:08:38] [INFO ] Redundant transitions in 68 ms returned []
Running 2500 sub problems to find dead transitions.
[2026-06-16 14:08:38] [INFO ] Invariant cache hit.
[2026-06-16 14:08:38] [INFO ] State equation strengthened by 832 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1746 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 2500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1746/4312 variables, and 52 constraints, problems are : Problem set: 0 solved, 2500 unsolved in 30081 ms.
Refiners :[Positive P Invariants (semi-flows): 52/54 constraints, State Equation: 0/1780 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 2500/2500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2500 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1746 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 2500 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1746/4312 variables, and 52 constraints, problems are : Problem set: 0 solved, 2500 unsolved in 30076 ms.
Refiners :[Positive P Invariants (semi-flows): 52/54 constraints, State Equation: 0/1780 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 0/2500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61791ms problems are : Problem set: 0 solved, 2500 unsolved
Search for dead transitions found 0 dead transitions in 61802ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 187366 ms. Remains : 1780/1780 places, 2532/2532 transitions.
Built C files in :
/tmp/ltsmin310268635655641421
[2026-06-16 14:09:40] [INFO ] Too many transitions (2532) to apply POR reductions. Disabling POR matrices.
[2026-06-16 14:09:40] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin310268635655641421
Running compilation step : cd /tmp/ltsmin310268635655641421;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin310268635655641421;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin310268635655641421;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-06-16 14:09:44] [INFO ] Flatten gal took : 292 ms
[2026-06-16 14:09:44] [INFO ] Flatten gal took : 249 ms
[2026-06-16 14:09:44] [INFO ] Time to serialize gal into /tmp/LTL12550923118414373672.gal : 23 ms
[2026-06-16 14:09:44] [INFO ] Time to serialize properties into /tmp/LTL6512924089327919792.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12550923118414373672.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9261474536942931273.hoa' '-atoms' '/tmp/LTL6512924089327919792.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL6512924089327919792.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9261474536942931273.hoa
Detected timeout of ITS tools.
[2026-06-16 14:09:59] [INFO ] Flatten gal took : 79 ms
[2026-06-16 14:09:59] [INFO ] Flatten gal took : 79 ms
[2026-06-16 14:09:59] [INFO ] Time to serialize gal into /tmp/LTL2651112680365358720.gal : 14 ms
[2026-06-16 14:09:59] [INFO ] Time to serialize properties into /tmp/LTL5799236673043350405.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2651112680365358720.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5799236673043350405.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G(("(loop_15_43<=inode_22_35)")U("((testbusy_23_37<=beginloop_11_36)||(loop_22_49>=3))")))))
Formula 0 simplified : GF(!"(loop_15_43<=inode_22_35)" R !"((testbusy_23_37<=beginloop_11_36)||(loop_22_49>=3))")
Detected timeout of ITS tools.
[2026-06-16 14:10:14] [INFO ] Flatten gal took : 124 ms
[2026-06-16 14:10:14] [INFO ] Applying decomposition
[2026-06-16 14:10:14] [INFO ] Flatten gal took : 120 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph8566945986288468083.txt' '-o' '/tmp/graph8566945986288468083.bin' '-w' '/tmp/graph8566945986288468083.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8566945986288468083.bin' '-l' '-1' '-v' '-w' '/tmp/graph8566945986288468083.weights' '-q' '0' '-e' '0.001'
[2026-06-16 14:10:15] [INFO ] Decomposing Gal with order
[2026-06-16 14:10:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-16 14:10:15] [INFO ] Removed a total of 829 redundant transitions.
[2026-06-16 14:10:15] [INFO ] Flatten gal took : 255 ms
[2026-06-16 14:10:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 1392 labels/synchronizations in 100 ms.
[2026-06-16 14:10:16] [INFO ] Time to serialize gal into /tmp/LTL13620960878255583850.gal : 22 ms
[2026-06-16 14:10:16] [INFO ] Time to serialize properties into /tmp/LTL12396511686401370556.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13620960878255583850.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12396511686401370556.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G(("(gu56.loop_15_43<=gu56.inode_22_35)")U("((gu57.testbusy_23_37<=gu57.beginloop_11_36)||(gi0.gi9.gu48.loop_22_49>=3))")))))
Formula 0 simplified : GF(!"(gu56.loop_15_43<=gu56.inode_22_35)" R !"((gu57.testbusy_23_37<=gu57.beginloop_11_36)||(gi0.gi9.gu48.loop_22_49>=3))")
Detected timeout of ITS tools.
Treatment of property FileSystem-PT-N08I32B26-LTLCardinality-09 finished in 923983 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(((F(p0) U X(X(p1)))&&X(X(p2)))))'
Support contains 4 out of 2688 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2688/2688 places, 3434/3434 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 2681 transition count 3434
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 22 place count 2666 transition count 3419
Iterating global reduction 1 with 15 rules applied. Total rules applied 37 place count 2666 transition count 3419
Applied a total of 37 rules in 299 ms. Remains 2666 /2688 variables (removed 22) and now considering 3419/3434 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4582241071832738617.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10308445903567225014.kers'
[2026-06-16 14:10:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4582241071832738617.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10308445903567225014.kers]
Culling duplicate invariants (modulo rational): removing 26 columns.
Culled 26 columns in 3 ms.
// Phase 1: matrix 3419 rows 2640 cols 9393 entries
Finished phase 1 with 2612 SingleSign rule and 0 generalized
[2026-06-16 14:10:31] [INFO ] Computed 54 invariants in 120 ms
Computed 54 P flows in 120 ms.
Exported basis to /tmp/petrispot-output-10308445903567225014.kers
Total runtime 124 ms.
[2026-06-16 14:10:35] [INFO ] Implicit Places using invariants in 3923 ms returned []
[2026-06-16 14:10:35] [INFO ] Invariant cache hit.
[2026-06-16 14:10:38] [INFO ] State equation strengthened by 832 read => feed constraints.
[2026-06-16 14:11:08] [INFO ] Performed 875/2666 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-06-16 14:11:38] [INFO ] Performed 995/2666 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-06-16 14:12:08] [INFO ] Performed 2093/2666 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2026-06-16 14:12:38] [INFO ] Performed 2426/2666 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2026-06-16 14:12:38] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2026-06-16 14:12:38] [INFO ] Implicit Places using invariants and state equation in 123541 ms returned []
Implicit Place search using SMT with State Equation took 127467 ms to find 0 implicit places.
Running 3387 sub problems to find dead transitions.
[2026-06-16 14:12:38] [INFO ] Invariant cache hit.
[2026-06-16 14:12:38] [INFO ] State equation strengthened by 832 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/2633 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 3387 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2633/6085 variables, and 52 constraints, problems are : Problem set: 0 solved, 3387 unsolved in 30063 ms.
Refiners :[Positive P Invariants (semi-flows): 52/54 constraints, State Equation: 0/2666 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 3387/3387 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3387 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2633 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 3387 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2633/6085 variables, and 52 constraints, problems are : Problem set: 0 solved, 3387 unsolved in 30102 ms.
Refiners :[Positive P Invariants (semi-flows): 52/54 constraints, State Equation: 0/2666 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 0/3387 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62141ms problems are : Problem set: 0 solved, 3387 unsolved
Search for dead transitions found 0 dead transitions in 62149ms
Starting structural reductions in LTL mode, iteration 1 : 2666/2688 places, 3419/3434 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 189922 ms. Remains : 2666/2688 places, 3419/3434 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(((F(p0) U X(X(p1)))&&X(X(p2)))))'
Stuttering acceptance computed with spot in 536 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p2), true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : FileSystem-PT-N08I32B26-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA FileSystem-PT-N08I32B26-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FileSystem-PT-N08I32B26-LTLCardinality-11 finished in 190531 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' '!((p0 U X((F(p1) U p0))))'
Support contains 3 out of 2688 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2688/2688 places, 3434/3434 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 2681 transition count 3434
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 23 place count 2665 transition count 3418
Iterating global reduction 1 with 16 rules applied. Total rules applied 39 place count 2665 transition count 3418
Applied a total of 39 rules in 501 ms. Remains 2665 /2688 variables (removed 23) and now considering 3418/3434 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2100434278961227689.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13621140648428591515.kers'
[2026-06-16 14:13:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2100434278961227689.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13621140648428591515.kers]
Culling duplicate invariants (modulo rational): removing 26 columns.
Culled 26 columns in 5 ms.
// Phase 1: matrix 3418 rows 2639 cols 9390 entries
Finished phase 1 with 2611 SingleSign rule and 0 generalized
[2026-06-16 14:13:42] [INFO ] Computed 54 invariants in 206 ms
Computed 54 P flows in 207 ms.
Exported basis to /tmp/petrispot-output-13621140648428591515.kers
Total runtime 213 ms.
[2026-06-16 14:13:46] [INFO ] Implicit Places using invariants in 4461 ms returned []
[2026-06-16 14:13:46] [INFO ] Invariant cache hit.
[2026-06-16 14:13:49] [INFO ] State equation strengthened by 832 read => feed constraints.
[2026-06-16 14:14:20] [INFO ] Performed 870/2665 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-06-16 14:14:51] [INFO ] Performed 986/2665 implicitness test of which 0 returned IMPLICIT in 61 seconds.
[2026-06-16 14:15:21] [INFO ] Performed 2015/2665 implicitness test of which 0 returned IMPLICIT in 91 seconds.
[2026-06-16 14:15:51] [INFO ] Performed 2423/2665 implicitness test of which 0 returned IMPLICIT in 121 seconds.
[2026-06-16 14:15:51] [INFO ] Timeout of Implicit test with SMT after 121 seconds.
[2026-06-16 14:15:51] [INFO ] Implicit Places using invariants and state equation in 124527 ms returned []
Implicit Place search using SMT with State Equation took 128991 ms to find 0 implicit places.
Running 3386 sub problems to find dead transitions.
[2026-06-16 14:15:51] [INFO ] Invariant cache hit.
[2026-06-16 14:15:51] [INFO ] State equation strengthened by 832 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2632 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 3386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2632/6083 variables, and 52 constraints, problems are : Problem set: 0 solved, 3386 unsolved in 30071 ms.
Refiners :[Positive P Invariants (semi-flows): 52/54 constraints, State Equation: 0/2665 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 3386/3386 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3386 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2632 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 3386 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2632/6083 variables, and 52 constraints, problems are : Problem set: 0 solved, 3386 unsolved in 30066 ms.
Refiners :[Positive P Invariants (semi-flows): 52/54 constraints, State Equation: 0/2665 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 0/3386 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62304ms problems are : Problem set: 0 solved, 3386 unsolved
Search for dead transitions found 0 dead transitions in 62312ms
Starting structural reductions in LTL mode, iteration 1 : 2665/2688 places, 3418/3434 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 191814 ms. Remains : 2665/2688 places, 3418/3434 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 X((F(p1) U p0))))'
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : FileSystem-PT-N08I32B26-LTLCardinality-12
Product exploration explored 100000 steps with 0 reset in 401 ms.
Product exploration explored 100000 steps with 0 reset in 484 ms.
Computed a total of 143 stabilizing places and 922 stable transitions
Computed a total of 143 stabilizing places and 922 stable transitions
Knowledge based reduction with 7 factoid took 56 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 401 ms. (99 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 193 ms. (206 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 2/2 properties
[2026-06-16 14:16:54] [INFO ] Invariant cache hit.
[2026-06-16 14:16:54] [INFO ] State equation strengthened by 832 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2613/2616 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2616 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 49/2665 variables, 49/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2665 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 6083/6083 variables, and 2719 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4398 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, State Equation: 2665/2665 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2613/2616 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SMT process timed out in 12222ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 2665 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2665/2665 places, 3418/3418 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 2665 transition count 3386
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 2633 transition count 3386
Performed 857 Post agglomeration using F-continuation condition.Transition count delta: 857
Deduced a syphon composed of 857 places in 4 ms
Reduce places removed 857 places and 0 transitions.
Iterating global reduction 2 with 1714 rules applied. Total rules applied 1778 place count 1776 transition count 2529
Free-agglomeration rule (complex) applied 830 times.
Iterating global reduction 2 with 830 rules applied. Total rules applied 2608 place count 1776 transition count 1699
Reduce places removed 853 places and 0 transitions.
Iterating post reduction 2 with 853 rules applied. Total rules applied 3461 place count 923 transition count 1699
Applied a total of 3461 rules in 843 ms. Remains 923 /2665 variables (removed 1742) and now considering 1699/3418 (removed 1719) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 843 ms. Remains : 923/2665 places, 1699/3418 transitions.
RANDOM walk for 40000 steps (8 resets) in 197 ms. (202 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 83 ms. (476 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 235769 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :1 out of 2
Probabilistic random walk after 235769 steps, saw 196411 distinct states, run finished after 3006 ms. (steps per millisecond=78 ) properties seen :1
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14928215174013754448.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-595631760174293711.kers'
[2026-06-16 14:17:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14928215174013754448.kers, --Pflows, --basisKERS=/tmp/petrispot-output-595631760174293711.kers]
Culling duplicate invariants (modulo rational): removing 29 columns.
Culled 29 columns in 1 ms.
// Phase 1: matrix 1699 rows 894 cols 4262 entries
Finished phase 1 with 889 SingleSign rule and 3 generalized
[2026-06-16 14:17:11] [INFO ] Computed 31 invariants in 31 ms
Computed 31 P flows in 32 ms.
Exported basis to /tmp/petrispot-output-595631760174293711.kers
Total runtime 34 ms.
[2026-06-16 14:17:11] [INFO ] State equation strengthened by 832 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 890/896 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/896 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/896 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/896 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/922 variables, 26/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/922 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/923 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/923 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1699/2622 variables, 923/978 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2622 variables, 832/1810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2622 variables, 0/1810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/2622 variables, 0/1810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2622/2622 variables, and 1810 constraints, problems are : Problem set: 0 solved, 1 unsolved in 20688 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 923/923 constraints, ReadFeed: 832/832 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 890/896 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/896 variables, 24/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/896 variables, 6/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/896 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/922 variables, 26/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/922 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/923 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/923 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1699/2622 variables, 923/984 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2622 variables, 832/1816 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2622 variables, 1/1817 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2622 variables, 0/1817 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/2622 variables, 0/1817 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2622/2622 variables, and 1817 constraints, problems are : Problem set: 0 solved, 1 unsolved in 7758 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 923/923 constraints, ReadFeed: 832/832 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28506ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 133 ms.
Support contains 3 out of 923 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 923/923 places, 1699/1699 transitions.
Applied a total of 0 rules in 72 ms. Remains 923 /923 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 923/923 places, 1699/1699 transitions.
RANDOM walk for 40000 steps (8 resets) in 156 ms. (254 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 369231 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :0 out of 1
Probabilistic random walk after 369231 steps, saw 307251 distinct states, run finished after 3004 ms. (steps per millisecond=122 ) properties seen :0
[2026-06-16 14:17:42] [INFO ] Invariant cache hit.
[2026-06-16 14:17:42] [INFO ] State equation strengthened by 832 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 890/896 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/896 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/896 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/896 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/922 variables, 26/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/922 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/923 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/923 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1699/2622 variables, 923/978 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2622 variables, 832/1810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2622 variables, 0/1810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/2622 variables, 0/1810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2622/2622 variables, and 1810 constraints, problems are : Problem set: 0 solved, 1 unsolved in 19671 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 923/923 constraints, ReadFeed: 832/832 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 890/896 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/896 variables, 24/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/896 variables, 6/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/896 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/922 variables, 26/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/922 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/923 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/923 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1699/2622 variables, 923/984 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2622 variables, 832/1816 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2622 variables, 1/1817 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2622 variables, 0/1817 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/2622 variables, 0/1817 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2622/2622 variables, and 1817 constraints, problems are : Problem set: 0 solved, 1 unsolved in 7990 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 923/923 constraints, ReadFeed: 832/832 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27678ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 148 ms.
Support contains 3 out of 923 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 923/923 places, 1699/1699 transitions.
Applied a total of 0 rules in 90 ms. Remains 923 /923 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 923/923 places, 1699/1699 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 923/923 places, 1699/1699 transitions.
Applied a total of 0 rules in 90 ms. Remains 923 /923 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
[2026-06-16 14:18:10] [INFO ] Invariant cache hit.
[2026-06-16 14:18:12] [INFO ] Implicit Places using invariants in 1707 ms returned []
[2026-06-16 14:18:12] [INFO ] Invariant cache hit.
[2026-06-16 14:18:13] [INFO ] State equation strengthened by 832 read => feed constraints.
[2026-06-16 14:18:36] [INFO ] Implicit Places using invariants and state equation in 24041 ms returned []
Implicit Place search using SMT with State Equation took 25751 ms to find 0 implicit places.
[2026-06-16 14:18:36] [INFO ] Redundant transitions in 30 ms returned []
Running 1667 sub problems to find dead transitions.
[2026-06-16 14:18:36] [INFO ] Invariant cache hit.
[2026-06-16 14:18:36] [INFO ] State equation strengthened by 832 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/890 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 1667 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 890/2622 variables, and 29 constraints, problems are : Problem set: 0 solved, 1667 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/923 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 1667/1667 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1667 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/890 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 1667 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 890/2622 variables, and 29 constraints, problems are : Problem set: 0 solved, 1667 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/923 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 0/1667 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60803ms problems are : Problem set: 0 solved, 1667 unsolved
Search for dead transitions found 0 dead transitions in 60807ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86689 ms. Remains : 923/923 places, 1699/1699 transitions.
Knowledge based reduction with 7 factoid took 150 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 317 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), false, false, false]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17170778915461346085.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7289948817976949803.kers'
[2026-06-16 14:19:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17170778915461346085.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7289948817976949803.kers]
Culling duplicate invariants (modulo rational): removing 26 columns.
Culled 26 columns in 5 ms.
// Phase 1: matrix 3418 rows 2639 cols 9390 entries
Finished phase 1 with 2611 SingleSign rule and 0 generalized
[2026-06-16 14:19:38] [INFO ] Computed 54 invariants in 210 ms
Computed 54 P flows in 211 ms.
Exported basis to /tmp/petrispot-output-7289948817976949803.kers
Total runtime 216 ms.
[2026-06-16 14:19:47] [INFO ] [Real]Absence check using 54 positive place invariants in 1542 ms returned sat
[2026-06-16 14:19:53] [INFO ] [Real]Absence check using state equation in 5618 ms returned unknown
Could not prove EG (NOT p0)
[2026-06-16 14:19:53] [INFO ] Invariant cache hit.
[2026-06-16 14:20:02] [INFO ] [Real]Absence check using 54 positive place invariants in 1096 ms returned sat
[2026-06-16 14:20:08] [INFO ] [Real]Absence check using state equation in 6019 ms returned unknown
Could not prove EG (NOT p1)
Knowledge-based reduction took 193692 ms.
Stuttering acceptance computed with spot in 248 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), false, false, false]
Support contains 3 out of 2665 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2665/2665 places, 3418/3418 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 2665 transition count 3386
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 2633 transition count 3386
Performed 857 Post agglomeration using F-continuation condition.Transition count delta: 857
Deduced a syphon composed of 857 places in 4 ms
Reduce places removed 857 places and 0 transitions.
Iterating global reduction 2 with 1714 rules applied. Total rules applied 1778 place count 1776 transition count 2529
Applied a total of 1778 rules in 541 ms. Remains 1776 /2665 variables (removed 889) and now considering 2529/3418 (removed 889) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4406560285587389292.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7519878547301239316.kers'
[2026-06-16 14:20:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4406560285587389292.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7519878547301239316.kers]
Culling duplicate invariants (modulo rational): removing 26 columns.
Culled 26 columns in 4 ms.
// Phase 1: matrix 2529 rows 1750 cols 8418 entries
Finished phase 1 with 1722 SingleSign rule and 0 generalized
[2026-06-16 14:20:09] [INFO ] Computed 54 invariants in 104 ms
Computed 54 P flows in 104 ms.
Exported basis to /tmp/petrispot-output-7519878547301239316.kers
Total runtime 107 ms.
[2026-06-16 14:20:11] [INFO ] Implicit Places using invariants in 2879 ms returned []
[2026-06-16 14:20:11] [INFO ] Invariant cache hit.
[2026-06-16 14:20:14] [INFO ] State equation strengthened by 832 read => feed constraints.
[2026-06-16 14:20:44] [INFO ] Performed 923/1776 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-06-16 14:21:14] [INFO ] Performed 1178/1776 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-06-16 14:21:30] [INFO ] Implicit Places using invariants and state equation in 78280 ms returned []
Implicit Place search using SMT with State Equation took 81162 ms to find 0 implicit places.
[2026-06-16 14:21:30] [INFO ] Redundant transitions in 86 ms returned []
Running 2497 sub problems to find dead transitions.
[2026-06-16 14:21:30] [INFO ] Invariant cache hit.
[2026-06-16 14:21:30] [INFO ] State equation strengthened by 832 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1743 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 2497 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1743/4305 variables, and 52 constraints, problems are : Problem set: 0 solved, 2497 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 52/54 constraints, State Equation: 0/1776 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 2497/2497 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2497 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1743 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 2497 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1743/4305 variables, and 52 constraints, problems are : Problem set: 0 solved, 2497 unsolved in 30088 ms.
Refiners :[Positive P Invariants (semi-flows): 52/54 constraints, State Equation: 0/1776 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 0/2497 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61492ms problems are : Problem set: 0 solved, 2497 unsolved
Search for dead transitions found 0 dead transitions in 61499ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1776/2665 places, 2529/3418 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 143305 ms. Remains : 1776/2665 places, 2529/3418 transitions.
Computed a total of 85 stabilizing places and 864 stable transitions
Computed a total of 85 stabilizing places and 864 stable transitions
Knowledge based reduction with 13 factoid took 93 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter insensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 546 ms. (73 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 510 ms. (78 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 3/3 properties
[2026-06-16 14:22:32] [INFO ] Invariant cache hit.
[2026-06-16 14:22:32] [INFO ] State equation strengthened by 832 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1724/1727 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1727 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 49/1776 variables, 49/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1776 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2529/4305 variables, 1776/1830 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4305 variables, 832/2662 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4305 variables, 0/2662 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/4305 variables, 0/2662 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4305/4305 variables, and 2662 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3774 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, State Equation: 1776/1776 constraints, ReadFeed: 832/832 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1724/1727 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SMT process timed out in 10522ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 1776 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1776/1776 places, 2529/2529 transitions.
Free-agglomeration rule (complex) applied 830 times.
Iterating global reduction 0 with 830 rules applied. Total rules applied 830 place count 1776 transition count 1699
Reduce places removed 853 places and 0 transitions.
Iterating post reduction 0 with 853 rules applied. Total rules applied 1683 place count 923 transition count 1699
Applied a total of 1683 rules in 437 ms. Remains 923 /1776 variables (removed 853) and now considering 1699/2529 (removed 830) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 437 ms. Remains : 923/1776 places, 1699/2529 transitions.
RANDOM walk for 40000 steps (8 resets) in 301 ms. (132 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 129 ms. (307 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 119 ms. (333 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 173735 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :2 out of 3
Probabilistic random walk after 173735 steps, saw 144679 distinct states, run finished after 3001 ms. (steps per millisecond=57 ) properties seen :2
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17543687244231718187.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9340213735444465125.kers'
[2026-06-16 14:22:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17543687244231718187.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9340213735444465125.kers]
Culling duplicate invariants (modulo rational): removing 29 columns.
Culled 29 columns in 1 ms.
// Phase 1: matrix 1699 rows 894 cols 4262 entries
Finished phase 1 with 889 SingleSign rule and 3 generalized
[2026-06-16 14:22:46] [INFO ] Computed 31 invariants in 26 ms
Computed 31 P flows in 26 ms.
Exported basis to /tmp/petrispot-output-9340213735444465125.kers
Total runtime 28 ms.
[2026-06-16 14:22:46] [INFO ] State equation strengthened by 832 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 890/896 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/896 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/896 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/896 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/922 variables, 26/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/922 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/923 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/923 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1699/2622 variables, 923/978 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2622 variables, 832/1810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2622 variables, 0/1810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/2622 variables, 0/1810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2622/2622 variables, and 1810 constraints, problems are : Problem set: 0 solved, 1 unsolved in 21233 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 923/923 constraints, ReadFeed: 832/832 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 890/896 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/896 variables, 24/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/896 variables, 6/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/896 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/922 variables, 26/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/922 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/923 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/923 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1699/2622 variables, 923/984 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2622 variables, 832/1816 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2622 variables, 1/1817 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2622 variables, 0/1817 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/2622 variables, 0/1817 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2622/2622 variables, and 1817 constraints, problems are : Problem set: 0 solved, 1 unsolved in 7988 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 923/923 constraints, ReadFeed: 832/832 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29278ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 141 ms.
Support contains 3 out of 923 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 923/923 places, 1699/1699 transitions.
Applied a total of 0 rules in 83 ms. Remains 923 /923 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 923/923 places, 1699/1699 transitions.
RANDOM walk for 40000 steps (8 resets) in 176 ms. (225 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 86 ms. (459 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 336457 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :0 out of 1
Probabilistic random walk after 336457 steps, saw 279847 distinct states, run finished after 3001 ms. (steps per millisecond=112 ) properties seen :0
[2026-06-16 14:23:19] [INFO ] Invariant cache hit.
[2026-06-16 14:23:19] [INFO ] State equation strengthened by 832 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 890/896 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/896 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/896 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/896 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/922 variables, 26/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/922 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/923 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/923 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1699/2622 variables, 923/978 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2622 variables, 832/1810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2622 variables, 0/1810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/2622 variables, 0/1810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2622/2622 variables, and 1810 constraints, problems are : Problem set: 0 solved, 1 unsolved in 21172 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 923/923 constraints, ReadFeed: 832/832 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 890/896 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/896 variables, 24/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/896 variables, 6/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/896 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/922 variables, 26/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/922 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/923 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/923 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1699/2622 variables, 923/984 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2622 variables, 832/1816 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2622 variables, 1/1817 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2622 variables, 0/1817 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/2622 variables, 0/1817 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2622/2622 variables, and 1817 constraints, problems are : Problem set: 0 solved, 1 unsolved in 7240 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 923/923 constraints, ReadFeed: 832/832 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28428ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 149 ms.
Support contains 3 out of 923 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 923/923 places, 1699/1699 transitions.
Applied a total of 0 rules in 91 ms. Remains 923 /923 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 923/923 places, 1699/1699 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 923/923 places, 1699/1699 transitions.
Applied a total of 0 rules in 90 ms. Remains 923 /923 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
[2026-06-16 14:23:47] [INFO ] Invariant cache hit.
[2026-06-16 14:23:49] [INFO ] Implicit Places using invariants in 1359 ms returned []
[2026-06-16 14:23:49] [INFO ] Invariant cache hit.
[2026-06-16 14:23:50] [INFO ] State equation strengthened by 832 read => feed constraints.
[2026-06-16 14:24:11] [INFO ] Implicit Places using invariants and state equation in 22276 ms returned []
Implicit Place search using SMT with State Equation took 23641 ms to find 0 implicit places.
[2026-06-16 14:24:11] [INFO ] Redundant transitions in 34 ms returned []
Running 1667 sub problems to find dead transitions.
[2026-06-16 14:24:11] [INFO ] Invariant cache hit.
[2026-06-16 14:24:11] [INFO ] State equation strengthened by 832 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/890 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 1667 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 890/2622 variables, and 29 constraints, problems are : Problem set: 0 solved, 1667 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/923 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 1667/1667 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1667 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/890 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 1667 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 890/2622 variables, and 29 constraints, problems are : Problem set: 0 solved, 1667 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/923 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 0/1667 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60696ms problems are : Problem set: 0 solved, 1667 unsolved
Search for dead transitions found 0 dead transitions in 60700ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84475 ms. Remains : 923/923 places, 1699/1699 transitions.
Knowledge based reduction with 13 factoid took 174 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter insensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 322 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), false, false, false]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13286141910242568356.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16775115978178312558.kers'
[2026-06-16 14:25:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13286141910242568356.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16775115978178312558.kers]
Culling duplicate invariants (modulo rational): removing 26 columns.
Culled 26 columns in 4 ms.
// Phase 1: matrix 2529 rows 1750 cols 8418 entries
Finished phase 1 with 1722 SingleSign rule and 0 generalized
[2026-06-16 14:25:12] [INFO ] Computed 54 invariants in 106 ms
Computed 54 P flows in 106 ms.
Exported basis to /tmp/petrispot-output-16775115978178312558.kers
Total runtime 110 ms.
[2026-06-16 14:25:19] [INFO ] [Real]Absence check using 54 positive place invariants in 673 ms returned sat
[2026-06-16 14:25:27] [INFO ] [Real]Absence check using state equation in 8487 ms returned unknown
Could not prove EG (NOT p0)
[2026-06-16 14:25:27] [INFO ] Invariant cache hit.
[2026-06-16 14:25:34] [INFO ] [Real]Absence check using 54 positive place invariants in 697 ms returned sat
[2026-06-16 14:25:40] [INFO ] [Real]Absence check using state equation in 6586 ms returned unknown
Could not prove EG (NOT p1)
Knowledge-based reduction took 188877 ms.
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), false, false, false]
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), false, false, false]
Product exploration explored 100000 steps with 0 reset in 545 ms.
Product exploration explored 100000 steps with 0 reset in 524 ms.
Built C files in :
/tmp/ltsmin16297310136674128467
[2026-06-16 14:25:42] [INFO ] Too many transitions (2529) to apply POR reductions. Disabling POR matrices.
[2026-06-16 14:25:42] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16297310136674128467
Running compilation step : cd /tmp/ltsmin16297310136674128467;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16297310136674128467;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16297310136674128467;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 3 out of 1776 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1776/1776 places, 2529/2529 transitions.
Applied a total of 0 rules in 99 ms. Remains 1776 /1776 variables (removed 0) and now considering 2529/2529 (removed 0) transitions.
[2026-06-16 14:25:45] [INFO ] Invariant cache hit.
[2026-06-16 14:25:48] [INFO ] Implicit Places using invariants in 2716 ms returned []
[2026-06-16 14:25:48] [INFO ] Invariant cache hit.
[2026-06-16 14:25:50] [INFO ] State equation strengthened by 832 read => feed constraints.
[2026-06-16 14:26:21] [INFO ] Performed 925/1776 implicitness test of which 0 returned IMPLICIT in 31 seconds.
[2026-06-16 14:26:51] [INFO ] Performed 1229/1776 implicitness test of which 0 returned IMPLICIT in 61 seconds.
[2026-06-16 14:27:05] [INFO ] Implicit Places using invariants and state equation in 77674 ms returned []
Implicit Place search using SMT with State Equation took 80392 ms to find 0 implicit places.
[2026-06-16 14:27:05] [INFO ] Redundant transitions in 68 ms returned []
Running 2497 sub problems to find dead transitions.
[2026-06-16 14:27:05] [INFO ] Invariant cache hit.
[2026-06-16 14:27:05] [INFO ] State equation strengthened by 832 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1743 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 2497 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1743/4305 variables, and 52 constraints, problems are : Problem set: 0 solved, 2497 unsolved in 30086 ms.
Refiners :[Positive P Invariants (semi-flows): 52/54 constraints, State Equation: 0/1776 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 2497/2497 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2497 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1743 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 2497 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1743/4305 variables, and 52 constraints, problems are : Problem set: 0 solved, 2497 unsolved in 30080 ms.
Refiners :[Positive P Invariants (semi-flows): 52/54 constraints, State Equation: 0/1776 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 0/2497 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61437ms problems are : Problem set: 0 solved, 2497 unsolved
Search for dead transitions found 0 dead transitions in 61444ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 142016 ms. Remains : 1776/1776 places, 2529/2529 transitions.
Built C files in :
/tmp/ltsmin3718176845534079959
[2026-06-16 14:28:07] [INFO ] Too many transitions (2529) to apply POR reductions. Disabling POR matrices.
[2026-06-16 14:28:07] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3718176845534079959
Running compilation step : cd /tmp/ltsmin3718176845534079959;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3718176845534079959;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3718176845534079959;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-06-16 14:28:10] [INFO ] Flatten gal took : 68 ms
[2026-06-16 14:28:10] [INFO ] Flatten gal took : 70 ms
[2026-06-16 14:28:10] [INFO ] Time to serialize gal into /tmp/LTL4820723202477347574.gal : 21 ms
[2026-06-16 14:28:10] [INFO ] Time to serialize properties into /tmp/LTL7990818762915626736.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4820723202477347574.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8999411932963793461.hoa' '-atoms' '/tmp/LTL7990818762915626736.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL7990818762915626736.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8999411932963793461.hoa
Detected timeout of ITS tools.
[2026-06-16 14:28:25] [INFO ] Flatten gal took : 65 ms
[2026-06-16 14:28:25] [INFO ] Flatten gal took : 66 ms
[2026-06-16 14:28:25] [INFO ] Time to serialize gal into /tmp/LTL7399622890197619418.gal : 14 ms
[2026-06-16 14:28:25] [INFO ] Time to serialize properties into /tmp/LTL7123654401476002572.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7399622890197619418.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7123654401476002572.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((("(testbusy_31_56>loop_3_43)")U(X((F("(testbusy_12_52>=1)"))U("(testbusy_31_56>loop_3_43)")))))
Formula 0 simplified : !"(testbusy_31_56>loop_3_43)" R X(G!"(testbusy_12_52>=1)" R !"(testbusy_31_56>loop_3_43)")
Detected timeout of ITS tools.
[2026-06-16 14:28:40] [INFO ] Flatten gal took : 61 ms
[2026-06-16 14:28:40] [INFO ] Applying decomposition
[2026-06-16 14:28:41] [INFO ] Flatten gal took : 61 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph17446777779808572541.txt' '-o' '/tmp/graph17446777779808572541.bin' '-w' '/tmp/graph17446777779808572541.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17446777779808572541.bin' '-l' '-1' '-v' '-w' '/tmp/graph17446777779808572541.weights' '-q' '0' '-e' '0.001'
[2026-06-16 14:28:41] [INFO ] Decomposing Gal with order
[2026-06-16 14:28:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-16 14:28:41] [INFO ] Removed a total of 829 redundant transitions.
[2026-06-16 14:28:41] [INFO ] Flatten gal took : 373 ms
[2026-06-16 14:28:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 1395 labels/synchronizations in 48 ms.
[2026-06-16 14:28:42] [INFO ] Time to serialize gal into /tmp/LTL15642573721795902604.gal : 22 ms
[2026-06-16 14:28:42] [INFO ] Time to serialize properties into /tmp/LTL12153918807061653937.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15642573721795902604.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12153918807061653937.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((("(gu56.testbusy_31_56>gu56.loop_3_43)")U(X((F("(gi0.gi8.gu49.testbusy_12_52>=1)"))U("(gu56.testbusy_31_56>gu56.loop_3_43)")))))
Formula 0 simplified : !"(gu56.testbusy_31_56>gu56.loop_3_43)" R X(G!"(gi0.gi8.gu49.testbusy_12_52>=1)" R !"(gu56.testbusy_31_56>gu56.loop_3_43)")
Detected timeout of ITS tools.
Treatment of property FileSystem-PT-N08I32B26-LTLCardinality-12 finished in 915444 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) U X(X(p1))))&&X(F((p2||X(!p0))))))'
Support contains 6 out of 2688 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2688/2688 places, 3434/3434 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 2681 transition count 3434
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 20 place count 2668 transition count 3421
Iterating global reduction 1 with 13 rules applied. Total rules applied 33 place count 2668 transition count 3421
Applied a total of 33 rules in 422 ms. Remains 2668 /2688 variables (removed 20) and now considering 3421/3434 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15360126137575821853.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9850638637158818274.kers'
[2026-06-16 14:28:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15360126137575821853.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9850638637158818274.kers]
Culling duplicate invariants (modulo rational): removing 26 columns.
Culled 26 columns in 5 ms.
// Phase 1: matrix 3421 rows 2642 cols 9399 entries
Finished phase 1 with 2614 SingleSign rule and 0 generalized
[2026-06-16 14:28:57] [INFO ] Computed 54 invariants in 197 ms
Computed 54 P flows in 198 ms.
Exported basis to /tmp/petrispot-output-9850638637158818274.kers
Total runtime 202 ms.
[2026-06-16 14:29:01] [INFO ] Implicit Places using invariants in 4048 ms returned []
[2026-06-16 14:29:01] [INFO ] Invariant cache hit.
[2026-06-16 14:29:05] [INFO ] State equation strengthened by 832 read => feed constraints.

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="FileSystem-PT-N08I32B26"
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 FileSystem-PT-N08I32B26, 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 r338-smll-178021499300475"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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