About the Execution of ITS-Tools for LamportFastMutEx-PT-4
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 754.256 | 409967.00 | 486234.00 | 1309.10 | FFFTFTFTFTFFFFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r162-smll-177961107900412.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 LamportFastMutEx-PT-4, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r162-smll-177961107900412
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 936K
-rw-r--r-- 1 mcc users 14K Mar 7 16:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Mar 7 16:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 23K Mar 7 16:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 140K Mar 7 16:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 7.6K Mar 15 11:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 39K Mar 15 11:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Mar 15 11:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 37K Mar 15 11:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 27K Mar 7 16:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 170K Mar 7 16:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 30K Mar 7 16:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 172K Mar 7 16:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 11:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.5K Mar 15 11:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 114K 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 LamportFastMutEx-PT-4-LTLFireability-00
FORMULA_NAME LamportFastMutEx-PT-4-LTLFireability-01
FORMULA_NAME LamportFastMutEx-PT-4-LTLFireability-02
FORMULA_NAME LamportFastMutEx-PT-4-LTLFireability-03
FORMULA_NAME LamportFastMutEx-PT-4-LTLFireability-04
FORMULA_NAME LamportFastMutEx-PT-4-LTLFireability-05
FORMULA_NAME LamportFastMutEx-PT-4-LTLFireability-06
FORMULA_NAME LamportFastMutEx-PT-4-LTLFireability-07
FORMULA_NAME LamportFastMutEx-PT-4-LTLFireability-08
FORMULA_NAME LamportFastMutEx-PT-4-LTLFireability-09
FORMULA_NAME LamportFastMutEx-PT-4-LTLFireability-10
FORMULA_NAME LamportFastMutEx-PT-4-LTLFireability-11
FORMULA_NAME LamportFastMutEx-PT-4-LTLFireability-12
FORMULA_NAME LamportFastMutEx-PT-4-LTLFireability-13
FORMULA_NAME LamportFastMutEx-PT-4-LTLFireability-14
FORMULA_NAME LamportFastMutEx-PT-4-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1779876669115
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-PT-4
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-27 10:11:11] [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-27 10:11:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-27 10:11:11] [INFO ] Load time of PNML (sax parser for PT used): 123 ms
[2026-05-27 10:11:11] [INFO ] Transformed 135 places.
[2026-05-27 10:11:11] [INFO ] Transformed 230 transitions.
[2026-05-27 10:11:11] [INFO ] Found NUPN structural information;
[2026-05-27 10:11:11] [INFO ] Completing missing partition info from NUPN : creating a component with [P_start_1_0, P_start_1_1, P_start_1_2, P_start_1_3, P_start_1_4, P_b_0_false, P_b_0_true, P_b_1_false, P_b_1_true, P_b_2_false, P_b_2_true, P_b_3_false, P_b_3_true, P_b_4_false, P_b_4_true, P_setx_3_0, P_setx_3_1, P_setx_3_2, P_setx_3_3, P_setx_3_4, P_setbi_5_0, P_setbi_5_1, P_setbi_5_2, P_setbi_5_3, P_setbi_5_4, P_ify0_4_0, P_ify0_4_1, P_ify0_4_2, P_ify0_4_3, P_ify0_4_4, P_sety_9_0, P_sety_9_1, P_sety_9_2, P_sety_9_3, P_sety_9_4, P_ifxi_10_0, P_ifxi_10_1, P_ifxi_10_2, P_ifxi_10_3, P_ifxi_10_4, P_setbi_11_0, P_setbi_11_1, P_setbi_11_2, P_setbi_11_3, P_setbi_11_4, P_fordo_12_0, P_fordo_12_1, P_fordo_12_2, P_fordo_12_3, P_fordo_12_4, P_wait_0_0, P_wait_0_1, P_wait_0_2, P_wait_0_3, P_wait_0_4, P_wait_1_0, P_wait_1_1, P_wait_1_2, P_wait_1_3, P_wait_1_4, P_wait_2_0, P_wait_2_1, P_wait_2_2, P_wait_2_3, P_wait_2_4, P_wait_3_0, P_wait_3_1, P_wait_3_2, P_wait_3_3, P_wait_3_4, P_wait_4_0, P_wait_4_1, P_wait_4_2, P_wait_4_3, P_wait_4_4, P_await_13_0, P_await_13_1, P_await_13_2, P_await_13_3, P_await_13_4, P_done_0_0, P_done_0_1, P_done_0_2, P_done_0_3, P_done_0_4, P_done_1_0, P_done_1_1, P_done_1_2, P_done_1_3, P_done_1_4, P_done_2_0, P_done_2_1, P_done_2_2, P_done_2_3, P_done_2_4, P_done_3_0, P_done_3_1, P_done_3_2, P_done_3_3, P_done_3_4, P_done_4_0, P_done_4_1, P_done_4_2, P_done_4_3, P_done_4_4, P_ifyi_15_0, P_ifyi_15_1, P_ifyi_15_2, P_ifyi_15_3, P_ifyi_15_4, P_awaity_0, P_awaity_1, P_awaity_2, P_awaity_3, P_awaity_4, P_CS_21_0, P_CS_21_1, P_CS_21_2, P_CS_21_3, P_CS_21_4, P_setbi_24_0, P_setbi_24_1, P_setbi_24_2, P_setbi_24_3, P_setbi_24_4]
[2026-05-27 10:11:11] [INFO ] Parsed PT model containing 135 places and 230 transitions and 990 arcs in 286 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 33 places in 3 ms
Reduce places removed 33 places and 50 transitions.
FORMULA LamportFastMutEx-PT-4-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-4-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-4-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-4-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 77 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 180/180 transitions.
Applied a total of 0 rules in 18 ms. Remains 102 /102 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2026-05-27 10:11:11] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6602118601919714819.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12752164291613286648.kers'
[2026-05-27 10:11:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6602118601919714819.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12752164291613286648.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 144 rows 98 cols 432 entries
Finished phase 1 with 76 SingleSign rule and 0 generalized
[2026-05-27 10:11:11] [INFO ] Computed 26 invariants in 1 ms
Computed 26 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-12752164291613286648.kers
Total runtime 3 ms.
[2026-05-27 10:11:12] [INFO ] Implicit Places using invariants in 395 ms returned []
[2026-05-27 10:11:12] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
[2026-05-27 10:11:12] [INFO ] Invariant cache hit.
[2026-05-27 10:11:12] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-27 10:11:12] [INFO ] Implicit Places using invariants and state equation in 352 ms returned []
Implicit Place search using SMT with State Equation took 798 ms to find 0 implicit places.
Running 176 sub problems to find dead transitions.
[2026-05-27 10:11:12] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
[2026-05-27 10:11:12] [INFO ] Invariant cache hit.
[2026-05-27 10:11:12] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 26/128 constraints. Problems are: Problem set: 0 solved, 176 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD102 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 20/148 constraints. Problems are: Problem set: 21 solved, 155 unsolved
Problem TDEAD80 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD92 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 20/168 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 7/175 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 1/176 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/176 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 7 (OVERLAPS) 144/246 variables, 102/278 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 40/318 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 4/322 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 4/326 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 4/330 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/246 variables, 2/332 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/246 variables, 1/333 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/246 variables, 3/336 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/246 variables, 1/337 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/246 variables, 0/337 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 17 (OVERLAPS) 0/246 variables, 1/338 constraints. Problems are: Problem set: 24 solved, 152 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 246/246 variables, and 339 constraints, problems are : Problem set: 24 solved, 152 unsolved in 30040 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 69/69 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 98/98 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 6/104 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 51/155 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/155 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 4/102 variables, 20/175 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 4/179 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 18/197 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/197 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 8 (OVERLAPS) 144/246 variables, 102/299 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 40/339 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 152/491 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 3/494 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/246 variables, 3/497 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/246 variables, 1/498 constraints. Problems are: Problem set: 24 solved, 152 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 246/246 variables, and 498 constraints, problems are : Problem set: 24 solved, 152 unsolved in 30017 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 152/176 constraints, Known Traps: 75/75 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60268ms problems are : Problem set: 24 solved, 152 unsolved
Search for dead transitions found 24 dead transitions in 60296ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in LTL mode, iteration 1 : 102/102 places, 156/180 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61178 ms. Remains : 102/102 places, 156/180 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2026-05-27 10:12:13] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12318961702713141719.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6615503074636794481.kers'
[2026-05-27 10:12:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12318961702713141719.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6615503074636794481.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 128 rows 98 cols 400 entries
Finished phase 1 with 76 SingleSign rule and 0 generalized
[2026-05-27 10:12:13] [INFO ] Computed 26 invariants in 1 ms
Computed 26 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6615503074636794481.kers
Total runtime 2 ms.
[2026-05-27 10:12:13] [INFO ] Implicit Places using invariants in 121 ms returned []
[2026-05-27 10:12:13] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2026-05-27 10:12:13] [INFO ] Invariant cache hit.
[2026-05-27 10:12:13] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-27 10:12:13] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
Running 152 sub problems to find dead transitions.
[2026-05-27 10:12:13] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2026-05-27 10:12:13] [INFO ] Invariant cache hit.
[2026-05-27 10:12:13] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 98/98 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 6/104 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (OVERLAPS) 4/102 variables, 20/124 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 4/128 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 20/148 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 20/168 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 13/181 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 2/183 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 10 (OVERLAPS) 128/230 variables, 102/285 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/230 variables, 36/321 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/230 variables, 2/323 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/230 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/230 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 15 (OVERLAPS) 0/230 variables, 2/326 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/230 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 230/230 variables, and 326 constraints, problems are : Problem set: 0 solved, 152 unsolved in 30018 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 98/98 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 6/104 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 40/144 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 4/102 variables, 20/164 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 4/168 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 20/188 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 8 (OVERLAPS) 128/230 variables, 102/290 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/230 variables, 36/326 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 152/478 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/230 variables, 1/479 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/230 variables, 5/484 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/230 variables, 2/486 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/230 variables, 4/490 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/230 variables, 2/492 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 230/230 variables, and 492 constraints, problems are : Problem set: 0 solved, 152 unsolved in 30017 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 74/74 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60099ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 60102ms
Finished structural reductions in LTL mode , in 1 iterations and 60488 ms. Remains : 102/102 places, 156/156 transitions.
Support contains 77 out of 102 places after structural reductions.
[2026-05-27 10:13:13] [INFO ] Flatten gal took : 85 ms
[2026-05-27 10:13:14] [INFO ] Flatten gal took : 46 ms
[2026-05-27 10:13:14] [INFO ] Input system was already deterministic with 156 transitions.
Reduction of identical properties reduced properties to check from 28 to 25
RANDOM walk for 40000 steps (8 resets) in 3177 ms. (12 steps per ms) remains 3/25 properties
BEST_FIRST walk for 40004 steps (8 resets) in 718 ms. (55 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 341 ms. (116 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 148 ms. (268 steps per ms) remains 3/3 properties
[2026-05-27 10:13:15] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2026-05-27 10:13:15] [INFO ] Invariant cache hit.
[2026-05-27 10:13:15] [INFO ] State equation strengthened by 36 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Problem AtomicPropp6 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 25/25 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem AtomicPropp13 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 5/30 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/30 constraints. Problems are: Problem set: 2 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 72/97 variables, 20/50 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 72/122 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/122 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 128/225 variables, 97/219 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 36/255 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/225 variables, 0/255 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/230 variables, 5/260 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 5/265 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/230 variables, 1/266 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/230 variables, 0/266 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/230 variables, 0/266 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 266 constraints, problems are : Problem set: 2 solved, 1 unsolved in 201 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 24/26 variables, 6/8 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 24/32 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Problem AtomicPropp26 is UNSAT
After SMT solving in domain Int declared 26/230 variables, and 33 constraints, problems are : Problem set: 3 solved, 0 unsolved in 107 ms.
Refiners :[Domain max(s): 26/102 constraints, Positive P Invariants (semi-flows): 6/26 constraints, State Equation: 0/102 constraints, ReadFeed: 0/36 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 324ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA LamportFastMutEx-PT-4-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 11 simplifications.
FORMULA LamportFastMutEx-PT-4-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 4 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' '!((X(p0)||(G(!p1) U p2)))'
Support contains 36 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 8 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2026-05-27 10:13:16] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2026-05-27 10:13:16] [INFO ] Invariant cache hit.
[2026-05-27 10:13:16] [INFO ] Implicit Places using invariants in 195 ms returned []
[2026-05-27 10:13:16] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2026-05-27 10:13:16] [INFO ] Invariant cache hit.
[2026-05-27 10:13:16] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-27 10:13:16] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 533 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 541 ms. Remains : 102/102 places, 156/156 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(G(!p1) U p2)))'
Stuttering acceptance computed with spot in 547 ms :[p1, true, (AND (NOT p0) (NOT p2)), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (NOT p2) p1)]
Running random walk in product with property : LamportFastMutEx-PT-4-LTLFireability-00
Entered a terminal (fully accepting) state of product in 16 steps with 0 reset in 5 ms.
FORMULA LamportFastMutEx-PT-4-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-4-LTLFireability-00 finished in 1238 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((X(X(X(X(p0)))) U p0))||G(p0)))'
Support contains 9 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 7 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2026-05-27 10:13:17] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2026-05-27 10:13:17] [INFO ] Invariant cache hit.
[2026-05-27 10:13:17] [INFO ] Implicit Places using invariants in 231 ms returned [66, 67, 68, 69]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 238 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/102 places, 156/156 transitions.
Applied a total of 0 rules in 6 ms. Remains 98 /98 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 252 ms. Remains : 98/102 places, 156/156 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((X(X(X(X(p0)))) U p0))||G(p0)))'
Stuttering acceptance computed with spot in 279 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : LamportFastMutEx-PT-4-LTLFireability-02
Entered a terminal (fully accepting) state of product in 21 steps with 1 reset in 1 ms.
FORMULA LamportFastMutEx-PT-4-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-4-LTLFireability-02 finished in 588 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G((F(!p0)||(!p1&&F(!p2))))||((F(!p0)||(!p1&&F(!p2)))&&X(F(!p1)))))))'
Support contains 24 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 5 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2026-05-27 10:13:18] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2026-05-27 10:13:18] [INFO ] Invariant cache hit.
[2026-05-27 10:13:18] [INFO ] Implicit Places using invariants in 220 ms returned [66, 67, 68, 69]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 222 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/102 places, 156/156 transitions.
Applied a total of 0 rules in 5 ms. Remains 98 /98 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 233 ms. Remains : 98/102 places, 156/156 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G((F(p0)||(F(p2)&&p1)))||(X(F(p3))&&(F(p0)||(F(p2)&&p4)))))))'
Stuttering acceptance computed with spot in 611 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : LamportFastMutEx-PT-4-LTLFireability-03
Product exploration explored 100000 steps with 25000 reset in 738 ms.
Product exploration explored 100000 steps with 25000 reset in 400 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge based reduction with 9 factoid took 159 ms. Reduced automaton from 9 states, 17 edges and 5 AP (stutter sensitive) to 6 states, 8 edges and 4 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 8 to 6
RANDOM walk for 40000 steps (8 resets) in 811 ms. (49 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 929 ms. (43 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 246 ms. (161 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 1129 ms. (35 steps per ms) remains 2/2 properties
[2026-05-27 10:13:21] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7240755035798524095.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1525320596611287592.kers'
[2026-05-27 10:13:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7240755035798524095.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1525320596611287592.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 128 rows 94 cols 392 entries
Finished phase 1 with 76 SingleSign rule and 0 generalized
[2026-05-27 10:13:21] [INFO ] Computed 22 invariants in 0 ms
Computed 22 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1525320596611287592.kers
Total runtime 1 ms.
[2026-05-27 10:13:21] [INFO ] State equation strengthened by 20 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 69/93 variables, 17/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 69/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 128/221 variables, 93/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 20/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 5/226 variables, 5/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 5/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/226 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/226 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/226 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 226/226 variables, and 238 constraints, problems are : Problem set: 0 solved, 2 unsolved in 277 ms.
Refiners :[Domain max(s): 98/98 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 98/98 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Problem apf6 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 24/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 4/28 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/28 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 69/93 variables, 17/45 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 69/114 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem apf3 is UNSAT
After SMT solving in domain Int declared 93/226 variables, and 132 constraints, problems are : Problem set: 2 solved, 0 unsolved in 1900 ms.
Refiners :[Domain max(s): 93/98 constraints, Positive P Invariants (semi-flows): 21/22 constraints, State Equation: 0/98 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2194ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge based reduction with 11 factoid took 197 ms. Reduced automaton from 6 states, 8 edges and 4 AP (stutter sensitive) to 5 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 294 ms :[(AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p0))]
Knowledge-based reduction took 3738 ms.
Stuttering acceptance computed with spot in 275 ms :[(AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p0))]
Support contains 20 out of 98 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 156/156 transitions.
Applied a total of 0 rules in 4 ms. Remains 98 /98 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2026-05-27 10:13:24] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2026-05-27 10:13:24] [INFO ] Invariant cache hit.
[2026-05-27 10:13:24] [INFO ] Implicit Places using invariants in 173 ms returned []
[2026-05-27 10:13:24] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2026-05-27 10:13:24] [INFO ] Invariant cache hit.
[2026-05-27 10:13:24] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-27 10:13:24] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 479 ms to find 0 implicit places.
Running 152 sub problems to find dead transitions.
[2026-05-27 10:13:24] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2026-05-27 10:13:24] [INFO ] Invariant cache hit.
[2026-05-27 10:13:24] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 94/94 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 6/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (OVERLAPS) 4/98 variables, 16/116 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 4/120 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 20/160 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 14/174 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 7/181 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/98 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/98 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 11 (OVERLAPS) 128/226 variables, 98/280 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/226 variables, 20/300 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/226 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/226 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 15 (OVERLAPS) 0/226 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/226 variables, 2/304 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/226 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 226/226 variables, and 304 constraints, problems are : Problem set: 0 solved, 152 unsolved in 30012 ms.
Refiners :[Domain max(s): 98/98 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 98/98 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 66/66 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 94/94 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 6/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 42/142 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 4/98 variables, 16/158 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 4/162 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 24/186 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 8 (OVERLAPS) 128/226 variables, 98/284 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/226 variables, 20/304 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 152/456 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/226 variables, 1/457 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/226 variables, 2/459 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/226 variables, 5/464 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 226/226 variables, and 465 constraints, problems are : Problem set: 0 solved, 152 unsolved in 30014 ms.
Refiners :[Domain max(s): 98/98 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 98/98 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 74/74 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60063ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 60065ms
Finished structural reductions in LTL mode , in 1 iterations and 60550 ms. Remains : 98/98 places, 156/156 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge based reduction with 1 factoid took 87 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 3 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 5 to 3
RANDOM walk for 40000 steps (8 resets) in 364 ms. (109 steps per ms) remains 1/3 properties
BEST_FIRST walk for 968 steps (0 resets) in 7 ms. (121 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 164 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 274 ms :[(AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p0))]
Knowledge-based reduction took 648 ms.
Stuttering acceptance computed with spot in 269 ms :[(AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p0))]
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p0))]
Product exploration explored 100000 steps with 25000 reset in 153 ms.
Product exploration explored 100000 steps with 25000 reset in 167 ms.
Spot run failed in 140 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/ltsmin10513982143783220839
[2026-05-27 10:14:26] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10513982143783220839
Running compilation step : cd /tmp/ltsmin10513982143783220839;'/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 935 ms.
Running link step : cd /tmp/ltsmin10513982143783220839;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 73 ms.
Running LTSmin : cd /tmp/ltsmin10513982143783220839;'/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/stateBased18185503962446450550.hoa' '--buchi-type=spotba'
LTSmin run took 66 ms.
FORMULA LamportFastMutEx-PT-4-LTLFireability-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property LamportFastMutEx-PT-4-LTLFireability-03 finished in 69419 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((X(((F(p1) U G(p2))&&X(p3)))||p0))))'
Support contains 25 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2026-05-27 10:14:27] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14436005429562941854.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10651003683681342617.kers'
[2026-05-27 10:14:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14436005429562941854.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10651003683681342617.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 128 rows 98 cols 400 entries
Finished phase 1 with 76 SingleSign rule and 0 generalized
[2026-05-27 10:14:27] [INFO ] Computed 26 invariants in 1 ms
Computed 26 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10651003683681342617.kers
Total runtime 2 ms.
[2026-05-27 10:14:27] [INFO ] Implicit Places using invariants in 168 ms returned [66, 67, 68, 69]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 169 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/102 places, 156/156 transitions.
Applied a total of 0 rules in 3 ms. Remains 98 /98 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 175 ms. Remains : 98/102 places, 156/156 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((X(((F(p1) U G(p2))&&X(p3)))||p0))))'
Stuttering acceptance computed with spot in 258 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (NOT p2) (NOT p3)), (NOT p1), (NOT p2), (NOT p3), true]
Running random walk in product with property : LamportFastMutEx-PT-4-LTLFireability-04
Entered a terminal (fully accepting) state of product in 21 steps with 2 reset in 0 ms.
FORMULA LamportFastMutEx-PT-4-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-4-LTLFireability-04 finished in 500 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((X(F(p0)) U p1)))'
Support contains 12 out of 102 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 98 transition count 152
Applied a total of 8 rules in 32 ms. Remains 98 /102 variables (removed 4) and now considering 152/156 (removed 4) transitions.
[2026-05-27 10:14:28] [INFO ] Flow matrix only has 124 transitions (discarded 28 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8552024329742937561.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14329496843012619384.kers'
[2026-05-27 10:14:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8552024329742937561.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14329496843012619384.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 124 rows 94 cols 392 entries
Finished phase 1 with 72 SingleSign rule and 0 generalized
[2026-05-27 10:14:28] [INFO ] Computed 26 invariants in 0 ms
Computed 26 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14329496843012619384.kers
Total runtime 1 ms.
[2026-05-27 10:14:28] [INFO ] Implicit Places using invariants in 161 ms returned [62, 63, 64, 65]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 163 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 94/102 places, 152/156 transitions.
Applied a total of 0 rules in 11 ms. Remains 94 /94 variables (removed 0) and now considering 152/152 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 206 ms. Remains : 94/102 places, 152/156 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((X(F(p0)) U p1)))'
Stuttering acceptance computed with spot in 54 ms :[(NOT p1)]
Running random walk in product with property : LamportFastMutEx-PT-4-LTLFireability-07
Product exploration explored 100000 steps with 3741 reset in 473 ms.
Product exploration explored 100000 steps with 3738 reset in 481 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge based reduction with 3 factoid took 63 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
RANDOM walk for 134 steps (0 resets) in 5 ms. (22 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p1)]
[2026-05-27 10:14:29] [INFO ] Flow matrix only has 124 transitions (discarded 28 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2778935329884951561.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11674525009620091859.kers'
[2026-05-27 10:14:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2778935329884951561.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11674525009620091859.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 124 rows 90 cols 384 entries
Finished phase 1 with 72 SingleSign rule and 0 generalized
[2026-05-27 10:14:29] [INFO ] Computed 22 invariants in 0 ms
Computed 22 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11674525009620091859.kers
Total runtime 1 ms.
[2026-05-27 10:14:29] [INFO ] [Real]Absence check using 22 positive place invariants in 21 ms returned sat
[2026-05-27 10:14:29] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2026-05-27 10:14:29] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 10:14:30] [INFO ] [Nat]Absence check using 22 positive place invariants in 13 ms returned sat
[2026-05-27 10:14:30] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2026-05-27 10:14:30] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-27 10:14:30] [INFO ] [Nat]Added 20 Read/Feed constraints in 8 ms returned sat
[2026-05-27 10:14:30] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 609 ms
[2026-05-27 10:14:30] [INFO ] Computed and/alt/rep : 108/424/108 causal constraints (skipped 12 transitions) in 10 ms.
[2026-05-27 10:14:31] [INFO ] Added : 85 causal constraints over 17 iterations in 420 ms. Result :sat
Could not prove EG (NOT p1)
Knowledge-based reduction took 1876 ms.
Stuttering acceptance computed with spot in 52 ms :[(NOT p1)]
Support contains 12 out of 94 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 152/152 transitions.
Applied a total of 0 rules in 13 ms. Remains 94 /94 variables (removed 0) and now considering 152/152 (removed 0) transitions.
[2026-05-27 10:14:31] [INFO ] Flow matrix only has 124 transitions (discarded 28 similar events)
[2026-05-27 10:14:31] [INFO ] Invariant cache hit.
[2026-05-27 10:14:31] [INFO ] Implicit Places using invariants in 185 ms returned []
[2026-05-27 10:14:31] [INFO ] Flow matrix only has 124 transitions (discarded 28 similar events)
[2026-05-27 10:14:31] [INFO ] Invariant cache hit.
[2026-05-27 10:14:31] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-27 10:14:31] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 533 ms to find 0 implicit places.
[2026-05-27 10:14:31] [INFO ] Redundant transitions in 8 ms returned []
Running 148 sub problems to find dead transitions.
[2026-05-27 10:14:31] [INFO ] Flow matrix only has 124 transitions (discarded 28 similar events)
[2026-05-27 10:14:31] [INFO ] Invariant cache hit.
[2026-05-27 10:14:31] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 90/90 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 6/96 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (OVERLAPS) 4/94 variables, 16/112 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 20/136 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 20/156 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 8/164 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/94 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/94 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 10 (OVERLAPS) 124/218 variables, 94/259 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/218 variables, 20/279 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/218 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 13 (OVERLAPS) 0/218 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/218 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 15 (OVERLAPS) 0/218 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/218 variables, and 280 constraints, problems are : Problem set: 0 solved, 148 unsolved in 22616 ms.
Refiners :[Domain max(s): 94/94 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 94/94 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 50/50 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 148 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 90/90 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 6/96 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 35/131 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (OVERLAPS) 4/94 variables, 16/147 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 4/151 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 15/166 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 8 (OVERLAPS) 124/218 variables, 94/260 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/218 variables, 20/280 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/218 variables, 148/428 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/218 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/218 variables, 6/435 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/218 variables, 2/437 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/218 variables, 2/439 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/218 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 148 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 218/218 variables, and 441 constraints, problems are : Problem set: 0 solved, 148 unsolved in 30018 ms.
Refiners :[Domain max(s): 94/94 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 94/94 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 62/62 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 52678ms problems are : Problem set: 0 solved, 148 unsolved
Search for dead transitions found 0 dead transitions in 52680ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 53243 ms. Remains : 94/94 places, 152/152 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
RANDOM walk for 104 steps (0 resets) in 4 ms. (20 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p1)]
[2026-05-27 10:15:24] [INFO ] Flow matrix only has 124 transitions (discarded 28 similar events)
[2026-05-27 10:15:24] [INFO ] Invariant cache hit.
[2026-05-27 10:15:24] [INFO ] [Real]Absence check using 22 positive place invariants in 23 ms returned sat
[2026-05-27 10:15:25] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2026-05-27 10:15:25] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 10:15:25] [INFO ] [Nat]Absence check using 22 positive place invariants in 19 ms returned sat
[2026-05-27 10:15:25] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2026-05-27 10:15:25] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-27 10:15:25] [INFO ] [Nat]Added 20 Read/Feed constraints in 10 ms returned sat
[2026-05-27 10:15:26] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 774 ms
[2026-05-27 10:15:26] [INFO ] Computed and/alt/rep : 108/424/108 causal constraints (skipped 12 transitions) in 16 ms.
[2026-05-27 10:15:26] [INFO ] Added : 85 causal constraints over 17 iterations in 403 ms. Result :sat
Could not prove EG (NOT p1)
Knowledge-based reduction took 2196 ms.
Stuttering acceptance computed with spot in 50 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p1)]
Product exploration explored 100000 steps with 3729 reset in 319 ms.
Product exploration explored 100000 steps with 3731 reset in 329 ms.
Built C files in :
/tmp/ltsmin13486309267947813159
[2026-05-27 10:15:27] [INFO ] Computing symmetric may disable matrix : 152 transitions.
[2026-05-27 10:15:27] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 10:15:27] [INFO ] Computing symmetric may enable matrix : 152 transitions.
[2026-05-27 10:15:27] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 10:15:27] [INFO ] Computing Do-Not-Accords matrix : 152 transitions.
[2026-05-27 10:15:27] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 10:15:27] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13486309267947813159
Running compilation step : cd /tmp/ltsmin13486309267947813159;'/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 734 ms.
Running link step : cd /tmp/ltsmin13486309267947813159;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin13486309267947813159;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16110766309028747230.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 12 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 152/152 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 94 transition count 148
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 90 transition count 148
Applied a total of 8 rules in 18 ms. Remains 90 /94 variables (removed 4) and now considering 148/152 (removed 4) transitions.
[2026-05-27 10:15:42] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10888447455108196794.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15094814076298918413.kers'
[2026-05-27 10:15:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10888447455108196794.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15094814076298918413.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 120 rows 86 cols 388 entries
Finished phase 1 with 68 SingleSign rule and 0 generalized
[2026-05-27 10:15:42] [INFO ] Computed 22 invariants in 0 ms
Computed 22 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15094814076298918413.kers
Total runtime 2 ms.
[2026-05-27 10:15:42] [INFO ] Implicit Places using invariants in 157 ms returned []
[2026-05-27 10:15:42] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
[2026-05-27 10:15:42] [INFO ] Invariant cache hit.
[2026-05-27 10:15:42] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-27 10:15:42] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
[2026-05-27 10:15:42] [INFO ] Redundant transitions in 8 ms returned []
Running 144 sub problems to find dead transitions.
[2026-05-27 10:15:42] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
[2026-05-27 10:15:42] [INFO ] Invariant cache hit.
[2026-05-27 10:15:42] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 4/90 variables, 16/108 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 4/112 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 14/166 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 2/168 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 10 (OVERLAPS) 120/210 variables, 90/258 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/210 variables, 20/278 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/210 variables, 2/280 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/210 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/210 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/210 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 16 (OVERLAPS) 0/210 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 282 constraints, problems are : Problem set: 0 solved, 144 unsolved in 26387 ms.
Refiners :[Domain max(s): 90/90 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 90/90 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 37/129 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (OVERLAPS) 4/90 variables, 16/145 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 4/149 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 23/172 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (OVERLAPS) 120/210 variables, 90/262 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 20/282 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 144/426 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/210 variables, 11/437 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/210 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/210 variables, 2/440 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/210 variables, 4/444 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 210/210 variables, and 445 constraints, problems are : Problem set: 0 solved, 144 unsolved in 30014 ms.
Refiners :[Domain max(s): 90/90 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 90/90 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 78/78 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 56441ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 56442ms
Starting structural reductions in SI_LTL mode, iteration 1 : 90/94 places, 148/152 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 56900 ms. Remains : 90/94 places, 148/152 transitions.
Built C files in :
/tmp/ltsmin1038553206775400832
[2026-05-27 10:16:39] [INFO ] Computing symmetric may disable matrix : 148 transitions.
[2026-05-27 10:16:39] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 10:16:39] [INFO ] Computing symmetric may enable matrix : 148 transitions.
[2026-05-27 10:16:39] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 10:16:39] [INFO ] Computing Do-Not-Accords matrix : 148 transitions.
[2026-05-27 10:16:39] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 10:16:39] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1038553206775400832
Running compilation step : cd /tmp/ltsmin1038553206775400832;'/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 743 ms.
Running link step : cd /tmp/ltsmin1038553206775400832;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin1038553206775400832;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased803557522322144456.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-27 10:16:54] [INFO ] Flatten gal took : 15 ms
[2026-05-27 10:16:54] [INFO ] Flatten gal took : 12 ms
[2026-05-27 10:16:54] [INFO ] Time to serialize gal into /tmp/LTL15000169102952845071.gal : 6 ms
[2026-05-27 10:16:54] [INFO ] Time to serialize properties into /tmp/LTL7967278826589631639.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15000169102952845071.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2126895047042676991.hoa' '-atoms' '/tmp/LTL7967278826589631639.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL7967278826589631639.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2126895047042676991.hoa
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23,...775
Detected timeout of ITS tools.
[2026-05-27 10:17:09] [INFO ] Flatten gal took : 11 ms
[2026-05-27 10:17:09] [INFO ] Flatten gal took : 12 ms
[2026-05-27 10:17:09] [INFO ] Time to serialize gal into /tmp/LTL15152327690629828187.gal : 4 ms
[2026-05-27 10:17:09] [INFO ] Time to serialize properties into /tmp/LTL15158773614277756237.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15152327690629828187.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15158773614277756237.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F((X(F("((((y_2==1)&&(P_ifyi_15_2==1))||((y_4==1)&&(P_ifyi_15_4==1)))||(((y_1==1)&&(P_ifyi_15_1==1))||((y_3==1)&&(P_ifyi_15_3==1)))...488
Formula 0 simplified : G(!"(((((P_b_1_true==1)&&(P_setbi_24_1==1))||((P_b_1_false==1)&&(P_setbi_24_1==1)))||(((P_b_2_false==1)&&(P_setbi_24_2==1))||((P_b_3...809
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23,...675
Detected timeout of ITS tools.
[2026-05-27 10:17:24] [INFO ] Flatten gal took : 10 ms
[2026-05-27 10:17:24] [INFO ] Applying decomposition
[2026-05-27 10:17:24] [INFO ] Flatten gal took : 11 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/graph4507418735096359213.txt' '-o' '/tmp/graph4507418735096359213.bin' '-w' '/tmp/graph4507418735096359213.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4507418735096359213.bin' '-l' '-1' '-v' '-w' '/tmp/graph4507418735096359213.weights' '-q' '0' '-e' '0.001'
[2026-05-27 10:17:24] [INFO ] Decomposing Gal with order
[2026-05-27 10:17:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 10:17:24] [INFO ] Removed a total of 162 redundant transitions.
[2026-05-27 10:17:24] [INFO ] Flatten gal took : 93 ms
[2026-05-27 10:17:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 57 labels/synchronizations in 12 ms.
[2026-05-27 10:17:24] [INFO ] Time to serialize gal into /tmp/LTL11492929205137913848.gal : 6 ms
[2026-05-27 10:17:24] [INFO ] Time to serialize properties into /tmp/LTL4577764678127631084.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/LTL11492929205137913848.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4577764678127631084.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((X(F("((((i6.u8.y_2==1)&&(i1.u29.P_ifyi_15_2==1))||((i6.u8.y_4==1)&&(i3.u31.P_ifyi_15_4==1)))||(((i6.u8.y_1==1)&&(i0.u32.P_ifyi_1...644
Formula 0 simplified : G(!"(((((i0.u0.P_b_1_true==1)&&(i6.u33.P_setbi_24_1==1))||((i0.u0.P_b_1_false==1)&&(i6.u33.P_setbi_24_1==1)))||(((i1.u1.P_b_2_false=...1069
Detected timeout of ITS tools.
Treatment of property LamportFastMutEx-PT-4-LTLFireability-07 finished in 191972 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((X(F(p2))&&p1))))'
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2026-05-27 10:17:40] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18406559876449326566.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10798069607211133602.kers'
[2026-05-27 10:17:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18406559876449326566.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10798069607211133602.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 128 rows 98 cols 400 entries
Finished phase 1 with 76 SingleSign rule and 0 generalized
[2026-05-27 10:17:40] [INFO ] Computed 26 invariants in 0 ms
Computed 26 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10798069607211133602.kers
Total runtime 1 ms.
[2026-05-27 10:17:40] [INFO ] Implicit Places using invariants in 279 ms returned [66, 67, 68, 69]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 280 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/102 places, 156/156 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 287 ms. Remains : 98/102 places, 156/156 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((X(F(p2))&&p1))))'
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : LamportFastMutEx-PT-4-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-PT-4-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-4-LTLFireability-08 finished in 549 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||G(p1)) U p2))))'
Support contains 6 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 98 transition count 152
Applied a total of 8 rules in 14 ms. Remains 98 /102 variables (removed 4) and now considering 152/156 (removed 4) transitions.
[2026-05-27 10:17:40] [INFO ] Flow matrix only has 124 transitions (discarded 28 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13460621344653785427.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4265483745500991738.kers'
[2026-05-27 10:17:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13460621344653785427.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4265483745500991738.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 124 rows 94 cols 392 entries
Finished phase 1 with 72 SingleSign rule and 0 generalized
[2026-05-27 10:17:40] [INFO ] Computed 26 invariants in 1 ms
Computed 26 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4265483745500991738.kers
Total runtime 1 ms.
[2026-05-27 10:17:40] [INFO ] Implicit Places using invariants in 278 ms returned [62, 63, 64, 65]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 280 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 94/102 places, 152/156 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 94 transition count 148
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 90 transition count 148
Applied a total of 8 rules in 14 ms. Remains 90 /94 variables (removed 4) and now considering 148/152 (removed 4) transitions.
[2026-05-27 10:17:40] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13881821564493887540.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8252326486928377826.kers'
[2026-05-27 10:17:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13881821564493887540.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8252326486928377826.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 120 rows 86 cols 388 entries
Finished phase 1 with 68 SingleSign rule and 0 generalized
[2026-05-27 10:17:40] [INFO ] Computed 22 invariants in 1 ms
Computed 22 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8252326486928377826.kers
Total runtime 1 ms.
[2026-05-27 10:17:41] [INFO ] Implicit Places using invariants in 217 ms returned []
[2026-05-27 10:17:41] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
[2026-05-27 10:17:41] [INFO ] Invariant cache hit.
[2026-05-27 10:17:41] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-27 10:17:41] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 584 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 90/102 places, 148/156 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 892 ms. Remains : 90/102 places, 148/156 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(((G(p0)||p1) U p2))))'
Stuttering acceptance computed with spot in 232 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : LamportFastMutEx-PT-4-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 470 ms.
Stack based approach found an accepted trace after 273 steps with 0 reset with depth 274 and stack size 274 in 3 ms.
FORMULA LamportFastMutEx-PT-4-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-PT-4-LTLFireability-10 finished in 1643 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(p1))&&G(p2)&&p0)))'
Support contains 12 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 1 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2026-05-27 10:17:42] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8392488011650757760.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6923948399822558879.kers'
[2026-05-27 10:17:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8392488011650757760.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6923948399822558879.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 128 rows 98 cols 400 entries
Finished phase 1 with 76 SingleSign rule and 0 generalized
[2026-05-27 10:17:42] [INFO ] Computed 26 invariants in 1 ms
Computed 26 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6923948399822558879.kers
Total runtime 2 ms.
[2026-05-27 10:17:42] [INFO ] Implicit Places using invariants in 236 ms returned [66, 67]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 237 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 100/102 places, 156/156 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 241 ms. Remains : 100/102 places, 156/156 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(p1))&&G(p2)&&p0)))'
Stuttering acceptance computed with spot in 286 ms :[true, (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : LamportFastMutEx-PT-4-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-PT-4-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-4-LTLFireability-12 finished in 577 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)||G(p1))))'
Support contains 4 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 98 transition count 152
Applied a total of 8 rules in 14 ms. Remains 98 /102 variables (removed 4) and now considering 152/156 (removed 4) transitions.
[2026-05-27 10:17:42] [INFO ] Flow matrix only has 124 transitions (discarded 28 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3933571391763400005.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3931304822125662513.kers'
[2026-05-27 10:17:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3933571391763400005.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3931304822125662513.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 124 rows 94 cols 392 entries
Finished phase 1 with 72 SingleSign rule and 0 generalized
[2026-05-27 10:17:42] [INFO ] Computed 26 invariants in 1 ms
Computed 26 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3931304822125662513.kers
Total runtime 2 ms.
[2026-05-27 10:17:43] [INFO ] Implicit Places using invariants in 263 ms returned [62, 63, 64, 65]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 264 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 94/102 places, 152/156 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 94 transition count 148
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 90 transition count 148
Applied a total of 8 rules in 13 ms. Remains 90 /94 variables (removed 4) and now considering 148/152 (removed 4) transitions.
[2026-05-27 10:17:43] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4459755837234778684.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8601667512988446057.kers'
[2026-05-27 10:17:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4459755837234778684.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8601667512988446057.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 120 rows 86 cols 388 entries
Finished phase 1 with 68 SingleSign rule and 0 generalized
[2026-05-27 10:17:43] [INFO ] Computed 22 invariants in 1 ms
Computed 22 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8601667512988446057.kers
Total runtime 2 ms.
[2026-05-27 10:17:43] [INFO ] Implicit Places using invariants in 216 ms returned []
[2026-05-27 10:17:43] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
[2026-05-27 10:17:43] [INFO ] Invariant cache hit.
[2026-05-27 10:17:43] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-27 10:17:43] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 601 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 90/102 places, 148/156 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 892 ms. Remains : 90/102 places, 148/156 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)||G(p1))))'
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : LamportFastMutEx-PT-4-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 362 ms.
Stack based approach found an accepted trace after 252 steps with 0 reset with depth 253 and stack size 253 in 2 ms.
FORMULA LamportFastMutEx-PT-4-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-PT-4-LTLFireability-13 finished in 1354 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((F(p0)&&X(X((!p0 U (p1||G(!p0))))))))'
Support contains 4 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2026-05-27 10:17:44] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1882198545565761407.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10564943404052297581.kers'
[2026-05-27 10:17:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1882198545565761407.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10564943404052297581.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 128 rows 98 cols 400 entries
Finished phase 1 with 76 SingleSign rule and 0 generalized
[2026-05-27 10:17:44] [INFO ] Computed 26 invariants in 1 ms
Computed 26 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10564943404052297581.kers
Total runtime 2 ms.
[2026-05-27 10:17:44] [INFO ] Implicit Places using invariants in 259 ms returned [66, 67, 68, 69]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 260 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/102 places, 156/156 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 264 ms. Remains : 98/102 places, 156/156 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((F(p0)&&X(X((!p0 U (p1||G(!p0))))))))'
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : LamportFastMutEx-PT-4-LTLFireability-14
Product exploration explored 100000 steps with 8049 reset in 243 ms.
Stack based approach found an accepted trace after 463 steps with 28 reset with depth 34 and stack size 34 in 8 ms.
FORMULA LamportFastMutEx-PT-4-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-PT-4-LTLFireability-14 finished in 785 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((X(F(p0)) U p1)))'
Spot run failed in 90 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-27 10:17:45] [INFO ] Flatten gal took : 21 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11597617913788837802
[2026-05-27 10:17:45] [INFO ] Computing symmetric may disable matrix : 156 transitions.
[2026-05-27 10:17:45] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 10:17:45] [INFO ] Computing symmetric may enable matrix : 156 transitions.
[2026-05-27 10:17:45] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 10:17:45] [INFO ] Applying decomposition
[2026-05-27 10:17:45] [INFO ] Computing Do-Not-Accords matrix : 156 transitions.
[2026-05-27 10:17:45] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 10:17:45] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11597617913788837802
Running compilation step : cd /tmp/ltsmin11597617913788837802;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-27 10:17:45] [INFO ] Flatten gal took : 22 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/graph8285367814939976664.txt' '-o' '/tmp/graph8285367814939976664.bin' '-w' '/tmp/graph8285367814939976664.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8285367814939976664.bin' '-l' '-1' '-v' '-w' '/tmp/graph8285367814939976664.weights' '-q' '0' '-e' '0.001'
[2026-05-27 10:17:45] [INFO ] Decomposing Gal with order
[2026-05-27 10:17:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 10:17:45] [INFO ] Removed a total of 170 redundant transitions.
[2026-05-27 10:17:45] [INFO ] Flatten gal took : 41 ms
[2026-05-27 10:17:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 11 ms.
[2026-05-27 10:17:45] [INFO ] Time to serialize gal into /tmp/LTLFireability446401467857954378.gal : 9 ms
[2026-05-27 10:17:45] [INFO ] Time to serialize properties into /tmp/LTLFireability16323817265578966956.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/LTLFireability446401467857954378.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16323817265578966956.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((X(F("((((i1.u8.y_2==1)&&(i6.u31.P_ifyi_15_2==1))||((i1.u8.y_4==1)&&(i4.i0.u32.P_ifyi_15_4==1)))||(((i1.u8.y_1==1)&&(i5.u29.P_ify...674
Formula 0 simplified : G(!"(((((i5.u0.P_b_1_true==1)&&(i1.u34.P_setbi_24_1==1))||((i5.u0.P_b_1_false==1)&&(i1.u34.P_setbi_24_1==1)))||(((i6.u1.P_b_2_false=...1123
Compilation finished in 751 ms.
Running link step : cd /tmp/ltsmin11597617913788837802;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin11597617913788837802;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '<>((X(<>((LTLAPp0==true))) U (LTLAPp1==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t36, t37, t38, t39, t40, t41, t42, t43, t56, t76, t77, t78, t79, t104, t105, t106, t107, t108...583
LTSmin run took 13071 ms.
FORMULA LamportFastMutEx-PT-4-LTLFireability-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 407845 ms.
BK_STOP 1779877079082
--------------------
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="LamportFastMutEx-PT-4"
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 LamportFastMutEx-PT-4, 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 r162-smll-177961107900412"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-PT-4.tgz
mv LamportFastMutEx-PT-4 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 '
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 ;