fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r114-tall-174876423100659
Last Updated
June 24, 2025

About the Execution of ITS-Tools for LamportFastMutEx-PT-3

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 54303.00 0.00 0.00 FFFFFFTFTFTTFTFT normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r114-tall-174876423100659.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is LamportFastMutEx-PT-3, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-tall-174876423100659
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 796K
-rw-r--r-- 1 mcc users 18K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 134K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 91K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 35K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 31K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 27K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 158K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 2 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 77K May 29 14:32 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-3-LTLCardinality-00
FORMULA_NAME LamportFastMutEx-PT-3-LTLCardinality-01
FORMULA_NAME LamportFastMutEx-PT-3-LTLCardinality-02
FORMULA_NAME LamportFastMutEx-PT-3-LTLCardinality-03
FORMULA_NAME LamportFastMutEx-PT-3-LTLCardinality-04
FORMULA_NAME LamportFastMutEx-PT-3-LTLCardinality-05
FORMULA_NAME LamportFastMutEx-PT-3-LTLCardinality-06
FORMULA_NAME LamportFastMutEx-PT-3-LTLCardinality-07
FORMULA_NAME LamportFastMutEx-PT-3-LTLCardinality-08
FORMULA_NAME LamportFastMutEx-PT-3-LTLCardinality-09
FORMULA_NAME LamportFastMutEx-PT-3-LTLCardinality-10
FORMULA_NAME LamportFastMutEx-PT-3-LTLCardinality-11
FORMULA_NAME LamportFastMutEx-PT-3-LTLCardinality-12
FORMULA_NAME LamportFastMutEx-PT-3-LTLCardinality-13
FORMULA_NAME LamportFastMutEx-PT-3-LTLCardinality-14
FORMULA_NAME LamportFastMutEx-PT-3-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748881141479

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-PT-3
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-02 16:19:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 16:19:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 16:19:03] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2025-06-02 16:19:03] [INFO ] Transformed 100 places.
[2025-06-02 16:19:03] [INFO ] Transformed 156 transitions.
[2025-06-02 16:19:03] [INFO ] Found NUPN structural information;
[2025-06-02 16:19:03] [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_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_setx_3_0, P_setx_3_1, P_setx_3_2, P_setx_3_3, P_setbi_5_0, P_setbi_5_1, P_setbi_5_2, P_setbi_5_3, P_ify0_4_0, P_ify0_4_1, P_ify0_4_2, P_ify0_4_3, P_sety_9_0, P_sety_9_1, P_sety_9_2, P_sety_9_3, P_ifxi_10_0, P_ifxi_10_1, P_ifxi_10_2, P_ifxi_10_3, P_setbi_11_0, P_setbi_11_1, P_setbi_11_2, P_setbi_11_3, P_fordo_12_0, P_fordo_12_1, P_fordo_12_2, P_fordo_12_3, P_wait_0_0, P_wait_0_1, P_wait_0_2, P_wait_0_3, P_wait_1_0, P_wait_1_1, P_wait_1_2, P_wait_1_3, P_wait_2_0, P_wait_2_1, P_wait_2_2, P_wait_2_3, P_wait_3_0, P_wait_3_1, P_wait_3_2, P_wait_3_3, P_await_13_0, P_await_13_1, P_await_13_2, P_await_13_3, P_done_0_0, P_done_0_1, P_done_0_2, P_done_0_3, P_done_1_0, P_done_1_1, P_done_1_2, P_done_1_3, P_done_2_0, P_done_2_1, P_done_2_2, P_done_2_3, P_done_3_0, P_done_3_1, P_done_3_2, P_done_3_3, P_ifyi_15_0, P_ifyi_15_1, P_ifyi_15_2, P_ifyi_15_3, P_awaity_0, P_awaity_1, P_awaity_2, P_awaity_3, P_CS_21_0, P_CS_21_1, P_CS_21_2, P_CS_21_3, P_setbi_24_0, P_setbi_24_1, P_setbi_24_2, P_setbi_24_3]
[2025-06-02 16:19:03] [INFO ] Parsed PT model containing 100 places and 156 transitions and 664 arcs in 182 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 42 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA LamportFastMutEx-PT-3-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-3-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-3-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-3-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-3-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-3-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 71 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 114/114 transitions.
Applied a total of 0 rules in 7 ms. Remains 71 /71 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2025-06-02 16:19:03] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
// Phase 1: matrix 96 rows 71 cols
[2025-06-02 16:19:03] [INFO ] Computed 17 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:19:03] [INFO ] Implicit Places using invariants in 249 ms returned []
[2025-06-02 16:19:03] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
[2025-06-02 16:19:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:19:03] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-02 16:19:03] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
Running 111 sub problems to find dead transitions.
[2025-06-02 16:19:03] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
[2025-06-02 16:19:03] [INFO ] Invariant cache hit.
[2025-06-02 16:19:03] [INFO ] State equation strengthened by 27 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 17/88 constraints. Problems are: Problem set: 0 solved, 111 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:04] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 13 ms to minimize.
Problem TDEAD1 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:04] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 6 ms to minimize.
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:04] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:04] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:04] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:04] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD18 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:04] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 3 ms to minimize.
Problem TDEAD22 is UNSAT
Problem TDEAD26 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:04] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 3 ms to minimize.
Problem TDEAD27 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:04] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 3 ms to minimize.
Problem TDEAD29 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:04] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 2 ms to minimize.
Problem TDEAD31 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:04] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:04] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:04] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:04] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:04] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:04] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 4 ms to minimize.
Problem TDEAD40 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD50 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:05] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:05] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:05] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:05] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 2 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 20/108 constraints. Problems are: Problem set: 18 solved, 93 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:05] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:05] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:05] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:05] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:05] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:05] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:05] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:05] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:05] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:05] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:05] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:06] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 12/120 constraints. Problems are: Problem set: 18 solved, 93 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:06] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:06] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 2/122 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/122 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 6 (OVERLAPS) 96/167 variables, 71/193 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 27/220 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 0/220 constraints. Problems are: Problem set: 18 solved, 93 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:08] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:08] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 4 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/167 variables, 2/222 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 0/222 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 11 (OVERLAPS) 0/167 variables, 0/222 constraints. Problems are: Problem set: 18 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 222 constraints, problems are : Problem set: 18 solved, 93 unsolved in 6374 ms.
Refiners :[Domain max(s): 71/71 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 71/71 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 36/36 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 18 solved, 93 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 68/68 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 5/73 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 19/92 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/92 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 4 (OVERLAPS) 3/71 variables, 12/104 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 3/107 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 17/124 constraints. Problems are: Problem set: 18 solved, 93 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:10] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 1/125 constraints. Problems are: Problem set: 18 solved, 93 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:11] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 1/126 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/71 variables, 0/126 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 10 (OVERLAPS) 96/167 variables, 71/197 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/167 variables, 27/224 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/167 variables, 93/317 constraints. Problems are: Problem set: 18 solved, 93 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:12] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:12] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/167 variables, 2/319 constraints. Problems are: Problem set: 18 solved, 93 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:13] [INFO ] Deduced a trap along path composed of 3 places in 33 ms of which 11 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/167 variables, 1/320 constraints. Problems are: Problem set: 18 solved, 93 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:15] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 4 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/167 variables, 1/321 constraints. Problems are: Problem set: 18 solved, 93 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:17] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 5 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/167 variables, 1/322 constraints. Problems are: Problem set: 18 solved, 93 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:18] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:18] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:18] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 5 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/167 variables, 3/325 constraints. Problems are: Problem set: 18 solved, 93 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:19] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:19] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 4 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/167 variables, 2/327 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/167 variables, 0/327 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 20 (OVERLAPS) 0/167 variables, 0/327 constraints. Problems are: Problem set: 18 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 327 constraints, problems are : Problem set: 18 solved, 93 unsolved in 15802 ms.
Refiners :[Domain max(s): 71/71 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 71/71 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 93/111 constraints, Known Traps: 47/47 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 22259ms problems are : Problem set: 18 solved, 93 unsolved
Search for dead transitions found 18 dead transitions in 22271ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in LTL mode, iteration 1 : 71/71 places, 96/114 transitions.
Applied a total of 0 rules in 2 ms. Remains 71 /71 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 22725 ms. Remains : 71/71 places, 96/114 transitions.
Support contains 40 out of 71 places after structural reductions.
[2025-06-02 16:19:26] [INFO ] Flatten gal took : 29 ms
[2025-06-02 16:19:26] [INFO ] Flatten gal took : 12 ms
[2025-06-02 16:19:26] [INFO ] Input system was already deterministic with 96 transitions.
RANDOM walk for 40000 steps (8 resets) in 1364 ms. (29 steps per ms) remains 4/21 properties
BEST_FIRST walk for 40004 steps (8 resets) in 240 ms. (165 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 163 ms. (243 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 103 ms. (384 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 130 ms. (305 steps per ms) remains 3/3 properties
[2025-06-02 16:19:26] [INFO ] Flow matrix only has 84 transitions (discarded 12 similar events)
// Phase 1: matrix 84 rows 71 cols
[2025-06-02 16:19:26] [INFO ] Computed 17 invariants in 3 ms
[2025-06-02 16:19:26] [INFO ] State equation strengthened by 24 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp9 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 51/57 variables, 12/18 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 51/69 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/69 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 84/141 variables, 57/126 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 24/150 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 0/150 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 14/155 variables, 14/164 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/155 variables, 14/178 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/155 variables, 5/183 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:27] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/155 variables, 1/184 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:27] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:27] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 4 ms to minimize.
Problem AtomicPropp2 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/155 variables, 2/186 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/155 variables, 0/186 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/155 variables, 0/186 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 155/155 variables, and 186 constraints, problems are : Problem set: 2 solved, 1 unsolved in 307 ms.
Refiners :[Domain max(s): 71/71 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 71/71 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 54/57 variables, 12/15 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 54/69 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/69 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 84/141 variables, 57/126 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 24/150 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 0/150 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/155 variables, 14/164 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/155 variables, 14/178 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/155 variables, 5/183 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/155 variables, 1/184 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/155 variables, 3/187 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/155 variables, 0/187 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/155 variables, 0/187 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 155/155 variables, and 187 constraints, problems are : Problem set: 2 solved, 1 unsolved in 85 ms.
Refiners :[Domain max(s): 71/71 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 71/71 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 409ms problems are : Problem set: 2 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 3 out of 71 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 96/96 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 68 transition count 93
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 9 place count 68 transition count 90
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 12 place count 65 transition count 90
Applied a total of 12 rules in 17 ms. Remains 65 /71 variables (removed 6) and now considering 90/96 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 65/71 places, 90/96 transitions.
RANDOM walk for 40000 steps (8 resets) in 272 ms. (146 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 89 ms. (444 steps per ms) remains 1/1 properties
Probably explored full state space saw : 15512 states, properties seen :0
Probabilistic random walk after 61100 steps, saw 15512 distinct states, run finished after 198 ms. (steps per millisecond=308 ) properties seen :0
Explored full state space saw : 15512 states, properties seen :0
Exhaustive walk after 61100 steps, saw 15512 distinct states, run finished after 106 ms. (steps per millisecond=576 ) properties seen :0
FORMULA LamportFastMutEx-PT-3-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 9 simplifications.
Computed a total of 1 stabilizing places and 3 stable transitions
FORMULA LamportFastMutEx-PT-3-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G((p0||X(((p1||X(X(p2))) U (p0&&(p1||X(X(p2))))))))) U p3))'
Support contains 9 out of 71 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 96/96 transitions.
Applied a total of 0 rules in 2 ms. Remains 71 /71 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2025-06-02 16:19:28] [INFO ] Flow matrix only has 84 transitions (discarded 12 similar events)
[2025-06-02 16:19:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:19:28] [INFO ] Implicit Places using invariants in 84 ms returned [47, 48, 49]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 86 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/71 places, 96/96 transitions.
Applied a total of 0 rules in 2 ms. Remains 68 /68 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 90 ms. Remains : 68/71 places, 96/96 transitions.
Stuttering acceptance computed with spot in 417 ms :[(NOT p3), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : LamportFastMutEx-PT-3-LTLCardinality-03
Product exploration explored 100000 steps with 80 reset in 281 ms.
Stack based approach found an accepted trace after 152 steps with 0 reset with depth 153 and stack size 153 in 1 ms.
FORMULA LamportFastMutEx-PT-3-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-PT-3-LTLCardinality-03 finished in 871 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 9 out of 71 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 71/71 places, 96/96 transitions.
Applied a total of 0 rules in 6 ms. Remains 71 /71 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2025-06-02 16:19:28] [INFO ] Flow matrix only has 84 transitions (discarded 12 similar events)
[2025-06-02 16:19:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:19:28] [INFO ] Implicit Places using invariants in 90 ms returned [47, 48, 49]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 91 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 68/71 places, 96/96 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 68 transition count 93
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 65 transition count 93
Applied a total of 6 rules in 11 ms. Remains 65 /68 variables (removed 3) and now considering 93/96 (removed 3) transitions.
[2025-06-02 16:19:28] [INFO ] Flow matrix only has 81 transitions (discarded 12 similar events)
// Phase 1: matrix 81 rows 65 cols
[2025-06-02 16:19:28] [INFO ] Computed 14 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:19:29] [INFO ] Implicit Places using invariants in 71 ms returned []
[2025-06-02 16:19:29] [INFO ] Flow matrix only has 81 transitions (discarded 12 similar events)
[2025-06-02 16:19:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:19:29] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-02 16:19:29] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 65/71 places, 93/96 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 307 ms. Remains : 65/71 places, 93/96 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : LamportFastMutEx-PT-3-LTLCardinality-04
Product exploration explored 100000 steps with 5574 reset in 174 ms.
Stack based approach found an accepted trace after 187 steps with 10 reset with depth 21 and stack size 21 in 0 ms.
FORMULA LamportFastMutEx-PT-3-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-PT-3-LTLCardinality-04 finished in 533 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((p0&&F(p1))) U (G(p2)||X(p0)))))'
Support contains 12 out of 71 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 71 /71 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2025-06-02 16:19:29] [INFO ] Flow matrix only has 84 transitions (discarded 12 similar events)
// Phase 1: matrix 84 rows 71 cols
[2025-06-02 16:19:29] [INFO ] Computed 17 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:19:29] [INFO ] Implicit Places using invariants in 97 ms returned [47, 48, 49]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 98 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/71 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 68 /68 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 101 ms. Remains : 68/71 places, 96/96 transitions.
Stuttering acceptance computed with spot in 451 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : LamportFastMutEx-PT-3-LTLCardinality-05
Product exploration explored 100000 steps with 0 reset in 146 ms.
Stack based approach found an accepted trace after 52 steps with 0 reset with depth 53 and stack size 53 in 1 ms.
FORMULA LamportFastMutEx-PT-3-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-PT-3-LTLCardinality-05 finished in 727 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0)&&(p1||G(p2))) U p3)))'
Support contains 15 out of 71 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 71 /71 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2025-06-02 16:19:30] [INFO ] Flow matrix only has 84 transitions (discarded 12 similar events)
[2025-06-02 16:19:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:19:30] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-02 16:19:30] [INFO ] Flow matrix only has 84 transitions (discarded 12 similar events)
[2025-06-02 16:19:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:19:30] [INFO ] State equation strengthened by 24 read => feed constraints.
[2025-06-02 16:19:30] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
Running 93 sub problems to find dead transitions.
[2025-06-02 16:19:30] [INFO ] Flow matrix only has 84 transitions (discarded 12 similar events)
[2025-06-02 16:19:30] [INFO ] Invariant cache hit.
[2025-06-02 16:19:30] [INFO ] State equation strengthened by 24 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 68/68 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 5/73 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 3/71 variables, 12/85 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 93 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:31] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:31] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:31] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:31] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:31] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:31] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:31] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:31] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:31] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:31] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:31] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:31] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:31] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:31] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:31] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:31] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:31] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:31] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:32] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:32] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 93 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:32] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:32] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:32] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:32] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:32] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:32] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:32] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:32] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:32] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:32] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:32] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 11/119 constraints. Problems are: Problem set: 0 solved, 93 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:33] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:33] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 93 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:33] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:33] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 93 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:33] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/71 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 93 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:34] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/71 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/71 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 12 (OVERLAPS) 84/155 variables, 71/196 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/155 variables, 24/220 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/155 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 93 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:35] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:35] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 3 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/155 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/155 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 17 (OVERLAPS) 0/155 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 155/155 variables, and 222 constraints, problems are : Problem set: 0 solved, 93 unsolved in 7936 ms.
Refiners :[Domain max(s): 71/71 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 71/71 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 39/39 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 93 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 68/68 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 5/73 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 25/98 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (OVERLAPS) 3/71 variables, 12/110 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 3/113 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 14/127 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (OVERLAPS) 84/155 variables, 71/198 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/155 variables, 24/222 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/155 variables, 93/315 constraints. Problems are: Problem set: 0 solved, 93 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:40] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:40] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:40] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/155 variables, 3/318 constraints. Problems are: Problem set: 0 solved, 93 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:41] [INFO ] Deduced a trap along path composed of 4 places in 28 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/155 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/155 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 93 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:45] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 2 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/155 variables, 1/320 constraints. Problems are: Problem set: 0 solved, 93 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:46] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:46] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 5 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/155 variables, 2/322 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/155 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 17 (OVERLAPS) 0/155 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 155/155 variables, and 322 constraints, problems are : Problem set: 0 solved, 93 unsolved in 15299 ms.
Refiners :[Domain max(s): 71/71 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 71/71 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 45/45 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 23253ms problems are : Problem set: 0 solved, 93 unsolved
Search for dead transitions found 0 dead transitions in 23255ms
Finished structural reductions in LTL mode , in 1 iterations and 23432 ms. Remains : 71/71 places, 96/96 transitions.
Stuttering acceptance computed with spot in 230 ms :[(NOT p3), (NOT p3), true, (NOT p0), (NOT p2)]
Running random walk in product with property : LamportFastMutEx-PT-3-LTLCardinality-06
Product exploration explored 100000 steps with 50000 reset in 164 ms.
Product exploration explored 100000 steps with 50000 reset in 144 ms.
Computed a total of 1 stabilizing places and 3 stable transitions
Computed a total of 1 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p3 p1 p2 (NOT p0)), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p3) (NOT p1) p2))), (X (NOT (OR (AND (NOT p3) p1) (AND (NOT p3) p2)))), (X (NOT (AND (NOT p3) (NOT p1) (NOT p2)))), (X (NOT p0)), (X p1), (X (NOT (OR (AND (NOT p3) (NOT p0) p1) (AND (NOT p3) (NOT p0) p2)))), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p3) p1) (AND (NOT p3) p2))))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (OR (AND (NOT p3) (NOT p0) p1) (AND (NOT p3) (NOT p0) p2)))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 16 factoid took 28 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LamportFastMutEx-PT-3-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LamportFastMutEx-PT-3-LTLCardinality-06 finished in 24037 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(X(X((p1||X((X(p0) U (p1&&X(p0)))))))))))'
Support contains 9 out of 71 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 71 /71 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2025-06-02 16:19:54] [INFO ] Flow matrix only has 84 transitions (discarded 12 similar events)
[2025-06-02 16:19:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:19:54] [INFO ] Implicit Places using invariants in 69 ms returned [47, 48, 49]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 69 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/71 places, 96/96 transitions.
Applied a total of 0 rules in 2 ms. Remains 68 /68 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 74 ms. Remains : 68/71 places, 96/96 transitions.
Stuttering acceptance computed with spot in 364 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Running random walk in product with property : LamportFastMutEx-PT-3-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 77484 steps with 12397 reset in 84 ms.
FORMULA LamportFastMutEx-PT-3-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-3-LTLCardinality-07 finished in 543 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 71 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 71 /71 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2025-06-02 16:19:54] [INFO ] Flow matrix only has 84 transitions (discarded 12 similar events)
[2025-06-02 16:19:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:19:54] [INFO ] Implicit Places using invariants in 70 ms returned [47, 48, 49]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 72 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/71 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 68 /68 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 76 ms. Remains : 68/71 places, 96/96 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-PT-3-LTLCardinality-08
Product exploration explored 100000 steps with 50000 reset in 85 ms.
Product exploration explored 100000 steps with 50000 reset in 102 ms.
Computed a total of 1 stabilizing places and 3 stable transitions
Computed a total of 1 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LamportFastMutEx-PT-3-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LamportFastMutEx-PT-3-LTLCardinality-08 finished in 387 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 71 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 71 /71 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2025-06-02 16:19:55] [INFO ] Flow matrix only has 84 transitions (discarded 12 similar events)
[2025-06-02 16:19:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:19:55] [INFO ] Implicit Places using invariants in 72 ms returned [47, 48, 49]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 73 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/71 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 68 /68 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 77 ms. Remains : 68/71 places, 96/96 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-PT-3-LTLCardinality-11
Product exploration explored 100000 steps with 50000 reset in 101 ms.
Product exploration explored 100000 steps with 50000 reset in 105 ms.
Computed a total of 1 stabilizing places and 3 stable transitions
Computed a total of 1 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LamportFastMutEx-PT-3-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LamportFastMutEx-PT-3-LTLCardinality-11 finished in 399 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p1)&&p0))))'
Support contains 4 out of 71 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 71 /71 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2025-06-02 16:19:55] [INFO ] Flow matrix only has 84 transitions (discarded 12 similar events)
[2025-06-02 16:19:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:19:55] [INFO ] Implicit Places using invariants in 73 ms returned [47, 48, 49]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 74 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/71 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 68 /68 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 78 ms. Remains : 68/71 places, 96/96 transitions.
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : LamportFastMutEx-PT-3-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 870 steps with 5 reset in 5 ms.
FORMULA LamportFastMutEx-PT-3-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-3-LTLCardinality-14 finished in 252 ms.
All properties solved by simple procedures.
Total runtime 52855 ms.

BK_STOP 1748881195782

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is LamportFastMutEx-PT-3, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r114-tall-174876423100659"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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