Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r114-tall-174876423100651.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-2, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-tall-174876423100651
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 752K
-rw-r--r-- 1 mcc users 8.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 108K 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.4K 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 4.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 28K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 211K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 20K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 117K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K 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 48K 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-2-LTLCardinality-00
FORMULA_NAME LamportFastMutEx-PT-2-LTLCardinality-01
FORMULA_NAME LamportFastMutEx-PT-2-LTLCardinality-02
FORMULA_NAME LamportFastMutEx-PT-2-LTLCardinality-03
FORMULA_NAME LamportFastMutEx-PT-2-LTLCardinality-04
FORMULA_NAME LamportFastMutEx-PT-2-LTLCardinality-05
FORMULA_NAME LamportFastMutEx-PT-2-LTLCardinality-06
FORMULA_NAME LamportFastMutEx-PT-2-LTLCardinality-07
FORMULA_NAME LamportFastMutEx-PT-2-LTLCardinality-08
FORMULA_NAME LamportFastMutEx-PT-2-LTLCardinality-09
FORMULA_NAME LamportFastMutEx-PT-2-LTLCardinality-10
FORMULA_NAME LamportFastMutEx-PT-2-LTLCardinality-11
FORMULA_NAME LamportFastMutEx-PT-2-LTLCardinality-12
FORMULA_NAME LamportFastMutEx-PT-2-LTLCardinality-13
FORMULA_NAME LamportFastMutEx-PT-2-LTLCardinality-14
FORMULA_NAME LamportFastMutEx-PT-2-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748881032586

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-2
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-02 16:17:13] [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:17:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 16:17:14] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2025-06-02 16:17:14] [INFO ] Transformed 69 places.
[2025-06-02 16:17:14] [INFO ] Transformed 96 transitions.
[2025-06-02 16:17:14] [INFO ] Found NUPN structural information;
[2025-06-02 16:17:14] [INFO ] Completing missing partition info from NUPN : creating a component with [P_start_1_0, P_start_1_1, P_start_1_2, 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_setx_3_0, P_setx_3_1, P_setx_3_2, P_setbi_5_0, P_setbi_5_1, P_setbi_5_2, P_ify0_4_0, P_ify0_4_1, P_ify0_4_2, P_sety_9_0, P_sety_9_1, P_sety_9_2, P_ifxi_10_0, P_ifxi_10_1, P_ifxi_10_2, P_setbi_11_0, P_setbi_11_1, P_setbi_11_2, P_fordo_12_0, P_fordo_12_1, P_fordo_12_2, P_wait_0_0, P_wait_0_1, P_wait_0_2, P_wait_1_0, P_wait_1_1, P_wait_1_2, P_wait_2_0, P_wait_2_1, P_wait_2_2, P_await_13_0, P_await_13_1, P_await_13_2, P_done_0_0, P_done_0_1, P_done_0_2, P_done_1_0, P_done_1_1, P_done_1_2, P_done_2_0, P_done_2_1, P_done_2_2, P_ifyi_15_0, P_ifyi_15_1, P_ifyi_15_2, P_awaity_0, P_awaity_1, P_awaity_2, P_CS_21_0, P_CS_21_1, P_CS_21_2, P_setbi_24_0, P_setbi_24_1, P_setbi_24_2]
[2025-06-02 16:17:14] [INFO ] Parsed PT model containing 69 places and 96 transitions and 402 arcs in 173 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 34 transitions.
FORMULA LamportFastMutEx-PT-2-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-2-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-2-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-2-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-2-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-2-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-2-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 62/62 transitions.
Applied a total of 0 rules in 15 ms. Remains 44 /44 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2025-06-02 16:17:14] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
// Phase 1: matrix 56 rows 44 cols
[2025-06-02 16:17:14] [INFO ] Computed 10 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:17:14] [INFO ] Implicit Places using invariants in 250 ms returned [30, 31]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 287 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 42/44 places, 62/62 transitions.
Applied a total of 0 rules in 1 ms. Remains 42 /42 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 320 ms. Remains : 42/44 places, 62/62 transitions.
Support contains 28 out of 42 places after structural reductions.
[2025-06-02 16:17:14] [INFO ] Flatten gal took : 21 ms
[2025-06-02 16:17:14] [INFO ] Flatten gal took : 9 ms
[2025-06-02 16:17:14] [INFO ] Input system was already deterministic with 62 transitions.
RANDOM walk for 40000 steps (8 resets) in 1251 ms. (31 steps per ms) remains 5/19 properties
BEST_FIRST walk for 40001 steps (8 resets) in 422 ms. (94 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (8 resets) in 258 ms. (154 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 222 ms. (179 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 168 ms. (236 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (8 resets) in 137 ms. (289 steps per ms) remains 5/5 properties
[2025-06-02 16:17:15] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
// Phase 1: matrix 56 rows 42 cols
[2025-06-02 16:17:15] [INFO ] Computed 8 invariants in 2 ms
[2025-06-02 16:17:15] [INFO ] State equation strengthened by 12 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp12 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 16/16 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 16/32 variables, 4/20 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 16/36 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/36 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 56/88 variables, 32/68 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 12/80 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/80 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 10/98 variables, 10/90 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/98 variables, 10/100 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/98 variables, 4/104 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/98 variables, 0/104 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/98 variables, 0/104 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 98/98 variables, and 104 constraints, problems are : Problem set: 3 solved, 2 unsolved in 141 ms.
Refiners :[Domain max(s): 42/42 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 42/42 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 12/12 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 20/32 variables, 4/16 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 20/36 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/36 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 56/88 variables, 32/68 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 12/80 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/80 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 10/98 variables, 10/90 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/98 variables, 10/100 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/98 variables, 4/104 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/98 variables, 2/106 constraints. Problems are: Problem set: 3 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:16] [INFO ] Deduced a trap composed of 10 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:17:16] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:16] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:16] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:16] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:16] [INFO ] Deduced a trap composed of 9 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:17:16] [INFO ] Deduced a trap composed of 10 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:17:16] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:16] [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:17:16] [INFO ] Deduced a trap composed of 11 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:17:16] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 3 ms to minimize.
Problem AtomicPropp11 is UNSAT
At refinement iteration 12 (INCLUDED_ONLY) 0/98 variables, 11/117 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/98 variables, 0/117 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/98 variables, 0/117 constraints. Problems are: Problem set: 4 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 98/98 variables, and 117 constraints, problems are : Problem set: 4 solved, 1 unsolved in 689 ms.
Refiners :[Domain max(s): 42/42 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 42/42 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 2/5 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 863ms problems are : Problem set: 4 solved, 1 unsolved
Parikh walk visited 0 properties in 18 ms.
Support contains 2 out of 42 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 42/42 places, 62/62 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 42 transition count 60
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 40 transition count 60
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 38 transition count 58
Applied a total of 8 rules in 23 ms. Remains 38 /42 variables (removed 4) and now considering 58/62 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 38/42 places, 58/62 transitions.
RANDOM walk for 40000 steps (8 resets) in 211 ms. (188 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 1/1 properties
Probably explored full state space saw : 324 states, properties seen :0
Probabilistic random walk after 932 steps, saw 324 distinct states, run finished after 18 ms. (steps per millisecond=51 ) properties seen :0
Explored full state space saw : 324 states, properties seen :0
Exhaustive walk after 932 steps, saw 324 distinct states, run finished after 4 ms. (steps per millisecond=233 ) properties seen :0
FORMULA LamportFastMutEx-PT-2-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 5 atomic propositions for a total of 8 simplifications.
FORMULA LamportFastMutEx-PT-2-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-2-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-2-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 2 stable transitions
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)))'
Support contains 4 out of 42 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 42/42 places, 62/62 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 40 transition count 60
Applied a total of 4 rules in 4 ms. Remains 40 /42 variables (removed 2) and now considering 60/62 (removed 2) transitions.
[2025-06-02 16:17:17] [INFO ] Flow matrix only has 54 transitions (discarded 6 similar events)
// Phase 1: matrix 54 rows 40 cols
[2025-06-02 16:17:17] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:17:17] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-06-02 16:17:17] [INFO ] Flow matrix only has 54 transitions (discarded 6 similar events)
[2025-06-02 16:17:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:17:17] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-02 16:17:17] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:17:17] [INFO ] Redundant transitions in 1 ms returned []
Running 58 sub problems to find dead transitions.
[2025-06-02 16:17:17] [INFO ] Flow matrix only has 54 transitions (discarded 6 similar events)
[2025-06-02 16:17:17] [INFO ] Invariant cache hit.
[2025-06-02 16:17:17] [INFO ] State equation strengthened by 12 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 8/48 constraints. Problems are: Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:17] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:17] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:17] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:17] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 2 ms to minimize.
Problem TDEAD10 is UNSAT
Problem TDEAD13 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:17] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 2 ms to minimize.
Problem TDEAD14 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:17] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 4 ms to minimize.
Problem TDEAD16 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:17] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:17] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:17] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:17] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 3 ms to minimize.
Problem TDEAD23 is UNSAT
Problem TDEAD27 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:17] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:17] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:17] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:17] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:17] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:18] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:18] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 4 ms to minimize.
Problem TDEAD56 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 17/65 constraints. Problems are: Problem set: 12 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/65 constraints. Problems are: Problem set: 12 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 54/94 variables, 40/105 constraints. Problems are: Problem set: 12 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 12/117 constraints. Problems are: Problem set: 12 solved, 46 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:18] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 1/118 constraints. Problems are: Problem set: 12 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/118 constraints. Problems are: Problem set: 12 solved, 46 unsolved
At refinement iteration 8 (OVERLAPS) 0/94 variables, 0/118 constraints. Problems are: Problem set: 12 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 94/94 variables, and 118 constraints, problems are : Problem set: 12 solved, 46 unsolved in 1833 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 40/40 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 12 solved, 46 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 38/38 constraints. Problems are: Problem set: 12 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 4/42 constraints. Problems are: Problem set: 12 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 9/51 constraints. Problems are: Problem set: 12 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/51 constraints. Problems are: Problem set: 12 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 2/40 variables, 4/55 constraints. Problems are: Problem set: 12 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 2/57 constraints. Problems are: Problem set: 12 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 9/66 constraints. Problems are: Problem set: 12 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 0/66 constraints. Problems are: Problem set: 12 solved, 46 unsolved
At refinement iteration 8 (OVERLAPS) 54/94 variables, 40/106 constraints. Problems are: Problem set: 12 solved, 46 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/94 variables, 12/118 constraints. Problems are: Problem set: 12 solved, 46 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/94 variables, 46/164 constraints. Problems are: Problem set: 12 solved, 46 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/94 variables, 0/164 constraints. Problems are: Problem set: 12 solved, 46 unsolved
At refinement iteration 12 (OVERLAPS) 0/94 variables, 0/164 constraints. Problems are: Problem set: 12 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 94/94 variables, and 164 constraints, problems are : Problem set: 12 solved, 46 unsolved in 1425 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 40/40 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 46/58 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3284ms problems are : Problem set: 12 solved, 46 unsolved
Search for dead transitions found 12 dead transitions in 3285ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 40/42 places, 48/62 transitions.
Applied a total of 0 rules in 3 ms. Remains 40 /40 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:17:20] [INFO ] Redundant transitions in 0 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 3441 ms. Remains : 40/42 places, 48/62 transitions.
Stuttering acceptance computed with spot in 186 ms :[(NOT p0)]
Running random walk in product with property : LamportFastMutEx-PT-2-LTLCardinality-01
Product exploration explored 100000 steps with 0 reset in 228 ms.
Stack based approach found an accepted trace after 35 steps with 0 reset with depth 36 and stack size 36 in 1 ms.
FORMULA LamportFastMutEx-PT-2-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-PT-2-LTLCardinality-01 finished in 3924 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)&&X(G((X(X(p1))||G(p2))))))'
Support contains 8 out of 42 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 42/42 places, 62/62 transitions.
Applied a total of 0 rules in 1 ms. Remains 42 /42 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2025-06-02 16:17:20] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
// Phase 1: matrix 56 rows 42 cols
[2025-06-02 16:17:20] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:17:20] [INFO ] Implicit Places using invariants in 41 ms returned []
[2025-06-02 16:17:20] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
[2025-06-02 16:17:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:17:21] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-02 16:17:21] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2025-06-02 16:17:21] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
[2025-06-02 16:17:21] [INFO ] Invariant cache hit.
[2025-06-02 16:17:21] [INFO ] State equation strengthened by 12 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 8/50 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:21] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:21] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:21] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:21] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 2 ms to minimize.
Problem TDEAD10 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:21] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 3 ms to minimize.
Problem TDEAD13 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:21] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 2 ms to minimize.
Problem TDEAD14 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:21] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 4 ms to minimize.
Problem TDEAD16 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:21] [INFO ] Deduced a trap composed of 11 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:17:21] [INFO ] Deduced a trap composed of 11 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:17:21] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 3 ms to minimize.
Problem TDEAD23 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:21] [INFO ] Deduced a trap composed of 10 places in 43 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:17:21] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
Problem TDEAD28 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:21] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
Problem TDEAD32 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:21] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 2 ms to minimize.
Problem TDEAD34 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:21] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:21] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:21] [INFO ] Deduced a trap composed of 11 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:17:21] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:22] [INFO ] Deduced a trap composed of 11 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:17:22] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 3 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD34 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 20/70 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/70 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 56/98 variables, 42/112 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 12/124 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/124 constraints. Problems are: Problem set: 12 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:22] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 5 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/98 variables, 1/125 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 0/125 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 0/98 variables, 0/125 constraints. Problems are: Problem set: 12 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 98/98 variables, and 125 constraints, problems are : Problem set: 12 solved, 48 unsolved in 2366 ms.
Refiners :[Domain max(s): 42/42 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 42/42 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 12 solved, 48 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 4/44 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 13/57 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/57 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 2/42 variables, 4/61 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 2/63 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 8/71 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 0/71 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 56/98 variables, 42/113 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/98 variables, 12/125 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/98 variables, 48/173 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/98 variables, 0/173 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 12 (OVERLAPS) 0/98 variables, 0/173 constraints. Problems are: Problem set: 12 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 98/98 variables, and 173 constraints, problems are : Problem set: 12 solved, 48 unsolved in 1581 ms.
Refiners :[Domain max(s): 42/42 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 42/42 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 48/60 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3961ms problems are : Problem set: 12 solved, 48 unsolved
Search for dead transitions found 12 dead transitions in 3963ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in LTL mode, iteration 1 : 42/42 places, 50/62 transitions.
Applied a total of 0 rules in 3 ms. Remains 42 /42 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4093 ms. Remains : 42/42 places, 50/62 transitions.
Stuttering acceptance computed with spot in 366 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), true, (AND (NOT p2) (NOT p1)), (AND (NOT p2) p1)]
Running random walk in product with property : LamportFastMutEx-PT-2-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 626 steps with 127 reset in 6 ms.
FORMULA LamportFastMutEx-PT-2-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-2-LTLCardinality-02 finished in 4493 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(p0) U p1)))'
Support contains 12 out of 42 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 42/42 places, 62/62 transitions.
Applied a total of 0 rules in 1 ms. Remains 42 /42 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2025-06-02 16:17:25] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
[2025-06-02 16:17:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:17:25] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-06-02 16:17:25] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
[2025-06-02 16:17:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:17:25] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-02 16:17:25] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2025-06-02 16:17:25] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
[2025-06-02 16:17:25] [INFO ] Invariant cache hit.
[2025-06-02 16:17:25] [INFO ] State equation strengthened by 12 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 8/50 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:25] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:25] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:25] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:25] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:25] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 2 ms to minimize.
Problem TDEAD13 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:25] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 2 ms to minimize.
Problem TDEAD14 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:25] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 4 ms to minimize.
Problem TDEAD16 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:25] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:26] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:26] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 3 ms to minimize.
Problem TDEAD23 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:26] [INFO ] Deduced a trap composed of 10 places in 40 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:17:26] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 3 ms to minimize.
Problem TDEAD28 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:26] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Problem TDEAD30 is UNSAT
Problem TDEAD32 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:26] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 2 ms to minimize.
Problem TDEAD34 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:26] [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:17:26] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:26] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:26] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:26] [INFO ] Deduced a trap composed of 11 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:17:26] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 2 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD34 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 20/70 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/70 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 56/98 variables, 42/112 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 12/124 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/124 constraints. Problems are: Problem set: 12 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:27] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 5 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/98 variables, 1/125 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 0/125 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 0/98 variables, 0/125 constraints. Problems are: Problem set: 12 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 98/98 variables, and 125 constraints, problems are : Problem set: 12 solved, 48 unsolved in 2245 ms.
Refiners :[Domain max(s): 42/42 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 42/42 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 12 solved, 48 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 4/44 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 13/57 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/57 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 2/42 variables, 4/61 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 2/63 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 8/71 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 0/71 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 56/98 variables, 42/113 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/98 variables, 12/125 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/98 variables, 48/173 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/98 variables, 0/173 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 12 (OVERLAPS) 0/98 variables, 0/173 constraints. Problems are: Problem set: 12 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 98/98 variables, and 173 constraints, problems are : Problem set: 12 solved, 48 unsolved in 1455 ms.
Refiners :[Domain max(s): 42/42 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 42/42 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 48/60 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3713ms problems are : Problem set: 12 solved, 48 unsolved
Search for dead transitions found 12 dead transitions in 3714ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in LTL mode, iteration 1 : 42/42 places, 50/62 transitions.
Applied a total of 0 rules in 2 ms. Remains 42 /42 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3848 ms. Remains : 42/42 places, 50/62 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : LamportFastMutEx-PT-2-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 12 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-PT-2-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-2-LTLCardinality-07 finished in 3996 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(p0)))'
Support contains 1 out of 42 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 42/42 places, 62/62 transitions.
Applied a total of 0 rules in 2 ms. Remains 42 /42 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2025-06-02 16:17:29] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
[2025-06-02 16:17:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:17:29] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-06-02 16:17:29] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
[2025-06-02 16:17:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:17:29] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-02 16:17:29] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2025-06-02 16:17:29] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
[2025-06-02 16:17:29] [INFO ] Invariant cache hit.
[2025-06-02 16:17:29] [INFO ] State equation strengthened by 12 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 8/50 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:29] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:29] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:29] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:29] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:29] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 2 ms to minimize.
Problem TDEAD13 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:29] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
Problem TDEAD14 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:29] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 3 ms to minimize.
Problem TDEAD16 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:29] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:29] [INFO ] Deduced a trap composed of 11 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:17:30] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 3 ms to minimize.
Problem TDEAD23 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:30] [INFO ] Deduced a trap composed of 10 places in 38 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:17:30] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 3 ms to minimize.
Problem TDEAD28 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:30] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
Problem TDEAD32 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:30] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 2 ms to minimize.
Problem TDEAD34 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:30] [INFO ] Deduced a trap composed of 9 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:17:30] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:30] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:30] [INFO ] Deduced a trap composed of 11 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:17:30] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:30] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 2 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD34 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 20/70 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/70 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 56/98 variables, 42/112 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 12/124 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/124 constraints. Problems are: Problem set: 12 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:31] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 4 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/98 variables, 1/125 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 0/125 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 0/98 variables, 0/125 constraints. Problems are: Problem set: 12 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 98/98 variables, and 125 constraints, problems are : Problem set: 12 solved, 48 unsolved in 2333 ms.
Refiners :[Domain max(s): 42/42 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 42/42 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 12 solved, 48 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 4/44 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 13/57 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/57 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 2/42 variables, 4/61 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 2/63 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 8/71 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 0/71 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 56/98 variables, 42/113 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/98 variables, 12/125 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/98 variables, 48/173 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/98 variables, 0/173 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 12 (OVERLAPS) 0/98 variables, 0/173 constraints. Problems are: Problem set: 12 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 98/98 variables, and 173 constraints, problems are : Problem set: 12 solved, 48 unsolved in 1451 ms.
Refiners :[Domain max(s): 42/42 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 42/42 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 48/60 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3793ms problems are : Problem set: 12 solved, 48 unsolved
Search for dead transitions found 12 dead transitions in 3794ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in LTL mode, iteration 1 : 42/42 places, 50/62 transitions.
Applied a total of 0 rules in 2 ms. Remains 42 /42 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3919 ms. Remains : 42/42 places, 50/62 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-PT-2-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 47 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-PT-2-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-2-LTLCardinality-09 finished in 4012 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' '!(((p0 U p1)&&(G(p2)||X(p0))))'
Support contains 3 out of 42 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 42/42 places, 62/62 transitions.
Applied a total of 0 rules in 2 ms. Remains 42 /42 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2025-06-02 16:17:33] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
[2025-06-02 16:17:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:17:33] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-06-02 16:17:33] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
[2025-06-02 16:17:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:17:33] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-02 16:17:33] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2025-06-02 16:17:33] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
[2025-06-02 16:17:33] [INFO ] Invariant cache hit.
[2025-06-02 16:17:33] [INFO ] State equation strengthened by 12 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 8/50 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:33] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:33] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:33] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:33] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 2 ms to minimize.
Problem TDEAD10 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:33] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 2 ms to minimize.
Problem TDEAD13 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:33] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 2 ms to minimize.
Problem TDEAD14 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:33] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 3 ms to minimize.
Problem TDEAD16 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:33] [INFO ] Deduced a trap composed of 11 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:17:34] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:34] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 3 ms to minimize.
Problem TDEAD23 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:34] [INFO ] Deduced a trap composed of 10 places in 40 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:17:34] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 2 ms to minimize.
Problem TDEAD28 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:34] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
Problem TDEAD30 is UNSAT
Problem TDEAD32 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:34] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 3 ms to minimize.
Problem TDEAD34 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:34] [INFO ] Deduced a trap composed of 9 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:17:34] [INFO ] Deduced a trap composed of 10 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:17:34] [INFO ] Deduced a trap composed of 11 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:17:34] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:34] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:34] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 2 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD34 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 20/70 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/70 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 56/98 variables, 42/112 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 12/124 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/124 constraints. Problems are: Problem set: 12 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:35] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 4 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/98 variables, 1/125 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 0/125 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 0/98 variables, 0/125 constraints. Problems are: Problem set: 12 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 98/98 variables, and 125 constraints, problems are : Problem set: 12 solved, 48 unsolved in 2307 ms.
Refiners :[Domain max(s): 42/42 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 42/42 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 12 solved, 48 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 4/44 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 13/57 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/57 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 2/42 variables, 4/61 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 2/63 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 8/71 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 0/71 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 56/98 variables, 42/113 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/98 variables, 12/125 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/98 variables, 48/173 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/98 variables, 0/173 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 12 (OVERLAPS) 0/98 variables, 0/173 constraints. Problems are: Problem set: 12 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 98/98 variables, and 173 constraints, problems are : Problem set: 12 solved, 48 unsolved in 1465 ms.
Refiners :[Domain max(s): 42/42 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 42/42 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 48/60 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3779ms problems are : Problem set: 12 solved, 48 unsolved
Search for dead transitions found 12 dead transitions in 3781ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in LTL mode, iteration 1 : 42/42 places, 50/62 transitions.
Applied a total of 0 rules in 3 ms. Remains 42 /42 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3895 ms. Remains : 42/42 places, 50/62 transitions.
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), true, (NOT p0), (NOT p1), (AND (NOT p2) (NOT p0)), (NOT p2)]
Running random walk in product with property : LamportFastMutEx-PT-2-LTLCardinality-11
Product exploration explored 100000 steps with 50000 reset in 171 ms.
Product exploration explored 100000 steps with 50000 reset in 149 ms.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p0), (X (NOT (AND (NOT p0) p2))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p2))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 18 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LamportFastMutEx-PT-2-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LamportFastMutEx-PT-2-LTLCardinality-11 finished in 4490 ms.
All properties solved by simple procedures.
Total runtime 23923 ms.

BK_STOP 1748881057943

--------------------
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-2"
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-2, 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-174876423100651"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-PT-2.tgz
mv LamportFastMutEx-PT-2 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 ;