fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r114-tall-174876423100660
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 30026.00 0.00 0.00 TFFFFTFFFFFFFFFF normal

Execution Chart

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

Trace from the execution

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

--------------------
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-LTLFireability-00
FORMULA_NAME LamportFastMutEx-PT-3-LTLFireability-01
FORMULA_NAME LamportFastMutEx-PT-3-LTLFireability-02
FORMULA_NAME LamportFastMutEx-PT-3-LTLFireability-03
FORMULA_NAME LamportFastMutEx-PT-3-LTLFireability-04
FORMULA_NAME LamportFastMutEx-PT-3-LTLFireability-05
FORMULA_NAME LamportFastMutEx-PT-3-LTLFireability-06
FORMULA_NAME LamportFastMutEx-PT-3-LTLFireability-07
FORMULA_NAME LamportFastMutEx-PT-3-LTLFireability-08
FORMULA_NAME LamportFastMutEx-PT-3-LTLFireability-09
FORMULA_NAME LamportFastMutEx-PT-3-LTLFireability-10
FORMULA_NAME LamportFastMutEx-PT-3-LTLFireability-11
FORMULA_NAME LamportFastMutEx-PT-3-LTLFireability-12
FORMULA_NAME LamportFastMutEx-PT-3-LTLFireability-13
FORMULA_NAME LamportFastMutEx-PT-3-LTLFireability-14
FORMULA_NAME LamportFastMutEx-PT-3-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748881204396

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-PT-3
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-02 16:20:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 16:20:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 16:20:06] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2025-06-02 16:20:06] [INFO ] Transformed 100 places.
[2025-06-02 16:20:06] [INFO ] Transformed 156 transitions.
[2025-06-02 16:20:06] [INFO ] Found NUPN structural information;
[2025-06-02 16:20:06] [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:20:06] [INFO ] Parsed PT model containing 100 places and 156 transitions and 664 arcs in 189 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 42 transitions.
FORMULA LamportFastMutEx-PT-3-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-3-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-3-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-3-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-3-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA LamportFastMutEx-PT-3-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-3-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 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 19 ms. Remains 71 /71 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2025-06-02 16:20:06] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
// Phase 1: matrix 96 rows 71 cols
[2025-06-02 16:20:06] [INFO ] Computed 17 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:06] [INFO ] Implicit Places using invariants in 208 ms returned [49]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 250 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 70/71 places, 114/114 transitions.
Applied a total of 0 rules in 2 ms. Remains 70 /70 variables (removed 0) and now considering 114/114 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 287 ms. Remains : 70/71 places, 114/114 transitions.
Support contains 31 out of 70 places after structural reductions.
[2025-06-02 16:20:06] [INFO ] Flatten gal took : 27 ms
[2025-06-02 16:20:06] [INFO ] Flatten gal took : 13 ms
[2025-06-02 16:20:06] [INFO ] Input system was already deterministic with 114 transitions.
Reduction of identical properties reduced properties to check from 22 to 17
RANDOM walk for 40000 steps (8 resets) in 884 ms. (45 steps per ms) remains 1/17 properties
BEST_FIRST walk for 40004 steps (8 resets) in 294 ms. (135 steps per ms) remains 1/1 properties
[2025-06-02 16:20:07] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
// Phase 1: matrix 96 rows 70 cols
[2025-06-02 16:20:07] [INFO ] Computed 16 invariants in 3 ms
[2025-06-02 16:20:07] [INFO ] State equation strengthened by 24 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp11 is UNSAT
After SMT solving in domain Real declared 27/166 variables, and 10 constraints, problems are : Problem set: 1 solved, 0 unsolved in 55 ms.
Refiners :[Domain max(s): 4/70 constraints, Positive P Invariants (semi-flows): 6/16 constraints, State Equation: 0/70 constraints, ReadFeed: 0/24 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 85ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
Computed a total of 1 stabilizing places and 3 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||X(X((p1||X(p2))))||F(p3)))))'
Support contains 20 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 114/114 transitions.
Applied a total of 0 rules in 2 ms. Remains 70 /70 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2025-06-02 16:20:07] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
[2025-06-02 16:20:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:07] [INFO ] Implicit Places using invariants in 92 ms returned [47, 48]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 93 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/70 places, 114/114 transitions.
Applied a total of 0 rules in 2 ms. Remains 68 /68 variables (removed 0) and now considering 114/114 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 97 ms. Remains : 68/70 places, 114/114 transitions.
Stuttering acceptance computed with spot in 387 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : LamportFastMutEx-PT-3-LTLFireability-00
Product exploration explored 100000 steps with 509 reset in 331 ms.
Product exploration explored 100000 steps with 494 reset in 220 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 p0 p3 p1 p2), (X (NOT p3)), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3)))]
Knowledge based reduction with 4 factoid took 164 ms. Reduced automaton from 5 states, 7 edges and 4 AP (stutter sensitive) to 5 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 257 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2))]
RANDOM walk for 445 steps (0 resets) in 12 ms. (34 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND p0 p3 p1 p2), (X (NOT p3)), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (F (NOT (OR p0 p3))), (F (NOT (OR p1 p3))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR p2 p3))), (F (NOT p3)), (F (NOT p2))]
Knowledge based reduction with 4 factoid took 361 ms. Reduced automaton from 5 states, 7 edges and 4 AP (stutter sensitive) to 5 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2))]
Support contains 20 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 114/114 transitions.
Applied a total of 0 rules in 5 ms. Remains 68 /68 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2025-06-02 16:20:09] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
// Phase 1: matrix 96 rows 68 cols
[2025-06-02 16:20:09] [INFO ] Computed 14 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:09] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-06-02 16:20:09] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
[2025-06-02 16:20:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:10] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-02 16:20:10] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
Running 111 sub problems to find dead transitions.
[2025-06-02 16:20:10] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
[2025-06-02 16:20:10] [INFO ] Invariant cache hit.
[2025-06-02 16:20:10] [INFO ] State equation strengthened by 18 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, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 14/82 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:20:10] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 11 ms to minimize.
Problem TDEAD1 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:10] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 5 ms to minimize.
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:10] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 4 ms to minimize.
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:10] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:10] [INFO ] Deduced a trap composed of 10 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:20:10] [INFO ] Deduced a trap composed of 12 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:20:10] [INFO ] Deduced a trap composed of 10 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:20:10] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:10] [INFO ] Deduced a trap composed of 10 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:20:11] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 4 ms to minimize.
Problem TDEAD18 is UNSAT
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:20:11] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 2 ms to minimize.
Problem TDEAD27 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:11] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 2 ms to minimize.
Problem TDEAD29 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:11] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 4 ms to minimize.
Problem TDEAD31 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:11] [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:20:11] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:11] [INFO ] Deduced a trap composed of 16 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:20:11] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:11] [INFO ] Deduced a trap composed of 16 places in 51 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:20:11] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:11] [INFO ] Deduced a trap composed of 5 places in 41 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 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/68 variables, 20/102 constraints. Problems are: Problem set: 17 solved, 94 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:11] [INFO ] Deduced a trap composed of 12 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:20:11] [INFO ] Deduced a trap composed of 12 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:20:11] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:11] [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:20:12] [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:20:12] [INFO ] Deduced a trap composed of 5 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:20:12] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 2 ms to minimize.
Problem TDEAD51 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:12] [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:20:12] [INFO ] Deduced a trap composed of 11 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:20:12] [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:20:12] [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:20:12] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:12] [INFO ] Deduced a trap composed of 12 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:20:12] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:12] [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:20:12] [INFO ] Deduced a trap composed of 12 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:20:12] [INFO ] Deduced a trap composed of 12 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:20:12] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:12] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:12] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 3 ms to minimize.
Problem TDEAD51 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 20/122 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:20:13] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 1/123 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:20:13] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 1/124 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/124 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 7 (OVERLAPS) 96/164 variables, 68/192 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 18/210 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:20:14] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:14] [INFO ] Deduced a trap composed of 14 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:20:14] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:14] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 4/214 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 0/214 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 11 (OVERLAPS) 0/164 variables, 0/214 constraints. Problems are: Problem set: 18 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 164/164 variables, and 214 constraints, problems are : Problem set: 18 solved, 93 unsolved in 6716 ms.
Refiners :[Domain max(s): 68/68 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 68/68 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 46/46 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/65 variables, 65/65 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 5/70 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 29/99 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/99 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 4 (OVERLAPS) 3/68 variables, 9/108 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 3/111 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 17/128 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:20:17] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 1/129 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/68 variables, 0/129 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 9 (OVERLAPS) 96/164 variables, 68/197 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 18/215 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/164 variables, 93/308 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:20:19] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/164 variables, 1/309 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:20:20] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/164 variables, 1/310 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:20:21] [INFO ] Deduced a trap along path composed of 3 places in 36 ms of which 12 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/164 variables, 1/311 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/164 variables, 0/311 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 16 (OVERLAPS) 0/164 variables, 0/311 constraints. Problems are: Problem set: 18 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 164/164 variables, and 311 constraints, problems are : Problem set: 18 solved, 93 unsolved in 11499 ms.
Refiners :[Domain max(s): 68/68 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 68/68 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 93/111 constraints, Known Traps: 49/49 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 18262ms problems are : Problem set: 18 solved, 93 unsolved
Search for dead transitions found 18 dead transitions in 18264ms
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 : 68/68 places, 96/114 transitions.
Applied a total of 0 rules in 4 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 18466 ms. Remains : 68/68 places, 96/114 transitions.
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 p0 p3 p1 p2), (X (NOT p3)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X p1))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3)))]
Knowledge based reduction with 4 factoid took 181 ms. Reduced automaton from 5 states, 7 edges and 4 AP (stutter sensitive) to 5 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2))]
RANDOM walk for 267 steps (0 resets) in 7 ms. (33 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND p0 p3 p1 p2), (X (NOT p3)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X p1))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (F (NOT (OR p0 p3))), (F (NOT (OR p1 p3))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR p2 p3))), (F (NOT p3)), (F (NOT p2))]
Knowledge based reduction with 4 factoid took 313 ms. Reduced automaton from 5 states, 7 edges and 4 AP (stutter sensitive) to 5 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 254 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 239 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 472 reset in 145 ms.
Product exploration explored 100000 steps with 493 reset in 270 ms.
Built C files in :
/tmp/ltsmin4326271405525530538
[2025-06-02 16:20:30] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4326271405525530538
Running compilation step : cd /tmp/ltsmin4326271405525530538;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 409 ms.
Running link step : cd /tmp/ltsmin4326271405525530538;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin4326271405525530538;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4186152372284668736.hoa' '--buchi-type=spotba'
LTSmin run took 305 ms.
FORMULA LamportFastMutEx-PT-3-LTLFireability-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property LamportFastMutEx-PT-3-LTLFireability-00 finished in 23915 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(G(p0)))'
Support contains 4 out of 70 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 70/70 places, 114/114 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 70 transition count 113
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 69 transition count 113
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 8 place count 66 transition count 110
Applied a total of 8 rules in 23 ms. Remains 66 /70 variables (removed 4) and now considering 110/114 (removed 4) transitions.
[2025-06-02 16:20:31] [INFO ] Flow matrix only has 92 transitions (discarded 18 similar events)
// Phase 1: matrix 92 rows 66 cols
[2025-06-02 16:20:31] [INFO ] Computed 16 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:31] [INFO ] Implicit Places using invariants in 98 ms returned [44, 45]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 100 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/70 places, 110/114 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 64 transition count 108
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 62 transition count 108
Applied a total of 4 rules in 10 ms. Remains 62 /64 variables (removed 2) and now considering 108/110 (removed 2) transitions.
[2025-06-02 16:20:31] [INFO ] Flow matrix only has 90 transitions (discarded 18 similar events)
// Phase 1: matrix 90 rows 62 cols
[2025-06-02 16:20:31] [INFO ] Computed 14 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:31] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-02 16:20:31] [INFO ] Flow matrix only has 90 transitions (discarded 18 similar events)
[2025-06-02 16:20:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:31] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-02 16:20:31] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 62/70 places, 108/114 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 318 ms. Remains : 62/70 places, 108/114 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : LamportFastMutEx-PT-3-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 179 ms.
Stack based approach found an accepted trace after 24 steps with 0 reset with depth 25 and stack size 25 in 0 ms.
FORMULA LamportFastMutEx-PT-3-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-PT-3-LTLFireability-02 finished in 555 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(X(X(X(G(p0))))))'
Support contains 6 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 114/114 transitions.
Applied a total of 0 rules in 2 ms. Remains 70 /70 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2025-06-02 16:20:31] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
// Phase 1: matrix 96 rows 70 cols
[2025-06-02 16:20:31] [INFO ] Computed 16 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:32] [INFO ] Implicit Places using invariants in 70 ms returned [47, 48]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 71 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/70 places, 114/114 transitions.
Applied a total of 0 rules in 1 ms. Remains 68 /68 variables (removed 0) and now considering 114/114 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 74 ms. Remains : 68/70 places, 114/114 transitions.
Stuttering acceptance computed with spot in 218 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-PT-3-LTLFireability-03
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-PT-3-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-3-LTLFireability-03 finished in 309 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(X(G(p0))))'
Support contains 7 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 114/114 transitions.
Applied a total of 0 rules in 2 ms. Remains 70 /70 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2025-06-02 16:20:32] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
[2025-06-02 16:20:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:32] [INFO ] Implicit Places using invariants in 77 ms returned [47, 48]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 78 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/70 places, 114/114 transitions.
Applied a total of 0 rules in 1 ms. Remains 68 /68 variables (removed 0) and now considering 114/114 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 81 ms. Remains : 68/70 places, 114/114 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-PT-3-LTLFireability-04
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-PT-3-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-3-LTLFireability-04 finished in 218 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(X((p0 U X(((p1 U p2) U X(p1)))))) U p3))'
Support contains 16 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 114/114 transitions.
Applied a total of 0 rules in 1 ms. Remains 70 /70 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2025-06-02 16:20:32] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
[2025-06-02 16:20:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:32] [INFO ] Implicit Places using invariants in 60 ms returned [47, 48]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 61 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/70 places, 114/114 transitions.
Applied a total of 0 rules in 1 ms. Remains 68 /68 variables (removed 0) and now considering 114/114 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 64 ms. Remains : 68/70 places, 114/114 transitions.
Stuttering acceptance computed with spot in 431 ms :[(NOT p3), (OR (NOT p3) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : LamportFastMutEx-PT-3-LTLFireability-06
Entered a terminal (fully accepting) state of product in 16 steps with 1 reset in 1 ms.
FORMULA LamportFastMutEx-PT-3-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-3-LTLFireability-06 finished in 534 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(X(p0)))'
Support contains 2 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 114/114 transitions.
Applied a total of 0 rules in 2 ms. Remains 70 /70 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2025-06-02 16:20:33] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
[2025-06-02 16:20:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:33] [INFO ] Implicit Places using invariants in 71 ms returned [47, 48]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 72 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/70 places, 114/114 transitions.
Applied a total of 0 rules in 2 ms. Remains 68 /68 variables (removed 0) and now considering 114/114 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 76 ms. Remains : 68/70 places, 114/114 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : LamportFastMutEx-PT-3-LTLFireability-08
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-PT-3-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-3-LTLFireability-08 finished in 212 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((G(p1)||G(p2))))))'
Support contains 7 out of 70 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 70/70 places, 114/114 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 70 transition count 113
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 69 transition count 113
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 6 place count 67 transition count 111
Applied a total of 6 rules in 14 ms. Remains 67 /70 variables (removed 3) and now considering 111/114 (removed 3) transitions.
[2025-06-02 16:20:33] [INFO ] Flow matrix only has 93 transitions (discarded 18 similar events)
// Phase 1: matrix 93 rows 67 cols
[2025-06-02 16:20:33] [INFO ] Computed 16 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:33] [INFO ] Implicit Places using invariants in 67 ms returned [45]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 69 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/70 places, 111/114 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 66 transition count 110
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 65 transition count 110
Applied a total of 2 rules in 4 ms. Remains 65 /66 variables (removed 1) and now considering 110/111 (removed 1) transitions.
[2025-06-02 16:20:33] [INFO ] Flow matrix only has 92 transitions (discarded 18 similar events)
// Phase 1: matrix 92 rows 65 cols
[2025-06-02 16:20:33] [INFO ] Computed 15 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:33] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-06-02 16:20:33] [INFO ] Flow matrix only has 92 transitions (discarded 18 similar events)
[2025-06-02 16:20:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:33] [INFO ] State equation strengthened by 21 read => feed constraints.
[2025-06-02 16:20:33] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 65/70 places, 110/114 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 261 ms. Remains : 65/70 places, 110/114 transitions.
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : LamportFastMutEx-PT-3-LTLFireability-09
Product exploration explored 100000 steps with 2 reset in 188 ms.
Stack based approach found an accepted trace after 62 steps with 2 reset with depth 35 and stack size 35 in 1 ms.
FORMULA LamportFastMutEx-PT-3-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-PT-3-LTLFireability-09 finished in 572 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((p0||X((X(p2)&&p1)))))'
Support contains 5 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 114/114 transitions.
Applied a total of 0 rules in 1 ms. Remains 70 /70 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2025-06-02 16:20:33] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
// Phase 1: matrix 96 rows 70 cols
[2025-06-02 16:20:33] [INFO ] Computed 16 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:33] [INFO ] Implicit Places using invariants in 67 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 68 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 69/70 places, 114/114 transitions.
Applied a total of 0 rules in 1 ms. Remains 69 /69 variables (removed 0) and now considering 114/114 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 70 ms. Remains : 69/70 places, 114/114 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : LamportFastMutEx-PT-3-LTLFireability-12
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-PT-3-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-3-LTLFireability-12 finished in 222 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(X((p0&&(G(!p1)||(!p1&&F(p2)))))))'
Support contains 6 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 114/114 transitions.
Applied a total of 0 rules in 1 ms. Remains 70 /70 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2025-06-02 16:20:34] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
[2025-06-02 16:20:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:34] [INFO ] Implicit Places using invariants in 74 ms returned [47, 48]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 75 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/70 places, 114/114 transitions.
Applied a total of 0 rules in 1 ms. Remains 68 /68 variables (removed 0) and now considering 114/114 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 77 ms. Remains : 68/70 places, 114/114 transitions.
Stuttering acceptance computed with spot in 218 ms :[true, (NOT p2), (OR (NOT p0) p1), (AND (NOT p2) p1), (OR (NOT p0) p1), (OR (NOT p0) p1)]
Running random walk in product with property : LamportFastMutEx-PT-3-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1874 steps with 20 reset in 7 ms.
FORMULA LamportFastMutEx-PT-3-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-3-LTLFireability-15 finished in 316 ms.
All properties solved by simple procedures.
Total runtime 28540 ms.

BK_STOP 1748881234422

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is LamportFastMutEx-PT-3, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r114-tall-174876423100660"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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