Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r002-oct2-177944366300428.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 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 ASLink-PT-10a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-oct2-177944366300428
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 8.3K Mar 5 14:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Mar 5 14:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Mar 5 14:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 5 14:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 07:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 15 07:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 5 14:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K Mar 5 14:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Mar 5 14:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 5 14:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 920K Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME ASLink-PT-10a-LTLFireability-00
FORMULA_NAME ASLink-PT-10a-LTLFireability-01
FORMULA_NAME ASLink-PT-10a-LTLFireability-02
FORMULA_NAME ASLink-PT-10a-LTLFireability-03
FORMULA_NAME ASLink-PT-10a-LTLFireability-04
FORMULA_NAME ASLink-PT-10a-LTLFireability-05
FORMULA_NAME ASLink-PT-10a-LTLFireability-06
FORMULA_NAME ASLink-PT-10a-LTLFireability-07
FORMULA_NAME ASLink-PT-10a-LTLFireability-08
FORMULA_NAME ASLink-PT-10a-LTLFireability-09
FORMULA_NAME ASLink-PT-10a-LTLFireability-10
FORMULA_NAME ASLink-PT-10a-LTLFireability-11
FORMULA_NAME ASLink-PT-10a-LTLFireability-12
FORMULA_NAME ASLink-PT-10a-LTLFireability-13
FORMULA_NAME ASLink-PT-10a-LTLFireability-14
FORMULA_NAME ASLink-PT-10a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779487892555

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-10a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-22 22:11:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-22 22:11:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 22:11:34] [INFO ] Load time of PNML (sax parser for PT used): 171 ms
[2026-05-22 22:11:34] [INFO ] Transformed 2186 places.
[2026-05-22 22:11:34] [INFO ] Transformed 3192 transitions.
[2026-05-22 22:11:34] [INFO ] Found NUPN structural information;
[2026-05-22 22:11:34] [INFO ] Parsed PT model containing 2186 places and 3192 transitions and 11972 arcs in 305 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 34 transitions
Reduce redundant transitions removed 34 transitions.
FORMULA ASLink-PT-10a-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 61 out of 2186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2186/2186 places, 3158/3158 transitions.
Ensure Unique test removed 40 places
Discarding 20 places :
Implicit places reduction removed 20 places
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 2126 transition count 3158
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 75 place count 2111 transition count 3085
Ensure Unique test removed 1 places
Iterating global reduction 1 with 16 rules applied. Total rules applied 91 place count 2110 transition count 3085
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 93 place count 2110 transition count 3083
Applied a total of 93 rules in 473 ms. Remains 2110 /2186 variables (removed 76) and now considering 3083/3158 (removed 75) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2146048403910239381.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4532975389401689676.kers'
[2026-05-22 22:11:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2146048403910239381.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4532975389401689676.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 3083 rows 2110 cols 11488 entries
Finished phase 1 with 871 SingleSign rule and 878 generalized
[2026-05-22 22:11:35] [INFO ] Computed 361 invariants in 38 ms
Computed 361 P flows in 38 ms.
Exported basis to /tmp/petrispot-output-4532975389401689676.kers
Total runtime 41 ms.
[2026-05-22 22:11:37] [INFO ] Implicit Places using invariants in 2136 ms returned [1, 19, 20, 23, 33, 51, 69, 198, 214, 219, 220, 221, 239, 257, 386, 402, 407, 408, 409, 427, 445, 574, 590, 595, 596, 597, 615, 633, 762, 778, 783, 784, 785, 803, 821, 950, 966, 971, 972, 973, 991, 1009, 1138, 1154, 1159, 1160, 1161, 1179, 1197, 1326, 1342, 1347, 1348, 1349, 1367, 1385, 1514, 1530, 1535, 1536, 1537, 1555, 1573, 1702, 1718, 1723, 1724, 1725, 1743, 1761, 1895, 1907, 1912, 1913, 1914, 1948, 1950, 1953, 1971, 1972, 1973, 1974, 1991, 1999, 2007, 2013, 2019, 2025, 2031, 2039, 2045, 2051, 2059]
Discarding 93 places :
Implicit Place search using SMT only with invariants took 2230 ms to find 93 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2017/2186 places, 3083/3158 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 2004 transition count 3070
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 2004 transition count 3070
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 1994 transition count 3060
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 1994 transition count 3060
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 1989 transition count 3055
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 1989 transition count 3055
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 1987 transition count 3053
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 1987 transition count 3053
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 1985 transition count 3051
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 1985 transition count 3051
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1984 transition count 3050
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1984 transition count 3050
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 1983 transition count 3049
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 1983 transition count 3049
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1982 transition count 3048
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1982 transition count 3048
Applied a total of 70 rules in 816 ms. Remains 1982 /2017 variables (removed 35) and now considering 3048/3083 (removed 35) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6714818222636871695.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13019960237285355077.kers'
[2026-05-22 22:11:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6714818222636871695.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13019960237285355077.kers]
Culled 0 columns in 5 ms.
// Phase 1: matrix 3048 rows 1982 cols 10649 entries
Finished phase 1 with 1300 SingleSign rule and 414 generalized
[2026-05-22 22:11:38] [INFO ] Computed 268 invariants in 61 ms
Computed 268 P flows in 61 ms.
Exported basis to /tmp/petrispot-output-13019960237285355077.kers
Total runtime 67 ms.
[2026-05-22 22:11:39] [INFO ] Implicit Places using invariants in 1531 ms returned []
[2026-05-22 22:11:39] [INFO ] Invariant cache hit.
[2026-05-22 22:11:44] [INFO ] Implicit Places using invariants and state equation in 4582 ms returned []
Implicit Place search using SMT with State Equation took 6136 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1982/2186 places, 3048/3158 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 9671 ms. Remains : 1982/2186 places, 3048/3158 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1982/1982 places, 3048/3048 transitions.
Applied a total of 0 rules in 128 ms. Remains 1982 /1982 variables (removed 0) and now considering 3048/3048 (removed 0) transitions.
[2026-05-22 22:11:44] [INFO ] Invariant cache hit.
[2026-05-22 22:11:45] [INFO ] Implicit Places using invariants in 1297 ms returned []
[2026-05-22 22:11:45] [INFO ] Invariant cache hit.
[2026-05-22 22:11:49] [INFO ] Implicit Places using invariants and state equation in 4424 ms returned []
Implicit Place search using SMT with State Equation took 5725 ms to find 0 implicit places.
Running 3047 sub problems to find dead transitions.
[2026-05-22 22:11:50] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1981 variables, 207/207 constraints. Problems are: Problem set: 0 solved, 3047 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1981/5030 variables, and 207 constraints, problems are : Problem set: 0 solved, 3047 unsolved in 30131 ms.
Refiners :[Positive P Invariants (semi-flows): 0/45 constraints, Generalized P Invariants (flows): 207/223 constraints, State Equation: 0/1982 constraints, PredecessorRefiner: 3047/3047 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3047 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1981 variables, 207/207 constraints. Problems are: Problem set: 0 solved, 3047 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1981/5030 variables, and 207 constraints, problems are : Problem set: 0 solved, 3047 unsolved in 30101 ms.
Refiners :[Positive P Invariants (semi-flows): 0/45 constraints, Generalized P Invariants (flows): 207/223 constraints, State Equation: 0/1982 constraints, PredecessorRefiner: 0/3047 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61741ms problems are : Problem set: 0 solved, 3047 unsolved
Search for dead transitions found 0 dead transitions in 61775ms
Finished structural reductions in LTL mode , in 1 iterations and 67711 ms. Remains : 1982/1982 places, 3048/3048 transitions.
Support contains 61 out of 1982 places after structural reductions.
[2026-05-22 22:12:52] [INFO ] Flatten gal took : 219 ms
[2026-05-22 22:12:52] [INFO ] Flatten gal took : 137 ms
[2026-05-22 22:12:52] [INFO ] Input system was already deterministic with 3048 transitions.
RANDOM walk for 40000 steps (163 resets) in 1889 ms. (21 steps per ms) remains 29/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
[2026-05-22 22:12:53] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 291/342 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 529/871 variables, 37/45 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/871 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 1111/1982 variables, 223/268 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1982 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 29 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 Real declared 1982/5030 variables, and 269 constraints, problems are : Problem set: 0 solved, 29 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 223/223 constraints, State Equation: 0/1982 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 291/342 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 529/871 variables, 37/45 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/871 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 1111/1982 variables, 223/268 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1982 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1982 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1982/5030 variables, and 270 constraints, problems are : Problem set: 0 solved, 29 unsolved in 5021 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 223/223 constraints, State Equation: 0/1982 constraints, PredecessorRefiner: 0/29 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10070ms problems are : Problem set: 0 solved, 29 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 51 out of 1982 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1982/1982 places, 3048/3048 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 368 transitions
Trivial Post-agglo rules discarded 368 transitions
Performed 368 trivial Post agglomeration. Transition count delta: 368
Iterating post reduction 0 with 368 rules applied. Total rules applied 368 place count 1982 transition count 2680
Reduce places removed 368 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 1 with 387 rules applied. Total rules applied 755 place count 1614 transition count 2661
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 774 place count 1595 transition count 2661
Performed 265 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 265 Pre rules applied. Total rules applied 774 place count 1595 transition count 2396
Deduced a syphon composed of 265 places in 3 ms
Ensure Unique test removed 85 places
Reduce places removed 350 places and 0 transitions.
Iterating global reduction 3 with 615 rules applied. Total rules applied 1389 place count 1245 transition count 2396
Discarding 14 places :
Implicit places reduction removed 14 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 23 rules applied. Total rules applied 1412 place count 1231 transition count 2387
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1421 place count 1222 transition count 2387
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 40 Pre rules applied. Total rules applied 1421 place count 1222 transition count 2347
Deduced a syphon composed of 40 places in 3 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 5 with 80 rules applied. Total rules applied 1501 place count 1182 transition count 2347
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1506 place count 1177 transition count 2342
Iterating global reduction 5 with 5 rules applied. Total rules applied 1511 place count 1177 transition count 2342
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 5 with 4 rules applied. Total rules applied 1515 place count 1177 transition count 2338
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1516 place count 1176 transition count 2338
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1516 place count 1176 transition count 2337
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1518 place count 1175 transition count 2337
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Deduced a syphon composed of 102 places in 4 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 7 with 204 rules applied. Total rules applied 1722 place count 1073 transition count 2235
Free-agglomeration rule applied 10 times.
Iterating global reduction 7 with 10 rules applied. Total rules applied 1732 place count 1073 transition count 2225
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 1742 place count 1063 transition count 2225
Free-agglomeration rule (complex) applied 39 times.
Iterating global reduction 8 with 39 rules applied. Total rules applied 1781 place count 1063 transition count 2186
Ensure Unique test removed 1 places
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 8 with 40 rules applied. Total rules applied 1821 place count 1023 transition count 2186
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 9 with 9 rules applied. Total rules applied 1830 place count 1023 transition count 2177
Partial Free-agglomeration rule applied 22 times.
Drop transitions (Partial Free agglomeration) removed 22 transitions
Iterating global reduction 9 with 22 rules applied. Total rules applied 1852 place count 1023 transition count 2177
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1854 place count 1023 transition count 2177
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1855 place count 1023 transition count 2176
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1856 place count 1022 transition count 2175
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 1866 place count 1012 transition count 2175
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 20 Pre rules applied. Total rules applied 1866 place count 1012 transition count 2155
Deduced a syphon composed of 20 places in 3 ms
Ensure Unique test removed 9 places
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 10 with 49 rules applied. Total rules applied 1915 place count 983 transition count 2155
Discarding 9 places :
Symmetric choice reduction at 10 with 9 rule applications. Total rules 1924 place count 974 transition count 2146
Iterating global reduction 10 with 9 rules applied. Total rules applied 1933 place count 974 transition count 2146
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 1942 place count 974 transition count 2137
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1943 place count 974 transition count 2136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1944 place count 973 transition count 2136
Applied a total of 1944 rules in 984 ms. Remains 973 /1982 variables (removed 1009) and now considering 2136/3048 (removed 912) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 984 ms. Remains : 973/1982 places, 2136/3048 transitions.
RANDOM walk for 40000 steps (573 resets) in 820 ms. (48 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 29/29 properties
Interrupted probabilistic random walk after 218938 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :3 out of 29
Probabilistic random walk after 218938 steps, saw 82181 distinct states, run finished after 3011 ms. (steps per millisecond=72 ) properties seen :3
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12522624569807673916.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14829687705072039926.kers'
[2026-05-22 22:13:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12522624569807673916.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14829687705072039926.kers]
Culling duplicate invariants (modulo rational): removing 9 columns.
Culled 9 columns in 4 ms.
// Phase 1: matrix 2136 rows 964 cols 8697 entries
Finished phase 1 with 358 SingleSign rule and 466 generalized
[2026-05-22 22:13:08] [INFO ] Computed 149 invariants in 41 ms
Computed 149 P flows in 42 ms.
Exported basis to /tmp/petrispot-output-14829687705072039926.kers
Total runtime 47 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 265/310 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 247/557 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/557 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 3/560 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/560 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 396/956 variables, 101/139 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/956 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/956 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (OVERLAPS) 8/964 variables, 8/148 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/964 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 12 (OVERLAPS) 9/973 variables, 2/150 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/973 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 14 (OVERLAPS) 2136/3109 variables, 973/1123 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3109 variables, 0/1123 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 16 (OVERLAPS) 0/3109 variables, 0/1123 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3109/3109 variables, and 1123 constraints, problems are : Problem set: 0 solved, 26 unsolved in 11984 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, Generalized P Invariants (flows): 103/103 constraints, State Equation: 973/973 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 265/310 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 247/557 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/557 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 3/560 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/560 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 396/956 variables, 101/139 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/956 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/956 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (OVERLAPS) 8/964 variables, 8/148 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/964 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 12 (OVERLAPS) 9/973 variables, 2/150 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/973 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 26 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp34 is UNSAT
At refinement iteration 14 (OVERLAPS) 2136/3109 variables, 973/1123 constraints. Problems are: Problem set: 22 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3109 variables, 4/1127 constraints. Problems are: Problem set: 22 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3109 variables, 0/1127 constraints. Problems are: Problem set: 22 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/3109 variables, 0/1127 constraints. Problems are: Problem set: 22 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3109/3109 variables, and 1127 constraints, problems are : Problem set: 22 solved, 4 unsolved in 16088 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, Generalized P Invariants (flows): 103/103 constraints, State Equation: 973/973 constraints, PredecessorRefiner: 4/26 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28157ms problems are : Problem set: 22 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 751 ms.
Support contains 4 out of 973 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 973/973 places, 2136/2136 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 1 place count 973 transition count 2135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 972 transition count 2135
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 971 transition count 2127
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 971 transition count 2127
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 970 transition count 2119
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 970 transition count 2119
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 969 transition count 2111
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 969 transition count 2111
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 968 transition count 2103
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 968 transition count 2103
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 967 transition count 2095
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 967 transition count 2095
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 966 transition count 2087
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 966 transition count 2087
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 965 transition count 2079
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 965 transition count 2079
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 964 transition count 2071
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 964 transition count 2071
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 963 transition count 2063
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 963 transition count 2063
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 962 transition count 2055
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 962 transition count 2055
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 961 transition count 2047
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 961 transition count 2047
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 960 transition count 2039
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 960 transition count 2039
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 959 transition count 2031
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 959 transition count 2031
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 958 transition count 2023
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 958 transition count 2023
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 957 transition count 2015
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 957 transition count 2015
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 956 transition count 2007
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 956 transition count 2007
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 37 place count 954 transition count 2006
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 953 transition count 2005
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 953 transition count 2005
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 40 place count 953 transition count 2004
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 43 place count 953 transition count 2004
Applied a total of 43 rules in 866 ms. Remains 953 /973 variables (removed 20) and now considering 2004/2136 (removed 132) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 866 ms. Remains : 953/973 places, 2004/2136 transitions.
RANDOM walk for 40000 steps (542 resets) in 225 ms. (176 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (64 resets) in 158 ms. (251 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (65 resets) in 195 ms. (204 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (67 resets) in 168 ms. (236 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 279309 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :0 out of 3
Probabilistic random walk after 279309 steps, saw 94910 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) 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-13124937627452615895.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13739555734379783748.kers'
[2026-05-22 22:13:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13124937627452615895.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13739555734379783748.kers]
Culling duplicate invariants (modulo rational): removing 9 columns.
Culled 9 columns in 1 ms.
// Phase 1: matrix 2004 rows 944 cols 8174 entries
Finished phase 1 with 350 SingleSign rule and 455 generalized
[2026-05-22 22:13:41] [INFO ] Computed 148 invariants in 16 ms
Computed 148 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-13739555734379783748.kers
Total runtime 21 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 56/60 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 42/102 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 110/212 variables, 22/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 104/316 variables, 10/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 32/348 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/348 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 152/500 variables, 32/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/500 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 60/560 variables, 8/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/560 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 31/591 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/591 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 77/668 variables, 18/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/668 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 11/679 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/679 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 31/710 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/710 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 45/755 variables, 10/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/755 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 11/766 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/766 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 31/797 variables, 2/119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/797 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 45/842 variables, 10/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/842 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 36/878 variables, 3/132 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/878 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (OVERLAPS) 15/893 variables, 4/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/893 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (OVERLAPS) 42/935 variables, 9/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/935 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (OVERLAPS) 10/945 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/945 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (OVERLAPS) 8/953 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/953 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (OVERLAPS) 2004/2957 variables, 953/1101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 42 (INCLUDED_ONLY) 0/2957 variables, 0/1101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (OVERLAPS) 0/2957 variables, 0/1101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2957/2957 variables, and 1101 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4999 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, Generalized P Invariants (flows): 102/102 constraints, State Equation: 953/953 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 56/60 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 42/102 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 110/212 variables, 22/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 104/316 variables, 10/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 32/348 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/348 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 152/500 variables, 32/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/500 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 60/560 variables, 8/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/560 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 31/591 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/591 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 77/668 variables, 18/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/668 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 11/679 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/679 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 31/710 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/710 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 45/755 variables, 10/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/755 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 11/766 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/766 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 31/797 variables, 2/119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/797 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 45/842 variables, 10/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/842 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 36/878 variables, 3/132 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/878 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (OVERLAPS) 15/893 variables, 4/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/893 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (OVERLAPS) 42/935 variables, 9/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/935 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (OVERLAPS) 10/945 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/945 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (OVERLAPS) 8/953 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/953 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (OVERLAPS) 2004/2957 variables, 953/1101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/2957 variables, 3/1104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/2957 variables, 0/1104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (OVERLAPS) 0/2957 variables, 0/1104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2957/2957 variables, and 1104 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5831 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, Generalized P Invariants (flows): 102/102 constraints, State Equation: 953/953 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10871ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1985 ms.
Support contains 4 out of 953 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 953/953 places, 2004/2004 transitions.
Applied a total of 0 rules in 29 ms. Remains 953 /953 variables (removed 0) and now considering 2004/2004 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 953/953 places, 2004/2004 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 953/953 places, 2004/2004 transitions.
Applied a total of 0 rules in 27 ms. Remains 953 /953 variables (removed 0) and now considering 2004/2004 (removed 0) transitions.
[2026-05-22 22:13:53] [INFO ] Invariant cache hit.
[2026-05-22 22:13:54] [INFO ] Implicit Places using invariants in 910 ms returned [71, 88, 94, 97, 99, 100, 105, 106, 158, 175, 181, 184, 186, 187, 192, 193, 245, 262, 268, 271, 273, 274, 279, 280, 332, 349, 355, 358, 360, 361, 366, 367, 419, 436, 442, 445, 447, 448, 453, 454, 506, 523, 530, 535, 536, 541, 542, 594, 611, 617, 620, 622, 623, 628, 629, 681, 699, 705, 710, 711, 716, 717, 769, 786, 792, 795, 797, 798, 860, 877, 883, 886, 888, 889, 890]
[2026-05-22 22:13:54] [INFO ] Actually due to overlaps returned [187, 274, 361, 448, 536, 623, 711, 798, 889, 890, 88, 94, 99, 175, 181, 186, 262, 268, 273, 349, 355, 360, 436, 442, 447, 611, 617, 622, 786, 792, 797, 877, 883, 888, 71, 100, 158, 245, 332, 419, 506, 523, 530, 535, 594, 681, 699, 705, 710, 769, 860]
Discarding 51 places :
Implicit Place search using SMT only with invariants took 916 ms to find 51 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 902/953 places, 2004/2004 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 865 transition count 1967
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 865 transition count 1967
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 85 place count 854 transition count 1956
Iterating global reduction 0 with 11 rules applied. Total rules applied 96 place count 854 transition count 1956
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 2 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 140 place count 832 transition count 1934
Free-agglomeration rule applied 30 times.
Iterating global reduction 0 with 30 rules applied. Total rules applied 170 place count 832 transition count 1904
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 200 place count 802 transition count 1904
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 212 place count 802 transition count 1892
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 224 place count 790 transition count 1892
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 225 place count 790 transition count 1892
Applied a total of 225 rules in 213 ms. Remains 790 /902 variables (removed 112) and now considering 1892/2004 (removed 112) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16479453027932100960.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3829187798248243346.kers'
[2026-05-22 22:13:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16479453027932100960.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3829187798248243346.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1892 rows 790 cols 7965 entries
Finished phase 1 with 263 SingleSign rule and 430 generalized
[2026-05-22 22:13:55] [INFO ] Computed 97 invariants in 27 ms
Computed 97 P flows in 28 ms.
Exported basis to /tmp/petrispot-output-3829187798248243346.kers
Total runtime 30 ms.
[2026-05-22 22:13:55] [INFO ] Implicit Places using invariants in 961 ms returned [88, 89, 159, 160, 230, 231, 301, 302, 372, 373, 445, 446, 516, 517, 590, 591, 661, 662]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 963 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 772/953 places, 1892/2004 transitions.
Applied a total of 0 rules in 38 ms. Remains 772 /772 variables (removed 0) and now considering 1892/1892 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2161 ms. Remains : 772/953 places, 1892/2004 transitions.
RANDOM walk for 40000 steps (645 resets) in 349 ms. (114 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (89 resets) in 143 ms. (277 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (86 resets) in 157 ms. (253 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (88 resets) in 151 ms. (263 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 225475 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :2 out of 3
Probabilistic random walk after 225475 steps, saw 143829 distinct states, run finished after 3001 ms. (steps per millisecond=75 ) 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-12442019817135063723.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2470550977814494597.kers'
[2026-05-22 22:13:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12442019817135063723.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2470550977814494597.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1892 rows 772 cols 7722 entries
Finished phase 1 with 263 SingleSign rule and 430 generalized
[2026-05-22 22:13:59] [INFO ] Computed 79 invariants in 46 ms
Computed 79 P flows in 47 ms.
Exported basis to /tmp/petrispot-output-2470550977814494597.kers
Total runtime 49 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/45 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 43/88 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 104/192 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 111/303 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 108/411 variables, 8/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/411 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 108/519 variables, 8/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/519 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 68/587 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/587 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/593 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/593 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 178/771 variables, 37/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/771 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/772 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/772 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1892/2664 variables, 772/851 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2664 variables, 0/851 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/2664 variables, 0/851 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2664/2664 variables, and 851 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1570 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 772/772 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/45 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 43/88 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 104/192 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 111/303 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 108/411 variables, 8/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/411 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 108/519 variables, 8/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/519 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 68/587 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/587 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/593 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/593 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 178/771 variables, 37/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/771 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/772 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/772 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1892/2664 variables, 772/851 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2664 variables, 1/852 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2664 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/2664 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2664/2664 variables, and 852 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1220 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 772/772 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2853ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 176 ms.
Support contains 2 out of 772 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 772/772 places, 1892/1892 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 1 place count 772 transition count 1891
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 771 transition count 1891
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 770 transition count 1890
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 770 transition count 1890
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 769 transition count 1889
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 769 transition count 1889
Applied a total of 6 rules in 86 ms. Remains 769 /772 variables (removed 3) and now considering 1889/1892 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 769/772 places, 1889/1892 transitions.
RANDOM walk for 40000 steps (656 resets) in 156 ms. (254 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (86 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 263751 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :0 out of 1
Probabilistic random walk after 263751 steps, saw 170759 distinct states, run finished after 3001 ms. (steps per millisecond=87 ) 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-15648047042241283269.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15366833027990925226.kers'
[2026-05-22 22:14:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15648047042241283269.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15366833027990925226.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1889 rows 769 cols 7713 entries
Finished phase 1 with 262 SingleSign rule and 428 generalized
[2026-05-22 22:14:05] [INFO ] Computed 79 invariants in 46 ms
Computed 79 P flows in 47 ms.
Exported basis to /tmp/petrispot-output-15366833027990925226.kers
Total runtime 50 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/45 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 43/88 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 104/192 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 108/300 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/300 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 108/408 variables, 8/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 108/516 variables, 8/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/516 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 68/584 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/584 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/590 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/590 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 178/768 variables, 37/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/768 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/769 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/769 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1889/2658 variables, 769/848 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2658 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/2658 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2658/2658 variables, and 848 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1420 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 769/769 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/45 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 43/88 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 104/192 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 108/300 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/300 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 108/408 variables, 8/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 108/516 variables, 8/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/516 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 68/584 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/584 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/590 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/590 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 178/768 variables, 37/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/768 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/769 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/769 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1889/2658 variables, 769/848 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2658 variables, 1/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2658 variables, 0/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/2658 variables, 0/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2658/2658 variables, and 849 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1398 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 769/769 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2890ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 137 ms.
Support contains 2 out of 769 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 769/769 places, 1889/1889 transitions.
Applied a total of 0 rules in 32 ms. Remains 769 /769 variables (removed 0) and now considering 1889/1889 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 769/769 places, 1889/1889 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 769/769 places, 1889/1889 transitions.
Applied a total of 0 rules in 31 ms. Remains 769 /769 variables (removed 0) and now considering 1889/1889 (removed 0) transitions.
[2026-05-22 22:14:08] [INFO ] Invariant cache hit.
[2026-05-22 22:14:09] [INFO ] Implicit Places using invariants in 639 ms returned []
[2026-05-22 22:14:09] [INFO ] Invariant cache hit.
[2026-05-22 22:14:11] [INFO ] Implicit Places using invariants and state equation in 1816 ms returned []
Implicit Place search using SMT with State Equation took 2458 ms to find 0 implicit places.
[2026-05-22 22:14:11] [INFO ] Redundant transitions in 147 ms returned []
Running 1843 sub problems to find dead transitions.
[2026-05-22 22:14:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 1843 unsolved
SMT process timed out in 30550ms, After SMT, problems are : Problem set: 0 solved, 1843 unsolved
Search for dead transitions found 0 dead transitions in 30555ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33202 ms. Remains : 769/769 places, 1889/1889 transitions.
Successfully simplified 22 atomic propositions for a total of 15 simplifications.
Initial state reduction rules removed 2 formulas.
FORMULA ASLink-PT-10a-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10a-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10a-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10a-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10a-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10a-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 1 stable transitions
FORMULA ASLink-PT-10a-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10a-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10a-LTLFireability-09 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 2 out of 1982 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1982/1982 places, 3048/3048 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 382 transitions
Trivial Post-agglo rules discarded 382 transitions
Performed 382 trivial Post agglomeration. Transition count delta: 382
Iterating post reduction 0 with 382 rules applied. Total rules applied 382 place count 1981 transition count 2665
Reduce places removed 392 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 402 rules applied. Total rules applied 784 place count 1589 transition count 2655
Reduce places removed 10 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 17 rules applied. Total rules applied 801 place count 1579 transition count 2648
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 808 place count 1572 transition count 2648
Performed 285 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 285 Pre rules applied. Total rules applied 808 place count 1572 transition count 2363
Deduced a syphon composed of 285 places in 2 ms
Ensure Unique test removed 85 places
Reduce places removed 370 places and 0 transitions.
Iterating global reduction 4 with 655 rules applied. Total rules applied 1463 place count 1202 transition count 2363
Discarding 25 places :
Implicit places reduction removed 25 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 4 with 54 rules applied. Total rules applied 1517 place count 1177 transition count 2334
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 5 with 29 rules applied. Total rules applied 1546 place count 1148 transition count 2334
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 41 Pre rules applied. Total rules applied 1546 place count 1148 transition count 2293
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 6 with 82 rules applied. Total rules applied 1628 place count 1107 transition count 2293
Discarding 16 places :
Symmetric choice reduction at 6 with 16 rule applications. Total rules 1644 place count 1091 transition count 2270
Iterating global reduction 6 with 16 rules applied. Total rules applied 1660 place count 1091 transition count 2270
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 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 6 with 14 rules applied. Total rules applied 1674 place count 1091 transition count 2256
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1675 place count 1090 transition count 2256
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1675 place count 1090 transition count 2255
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1677 place count 1089 transition count 2255
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1678 place count 1088 transition count 2247
Iterating global reduction 8 with 1 rules applied. Total rules applied 1679 place count 1088 transition count 2247
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1680 place count 1087 transition count 2239
Iterating global reduction 8 with 1 rules applied. Total rules applied 1681 place count 1087 transition count 2239
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1682 place count 1086 transition count 2231
Iterating global reduction 8 with 1 rules applied. Total rules applied 1683 place count 1086 transition count 2231
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1684 place count 1085 transition count 2223
Iterating global reduction 8 with 1 rules applied. Total rules applied 1685 place count 1085 transition count 2223
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1686 place count 1084 transition count 2215
Iterating global reduction 8 with 1 rules applied. Total rules applied 1687 place count 1084 transition count 2215
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1688 place count 1083 transition count 2207
Iterating global reduction 8 with 1 rules applied. Total rules applied 1689 place count 1083 transition count 2207
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1690 place count 1082 transition count 2199
Iterating global reduction 8 with 1 rules applied. Total rules applied 1691 place count 1082 transition count 2199
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1692 place count 1081 transition count 2191
Iterating global reduction 8 with 1 rules applied. Total rules applied 1693 place count 1081 transition count 2191
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1694 place count 1080 transition count 2183
Iterating global reduction 8 with 1 rules applied. Total rules applied 1695 place count 1080 transition count 2183
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1696 place count 1079 transition count 2175
Iterating global reduction 8 with 1 rules applied. Total rules applied 1697 place count 1079 transition count 2175
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1698 place count 1078 transition count 2167
Iterating global reduction 8 with 1 rules applied. Total rules applied 1699 place count 1078 transition count 2167
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1700 place count 1077 transition count 2159
Iterating global reduction 8 with 1 rules applied. Total rules applied 1701 place count 1077 transition count 2159
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1702 place count 1076 transition count 2151
Iterating global reduction 8 with 1 rules applied. Total rules applied 1703 place count 1076 transition count 2151
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1704 place count 1075 transition count 2143
Iterating global reduction 8 with 1 rules applied. Total rules applied 1705 place count 1075 transition count 2143
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1706 place count 1074 transition count 2135
Iterating global reduction 8 with 1 rules applied. Total rules applied 1707 place count 1074 transition count 2135
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 94
Deduced a syphon composed of 94 places in 2 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 8 with 188 rules applied. Total rules applied 1895 place count 980 transition count 2041
Applied a total of 1895 rules in 820 ms. Remains 980 /1982 variables (removed 1002) and now considering 2041/3048 (removed 1007) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11609695587838492485.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9538604290270651764.kers'
[2026-05-22 22:14:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11609695587838492485.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9538604290270651764.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 3 ms.
// Phase 1: matrix 2041 rows 979 cols 8258 entries
Finished phase 1 with 393 SingleSign rule and 439 generalized
[2026-05-22 22:14:42] [INFO ] Computed 148 invariants in 33 ms
Computed 148 P flows in 34 ms.
Exported basis to /tmp/petrispot-output-9538604290270651764.kers
Total runtime 35 ms.
[2026-05-22 22:14:43] [INFO ] Implicit Places using invariants in 942 ms returned [72, 89, 95, 100, 159, 176, 182, 187, 189, 249, 266, 272, 277, 279, 339, 356, 362, 367, 369, 429, 446, 452, 457, 459, 519, 536, 543, 548, 550, 610, 627, 633, 638, 640, 700, 717, 723, 728, 730, 790, 807, 813, 818, 820, 883, 900, 906, 911, 913, 914, 977]
Discarding 51 places :
Implicit Place search using SMT only with invariants took 944 ms to find 51 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 929/1982 places, 2041/3048 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 929 transition count 2039
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 927 transition count 2039
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 24 place count 907 transition count 2019
Iterating global reduction 2 with 20 rules applied. Total rules applied 44 place count 907 transition count 2019
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 64 place count 887 transition count 1999
Iterating global reduction 2 with 20 rules applied. Total rules applied 84 place count 887 transition count 1999
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 93 place count 878 transition count 1990
Iterating global reduction 2 with 9 rules applied. Total rules applied 102 place count 878 transition count 1990
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 3 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 146 place count 856 transition count 1968
Applied a total of 146 rules in 165 ms. Remains 856 /929 variables (removed 73) and now considering 1968/2041 (removed 73) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5402682066387107556.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9680690991981031856.kers'
[2026-05-22 22:14:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5402682066387107556.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9680690991981031856.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1968 rows 856 cols 7937 entries
Finished phase 1 with 397 SingleSign rule and 362 generalized
[2026-05-22 22:14:44] [INFO ] Computed 97 invariants in 47 ms
Computed 97 P flows in 48 ms.
Exported basis to /tmp/petrispot-output-9680690991981031856.kers
Total runtime 50 ms.
[2026-05-22 22:14:44] [INFO ] Implicit Places using invariants in 738 ms returned []
[2026-05-22 22:14:44] [INFO ] Invariant cache hit.
[2026-05-22 22:14:46] [INFO ] Implicit Places using invariants and state equation in 2132 ms returned []
Implicit Place search using SMT with State Equation took 2873 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 856/1982 places, 1968/3048 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4804 ms. Remains : 856/1982 places, 1968/3048 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 283 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-10a-LTLFireability-01
Stuttering criterion allowed to conclude after 37 steps with 0 reset in 4 ms.
FORMULA ASLink-PT-10a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10a-LTLFireability-01 finished in 5220 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(p0)||X(X(X(X(G((X(X(p2))||p1))))))))'
Support contains 4 out of 1982 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1982/1982 places, 3048/3048 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1981 transition count 3040
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1981 transition count 3040
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1980 transition count 3032
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1980 transition count 3032
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1979 transition count 3024
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1979 transition count 3024
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1978 transition count 3016
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1978 transition count 3016
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1977 transition count 3008
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1977 transition count 3008
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1976 transition count 3000
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1976 transition count 3000
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1975 transition count 2992
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1975 transition count 2992
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1974 transition count 2984
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1974 transition count 2984
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1973 transition count 2976
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1973 transition count 2976
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1972 transition count 2968
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1972 transition count 2968
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1971 transition count 2960
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1971 transition count 2960
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1970 transition count 2952
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1970 transition count 2952
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1969 transition count 2944
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1969 transition count 2944
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 1968 transition count 2936
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 1968 transition count 2936
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 1967 transition count 2928
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 1967 transition count 2928
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 1966 transition count 2920
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 1966 transition count 2920
Applied a total of 32 rules in 1709 ms. Remains 1966 /1982 variables (removed 16) and now considering 2920/3048 (removed 128) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8291878717873747226.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11921762251442644456.kers'
[2026-05-22 22:14:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8291878717873747226.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11921762251442644456.kers]
Culled 0 columns in 5 ms.
// Phase 1: matrix 2920 rows 1966 cols 10137 entries
Finished phase 1 with 1292 SingleSign rule and 406 generalized
[2026-05-22 22:14:49] [INFO ] Computed 268 invariants in 60 ms
Computed 268 P flows in 61 ms.
Exported basis to /tmp/petrispot-output-11921762251442644456.kers
Total runtime 66 ms.
[2026-05-22 22:14:50] [INFO ] Implicit Places using invariants in 1465 ms returned []
[2026-05-22 22:14:50] [INFO ] Invariant cache hit.
[2026-05-22 22:14:54] [INFO ] Implicit Places using invariants and state equation in 4437 ms returned []
Implicit Place search using SMT with State Equation took 5905 ms to find 0 implicit places.
Running 2919 sub problems to find dead transitions.
[2026-05-22 22:14:54] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1965 variables, 207/207 constraints. Problems are: Problem set: 0 solved, 2919 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1965/4886 variables, and 207 constraints, problems are : Problem set: 0 solved, 2919 unsolved in 30094 ms.
Refiners :[Positive P Invariants (semi-flows): 0/45 constraints, Generalized P Invariants (flows): 207/223 constraints, State Equation: 0/1966 constraints, PredecessorRefiner: 2919/2919 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2919 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1965 variables, 207/207 constraints. Problems are: Problem set: 0 solved, 2919 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1965/4886 variables, and 207 constraints, problems are : Problem set: 0 solved, 2919 unsolved in 30084 ms.
Refiners :[Positive P Invariants (semi-flows): 0/45 constraints, Generalized P Invariants (flows): 207/223 constraints, State Equation: 0/1966 constraints, PredecessorRefiner: 0/2919 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61327ms problems are : Problem set: 0 solved, 2919 unsolved
Search for dead transitions found 0 dead transitions in 61340ms
Starting structural reductions in LTL mode, iteration 1 : 1966/1982 places, 2920/3048 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68973 ms. Remains : 1966/1982 places, 2920/3048 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(p0)||X(X(X(X(G((X(X(p2))||p1))))))))'
Stuttering acceptance computed with spot in 530 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : ASLink-PT-10a-LTLFireability-04
Product exploration explored 100000 steps with 483 reset in 663 ms.
Product exploration explored 100000 steps with 483 reset in 501 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 8 states, 9 edges and 3 AP (stutter sensitive) to 8 states, 9 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (154 resets) in 421 ms. (94 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (12 resets) in 303 ms. (131 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (12 resets) in 131 ms. (303 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (13 resets) in 130 ms. (305 steps per ms) remains 3/3 properties
[2026-05-22 22:15:58] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 67/71 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 756/827 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/827 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1139/1966 variables, 223/268 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1966 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2920/4886 variables, 1966/2234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4886 variables, 0/2234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/4886 variables, 0/2234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4886/4886 variables, and 2234 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1886 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 223/223 constraints, State Equation: 1966/1966 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 67/71 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 756/827 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/827 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1139/1966 variables, 223/268 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1966 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2920/4886 variables, 1966/2234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4886 variables, 3/2237 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4886 variables, 0/2237 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/4886 variables, 0/2237 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4886/4886 variables, and 2237 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4161 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 223/223 constraints, State Equation: 1966/1966 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6059ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 757 steps, including 1 resets, run visited all 3 properties in 20 ms. (steps per millisecond=37 )
Parikh walk visited 3 properties in 29 ms.
Knowledge based reduction with 3 factoid took 177 ms. Reduced automaton from 8 states, 9 edges and 3 AP (stutter sensitive) to 8 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 529 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Knowledge-based reduction took 7255 ms.
Stuttering acceptance computed with spot in 574 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Support contains 4 out of 1966 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1966/1966 places, 2920/2920 transitions.
Applied a total of 0 rules in 144 ms. Remains 1966 /1966 variables (removed 0) and now considering 2920/2920 (removed 0) transitions.
[2026-05-22 22:16:06] [INFO ] Invariant cache hit.
[2026-05-22 22:16:07] [INFO ] Implicit Places using invariants in 1440 ms returned []
[2026-05-22 22:16:07] [INFO ] Invariant cache hit.
[2026-05-22 22:16:12] [INFO ] Implicit Places using invariants and state equation in 4683 ms returned []
Implicit Place search using SMT with State Equation took 6138 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 6284 ms. Remains : 1966/1966 places, 2920/2920 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge based reduction with 1 factoid took 61 ms. Reduced automaton from 8 states, 9 edges and 3 AP (stutter sensitive) to 8 states, 9 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (174 resets) in 487 ms. (81 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (11 resets) in 95 ms. (416 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (12 resets) in 99 ms. (400 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (12 resets) in 84 ms. (470 steps per ms) remains 3/3 properties
[2026-05-22 22:16:12] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 67/71 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 756/827 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/827 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1139/1966 variables, 223/268 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1966 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2920/4886 variables, 1966/2234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4886 variables, 0/2234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/4886 variables, 0/2234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4886/4886 variables, and 2234 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1738 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 223/223 constraints, State Equation: 1966/1966 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 67/71 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 756/827 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/827 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1139/1966 variables, 223/268 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1966 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2920/4886 variables, 1966/2234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4886 variables, 3/2237 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4886 variables, 0/2237 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/4886 variables, 0/2237 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4886/4886 variables, and 2237 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4086 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 223/223 constraints, State Equation: 1966/1966 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5844ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 764 steps, including 1 resets, run visited all 3 properties in 28 ms. (steps per millisecond=27 )
Parikh walk visited 3 properties in 28 ms.
Knowledge based reduction with 1 factoid took 98 ms. Reduced automaton from 8 states, 9 edges and 3 AP (stutter sensitive) to 8 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 470 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Knowledge-based reduction took 6802 ms.
Stuttering acceptance computed with spot in 515 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Stuttering acceptance computed with spot in 411 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Product exploration explored 100000 steps with 445 reset in 407 ms.
Product exploration explored 100000 steps with 465 reset in 589 ms.
Spot run failed in 103 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin14267974703250309250
[2026-05-22 22:16:21] [INFO ] Built C files in 66ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14267974703250309250
Running compilation step : cd /tmp/ltsmin14267974703250309250;'/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/ltsmin14267974703250309250;'/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/ltsmin14267974703250309250;'/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 4 out of 1966 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1966/1966 places, 2920/2920 transitions.
Applied a total of 0 rules in 146 ms. Remains 1966 /1966 variables (removed 0) and now considering 2920/2920 (removed 0) transitions.
[2026-05-22 22:16:24] [INFO ] Invariant cache hit.
[2026-05-22 22:16:25] [INFO ] Implicit Places using invariants in 1434 ms returned []
[2026-05-22 22:16:25] [INFO ] Invariant cache hit.
[2026-05-22 22:16:30] [INFO ] Implicit Places using invariants and state equation in 4448 ms returned []
Implicit Place search using SMT with State Equation took 5888 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 6037 ms. Remains : 1966/1966 places, 2920/2920 transitions.
Built C files in :
/tmp/ltsmin3831875835787849709
[2026-05-22 22:16:30] [INFO ] Built C files in 66ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3831875835787849709
Running compilation step : cd /tmp/ltsmin3831875835787849709;'/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/ltsmin3831875835787849709;'/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/ltsmin3831875835787849709;'/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-05-22 22:16:33] [INFO ] Flatten gal took : 76 ms
[2026-05-22 22:16:33] [INFO ] Flatten gal took : 71 ms
[2026-05-22 22:16:33] [INFO ] Time to serialize gal into /tmp/LTL11469745048841923743.gal : 23 ms
[2026-05-22 22:16:33] [INFO ] Time to serialize properties into /tmp/LTL1409986566965179463.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/LTL11469745048841923743.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13353576562134717047.hoa' '-atoms' '/tmp/LTL1409986566965179463.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...319
Loading property file /tmp/LTL1409986566965179463.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13353576562134717047.hoa
Detected timeout of ITS tools.
[2026-05-22 22:16:48] [INFO ] Flatten gal took : 75 ms
[2026-05-22 22:16:49] [INFO ] Flatten gal took : 81 ms
[2026-05-22 22:16:49] [INFO ] Time to serialize gal into /tmp/LTL6959142739672034121.gal : 19 ms
[2026-05-22 22:16:49] [INFO ] Time to serialize properties into /tmp/LTL12801657556468748261.ltl : 8 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/LTL6959142739672034121.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12801657556468748261.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 : !(((F("((p1776==1)&&(p1958==1))"))||(X(X(X(X(G(("((p1419==0)||(p1489==0))")||(X(X("((p1419==1)&&(p1489==1))")))))))))))
Formula 0 simplified : G!"((p1776==1)&&(p1958==1))" & XXXXF(!"((p1419==0)||(p1489==0))" & XX!"((p1419==1)&&(p1489==1))")
Detected timeout of ITS tools.
[2026-05-22 22:17:04] [INFO ] Flatten gal took : 91 ms
[2026-05-22 22:17:04] [INFO ] Applying decomposition
[2026-05-22 22:17:04] [INFO ] Flatten gal took : 88 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/graph1763831211842567704.txt' '-o' '/tmp/graph1763831211842567704.bin' '-w' '/tmp/graph1763831211842567704.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1763831211842567704.bin' '-l' '-1' '-v' '-w' '/tmp/graph1763831211842567704.weights' '-q' '0' '-e' '0.001'
[2026-05-22 22:17:04] [INFO ] Decomposing Gal with order
[2026-05-22 22:17:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 22:17:04] [INFO ] Removed a total of 3876 redundant transitions.
[2026-05-22 22:17:05] [INFO ] Flatten gal took : 298 ms
[2026-05-22 22:17:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 41 ms.
[2026-05-22 22:17:05] [INFO ] Time to serialize gal into /tmp/LTL1357268818338326348.gal : 30 ms
[2026-05-22 22:17:05] [INFO ] Time to serialize properties into /tmp/LTL10293872705327319082.ltl : 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/LTL1357268818338326348.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10293872705327319082.ltl' '-c' '-stutter-deadlock'

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...255
Read 1 LTL properties
Checking formula 0 : !(((F("((i16.u496.p1776==1)&&(i16.u548.p1958==1))"))||(X(X(X(X(G(("((i15.u421.p1419==0)||(i15.u419.p1489==0))")||(X(X("((i15.u421.p141...194
Formula 0 simplified : G!"((i16.u496.p1776==1)&&(i16.u548.p1958==1))" & XXXXF(!"((i15.u421.p1419==0)||(i15.u419.p1489==0))" & XX!"((i15.u421.p1419==1)&&(i1...174
Detected timeout of ITS tools.
Treatment of property ASLink-PT-10a-LTLFireability-04 finished in 153020 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 1982 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1982/1982 places, 3048/3048 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1981 transition count 3040
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1981 transition count 3040
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1980 transition count 3032
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1980 transition count 3032
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1979 transition count 3024
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1979 transition count 3024
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1978 transition count 3016
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1978 transition count 3016
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1977 transition count 3008
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1977 transition count 3008
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1976 transition count 3000
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1976 transition count 3000
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1975 transition count 2992
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1975 transition count 2992
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1974 transition count 2984
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1974 transition count 2984
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1973 transition count 2976
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1973 transition count 2976
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1972 transition count 2968
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1972 transition count 2968
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1971 transition count 2960
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1971 transition count 2960
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1970 transition count 2952
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1970 transition count 2952
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1969 transition count 2944
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1969 transition count 2944
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 1968 transition count 2936
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 1968 transition count 2936
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 1967 transition count 2928
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 1967 transition count 2928
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 1966 transition count 2920
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 1966 transition count 2920
Applied a total of 32 rules in 1790 ms. Remains 1966 /1982 variables (removed 16) and now considering 2920/3048 (removed 128) transitions.
[2026-05-22 22:17:22] [INFO ] Invariant cache hit.
[2026-05-22 22:17:23] [INFO ] Implicit Places using invariants in 1511 ms returned [1820]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1515 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1965/1982 places, 2920/3048 transitions.
Applied a total of 0 rules in 130 ms. Remains 1965 /1965 variables (removed 0) and now considering 2920/2920 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3449 ms. Remains : 1965/1982 places, 2920/3048 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Stuttering acceptance computed with spot in 180 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-10a-LTLFireability-05
Entered a terminal (fully accepting) state of product in 754 steps with 5 reset in 7 ms.
FORMULA ASLink-PT-10a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10a-LTLFireability-05 finished in 3702 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((F(p0)&&X(X(p1)))))))'
Support contains 4 out of 1982 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1982/1982 places, 3048/3048 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1981 transition count 3040
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1981 transition count 3040
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1980 transition count 3032
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1980 transition count 3032
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1979 transition count 3024
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1979 transition count 3024
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1978 transition count 3016
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1978 transition count 3016
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1977 transition count 3008
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1977 transition count 3008
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1976 transition count 3000
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1976 transition count 3000
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1975 transition count 2992
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1975 transition count 2992
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1974 transition count 2984
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1974 transition count 2984
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1973 transition count 2976
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1973 transition count 2976
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1972 transition count 2968
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1972 transition count 2968
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1971 transition count 2960
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1971 transition count 2960
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1970 transition count 2952
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1970 transition count 2952
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1969 transition count 2944
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1969 transition count 2944
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 1968 transition count 2936
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 1968 transition count 2936
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 1967 transition count 2928
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 1967 transition count 2928
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 1966 transition count 2920
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 1966 transition count 2920
Applied a total of 32 rules in 1721 ms. Remains 1966 /1982 variables (removed 16) and now considering 2920/3048 (removed 128) transitions.
[2026-05-22 22:17:25] [INFO ] Invariant cache hit.
[2026-05-22 22:17:27] [INFO ] Implicit Places using invariants in 1421 ms returned [1820]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1424 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1965/1982 places, 2920/3048 transitions.
Applied a total of 0 rules in 130 ms. Remains 1965 /1965 variables (removed 0) and now considering 2920/2920 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3275 ms. Remains : 1965/1982 places, 2920/3048 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((F(p0)&&X(X(p1)))))))'
Stuttering acceptance computed with spot in 478 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ASLink-PT-10a-LTLFireability-06
Stuttering criterion allowed to conclude after 314 steps with 0 reset in 3 ms.
FORMULA ASLink-PT-10a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10a-LTLFireability-06 finished in 3810 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(p0))'
Support contains 2 out of 1982 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1982/1982 places, 3048/3048 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 390 transitions
Trivial Post-agglo rules discarded 390 transitions
Performed 390 trivial Post agglomeration. Transition count delta: 390
Iterating post reduction 0 with 390 rules applied. Total rules applied 390 place count 1981 transition count 2657
Reduce places removed 400 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 410 rules applied. Total rules applied 800 place count 1581 transition count 2647
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 810 place count 1571 transition count 2647
Performed 285 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 285 Pre rules applied. Total rules applied 810 place count 1571 transition count 2362
Deduced a syphon composed of 285 places in 4 ms
Ensure Unique test removed 85 places
Reduce places removed 370 places and 0 transitions.
Iterating global reduction 3 with 655 rules applied. Total rules applied 1465 place count 1201 transition count 2362
Discarding 25 places :
Implicit places reduction removed 25 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 3 with 54 rules applied. Total rules applied 1519 place count 1176 transition count 2333
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 4 with 29 rules applied. Total rules applied 1548 place count 1147 transition count 2333
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 41 Pre rules applied. Total rules applied 1548 place count 1147 transition count 2292
Deduced a syphon composed of 41 places in 3 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 5 with 82 rules applied. Total rules applied 1630 place count 1106 transition count 2292
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 1646 place count 1090 transition count 2269
Iterating global reduction 5 with 16 rules applied. Total rules applied 1662 place count 1090 transition count 2269
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 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 5 with 14 rules applied. Total rules applied 1676 place count 1090 transition count 2255
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1677 place count 1089 transition count 2255
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1677 place count 1089 transition count 2254
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1679 place count 1088 transition count 2254
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1680 place count 1087 transition count 2246
Iterating global reduction 7 with 1 rules applied. Total rules applied 1681 place count 1087 transition count 2246
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1682 place count 1086 transition count 2238
Iterating global reduction 7 with 1 rules applied. Total rules applied 1683 place count 1086 transition count 2238
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1684 place count 1085 transition count 2230
Iterating global reduction 7 with 1 rules applied. Total rules applied 1685 place count 1085 transition count 2230
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1686 place count 1084 transition count 2222
Iterating global reduction 7 with 1 rules applied. Total rules applied 1687 place count 1084 transition count 2222
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1688 place count 1083 transition count 2214
Iterating global reduction 7 with 1 rules applied. Total rules applied 1689 place count 1083 transition count 2214
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1690 place count 1082 transition count 2206
Iterating global reduction 7 with 1 rules applied. Total rules applied 1691 place count 1082 transition count 2206
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1692 place count 1081 transition count 2198
Iterating global reduction 7 with 1 rules applied. Total rules applied 1693 place count 1081 transition count 2198
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1694 place count 1080 transition count 2190
Iterating global reduction 7 with 1 rules applied. Total rules applied 1695 place count 1080 transition count 2190
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1696 place count 1079 transition count 2182
Iterating global reduction 7 with 1 rules applied. Total rules applied 1697 place count 1079 transition count 2182
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1698 place count 1078 transition count 2174
Iterating global reduction 7 with 1 rules applied. Total rules applied 1699 place count 1078 transition count 2174
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1700 place count 1077 transition count 2166
Iterating global reduction 7 with 1 rules applied. Total rules applied 1701 place count 1077 transition count 2166
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1702 place count 1076 transition count 2158
Iterating global reduction 7 with 1 rules applied. Total rules applied 1703 place count 1076 transition count 2158
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1704 place count 1075 transition count 2150
Iterating global reduction 7 with 1 rules applied. Total rules applied 1705 place count 1075 transition count 2150
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1706 place count 1074 transition count 2142
Iterating global reduction 7 with 1 rules applied. Total rules applied 1707 place count 1074 transition count 2142
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1708 place count 1073 transition count 2134
Iterating global reduction 7 with 1 rules applied. Total rules applied 1709 place count 1073 transition count 2134
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 94
Deduced a syphon composed of 94 places in 5 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 7 with 188 rules applied. Total rules applied 1897 place count 979 transition count 2040
Applied a total of 1897 rules in 948 ms. Remains 979 /1982 variables (removed 1003) and now considering 2040/3048 (removed 1008) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2484154678788252368.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15231249380212671446.kers'
[2026-05-22 22:17:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2484154678788252368.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15231249380212671446.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 3 ms.
// Phase 1: matrix 2040 rows 978 cols 8256 entries
Finished phase 1 with 392 SingleSign rule and 439 generalized
[2026-05-22 22:17:28] [INFO ] Computed 148 invariants in 42 ms
Computed 148 P flows in 42 ms.
Exported basis to /tmp/petrispot-output-15231249380212671446.kers
Total runtime 45 ms.
[2026-05-22 22:17:29] [INFO ] Implicit Places using invariants in 1034 ms returned [72, 89, 95, 100, 159, 176, 182, 187, 189, 249, 266, 272, 277, 279, 339, 356, 362, 367, 369, 429, 446, 452, 457, 459, 519, 536, 542, 547, 549, 609, 626, 632, 637, 639, 699, 716, 722, 727, 729, 789, 806, 812, 817, 819, 882, 899, 905, 910, 912, 913, 976]
Discarding 51 places :
Implicit Place search using SMT only with invariants took 1038 ms to find 51 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 928/1982 places, 2040/3048 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 928 transition count 2038
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 926 transition count 2038
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 24 place count 906 transition count 2018
Iterating global reduction 2 with 20 rules applied. Total rules applied 44 place count 906 transition count 2018
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 64 place count 886 transition count 1998
Iterating global reduction 2 with 20 rules applied. Total rules applied 84 place count 886 transition count 1998
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 94 place count 876 transition count 1988
Iterating global reduction 2 with 10 rules applied. Total rules applied 104 place count 876 transition count 1988
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 2 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 148 place count 854 transition count 1966
Applied a total of 148 rules in 180 ms. Remains 854 /928 variables (removed 74) and now considering 1966/2040 (removed 74) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12490420948257051533.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13318375578380556826.kers'
[2026-05-22 22:17:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12490420948257051533.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13318375578380556826.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1966 rows 854 cols 7931 entries
Finished phase 1 with 397 SingleSign rule and 360 generalized
[2026-05-22 22:17:30] [INFO ] Computed 97 invariants in 46 ms
Computed 97 P flows in 47 ms.
Exported basis to /tmp/petrispot-output-13318375578380556826.kers
Total runtime 49 ms.
[2026-05-22 22:17:30] [INFO ] Implicit Places using invariants in 826 ms returned []
[2026-05-22 22:17:30] [INFO ] Invariant cache hit.
[2026-05-22 22:17:32] [INFO ] Implicit Places using invariants and state equation in 2101 ms returned []
Implicit Place search using SMT with State Equation took 2931 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 854/1982 places, 1966/3048 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5098 ms. Remains : 854/1982 places, 1966/3048 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(p0))'
Stuttering acceptance computed with spot in 62 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-10a-LTLFireability-11
Stuttering criterion allowed to conclude after 38 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-10a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10a-LTLFireability-11 finished in 5222 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 1 out of 1982 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1982/1982 places, 3048/3048 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 388 transitions
Trivial Post-agglo rules discarded 388 transitions
Performed 388 trivial Post agglomeration. Transition count delta: 388
Iterating post reduction 0 with 388 rules applied. Total rules applied 388 place count 1981 transition count 2659
Reduce places removed 398 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 408 rules applied. Total rules applied 796 place count 1583 transition count 2649
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 11 rules applied. Total rules applied 807 place count 1573 transition count 2648
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 808 place count 1572 transition count 2648
Performed 284 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 284 Pre rules applied. Total rules applied 808 place count 1572 transition count 2364
Deduced a syphon composed of 284 places in 5 ms
Ensure Unique test removed 85 places
Reduce places removed 369 places and 0 transitions.
Iterating global reduction 4 with 653 rules applied. Total rules applied 1461 place count 1203 transition count 2364
Discarding 24 places :
Implicit places reduction removed 24 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 4 with 53 rules applied. Total rules applied 1514 place count 1179 transition count 2335
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 5 with 29 rules applied. Total rules applied 1543 place count 1150 transition count 2335
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 41 Pre rules applied. Total rules applied 1543 place count 1150 transition count 2294
Deduced a syphon composed of 41 places in 3 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 6 with 82 rules applied. Total rules applied 1625 place count 1109 transition count 2294
Discarding 16 places :
Symmetric choice reduction at 6 with 16 rule applications. Total rules 1641 place count 1093 transition count 2271
Iterating global reduction 6 with 16 rules applied. Total rules applied 1657 place count 1093 transition count 2271
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 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 6 with 14 rules applied. Total rules applied 1671 place count 1093 transition count 2257
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1672 place count 1092 transition count 2257
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1672 place count 1092 transition count 2256
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1674 place count 1091 transition count 2256
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1675 place count 1090 transition count 2248
Iterating global reduction 8 with 1 rules applied. Total rules applied 1676 place count 1090 transition count 2248
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1677 place count 1089 transition count 2240
Iterating global reduction 8 with 1 rules applied. Total rules applied 1678 place count 1089 transition count 2240
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1679 place count 1088 transition count 2232
Iterating global reduction 8 with 1 rules applied. Total rules applied 1680 place count 1088 transition count 2232
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1681 place count 1087 transition count 2224
Iterating global reduction 8 with 1 rules applied. Total rules applied 1682 place count 1087 transition count 2224
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1683 place count 1086 transition count 2216
Iterating global reduction 8 with 1 rules applied. Total rules applied 1684 place count 1086 transition count 2216
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1685 place count 1085 transition count 2208
Iterating global reduction 8 with 1 rules applied. Total rules applied 1686 place count 1085 transition count 2208
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1687 place count 1084 transition count 2200
Iterating global reduction 8 with 1 rules applied. Total rules applied 1688 place count 1084 transition count 2200
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1689 place count 1083 transition count 2192
Iterating global reduction 8 with 1 rules applied. Total rules applied 1690 place count 1083 transition count 2192
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1691 place count 1082 transition count 2184
Iterating global reduction 8 with 1 rules applied. Total rules applied 1692 place count 1082 transition count 2184
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1693 place count 1081 transition count 2176
Iterating global reduction 8 with 1 rules applied. Total rules applied 1694 place count 1081 transition count 2176
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1695 place count 1080 transition count 2168
Iterating global reduction 8 with 1 rules applied. Total rules applied 1696 place count 1080 transition count 2168
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1697 place count 1079 transition count 2160
Iterating global reduction 8 with 1 rules applied. Total rules applied 1698 place count 1079 transition count 2160
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1699 place count 1078 transition count 2152
Iterating global reduction 8 with 1 rules applied. Total rules applied 1700 place count 1078 transition count 2152
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1701 place count 1077 transition count 2144
Iterating global reduction 8 with 1 rules applied. Total rules applied 1702 place count 1077 transition count 2144
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1703 place count 1076 transition count 2136
Iterating global reduction 8 with 1 rules applied. Total rules applied 1704 place count 1076 transition count 2136
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 6 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 8 with 186 rules applied. Total rules applied 1890 place count 983 transition count 2043
Applied a total of 1890 rules in 944 ms. Remains 983 /1982 variables (removed 999) and now considering 2043/3048 (removed 1005) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16494867768721630111.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3459664024020527587.kers'
[2026-05-22 22:17:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16494867768721630111.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3459664024020527587.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 3 ms.
// Phase 1: matrix 2043 rows 982 cols 8264 entries
Finished phase 1 with 393 SingleSign rule and 441 generalized
[2026-05-22 22:17:34] [INFO ] Computed 149 invariants in 50 ms
Computed 149 P flows in 51 ms.
Exported basis to /tmp/petrispot-output-3459664024020527587.kers
Total runtime 53 ms.
[2026-05-22 22:17:35] [INFO ] Implicit Places using invariants in 1053 ms returned [72, 89, 95, 100, 159, 176, 182, 187, 189, 249, 266, 272, 277, 279, 339, 356, 362, 367, 369, 429, 446, 452, 457, 463, 523, 540, 546, 551, 553, 613, 630, 636, 641, 643, 703, 720, 726, 731, 733, 793, 810, 816, 821, 823, 886, 903, 909, 914, 916, 917, 980]
Discarding 51 places :
Implicit Place search using SMT only with invariants took 1057 ms to find 51 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 932/1982 places, 2043/3048 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 932 transition count 2041
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 930 transition count 2041
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 24 place count 910 transition count 2021
Iterating global reduction 2 with 20 rules applied. Total rules applied 44 place count 910 transition count 2021
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 64 place count 890 transition count 2001
Iterating global reduction 2 with 20 rules applied. Total rules applied 84 place count 890 transition count 2001
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 94 place count 880 transition count 1991
Iterating global reduction 2 with 10 rules applied. Total rules applied 104 place count 880 transition count 1991
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 2 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 148 place count 858 transition count 1969
Applied a total of 148 rules in 205 ms. Remains 858 /932 variables (removed 74) and now considering 1969/2043 (removed 74) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3200792417749776248.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2292594213638251721.kers'
[2026-05-22 22:17:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3200792417749776248.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2292594213638251721.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1969 rows 858 cols 7939 entries
Finished phase 1 with 399 SingleSign rule and 361 generalized
[2026-05-22 22:17:35] [INFO ] Computed 98 invariants in 47 ms
Computed 98 P flows in 48 ms.
Exported basis to /tmp/petrispot-output-2292594213638251721.kers
Total runtime 53 ms.
[2026-05-22 22:17:36] [INFO ] Implicit Places using invariants in 835 ms returned []
[2026-05-22 22:17:36] [INFO ] Invariant cache hit.
[2026-05-22 22:17:38] [INFO ] Implicit Places using invariants and state equation in 1954 ms returned []
Implicit Place search using SMT with State Equation took 2791 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 858/1982 places, 1969/3048 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4997 ms. Remains : 858/1982 places, 1969/3048 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 47 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-10a-LTLFireability-14
Stuttering criterion allowed to conclude after 59 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-10a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10a-LTLFireability-14 finished in 5090 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(p0)||X(X(X(X(G((X(X(p2))||p1))))))))'
Spot run failed in 71 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-22 22:17:38] [INFO ] Flatten gal took : 93 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13567366416264182922
[2026-05-22 22:17:38] [INFO ] Too many transitions (3048) to apply POR reductions. Disabling POR matrices.
[2026-05-22 22:17:38] [INFO ] Applying decomposition
[2026-05-22 22:17:38] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13567366416264182922
Running compilation step : cd /tmp/ltsmin13567366416264182922;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' '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'
[2026-05-22 22:17:38] [INFO ] Flatten gal took : 58 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/graph12535774385078617779.txt' '-o' '/tmp/graph12535774385078617779.bin' '-w' '/tmp/graph12535774385078617779.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12535774385078617779.bin' '-l' '-1' '-v' '-w' '/tmp/graph12535774385078617779.weights' '-q' '0' '-e' '0.001'
[2026-05-22 22:17:38] [INFO ] Decomposing Gal with order
[2026-05-22 22:17:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 22:17:38] [INFO ] Removed a total of 4231 redundant transitions.
[2026-05-22 22:17:38] [INFO ] Flatten gal took : 109 ms
[2026-05-22 22:17:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 28 ms.
[2026-05-22 22:17:38] [INFO ] Time to serialize gal into /tmp/LTLFireability18214177573436813178.gal : 20 ms
[2026-05-22 22:17:38] [INFO ] Time to serialize properties into /tmp/LTLFireability897428597886919444.ltl : 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/LTLFireability18214177573436813178.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability897428597886919444.ltl' '-c' '-stutter-deadlock'

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 : !(((F("((i17.u490.p1776==1)&&(i17.u545.p1958==1))"))||(X(X(X(X(G(("((i15.u416.p1419==0)||(i15.u415.p1489==0))")||(X(X("((i15.u416.p141...194
Formula 0 simplified : G!"((i17.u490.p1776==1)&&(i17.u545.p1958==1))" & XXXXF(!"((i15.u416.p1419==0)||(i15.u415.p1489==0))" & XX!"((i15.u416.p1419==1)&&(i1...174
Compilation finished in 7414 ms.
Running link step : cd /tmp/ltsmin13567366416264182922;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 109 ms.
Running LTSmin : cd /tmp/ltsmin13567366416264182922;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '(<>((LTLAPp0==true))||X(X(X(X([]((X(X((LTLAPp2==true)))||(LTLAPp1==true))))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-22 22:39:41] [INFO ] Applying decomposition
[2026-05-22 22:39:41] [INFO ] Flatten gal took : 506 ms
[2026-05-22 22:39:41] [INFO ] Decomposing Gal with order
[2026-05-22 22:39:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 22:39:43] [INFO ] Removed a total of 3489 redundant transitions.
[2026-05-22 22:39:43] [INFO ] Flatten gal took : 853 ms
[2026-05-22 22:39:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 1279 labels/synchronizations in 242 ms.
[2026-05-22 22:39:43] [INFO ] Time to serialize gal into /tmp/LTLFireability13962264412822424421.gal : 48 ms
[2026-05-22 22:39:43] [INFO ] Time to serialize properties into /tmp/LTLFireability2977861401493782661.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13962264412822424421.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2977861401493782661.ltl' '-c' '-stutter-deadlock'

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("((u315.p1776==1)&&(i78.u409.p1958==1))"))||(X(X(X(X(G(("((u250.p1419==0)||(i61.u258.p1489==0))")||(X(X("((u250.p1419==1)&&(i61....182
Formula 0 simplified : G!"((u315.p1776==1)&&(i78.u409.p1958==1))" & XXXXF(!"((u250.p1419==0)||(i61.u258.p1489==0))" & XX!"((u250.p1419==1)&&(i61.u258.p1489...162
Detected timeout of ITS tools.
[2026-05-22 23:01:45] [INFO ] Flatten gal took : 382 ms
[2026-05-22 23:01:49] [INFO ] Input system was already deterministic with 3048 transitions.
[2026-05-22 23:01:49] [INFO ] Transformed 1982 places.
[2026-05-22 23:01:49] [INFO ] Transformed 3048 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2026-05-22 23:02:20] [INFO ] Time to serialize gal into /tmp/LTLFireability10070027067783616227.gal : 611 ms
[2026-05-22 23:02:20] [INFO ] Time to serialize properties into /tmp/LTLFireability17802045907615519648.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/LTLFireability10070027067783616227.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17802045907615519648.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((F("((p1776==1)&&(p1958==1))"))||(X(X(X(X(G(("((p1419==0)||(p1489==0))")||(X(X("((p1419==1)&&(p1489==1))")))))))))))
Formula 0 simplified : G!"((p1776==1)&&(p1958==1))" & XXXXF(!"((p1419==0)||(p1489==0))" & XX!"((p1419==1)&&(p1489==1))")

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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -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="ASLink-PT-10a"
export BK_EXAMINATION="LTLFireability"
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 ASLink-PT-10a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r002-oct2-177944366300428"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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