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-177946842100708.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-010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946842100708
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 9.2K Mar 6 10:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Mar 6 10:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 6 10:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Mar 6 10:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Mar 15 07:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 07:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 15 07:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Mar 6 10:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Mar 6 10:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 6 10:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Mar 6 10:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 15 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 15 07:53 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 698K 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-010-LTLFireability-00
FORMULA_NAME CANInsertWithFailure-PT-010-LTLFireability-01
FORMULA_NAME CANInsertWithFailure-PT-010-LTLFireability-02
FORMULA_NAME CANInsertWithFailure-PT-010-LTLFireability-03
FORMULA_NAME CANInsertWithFailure-PT-010-LTLFireability-04
FORMULA_NAME CANInsertWithFailure-PT-010-LTLFireability-05
FORMULA_NAME CANInsertWithFailure-PT-010-LTLFireability-06
FORMULA_NAME CANInsertWithFailure-PT-010-LTLFireability-07
FORMULA_NAME CANInsertWithFailure-PT-010-LTLFireability-08
FORMULA_NAME CANInsertWithFailure-PT-010-LTLFireability-09
FORMULA_NAME CANInsertWithFailure-PT-010-LTLFireability-10
FORMULA_NAME CANInsertWithFailure-PT-010-LTLFireability-11
FORMULA_NAME CANInsertWithFailure-PT-010-LTLFireability-12
FORMULA_NAME CANInsertWithFailure-PT-010-LTLFireability-13
FORMULA_NAME CANInsertWithFailure-PT-010-LTLFireability-14
FORMULA_NAME CANInsertWithFailure-PT-010-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779663123050

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-010
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-24 22:52:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 22:52:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 22:52:04] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2026-05-24 22:52:04] [INFO ] Transformed 324 places.
[2026-05-24 22:52:04] [INFO ] Transformed 660 transitions.
[2026-05-24 22:52:04] [INFO ] Parsed PT model containing 324 places and 660 transitions and 1800 arcs in 198 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Support contains 51 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 660/660 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 323 transition count 660
Applied a total of 1 rules in 34 ms. Remains 323 /324 variables (removed 1) and now considering 660/660 (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-15857560454707537874.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1637173820753680547.kers'
[2026-05-24 22:52:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15857560454707537874.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1637173820753680547.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 660 rows 323 cols 1400 entries
Finished phase 1 with 301 SingleSign rule and 10 generalized
[2026-05-24 22:52:04] [INFO ] Computed 12 invariants in 2 ms
Computed 12 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-1637173820753680547.kers
Total runtime 3 ms.
[2026-05-24 22:52:04] [INFO ] Implicit Places using invariants in 270 ms returned []
[2026-05-24 22:52:04] [INFO ] Invariant cache hit.
[2026-05-24 22:52:05] [INFO ] State equation strengthened by 190 read => feed constraints.
[2026-05-24 22:52:05] [INFO ] Implicit Places using invariants and state equation in 494 ms returned []
Implicit Place search using SMT with State Equation took 798 ms to find 0 implicit places.
Running 650 sub problems to find dead transitions.
[2026-05-24 22:52:05] [INFO ] Invariant cache hit.
[2026-05-24 22:52:05] [INFO ] State equation strengthened by 190 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 322/983 variables, and 51 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/323 constraints, ReadFeed: 0/190 constraints, PredecessorRefiner: 650/650 constraints, Known Traps: 39/39 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 650 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 39/51 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 7/98 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 322/983 variables, and 99 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/323 constraints, ReadFeed: 0/190 constraints, PredecessorRefiner: 0/650 constraints, Known Traps: 87/87 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60189ms problems are : Problem set: 0 solved, 650 unsolved
Search for dead transitions found 0 dead transitions in 60204ms
Starting structural reductions in LTL mode, iteration 1 : 323/324 places, 660/660 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61077 ms. Remains : 323/324 places, 660/660 transitions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 13 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
[2026-05-24 22:53:05] [INFO ] Invariant cache hit.
[2026-05-24 22:53:05] [INFO ] Implicit Places using invariants in 84 ms returned []
[2026-05-24 22:53:05] [INFO ] Invariant cache hit.
[2026-05-24 22:53:05] [INFO ] State equation strengthened by 190 read => feed constraints.
[2026-05-24 22:53:06] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 539 ms. Remains : 323/323 places, 660/660 transitions.
Support contains 51 out of 323 places after structural reductions.
[2026-05-24 22:53:06] [INFO ] Flatten gal took : 57 ms
[2026-05-24 22:53:06] [INFO ] Flatten gal took : 27 ms
[2026-05-24 22:53:06] [INFO ] Input system was already deterministic with 660 transitions.
Support contains 50 out of 323 places (down from 51) after GAL structural reductions.
RANDOM walk for 40000 steps (176 resets) in 1662 ms. (24 steps per ms) remains 3/39 properties
BEST_FIRST walk for 40003 steps (21 resets) in 154 ms. (258 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (23 resets) in 85 ms. (465 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (20 resets) in 85 ms. (465 steps per ms) remains 2/3 properties
[2026-05-24 22:53:07] [INFO ] Invariant cache hit.
[2026-05-24 22:53:07] [INFO ] State equation strengthened by 190 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 300/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 14/319 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/321 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 660/981 variables, 321/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/981 variables, 190/534 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/981 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/983 variables, 2/536 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/983 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/983 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 983/983 variables, and 536 constraints, problems are : Problem set: 0 solved, 2 unsolved in 997 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 323/323 constraints, ReadFeed: 190/190 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 300/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 14/319 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/321 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/321 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/321 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 660/981 variables, 321/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/981 variables, 190/539 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/981 variables, 2/541 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/981 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/983 variables, 2/543 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/983 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/983 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 983/983 variables, and 543 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1314 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 323/323 constraints, ReadFeed: 190/190 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2318ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 195 ms.
Support contains 5 out of 323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 323/323 places, 660/660 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 67 place count 323 transition count 593
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 1 with 67 rules applied. Total rules applied 134 place count 256 transition count 593
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 310 place count 168 transition count 505
Drop transitions (Redundant composition of simpler transitions.) removed 70 transitions
Redundant transition composition rules discarded 70 transitions
Iterating global reduction 2 with 70 rules applied. Total rules applied 380 place count 168 transition count 435
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 383 place count 168 transition count 432
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 386 place count 165 transition count 432
Partial Free-agglomeration rule applied 110 times.
Drop transitions (Partial Free agglomeration) removed 110 transitions
Iterating global reduction 3 with 110 rules applied. Total rules applied 496 place count 165 transition count 432
Applied a total of 496 rules in 81 ms. Remains 165 /323 variables (removed 158) and now considering 432/660 (removed 228) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 165/323 places, 432/660 transitions.
RANDOM walk for 40000 steps (802 resets) in 479 ms. (83 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (78 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (68 resets) in 70 ms. (563 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1083044 steps, run timeout after 3001 ms. (steps per millisecond=360 ) properties seen :0 out of 2
Probabilistic random walk after 1083044 steps, saw 141381 distinct states, run finished after 3005 ms. (steps per millisecond=360 ) 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-16721817506192149643.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7554350648351938355.kers'
[2026-05-24 22:53:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16721817506192149643.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7554350648351938355.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 432 rows 165 cols 952 entries
Finished phase 1 with 143 SingleSign rule and 10 generalized
[2026-05-24 22:53:12] [INFO ] Computed 12 invariants in 2 ms
Computed 12 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7554350648351938355.kers
Total runtime 2 ms.
[2026-05-24 22:53:12] [INFO ] State equation strengthened by 395 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 142/147 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 14/161 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/163 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 432/595 variables, 163/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/595 variables, 395/572 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/595 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/597 variables, 2/574 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/597 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/597 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 597/597 variables, and 574 constraints, problems are : Problem set: 0 solved, 2 unsolved in 471 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 165/165 constraints, ReadFeed: 395/395 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 142/147 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 14/161 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/163 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 432/595 variables, 163/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/595 variables, 395/572 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/595 variables, 2/574 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/595 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/597 variables, 2/576 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/597 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/597 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 597/597 variables, and 576 constraints, problems are : Problem set: 0 solved, 2 unsolved in 479 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 165/165 constraints, ReadFeed: 395/395 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 964ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 28 ms.
Support contains 5 out of 165 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 165/165 places, 432/432 transitions.
Applied a total of 0 rules in 9 ms. Remains 165 /165 variables (removed 0) and now considering 432/432 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 165/165 places, 432/432 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 165/165 places, 432/432 transitions.
Applied a total of 0 rules in 9 ms. Remains 165 /165 variables (removed 0) and now considering 432/432 (removed 0) transitions.
[2026-05-24 22:53:13] [INFO ] Invariant cache hit.
[2026-05-24 22:53:14] [INFO ] Implicit Places using invariants in 218 ms returned []
[2026-05-24 22:53:14] [INFO ] Invariant cache hit.
[2026-05-24 22:53:14] [INFO ] State equation strengthened by 395 read => feed constraints.
[2026-05-24 22:53:15] [INFO ] Implicit Places using invariants and state equation in 1330 ms returned []
Implicit Place search using SMT with State Equation took 1551 ms to find 0 implicit places.
[2026-05-24 22:53:15] [INFO ] Redundant transitions in 39 ms returned []
Running 422 sub problems to find dead transitions.
[2026-05-24 22:53:15] [INFO ] Invariant cache hit.
[2026-05-24 22:53:15] [INFO ] State equation strengthened by 395 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 19/91 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 8 (OVERLAPS) 432/596 variables, 164/261 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/596 variables, 395/656 constraints. Problems are: Problem set: 0 solved, 422 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 596/597 variables, and 656 constraints, problems are : Problem set: 0 solved, 422 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 164/165 constraints, ReadFeed: 395/395 constraints, PredecessorRefiner: 422/422 constraints, Known Traps: 85/85 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 422 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 85/97 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 4 (OVERLAPS) 432/596 variables, 164/261 constraints. Problems are: Problem set: 0 solved, 422 unsolved
Problem TDEAD144 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD431 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/596 variables, 395/656 constraints. Problems are: Problem set: 12 solved, 410 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/596 variables, 410/1066 constraints. Problems are: Problem set: 12 solved, 410 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 596/597 variables, and 1066 constraints, problems are : Problem set: 12 solved, 410 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 164/165 constraints, ReadFeed: 395/395 constraints, PredecessorRefiner: 410/422 constraints, Known Traps: 85/85 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60096ms problems are : Problem set: 12 solved, 410 unsolved
Search for dead transitions found 12 dead transitions in 60098ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 165/165 places, 420/432 transitions.
Graph (complete) has 728 edges and 165 vertex of which 163 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 9 place count 155 transition count 404
Iterating global reduction 0 with 8 rules applied. Total rules applied 17 place count 155 transition count 404
Applied a total of 17 rules in 18 ms. Remains 155 /165 variables (removed 10) and now considering 404/420 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14570893859785932517.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1110500578021714022.kers'
[2026-05-24 22:54:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14570893859785932517.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1110500578021714022.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 404 rows 155 cols 854 entries
Finished phase 1 with 142 SingleSign rule and 1 generalized
[2026-05-24 22:54:15] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1110500578021714022.kers
Total runtime 1 ms.
[2026-05-24 22:54:15] [INFO ] Implicit Places using invariants in 231 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 234 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 154/165 places, 404/432 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 153 transition count 411
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 153 transition count 403
Applied a total of 10 rules in 52 ms. Remains 153 /154 variables (removed 1) and now considering 403/404 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10237441569068576422.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12708007536866927562.kers'
[2026-05-24 22:54:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10237441569068576422.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12708007536866927562.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 403 rows 153 cols 858 entries
Finished phase 1 with 142 SingleSign rule and 0 generalized
[2026-05-24 22:54:15] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12708007536866927562.kers
Total runtime 1 ms.
[2026-05-24 22:54:16] [INFO ] Implicit Places using invariants in 339 ms returned []
[2026-05-24 22:54:16] [INFO ] Invariant cache hit.
[2026-05-24 22:54:16] [INFO ] State equation strengthened by 366 read => feed constraints.
[2026-05-24 22:54:19] [INFO ] Implicit Places using invariants and state equation in 3714 ms returned [55]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 4059 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 152/165 places, 403/432 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 150 transition count 401
Applied a total of 4 rules in 18 ms. Remains 150 /152 variables (removed 2) and now considering 401/403 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3294456451714578821.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17047823673460390336.kers'
[2026-05-24 22:54:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3294456451714578821.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17047823673460390336.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 401 rows 150 cols 858 entries
Finished phase 1 with 139 SingleSign rule and 1 generalized
[2026-05-24 22:54:20] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17047823673460390336.kers
Total runtime 3 ms.
[2026-05-24 22:54:20] [INFO ] Implicit Places using invariants in 296 ms returned []
[2026-05-24 22:54:20] [INFO ] Invariant cache hit.
[2026-05-24 22:54:20] [INFO ] State equation strengthened by 357 read => feed constraints.
[2026-05-24 22:54:21] [INFO ] Implicit Places using invariants and state equation in 884 ms returned []
Implicit Place search using SMT with State Equation took 1183 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 150/165 places, 401/432 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 67274 ms. Remains : 150/165 places, 401/432 transitions.
RANDOM walk for 40000 steps (896 resets) in 185 ms. (215 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (85 resets) in 50 ms. (784 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (80 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1284637 steps, run timeout after 3001 ms. (steps per millisecond=428 ) properties seen :0 out of 2
Probabilistic random walk after 1284637 steps, saw 156900 distinct states, run finished after 3001 ms. (steps per millisecond=428 ) properties seen :0
[2026-05-24 22:54:24] [INFO ] Invariant cache hit.
[2026-05-24 22:54:24] [INFO ] State equation strengthened by 357 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 19/29 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 13/42 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/42 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 77/119 variables, 42/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/119 variables, 42/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/119 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 310/429 variables, 34/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/429 variables, 267/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/429 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 122/551 variables, 74/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/551 variables, 48/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/551 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/551 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 519 constraints, problems are : Problem set: 0 solved, 2 unsolved in 312 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 150/150 constraints, ReadFeed: 357/357 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 19/29 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 13/42 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/42 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 77/119 variables, 42/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/119 variables, 42/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/119 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 310/429 variables, 34/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/429 variables, 267/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/429 variables, 2/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/429 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 122/551 variables, 74/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/551 variables, 48/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/551 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/551 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 551/551 variables, and 521 constraints, problems are : Problem set: 0 solved, 2 unsolved in 433 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 150/150 constraints, ReadFeed: 357/357 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 749ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 71 ms.
Support contains 5 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 401/401 transitions.
Applied a total of 0 rules in 8 ms. Remains 150 /150 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 150/150 places, 401/401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 401/401 transitions.
Applied a total of 0 rules in 7 ms. Remains 150 /150 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2026-05-24 22:54:25] [INFO ] Invariant cache hit.
[2026-05-24 22:54:25] [INFO ] Implicit Places using invariants in 75 ms returned []
[2026-05-24 22:54:25] [INFO ] Invariant cache hit.
[2026-05-24 22:54:25] [INFO ] State equation strengthened by 357 read => feed constraints.
[2026-05-24 22:54:26] [INFO ] Implicit Places using invariants and state equation in 920 ms returned []
Implicit Place search using SMT with State Equation took 998 ms to find 0 implicit places.
[2026-05-24 22:54:26] [INFO ] Redundant transitions in 10 ms returned []
Running 391 sub problems to find dead transitions.
[2026-05-24 22:54:26] [INFO ] Invariant cache hit.
[2026-05-24 22:54:26] [INFO ] State equation strengthened by 357 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (OVERLAPS) 401/550 variables, 149/159 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/550 variables, 357/516 constraints. Problems are: Problem set: 0 solved, 391 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 550/551 variables, and 516 constraints, problems are : Problem set: 0 solved, 391 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 149/150 constraints, ReadFeed: 357/357 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 391 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (OVERLAPS) 401/550 variables, 149/159 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/550 variables, 357/516 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 391/907 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/550 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 7 (OVERLAPS) 1/551 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 391 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/551 variables, and 908 constraints, problems are : Problem set: 0 solved, 391 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 150/150 constraints, ReadFeed: 357/357 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60096ms problems are : Problem set: 0 solved, 391 unsolved
Search for dead transitions found 0 dead transitions in 60097ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61125 ms. Remains : 150/150 places, 401/401 transitions.
FORMULA CANInsertWithFailure-PT-010-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA CANInsertWithFailure-PT-010-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 42 stabilizing places and 70 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((X(p1)&&F(p2)))))'
Support contains 5 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 3 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (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-5269070884855461439.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8039909760890404493.kers'
[2026-05-24 22:55:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5269070884855461439.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8039909760890404493.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 660 rows 323 cols 1400 entries
Finished phase 1 with 301 SingleSign rule and 10 generalized
[2026-05-24 22:55:26] [INFO ] Computed 12 invariants in 5 ms
Computed 12 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-8039909760890404493.kers
Total runtime 7 ms.
[2026-05-24 22:55:26] [INFO ] Implicit Places using invariants in 92 ms returned []
[2026-05-24 22:55:26] [INFO ] Invariant cache hit.
[2026-05-24 22:55:26] [INFO ] State equation strengthened by 190 read => feed constraints.
[2026-05-24 22:55:27] [INFO ] Implicit Places using invariants and state equation in 446 ms returned []
Implicit Place search using SMT with State Equation took 540 ms to find 0 implicit places.
Running 650 sub problems to find dead transitions.
[2026-05-24 22:55:27] [INFO ] Invariant cache hit.
[2026-05-24 22:55:27] [INFO ] State equation strengthened by 190 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 322/983 variables, and 60 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/323 constraints, ReadFeed: 0/190 constraints, PredecessorRefiner: 650/650 constraints, Known Traps: 48/48 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 650 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 48/60 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 16/99 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 322/983 variables, and 99 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/323 constraints, ReadFeed: 0/190 constraints, PredecessorRefiner: 0/650 constraints, Known Traps: 87/87 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60104ms problems are : Problem set: 0 solved, 650 unsolved
Search for dead transitions found 0 dead transitions in 60106ms
Finished structural reductions in LTL mode , in 1 iterations and 60652 ms. Remains : 323/323 places, 660/660 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((X(p1)&&F(p2)))))'
Stuttering acceptance computed with spot in 412 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), true, (NOT p1), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLFireability-00
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA CANInsertWithFailure-PT-010-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-010-LTLFireability-00 finished in 61139 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||(p1 U (G(p1)||(p1&&(p2||X(p3)))))))))'
Support contains 4 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 3 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
[2026-05-24 22:56:27] [INFO ] Invariant cache hit.
[2026-05-24 22:56:27] [INFO ] Implicit Places using invariants in 86 ms returned []
[2026-05-24 22:56:27] [INFO ] Invariant cache hit.
[2026-05-24 22:56:28] [INFO ] State equation strengthened by 190 read => feed constraints.
[2026-05-24 22:56:28] [INFO ] Implicit Places using invariants and state equation in 484 ms returned []
Implicit Place search using SMT with State Equation took 571 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 576 ms. Remains : 323/323 places, 660/660 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 U (G(p0)||(p0&&(p1||X(p2)))))||p3))))'
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLFireability-01
Product exploration explored 100000 steps with 491 reset in 276 ms.
Product exploration explored 100000 steps with 469 reset in 219 ms.
Computed a total of 42 stabilizing places and 70 stable transitions
Computed a total of 42 stabilizing places and 70 stable transitions
Knowledge based reduction with 14 factoid took 57 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter sensitive) to 3 states, 6 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (181 resets) in 194 ms. (205 steps per ms) remains 3/8 properties
BEST_FIRST walk for 40004 steps (22 resets) in 154 ms. (258 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (22 resets) in 84 ms. (470 steps per ms) remains 2/3 properties
[2026-05-24 22:56:29] [INFO ] Invariant cache hit.
[2026-05-24 22:56:29] [INFO ] State equation strengthened by 190 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 299/303 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/303 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/303 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 16/319 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/321 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 660/981 variables, 321/342 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/981 variables, 190/532 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/981 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/983 variables, 2/534 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/983 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/983 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 983/983 variables, and 534 constraints, problems are : Problem set: 0 solved, 2 unsolved in 736 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 323/323 constraints, ReadFeed: 190/190 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 299/303 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/303 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/303 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 16/319 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/321 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 660/981 variables, 321/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/981 variables, 190/534 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/981 variables, 2/536 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/981 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/983 variables, 2/538 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/983 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/983 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 983/983 variables, and 538 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 323/323 constraints, ReadFeed: 190/190 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1766ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 75 ms.
Support contains 4 out of 323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 323/323 places, 660/660 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 68 place count 323 transition count 592
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 136 place count 255 transition count 592
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 0 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 2 with 174 rules applied. Total rules applied 310 place count 168 transition count 505
Drop transitions (Redundant composition of simpler transitions.) removed 69 transitions
Redundant transition composition rules discarded 69 transitions
Iterating global reduction 2 with 69 rules applied. Total rules applied 379 place count 168 transition count 436
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 381 place count 168 transition count 434
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 383 place count 166 transition count 434
Partial Free-agglomeration rule applied 111 times.
Drop transitions (Partial Free agglomeration) removed 111 transitions
Iterating global reduction 3 with 111 rules applied. Total rules applied 494 place count 166 transition count 434
Applied a total of 494 rules in 37 ms. Remains 166 /323 variables (removed 157) and now considering 434/660 (removed 226) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 166/323 places, 434/660 transitions.
RANDOM walk for 40000 steps (796 resets) in 178 ms. (223 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (71 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (75 resets) in 45 ms. (869 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1036387 steps, run timeout after 3002 ms. (steps per millisecond=345 ) properties seen :0 out of 2
Probabilistic random walk after 1036387 steps, saw 133636 distinct states, run finished after 3002 ms. (steps per millisecond=345 ) 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-14969582016537962667.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7513014185098359996.kers'
[2026-05-24 22:56:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14969582016537962667.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7513014185098359996.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 434 rows 166 cols 956 entries
Finished phase 1 with 144 SingleSign rule and 10 generalized
[2026-05-24 22:56:34] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7513014185098359996.kers
Total runtime 2 ms.
[2026-05-24 22:56:34] [INFO ] State equation strengthened by 395 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 142/146 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 16/162 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/164 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 434/598 variables, 164/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/598 variables, 395/580 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/598 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/600 variables, 2/582 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/600 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/600 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 600/600 variables, and 582 constraints, problems are : Problem set: 0 solved, 2 unsolved in 693 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 166/166 constraints, ReadFeed: 395/395 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 142/146 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 16/162 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/164 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 434/598 variables, 164/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/598 variables, 395/580 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/598 variables, 2/582 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/598 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/600 variables, 2/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/600 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/600 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 600/600 variables, and 584 constraints, problems are : Problem set: 0 solved, 2 unsolved in 719 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 166/166 constraints, ReadFeed: 395/395 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1424ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 100 ms.
Support contains 4 out of 166 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 434/434 transitions.
Applied a total of 0 rules in 5 ms. Remains 166 /166 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 166/166 places, 434/434 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 434/434 transitions.
Applied a total of 0 rules in 6 ms. Remains 166 /166 variables (removed 0) and now considering 434/434 (removed 0) transitions.
[2026-05-24 22:56:35] [INFO ] Invariant cache hit.
[2026-05-24 22:56:36] [INFO ] Implicit Places using invariants in 229 ms returned []
[2026-05-24 22:56:36] [INFO ] Invariant cache hit.
[2026-05-24 22:56:36] [INFO ] State equation strengthened by 395 read => feed constraints.
[2026-05-24 22:56:37] [INFO ] Implicit Places using invariants and state equation in 1494 ms returned []
Implicit Place search using SMT with State Equation took 1725 ms to find 0 implicit places.
[2026-05-24 22:56:37] [INFO ] Redundant transitions in 9 ms returned []
Running 424 sub problems to find dead transitions.
[2026-05-24 22:56:37] [INFO ] Invariant cache hit.
[2026-05-24 22:56:37] [INFO ] State equation strengthened by 395 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 14/86 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 4/90 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 4/94 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 165/600 variables, and 94 constraints, problems are : Problem set: 0 solved, 424 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/166 constraints, ReadFeed: 0/395 constraints, PredecessorRefiner: 424/424 constraints, Known Traps: 82/82 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 424 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 82/94 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 5 (OVERLAPS) 434/599 variables, 165/260 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Problem TDEAD148 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD433 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/599 variables, 395/655 constraints. Problems are: Problem set: 12 solved, 412 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/599 variables, 412/1067 constraints. Problems are: Problem set: 12 solved, 412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 599/600 variables, and 1067 constraints, problems are : Problem set: 12 solved, 412 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 165/166 constraints, ReadFeed: 395/395 constraints, PredecessorRefiner: 412/424 constraints, Known Traps: 83/83 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60112ms problems are : Problem set: 12 solved, 412 unsolved
Search for dead transitions found 12 dead transitions in 60113ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 166/166 places, 422/434 transitions.
Graph (complete) has 730 edges and 166 vertex of which 164 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 9 place count 156 transition count 406
Iterating global reduction 0 with 8 rules applied. Total rules applied 17 place count 156 transition count 406
Applied a total of 17 rules in 7 ms. Remains 156 /166 variables (removed 10) and now considering 406/422 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12524545156754447456.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11201904055847624028.kers'
[2026-05-24 22:57:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12524545156754447456.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11201904055847624028.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 406 rows 156 cols 858 entries
Finished phase 1 with 143 SingleSign rule and 1 generalized
[2026-05-24 22:57:37] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11201904055847624028.kers
Total runtime 1 ms.
[2026-05-24 22:57:37] [INFO ] Implicit Places using invariants in 89 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 90 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 155/166 places, 406/434 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 154 transition count 413
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 154 transition count 405
Applied a total of 10 rules in 18 ms. Remains 154 /155 variables (removed 1) and now considering 405/406 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16312589332830832467.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15269882766685282688.kers'
[2026-05-24 22:57:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16312589332830832467.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15269882766685282688.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 405 rows 154 cols 862 entries
Finished phase 1 with 143 SingleSign rule and 0 generalized
[2026-05-24 22:57:37] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15269882766685282688.kers
Total runtime 1 ms.
[2026-05-24 22:57:37] [INFO ] Implicit Places using invariants in 90 ms returned []
[2026-05-24 22:57:37] [INFO ] Invariant cache hit.
[2026-05-24 22:57:37] [INFO ] State equation strengthened by 366 read => feed constraints.
[2026-05-24 22:57:40] [INFO ] Implicit Places using invariants and state equation in 2540 ms returned [55]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2632 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 153/166 places, 405/434 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 151 transition count 403
Applied a total of 4 rules in 15 ms. Remains 151 /153 variables (removed 2) and now considering 403/405 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7249166967979516503.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18139687741205565513.kers'
[2026-05-24 22:57:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7249166967979516503.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18139687741205565513.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 403 rows 151 cols 862 entries
Finished phase 1 with 140 SingleSign rule and 1 generalized
[2026-05-24 22:57:40] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18139687741205565513.kers
Total runtime 2 ms.
[2026-05-24 22:57:40] [INFO ] Implicit Places using invariants in 77 ms returned []
[2026-05-24 22:57:40] [INFO ] Invariant cache hit.
[2026-05-24 22:57:40] [INFO ] State equation strengthened by 357 read => feed constraints.
[2026-05-24 22:57:43] [INFO ] Implicit Places using invariants and state equation in 3104 ms returned []
Implicit Place search using SMT with State Equation took 3187 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 151/166 places, 403/434 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 67823 ms. Remains : 151/166 places, 403/434 transitions.
RANDOM walk for 40000 steps (889 resets) in 175 ms. (227 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (80 resets) in 32 ms. (1212 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (79 resets) in 29 ms. (1333 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1156249 steps, run timeout after 3001 ms. (steps per millisecond=385 ) properties seen :0 out of 2
Probabilistic random walk after 1156249 steps, saw 143998 distinct states, run finished after 3001 ms. (steps per millisecond=385 ) properties seen :0
[2026-05-24 22:57:46] [INFO ] Invariant cache hit.
[2026-05-24 22:57:46] [INFO ] State equation strengthened by 357 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/27 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 15/42 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/42 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 77/119 variables, 42/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/119 variables, 40/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/119 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 322/441 variables, 36/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/441 variables, 277/410 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/441 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 113/554 variables, 73/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/554 variables, 40/523 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/554 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/554 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 554/554 variables, and 523 constraints, problems are : Problem set: 0 solved, 2 unsolved in 350 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, ReadFeed: 357/357 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/27 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 15/42 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/42 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/42 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 77/119 variables, 42/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/119 variables, 40/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/119 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 322/441 variables, 36/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/441 variables, 277/413 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/441 variables, 2/415 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/441 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 113/554 variables, 73/488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/554 variables, 40/528 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/554 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/554 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 554/554 variables, and 528 constraints, problems are : Problem set: 0 solved, 2 unsolved in 472 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, ReadFeed: 357/357 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 829ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 61 ms.
Support contains 4 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 403/403 transitions.
Applied a total of 0 rules in 5 ms. Remains 151 /151 variables (removed 0) and now considering 403/403 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 151/151 places, 403/403 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 403/403 transitions.
Applied a total of 0 rules in 5 ms. Remains 151 /151 variables (removed 0) and now considering 403/403 (removed 0) transitions.
[2026-05-24 22:57:47] [INFO ] Invariant cache hit.
[2026-05-24 22:57:47] [INFO ] Implicit Places using invariants in 75 ms returned []
[2026-05-24 22:57:47] [INFO ] Invariant cache hit.
[2026-05-24 22:57:47] [INFO ] State equation strengthened by 357 read => feed constraints.
[2026-05-24 22:57:50] [INFO ] Implicit Places using invariants and state equation in 3052 ms returned []
Implicit Place search using SMT with State Equation took 3129 ms to find 0 implicit places.
[2026-05-24 22:57:50] [INFO ] Redundant transitions in 7 ms returned []
Running 393 sub problems to find dead transitions.
[2026-05-24 22:57:50] [INFO ] Invariant cache hit.
[2026-05-24 22:57:50] [INFO ] State equation strengthened by 357 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 3 (OVERLAPS) 403/553 variables, 150/160 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/553 variables, 357/517 constraints. Problems are: Problem set: 0 solved, 393 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 553/554 variables, and 517 constraints, problems are : Problem set: 0 solved, 393 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 150/151 constraints, ReadFeed: 357/357 constraints, PredecessorRefiner: 393/393 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 393 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 3 (OVERLAPS) 403/553 variables, 150/160 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/553 variables, 357/517 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 393/910 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/553 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 7 (OVERLAPS) 1/554 variables, 1/911 constraints. Problems are: Problem set: 0 solved, 393 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 554/554 variables, and 911 constraints, problems are : Problem set: 0 solved, 393 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, ReadFeed: 357/357 constraints, PredecessorRefiner: 393/393 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60076ms problems are : Problem set: 0 solved, 393 unsolved
Search for dead transitions found 0 dead transitions in 60077ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63230 ms. Remains : 151/151 places, 403/403 transitions.
Knowledge based reduction with 14 factoid took 129 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter sensitive) to 3 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Knowledge-based reduction took 142042 ms.
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Support contains 4 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 9 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (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-9293438984282167516.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13949123643925491871.kers'
[2026-05-24 22:58:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9293438984282167516.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13949123643925491871.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 660 rows 323 cols 1400 entries
Finished phase 1 with 301 SingleSign rule and 10 generalized
[2026-05-24 22:58:51] [INFO ] Computed 12 invariants in 2 ms
Computed 12 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13949123643925491871.kers
Total runtime 3 ms.
[2026-05-24 22:58:51] [INFO ] Implicit Places using invariants in 90 ms returned []
[2026-05-24 22:58:51] [INFO ] Invariant cache hit.
[2026-05-24 22:58:51] [INFO ] State equation strengthened by 190 read => feed constraints.
[2026-05-24 22:58:51] [INFO ] Implicit Places using invariants and state equation in 490 ms returned []
Implicit Place search using SMT with State Equation took 581 ms to find 0 implicit places.
Running 650 sub problems to find dead transitions.
[2026-05-24 22:58:51] [INFO ] Invariant cache hit.
[2026-05-24 22:58:51] [INFO ] State equation strengthened by 190 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 322/983 variables, and 60 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/323 constraints, ReadFeed: 0/190 constraints, PredecessorRefiner: 650/650 constraints, Known Traps: 48/48 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 650 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 48/60 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 16/99 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 322/983 variables, and 99 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/323 constraints, ReadFeed: 0/190 constraints, PredecessorRefiner: 0/650 constraints, Known Traps: 87/87 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60096ms problems are : Problem set: 0 solved, 650 unsolved
Search for dead transitions found 0 dead transitions in 60099ms
Finished structural reductions in LTL mode , in 1 iterations and 60693 ms. Remains : 323/323 places, 660/660 transitions.
Computed a total of 42 stabilizing places and 70 stable transitions
Computed a total of 42 stabilizing places and 70 stable transitions
Knowledge based reduction with 14 factoid took 54 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter sensitive) to 3 states, 6 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (187 resets) in 279 ms. (142 steps per ms) remains 3/8 properties
BEST_FIRST walk for 40003 steps (21 resets) in 50 ms. (784 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (23 resets) in 34 ms. (1142 steps per ms) remains 2/2 properties
[2026-05-24 22:59:52] [INFO ] Invariant cache hit.
[2026-05-24 22:59:52] [INFO ] State equation strengthened by 190 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 299/303 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/303 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/303 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 16/319 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/321 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 660/981 variables, 321/342 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/981 variables, 190/532 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/981 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/983 variables, 2/534 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/983 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/983 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 983/983 variables, and 534 constraints, problems are : Problem set: 0 solved, 2 unsolved in 708 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 323/323 constraints, ReadFeed: 190/190 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 299/303 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/303 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/303 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 16/319 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/321 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 660/981 variables, 321/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/981 variables, 190/534 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/981 variables, 2/536 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/981 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/983 variables, 2/538 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/983 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/983 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 983/983 variables, and 538 constraints, problems are : Problem set: 0 solved, 2 unsolved in 956 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 323/323 constraints, ReadFeed: 190/190 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1670ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 54 ms.
Support contains 4 out of 323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 323/323 places, 660/660 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 68 place count 323 transition count 592
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 136 place count 255 transition count 592
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 0 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 2 with 174 rules applied. Total rules applied 310 place count 168 transition count 505
Drop transitions (Redundant composition of simpler transitions.) removed 69 transitions
Redundant transition composition rules discarded 69 transitions
Iterating global reduction 2 with 69 rules applied. Total rules applied 379 place count 168 transition count 436
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 381 place count 168 transition count 434
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 383 place count 166 transition count 434
Partial Free-agglomeration rule applied 111 times.
Drop transitions (Partial Free agglomeration) removed 111 transitions
Iterating global reduction 3 with 111 rules applied. Total rules applied 494 place count 166 transition count 434
Applied a total of 494 rules in 30 ms. Remains 166 /323 variables (removed 157) and now considering 434/660 (removed 226) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 166/323 places, 434/660 transitions.
RANDOM walk for 40000 steps (800 resets) in 150 ms. (264 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (77 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (75 resets) in 41 ms. (952 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1080180 steps, run timeout after 3001 ms. (steps per millisecond=359 ) properties seen :0 out of 2
Probabilistic random walk after 1080180 steps, saw 138155 distinct states, run finished after 3001 ms. (steps per millisecond=359 ) 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-3726733844935347158.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3934450922686503216.kers'
[2026-05-24 22:59:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3726733844935347158.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3934450922686503216.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 434 rows 166 cols 956 entries
Finished phase 1 with 144 SingleSign rule and 10 generalized
[2026-05-24 22:59:57] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3934450922686503216.kers
Total runtime 2 ms.
[2026-05-24 22:59:57] [INFO ] State equation strengthened by 395 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 142/146 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 16/162 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/164 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 434/598 variables, 164/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/598 variables, 395/580 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/598 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/600 variables, 2/582 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/600 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/600 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 600/600 variables, and 582 constraints, problems are : Problem set: 0 solved, 2 unsolved in 727 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 166/166 constraints, ReadFeed: 395/395 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 142/146 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 16/162 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/164 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 434/598 variables, 164/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/598 variables, 395/580 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/598 variables, 2/582 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/598 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/600 variables, 2/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/600 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/600 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 600/600 variables, and 584 constraints, problems are : Problem set: 0 solved, 2 unsolved in 736 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 166/166 constraints, ReadFeed: 395/395 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1473ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 83 ms.
Support contains 4 out of 166 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 434/434 transitions.
Applied a total of 0 rules in 8 ms. Remains 166 /166 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 166/166 places, 434/434 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 434/434 transitions.
Applied a total of 0 rules in 5 ms. Remains 166 /166 variables (removed 0) and now considering 434/434 (removed 0) transitions.
[2026-05-24 22:59:58] [INFO ] Invariant cache hit.
[2026-05-24 22:59:58] [INFO ] Implicit Places using invariants in 245 ms returned []
[2026-05-24 22:59:58] [INFO ] Invariant cache hit.
[2026-05-24 22:59:58] [INFO ] State equation strengthened by 395 read => feed constraints.
[2026-05-24 23:00:00] [INFO ] Implicit Places using invariants and state equation in 1590 ms returned []
Implicit Place search using SMT with State Equation took 1838 ms to find 0 implicit places.
[2026-05-24 23:00:00] [INFO ] Redundant transitions in 6 ms returned []
Running 424 sub problems to find dead transitions.
[2026-05-24 23:00:00] [INFO ] Invariant cache hit.
[2026-05-24 23:00:00] [INFO ] State equation strengthened by 395 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 14/86 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 4/90 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 4/94 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 165/600 variables, and 94 constraints, problems are : Problem set: 0 solved, 424 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/166 constraints, ReadFeed: 0/395 constraints, PredecessorRefiner: 424/424 constraints, Known Traps: 82/82 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 424 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 82/94 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 5 (OVERLAPS) 434/599 variables, 165/260 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Problem TDEAD148 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD433 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/599 variables, 395/655 constraints. Problems are: Problem set: 12 solved, 412 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/599 variables, 412/1067 constraints. Problems are: Problem set: 12 solved, 412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 599/600 variables, and 1067 constraints, problems are : Problem set: 12 solved, 412 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 165/166 constraints, ReadFeed: 395/395 constraints, PredecessorRefiner: 412/424 constraints, Known Traps: 83/83 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60072ms problems are : Problem set: 12 solved, 412 unsolved
Search for dead transitions found 12 dead transitions in 60073ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 166/166 places, 422/434 transitions.
Graph (complete) has 730 edges and 166 vertex of which 164 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 9 place count 156 transition count 406
Iterating global reduction 0 with 8 rules applied. Total rules applied 17 place count 156 transition count 406
Applied a total of 17 rules in 7 ms. Remains 156 /166 variables (removed 10) and now considering 406/422 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6077652025847004429.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1364106817567236401.kers'
[2026-05-24 23:01:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6077652025847004429.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1364106817567236401.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 406 rows 156 cols 858 entries
Finished phase 1 with 143 SingleSign rule and 1 generalized
[2026-05-24 23:01:00] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1364106817567236401.kers
Total runtime 3 ms.
[2026-05-24 23:01:00] [INFO ] Implicit Places using invariants in 103 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 104 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 155/166 places, 406/434 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 154 transition count 413
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 154 transition count 405
Applied a total of 10 rules in 14 ms. Remains 154 /155 variables (removed 1) and now considering 405/406 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14689122586840680864.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17125353813139109581.kers'
[2026-05-24 23:01:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14689122586840680864.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17125353813139109581.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 405 rows 154 cols 862 entries
Finished phase 1 with 143 SingleSign rule and 0 generalized
[2026-05-24 23:01:00] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17125353813139109581.kers
Total runtime 2 ms.
[2026-05-24 23:01:00] [INFO ] Implicit Places using invariants in 87 ms returned []
[2026-05-24 23:01:00] [INFO ] Invariant cache hit.
[2026-05-24 23:01:00] [INFO ] State equation strengthened by 366 read => feed constraints.
[2026-05-24 23:01:03] [INFO ] Implicit Places using invariants and state equation in 2553 ms returned [55]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2643 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 153/166 places, 405/434 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 151 transition count 403
Applied a total of 4 rules in 11 ms. Remains 151 /153 variables (removed 2) and now considering 403/405 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10989646547655843345.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11852718623348394664.kers'
[2026-05-24 23:01:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10989646547655843345.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11852718623348394664.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 403 rows 151 cols 862 entries
Finished phase 1 with 140 SingleSign rule and 1 generalized
[2026-05-24 23:01:03] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11852718623348394664.kers
Total runtime 3 ms.
[2026-05-24 23:01:03] [INFO ] Implicit Places using invariants in 87 ms returned []
[2026-05-24 23:01:03] [INFO ] Invariant cache hit.
[2026-05-24 23:01:03] [INFO ] State equation strengthened by 357 read => feed constraints.
[2026-05-24 23:01:06] [INFO ] Implicit Places using invariants and state equation in 3111 ms returned []
Implicit Place search using SMT with State Equation took 3211 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 151/166 places, 403/434 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 67924 ms. Remains : 151/166 places, 403/434 transitions.
RANDOM walk for 40000 steps (895 resets) in 138 ms. (287 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (82 resets) in 35 ms. (1111 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (85 resets) in 31 ms. (1250 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1158441 steps, run timeout after 3001 ms. (steps per millisecond=386 ) properties seen :0 out of 2
Probabilistic random walk after 1158441 steps, saw 144339 distinct states, run finished after 3001 ms. (steps per millisecond=386 ) properties seen :0
[2026-05-24 23:01:09] [INFO ] Invariant cache hit.
[2026-05-24 23:01:09] [INFO ] State equation strengthened by 357 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/27 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 15/42 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/42 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 77/119 variables, 42/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/119 variables, 40/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/119 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 322/441 variables, 36/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/441 variables, 277/410 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/441 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 113/554 variables, 73/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/554 variables, 40/523 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/554 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/554 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 554/554 variables, and 523 constraints, problems are : Problem set: 0 solved, 2 unsolved in 360 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, ReadFeed: 357/357 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/27 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 15/42 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/42 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/42 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 77/119 variables, 42/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/119 variables, 40/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/119 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 322/441 variables, 36/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/441 variables, 277/413 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/441 variables, 2/415 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/441 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 113/554 variables, 73/488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/554 variables, 40/528 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/554 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/554 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 554/554 variables, and 528 constraints, problems are : Problem set: 0 solved, 2 unsolved in 460 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, ReadFeed: 357/357 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 824ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 50 ms.
Support contains 4 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 403/403 transitions.
Applied a total of 0 rules in 5 ms. Remains 151 /151 variables (removed 0) and now considering 403/403 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 151/151 places, 403/403 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 403/403 transitions.
Applied a total of 0 rules in 5 ms. Remains 151 /151 variables (removed 0) and now considering 403/403 (removed 0) transitions.
[2026-05-24 23:01:10] [INFO ] Invariant cache hit.
[2026-05-24 23:01:10] [INFO ] Implicit Places using invariants in 74 ms returned []
[2026-05-24 23:01:10] [INFO ] Invariant cache hit.
[2026-05-24 23:01:10] [INFO ] State equation strengthened by 357 read => feed constraints.
[2026-05-24 23:01:13] [INFO ] Implicit Places using invariants and state equation in 3073 ms returned []
Implicit Place search using SMT with State Equation took 3148 ms to find 0 implicit places.
[2026-05-24 23:01:13] [INFO ] Redundant transitions in 2 ms returned []
Running 393 sub problems to find dead transitions.
[2026-05-24 23:01:13] [INFO ] Invariant cache hit.
[2026-05-24 23:01:13] [INFO ] State equation strengthened by 357 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 3 (OVERLAPS) 403/553 variables, 150/160 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/553 variables, 357/517 constraints. Problems are: Problem set: 0 solved, 393 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 553/554 variables, and 517 constraints, problems are : Problem set: 0 solved, 393 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 150/151 constraints, ReadFeed: 357/357 constraints, PredecessorRefiner: 393/393 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 393 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 3 (OVERLAPS) 403/553 variables, 150/160 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/553 variables, 357/517 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 393/910 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/553 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 393 unsolved
SMT process timed out in 60070ms, After SMT, problems are : Problem set: 0 solved, 393 unsolved
Search for dead transitions found 0 dead transitions in 60073ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63237 ms. Remains : 151/151 places, 403/403 transitions.
Knowledge based reduction with 14 factoid took 130 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter sensitive) to 3 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Knowledge-based reduction took 142029 ms.
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 476 reset in 165 ms.
Product exploration explored 100000 steps with 480 reset in 238 ms.
Spot run failed in 75 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/ltsmin17926003359105079787
[2026-05-24 23:02:14] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17926003359105079787
Running compilation step : cd /tmp/ltsmin17926003359105079787;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1005 ms.
Running link step : cd /tmp/ltsmin17926003359105079787;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin17926003359105079787;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased450897705559155719.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 5 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (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-2957448054605219192.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11646329654139498909.kers'
[2026-05-24 23:02:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2957448054605219192.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11646329654139498909.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 660 rows 323 cols 1400 entries
Finished phase 1 with 301 SingleSign rule and 10 generalized
[2026-05-24 23:02:29] [INFO ] Computed 12 invariants in 5 ms
Computed 12 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-11646329654139498909.kers
Total runtime 6 ms.
[2026-05-24 23:02:29] [INFO ] Implicit Places using invariants in 101 ms returned []
[2026-05-24 23:02:29] [INFO ] Invariant cache hit.
[2026-05-24 23:02:30] [INFO ] State equation strengthened by 190 read => feed constraints.
[2026-05-24 23:02:30] [INFO ] Implicit Places using invariants and state equation in 495 ms returned []
Implicit Place search using SMT with State Equation took 598 ms to find 0 implicit places.
Running 650 sub problems to find dead transitions.
[2026-05-24 23:02:30] [INFO ] Invariant cache hit.
[2026-05-24 23:02:30] [INFO ] State equation strengthened by 190 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 322/983 variables, and 60 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/323 constraints, ReadFeed: 0/190 constraints, PredecessorRefiner: 650/650 constraints, Known Traps: 48/48 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 650 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 48/60 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 16/99 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 322/983 variables, and 99 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/323 constraints, ReadFeed: 0/190 constraints, PredecessorRefiner: 0/650 constraints, Known Traps: 87/87 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60093ms problems are : Problem set: 0 solved, 650 unsolved
Search for dead transitions found 0 dead transitions in 60096ms
Finished structural reductions in LTL mode , in 1 iterations and 60702 ms. Remains : 323/323 places, 660/660 transitions.
Built C files in :
/tmp/ltsmin4129260501225928385
[2026-05-24 23:03:30] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4129260501225928385
Running compilation step : cd /tmp/ltsmin4129260501225928385;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 905 ms.
Running link step : cd /tmp/ltsmin4129260501225928385;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin4129260501225928385;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased11655387956629013719.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-24 23:03:45] [INFO ] Flatten gal took : 25 ms
[2026-05-24 23:03:45] [INFO ] Flatten gal took : 27 ms
[2026-05-24 23:03:45] [INFO ] Time to serialize gal into /tmp/LTL14620808067312480699.gal : 15 ms
[2026-05-24 23:03:45] [INFO ] Time to serialize properties into /tmp/LTL11916370495002779378.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/LTL14620808067312480699.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17971696385038813555.hoa' '-atoms' '/tmp/LTL11916370495002779378.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...320
Loading property file /tmp/LTL11916370495002779378.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17971696385038813555.hoa
Detected timeout of ITS tools.
[2026-05-24 23:04:00] [INFO ] Flatten gal took : 19 ms
[2026-05-24 23:04:00] [INFO ] Flatten gal took : 20 ms
[2026-05-24 23:04:00] [INFO ] Time to serialize gal into /tmp/LTL12696974968706384141.gal : 17 ms
[2026-05-24 23:04:00] [INFO ] Time to serialize properties into /tmp/LTL773724259729694395.ltl : 10 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/LTL12696974968706384141.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL773724259729694395.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 : !((G(F((("(Node3GiveAnswer6<1)")U((G("(Node3GiveAnswer6<1)"))||(("(Node3GiveAnswer6<1)")&&(("(Node2GiveAnswer1<1)")||(X("(Node4GiveAns...221
Formula 0 simplified : FG(!"((Node0ResZone>=1)&&(Node2GiveAnswer1>=1))" & ((!"(Node2GiveAnswer1<1)" & X!"(Node4GiveAnswer3<1)") U !"(Node3GiveAnswer6<1)"))
Detected timeout of ITS tools.
[2026-05-24 23:04:15] [INFO ] Flatten gal took : 20 ms
[2026-05-24 23:04:15] [INFO ] Applying decomposition
[2026-05-24 23:04:15] [INFO ] Flatten gal took : 18 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/graph2613895303740026262.txt' '-o' '/tmp/graph2613895303740026262.bin' '-w' '/tmp/graph2613895303740026262.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2613895303740026262.bin' '-l' '-1' '-v' '-w' '/tmp/graph2613895303740026262.weights' '-q' '0' '-e' '0.001'
[2026-05-24 23:04:15] [INFO ] Decomposing Gal with order
[2026-05-24 23:04:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 23:04:16] [INFO ] Removed a total of 300 redundant transitions.
[2026-05-24 23:04:16] [INFO ] Flatten gal took : 99 ms
[2026-05-24 23:04:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 180 labels/synchronizations in 11 ms.
[2026-05-24 23:04:16] [INFO ] Time to serialize gal into /tmp/LTL13498837332392015263.gal : 6 ms
[2026-05-24 23:04:16] [INFO ] Time to serialize properties into /tmp/LTL5946128875931668894.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/LTL13498837332392015263.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5946128875931668894.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F((("(u26.Node3GiveAnswer6<1)")U((G("(u26.Node3GiveAnswer6<1)"))||(("(u26.Node3GiveAnswer6<1)")&&(("(u6.Node2GiveAnswer1<1)")||(X...249
Formula 0 simplified : FG(!"((i0.u0.Node0ResZone>=1)&&(u6.Node2GiveAnswer1>=1))" & ((!"(u6.Node2GiveAnswer1<1)" & X!"(u13.Node4GiveAnswer3<1)") U !"(u26.No...175
Detected timeout of ITS tools.
Treatment of property CANInsertWithFailure-PT-010-LTLFireability-01 finished in 483307 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)&&F(p1))))'
Support contains 4 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 323 transition count 591
Reduce places removed 69 places and 0 transitions.
Iterating post reduction 1 with 69 rules applied. Total rules applied 138 place count 254 transition count 591
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 314 place count 166 transition count 503
Drop transitions (Redundant composition of simpler transitions.) removed 70 transitions
Redundant transition composition rules discarded 70 transitions
Iterating global reduction 2 with 70 rules applied. Total rules applied 384 place count 166 transition count 433
Applied a total of 384 rules in 35 ms. Remains 166 /323 variables (removed 157) and now considering 433/660 (removed 227) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13446886620481482258.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-343200569409783601.kers'
[2026-05-24 23:04:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13446886620481482258.kers, --Pflows, --basisKERS=/tmp/petrispot-output-343200569409783601.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 433 rows 166 cols 936 entries
Finished phase 1 with 144 SingleSign rule and 10 generalized
[2026-05-24 23:04:31] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-343200569409783601.kers
Total runtime 1 ms.
[2026-05-24 23:04:31] [INFO ] Implicit Places using invariants in 245 ms returned []
[2026-05-24 23:04:31] [INFO ] Invariant cache hit.
[2026-05-24 23:04:31] [INFO ] State equation strengthened by 286 read => feed constraints.
[2026-05-24 23:04:31] [INFO ] Implicit Places using invariants and state equation in 498 ms returned []
Implicit Place search using SMT with State Equation took 745 ms to find 0 implicit places.
[2026-05-24 23:04:31] [INFO ] Redundant transitions in 3 ms returned []
Running 423 sub problems to find dead transitions.
[2026-05-24 23:04:31] [INFO ] Invariant cache hit.
[2026-05-24 23:04:31] [INFO ] State equation strengthened by 286 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 18/90 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 7 (OVERLAPS) 433/598 variables, 165/255 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/598 variables, 286/541 constraints. Problems are: Problem set: 0 solved, 423 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 598/599 variables, and 541 constraints, problems are : Problem set: 0 solved, 423 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 165/166 constraints, ReadFeed: 286/286 constraints, PredecessorRefiner: 423/423 constraints, Known Traps: 78/78 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 423 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 78/90 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 5 (OVERLAPS) 433/598 variables, 165/256 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/598 variables, 286/542 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/598 variables, 423/965 constraints. Problems are: Problem set: 0 solved, 423 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 598/599 variables, and 965 constraints, problems are : Problem set: 0 solved, 423 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 165/166 constraints, ReadFeed: 286/286 constraints, PredecessorRefiner: 423/423 constraints, Known Traps: 79/79 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60069ms problems are : Problem set: 0 solved, 423 unsolved
Search for dead transitions found 0 dead transitions in 60070ms
Starting structural reductions in SI_LTL mode, iteration 1 : 166/323 places, 433/660 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60864 ms. Remains : 166/323 places, 433/660 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)&&F(p1))))'
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLFireability-03
Product exploration explored 100000 steps with 1907 reset in 215 ms.
Stack based approach found an accepted trace after 45283 steps with 850 reset with depth 44 and stack size 44 in 100 ms.
FORMULA CANInsertWithFailure-PT-010-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property CANInsertWithFailure-PT-010-LTLFireability-03 finished in 61331 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&X((p1||X(F((p1&&X(X(F(p2))))))))))))'
Support contains 3 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 5 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (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-7857889147723029200.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6189094081745159859.kers'
[2026-05-24 23:05:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7857889147723029200.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6189094081745159859.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 660 rows 323 cols 1400 entries
Finished phase 1 with 301 SingleSign rule and 10 generalized
[2026-05-24 23:05:32] [INFO ] Computed 12 invariants in 3 ms
Computed 12 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-6189094081745159859.kers
Total runtime 4 ms.
[2026-05-24 23:05:32] [INFO ] Implicit Places using invariants in 110 ms returned []
[2026-05-24 23:05:32] [INFO ] Invariant cache hit.
[2026-05-24 23:05:32] [INFO ] State equation strengthened by 190 read => feed constraints.
[2026-05-24 23:05:33] [INFO ] Implicit Places using invariants and state equation in 513 ms returned []
Implicit Place search using SMT with State Equation took 626 ms to find 0 implicit places.
Running 650 sub problems to find dead transitions.
[2026-05-24 23:05:33] [INFO ] Invariant cache hit.
[2026-05-24 23:05:33] [INFO ] State equation strengthened by 190 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 650 unsolved
SMT process timed out in 30141ms, After SMT, problems are : Problem set: 0 solved, 650 unsolved
Search for dead transitions found 0 dead transitions in 30143ms
Finished structural reductions in LTL mode , in 1 iterations and 30777 ms. Remains : 323/323 places, 660/660 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&X((p1||X(F((p1&&X(X(F(p2))))))))))))'
Stuttering acceptance computed with spot in 262 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p1), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLFireability-04
Stuttering criterion allowed to conclude after 260 steps with 0 reset in 2 ms.
FORMULA CANInsertWithFailure-PT-010-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-010-LTLFireability-04 finished in 31086 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0 U p1) U X(p2)) U X((F(!p2)&&X(G(p0))))))'
Support contains 4 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 6 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
[2026-05-24 23:06:03] [INFO ] Invariant cache hit.
[2026-05-24 23:06:03] [INFO ] Implicit Places using invariants in 98 ms returned []
[2026-05-24 23:06:03] [INFO ] Invariant cache hit.
[2026-05-24 23:06:03] [INFO ] State equation strengthened by 190 read => feed constraints.
[2026-05-24 23:06:04] [INFO ] Implicit Places using invariants and state equation in 495 ms returned []
Implicit Place search using SMT with State Equation took 596 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 602 ms. Remains : 323/323 places, 660/660 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0 U p1) U X(p2)) U X((F(!p2)&&X(G(p0))))))'
Stuttering acceptance computed with spot in 630 ms :[(OR (NOT p0) p2), (AND (NOT p2) (NOT p0)), (OR (NOT p0) p2), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), true, (NOT p0), p2, (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLFireability-05
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-010-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-010-LTLFireability-05 finished in 1298 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F((G(p2)||p1))||p0))))'
Support contains 6 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 5 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
[2026-05-24 23:06:04] [INFO ] Invariant cache hit.
[2026-05-24 23:06:04] [INFO ] Implicit Places using invariants in 79 ms returned []
[2026-05-24 23:06:04] [INFO ] Invariant cache hit.
[2026-05-24 23:06:05] [INFO ] State equation strengthened by 190 read => feed constraints.
[2026-05-24 23:06:05] [INFO ] Implicit Places using invariants and state equation in 568 ms returned []
Implicit Place search using SMT with State Equation took 648 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 655 ms. Remains : 323/323 places, 660/660 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F((G(p2)||p1))||p0))))'
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLFireability-06
Product exploration explored 100000 steps with 33333 reset in 183 ms.
Product exploration explored 100000 steps with 33333 reset in 180 ms.
Computed a total of 42 stabilizing places and 70 stable transitions
Computed a total of 42 stabilizing places and 70 stable transitions
Knowledge based reduction with 4 factoid took 43 ms. Proved property starting from automaton with 4 states, 5 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 50 ms.
FORMULA CANInsertWithFailure-PT-010-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-010-LTLFireability-06 finished in 1247 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (!p1&&X(G(!p2)))))'
Support contains 4 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 2 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
[2026-05-24 23:06:06] [INFO ] Invariant cache hit.
[2026-05-24 23:06:06] [INFO ] Implicit Places using invariants in 87 ms returned []
[2026-05-24 23:06:06] [INFO ] Invariant cache hit.
[2026-05-24 23:06:06] [INFO ] State equation strengthened by 190 read => feed constraints.
[2026-05-24 23:06:06] [INFO ] Implicit Places using invariants and state equation in 512 ms returned []
Implicit Place search using SMT with State Equation took 613 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 615 ms. Remains : 323/323 places, 660/660 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (!p1&&X(G(!p2)))))'
Stuttering acceptance computed with spot in 143 ms :[(OR p2 p1), true, p2, p2]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLFireability-07
Entered a terminal (fully accepting) state of product in 961 steps with 5 reset in 5 ms.
FORMULA CANInsertWithFailure-PT-010-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-010-LTLFireability-07 finished in 790 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0||X(X(X(p0)))))&&X(F(p1)))))'
Support contains 2 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 2 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
[2026-05-24 23:06:06] [INFO ] Invariant cache hit.
[2026-05-24 23:06:07] [INFO ] Implicit Places using invariants in 84 ms returned []
[2026-05-24 23:06:07] [INFO ] Invariant cache hit.
[2026-05-24 23:06:07] [INFO ] State equation strengthened by 190 read => feed constraints.
[2026-05-24 23:06:07] [INFO ] Implicit Places using invariants and state equation in 508 ms returned []
Implicit Place search using SMT with State Equation took 603 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 607 ms. Remains : 323/323 places, 660/660 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0||X(X(X(p0)))))&&X(F(p1)))))'
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLFireability-08
Entered a terminal (fully accepting) state of product in 4726 steps with 38 reset in 13 ms.
FORMULA CANInsertWithFailure-PT-010-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-010-LTLFireability-08 finished in 861 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(((p0||F(p1)) U (G((p0||F(p1)))||(!p1&&(p0||F(p1)))))))))'
Support contains 2 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 5 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
[2026-05-24 23:06:07] [INFO ] Invariant cache hit.
[2026-05-24 23:06:07] [INFO ] Implicit Places using invariants in 95 ms returned []
[2026-05-24 23:06:07] [INFO ] Invariant cache hit.
[2026-05-24 23:06:08] [INFO ] State equation strengthened by 190 read => feed constraints.
[2026-05-24 23:06:08] [INFO ] Implicit Places using invariants and state equation in 501 ms returned []
Implicit Place search using SMT with State Equation took 599 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 604 ms. Remains : 323/323 places, 660/660 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(((p0||F(p1)) U (G((p0||F(p1)))||(!p1&&(p0||F(p1)))))))))'
Stuttering acceptance computed with spot in 207 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLFireability-09
Product exploration explored 100000 steps with 25000 reset in 135 ms.
Product exploration explored 100000 steps with 25000 reset in 152 ms.
Computed a total of 42 stabilizing places and 70 stable transitions
Computed a total of 42 stabilizing places and 70 stable transitions
Knowledge based reduction with 1 factoid took 47 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
RANDOM walk for 6969 steps (31 resets) in 65 ms. (105 steps per ms) remains 0/3 properties
Knowledge based reduction with 1 factoid took 69 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Knowledge-based reduction took 346 ms.
Stuttering acceptance computed with spot in 197 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 7 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
[2026-05-24 23:06:09] [INFO ] Invariant cache hit.
[2026-05-24 23:06:09] [INFO ] Implicit Places using invariants in 90 ms returned []
[2026-05-24 23:06:09] [INFO ] Invariant cache hit.
[2026-05-24 23:06:09] [INFO ] State equation strengthened by 190 read => feed constraints.
[2026-05-24 23:06:10] [INFO ] Implicit Places using invariants and state equation in 474 ms returned []
Implicit Place search using SMT with State Equation took 580 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 588 ms. Remains : 323/323 places, 660/660 transitions.
Computed a total of 42 stabilizing places and 70 stable transitions
Computed a total of 42 stabilizing places and 70 stable transitions
Knowledge based reduction with 1 factoid took 48 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
RANDOM walk for 9764 steps (44 resets) in 51 ms. (187 steps per ms) remains 0/3 properties
Knowledge based reduction with 1 factoid took 77 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Knowledge-based reduction took 355 ms.
Stuttering acceptance computed with spot in 178 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 177 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 25000 reset in 148 ms.
Product exploration explored 100000 steps with 25000 reset in 138 ms.
Spot run failed in 48 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/ltsmin7045637926745631724
[2026-05-24 23:06:11] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7045637926745631724
Running compilation step : cd /tmp/ltsmin7045637926745631724;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 914 ms.
Running link step : cd /tmp/ltsmin7045637926745631724;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin7045637926745631724;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased16786838182266969302.hoa' '--buchi-type=spotba'
LTSmin run took 41 ms.
FORMULA CANInsertWithFailure-PT-010-LTLFireability-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CANInsertWithFailure-PT-010-LTLFireability-09 finished in 4353 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0||X(G(p1))))&&X(X(p2)))))'
Support contains 6 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 8 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
[2026-05-24 23:06:12] [INFO ] Invariant cache hit.
[2026-05-24 23:06:12] [INFO ] Implicit Places using invariants in 86 ms returned []
[2026-05-24 23:06:12] [INFO ] Invariant cache hit.
[2026-05-24 23:06:12] [INFO ] State equation strengthened by 190 read => feed constraints.
[2026-05-24 23:06:12] [INFO ] Implicit Places using invariants and state equation in 485 ms returned []
Implicit Place search using SMT with State Equation took 572 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 582 ms. Remains : 323/323 places, 660/660 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0||X(G(p1))))&&X(X(p2)))))'
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p2), true, (NOT p2)]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLFireability-10
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-010-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-010-LTLFireability-10 finished in 846 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 3 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 68 place count 323 transition count 592
Reduce places removed 68 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 69 rules applied. Total rules applied 137 place count 255 transition count 591
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 138 place count 254 transition count 591
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 138 place count 254 transition count 590
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 140 place count 253 transition count 590
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 300 place count 173 transition count 510
Drop transitions (Redundant composition of simpler transitions.) removed 63 transitions
Redundant transition composition rules discarded 63 transitions
Iterating global reduction 3 with 63 rules applied. Total rules applied 363 place count 173 transition count 447
Partial Post-agglomeration rule applied 16 times.
Drop transitions (Partial Post agglomeration) removed 16 transitions
Iterating global reduction 3 with 16 rules applied. Total rules applied 379 place count 173 transition count 447
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 386 place count 166 transition count 440
Iterating global reduction 3 with 7 rules applied. Total rules applied 393 place count 166 transition count 440
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 401 place count 166 transition count 432
Applied a total of 401 rules in 57 ms. Remains 166 /323 variables (removed 157) and now considering 432/660 (removed 228) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10629247699535951441.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17387524306899457705.kers'
[2026-05-24 23:06:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10629247699535951441.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17387524306899457705.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 432 rows 166 cols 935 entries
Finished phase 1 with 144 SingleSign rule and 10 generalized
[2026-05-24 23:06:13] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17387524306899457705.kers
Total runtime 2 ms.
[2026-05-24 23:06:13] [INFO ] Implicit Places using invariants in 274 ms returned []
[2026-05-24 23:06:13] [INFO ] Invariant cache hit.
[2026-05-24 23:06:13] [INFO ] State equation strengthened by 286 read => feed constraints.
[2026-05-24 23:06:13] [INFO ] Implicit Places using invariants and state equation in 455 ms returned []
Implicit Place search using SMT with State Equation took 731 ms to find 0 implicit places.
[2026-05-24 23:06:13] [INFO ] Redundant transitions in 2 ms returned []
Running 422 sub problems to find dead transitions.
[2026-05-24 23:06:13] [INFO ] Invariant cache hit.
[2026-05-24 23:06:13] [INFO ] State equation strengthened by 286 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 18/90 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 8 (OVERLAPS) 432/597 variables, 165/257 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/597 variables, 286/543 constraints. Problems are: Problem set: 0 solved, 422 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 597/598 variables, and 543 constraints, problems are : Problem set: 0 solved, 422 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 165/166 constraints, ReadFeed: 286/286 constraints, PredecessorRefiner: 422/422 constraints, Known Traps: 80/80 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 422 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 80/92 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 5/99 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 6 (OVERLAPS) 432/597 variables, 165/264 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/597 variables, 286/550 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/597 variables, 422/972 constraints. Problems are: Problem set: 0 solved, 422 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 597/598 variables, and 972 constraints, problems are : Problem set: 0 solved, 422 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 165/166 constraints, ReadFeed: 286/286 constraints, PredecessorRefiner: 422/422 constraints, Known Traps: 87/87 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60077ms problems are : Problem set: 0 solved, 422 unsolved
Search for dead transitions found 0 dead transitions in 60078ms
Starting structural reductions in SI_LTL mode, iteration 1 : 166/323 places, 432/660 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60877 ms. Remains : 166/323 places, 432/660 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 36 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLFireability-11
Stuttering criterion allowed to conclude after 45 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-010-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-010-LTLFireability-11 finished in 60949 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||X(X((p1||X(G(p1))))))&&(X(X((p1||X(G(p1)))))||F(p2))))))'
Support contains 3 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 9 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (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-547924626255434215.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-148047928423935634.kers'
[2026-05-24 23:07:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-547924626255434215.kers, --Pflows, --basisKERS=/tmp/petrispot-output-148047928423935634.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 660 rows 323 cols 1400 entries
Finished phase 1 with 301 SingleSign rule and 10 generalized
[2026-05-24 23:07:13] [INFO ] Computed 12 invariants in 2 ms
Computed 12 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-148047928423935634.kers
Total runtime 4 ms.
[2026-05-24 23:07:14] [INFO ] Implicit Places using invariants in 89 ms returned []
[2026-05-24 23:07:14] [INFO ] Invariant cache hit.
[2026-05-24 23:07:14] [INFO ] State equation strengthened by 190 read => feed constraints.
[2026-05-24 23:07:14] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 569 ms to find 0 implicit places.
Running 650 sub problems to find dead transitions.
[2026-05-24 23:07:14] [INFO ] Invariant cache hit.
[2026-05-24 23:07:14] [INFO ] State equation strengthened by 190 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 322/983 variables, and 60 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/323 constraints, ReadFeed: 0/190 constraints, PredecessorRefiner: 650/650 constraints, Known Traps: 48/48 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 650 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 48/60 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 16/99 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 322/983 variables, and 99 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/323 constraints, ReadFeed: 0/190 constraints, PredecessorRefiner: 0/650 constraints, Known Traps: 87/87 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60084ms problems are : Problem set: 0 solved, 650 unsolved
Search for dead transitions found 0 dead transitions in 60087ms
Finished structural reductions in LTL mode , in 1 iterations and 60674 ms. Remains : 323/323 places, 660/660 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||X(X((p1||X(G(p1))))))&&(X(X((p1||X(G(p1)))))||F(p2))))))'
Stuttering acceptance computed with spot in 414 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLFireability-12
Product exploration explored 100000 steps with 477 reset in 167 ms.
Stack based approach found an accepted trace after 10516 steps with 52 reset with depth 136 and stack size 136 in 18 ms.
FORMULA CANInsertWithFailure-PT-010-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property CANInsertWithFailure-PT-010-LTLFireability-12 finished in 61321 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 323 transition count 591
Reduce places removed 69 places and 0 transitions.
Iterating post reduction 1 with 69 rules applied. Total rules applied 138 place count 254 transition count 591
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 0 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 318 place count 164 transition count 501
Drop transitions (Redundant composition of simpler transitions.) removed 72 transitions
Redundant transition composition rules discarded 72 transitions
Iterating global reduction 2 with 72 rules applied. Total rules applied 390 place count 164 transition count 429
Applied a total of 390 rules in 27 ms. Remains 164 /323 variables (removed 159) and now considering 429/660 (removed 231) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5383299861246942763.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11954875702967943393.kers'
[2026-05-24 23:08:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5383299861246942763.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11954875702967943393.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 429 rows 164 cols 930 entries
Finished phase 1 with 142 SingleSign rule and 10 generalized
[2026-05-24 23:08:15] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11954875702967943393.kers
Total runtime 2 ms.
[2026-05-24 23:08:15] [INFO ] Implicit Places using invariants in 211 ms returned []
[2026-05-24 23:08:15] [INFO ] Invariant cache hit.
[2026-05-24 23:08:15] [INFO ] State equation strengthened by 287 read => feed constraints.
[2026-05-24 23:08:15] [INFO ] Implicit Places using invariants and state equation in 500 ms returned []
Implicit Place search using SMT with State Equation took 713 ms to find 0 implicit places.
[2026-05-24 23:08:16] [INFO ] Redundant transitions in 6 ms returned []
Running 419 sub problems to find dead transitions.
[2026-05-24 23:08:16] [INFO ] Invariant cache hit.
[2026-05-24 23:08:16] [INFO ] State equation strengthened by 287 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 8 (OVERLAPS) 429/592 variables, 163/256 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/592 variables, 287/543 constraints. Problems are: Problem set: 0 solved, 419 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/593 variables, and 543 constraints, problems are : Problem set: 0 solved, 419 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 163/164 constraints, ReadFeed: 287/287 constraints, PredecessorRefiner: 419/419 constraints, Known Traps: 81/81 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 419 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 81/93 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 4/99 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 6 (OVERLAPS) 429/592 variables, 163/262 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/592 variables, 287/549 constraints. Problems are: Problem set: 0 solved, 419 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 592/593 variables, and 968 constraints, problems are : Problem set: 0 solved, 419 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 163/164 constraints, ReadFeed: 287/287 constraints, PredecessorRefiner: 419/419 constraints, Known Traps: 87/87 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60080ms problems are : Problem set: 0 solved, 419 unsolved
Search for dead transitions found 0 dead transitions in 60081ms
Starting structural reductions in SI_LTL mode, iteration 1 : 164/323 places, 429/660 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60833 ms. Remains : 164/323 places, 429/660 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLFireability-14
Stuttering criterion allowed to conclude after 53 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-010-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-010-LTLFireability-14 finished in 60902 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U (p1||G(!p0))) U X(X((F(p2) U X(p0))))))'
Support contains 5 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 5 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (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-14683457856188566657.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5043241686109360383.kers'
[2026-05-24 23:09:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14683457856188566657.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5043241686109360383.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 660 rows 323 cols 1400 entries
Finished phase 1 with 301 SingleSign rule and 10 generalized
[2026-05-24 23:09:16] [INFO ] Computed 12 invariants in 7 ms
Computed 12 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-5043241686109360383.kers
Total runtime 7 ms.
[2026-05-24 23:09:16] [INFO ] Implicit Places using invariants in 98 ms returned []
[2026-05-24 23:09:16] [INFO ] Invariant cache hit.
[2026-05-24 23:09:16] [INFO ] State equation strengthened by 190 read => feed constraints.
[2026-05-24 23:09:16] [INFO ] Implicit Places using invariants and state equation in 458 ms returned []
Implicit Place search using SMT with State Equation took 558 ms to find 0 implicit places.
Running 650 sub problems to find dead transitions.
[2026-05-24 23:09:16] [INFO ] Invariant cache hit.
[2026-05-24 23:09:16] [INFO ] State equation strengthened by 190 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 322/983 variables, and 55 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/323 constraints, ReadFeed: 0/190 constraints, PredecessorRefiner: 650/650 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 650 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 43/55 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 14/89 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 10/99 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 322/983 variables, and 99 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/323 constraints, ReadFeed: 0/190 constraints, PredecessorRefiner: 0/650 constraints, Known Traps: 87/87 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60084ms problems are : Problem set: 0 solved, 650 unsolved
Search for dead transitions found 0 dead transitions in 60086ms
Finished structural reductions in LTL mode , in 1 iterations and 60655 ms. Remains : 323/323 places, 660/660 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U (G(!p0)||p1)) U X(X((F(p2) U X(p0))))))'
Stuttering acceptance computed with spot in 707 ms :[(NOT p0), (NOT p0), false, (NOT p0), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p0)), false, false, (NOT p0), (NOT p0), (NOT p2), false, false, false, (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1) p0)]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLFireability-15
Stuttering criterion allowed to conclude after 310 steps with 2 reset in 2 ms.
FORMULA CANInsertWithFailure-PT-010-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-010-LTLFireability-15 finished in 61412 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||(p1 U (G(p1)||(p1&&(p2||X(p3)))))))))'
Spot run failed in 43 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-24 23:10:17] [INFO ] Flatten gal took : 16 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin845303383257522391
[2026-05-24 23:10:17] [INFO ] Computing symmetric may disable matrix : 660 transitions.
[2026-05-24 23:10:17] [INFO ] Applying decomposition
[2026-05-24 23:10:17] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 23:10:17] [INFO ] Computing symmetric may enable matrix : 660 transitions.
[2026-05-24 23:10:17] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 23:10:17] [INFO ] Flatten gal took : 15 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/graph1724391788911935759.txt' '-o' '/tmp/graph1724391788911935759.bin' '-w' '/tmp/graph1724391788911935759.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1724391788911935759.bin' '-l' '-1' '-v' '-w' '/tmp/graph1724391788911935759.weights' '-q' '0' '-e' '0.001'
[2026-05-24 23:10:17] [INFO ] Decomposing Gal with order
[2026-05-24 23:10:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 23:10:17] [INFO ] Removed a total of 296 redundant transitions.
[2026-05-24 23:10:17] [INFO ] Computing Do-Not-Accords matrix : 660 transitions.
[2026-05-24 23:10:17] [INFO ] Flatten gal took : 37 ms
[2026-05-24 23:10:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 180 labels/synchronizations in 7 ms.
[2026-05-24 23:10:17] [INFO ] Time to serialize gal into /tmp/LTLFireability1305487816866282204.gal : 4 ms
[2026-05-24 23:10:17] [INFO ] Time to serialize properties into /tmp/LTLFireability14177389451824569482.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/LTLFireability1305487816866282204.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14177389451824569482.ltl' '-c' '-stutter-deadlock'
[2026-05-24 23:10:17] [INFO ] Computation of Completed DNA matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 23:10:17] [INFO ] Built C files in 128ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin845303383257522391

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Running compilation step : cd /tmp/ltsmin845303383257522391;'/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'
Checking formula 0 : !((G(F(("((i1.u0.Node0ResZone>=1)&&(u35.Node2GiveAnswer1>=1))")||(("(u23.Node3GiveAnswer6<1)")U((G("(u23.Node3GiveAnswer6<1)"))||(("(u...251
Formula 0 simplified : FG(!"((i1.u0.Node0ResZone>=1)&&(u35.Node2GiveAnswer1>=1))" & ((!"(u35.Node2GiveAnswer1<1)" & X!"(u37.Node4GiveAnswer3<1)") U !"(u23....177
Compilation finished in 1470 ms.
Running link step : cd /tmp/ltsmin845303383257522391;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin845303383257522391;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '[](<>(((LTLAPp0==true)||((LTLAPp1==true) U ([]((LTLAPp1==true))||((LTLAPp1==true)&&((LTLAPp2==true)||X((LTLAPp3==true)))))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-24 23:36:22] [INFO ] Flatten gal took : 12 ms
[2026-05-24 23:36:22] [INFO ] Time to serialize gal into /tmp/LTLFireability5428519018988208027.gal : 3 ms
[2026-05-24 23:36:22] [INFO ] Time to serialize properties into /tmp/LTLFireability4688671820064463633.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/LTLFireability5428519018988208027.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4688671820064463633.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...297
Read 1 LTL properties
Checking formula 0 : !((G(F(("((Node0ResZone>=1)&&(Node2GiveAnswer1>=1))")||(("(Node3GiveAnswer6<1)")U((G("(Node3GiveAnswer6<1)"))||(("(Node3GiveAnswer6<1)...221
Formula 0 simplified : FG(!"((Node0ResZone>=1)&&(Node2GiveAnswer1>=1))" & ((!"(Node2GiveAnswer1<1)" & X!"(Node4GiveAnswer3<1)") U !"(Node3GiveAnswer6<1)"))

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANInsertWithFailure-PT-010"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is CANInsertWithFailure-PT-010, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r034-tall-177946842100708"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-010.tgz
mv CANInsertWithFailure-PT-010 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;