About the Execution of ITS-Tools for CANInsertWithFailure-PT-030
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4643.344 | 1196101.00 | 1392763.00 | 11101.90 | FFFFFFFFFFTFFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r034-tall-177946842100723.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is CANInsertWithFailure-PT-030, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946842100723
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.2M
-rw-r--r-- 1 mcc users 11K Mar 6 10:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Mar 6 10:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Mar 6 10:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Mar 6 10:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Mar 15 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 15 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 28K Mar 6 10:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 241K Mar 6 10:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 6 10:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Mar 6 10:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 15 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 15 07:54 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 5.6M 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 CANInsertWithFailure-PT-030-LTLCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-030-LTLCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-030-LTLCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-030-LTLCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-030-LTLCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-030-LTLCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-030-LTLCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-030-LTLCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-030-LTLCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-030-LTLCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-030-LTLCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-030-LTLCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-030-LTLCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-030-LTLCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-030-LTLCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-030-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1779670354226
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-030
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-25 00:52:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 00:52:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 00:52:35] [INFO ] Load time of PNML (sax parser for PT used): 276 ms
[2026-05-25 00:52:35] [INFO ] Transformed 2164 places.
[2026-05-25 00:52:35] [INFO ] Transformed 5580 transitions.
[2026-05-25 00:52:35] [INFO ] Parsed PT model containing 2164 places and 5580 transitions and 15000 arcs in 414 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 2164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2164/2164 places, 5580/5580 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2163 transition count 5580
Applied a total of 1 rules in 349 ms. Remains 2163 /2164 variables (removed 1) and now considering 5580/5580 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7818921823476966678.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15087928223726594476.kers'
[2026-05-25 00:52:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7818921823476966678.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15087928223726594476.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 5580 rows 2163 cols 11400 entries
Finished phase 1 with 2101 SingleSign rule and 30 generalized
[2026-05-25 00:52:36] [INFO ] Computed 32 invariants in 72 ms
Computed 32 P flows in 73 ms.
Exported basis to /tmp/petrispot-output-15087928223726594476.kers
Total runtime 81 ms.
[2026-05-25 00:52:38] [INFO ] Implicit Places using invariants in 1711 ms returned []
[2026-05-25 00:52:38] [INFO ] Invariant cache hit.
[2026-05-25 00:52:39] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2026-05-25 00:52:56] [INFO ] Implicit Places using invariants and state equation in 18163 ms returned []
Implicit Place search using SMT with State Equation took 19934 ms to find 0 implicit places.
Running 5550 sub problems to find dead transitions.
[2026-05-25 00:52:56] [INFO ] Invariant cache hit.
[2026-05-25 00:52:56] [INFO ] State equation strengthened by 1770 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/2162 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 5550 unsolved
SMT process timed out in 33707ms, After SMT, problems are : Problem set: 0 solved, 5550 unsolved
Search for dead transitions found 0 dead transitions in 33788ms
Starting structural reductions in LTL mode, iteration 1 : 2163/2164 places, 5580/5580 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54153 ms. Remains : 2163/2164 places, 5580/5580 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 75 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2026-05-25 00:53:30] [INFO ] Invariant cache hit.
[2026-05-25 00:53:31] [INFO ] Implicit Places using invariants in 900 ms returned []
[2026-05-25 00:53:31] [INFO ] Invariant cache hit.
[2026-05-25 00:53:32] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2026-05-25 00:53:48] [INFO ] Implicit Places using invariants and state equation in 17130 ms returned []
Implicit Place search using SMT with State Equation took 18034 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 18115 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Support contains 50 out of 2163 places after structural reductions.
[2026-05-25 00:53:48] [INFO ] Flatten gal took : 284 ms
[2026-05-25 00:53:49] [INFO ] Flatten gal took : 204 ms
[2026-05-25 00:53:49] [INFO ] Input system was already deterministic with 5580 transitions.
Support contains 46 out of 2163 places (down from 50) after GAL structural reductions.
RANDOM walk for 40000 steps (52 resets) in 1796 ms. (22 steps per ms) remains 12/34 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 112 ms. (354 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 12/12 properties
[2026-05-25 00:53:50] [INFO ] Invariant cache hit.
[2026-05-25 00:53:50] [INFO ] State equation strengthened by 1770 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp26 is UNSAT
At refinement iteration 1 (OVERLAPS) 2095/2107 variables, 4/4 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2107 variables, 20/24 constraints. Problems are: Problem set: 3 solved, 9 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/2107 variables, 8/32 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2107 variables, 0/32 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 52/2159 variables, 26/58 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2159 variables, 0/58 constraints. Problems are: Problem set: 3 solved, 9 unsolved
Problem AtomicPropp2 is UNSAT
At refinement iteration 7 (OVERLAPS) 2/2161 variables, 2/60 constraints. Problems are: Problem set: 4 solved, 8 unsolved
SMT process timed out in 6090ms, After SMT, problems are : Problem set: 4 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 9 out of 2163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 208 transitions
Trivial Post-agglo rules discarded 208 transitions
Performed 208 trivial Post agglomeration. Transition count delta: 208
Iterating post reduction 0 with 208 rules applied. Total rules applied 208 place count 2163 transition count 5372
Reduce places removed 208 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 209 rules applied. Total rules applied 417 place count 1955 transition count 5371
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 418 place count 1954 transition count 5371
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 418 place count 1954 transition count 5370
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 420 place count 1953 transition count 5370
Performed 864 Post agglomeration using F-continuation condition.Transition count delta: 864
Deduced a syphon composed of 864 places in 2 ms
Reduce places removed 864 places and 0 transitions.
Iterating global reduction 3 with 1728 rules applied. Total rules applied 2148 place count 1089 transition count 4506
Drop transitions (Redundant composition of simpler transitions.) removed 807 transitions
Redundant transition composition rules discarded 807 transitions
Iterating global reduction 3 with 807 rules applied. Total rules applied 2955 place count 1089 transition count 3699
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2956 place count 1089 transition count 3698
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2957 place count 1088 transition count 3698
Partial Free-agglomeration rule applied 928 times.
Drop transitions (Partial Free agglomeration) removed 928 transitions
Iterating global reduction 4 with 928 rules applied. Total rules applied 3885 place count 1088 transition count 3698
Applied a total of 3885 rules in 856 ms. Remains 1088 /2163 variables (removed 1075) and now considering 3698/5580 (removed 1882) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 857 ms. Remains : 1088/2163 places, 3698/5580 transitions.
RANDOM walk for 40000 steps (276 resets) in 743 ms. (53 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 146913 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :0 out of 8
Probabilistic random walk after 146913 steps, saw 31002 distinct states, run finished after 3008 ms. (steps per millisecond=48 ) 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-4737662949018026578.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2972471209366071991.kers'
[2026-05-25 00:54:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4737662949018026578.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2972471209366071991.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 3698 rows 1088 cols 7695 entries
Finished phase 1 with 1026 SingleSign rule and 30 generalized
[2026-05-25 00:54:00] [INFO ] Computed 32 invariants in 28 ms
Computed 32 P flows in 28 ms.
Exported basis to /tmp/petrispot-output-2972471209366071991.kers
Total runtime 35 ms.
[2026-05-25 00:54:00] [INFO ] State equation strengthened by 3559 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 1019/1028 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1028 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1028 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1028 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 56/1084 variables, 28/58 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1084 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 2/1086 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1086 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1086 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 3698/4784 variables, 1086/1148 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4784 variables, 3559/4707 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/4784 variables, 0/4707 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 2/4786 variables, 2/4709 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4786 variables, 0/4709 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 0/4786 variables, 0/4709 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4786/4786 variables, and 4709 constraints, problems are : Problem set: 0 solved, 8 unsolved in 12294 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1088/1088 constraints, ReadFeed: 3559/3559 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 1019/1028 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1028 variables, 28/30 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1028 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 56/1084 variables, 28/58 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1084 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 2/1086 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1086 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1086 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1086 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 3698/4784 variables, 1086/1149 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4784 variables, 3559/4708 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4784 variables, 8/4716 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4784 variables, 0/4716 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
SMT process timed out in 57403ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 2385 ms.
Support contains 9 out of 1088 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1088/1088 places, 3698/3698 transitions.
Applied a total of 0 rules in 74 ms. Remains 1088 /1088 variables (removed 0) and now considering 3698/3698 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 1088/1088 places, 3698/3698 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1088/1088 places, 3698/3698 transitions.
Applied a total of 0 rules in 71 ms. Remains 1088 /1088 variables (removed 0) and now considering 3698/3698 (removed 0) transitions.
[2026-05-25 00:55:00] [INFO ] Invariant cache hit.
[2026-05-25 00:55:01] [INFO ] Implicit Places using invariants in 891 ms returned []
[2026-05-25 00:55:01] [INFO ] Invariant cache hit.
[2026-05-25 00:55:02] [INFO ] State equation strengthened by 3559 read => feed constraints.
[2026-05-25 00:55:32] [INFO ] Performed 413/1088 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-05-25 00:56:02] [INFO ] Performed 857/1088 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-05-25 00:56:19] [INFO ] Implicit Places using invariants and state equation in 77871 ms returned []
Implicit Place search using SMT with State Equation took 78767 ms to find 0 implicit places.
[2026-05-25 00:56:19] [INFO ] Redundant transitions in 293 ms returned []
Running 3668 sub problems to find dead transitions.
[2026-05-25 00:56:19] [INFO ] Invariant cache hit.
[2026-05-25 00:56:19] [INFO ] State equation strengthened by 3559 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1087 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3668 unsolved
SMT process timed out in 31632ms, After SMT, problems are : Problem set: 0 solved, 3668 unsolved
Search for dead transitions found 0 dead transitions in 31645ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110800 ms. Remains : 1088/1088 places, 3698/3698 transitions.
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 4 atomic propositions for a total of 13 simplifications.
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 122 stabilizing places and 210 stable transitions
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-08 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((p0 U X(X((p1&&X(X(X(F(p2))))))))))'
Support contains 5 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 52 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3543252659079075177.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9496126842051816002.kers'
[2026-05-25 00:56:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3543252659079075177.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9496126842051816002.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 5580 rows 2163 cols 11400 entries
Finished phase 1 with 2101 SingleSign rule and 30 generalized
[2026-05-25 00:56:52] [INFO ] Computed 32 invariants in 102 ms
Computed 32 P flows in 103 ms.
Exported basis to /tmp/petrispot-output-9496126842051816002.kers
Total runtime 107 ms.
[2026-05-25 00:56:53] [INFO ] Implicit Places using invariants in 1042 ms returned []
[2026-05-25 00:56:53] [INFO ] Invariant cache hit.
[2026-05-25 00:56:54] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2026-05-25 00:57:11] [INFO ] Implicit Places using invariants and state equation in 18762 ms returned []
Implicit Place search using SMT with State Equation took 19806 ms to find 0 implicit places.
Running 5550 sub problems to find dead transitions.
[2026-05-25 00:57:11] [INFO ] Invariant cache hit.
[2026-05-25 00:57:11] [INFO ] State equation strengthened by 1770 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/2162 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 5550 unsolved
SMT process timed out in 32774ms, After SMT, problems are : Problem set: 0 solved, 5550 unsolved
Search for dead transitions found 0 dead transitions in 32785ms
Finished structural reductions in LTL mode , in 1 iterations and 52666 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X(X((p1&&X(X(X(F(p2))))))))))'
Stuttering acceptance computed with spot in 542 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2), (NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLCardinality-02
Stuttering criterion allowed to conclude after 732 steps with 0 reset in 14 ms.
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLCardinality-02 finished in 53437 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||(p1&&X(X(X(p0)))))))))'
Support contains 4 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 52 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2026-05-25 00:57:45] [INFO ] Invariant cache hit.
[2026-05-25 00:57:46] [INFO ] Implicit Places using invariants in 887 ms returned []
[2026-05-25 00:57:46] [INFO ] Invariant cache hit.
[2026-05-25 00:57:47] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2026-05-25 00:58:05] [INFO ] Implicit Places using invariants and state equation in 18808 ms returned []
Implicit Place search using SMT with State Equation took 19708 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 19761 ms. Remains : 2163/2163 places, 5580/5580 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||(p1&&X(X(X(p0)))))))))'
Stuttering acceptance computed with spot in 279 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 41318 steps with 58 reset in 266 ms.
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLCardinality-04 finished in 20368 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((p0 U p1)||G(p2)))))'
Support contains 4 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 51 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2026-05-25 00:58:05] [INFO ] Invariant cache hit.
[2026-05-25 00:58:06] [INFO ] Implicit Places using invariants in 928 ms returned []
[2026-05-25 00:58:06] [INFO ] Invariant cache hit.
[2026-05-25 00:58:08] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2026-05-25 00:58:24] [INFO ] Implicit Places using invariants and state equation in 18187 ms returned []
Implicit Place search using SMT with State Equation took 19119 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 19173 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((p0 U p1)||G(p2)))))'
Stuttering acceptance computed with spot in 227 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLCardinality-05
Stuttering criterion allowed to conclude after 708 steps with 0 reset in 5 ms.
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLCardinality-05 finished in 19458 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||G(p1)) U ((F(G(p0)) U p2)&&F(p3))))'
Support contains 6 out of 2163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 209 transitions
Trivial Post-agglo rules discarded 209 transitions
Performed 209 trivial Post agglomeration. Transition count delta: 209
Iterating post reduction 0 with 209 rules applied. Total rules applied 209 place count 2163 transition count 5371
Reduce places removed 209 places and 0 transitions.
Iterating post reduction 1 with 209 rules applied. Total rules applied 418 place count 1954 transition count 5371
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 418 place count 1954 transition count 5370
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 420 place count 1953 transition count 5370
Performed 866 Post agglomeration using F-continuation condition.Transition count delta: 866
Deduced a syphon composed of 866 places in 1 ms
Reduce places removed 866 places and 0 transitions.
Iterating global reduction 2 with 1732 rules applied. Total rules applied 2152 place count 1087 transition count 4504
Drop transitions (Redundant composition of simpler transitions.) removed 809 transitions
Redundant transition composition rules discarded 809 transitions
Iterating global reduction 2 with 809 rules applied. Total rules applied 2961 place count 1087 transition count 3695
Applied a total of 2961 rules in 490 ms. Remains 1087 /2163 variables (removed 1076) and now considering 3695/5580 (removed 1885) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1091740047763941267.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10936157342672583127.kers'
[2026-05-25 00:58:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1091740047763941267.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10936157342672583127.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 3695 rows 1087 cols 7601 entries
Finished phase 1 with 1025 SingleSign rule and 30 generalized
[2026-05-25 00:58:25] [INFO ] Computed 32 invariants in 40 ms
Computed 32 P flows in 41 ms.
Exported basis to /tmp/petrispot-output-10936157342672583127.kers
Total runtime 43 ms.
[2026-05-25 00:58:26] [INFO ] Implicit Places using invariants in 649 ms returned []
[2026-05-25 00:58:26] [INFO ] Invariant cache hit.
[2026-05-25 00:58:27] [INFO ] State equation strengthened by 2664 read => feed constraints.
[2026-05-25 00:58:37] [INFO ] Implicit Places using invariants and state equation in 11116 ms returned []
Implicit Place search using SMT with State Equation took 11768 ms to find 0 implicit places.
[2026-05-25 00:58:37] [INFO ] Redundant transitions in 176 ms returned []
Running 3665 sub problems to find dead transitions.
[2026-05-25 00:58:37] [INFO ] Invariant cache hit.
[2026-05-25 00:58:37] [INFO ] State equation strengthened by 2664 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1086 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3665 unsolved
SMT process timed out in 31516ms, After SMT, problems are : Problem set: 0 solved, 3665 unsolved
Search for dead transitions found 0 dead transitions in 31523ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1087/2163 places, 3695/5580 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 43974 ms. Remains : 1087/2163 places, 3695/5580 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||G(p1)) U ((F(G(p0)) U p2)&&F(p3))))'
Stuttering acceptance computed with spot in 312 ms :[(OR (NOT p2) (NOT p3)), (NOT p0), (NOT p2), (NOT p3), (AND (NOT p0) (NOT p1)), (AND p0 (NOT p2) (NOT p1)), (OR (NOT p2) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLCardinality-07
Stuttering criterion allowed to conclude after 21435 steps with 261 reset in 185 ms.
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLCardinality-07 finished in 44549 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X((F((!(p0 U p1)&&!p0))&&G(p2))))))'
Support contains 4 out of 2163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 2163 transition count 5370
Reduce places removed 210 places and 0 transitions.
Iterating post reduction 1 with 210 rules applied. Total rules applied 420 place count 1953 transition count 5370
Performed 867 Post agglomeration using F-continuation condition.Transition count delta: 867
Deduced a syphon composed of 867 places in 1 ms
Reduce places removed 867 places and 0 transitions.
Iterating global reduction 2 with 1734 rules applied. Total rules applied 2154 place count 1086 transition count 4503
Drop transitions (Redundant composition of simpler transitions.) removed 809 transitions
Redundant transition composition rules discarded 809 transitions
Iterating global reduction 2 with 809 rules applied. Total rules applied 2963 place count 1086 transition count 3694
Applied a total of 2963 rules in 314 ms. Remains 1086 /2163 variables (removed 1077) and now considering 3694/5580 (removed 1886) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4245830851863428957.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18097572889215978558.kers'
[2026-05-25 00:59:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4245830851863428957.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18097572889215978558.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 3694 rows 1086 cols 7598 entries
Finished phase 1 with 1024 SingleSign rule and 30 generalized
[2026-05-25 00:59:10] [INFO ] Computed 32 invariants in 28 ms
Computed 32 P flows in 29 ms.
Exported basis to /tmp/petrispot-output-18097572889215978558.kers
Total runtime 31 ms.
[2026-05-25 00:59:10] [INFO ] Implicit Places using invariants in 575 ms returned []
[2026-05-25 00:59:10] [INFO ] Invariant cache hit.
[2026-05-25 00:59:11] [INFO ] State equation strengthened by 2665 read => feed constraints.
[2026-05-25 00:59:22] [INFO ] Implicit Places using invariants and state equation in 11921 ms returned []
Implicit Place search using SMT with State Equation took 12499 ms to find 0 implicit places.
[2026-05-25 00:59:22] [INFO ] Redundant transitions in 277 ms returned []
Running 3664 sub problems to find dead transitions.
[2026-05-25 00:59:22] [INFO ] Invariant cache hit.
[2026-05-25 00:59:22] [INFO ] State equation strengthened by 2665 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1085 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3664 unsolved
SMT process timed out in 31479ms, After SMT, problems are : Problem set: 0 solved, 3664 unsolved
Search for dead transitions found 0 dead transitions in 31485ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1086/2163 places, 3694/5580 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44592 ms. Remains : 1086/2163 places, 3694/5580 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(X((F((!(p0 U p1)&&!p0))&&G(p2))))))'
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p2) p1 p0), (OR p1 p0), (NOT p2)]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLCardinality-09
Stuttering criterion allowed to conclude after 133 steps with 0 reset in 3 ms.
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLCardinality-09 finished in 44804 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((p0 U (G(p0)||(X(p2)&&p1)))))'
Support contains 3 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 56 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5181795962214251314.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6620177136724882518.kers'
[2026-05-25 00:59:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5181795962214251314.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6620177136724882518.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 5580 rows 2163 cols 11400 entries
Finished phase 1 with 2101 SingleSign rule and 30 generalized
[2026-05-25 00:59:54] [INFO ] Computed 32 invariants in 62 ms
Computed 32 P flows in 62 ms.
Exported basis to /tmp/petrispot-output-6620177136724882518.kers
Total runtime 67 ms.
[2026-05-25 00:59:55] [INFO ] Implicit Places using invariants in 971 ms returned []
[2026-05-25 00:59:55] [INFO ] Invariant cache hit.
[2026-05-25 00:59:56] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2026-05-25 01:00:14] [INFO ] Implicit Places using invariants and state equation in 19020 ms returned []
Implicit Place search using SMT with State Equation took 19994 ms to find 0 implicit places.
Running 5550 sub problems to find dead transitions.
[2026-05-25 01:00:14] [INFO ] Invariant cache hit.
[2026-05-25 01:00:14] [INFO ] State equation strengthened by 1770 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/2162 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 5550 unsolved
SMT process timed out in 32807ms, After SMT, problems are : Problem set: 0 solved, 5550 unsolved
Search for dead transitions found 0 dead transitions in 32816ms
Finished structural reductions in LTL mode , in 1 iterations and 52889 ms. Remains : 2163/2163 places, 5580/5580 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((p0 U (G(p0)||(X(p2)&&p1)))))'
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLCardinality-10
Product exploration explored 100000 steps with 33333 reset in 708 ms.
Product exploration explored 100000 steps with 33333 reset in 743 ms.
Computed a total of 122 stabilizing places and 210 stable transitions
Computed a total of 122 stabilizing places and 210 stable transitions
Knowledge based reduction with 18 factoid took 85 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 40000 steps (52 resets) in 419 ms. (95 steps per ms) remains 5/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 230 ms. (173 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 41 ms. (952 steps per ms) remains 5/5 properties
[2026-05-25 01:00:49] [INFO ] Invariant cache hit.
[2026-05-25 01:00:49] [INFO ] State equation strengthened by 1770 read => feed constraints.
Problem apf6 is UNSAT
Problem apf8 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 2098/2101 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2101 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2101 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 58/2159 variables, 29/31 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2159 variables, 0/31 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/2161 variables, 2/33 constraints. Problems are: Problem set: 2 solved, 3 unsolved
SMT process timed out in 5138ms, After SMT, problems are : Problem set: 2 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 2163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 2163 transition count 5370
Reduce places removed 210 places and 0 transitions.
Iterating post reduction 1 with 210 rules applied. Total rules applied 420 place count 1953 transition count 5370
Performed 868 Post agglomeration using F-continuation condition.Transition count delta: 868
Deduced a syphon composed of 868 places in 1 ms
Reduce places removed 868 places and 0 transitions.
Iterating global reduction 2 with 1736 rules applied. Total rules applied 2156 place count 1085 transition count 4502
Drop transitions (Redundant composition of simpler transitions.) removed 810 transitions
Redundant transition composition rules discarded 810 transitions
Iterating global reduction 2 with 810 rules applied. Total rules applied 2966 place count 1085 transition count 3692
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2967 place count 1085 transition count 3691
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2968 place count 1084 transition count 3691
Partial Free-agglomeration rule applied 930 times.
Drop transitions (Partial Free agglomeration) removed 930 transitions
Iterating global reduction 3 with 930 rules applied. Total rules applied 3898 place count 1084 transition count 3691
Applied a total of 3898 rules in 444 ms. Remains 1084 /2163 variables (removed 1079) and now considering 3691/5580 (removed 1889) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 445 ms. Remains : 1084/2163 places, 3691/5580 transitions.
RANDOM walk for 40000 steps (283 resets) in 573 ms. (69 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 64 ms. (615 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 166704 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :0 out of 3
Probabilistic random walk after 166704 steps, saw 31440 distinct states, run finished after 3001 ms. (steps per millisecond=55 ) 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-4306468304311330392.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14083129744019470352.kers'
[2026-05-25 01:00:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4306468304311330392.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14083129744019470352.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 3691 rows 1084 cols 7650 entries
Finished phase 1 with 1022 SingleSign rule and 30 generalized
[2026-05-25 01:00:58] [INFO ] Computed 32 invariants in 23 ms
Computed 32 P flows in 24 ms.
Exported basis to /tmp/petrispot-output-14083129744019470352.kers
Total runtime 26 ms.
[2026-05-25 01:00:58] [INFO ] State equation strengthened by 3595 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1019/1022 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1022 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1022 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 58/1080 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1080 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/1082 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1082 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1082 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 3691/4773 variables, 1082/1117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4773 variables, 3595/4712 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4773 variables, 0/4712 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/4775 variables, 2/4714 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4775 variables, 0/4714 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/4775 variables, 0/4714 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4775/4775 variables, and 4714 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4767 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1084/1084 constraints, ReadFeed: 3595/3595 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1019/1022 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1022 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1022 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 58/1080 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1080 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/1082 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1082 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1082 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1082 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1082 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 3691/4773 variables, 1082/1144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4773 variables, 3595/4739 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4773 variables, 3/4742 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4773 variables, 0/4742 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 2/4775 variables, 2/4744 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4775 variables, 0/4744 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/4775 variables, 0/4744 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4775/4775 variables, and 4744 constraints, problems are : Problem set: 0 solved, 3 unsolved in 16826 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1084/1084 constraints, ReadFeed: 3595/3595 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21643ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 301 ms.
Support contains 3 out of 1084 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1084/1084 places, 3691/3691 transitions.
Applied a total of 0 rules in 57 ms. Remains 1084 /1084 variables (removed 0) and now considering 3691/3691 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 1084/1084 places, 3691/3691 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1084/1084 places, 3691/3691 transitions.
Applied a total of 0 rules in 58 ms. Remains 1084 /1084 variables (removed 0) and now considering 3691/3691 (removed 0) transitions.
[2026-05-25 01:01:20] [INFO ] Invariant cache hit.
[2026-05-25 01:01:21] [INFO ] Implicit Places using invariants in 906 ms returned []
[2026-05-25 01:01:21] [INFO ] Invariant cache hit.
[2026-05-25 01:01:21] [INFO ] State equation strengthened by 3595 read => feed constraints.
[2026-05-25 01:01:52] [INFO ] Performed 271/1084 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-05-25 01:02:22] [INFO ] Performed 497/1084 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-05-25 01:02:52] [INFO ] Performed 701/1084 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2026-05-25 01:03:22] [INFO ] Performed 881/1084 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2026-05-25 01:03:22] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2026-05-25 01:03:22] [INFO ] Implicit Places using invariants and state equation in 121354 ms returned []
Implicit Place search using SMT with State Equation took 122265 ms to find 0 implicit places.
[2026-05-25 01:03:22] [INFO ] Redundant transitions in 124 ms returned []
Running 3661 sub problems to find dead transitions.
[2026-05-25 01:03:22] [INFO ] Invariant cache hit.
[2026-05-25 01:03:22] [INFO ] State equation strengthened by 3595 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1083 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3661 unsolved
SMT process timed out in 31480ms, After SMT, problems are : Problem set: 0 solved, 3661 unsolved
Search for dead transitions found 0 dead transitions in 31488ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 153957 ms. Remains : 1084/1084 places, 3691/3691 transitions.
Found 2 invariant AP formulas.
Knowledge based reduction with 20 factoid took 139 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Knowledge-based reduction took 185520 ms.
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 54 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14084859274793551389.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14367863447354309892.kers'
[2026-05-25 01:03:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14084859274793551389.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14367863447354309892.kers]
Culled 0 columns in 4 ms.
// Phase 1: matrix 5580 rows 2163 cols 11400 entries
Finished phase 1 with 2101 SingleSign rule and 30 generalized
[2026-05-25 01:03:54] [INFO ] Computed 32 invariants in 69 ms
Computed 32 P flows in 69 ms.
Exported basis to /tmp/petrispot-output-14367863447354309892.kers
Total runtime 75 ms.
[2026-05-25 01:03:55] [INFO ] Implicit Places using invariants in 974 ms returned []
[2026-05-25 01:03:55] [INFO ] Invariant cache hit.
[2026-05-25 01:03:57] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2026-05-25 01:04:15] [INFO ] Implicit Places using invariants and state equation in 19440 ms returned []
Implicit Place search using SMT with State Equation took 20416 ms to find 0 implicit places.
Running 5550 sub problems to find dead transitions.
[2026-05-25 01:04:15] [INFO ] Invariant cache hit.
[2026-05-25 01:04:15] [INFO ] State equation strengthened by 1770 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2162 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 5550 unsolved
SMT process timed out in 32586ms, After SMT, problems are : Problem set: 0 solved, 5550 unsolved
Search for dead transitions found 0 dead transitions in 32595ms
Finished structural reductions in LTL mode , in 1 iterations and 53084 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Computed a total of 122 stabilizing places and 210 stable transitions
Computed a total of 122 stabilizing places and 210 stable transitions
Knowledge based reduction with 13 factoid took 66 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (55 resets) in 388 ms. (102 steps per ms) remains 3/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 3/3 properties
[2026-05-25 01:04:48] [INFO ] Invariant cache hit.
[2026-05-25 01:04:48] [INFO ] State equation strengthened by 1770 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 2098/2101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2101 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 58/2159 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2159 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/2161 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SMT process timed out in 6081ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 2163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 2163 transition count 5370
Reduce places removed 210 places and 0 transitions.
Iterating post reduction 1 with 210 rules applied. Total rules applied 420 place count 1953 transition count 5370
Performed 868 Post agglomeration using F-continuation condition.Transition count delta: 868
Deduced a syphon composed of 868 places in 1 ms
Reduce places removed 868 places and 0 transitions.
Iterating global reduction 2 with 1736 rules applied. Total rules applied 2156 place count 1085 transition count 4502
Drop transitions (Redundant composition of simpler transitions.) removed 810 transitions
Redundant transition composition rules discarded 810 transitions
Iterating global reduction 2 with 810 rules applied. Total rules applied 2966 place count 1085 transition count 3692
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2967 place count 1085 transition count 3691
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2968 place count 1084 transition count 3691
Partial Free-agglomeration rule applied 930 times.
Drop transitions (Partial Free agglomeration) removed 930 transitions
Iterating global reduction 3 with 930 rules applied. Total rules applied 3898 place count 1084 transition count 3691
Applied a total of 3898 rules in 396 ms. Remains 1084 /2163 variables (removed 1079) and now considering 3691/5580 (removed 1889) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 397 ms. Remains : 1084/2163 places, 3691/5580 transitions.
RANDOM walk for 40000 steps (285 resets) in 492 ms. (81 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 166938 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :0 out of 3
Probabilistic random walk after 166938 steps, saw 31460 distinct states, run finished after 3002 ms. (steps per millisecond=55 ) 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-9935183573304826189.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16386279131628990719.kers'
[2026-05-25 01:04:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9935183573304826189.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16386279131628990719.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 3691 rows 1084 cols 7650 entries
Finished phase 1 with 1022 SingleSign rule and 30 generalized
[2026-05-25 01:04:57] [INFO ] Computed 32 invariants in 27 ms
Computed 32 P flows in 28 ms.
Exported basis to /tmp/petrispot-output-16386279131628990719.kers
Total runtime 35 ms.
[2026-05-25 01:04:57] [INFO ] State equation strengthened by 3595 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1019/1022 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1022 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1022 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 58/1080 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1080 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/1082 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1082 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1082 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 3691/4773 variables, 1082/1118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4773 variables, 3595/4713 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4773 variables, 0/4713 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/4775 variables, 2/4715 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4775 variables, 0/4715 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/4775 variables, 0/4715 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4775/4775 variables, and 4715 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5069 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1084/1084 constraints, ReadFeed: 3595/3595 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1019/1022 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1022 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1022 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 58/1080 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1080 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/1082 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1082 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1082 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1082 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 3691/4773 variables, 1082/1120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4773 variables, 3595/4715 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4773 variables, 3/4718 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4773 variables, 0/4718 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 2/4775 variables, 2/4720 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4775 variables, 0/4720 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/4775 variables, 0/4720 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4775/4775 variables, and 4720 constraints, problems are : Problem set: 0 solved, 3 unsolved in 11066 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1084/1084 constraints, ReadFeed: 3595/3595 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16200ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1148 ms.
Support contains 3 out of 1084 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1084/1084 places, 3691/3691 transitions.
Applied a total of 0 rules in 54 ms. Remains 1084 /1084 variables (removed 0) and now considering 3691/3691 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 1084/1084 places, 3691/3691 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1084/1084 places, 3691/3691 transitions.
Applied a total of 0 rules in 55 ms. Remains 1084 /1084 variables (removed 0) and now considering 3691/3691 (removed 0) transitions.
[2026-05-25 01:05:15] [INFO ] Invariant cache hit.
[2026-05-25 01:05:16] [INFO ] Implicit Places using invariants in 878 ms returned []
[2026-05-25 01:05:16] [INFO ] Invariant cache hit.
[2026-05-25 01:05:16] [INFO ] State equation strengthened by 3595 read => feed constraints.
[2026-05-25 01:05:47] [INFO ] Performed 269/1084 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-05-25 01:06:17] [INFO ] Performed 498/1084 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-05-25 01:06:47] [INFO ] Performed 701/1084 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2026-05-25 01:07:17] [INFO ] Performed 880/1084 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2026-05-25 01:07:17] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2026-05-25 01:07:17] [INFO ] Implicit Places using invariants and state equation in 121197 ms returned []
Implicit Place search using SMT with State Equation took 122079 ms to find 0 implicit places.
[2026-05-25 01:07:17] [INFO ] Redundant transitions in 123 ms returned []
Running 3661 sub problems to find dead transitions.
[2026-05-25 01:07:17] [INFO ] Invariant cache hit.
[2026-05-25 01:07:17] [INFO ] State equation strengthened by 3595 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1083 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3661 unsolved
SMT process timed out in 31673ms, After SMT, problems are : Problem set: 0 solved, 3661 unsolved
Search for dead transitions found 0 dead transitions in 31681ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 153955 ms. Remains : 1084/1084 places, 3691/3691 transitions.
Knowledge based reduction with 13 factoid took 152 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Knowledge-based reduction took 181625 ms.
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 33333 reset in 611 ms.
Product exploration explored 100000 steps with 33333 reset in 643 ms.
Spot run failed in 428 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/ltsmin7376634388786034401
[2026-05-25 01:07:51] [INFO ] Built C files in 82ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7376634388786034401
Running compilation step : cd /tmp/ltsmin7376634388786034401;'/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/ltsmin7376634388786034401;'/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/ltsmin7376634388786034401;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 3 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 50 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-89813396713921229.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14770714872711062129.kers'
[2026-05-25 01:07:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-89813396713921229.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14770714872711062129.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 5580 rows 2163 cols 11400 entries
Finished phase 1 with 2101 SingleSign rule and 30 generalized
[2026-05-25 01:07:54] [INFO ] Computed 32 invariants in 68 ms
Computed 32 P flows in 68 ms.
Exported basis to /tmp/petrispot-output-14770714872711062129.kers
Total runtime 76 ms.
[2026-05-25 01:07:55] [INFO ] Implicit Places using invariants in 995 ms returned []
[2026-05-25 01:07:55] [INFO ] Invariant cache hit.
[2026-05-25 01:07:56] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2026-05-25 01:08:15] [INFO ] Implicit Places using invariants and state equation in 19658 ms returned []
Implicit Place search using SMT with State Equation took 20655 ms to find 0 implicit places.
Running 5550 sub problems to find dead transitions.
[2026-05-25 01:08:15] [INFO ] Invariant cache hit.
[2026-05-25 01:08:15] [INFO ] State equation strengthened by 1770 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2162 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 5550 unsolved
SMT process timed out in 32576ms, After SMT, problems are : Problem set: 0 solved, 5550 unsolved
Search for dead transitions found 0 dead transitions in 32597ms
Finished structural reductions in LTL mode , in 1 iterations and 53322 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Built C files in :
/tmp/ltsmin3763069374939544138
[2026-05-25 01:08:47] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3763069374939544138
Running compilation step : cd /tmp/ltsmin3763069374939544138;'/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/ltsmin3763069374939544138;'/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/ltsmin3763069374939544138;'/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-25 01:08:51] [INFO ] Flatten gal took : 91 ms
[2026-05-25 01:08:51] [INFO ] Flatten gal took : 78 ms
[2026-05-25 01:08:51] [INFO ] Time to serialize gal into /tmp/LTL15031218651961514287.gal : 34 ms
[2026-05-25 01:08:51] [INFO ] Time to serialize properties into /tmp/LTL10803087050197574953.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15031218651961514287.gal' '-t' 'CGAL' '-hoa' '/tmp/aut337791402578857330.hoa' '-atoms' '/tmp/LTL10803087050197574953.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL10803087050197574953.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut337791402578857330.hoa
Detected timeout of ITS tools.
[2026-05-25 01:09:06] [INFO ] Flatten gal took : 75 ms
[2026-05-25 01:09:06] [INFO ] Flatten gal took : 77 ms
[2026-05-25 01:09:06] [INFO ] Time to serialize gal into /tmp/LTL4909014422392900302.gal : 21 ms
[2026-05-25 01:09:06] [INFO ] Time to serialize properties into /tmp/LTL7763832659091120286.ltl : 5 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/LTL4909014422392900302.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7763832659091120286.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(("(Node0requestsent2<3)")U((G("(Node0requestsent2<3)"))||(("((Node15GiveAnswer5<1)&&(Node0requestsent2<3))")&&(X("(Node27GiveAnsw...170
Formula 0 simplified : X(!"(Node0requestsent2<3)" M (!"((Node15GiveAnswer5<1)&&(Node0requestsent2<3))" | X!"(Node27GiveAnswer21<1)"))
Detected timeout of ITS tools.
[2026-05-25 01:09:21] [INFO ] Flatten gal took : 65 ms
[2026-05-25 01:09:21] [INFO ] Applying decomposition
[2026-05-25 01:09:21] [INFO ] Flatten gal took : 73 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/graph16734847874222250463.txt' '-o' '/tmp/graph16734847874222250463.bin' '-w' '/tmp/graph16734847874222250463.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16734847874222250463.bin' '-l' '-1' '-v' '-w' '/tmp/graph16734847874222250463.weights' '-q' '0' '-e' '0.001'
[2026-05-25 01:09:22] [INFO ] Decomposing Gal with order
[2026-05-25 01:09:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 01:09:22] [INFO ] Removed a total of 2710 redundant transitions.
[2026-05-25 01:09:22] [INFO ] Flatten gal took : 551 ms
[2026-05-25 01:09:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 2670 labels/synchronizations in 218 ms.
[2026-05-25 01:09:23] [INFO ] Time to serialize gal into /tmp/LTL14039605240769979990.gal : 38 ms
[2026-05-25 01:09:23] [INFO ] Time to serialize properties into /tmp/LTL10926954066762134806.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/LTL14039605240769979990.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10926954066762134806.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...256
Read 1 LTL properties
Checking formula 0 : !((X(("(u3.Node0requestsent2<3)")U((G("(u3.Node0requestsent2<3)"))||(("((u23.Node15GiveAnswer5<1)&&(u3.Node0requestsent2<3))")&&(X("(i...191
Formula 0 simplified : X(!"(u3.Node0requestsent2<3)" M (!"((u23.Node15GiveAnswer5<1)&&(u3.Node0requestsent2<3))" | X!"(i36.u87.Node27GiveAnswer21<1)"))
Detected timeout of ITS tools.
Treatment of property CANInsertWithFailure-PT-030-LTLCardinality-10 finished in 583751 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((!p0&&X((!p0 U (X(p1)||G(!p0)))))))))'
Support contains 3 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 53 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2026-05-25 01:09:38] [INFO ] Invariant cache hit.
[2026-05-25 01:09:39] [INFO ] Implicit Places using invariants in 925 ms returned []
[2026-05-25 01:09:39] [INFO ] Invariant cache hit.
[2026-05-25 01:09:40] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2026-05-25 01:09:57] [INFO ] Implicit Places using invariants and state equation in 18688 ms returned []
Implicit Place search using SMT with State Equation took 19619 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 19672 ms. Remains : 2163/2163 places, 5580/5580 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((!p0&&X((!p0 U (X(p1)||G(!p0)))))))))'
Stuttering acceptance computed with spot in 291 ms :[true, (NOT p0), p0, p0, true, (AND (NOT p1) p0), (NOT p1), (AND p0 (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLCardinality-11
Stuttering criterion allowed to conclude after 1847 steps with 2 reset in 12 ms.
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLCardinality-11 finished in 20041 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 2163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 2163 transition count 5370
Reduce places removed 210 places and 0 transitions.
Iterating post reduction 1 with 210 rules applied. Total rules applied 420 place count 1953 transition count 5370
Performed 869 Post agglomeration using F-continuation condition.Transition count delta: 869
Deduced a syphon composed of 869 places in 1 ms
Reduce places removed 869 places and 0 transitions.
Iterating global reduction 2 with 1738 rules applied. Total rules applied 2158 place count 1084 transition count 4501
Drop transitions (Redundant composition of simpler transitions.) removed 811 transitions
Redundant transition composition rules discarded 811 transitions
Iterating global reduction 2 with 811 rules applied. Total rules applied 2969 place count 1084 transition count 3690
Applied a total of 2969 rules in 282 ms. Remains 1084 /2163 variables (removed 1079) and now considering 3690/5580 (removed 1890) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9697882252443837954.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3640355283395241479.kers'
[2026-05-25 01:09:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9697882252443837954.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3640355283395241479.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 3690 rows 1084 cols 7590 entries
Finished phase 1 with 1022 SingleSign rule and 30 generalized
[2026-05-25 01:09:58] [INFO ] Computed 32 invariants in 29 ms
Computed 32 P flows in 30 ms.
Exported basis to /tmp/petrispot-output-3640355283395241479.kers
Total runtime 35 ms.
[2026-05-25 01:09:59] [INFO ] Implicit Places using invariants in 556 ms returned []
[2026-05-25 01:09:59] [INFO ] Invariant cache hit.
[2026-05-25 01:09:59] [INFO ] State equation strengthened by 2667 read => feed constraints.
[2026-05-25 01:10:10] [INFO ] Implicit Places using invariants and state equation in 11002 ms returned []
Implicit Place search using SMT with State Equation took 11560 ms to find 0 implicit places.
[2026-05-25 01:10:10] [INFO ] Redundant transitions in 138 ms returned []
Running 3660 sub problems to find dead transitions.
[2026-05-25 01:10:10] [INFO ] Invariant cache hit.
[2026-05-25 01:10:10] [INFO ] State equation strengthened by 2667 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1083 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3660 unsolved
SMT process timed out in 31455ms, After SMT, problems are : Problem set: 0 solved, 3660 unsolved
Search for dead transitions found 0 dead transitions in 31462ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1084/2163 places, 3690/5580 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 43455 ms. Remains : 1084/2163 places, 3690/5580 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 93 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLCardinality-12
Stuttering criterion allowed to conclude after 152 steps with 0 reset in 4 ms.
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLCardinality-12 finished in 43599 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||(F(G(p1)) U (p0 U p2)))&&((F(G(p1)) U (p0 U p2))||G(p3))))))'
Support contains 5 out of 2163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 208 transitions
Trivial Post-agglo rules discarded 208 transitions
Performed 208 trivial Post agglomeration. Transition count delta: 208
Iterating post reduction 0 with 208 rules applied. Total rules applied 208 place count 2163 transition count 5372
Reduce places removed 208 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 209 rules applied. Total rules applied 417 place count 1955 transition count 5371
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 418 place count 1954 transition count 5371
Performed 867 Post agglomeration using F-continuation condition.Transition count delta: 867
Deduced a syphon composed of 867 places in 1 ms
Reduce places removed 867 places and 0 transitions.
Iterating global reduction 3 with 1734 rules applied. Total rules applied 2152 place count 1087 transition count 4504
Drop transitions (Redundant composition of simpler transitions.) removed 810 transitions
Redundant transition composition rules discarded 810 transitions
Iterating global reduction 3 with 810 rules applied. Total rules applied 2962 place count 1087 transition count 3694
Applied a total of 2962 rules in 299 ms. Remains 1087 /2163 variables (removed 1076) and now considering 3694/5580 (removed 1886) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7716174495963893455.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11501684427771518509.kers'
[2026-05-25 01:10:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7716174495963893455.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11501684427771518509.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 3694 rows 1087 cols 7599 entries
Finished phase 1 with 1025 SingleSign rule and 30 generalized
[2026-05-25 01:10:42] [INFO ] Computed 32 invariants in 29 ms
Computed 32 P flows in 29 ms.
Exported basis to /tmp/petrispot-output-11501684427771518509.kers
Total runtime 34 ms.
[2026-05-25 01:10:42] [INFO ] Implicit Places using invariants in 580 ms returned []
[2026-05-25 01:10:42] [INFO ] Invariant cache hit.
[2026-05-25 01:10:43] [INFO ] State equation strengthened by 2665 read => feed constraints.
[2026-05-25 01:10:55] [INFO ] Implicit Places using invariants and state equation in 12653 ms returned []
Implicit Place search using SMT with State Equation took 13237 ms to find 0 implicit places.
[2026-05-25 01:10:55] [INFO ] Redundant transitions in 139 ms returned []
Running 3664 sub problems to find dead transitions.
[2026-05-25 01:10:55] [INFO ] Invariant cache hit.
[2026-05-25 01:10:55] [INFO ] State equation strengthened by 2665 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1086 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3664 unsolved
SMT process timed out in 31406ms, After SMT, problems are : Problem set: 0 solved, 3664 unsolved
Search for dead transitions found 0 dead transitions in 31413ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1087/2163 places, 3694/5580 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 45104 ms. Remains : 1087/2163 places, 3694/5580 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||(F(G(p1)) U (p0 U p2)))&&((F(G(p1)) U (p0 U p2))||G(p3))))))'
Stuttering acceptance computed with spot in 336 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLCardinality-14
Stuttering criterion allowed to conclude after 3305 steps with 21 reset in 31 ms.
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLCardinality-14 finished in 45538 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 2163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 2163 transition count 5370
Reduce places removed 210 places and 0 transitions.
Iterating post reduction 1 with 210 rules applied. Total rules applied 420 place count 1953 transition count 5370
Performed 869 Post agglomeration using F-continuation condition.Transition count delta: 869
Deduced a syphon composed of 869 places in 2 ms
Reduce places removed 869 places and 0 transitions.
Iterating global reduction 2 with 1738 rules applied. Total rules applied 2158 place count 1084 transition count 4501
Drop transitions (Redundant composition of simpler transitions.) removed 811 transitions
Redundant transition composition rules discarded 811 transitions
Iterating global reduction 2 with 811 rules applied. Total rules applied 2969 place count 1084 transition count 3690
Applied a total of 2969 rules in 305 ms. Remains 1084 /2163 variables (removed 1079) and now considering 3690/5580 (removed 1890) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13786684157790846316.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9757268065008816798.kers'
[2026-05-25 01:11:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13786684157790846316.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9757268065008816798.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 3690 rows 1084 cols 7590 entries
Finished phase 1 with 1022 SingleSign rule and 30 generalized
[2026-05-25 01:11:27] [INFO ] Computed 32 invariants in 31 ms
Computed 32 P flows in 31 ms.
Exported basis to /tmp/petrispot-output-9757268065008816798.kers
Total runtime 35 ms.
[2026-05-25 01:11:28] [INFO ] Implicit Places using invariants in 586 ms returned []
[2026-05-25 01:11:28] [INFO ] Invariant cache hit.
[2026-05-25 01:11:29] [INFO ] State equation strengthened by 2667 read => feed constraints.
[2026-05-25 01:11:39] [INFO ] Implicit Places using invariants and state equation in 10801 ms returned []
Implicit Place search using SMT with State Equation took 11390 ms to find 0 implicit places.
[2026-05-25 01:11:39] [INFO ] Redundant transitions in 132 ms returned []
Running 3660 sub problems to find dead transitions.
[2026-05-25 01:11:39] [INFO ] Invariant cache hit.
[2026-05-25 01:11:39] [INFO ] State equation strengthened by 2667 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1083 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3660 unsolved
SMT process timed out in 31379ms, After SMT, problems are : Problem set: 0 solved, 3660 unsolved
Search for dead transitions found 0 dead transitions in 31388ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1084/2163 places, 3690/5580 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 43234 ms. Remains : 1084/2163 places, 3690/5580 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 61 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLCardinality-15
Stuttering criterion allowed to conclude after 153 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLCardinality-15 finished in 43334 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((p0 U (G(p0)||(X(p2)&&p1)))))'
Spot run failed in 57 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-25 01:12:10] [INFO ] Flatten gal took : 69 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9115272388214682401
[2026-05-25 01:12:10] [INFO ] Too many transitions (5580) to apply POR reductions. Disabling POR matrices.
[2026-05-25 01:12:10] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9115272388214682401
Running compilation step : cd /tmp/ltsmin9115272388214682401;'/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-25 01:12:10] [INFO ] Applying decomposition
[2026-05-25 01:12:11] [INFO ] Flatten gal took : 102 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/graph5671560970794423735.txt' '-o' '/tmp/graph5671560970794423735.bin' '-w' '/tmp/graph5671560970794423735.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5671560970794423735.bin' '-l' '-1' '-v' '-w' '/tmp/graph5671560970794423735.weights' '-q' '0' '-e' '0.001'
[2026-05-25 01:12:11] [INFO ] Decomposing Gal with order
[2026-05-25 01:12:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 01:12:12] [INFO ] Removed a total of 2708 redundant transitions.
[2026-05-25 01:12:12] [INFO ] Flatten gal took : 554 ms
[2026-05-25 01:12:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 2787 labels/synchronizations in 219 ms.
[2026-05-25 01:12:12] [INFO ] Time to serialize gal into /tmp/LTLCardinality8526205395494515202.gal : 64 ms
[2026-05-25 01:12:12] [INFO ] Time to serialize properties into /tmp/LTLCardinality8418767420969188833.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/LTLCardinality8526205395494515202.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8418767420969188833.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 : !((X(("(u3.Node0requestsent2<3)")U((G("(u3.Node0requestsent2<3)"))||(("((u23.Node15GiveAnswer5<1)&&(u3.Node0requestsent2<3))")&&(X("(i...191
Formula 0 simplified : X(!"(u3.Node0requestsent2<3)" M (!"((u23.Node15GiveAnswer5<1)&&(u3.Node0requestsent2<3))" | X!"(i35.u85.Node27GiveAnswer21<1)"))
Compilation finished in 18007 ms.
Running link step : cd /tmp/ltsmin9115272388214682401;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 81 ms.
Running LTSmin : cd /tmp/ltsmin9115272388214682401;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(((LTLAPp0==true) U ([]((LTLAPp0==true))||(X((LTLAPp2==true))&&(LTLAPp1==true)))))' '--buchi-type=spotba'
LTSmin run took 1172 ms.
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1194902 ms.
BK_STOP 1779671550327
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANInsertWithFailure-PT-030"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is CANInsertWithFailure-PT-030, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r034-tall-177946842100723"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-030.tgz
mv CANInsertWithFailure-PT-030 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;