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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 3600000.00 0.00 0.00 FFFFTFT?TFFFFTTT normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 24K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 181K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 17K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 100K 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 11K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 49K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 32K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 220K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 51K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 273K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.4K 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 157K 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-5-LTLFireability-00
FORMULA_NAME LamportFastMutEx-PT-5-LTLFireability-01
FORMULA_NAME LamportFastMutEx-PT-5-LTLFireability-02
FORMULA_NAME LamportFastMutEx-PT-5-LTLFireability-03
FORMULA_NAME LamportFastMutEx-PT-5-LTLFireability-04
FORMULA_NAME LamportFastMutEx-PT-5-LTLFireability-05
FORMULA_NAME LamportFastMutEx-PT-5-LTLFireability-06
FORMULA_NAME LamportFastMutEx-PT-5-LTLFireability-07
FORMULA_NAME LamportFastMutEx-PT-5-LTLFireability-08
FORMULA_NAME LamportFastMutEx-PT-5-LTLFireability-09
FORMULA_NAME LamportFastMutEx-PT-5-LTLFireability-10
FORMULA_NAME LamportFastMutEx-PT-5-LTLFireability-11
FORMULA_NAME LamportFastMutEx-PT-5-LTLFireability-12
FORMULA_NAME LamportFastMutEx-PT-5-LTLFireability-13
FORMULA_NAME LamportFastMutEx-PT-5-LTLFireability-14
FORMULA_NAME LamportFastMutEx-PT-5-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748882148359

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-5
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-02 16:35:49] [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:35:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 16:35:49] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2025-06-02 16:35:49] [INFO ] Transformed 174 places.
[2025-06-02 16:35:49] [INFO ] Transformed 318 transitions.
[2025-06-02 16:35:49] [INFO ] Found NUPN structural information;
[2025-06-02 16:35:49] [INFO ] Completing missing partition info from NUPN : creating a component with [P_start_1_0, P_start_1_1, P_start_1_2, P_start_1_3, P_start_1_4, P_start_1_5, P_b_0_false, P_b_0_true, P_b_1_false, P_b_1_true, P_b_2_false, P_b_2_true, P_b_3_false, P_b_3_true, P_b_4_false, P_b_4_true, P_b_5_false, P_b_5_true, P_setx_3_0, P_setx_3_1, P_setx_3_2, P_setx_3_3, P_setx_3_4, P_setx_3_5, P_setbi_5_0, P_setbi_5_1, P_setbi_5_2, P_setbi_5_3, P_setbi_5_4, P_setbi_5_5, P_ify0_4_0, P_ify0_4_1, P_ify0_4_2, P_ify0_4_3, P_ify0_4_4, P_ify0_4_5, P_sety_9_0, P_sety_9_1, P_sety_9_2, P_sety_9_3, P_sety_9_4, P_sety_9_5, P_ifxi_10_0, P_ifxi_10_1, P_ifxi_10_2, P_ifxi_10_3, P_ifxi_10_4, P_ifxi_10_5, P_setbi_11_0, P_setbi_11_1, P_setbi_11_2, P_setbi_11_3, P_setbi_11_4, P_setbi_11_5, P_fordo_12_0, P_fordo_12_1, P_fordo_12_2, P_fordo_12_3, P_fordo_12_4, P_fordo_12_5, P_wait_0_0, P_wait_0_1, P_wait_0_2, P_wait_0_3, P_wait_0_4, P_wait_0_5, P_wait_1_0, P_wait_1_1, P_wait_1_2, P_wait_1_3, P_wait_1_4, P_wait_1_5, P_wait_2_0, P_wait_2_1, P_wait_2_2, P_wait_2_3, P_wait_2_4, P_wait_2_5, P_wait_3_0, P_wait_3_1, P_wait_3_2, P_wait_3_3, P_wait_3_4, P_wait_3_5, P_wait_4_0, P_wait_4_1, P_wait_4_2, P_wait_4_3, P_wait_4_4, P_wait_4_5, P_wait_5_0, P_wait_5_1, P_wait_5_2, P_wait_5_3, P_wait_5_4, P_wait_5_5, P_await_13_0, P_await_13_1, P_await_13_2, P_await_13_3, P_await_13_4, P_await_13_5, P_done_0_0, P_done_0_1, P_done_0_2, P_done_0_3, P_done_0_4, P_done_0_5, P_done_1_0, P_done_1_1, P_done_1_2, P_done_1_3, P_done_1_4, P_done_1_5, P_done_2_0, P_done_2_1, P_done_2_2, P_done_2_3, P_done_2_4, P_done_2_5, P_done_3_0, P_done_3_1, P_done_3_2, P_done_3_3, P_done_3_4, P_done_3_5, P_done_4_0, P_done_4_1, P_done_4_2, P_done_4_3, P_done_4_4, P_done_4_5, P_done_5_0, P_done_5_1, P_done_5_2, P_done_5_3, P_done_5_4, P_done_5_5, P_ifyi_15_0, P_ifyi_15_1, P_ifyi_15_2, P_ifyi_15_3, P_ifyi_15_4, P_ifyi_15_5, P_awaity_0, P_awaity_1, P_awaity_2, P_awaity_3, P_awaity_4, P_awaity_5, P_CS_21_0, P_CS_21_1, P_CS_21_2, P_CS_21_3, P_CS_21_4, P_CS_21_5, P_setbi_24_0, P_setbi_24_1, P_setbi_24_2, P_setbi_24_3, P_setbi_24_4, P_setbi_24_5]
[2025-06-02 16:35:50] [INFO ] Parsed PT model containing 174 places and 318 transitions and 1380 arcs in 201 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 58 transitions.
FORMULA LamportFastMutEx-PT-5-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 61 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 260/260 transitions.
Applied a total of 0 rules in 11 ms. Remains 137 /137 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2025-06-02 16:35:50] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2025-06-02 16:35:50] [INFO ] Computed 37 invariants in 25 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:35:51] [INFO ] Implicit Places using invariants in 1676 ms returned [87, 89, 90, 91]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 1715 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 133/137 places, 260/260 transitions.
Applied a total of 0 rules in 5 ms. Remains 133 /133 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1746 ms. Remains : 133/137 places, 260/260 transitions.
Support contains 61 out of 133 places after structural reductions.
[2025-06-02 16:35:52] [INFO ] Flatten gal took : 45 ms
[2025-06-02 16:35:52] [INFO ] Flatten gal took : 29 ms
[2025-06-02 16:35:52] [INFO ] Input system was already deterministic with 260 transitions.
Reduction of identical properties reduced properties to check from 31 to 28
RANDOM walk for 40000 steps (8 resets) in 2293 ms. (17 steps per ms) remains 5/28 properties
BEST_FIRST walk for 40004 steps (8 resets) in 322 ms. (123 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 201 ms. (198 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 117 ms. (339 steps per ms) remains 5/5 properties
[2025-06-02 16:35:53] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 133 cols
[2025-06-02 16:35:53] [INFO ] Computed 33 invariants in 4 ms
[2025-06-02 16:35:53] [INFO ] State equation strengthened by 35 read => feed constraints.
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: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 95/107 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 95/133 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:35:53] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:35:53] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:35:53] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:35:54] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 4 ms to minimize.
Problem AtomicPropp14 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:35:54] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:35:54] [INFO ] Deduced a trap composed of 7 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:35:54] [INFO ] Deduced a trap composed of 7 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:35:54] [INFO ] Deduced a trap composed of 7 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:35:54] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 3 ms to minimize.
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
After SMT solving in domain Real declared 107/333 variables, and 142 constraints, problems are : Problem set: 5 solved, 0 unsolved in 865 ms.
Refiners :[Domain max(s): 107/133 constraints, Positive P Invariants (semi-flows): 26/33 constraints, State Equation: 0/133 constraints, ReadFeed: 0/35 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 900ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 6 atomic propositions for a total of 15 simplifications.
FORMULA LamportFastMutEx-PT-5-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-5-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 5 stable transitions
FORMULA LamportFastMutEx-PT-5-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 11 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 260/260 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 133 transition count 256
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 129 transition count 256
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 18 place count 124 transition count 251
Applied a total of 18 rules in 30 ms. Remains 124 /133 variables (removed 9) and now considering 251/260 (removed 9) transitions.
[2025-06-02 16:35:54] [INFO ] Flow matrix only has 191 transitions (discarded 60 similar events)
// Phase 1: matrix 191 rows 124 cols
[2025-06-02 16:35:54] [INFO ] Computed 33 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:35:54] [INFO ] Implicit Places using invariants in 111 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 113 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 123/133 places, 251/260 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 123 transition count 250
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 122 transition count 250
Applied a total of 2 rules in 12 ms. Remains 122 /123 variables (removed 1) and now considering 250/251 (removed 1) transitions.
[2025-06-02 16:35:54] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2025-06-02 16:35:54] [INFO ] Computed 32 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:35:55] [INFO ] Implicit Places using invariants in 105 ms returned []
[2025-06-02 16:35:55] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
[2025-06-02 16:35:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:35:55] [INFO ] State equation strengthened by 30 read => feed constraints.
[2025-06-02 16:35:55] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 122/133 places, 250/260 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 485 ms. Remains : 122/133 places, 250/260 transitions.
Stuttering acceptance computed with spot in 172 ms :[(NOT p0)]
Running random walk in product with property : LamportFastMutEx-PT-5-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 581 ms.
Stack based approach found an accepted trace after 117 steps with 0 reset with depth 118 and stack size 118 in 1 ms.
FORMULA LamportFastMutEx-PT-5-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-PT-5-LTLFireability-00 finished in 1311 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 U X(p0))))'
Support contains 11 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 260/260 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 133 transition count 256
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 129 transition count 256
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 18 place count 124 transition count 251
Applied a total of 18 rules in 19 ms. Remains 124 /133 variables (removed 9) and now considering 251/260 (removed 9) transitions.
[2025-06-02 16:35:56] [INFO ] Flow matrix only has 191 transitions (discarded 60 similar events)
// Phase 1: matrix 191 rows 124 cols
[2025-06-02 16:35:56] [INFO ] Computed 33 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:35:56] [INFO ] Implicit Places using invariants in 105 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 106 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 123/133 places, 251/260 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 123 transition count 250
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 122 transition count 250
Applied a total of 2 rules in 10 ms. Remains 122 /123 variables (removed 1) and now considering 250/251 (removed 1) transitions.
[2025-06-02 16:35:56] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2025-06-02 16:35:56] [INFO ] Computed 32 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:35:56] [INFO ] Implicit Places using invariants in 127 ms returned []
[2025-06-02 16:35:56] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
[2025-06-02 16:35:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:35:56] [INFO ] State equation strengthened by 30 read => feed constraints.
[2025-06-02 16:35:56] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 122/133 places, 250/260 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 491 ms. Remains : 122/133 places, 250/260 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), true, (NOT p0)]
Running random walk in product with property : LamportFastMutEx-PT-5-LTLFireability-01
Entered a terminal (fully accepting) state of product in 15 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-PT-5-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-5-LTLFireability-01 finished in 603 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((p0&&G(p1))))'
Support contains 26 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 260/260 transitions.
Applied a total of 0 rules in 3 ms. Remains 133 /133 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2025-06-02 16:35:56] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 133 cols
[2025-06-02 16:35:56] [INFO ] Computed 33 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:35:56] [INFO ] Implicit Places using invariants in 97 ms returned [87]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 99 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/133 places, 260/260 transitions.
Applied a total of 0 rules in 2 ms. Remains 132 /132 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 105 ms. Remains : 132/133 places, 260/260 transitions.
Stuttering acceptance computed with spot in 129 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : LamportFastMutEx-PT-5-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-PT-5-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-5-LTLFireability-02 finished in 249 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 U (G(!p0)||p1)) U (G((!p0 U (p1||G(!p0))))||(X(F((!p2&&X((!p2 U (X(!p2)||G(!p2)))))))&&(!p0 U (p1||G(!p0)))))))))'
Support contains 26 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 260/260 transitions.
Applied a total of 0 rules in 3 ms. Remains 133 /133 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2025-06-02 16:35:56] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
[2025-06-02 16:35:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:35:57] [INFO ] Implicit Places using invariants in 103 ms returned [87]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 104 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/133 places, 260/260 transitions.
Applied a total of 0 rules in 2 ms. Remains 132 /132 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 109 ms. Remains : 132/133 places, 260/260 transitions.
Stuttering acceptance computed with spot in 244 ms :[(AND p0 (NOT p1)), (AND p0 p2 (NOT p1)), (AND p0 (NOT p1)), (AND p0 p2 (NOT p1)), (AND p0 p2 (NOT p1)), (AND p0 p2 (NOT p1))]
Running random walk in product with property : LamportFastMutEx-PT-5-LTLFireability-03
Product exploration explored 100000 steps with 1175 reset in 571 ms.
Product exploration explored 100000 steps with 1151 reset in 626 ms.
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p2)), (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 122 ms. Reduced automaton from 6 states, 18 edges and 3 AP (stutter sensitive) to 6 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 268 ms :[(AND p0 (NOT p1)), (AND p0 p2 (NOT p1)), (AND p0 (NOT p1)), (AND p0 p2 (NOT p1)), (AND p0 p2 (NOT p1)), (AND p0 p2 (NOT p1))]
RANDOM walk for 5829 steps (1 resets) in 71 ms. (80 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p2)), (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1)))), (F (NOT (OR (NOT p0) p2 p1))), (F p0), (F (NOT (OR p0 p1))), (F p2), (F (NOT (AND (OR p0 (NOT p2)) (OR (NOT p2) (NOT p1))))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 19 factoid took 371 ms. Reduced automaton from 6 states, 18 edges and 3 AP (stutter sensitive) to 6 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 269 ms :[(AND p0 (NOT p1)), (AND p0 p2 (NOT p1)), (AND p0 (NOT p1)), (AND p0 p2 (NOT p1)), (AND p0 p2 (NOT p1)), (AND p0 p2 (NOT p1))]
Stuttering acceptance computed with spot in 260 ms :[(AND p0 (NOT p1)), (AND p0 p2 (NOT p1)), (AND p0 (NOT p1)), (AND p0 p2 (NOT p1)), (AND p0 p2 (NOT p1)), (AND p0 p2 (NOT p1))]
Support contains 26 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 260/260 transitions.
Applied a total of 0 rules in 4 ms. Remains 132 /132 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2025-06-02 16:35:59] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 132 cols
[2025-06-02 16:35:59] [INFO ] Computed 32 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:35:59] [INFO ] Implicit Places using invariants in 100 ms returned []
[2025-06-02 16:36:00] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
[2025-06-02 16:36:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:36:00] [INFO ] State equation strengthened by 30 read => feed constraints.
[2025-06-02 16:36:00] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2025-06-02 16:36:00] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
[2025-06-02 16:36:00] [INFO ] Invariant cache hit.
[2025-06-02 16:36:00] [INFO ] State equation strengthened by 30 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 132/132 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 32/164 constraints. Problems are: Problem set: 0 solved, 255 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:01] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 7 ms to minimize.
Problem TDEAD1 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:01] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 7 ms to minimize.
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:01] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 7 ms to minimize.
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:01] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 7 ms to minimize.
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:01] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 5 ms to minimize.
Problem TDEAD9 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:01] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:01] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:01] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:01] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:01] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:01] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:02] [INFO ] Deduced a trap composed of 9 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:36:02] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:02] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:02] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:02] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:02] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 4 ms to minimize.
Problem TDEAD40 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:02] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:02] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:02] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 6 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD146 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 20/184 constraints. Problems are: Problem set: 19 solved, 236 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:02] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:02] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:02] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:02] [INFO ] Deduced a trap composed of 7 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:36:02] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:02] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:03] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:03] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:03] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 3 ms to minimize.
Problem TDEAD65 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:03] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 3 ms to minimize.
Problem TDEAD67 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:03] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 3 ms to minimize.
Problem TDEAD73 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:03] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:03] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:03] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:03] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 2 ms to minimize.
Problem TDEAD115 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:03] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:04] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 7 ms to minimize.
Problem TDEAD120 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:04] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 6 ms to minimize.
Problem TDEAD125 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD142 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:04] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:04] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 4 ms to minimize.
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD148 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 20/204 constraints. Problems are: Problem set: 30 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:05] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:05] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:05] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:05] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:05] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:05] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:05] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:05] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:06] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:06] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:06] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:06] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:06] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:06] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:06] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:06] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:06] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:06] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 18/222 constraints. Problems are: Problem set: 30 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:07] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:07] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:07] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:07] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:08] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:08] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:08] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:08] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:08] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:08] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:08] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:08] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:08] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:08] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 14/236 constraints. Problems are: Problem set: 30 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:09] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:09] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:09] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:10] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:10] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 5/241 constraints. Problems are: Problem set: 30 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:11] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:11] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:11] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 3/244 constraints. Problems are: Problem set: 30 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:12] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:12] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 2/246 constraints. Problems are: Problem set: 30 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:13] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:13] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:13] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:14] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 4/250 constraints. Problems are: Problem set: 30 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:15] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 8 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/132 variables, 1/251 constraints. Problems are: Problem set: 30 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:16] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 8 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/132 variables, 1/252 constraints. Problems are: Problem set: 30 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:17] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/132 variables, 1/253 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/132 variables, 0/253 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 14 (OVERLAPS) 200/332 variables, 132/385 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/332 variables, 30/415 constraints. Problems are: Problem set: 30 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:22] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 8 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/332 variables, 1/416 constraints. Problems are: Problem set: 30 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:24] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:25] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 4 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/332 variables, 2/418 constraints. Problems are: Problem set: 30 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:27] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:27] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:27] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:27] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:28] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:28] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:28] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 8 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/332 variables, 7/425 constraints. Problems are: Problem set: 30 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 332/332 variables, and 425 constraints, problems are : Problem set: 30 solved, 225 unsolved in 30020 ms.
Refiners :[Domain max(s): 132/132 constraints, Positive P Invariants (semi-flows): 32/32 constraints, State Equation: 132/132 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 99/99 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 30 solved, 225 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 7/134 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 75/209 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/209 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 4 (OVERLAPS) 5/132 variables, 25/234 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 5/239 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 24/263 constraints. Problems are: Problem set: 30 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:31] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 1/264 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/264 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 9 (OVERLAPS) 200/332 variables, 132/396 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 30/426 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 225/651 constraints. Problems are: Problem set: 30 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:37] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:41] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 8 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/332 variables, 2/653 constraints. Problems are: Problem set: 30 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:36:51] [INFO ] Deduced a trap along path composed of 5 places in 38 ms of which 11 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/332 variables, 1/654 constraints. Problems are: Problem set: 30 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 332/332 variables, and 654 constraints, problems are : Problem set: 30 solved, 225 unsolved in 30018 ms.
Refiners :[Domain max(s): 132/132 constraints, Positive P Invariants (semi-flows): 32/32 constraints, State Equation: 132/132 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 225/255 constraints, Known Traps: 102/102 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60110ms problems are : Problem set: 30 solved, 225 unsolved
Search for dead transitions found 30 dead transitions in 60113ms
Found 30 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 30 transitions
Dead transitions reduction (with SMT) removed 30 transitions
Starting structural reductions in LTL mode, iteration 1 : 132/132 places, 230/260 transitions.
Applied a total of 0 rules in 5 ms. Remains 132 /132 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60471 ms. Remains : 132/132 places, 230/260 transitions.
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (OR (AND (NOT p0) p2) (AND p2 p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p2 p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 123 ms. Reduced automaton from 6 states, 18 edges and 3 AP (stutter sensitive) to 6 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[(AND p0 (NOT p1)), (AND p0 p2 (NOT p1)), (AND p0 (NOT p1)), (AND p0 p2 (NOT p1)), (AND p0 p2 (NOT p1)), (AND p0 p2 (NOT p1))]
RANDOM walk for 6117 steps (0 resets) in 54 ms. (111 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (OR (AND (NOT p0) p2) (AND p2 p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p2 p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1)))), (F (NOT (OR (NOT p0) p2 p1))), (F p0), (F (NOT (OR p0 p1))), (F p2), (F (NOT (AND (OR p0 (NOT p2)) (OR (NOT p2) (NOT p1))))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 19 factoid took 438 ms. Reduced automaton from 6 states, 18 edges and 3 AP (stutter sensitive) to 6 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[(AND p0 (NOT p1)), (AND p0 p2 (NOT p1)), (AND p0 (NOT p1)), (AND p0 p2 (NOT p1)), (AND p0 p2 (NOT p1)), (AND p0 p2 (NOT p1))]
Stuttering acceptance computed with spot in 253 ms :[(AND p0 (NOT p1)), (AND p0 p2 (NOT p1)), (AND p0 (NOT p1)), (AND p0 p2 (NOT p1)), (AND p0 p2 (NOT p1)), (AND p0 p2 (NOT p1))]
Stuttering acceptance computed with spot in 274 ms :[(AND p0 (NOT p1)), (AND p0 p2 (NOT p1)), (AND p0 (NOT p1)), (AND p0 p2 (NOT p1)), (AND p0 p2 (NOT p1)), (AND p0 p2 (NOT p1))]
Product exploration explored 100000 steps with 1173 reset in 506 ms.
Product exploration explored 100000 steps with 1186 reset in 525 ms.
Applying partial POR strategy [false, false, true, false, false, false]
Stuttering acceptance computed with spot in 264 ms :[(AND p0 (NOT p1)), (AND p0 p2 (NOT p1)), (AND p0 (NOT p1)), (AND p0 p2 (NOT p1)), (AND p0 p2 (NOT p1)), (AND p0 p2 (NOT p1))]
Support contains 26 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 230/230 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 132 transition count 230
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 5 rules in 17 ms. Remains 132 /132 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:37:03] [INFO ] Redundant transitions in 8 ms returned []
Running 225 sub problems to find dead transitions.
[2025-06-02 16:37:03] [INFO ] Flow matrix only has 180 transitions (discarded 50 similar events)
// Phase 1: matrix 180 rows 132 cols
[2025-06-02 16:37:03] [INFO ] Computed 32 invariants in 2 ms
[2025-06-02 16:37:03] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 7/134 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (OVERLAPS) 5/132 variables, 25/159 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 5/164 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:05] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:05] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:06] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:06] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:06] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:06] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:06] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:06] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:06] [INFO ] Deduced a trap composed of 12 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:37:06] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:06] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:06] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:06] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:06] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:06] [INFO ] Deduced a trap composed of 11 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:37:07] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:07] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:07] [INFO ] Deduced a trap composed of 9 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:37:07] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:07] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 20/184 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:07] [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:37:07] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:07] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:07] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 3 ms to minimize.
Problem TDEAD115 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:08] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:08] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:08] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:08] [INFO ] Deduced a trap composed of 9 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:37:08] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:08] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:08] [INFO ] Deduced a trap composed of 13 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:37:08] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:08] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:08] [INFO ] Deduced a trap composed of 13 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:37:08] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:08] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:08] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:08] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:09] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:09] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 7 ms to minimize.
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 20/204 constraints. Problems are: Problem set: 5 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:10] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:10] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:10] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:10] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:10] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:10] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:10] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:10] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:11] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:11] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:11] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:11] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:11] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:11] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:11] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:11] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 16/220 constraints. Problems are: Problem set: 5 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:11] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:12] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:12] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:12] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:12] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:12] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 6/226 constraints. Problems are: Problem set: 5 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:13] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 1/227 constraints. Problems are: Problem set: 5 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:15] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:15] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:15] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:15] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 9 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/132 variables, 4/231 constraints. Problems are: Problem set: 5 solved, 220 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/132 variables, 0/231 constraints. Problems are: Problem set: 5 solved, 220 unsolved
At refinement iteration 12 (OVERLAPS) 180/312 variables, 132/363 constraints. Problems are: Problem set: 5 solved, 220 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/312 variables, 25/388 constraints. Problems are: Problem set: 5 solved, 220 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/312 variables, 0/388 constraints. Problems are: Problem set: 5 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:22] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:22] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 7 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/312 variables, 2/390 constraints. Problems are: Problem set: 5 solved, 220 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/312 variables, 0/390 constraints. Problems are: Problem set: 5 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:28] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 7 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/312 variables, 1/391 constraints. Problems are: Problem set: 5 solved, 220 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/312 variables, 0/391 constraints. Problems are: Problem set: 5 solved, 220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 312/312 variables, and 391 constraints, problems are : Problem set: 5 solved, 220 unsolved in 30018 ms.
Refiners :[Domain max(s): 132/132 constraints, Positive P Invariants (semi-flows): 32/32 constraints, State Equation: 132/132 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 70/70 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 220 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 5 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 7/129 constraints. Problems are: Problem set: 5 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 47/176 constraints. Problems are: Problem set: 5 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/176 constraints. Problems are: Problem set: 5 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 10/132 variables, 25/201 constraints. Problems are: Problem set: 5 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 10/211 constraints. Problems are: Problem set: 5 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 23/234 constraints. Problems are: Problem set: 5 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:34] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:35] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 2/236 constraints. Problems are: Problem set: 5 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:36] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 1/237 constraints. Problems are: Problem set: 5 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:37] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:37] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:37] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 3/240 constraints. Problems are: Problem set: 5 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:37] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:37] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:37] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:38] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:38] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:38] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:38] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:38] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:39] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 8 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/132 variables, 9/249 constraints. Problems are: Problem set: 5 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:39] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:39] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 8 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/132 variables, 2/251 constraints. Problems are: Problem set: 5 solved, 220 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/132 variables, 0/251 constraints. Problems are: Problem set: 5 solved, 220 unsolved
At refinement iteration 13 (OVERLAPS) 180/312 variables, 132/383 constraints. Problems are: Problem set: 5 solved, 220 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/312 variables, 25/408 constraints. Problems are: Problem set: 5 solved, 220 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/312 variables, 220/628 constraints. Problems are: Problem set: 5 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:47] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:48] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 7 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/312 variables, 2/630 constraints. Problems are: Problem set: 5 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:52] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:55] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:55] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:56] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:56] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:37:57] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 6 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/312 variables, 6/636 constraints. Problems are: Problem set: 5 solved, 220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 312/312 variables, and 636 constraints, problems are : Problem set: 5 solved, 220 unsolved in 30029 ms.
Refiners :[Domain max(s): 132/132 constraints, Positive P Invariants (semi-flows): 32/32 constraints, State Equation: 132/132 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 220/225 constraints, Known Traps: 95/95 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60088ms problems are : Problem set: 5 solved, 220 unsolved
Search for dead transitions found 5 dead transitions in 60089ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) removed 5 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 132/132 places, 225/230 transitions.
Graph (complete) has 606 edges and 132 vertex of which 127 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 12 ms. Remains 127 /132 variables (removed 5) and now considering 225/225 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 127/132 places, 225/230 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60138 ms. Remains : 127/132 places, 225/230 transitions.
Built C files in :
/tmp/ltsmin13863457276329958768
[2025-06-02 16:38:03] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13863457276329958768
Running compilation step : cd /tmp/ltsmin13863457276329958768;'/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 570 ms.
Running link step : cd /tmp/ltsmin13863457276329958768;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin13863457276329958768;'/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/stateBased1916276209760162621.hoa' '--buchi-type=spotba'
LTSmin run took 145 ms.
FORMULA LamportFastMutEx-PT-5-LTLFireability-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property LamportFastMutEx-PT-5-LTLFireability-03 finished in 127638 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 11 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 260/260 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 133 transition count 256
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 129 transition count 256
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 18 place count 124 transition count 251
Applied a total of 18 rules in 18 ms. Remains 124 /133 variables (removed 9) and now considering 251/260 (removed 9) transitions.
[2025-06-02 16:38:04] [INFO ] Flow matrix only has 191 transitions (discarded 60 similar events)
// Phase 1: matrix 191 rows 124 cols
[2025-06-02 16:38:04] [INFO ] Computed 33 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:38:04] [INFO ] Implicit Places using invariants in 110 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 111 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 123/133 places, 251/260 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 123 transition count 250
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 122 transition count 250
Applied a total of 2 rules in 7 ms. Remains 122 /123 variables (removed 1) and now considering 250/251 (removed 1) transitions.
[2025-06-02 16:38:04] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2025-06-02 16:38:04] [INFO ] Computed 32 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:38:04] [INFO ] Implicit Places using invariants in 112 ms returned []
[2025-06-02 16:38:04] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
[2025-06-02 16:38:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:38:04] [INFO ] State equation strengthened by 30 read => feed constraints.
[2025-06-02 16:38:05] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 122/133 places, 250/260 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 455 ms. Remains : 122/133 places, 250/260 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : LamportFastMutEx-PT-5-LTLFireability-04
Product exploration explored 100000 steps with 3229 reset in 316 ms.
Product exploration explored 100000 steps with 3248 reset in 316 ms.
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
RANDOM walk for 126 steps (0 resets) in 6 ms. (18 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
[2025-06-02 16:38:06] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
[2025-06-02 16:38:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 16:38:06] [INFO ] [Real]Absence check using 32 positive place invariants in 16 ms returned sat
[2025-06-02 16:38:06] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2025-06-02 16:38:06] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 16:38:06] [INFO ] [Nat]Absence check using 32 positive place invariants in 13 ms returned sat
[2025-06-02 16:38:06] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2025-06-02 16:38:06] [INFO ] State equation strengthened by 30 read => feed constraints.
[2025-06-02 16:38:06] [INFO ] [Nat]Added 30 Read/Feed constraints in 11 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:06] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:06] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:06] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:06] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 6 ms to minimize.
[2025-06-02 16:38:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 330 ms
[2025-06-02 16:38:06] [INFO ] Computed and/alt/rep : 160/720/160 causal constraints (skipped 25 transitions) in 15 ms.
[2025-06-02 16:38:07] [INFO ] Added : 78 causal constraints over 16 iterations in 297 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 11 out of 122 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 122/122 places, 250/250 transitions.
Applied a total of 0 rules in 8 ms. Remains 122 /122 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2025-06-02 16:38:07] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
[2025-06-02 16:38:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:38:07] [INFO ] Implicit Places using invariants in 103 ms returned []
[2025-06-02 16:38:07] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
[2025-06-02 16:38:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:38:07] [INFO ] State equation strengthened by 30 read => feed constraints.
[2025-06-02 16:38:07] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:38:07] [INFO ] Redundant transitions in 11 ms returned []
Running 245 sub problems to find dead transitions.
[2025-06-02 16:38:07] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
[2025-06-02 16:38:07] [INFO ] Invariant cache hit.
[2025-06-02 16:38:07] [INFO ] State equation strengthened by 30 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 32/154 constraints. Problems are: Problem set: 0 solved, 245 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:08] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:08] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 7 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:08] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 5 ms to minimize.
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:08] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:08] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:08] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 2 ms to minimize.
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:08] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 4 ms to minimize.
Problem TDEAD9 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:08] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:08] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:08] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:09] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:09] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:09] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:09] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:09] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:09] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:09] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:09] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 5 ms to minimize.
Problem TDEAD40 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:09] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:09] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 7 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD242 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 20/174 constraints. Problems are: Problem set: 20 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:09] [INFO ] Deduced a trap composed of 7 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:38:09] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:10] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:10] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:10] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:10] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:10] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 3 ms to minimize.
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:10] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 3 ms to minimize.
Problem TDEAD69 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:10] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 2 ms to minimize.
Problem TDEAD71 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:10] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:10] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:10] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:10] [INFO ] Deduced a trap composed of 26 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:38:10] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:11] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:11] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:11] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:11] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:11] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 2 ms to minimize.
Problem TDEAD115 is UNSAT
Problem TDEAD130 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:11] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 8 ms to minimize.
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD240 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 20/194 constraints. Problems are: Problem set: 30 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:12] [INFO ] Deduced a trap composed of 14 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:38:12] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:12] [INFO ] Deduced a trap composed of 14 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:38:12] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:12] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:12] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:12] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:13] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:13] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:13] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:13] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:13] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:13] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:13] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:13] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:13] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:13] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:13] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:14] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:14] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 20/214 constraints. Problems are: Problem set: 30 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:14] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:14] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:15] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:15] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:15] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:15] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:15] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:15] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:15] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:15] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:15] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:15] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 12/226 constraints. Problems are: Problem set: 30 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:16] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:16] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:16] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 3/229 constraints. Problems are: Problem set: 30 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:18] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:18] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 2/231 constraints. Problems are: Problem set: 30 solved, 215 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/231 constraints. Problems are: Problem set: 30 solved, 215 unsolved
At refinement iteration 9 (OVERLAPS) 190/312 variables, 122/353 constraints. Problems are: Problem set: 30 solved, 215 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 30/383 constraints. Problems are: Problem set: 30 solved, 215 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/312 variables, 0/383 constraints. Problems are: Problem set: 30 solved, 215 unsolved
At refinement iteration 12 (OVERLAPS) 0/312 variables, 0/383 constraints. Problems are: Problem set: 30 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 312/312 variables, and 383 constraints, problems are : Problem set: 30 solved, 215 unsolved in 21174 ms.
Refiners :[Domain max(s): 122/122 constraints, Positive P Invariants (semi-flows): 32/32 constraints, State Equation: 122/122 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 245/245 constraints, Known Traps: 77/77 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 30 solved, 215 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 117/117 constraints. Problems are: Problem set: 30 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 7/124 constraints. Problems are: Problem set: 30 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 52/176 constraints. Problems are: Problem set: 30 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/176 constraints. Problems are: Problem set: 30 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 5/122 variables, 25/201 constraints. Problems are: Problem set: 30 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 5/206 constraints. Problems are: Problem set: 30 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 25/231 constraints. Problems are: Problem set: 30 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/231 constraints. Problems are: Problem set: 30 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 190/312 variables, 122/353 constraints. Problems are: Problem set: 30 solved, 215 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 30/383 constraints. Problems are: Problem set: 30 solved, 215 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 215/598 constraints. Problems are: Problem set: 30 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:35] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:36] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:36] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:36] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:37] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 8 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/312 variables, 5/603 constraints. Problems are: Problem set: 30 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:43] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:43] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:43] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:43] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:43] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:44] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:44] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:44] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:44] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:45] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:46] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:46] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:47] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:47] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 9 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/312 variables, 14/617 constraints. Problems are: Problem set: 30 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:54] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:54] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:54] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:55] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:55] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:55] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:56] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:56] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:56] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/312 variables, 9/626 constraints. Problems are: Problem set: 30 solved, 215 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 312/312 variables, and 626 constraints, problems are : Problem set: 30 solved, 215 unsolved in 30013 ms.
Refiners :[Domain max(s): 122/122 constraints, Positive P Invariants (semi-flows): 32/32 constraints, State Equation: 122/122 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 215/245 constraints, Known Traps: 105/105 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51236ms problems are : Problem set: 30 solved, 215 unsolved
Search for dead transitions found 30 dead transitions in 51237ms
Found 30 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 30 transitions
Dead transitions reduction (with SMT) removed 30 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 122/122 places, 220/250 transitions.
Applied a total of 0 rules in 5 ms. Remains 122 /122 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:38:58] [INFO ] Redundant transitions in 4 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 51615 ms. Remains : 122/122 places, 220/250 transitions.
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
RANDOM walk for 104 steps (0 resets) in 4 ms. (20 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
[2025-06-02 16:38:59] [INFO ] Flow matrix only has 170 transitions (discarded 50 similar events)
// Phase 1: matrix 170 rows 122 cols
[2025-06-02 16:38:59] [INFO ] Computed 32 invariants in 1 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 16:38:59] [INFO ] [Real]Absence check using 32 positive place invariants in 12 ms returned sat
[2025-06-02 16:38:59] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2025-06-02 16:38:59] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 16:38:59] [INFO ] [Nat]Absence check using 32 positive place invariants in 13 ms returned sat
[2025-06-02 16:38:59] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2025-06-02 16:38:59] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-06-02 16:38:59] [INFO ] [Nat]Added 25 Read/Feed constraints in 13 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:59] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:59] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:38:59] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:00] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:00] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:00] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:00] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 4 ms to minimize.
[2025-06-02 16:39:00] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 505 ms
[2025-06-02 16:39:00] [INFO ] Computed and/alt/rep : 140/615/140 causal constraints (skipped 25 transitions) in 12 ms.
[2025-06-02 16:39:00] [INFO ] Added : 89 causal constraints over 18 iterations in 298 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3221 reset in 310 ms.
Product exploration explored 100000 steps with 3239 reset in 316 ms.
Built C files in :
/tmp/ltsmin5206079767017780800
[2025-06-02 16:39:01] [INFO ] Computing symmetric may disable matrix : 220 transitions.
[2025-06-02 16:39:01] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 16:39:01] [INFO ] Computing symmetric may enable matrix : 220 transitions.
[2025-06-02 16:39:01] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 16:39:01] [INFO ] Computing Do-Not-Accords matrix : 220 transitions.
[2025-06-02 16:39:01] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 16:39:01] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5206079767017780800
Running compilation step : cd /tmp/ltsmin5206079767017780800;'/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 476 ms.
Running link step : cd /tmp/ltsmin5206079767017780800;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin5206079767017780800;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4083146286637809728.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 11 out of 122 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 122/122 places, 220/220 transitions.
Applied a total of 0 rules in 13 ms. Remains 122 /122 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2025-06-02 16:39:16] [INFO ] Flow matrix only has 170 transitions (discarded 50 similar events)
[2025-06-02 16:39:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:39:16] [INFO ] Implicit Places using invariants in 89 ms returned []
[2025-06-02 16:39:16] [INFO ] Flow matrix only has 170 transitions (discarded 50 similar events)
[2025-06-02 16:39:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:39:16] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-06-02 16:39:16] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:39:16] [INFO ] Redundant transitions in 3 ms returned []
Running 215 sub problems to find dead transitions.
[2025-06-02 16:39:16] [INFO ] Flow matrix only has 170 transitions (discarded 50 similar events)
[2025-06-02 16:39:16] [INFO ] Invariant cache hit.
[2025-06-02 16:39:16] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 117/117 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 7/124 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 5/122 variables, 25/149 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 5/154 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:18] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:18] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:18] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:19] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:19] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:19] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:19] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:19] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:19] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:19] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:19] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:19] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:19] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:19] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:19] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:19] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:20] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:20] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:20] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:20] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 20/174 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:20] [INFO ] Deduced a trap composed of 13 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:39:20] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:20] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:20] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:20] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:20] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:20] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:21] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:21] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:21] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:21] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:21] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:21] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:21] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:21] [INFO ] Deduced a trap composed of 7 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:39:21] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:21] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:21] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:21] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:22] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 20/194 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:22] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:22] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:22] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:23] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:23] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:23] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:23] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:23] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:23] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:23] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:23] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:23] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:24] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:24] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:24] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:24] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:24] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:24] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:24] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:24] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 20/214 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:25] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:25] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:25] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:25] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:25] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:25] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:25] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:26] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:26] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:26] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:26] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:26] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:26] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:26] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:26] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 15/229 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:27] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:27] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:27] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:27] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:27] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:28] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 6/235 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:28] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:28] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:29] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:29] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:29] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 5/240 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/122 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 12 (OVERLAPS) 170/292 variables, 122/362 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/292 variables, 25/387 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/292 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 15 (OVERLAPS) 0/292 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 292/292 variables, and 387 constraints, problems are : Problem set: 0 solved, 215 unsolved in 25327 ms.
Refiners :[Domain max(s): 122/122 constraints, Positive P Invariants (semi-flows): 32/32 constraints, State Equation: 122/122 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 86/86 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 117/117 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 7/124 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 62/186 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 5/122 variables, 25/211 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 5/216 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 24/240 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:43] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 9 (OVERLAPS) 170/292 variables, 122/363 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/292 variables, 25/388 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/292 variables, 215/603 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:49] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:50] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:50] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:51] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:51] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:52] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/292 variables, 6/609 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:58] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:58] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:58] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:58] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:58] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:58] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:59] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:59] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:59] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:59] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:39:59] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:40:00] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:40:01] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:40:01] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 9 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/292 variables, 14/623 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:40:10] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:40:10] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:40:11] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:40:11] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 292/292 variables, and 627 constraints, problems are : Problem set: 0 solved, 215 unsolved in 30021 ms.
Refiners :[Domain max(s): 122/122 constraints, Positive P Invariants (semi-flows): 32/32 constraints, State Equation: 122/122 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 111/111 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55382ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 55383ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 55707 ms. Remains : 122/122 places, 220/220 transitions.
Built C files in :
/tmp/ltsmin14075384828405765335
[2025-06-02 16:40:12] [INFO ] Computing symmetric may disable matrix : 220 transitions.
[2025-06-02 16:40:12] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 16:40:12] [INFO ] Computing symmetric may enable matrix : 220 transitions.
[2025-06-02 16:40:12] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 16:40:12] [INFO ] Computing Do-Not-Accords matrix : 220 transitions.
[2025-06-02 16:40:12] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 16:40:12] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14075384828405765335
Running compilation step : cd /tmp/ltsmin14075384828405765335;'/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 451 ms.
Running link step : cd /tmp/ltsmin14075384828405765335;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin14075384828405765335;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10264705580111357629.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-02 16:40:27] [INFO ] Flatten gal took : 12 ms
[2025-06-02 16:40:27] [INFO ] Flatten gal took : 13 ms
[2025-06-02 16:40:27] [INFO ] Time to serialize gal into /tmp/LTL1461784789704697635.gal : 4 ms
[2025-06-02 16:40:27] [INFO ] Time to serialize properties into /tmp/LTL18279199022955239515.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1461784789704697635.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13347588876429862055.hoa' '-atoms' '/tmp/LTL18279199022955239515.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL18279199022955239515.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13347588876429862055.hoa
Detected timeout of ITS tools.
[2025-06-02 16:40:42] [INFO ] Flatten gal took : 12 ms
[2025-06-02 16:40:42] [INFO ] Flatten gal took : 11 ms
[2025-06-02 16:40:42] [INFO ] Time to serialize gal into /tmp/LTL5478256946746701972.gal : 2 ms
[2025-06-02 16:40:42] [INFO ] Time to serialize properties into /tmp/LTL13492021524747917119.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5478256946746701972.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13492021524747917119.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F("(((((((y_4==1)&&(P_CS_21_1==1))||((y_4==1)&&(P_CS_21_3==1)))||(((y_4==1)&&(P_CS_21_2==1))||((y_4==1)&&(P_CS_21_5==1))))||((((y_4...927
Formula 0 simplified : G!"(((((((y_4==1)&&(P_CS_21_1==1))||((y_4==1)&&(P_CS_21_3==1)))||(((y_4==1)&&(P_CS_21_2==1))||((y_4==1)&&(P_CS_21_5==1))))||((((y_4=...923
Detected timeout of ITS tools.
[2025-06-02 16:40:57] [INFO ] Flatten gal took : 12 ms
[2025-06-02 16:40:57] [INFO ] Applying decomposition
[2025-06-02 16:40:57] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4438056596430123256.txt' '-o' '/tmp/graph4438056596430123256.bin' '-w' '/tmp/graph4438056596430123256.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4438056596430123256.bin' '-l' '-1' '-v' '-w' '/tmp/graph4438056596430123256.weights' '-q' '0' '-e' '0.001'
[2025-06-02 16:40:57] [INFO ] Decomposing Gal with order
[2025-06-02 16:40:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 16:40:57] [INFO ] Removed a total of 253 redundant transitions.
[2025-06-02 16:40:57] [INFO ] Flatten gal took : 72 ms
[2025-06-02 16:40:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 59 labels/synchronizations in 10 ms.
[2025-06-02 16:40:57] [INFO ] Time to serialize gal into /tmp/LTL4421382957874649790.gal : 4 ms
[2025-06-02 16:40:57] [INFO ] Time to serialize properties into /tmp/LTL17641737891084980087.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4421382957874649790.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17641737891084980087.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F("(((((((i8.u22.y_4==1)&&(i5.u20.P_CS_21_1==1))||((i8.u22.y_4==1)&&(i6.u23.P_CS_21_3==1)))||(((i8.u22.y_4==1)&&(i1.u21.P_CS_21_2==...1347
Formula 0 simplified : G!"(((((((i8.u22.y_4==1)&&(i5.u20.P_CS_21_1==1))||((i8.u22.y_4==1)&&(i6.u23.P_CS_21_3==1)))||(((i8.u22.y_4==1)&&(i1.u21.P_CS_21_2==1...1343
Detected timeout of ITS tools.
Treatment of property LamportFastMutEx-PT-5-LTLFireability-04 finished in 188303 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)||X(p2)))'
Support contains 26 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 260/260 transitions.
Applied a total of 0 rules in 2 ms. Remains 133 /133 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2025-06-02 16:41:12] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 133 cols
[2025-06-02 16:41:12] [INFO ] Computed 33 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:41:13] [INFO ] Implicit Places using invariants in 206 ms returned [87]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 216 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/133 places, 260/260 transitions.
Applied a total of 0 rules in 1 ms. Remains 132 /132 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 219 ms. Remains : 132/133 places, 260/260 transitions.
Stuttering acceptance computed with spot in 165 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : LamportFastMutEx-PT-5-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-PT-5-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-5-LTLFireability-05 finished in 399 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(F(p1))||(X(X(p2))&&F(p3))))'
Support contains 36 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 260/260 transitions.
Applied a total of 0 rules in 2 ms. Remains 133 /133 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2025-06-02 16:41:13] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
[2025-06-02 16:41:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:41:13] [INFO ] Implicit Places using invariants in 112 ms returned [87]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 128 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/133 places, 260/260 transitions.
Applied a total of 0 rules in 1 ms. Remains 132 /132 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 131 ms. Remains : 132/133 places, 260/260 transitions.
Stuttering acceptance computed with spot in 223 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : LamportFastMutEx-PT-5-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 337 ms.
Product exploration explored 100000 steps with 50000 reset in 344 ms.
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND (NOT p0) p3 p1 (NOT p2)), (X p3), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X p1), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 23 ms. Reduced automaton from 5 states, 6 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LamportFastMutEx-PT-5-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LamportFastMutEx-PT-5-LTLFireability-06 finished in 1088 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)||X(X(X(X(X(F(p1)))))))))'
Support contains 15 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 260/260 transitions.
Applied a total of 0 rules in 12 ms. Remains 133 /133 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2025-06-02 16:41:14] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
[2025-06-02 16:41:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:41:14] [INFO ] Implicit Places using invariants in 136 ms returned [87]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 140 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/133 places, 260/260 transitions.
Applied a total of 0 rules in 4 ms. Remains 132 /132 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 156 ms. Remains : 132/133 places, 260/260 transitions.
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : LamportFastMutEx-PT-5-LTLFireability-07
Product exploration explored 100000 steps with 1303 reset in 206 ms.
Product exploration explored 100000 steps with 1285 reset in 220 ms.
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 147 steps (0 resets) in 11 ms. (12 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 150 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 15 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 260/260 transitions.
Applied a total of 0 rules in 12 ms. Remains 132 /132 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2025-06-02 16:41:15] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 132 cols
[2025-06-02 16:41:15] [INFO ] Computed 32 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:41:15] [INFO ] Implicit Places using invariants in 107 ms returned []
[2025-06-02 16:41:15] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
[2025-06-02 16:41:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:41:15] [INFO ] State equation strengthened by 30 read => feed constraints.
[2025-06-02 16:41:16] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:41:16] [INFO ] Redundant transitions in 3 ms returned []
Running 255 sub problems to find dead transitions.
[2025-06-02 16:41:16] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
[2025-06-02 16:41:16] [INFO ] Invariant cache hit.
[2025-06-02 16:41:16] [INFO ] State equation strengthened by 30 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 132/132 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 32/164 constraints. Problems are: Problem set: 0 solved, 255 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:16] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 9 ms to minimize.
Problem TDEAD1 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:17] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 7 ms to minimize.
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:17] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 7 ms to minimize.
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:17] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 7 ms to minimize.
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:17] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 5 ms to minimize.
Problem TDEAD9 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:17] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:17] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:17] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:17] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:17] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:17] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41: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:41:17] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:18] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:18] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:18] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:18] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 4 ms to minimize.
Problem TDEAD40 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:18] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:18] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:18] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 6 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD146 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 20/184 constraints. Problems are: Problem set: 19 solved, 236 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:18] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:18] [INFO ] Deduced a trap composed of 7 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:41:18] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:18] [INFO ] Deduced a trap composed of 7 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:41:18] [INFO ] Deduced a trap composed of 7 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:41:18] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:19] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:19] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:19] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 2 ms to minimize.
Problem TDEAD65 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:19] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 3 ms to minimize.
Problem TDEAD67 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:19] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 3 ms to minimize.
Problem TDEAD73 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:19] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:19] [INFO ] Deduced a trap composed of 26 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:41:19] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:19] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 2 ms to minimize.
Problem TDEAD115 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:19] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:19] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 8 ms to minimize.
Problem TDEAD120 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:19] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 6 ms to minimize.
Problem TDEAD125 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD142 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:20] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:20] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 3 ms to minimize.
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD148 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 20/204 constraints. Problems are: Problem set: 30 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:20] [INFO ] Deduced a trap composed of 7 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:41:21] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:21] [INFO ] Deduced a trap composed of 14 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:41:21] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:21] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:21] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:21] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:21] [INFO ] Deduced a trap composed of 26 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:41:21] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:21] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:21] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:22] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:22] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:22] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:22] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:22] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:22] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:22] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 18/222 constraints. Problems are: Problem set: 30 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:22] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:23] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:23] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:23] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:23] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:23] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:23] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:23] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:23] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:24] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:24] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:24] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:24] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:24] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 14/236 constraints. Problems are: Problem set: 30 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:25] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:25] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:25] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:25] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:25] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 5/241 constraints. Problems are: Problem set: 30 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:27] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:27] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:27] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 3/244 constraints. Problems are: Problem set: 30 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:28] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:28] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 2/246 constraints. Problems are: Problem set: 30 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:29] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:29] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:29] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:29] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 4/250 constraints. Problems are: Problem set: 30 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:31] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/132 variables, 1/251 constraints. Problems are: Problem set: 30 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:31] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 8 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/132 variables, 1/252 constraints. Problems are: Problem set: 30 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:33] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/132 variables, 1/253 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/132 variables, 0/253 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 14 (OVERLAPS) 200/332 variables, 132/385 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/332 variables, 30/415 constraints. Problems are: Problem set: 30 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:38] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 7 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/332 variables, 1/416 constraints. Problems are: Problem set: 30 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:40] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:41] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 4 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/332 variables, 2/418 constraints. Problems are: Problem set: 30 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:43] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:43] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:43] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:43] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:43] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:43] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:44] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 8 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/332 variables, 7/425 constraints. Problems are: Problem set: 30 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 332/332 variables, and 425 constraints, problems are : Problem set: 30 solved, 225 unsolved in 30016 ms.
Refiners :[Domain max(s): 132/132 constraints, Positive P Invariants (semi-flows): 32/32 constraints, State Equation: 132/132 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 99/99 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 30 solved, 225 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 7/134 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 75/209 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/209 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 4 (OVERLAPS) 5/132 variables, 25/234 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 5/239 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 24/263 constraints. Problems are: Problem set: 30 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:47] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 1/264 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/264 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 9 (OVERLAPS) 200/332 variables, 132/396 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 30/426 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 225/651 constraints. Problems are: Problem set: 30 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:53] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:41:57] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 10 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/332 variables, 2/653 constraints. Problems are: Problem set: 30 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:07] [INFO ] Deduced a trap along path composed of 5 places in 31 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/332 variables, 1/654 constraints. Problems are: Problem set: 30 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 332/332 variables, and 654 constraints, problems are : Problem set: 30 solved, 225 unsolved in 30027 ms.
Refiners :[Domain max(s): 132/132 constraints, Positive P Invariants (semi-flows): 32/32 constraints, State Equation: 132/132 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 225/255 constraints, Known Traps: 102/102 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60084ms problems are : Problem set: 30 solved, 225 unsolved
Search for dead transitions found 30 dead transitions in 60086ms
Found 30 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 30 transitions
Dead transitions reduction (with SMT) removed 30 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 132/132 places, 230/260 transitions.
Applied a total of 0 rules in 7 ms. Remains 132 /132 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:42:16] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 60515 ms. Remains : 132/132 places, 230/260 transitions.
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 102 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 133 steps (0 resets) in 5 ms. (22 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 181 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1305 reset in 201 ms.
Product exploration explored 100000 steps with 1285 reset in 208 ms.
Built C files in :
/tmp/ltsmin15853172381217042601
[2025-06-02 16:42:17] [INFO ] Computing symmetric may disable matrix : 230 transitions.
[2025-06-02 16:42:17] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 16:42:17] [INFO ] Computing symmetric may enable matrix : 230 transitions.
[2025-06-02 16:42:17] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 16:42:17] [INFO ] Computing Do-Not-Accords matrix : 230 transitions.
[2025-06-02 16:42:17] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 16:42:17] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15853172381217042601
Running compilation step : cd /tmp/ltsmin15853172381217042601;'/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 455 ms.
Running link step : cd /tmp/ltsmin15853172381217042601;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin15853172381217042601;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16475540588213210994.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 15 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 230/230 transitions.
Applied a total of 0 rules in 9 ms. Remains 132 /132 variables (removed 0) and now considering 230/230 (removed 0) transitions.
[2025-06-02 16:42:32] [INFO ] Flow matrix only has 180 transitions (discarded 50 similar events)
// Phase 1: matrix 180 rows 132 cols
[2025-06-02 16:42:32] [INFO ] Computed 32 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:42:32] [INFO ] Implicit Places using invariants in 100 ms returned []
[2025-06-02 16:42:32] [INFO ] Flow matrix only has 180 transitions (discarded 50 similar events)
[2025-06-02 16:42:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:42:32] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-06-02 16:42:32] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:42:32] [INFO ] Redundant transitions in 1 ms returned []
Running 225 sub problems to find dead transitions.
[2025-06-02 16:42:32] [INFO ] Flow matrix only has 180 transitions (discarded 50 similar events)
[2025-06-02 16:42:32] [INFO ] Invariant cache hit.
[2025-06-02 16:42:32] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 7/134 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (OVERLAPS) 5/132 variables, 25/159 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 5/164 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:35] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:35] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:35] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:35] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:35] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:35] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:35] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:35] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:35] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:35] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:35] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:35] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:36] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:36] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:36] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:36] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:36] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:36] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:36] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:36] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 20/184 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:36] [INFO ] Deduced a trap composed of 7 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:42:36] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:36] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:37] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:37] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:37] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:37] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:37] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:37] [INFO ] Deduced a trap composed of 9 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:42:37] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:37] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:37] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:37] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:37] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:37] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:38] [INFO ] Deduced a trap composed of 13 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:42:38] [INFO ] Deduced a trap composed of 13 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:42:38] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:38] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:38] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 20/204 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:38] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:39] [INFO ] Deduced a trap composed of 9 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:42:39] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:39] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:39] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:39] [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:42:39] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:39] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:39] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:40] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:40] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:40] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:40] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:40] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:40] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:40] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:40] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:40] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:40] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:40] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 20/224 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:41] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:41] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:41] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:41] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:41] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:41] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:42] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:42] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:42] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 9/233 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:42] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:43] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:43] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:43] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:43] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:43] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 6/239 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:44] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:45] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:45] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 8 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/132 variables, 3/242 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:46] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:46] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:46] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:46] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:46] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 11 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/132 variables, 5/247 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:47] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 8 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/132 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/132 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 14 (OVERLAPS) 180/312 variables, 132/380 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/312 variables, 25/405 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:53] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:53] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:53] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:53] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:42:53] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 8 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/312 variables, 5/410 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/312 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 18 (OVERLAPS) 0/312 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Real declared 312/312 variables, and 410 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30018 ms.
Refiners :[Domain max(s): 132/132 constraints, Positive P Invariants (semi-flows): 32/32 constraints, State Equation: 132/132 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 89/89 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 7/134 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 64/198 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (OVERLAPS) 5/132 variables, 25/223 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 5/228 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 25/253 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:43:04] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:43:06] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 10 (OVERLAPS) 180/312 variables, 132/387 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/312 variables, 25/412 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/312 variables, 225/637 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:43:14] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 7 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/312 variables, 1/638 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:43:21] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:43:21] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:43:21] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:43:22] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 5 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/312 variables, 4/642 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:43:32] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:43:32] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:43:32] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 312/312 variables, and 645 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30020 ms.
Refiners :[Domain max(s): 132/132 constraints, Positive P Invariants (semi-flows): 32/32 constraints, State Equation: 132/132 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 99/99 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60073ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 60074ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60412 ms. Remains : 132/132 places, 230/230 transitions.
Built C files in :
/tmp/ltsmin1343096802447400649
[2025-06-02 16:43:32] [INFO ] Computing symmetric may disable matrix : 230 transitions.
[2025-06-02 16:43:32] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 16:43:32] [INFO ] Computing symmetric may enable matrix : 230 transitions.
[2025-06-02 16:43:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 16:43:32] [INFO ] Computing Do-Not-Accords matrix : 230 transitions.
[2025-06-02 16:43:32] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 16:43:32] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1343096802447400649
Running compilation step : cd /tmp/ltsmin1343096802447400649;'/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 459 ms.
Running link step : cd /tmp/ltsmin1343096802447400649;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin1343096802447400649;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7501887347752682756.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-02 16:43:48] [INFO ] Flatten gal took : 18 ms
[2025-06-02 16:43:48] [INFO ] Flatten gal took : 11 ms
[2025-06-02 16:43:48] [INFO ] Time to serialize gal into /tmp/LTL3084468865090370992.gal : 6 ms
[2025-06-02 16:43:48] [INFO ] Time to serialize properties into /tmp/LTL2044259696657823816.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3084468865090370992.gal' '-t' 'CGAL' '-hoa' '/tmp/aut372183084473136426.hoa' '-atoms' '/tmp/LTL2044259696657823816.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL2044259696657823816.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut372183084473136426.hoa
Detected timeout of ITS tools.
[2025-06-02 16:44:03] [INFO ] Flatten gal took : 11 ms
[2025-06-02 16:44:03] [INFO ] Flatten gal took : 10 ms
[2025-06-02 16:44:03] [INFO ] Time to serialize gal into /tmp/LTL16194941983753876069.gal : 2 ms
[2025-06-02 16:44:03] [INFO ] Time to serialize properties into /tmp/LTL14116301670278392363.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16194941983753876069.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14116301670278392363.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G((F("(((((y_3==0)||(P_ifyi_15_3==0))&&((y_4==0)||(P_ifyi_15_4==0)))&&(((y_1==0)||(P_ifyi_15_1==0))&&((y_2==0)||(P_ifyi_15_2==0))))...317
Formula 0 simplified : F(G!"(((((y_3==0)||(P_ifyi_15_3==0))&&((y_4==0)||(P_ifyi_15_4==0)))&&(((y_1==0)||(P_ifyi_15_1==0))&&((y_2==0)||(P_ifyi_15_2==0))))&&...299
Detected timeout of ITS tools.
[2025-06-02 16:44:18] [INFO ] Flatten gal took : 19 ms
[2025-06-02 16:44:18] [INFO ] Applying decomposition
[2025-06-02 16:44:18] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph18290882282363986480.txt' '-o' '/tmp/graph18290882282363986480.bin' '-w' '/tmp/graph18290882282363986480.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18290882282363986480.bin' '-l' '-1' '-v' '-w' '/tmp/graph18290882282363986480.weights' '-q' '0' '-e' '0.001'
[2025-06-02 16:44:18] [INFO ] Decomposing Gal with order
[2025-06-02 16:44:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 16:44:18] [INFO ] Removed a total of 248 redundant transitions.
[2025-06-02 16:44:18] [INFO ] Flatten gal took : 23 ms
[2025-06-02 16:44:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 75 labels/synchronizations in 6 ms.
[2025-06-02 16:44:18] [INFO ] Time to serialize gal into /tmp/LTL5275793400124326041.gal : 3 ms
[2025-06-02 16:44:18] [INFO ] Time to serialize properties into /tmp/LTL3143466454951983071.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5275793400124326041.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3143466454951983071.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G((F("(((((i6.u45.y_3==0)||(i1.u43.P_ifyi_15_3==0))&&((i6.u45.y_4==0)||(i7.u41.P_ifyi_15_4==0)))&&(((i6.u45.y_1==0)||(i0.u40.P_ifyi...417
Formula 0 simplified : F(G!"(((((i6.u45.y_3==0)||(i1.u43.P_ifyi_15_3==0))&&((i6.u45.y_4==0)||(i7.u41.P_ifyi_15_4==0)))&&(((i6.u45.y_1==0)||(i0.u40.P_ifyi_1...399
Detected timeout of ITS tools.
Treatment of property LamportFastMutEx-PT-5-LTLFireability-07 finished in 199059 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||G(!p0))))'
Support contains 0 out of 133 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 260/260 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 133 transition count 256
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 129 transition count 256
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 18 place count 124 transition count 251
Applied a total of 18 rules in 10 ms. Remains 124 /133 variables (removed 9) and now considering 251/260 (removed 9) transitions.
[2025-06-02 16:44:33] [INFO ] Flow matrix only has 191 transitions (discarded 60 similar events)
// Phase 1: matrix 191 rows 124 cols
[2025-06-02 16:44:33] [INFO ] Computed 33 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:44:33] [INFO ] Implicit Places using invariants in 123 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 125 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 123/133 places, 251/260 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 123 transition count 250
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 122 transition count 250
Applied a total of 2 rules in 5 ms. Remains 122 /123 variables (removed 1) and now considering 250/251 (removed 1) transitions.
[2025-06-02 16:44:33] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2025-06-02 16:44:33] [INFO ] Computed 32 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:44:33] [INFO ] Implicit Places using invariants in 110 ms returned []
[2025-06-02 16:44:33] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
[2025-06-02 16:44:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:44:33] [INFO ] State equation strengthened by 30 read => feed constraints.
[2025-06-02 16:44:33] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 122/133 places, 250/260 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 479 ms. Remains : 122/133 places, 250/260 transitions.
Stuttering acceptance computed with spot in 13 ms :[false]
Running random walk in product with property : LamportFastMutEx-PT-5-LTLFireability-08
Initial state of product has no viable successors after 0 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-PT-5-LTLFireability-08 TRUE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-5-LTLFireability-08 finished in 508 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 2 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 260/260 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 133 transition count 256
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 129 transition count 256
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 18 place count 124 transition count 251
Applied a total of 18 rules in 13 ms. Remains 124 /133 variables (removed 9) and now considering 251/260 (removed 9) transitions.
[2025-06-02 16:44:33] [INFO ] Flow matrix only has 191 transitions (discarded 60 similar events)
// Phase 1: matrix 191 rows 124 cols
[2025-06-02 16:44:33] [INFO ] Computed 33 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:44:34] [INFO ] Implicit Places using invariants in 113 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 114 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 123/133 places, 251/260 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 123 transition count 250
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 122 transition count 250
Applied a total of 2 rules in 5 ms. Remains 122 /123 variables (removed 1) and now considering 250/251 (removed 1) transitions.
[2025-06-02 16:44:34] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2025-06-02 16:44:34] [INFO ] Computed 32 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:44:34] [INFO ] Implicit Places using invariants in 122 ms returned []
[2025-06-02 16:44:34] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
[2025-06-02 16:44:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:44:34] [INFO ] State equation strengthened by 30 read => feed constraints.
[2025-06-02 16:44:34] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 122/133 places, 250/260 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 471 ms. Remains : 122/133 places, 250/260 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : LamportFastMutEx-PT-5-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 185 ms.
Stack based approach found an accepted trace after 231 steps with 0 reset with depth 232 and stack size 232 in 1 ms.
FORMULA LamportFastMutEx-PT-5-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-PT-5-LTLFireability-09 finished in 716 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)||G(F(p1)))))'
Support contains 3 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 260/260 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 133 transition count 257
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 130 transition count 257
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 16 place count 125 transition count 252
Applied a total of 16 rules in 9 ms. Remains 125 /133 variables (removed 8) and now considering 252/260 (removed 8) transitions.
[2025-06-02 16:44:34] [INFO ] Flow matrix only has 192 transitions (discarded 60 similar events)
// Phase 1: matrix 192 rows 125 cols
[2025-06-02 16:44:34] [INFO ] Computed 33 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:44:34] [INFO ] Implicit Places using invariants in 115 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 116 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 124/133 places, 252/260 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 124 transition count 251
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 123 transition count 251
Applied a total of 2 rules in 4 ms. Remains 123 /124 variables (removed 1) and now considering 251/252 (removed 1) transitions.
[2025-06-02 16:44:34] [INFO ] Flow matrix only has 191 transitions (discarded 60 similar events)
// Phase 1: matrix 191 rows 123 cols
[2025-06-02 16:44:34] [INFO ] Computed 32 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:44:34] [INFO ] Implicit Places using invariants in 120 ms returned []
[2025-06-02 16:44:34] [INFO ] Flow matrix only has 191 transitions (discarded 60 similar events)
[2025-06-02 16:44:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:44:34] [INFO ] State equation strengthened by 30 read => feed constraints.
[2025-06-02 16:44:35] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 123/133 places, 251/260 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 484 ms. Remains : 123/133 places, 251/260 transitions.
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : LamportFastMutEx-PT-5-LTLFireability-10
Product exploration explored 100000 steps with 131 reset in 183 ms.
Product exploration explored 100000 steps with 131 reset in 186 ms.
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 106 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 3125 steps (0 resets) in 30 ms. (100 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 227 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 251/251 transitions.
Applied a total of 0 rules in 5 ms. Remains 123 /123 variables (removed 0) and now considering 251/251 (removed 0) transitions.
[2025-06-02 16:44:36] [INFO ] Flow matrix only has 191 transitions (discarded 60 similar events)
[2025-06-02 16:44:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:44:36] [INFO ] Implicit Places using invariants in 106 ms returned []
[2025-06-02 16:44:36] [INFO ] Flow matrix only has 191 transitions (discarded 60 similar events)
[2025-06-02 16:44:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:44:36] [INFO ] State equation strengthened by 30 read => feed constraints.
[2025-06-02 16:44:36] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:44:36] [INFO ] Redundant transitions in 1 ms returned []
Running 246 sub problems to find dead transitions.
[2025-06-02 16:44:36] [INFO ] Flow matrix only has 191 transitions (discarded 60 similar events)
[2025-06-02 16:44:36] [INFO ] Invariant cache hit.
[2025-06-02 16:44:36] [INFO ] State equation strengthened by 30 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 123/123 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 32/155 constraints. Problems are: Problem set: 0 solved, 246 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:37] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 7 ms to minimize.
Problem TDEAD1 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:37] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:37] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:37] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:37] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 3 ms to minimize.
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:37] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:37] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 6 ms to minimize.
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:37] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 2 ms to minimize.
Problem TDEAD9 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:37] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:37] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:37] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:38] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:38] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:38] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:38] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:38] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:38] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:38] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 11 ms to minimize.
Problem TDEAD40 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:38] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:38] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 6 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD241 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/175 constraints. Problems are: Problem set: 19 solved, 227 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:38] [INFO ] Deduced a trap composed of 7 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:44:38] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:38] [INFO ] Deduced a trap composed of 7 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:44:38] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:39] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:39] [INFO ] Deduced a trap composed of 7 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:44:39] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:39] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:39] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:39] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:39] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 2 ms to minimize.
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:39] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 2 ms to minimize.
Problem TDEAD69 is UNSAT
Problem TDEAD73 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:39] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:39] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:39] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:39] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:39] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:40] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:40] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:40] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 6 ms to minimize.
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD243 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 20/195 constraints. Problems are: Problem set: 29 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:41] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:41] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:41] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:41] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:41] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:41] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:41] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 2 ms to minimize.
Problem TDEAD115 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:41] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:41] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:41] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:42] [INFO ] Deduced a trap composed of 14 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:44:42] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:42] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:42] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:42] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:42] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:42] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:42] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:42] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:42] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 8 ms to minimize.
Problem TDEAD115 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 20/215 constraints. Problems are: Problem set: 30 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:43] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:43] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:43] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:43] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:43] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:43] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:43] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:43] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:44] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:44] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:44] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:44] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:44] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:44] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:44] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:44] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:45] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:45] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:45] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:45] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 20/235 constraints. Problems are: Problem set: 30 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:46] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:46] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:46] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:46] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:46] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 5/240 constraints. Problems are: Problem set: 30 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:47] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:47] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:47] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:47] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:48] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:48] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 6/246 constraints. Problems are: Problem set: 30 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:49] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:49] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 2/248 constraints. Problems are: Problem set: 30 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:50] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:50] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 2/250 constraints. Problems are: Problem set: 30 solved, 216 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/123 variables, 0/250 constraints. Problems are: Problem set: 30 solved, 216 unsolved
At refinement iteration 11 (OVERLAPS) 191/314 variables, 123/373 constraints. Problems are: Problem set: 30 solved, 216 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/314 variables, 30/403 constraints. Problems are: Problem set: 30 solved, 216 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/314 variables, 0/403 constraints. Problems are: Problem set: 30 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:44:58] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 7 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/314 variables, 1/404 constraints. Problems are: Problem set: 30 solved, 216 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/314 variables, 0/404 constraints. Problems are: Problem set: 30 solved, 216 unsolved
At refinement iteration 16 (OVERLAPS) 0/314 variables, 0/404 constraints. Problems are: Problem set: 30 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 404 constraints, problems are : Problem set: 30 solved, 216 unsolved in 30014 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 32/32 constraints, State Equation: 123/123 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 246/246 constraints, Known Traps: 96/96 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 30 solved, 216 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 118/118 constraints. Problems are: Problem set: 30 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 7/125 constraints. Problems are: Problem set: 30 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 71/196 constraints. Problems are: Problem set: 30 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/196 constraints. Problems are: Problem set: 30 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 5/123 variables, 25/221 constraints. Problems are: Problem set: 30 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 5/226 constraints. Problems are: Problem set: 30 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 25/251 constraints. Problems are: Problem set: 30 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:45:07] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:45:08] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:45:08] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:45:08] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:45:08] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:45:08] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:45:09] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:45:09] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 8/259 constraints. Problems are: Problem set: 30 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:45:10] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 1/260 constraints. Problems are: Problem set: 30 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:45:11] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:45:11] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:45:11] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 3/263 constraints. Problems are: Problem set: 30 solved, 216 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/123 variables, 0/263 constraints. Problems are: Problem set: 30 solved, 216 unsolved
At refinement iteration 11 (OVERLAPS) 191/314 variables, 123/386 constraints. Problems are: Problem set: 30 solved, 216 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/314 variables, 30/416 constraints. Problems are: Problem set: 30 solved, 216 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/314 variables, 216/632 constraints. Problems are: Problem set: 30 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:45:19] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:45:19] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:45:20] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 8 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 3/635 constraints. Problems are: Problem set: 30 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:45:26] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:45:26] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:45:27] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:45:27] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:45:28] [INFO ] Deduced a trap composed of 17 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:45:28] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 8 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/314 variables, 6/641 constraints. Problems are: Problem set: 30 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:45:36] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:45:36] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 8 ms to minimize.
SMT process timed out in 60116ms, After SMT, problems are : Problem set: 30 solved, 216 unsolved
Search for dead transitions found 30 dead transitions in 60117ms
Found 30 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 30 transitions
Dead transitions reduction (with SMT) removed 30 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 123/123 places, 221/251 transitions.
Applied a total of 0 rules in 4 ms. Remains 123 /123 variables (removed 0) and now considering 221/221 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:45:36] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 60480 ms. Remains : 123/123 places, 221/251 transitions.
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 102 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 1567 steps (0 resets) in 12 ms. (120 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 187 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 126 reset in 176 ms.
Product exploration explored 100000 steps with 156 reset in 185 ms.
Built C files in :
/tmp/ltsmin630108914012106420
[2025-06-02 16:45:37] [INFO ] Computing symmetric may disable matrix : 221 transitions.
[2025-06-02 16:45:37] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 16:45:37] [INFO ] Computing symmetric may enable matrix : 221 transitions.
[2025-06-02 16:45:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 16:45:37] [INFO ] Computing Do-Not-Accords matrix : 221 transitions.
[2025-06-02 16:45:37] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 16:45:37] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin630108914012106420
Running compilation step : cd /tmp/ltsmin630108914012106420;'/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 430 ms.
Running link step : cd /tmp/ltsmin630108914012106420;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin630108914012106420;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10719771206541741090.hoa' '--buchi-type=spotba'
LTSmin run took 791 ms.
FORMULA LamportFastMutEx-PT-5-LTLFireability-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property LamportFastMutEx-PT-5-LTLFireability-10 finished in 64355 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))&&F(p1)))'
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 260/260 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 133 transition count 257
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 130 transition count 257
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 16 place count 125 transition count 252
Applied a total of 16 rules in 15 ms. Remains 125 /133 variables (removed 8) and now considering 252/260 (removed 8) transitions.
[2025-06-02 16:45:39] [INFO ] Flow matrix only has 192 transitions (discarded 60 similar events)
// Phase 1: matrix 192 rows 125 cols
[2025-06-02 16:45:39] [INFO ] Computed 33 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:45:39] [INFO ] Implicit Places using invariants in 113 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 131 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 124/133 places, 252/260 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 124 transition count 251
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 123 transition count 251
Applied a total of 2 rules in 4 ms. Remains 123 /124 variables (removed 1) and now considering 251/252 (removed 1) transitions.
[2025-06-02 16:45:39] [INFO ] Flow matrix only has 191 transitions (discarded 60 similar events)
// Phase 1: matrix 191 rows 123 cols
[2025-06-02 16:45:39] [INFO ] Computed 32 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:45:39] [INFO ] Implicit Places using invariants in 117 ms returned []
[2025-06-02 16:45:39] [INFO ] Flow matrix only has 191 transitions (discarded 60 similar events)
[2025-06-02 16:45:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:45:39] [INFO ] State equation strengthened by 30 read => feed constraints.
[2025-06-02 16:45:39] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 123/133 places, 251/260 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 545 ms. Remains : 123/133 places, 251/260 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : LamportFastMutEx-PT-5-LTLFireability-11
Product exploration explored 100000 steps with 163 reset in 188 ms.
Stack based approach found an accepted trace after 898 steps with 3 reset with depth 103 and stack size 103 in 2 ms.
FORMULA LamportFastMutEx-PT-5-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-PT-5-LTLFireability-11 finished in 878 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))'
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)||X(X(X(X(X(F(p1)))))))))'
[2025-06-02 16:45:40] [INFO ] Flatten gal took : 16 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12065538057141285453
[2025-06-02 16:45:40] [INFO ] Computing symmetric may disable matrix : 260 transitions.
[2025-06-02 16:45:40] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 16:45:40] [INFO ] Computing symmetric may enable matrix : 260 transitions.
[2025-06-02 16:45:40] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 16:45:40] [INFO ] Applying decomposition
[2025-06-02 16:45:40] [INFO ] Flatten gal took : 8 ms
[2025-06-02 16:45:40] [INFO ] Computing Do-Not-Accords matrix : 260 transitions.
[2025-06-02 16:45:40] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 16:45:40] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12065538057141285453
Running compilation step : cd /tmp/ltsmin12065538057141285453;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' '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'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1034839314718452629.txt' '-o' '/tmp/graph1034839314718452629.bin' '-w' '/tmp/graph1034839314718452629.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1034839314718452629.bin' '-l' '-1' '-v' '-w' '/tmp/graph1034839314718452629.weights' '-q' '0' '-e' '0.001'
[2025-06-02 16:45:40] [INFO ] Decomposing Gal with order
[2025-06-02 16:45:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 16:45:40] [INFO ] Removed a total of 346 redundant transitions.
[2025-06-02 16:45:40] [INFO ] Flatten gal took : 64 ms
[2025-06-02 16:45:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 53 labels/synchronizations in 25 ms.
[2025-06-02 16:45:40] [INFO ] Time to serialize gal into /tmp/LTLFireability8812527624536179956.gal : 4 ms
[2025-06-02 16:45:40] [INFO ] Time to serialize properties into /tmp/LTLFireability2130285026375251923.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8812527624536179956.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2130285026375251923.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !((F("(((((((u14.y_4==1)&&(i0.u45.P_CS_21_1==1))||((u14.y_4==1)&&(i5.u47.P_CS_21_3==1)))||(((u14.y_4==1)&&(i5.u46.P_CS_21_2==1))||((u1...1332
Formula 0 simplified : G!"(((((((u14.y_4==1)&&(i0.u45.P_CS_21_1==1))||((u14.y_4==1)&&(i5.u47.P_CS_21_3==1)))||(((u14.y_4==1)&&(i5.u46.P_CS_21_2==1))||((u14...1328
Compilation finished in 730 ms.
Running link step : cd /tmp/ltsmin12065538057141285453;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin12065538057141285453;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((LTLAPp0==true))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t3, t10, t12, t13, t14, t15, t17, t19, t20, t21, t22, t23, t24, t26, t27, t28, t29, t30, t31,...964
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin12065538057141285453;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((LTLAPp0==true))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin12065538057141285453;'/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' '--ltl' '[]((<>((LTLAPp1==true))||X(X(X(X(X(<>((LTLAPp2==true)))))))))' '--buchi-type=spotba'
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
60242 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,602.453,2698016,1,0,2.64428e+06,586,1534,2.62329e+07,147,3136,2085110
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA LamportFastMutEx-PT-5-LTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G((F("(((((i5.u11.y_3==0)||(i2.u43.P_ifyi_15_3==0))&&((u14.y_4==0)||(i3.u44.P_ifyi_15_4==0)))&&(((i0.u10.y_1==0)||(i0.u40.P_ifyi_15...420
Formula 1 simplified : F(G!"(((((i5.u11.y_3==0)||(i2.u43.P_ifyi_15_3==0))&&((u14.y_4==0)||(i3.u44.P_ifyi_15_4==0)))&&(((i0.u10.y_1==0)||(i0.u40.P_ifyi_15_1...402
Detected timeout of ITS tools.
[2025-06-02 17:08:56] [INFO ] Applying decomposition
[2025-06-02 17:08:56] [INFO ] Flatten gal took : 35 ms
[2025-06-02 17:08:56] [INFO ] Decomposing Gal with order
[2025-06-02 17:08:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 17:08:56] [INFO ] Removed a total of 253 redundant transitions.
[2025-06-02 17:08:56] [INFO ] Flatten gal took : 69 ms
[2025-06-02 17:08:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 75 labels/synchronizations in 11 ms.
[2025-06-02 17:08:56] [INFO ] Time to serialize gal into /tmp/LTLFireability1738031467557250843.gal : 10 ms
[2025-06-02 17:08:56] [INFO ] Time to serialize properties into /tmp/LTLFireability12721573280025117989.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1738031467557250843.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12721573280025117989.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G((F("(((((u6.y_3==0)||(missing.P_ifyi_15_3==0))&&((u6.y_4==0)||(missing.P_ifyi_15_4==0)))&&(((u6.y_1==0)||(missing.P_ifyi_15_1==0)...412
Formula 0 simplified : F(G!"(((((u6.y_3==0)||(missing.P_ifyi_15_3==0))&&((u6.y_4==0)||(missing.P_ifyi_15_4==0)))&&(((u6.y_1==0)||(missing.P_ifyi_15_1==0))&...394
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.006: LTL layer: formula: []((<>((LTLAPp1==true))||X(X(X(X(X(<>((LTLAPp2==true)))))))))
pins2lts-mc-linux64( 2/ 8), 0.006: "[]((<>((LTLAPp1==true))||X(X(X(X(X(<>((LTLAPp2==true)))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.006: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.028: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.094: DFS-FIFO for weak LTL, using special progress label 264
pins2lts-mc-linux64( 0/ 8), 0.094: There are 265 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.094: State length is 134, there are 267 groups
pins2lts-mc-linux64( 0/ 8), 0.094: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.094: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.094: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.094: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.129: ~1 levels ~960 states ~4800 transitions
pins2lts-mc-linux64( 4/ 8), 0.147: ~1 levels ~1920 states ~9600 transitions
pins2lts-mc-linux64( 4/ 8), 0.192: ~1 levels ~3840 states ~19200 transitions
pins2lts-mc-linux64( 4/ 8), 0.281: ~1 levels ~7680 states ~38328 transitions
pins2lts-mc-linux64( 7/ 8), 0.427: ~1 levels ~15360 states ~77120 transitions
pins2lts-mc-linux64( 4/ 8), 0.674: ~1 levels ~30720 states ~151992 transitions
pins2lts-mc-linux64( 4/ 8), 1.126: ~1 levels ~61440 states ~302824 transitions
pins2lts-mc-linux64( 3/ 8), 1.851: ~1 levels ~122880 states ~627680 transitions
pins2lts-mc-linux64( 5/ 8), 2.951: ~1 levels ~245760 states ~1238096 transitions
pins2lts-mc-linux64( 6/ 8), 4.503: ~1 levels ~491520 states ~2355144 transitions
pins2lts-mc-linux64( 6/ 8), 7.301: ~1 levels ~983040 states ~4780264 transitions
pins2lts-mc-linux64( 6/ 8), 12.936: ~10 levels ~1966080 states ~9767352 transitions
pins2lts-mc-linux64( 3/ 8), 24.240: ~10 levels ~3932160 states ~20369088 transitions
pins2lts-mc-linux64( 7/ 8), 47.110: ~15 levels ~7864320 states ~42708312 transitions
pins2lts-mc-linux64( 3/ 8), 93.553: ~15 levels ~15728640 states ~81968024 transitions
pins2lts-mc-linux64( 3/ 8), 185.944: ~18 levels ~31457280 states ~167483488 transitions
pins2lts-mc-linux64( 3/ 8), 426.145: ~18 levels ~62914560 states ~353355312 transitions
pins2lts-mc-linux64( 1/ 8), 841.207: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 841.245:
pins2lts-mc-linux64( 0/ 8), 841.245: mean standard work distribution: 4.1% (states) 2.0% (transitions)
pins2lts-mc-linux64( 0/ 8), 841.245:
pins2lts-mc-linux64( 0/ 8), 841.245: Explored 112835805 states 737074472 transitions, fanout: 6.532
pins2lts-mc-linux64( 0/ 8), 841.245: Total exploration time 841.140 sec (841.120 sec minimum, 841.130 sec on average)
pins2lts-mc-linux64( 0/ 8), 841.245: States per second: 134146, Transitions per second: 876280
pins2lts-mc-linux64( 0/ 8), 841.245:
pins2lts-mc-linux64( 0/ 8), 841.245: Progress states detected: 131376604
pins2lts-mc-linux64( 0/ 8), 841.245: Redundant explorations: -15.9304
pins2lts-mc-linux64( 0/ 8), 841.245:
pins2lts-mc-linux64( 0/ 8), 841.245: Queue width: 8B, total height: 40654692, memory: 310.17MB
pins2lts-mc-linux64( 0/ 8), 841.245: Tree memory: 1071.3MB, 8.4 B/state, compr.: 1.6%
pins2lts-mc-linux64( 0/ 8), 841.245: Tree fill ratio (roots/leafs): 99.0%/18.0%
pins2lts-mc-linux64( 0/ 8), 841.245: Stored 266 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 841.245: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 841.245: Est. total memory use: 1381.5MB (~1334.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12065538057141285453;'/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' '--ltl' '[]((<>((LTLAPp1==true))||X(X(X(X(X(<>((LTLAPp2==true)))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12065538057141285453;'/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' '--ltl' '[]((<>((LTLAPp1==true))||X(X(X(X(X(<>((LTLAPp2==true)))))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-06-02 17:32:15] [INFO ] Flatten gal took : 258 ms
[2025-06-02 17:32:16] [INFO ] Input system was already deterministic with 260 transitions.
[2025-06-02 17:32:17] [INFO ] Transformed 133 places.
[2025-06-02 17:32:17] [INFO ] Transformed 260 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-06-02 17:32:17] [INFO ] Time to serialize gal into /tmp/LTLFireability3085521070548085606.gal : 13 ms
[2025-06-02 17:32:17] [INFO ] Time to serialize properties into /tmp/LTLFireability10150606404634061864.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3085521070548085606.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10150606404634061864.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G((F("(((((y_3==0)||(P_ifyi_15_3==0))&&((y_4==0)||(P_ifyi_15_4==0)))&&(((y_1==0)||(P_ifyi_15_1==0))&&((y_2==0)||(P_ifyi_15_2==0))))...317
Formula 0 simplified : F(G!"(((((y_3==0)||(P_ifyi_15_3==0))&&((y_4==0)||(P_ifyi_15_4==0)))&&(((y_1==0)||(P_ifyi_15_1==0))&&((y_2==0)||(P_ifyi_15_2==0))))&&...299

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ 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-5"
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-5, 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-174876423100676"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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