Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 972K
-rw-r--r-- 1 mcc users 17K Apr 13 07:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 126K Apr 13 07:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 13 07:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 13 07:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 7.5K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 35K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 22 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 27K Apr 13 07:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 181K Apr 13 07:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 38K Apr 13 07:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 222K Apr 13 07:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.5K Apr 22 14:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 114K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME LamportFastMutEx-PT-4-LTLFireability-00
FORMULA_NAME LamportFastMutEx-PT-4-LTLFireability-01
FORMULA_NAME LamportFastMutEx-PT-4-LTLFireability-02
FORMULA_NAME LamportFastMutEx-PT-4-LTLFireability-03
FORMULA_NAME LamportFastMutEx-PT-4-LTLFireability-04
FORMULA_NAME LamportFastMutEx-PT-4-LTLFireability-05
FORMULA_NAME LamportFastMutEx-PT-4-LTLFireability-06
FORMULA_NAME LamportFastMutEx-PT-4-LTLFireability-07
FORMULA_NAME LamportFastMutEx-PT-4-LTLFireability-08
FORMULA_NAME LamportFastMutEx-PT-4-LTLFireability-09
FORMULA_NAME LamportFastMutEx-PT-4-LTLFireability-10
FORMULA_NAME LamportFastMutEx-PT-4-LTLFireability-11
FORMULA_NAME LamportFastMutEx-PT-4-LTLFireability-12
FORMULA_NAME LamportFastMutEx-PT-4-LTLFireability-13
FORMULA_NAME LamportFastMutEx-PT-4-LTLFireability-14
FORMULA_NAME LamportFastMutEx-PT-4-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716570267134

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-PT-4
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-24 17:04:28] [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]
[2024-05-24 17:04:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 17:04:28] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2024-05-24 17:04:28] [INFO ] Transformed 135 places.
[2024-05-24 17:04:28] [INFO ] Transformed 230 transitions.
[2024-05-24 17:04:28] [INFO ] Found NUPN structural information;
[2024-05-24 17:04:28] [INFO ] Completing missing partition info from NUPN : creating a component with [P_start_1_0, P_start_1_1, P_start_1_2, P_start_1_3, P_start_1_4, P_b_0_false, P_b_0_true, P_b_1_false, P_b_1_true, P_b_2_false, P_b_2_true, P_b_3_false, P_b_3_true, P_b_4_false, P_b_4_true, P_setx_3_0, P_setx_3_1, P_setx_3_2, P_setx_3_3, P_setx_3_4, P_setbi_5_0, P_setbi_5_1, P_setbi_5_2, P_setbi_5_3, P_setbi_5_4, P_ify0_4_0, P_ify0_4_1, P_ify0_4_2, P_ify0_4_3, P_ify0_4_4, P_sety_9_0, P_sety_9_1, P_sety_9_2, P_sety_9_3, P_sety_9_4, P_ifxi_10_0, P_ifxi_10_1, P_ifxi_10_2, P_ifxi_10_3, P_ifxi_10_4, P_setbi_11_0, P_setbi_11_1, P_setbi_11_2, P_setbi_11_3, P_setbi_11_4, P_fordo_12_0, P_fordo_12_1, P_fordo_12_2, P_fordo_12_3, P_fordo_12_4, P_wait_0_0, P_wait_0_1, P_wait_0_2, P_wait_0_3, P_wait_0_4, P_wait_1_0, P_wait_1_1, P_wait_1_2, P_wait_1_3, P_wait_1_4, P_wait_2_0, P_wait_2_1, P_wait_2_2, P_wait_2_3, P_wait_2_4, P_wait_3_0, P_wait_3_1, P_wait_3_2, P_wait_3_3, P_wait_3_4, P_wait_4_0, P_wait_4_1, P_wait_4_2, P_wait_4_3, P_wait_4_4, P_await_13_0, P_await_13_1, P_await_13_2, P_await_13_3, P_await_13_4, P_done_0_0, P_done_0_1, P_done_0_2, P_done_0_3, P_done_0_4, P_done_1_0, P_done_1_1, P_done_1_2, P_done_1_3, P_done_1_4, P_done_2_0, P_done_2_1, P_done_2_2, P_done_2_3, P_done_2_4, P_done_3_0, P_done_3_1, P_done_3_2, P_done_3_3, P_done_3_4, P_done_4_0, P_done_4_1, P_done_4_2, P_done_4_3, P_done_4_4, P_ifyi_15_0, P_ifyi_15_1, P_ifyi_15_2, P_ifyi_15_3, P_ifyi_15_4, P_awaity_0, P_awaity_1, P_awaity_2, P_awaity_3, P_awaity_4, P_CS_21_0, P_CS_21_1, P_CS_21_2, P_CS_21_3, P_CS_21_4, P_setbi_24_0, P_setbi_24_1, P_setbi_24_2, P_setbi_24_3, P_setbi_24_4]
[2024-05-24 17:04:28] [INFO ] Parsed PT model containing 135 places and 230 transitions and 990 arcs in 174 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 33 places in 2 ms
Reduce places removed 33 places and 50 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA LamportFastMutEx-PT-4-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-4-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-4-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-4-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-4-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-4-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 55 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 180/180 transitions.
Applied a total of 0 rules in 11 ms. Remains 102 /102 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-24 17:04:28] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
// Phase 1: matrix 144 rows 102 cols
[2024-05-24 17:04:28] [INFO ] Computed 26 invariants in 14 ms
[2024-05-24 17:04:28] [INFO ] Implicit Places using invariants in 222 ms returned [67, 68, 69]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 259 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 180/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 99 /99 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 288 ms. Remains : 99/102 places, 180/180 transitions.
Support contains 55 out of 99 places after structural reductions.
[2024-05-24 17:04:29] [INFO ] Flatten gal took : 36 ms
[2024-05-24 17:04:29] [INFO ] Flatten gal took : 19 ms
[2024-05-24 17:04:29] [INFO ] Input system was already deterministic with 180 transitions.
Reduction of identical properties reduced properties to check from 18 to 15
RANDOM walk for 6131 steps (0 resets) in 177 ms. (34 steps per ms) remains 0/15 properties
Computed a total of 1 stabilizing places and 4 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(X(p1) U G(p2))))'
Support contains 13 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 180/180 transitions.
Applied a total of 0 rules in 3 ms. Remains 99 /99 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-24 17:04:29] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
// Phase 1: matrix 144 rows 99 cols
[2024-05-24 17:04:29] [INFO ] Computed 23 invariants in 5 ms
[2024-05-24 17:04:29] [INFO ] Implicit Places using invariants in 107 ms returned [66]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 108 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/99 places, 180/180 transitions.
Applied a total of 0 rules in 3 ms. Remains 98 /98 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 114 ms. Remains : 98/99 places, 180/180 transitions.
Stuttering acceptance computed with spot in 660 ms :[(AND (NOT p0) (NOT p2)), (NOT p1), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), true, (AND (NOT p2) p1), (NOT p0), (AND (NOT p2) p1 (NOT p0))]
Running random walk in product with property : LamportFastMutEx-PT-4-LTLFireability-02
Entered a terminal (fully accepting) state of product in 58 steps with 15 reset in 7 ms.
FORMULA LamportFastMutEx-PT-4-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-4-LTLFireability-02 finished in 864 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((p0&&X(p0)))&&G(F(p0)))))'
Support contains 4 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 180/180 transitions.
Applied a total of 0 rules in 5 ms. Remains 99 /99 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-24 17:04:30] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
[2024-05-24 17:04:30] [INFO ] Invariant cache hit.
[2024-05-24 17:04:30] [INFO ] Implicit Places using invariants in 108 ms returned [66]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 110 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/99 places, 180/180 transitions.
Applied a total of 0 rules in 4 ms. Remains 98 /98 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 119 ms. Remains : 98/99 places, 180/180 transitions.
Stuttering acceptance computed with spot in 260 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-PT-4-LTLFireability-03
Product exploration explored 100000 steps with 4115 reset in 298 ms.
Stack based approach found an accepted trace after 3908 steps with 161 reset with depth 59 and stack size 59 in 9 ms.
FORMULA LamportFastMutEx-PT-4-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-PT-4-LTLFireability-03 finished in 711 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F(p1)))))'
Support contains 18 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 180/180 transitions.
Applied a total of 0 rules in 3 ms. Remains 99 /99 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-24 17:04:31] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
[2024-05-24 17:04:31] [INFO ] Invariant cache hit.
[2024-05-24 17:04:31] [INFO ] Implicit Places using invariants in 92 ms returned [66]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 93 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/99 places, 180/180 transitions.
Applied a total of 0 rules in 1 ms. Remains 98 /98 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 98 ms. Remains : 98/99 places, 180/180 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : LamportFastMutEx-PT-4-LTLFireability-04
Product exploration explored 100000 steps with 1176 reset in 279 ms.
Stack based approach found an accepted trace after 207 steps with 3 reset with depth 34 and stack size 34 in 1 ms.
FORMULA LamportFastMutEx-PT-4-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-PT-4-LTLFireability-04 finished in 509 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 9 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 180/180 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 99 transition count 177
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 96 transition count 177
Applied a total of 6 rules in 25 ms. Remains 96 /99 variables (removed 3) and now considering 177/180 (removed 3) transitions.
[2024-05-24 17:04:31] [INFO ] Flow matrix only has 141 transitions (discarded 36 similar events)
// Phase 1: matrix 141 rows 96 cols
[2024-05-24 17:04:31] [INFO ] Computed 23 invariants in 2 ms
[2024-05-24 17:04:31] [INFO ] Implicit Places using invariants in 93 ms returned [66]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 95 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 95/99 places, 177/180 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 95 transition count 176
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 94 transition count 176
Applied a total of 2 rules in 9 ms. Remains 94 /95 variables (removed 1) and now considering 176/177 (removed 1) transitions.
[2024-05-24 17:04:31] [INFO ] Flow matrix only has 140 transitions (discarded 36 similar events)
// Phase 1: matrix 140 rows 94 cols
[2024-05-24 17:04:31] [INFO ] Computed 22 invariants in 1 ms
[2024-05-24 17:04:31] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-24 17:04:31] [INFO ] Flow matrix only has 140 transitions (discarded 36 similar events)
[2024-05-24 17:04:31] [INFO ] Invariant cache hit.
[2024-05-24 17:04:32] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-24 17:04:32] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 94/99 places, 176/180 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 353 ms. Remains : 94/99 places, 176/180 transitions.
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : LamportFastMutEx-PT-4-LTLFireability-06
Product exploration explored 100000 steps with 1 reset in 190 ms.
Stack based approach found an accepted trace after 311 steps with 4 reset with depth 228 and stack size 228 in 1 ms.
FORMULA LamportFastMutEx-PT-4-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-PT-4-LTLFireability-06 finished in 665 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p1)&&p0))))'
Support contains 25 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 180/180 transitions.
Applied a total of 0 rules in 3 ms. Remains 99 /99 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-24 17:04:32] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
// Phase 1: matrix 144 rows 99 cols
[2024-05-24 17:04:32] [INFO ] Computed 23 invariants in 2 ms
[2024-05-24 17:04:32] [INFO ] Implicit Places using invariants in 64 ms returned [66]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 66 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/99 places, 180/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 71 ms. Remains : 98/99 places, 180/180 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : LamportFastMutEx-PT-4-LTLFireability-07
Product exploration explored 100000 steps with 25012 reset in 151 ms.
Product exploration explored 100000 steps with 25045 reset in 173 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 182 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 15 steps (0 resets) in 5 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 225 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 13 out of 98 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 180/180 transitions.
Applied a total of 0 rules in 3 ms. Remains 98 /98 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-24 17:04:33] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
// Phase 1: matrix 144 rows 98 cols
[2024-05-24 17:04:33] [INFO ] Computed 22 invariants in 0 ms
[2024-05-24 17:04:33] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-24 17:04:33] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
[2024-05-24 17:04:33] [INFO ] Invariant cache hit.
[2024-05-24 17:04:33] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-24 17:04:33] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
Running 176 sub problems to find dead transitions.
[2024-05-24 17:04:33] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
[2024-05-24 17:04:33] [INFO ] Invariant cache hit.
[2024-05-24 17:04:33] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 98/98 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 22/120 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-05-24 17:04:34] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 11 ms to minimize.
[2024-05-24 17:04:34] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 2 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-05-24 17:04:34] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-24 17:04:34] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:04:34] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-24 17:04:34] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-24 17:04:34] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-24 17:04:34] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 2 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-05-24 17:04:34] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-05-24 17:04:34] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-24 17:04:35] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2024-05-24 17:04:35] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-24 17:04:35] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-24 17:04:35] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-24 17:04:35] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-05-24 17:04:35] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-24 17:04:35] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-05-24 17:04:35] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 2 ms to minimize.
[2024-05-24 17:04:35] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-24 17:04:35] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD88 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 20/140 constraints. Problems are: Problem set: 11 solved, 165 unsolved
[2024-05-24 17:04:35] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-05-24 17:04:35] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:04:35] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-24 17:04:35] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-24 17:04:35] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-24 17:04:35] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:04:35] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:04:35] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-24 17:04:36] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-24 17:04:36] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-24 17:04:36] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-24 17:04:36] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-24 17:04:36] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
Problem TDEAD38 is UNSAT
[2024-05-24 17:04:36] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-05-24 17:04:36] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
Problem TDEAD46 is UNSAT
[2024-05-24 17:04:36] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-05-24 17:04:36] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 2 ms to minimize.
Problem TDEAD50 is UNSAT
[2024-05-24 17:04:36] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:04:36] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-24 17:04:36] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
Problem TDEAD38 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD102 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 20/160 constraints. Problems are: Problem set: 23 solved, 153 unsolved
[2024-05-24 17:04:36] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
[2024-05-24 17:04:36] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-05-24 17:04:37] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:04:37] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-24 17:04:37] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2024-05-24 17:04:37] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 0 ms to minimize.
[2024-05-24 17:04:37] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-24 17:04:37] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-24 17:04:37] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-24 17:04:37] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2024-05-24 17:04:37] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 2 ms to minimize.
[2024-05-24 17:04:37] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:04:37] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-24 17:04:37] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
Problem TDEAD80 is UNSAT
[2024-05-24 17:04:37] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-05-24 17:04:37] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-05-24 17:04:37] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 8 ms to minimize.
[2024-05-24 17:04:38] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 0 ms to minimize.
[2024-05-24 17:04:38] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 0 ms to minimize.
[2024-05-24 17:04:38] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
Problem TDEAD80 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 20/180 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:04:38] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-24 17:04:38] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 2 ms to minimize.
[2024-05-24 17:04:38] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 0 ms to minimize.
[2024-05-24 17:04:38] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 2 ms to minimize.
[2024-05-24 17:04:38] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:04:38] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-24 17:04:38] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2024-05-24 17:04:38] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:04:39] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-24 17:04:39] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-05-24 17:04:39] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 0 ms to minimize.
[2024-05-24 17:04:39] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-24 17:04:39] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-24 17:04:39] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:04:39] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
[2024-05-24 17:04:39] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-24 17:04:39] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-05-24 17:04:39] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 0 ms to minimize.
[2024-05-24 17:04:39] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 19/199 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:04:39] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:04:39] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:04:39] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:04:40] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-24 17:04:40] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2024-05-24 17:04:40] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-24 17:04:40] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-24 17:04:40] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 8/207 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:04:40] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-05-24 17:04:41] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:04:41] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:04:41] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:04:41] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 0 ms to minimize.
[2024-05-24 17:04:41] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-05-24 17:04:41] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-24 17:04:41] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 8/215 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:04:41] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:04:42] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-24 17:04:42] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:04:42] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2024-05-24 17:04:42] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 0 ms to minimize.
[2024-05-24 17:04:42] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:04:42] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 7/222 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:04:42] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 0 ms to minimize.
[2024-05-24 17:04:42] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:04:43] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
[2024-05-24 17:04:43] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 0 ms to minimize.
[2024-05-24 17:04:43] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:04:43] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2024-05-24 17:04:43] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/98 variables, 7/229 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:04:43] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 0 ms to minimize.
[2024-05-24 17:04:43] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-24 17:04:44] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:04:44] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-24 17:04:44] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/98 variables, 5/234 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:04:44] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:04:44] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-24 17:04:44] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2024-05-24 17:04:44] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 0 ms to minimize.
[2024-05-24 17:04:44] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-24 17:04:44] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2024-05-24 17:04:45] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-24 17:04:45] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/98 variables, 8/242 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:04:45] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/98 variables, 1/243 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:04:46] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:04:46] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2024-05-24 17:04:46] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:04:46] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-24 17:04:46] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 0 ms to minimize.
[2024-05-24 17:04:46] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-24 17:04:46] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-24 17:04:46] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/98 variables, 8/251 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/98 variables, 0/251 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 15 (OVERLAPS) 144/242 variables, 98/349 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/242 variables, 24/373 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:04:49] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/242 variables, 1/374 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/242 variables, 0/374 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 19 (OVERLAPS) 0/242 variables, 0/374 constraints. Problems are: Problem set: 24 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 374 constraints, problems are : Problem set: 24 solved, 152 unsolved in 20407 ms.
Refiners :[Domain max(s): 98/98 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 98/98 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 132/132 constraints]
Escalating to Integer solving :Problem set: 24 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 94/94 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 6/100 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 86/186 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/186 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 4/98 variables, 16/202 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 4/206 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 46/252 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:04:55] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:04:55] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:04:55] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 3/255 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 0/255 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 9 (OVERLAPS) 144/242 variables, 98/353 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 24/377 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 152/529 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:04:59] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:04:59] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-05-24 17:04:59] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-24 17:04:59] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-24 17:04:59] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 5/534 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:05:03] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-24 17:05:03] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 0 ms to minimize.
[2024-05-24 17:05:03] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 2 ms to minimize.
[2024-05-24 17:05:03] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-24 17:05:03] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:05:03] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/242 variables, 6/540 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/242 variables, 0/540 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:05:09] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:05:09] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/242 variables, 2/542 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:05:12] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:05:12] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-24 17:05:12] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-24 17:05:12] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-24 17:05:13] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:05:13] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-24 17:05:13] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-24 17:05:13] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-24 17:05:13] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:05:13] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:05:13] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:05:13] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
[2024-05-24 17:05:13] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-24 17:05:13] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-24 17:05:14] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-24 17:05:14] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-24 17:05:14] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/242 variables, 17/559 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/242 variables, 0/559 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:05:19] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/242 variables, 1/560 constraints. Problems are: Problem set: 24 solved, 152 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 242/242 variables, and 560 constraints, problems are : Problem set: 24 solved, 152 unsolved in 30021 ms.
Refiners :[Domain max(s): 98/98 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 98/98 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 152/176 constraints, Known Traps: 166/166 constraints]
After SMT, in 50534ms problems are : Problem set: 24 solved, 152 unsolved
Search for dead transitions found 24 dead transitions in 50544ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in LTL mode, iteration 1 : 98/98 places, 156/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 50737 ms. Remains : 98/98 places, 156/180 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [p1]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 142 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 12 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [p1]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 120 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 119 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 25200 reset in 131 ms.
Product exploration explored 100000 steps with 25204 reset in 137 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 13 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 156/156 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 98 transition count 156
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 4 rules in 14 ms. Remains 98 /98 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-05-24 17:05:25] [INFO ] Redundant transitions in 3 ms returned []
Running 152 sub problems to find dead transitions.
[2024-05-24 17:05:25] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
// Phase 1: matrix 128 rows 98 cols
[2024-05-24 17:05:25] [INFO ] Computed 22 invariants in 1 ms
[2024-05-24 17:05:25] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 94/94 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 6/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (OVERLAPS) 4/98 variables, 16/116 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 4/120 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 17:05:26] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:05:26] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-24 17:05:26] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
[2024-05-24 17:05:26] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-24 17:05:26] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-24 17:05:26] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
[2024-05-24 17:05:27] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-24 17:05:27] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-05-24 17:05:27] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 1 ms to minimize.
[2024-05-24 17:05:27] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-24 17:05:27] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-24 17:05:27] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-24 17:05:27] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-24 17:05:27] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-24 17:05:27] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2024-05-24 17:05:27] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-05-24 17:05:27] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-05-24 17:05:27] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-24 17:05:27] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-24 17:05:27] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
Problem TDEAD76 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 20/140 constraints. Problems are: Problem set: 1 solved, 151 unsolved
[2024-05-24 17:05:27] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
[2024-05-24 17:05:27] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2024-05-24 17:05:27] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2024-05-24 17:05:27] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-24 17:05:27] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2024-05-24 17:05:27] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-24 17:05:28] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 0 ms to minimize.
[2024-05-24 17:05:28] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:05:28] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-24 17:05:28] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
[2024-05-24 17:05:28] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-24 17:05:28] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-05-24 17:05:28] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-24 17:05:28] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-24 17:05:28] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
[2024-05-24 17:05:28] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
Problem TDEAD77 is UNSAT
Problem TDEAD79 is UNSAT
[2024-05-24 17:05:28] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-05-24 17:05:28] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-24 17:05:28] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-24 17:05:28] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 20/160 constraints. Problems are: Problem set: 4 solved, 148 unsolved
[2024-05-24 17:05:29] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-24 17:05:29] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:05:29] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-24 17:05:29] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:05:29] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:05:29] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-05-24 17:05:29] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-24 17:05:29] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-24 17:05:29] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-24 17:05:29] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-24 17:05:29] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2024-05-24 17:05:29] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:05:29] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2024-05-24 17:05:29] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-05-24 17:05:29] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2024-05-24 17:05:29] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-24 17:05:29] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:05:30] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-24 17:05:30] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:05:30] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 20/180 constraints. Problems are: Problem set: 4 solved, 148 unsolved
[2024-05-24 17:05:30] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-24 17:05:30] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-24 17:05:30] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-24 17:05:30] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-24 17:05:30] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-24 17:05:30] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 2 ms to minimize.
[2024-05-24 17:05:30] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2024-05-24 17:05:30] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:05:30] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 0 ms to minimize.
[2024-05-24 17:05:30] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 0 ms to minimize.
[2024-05-24 17:05:30] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-24 17:05:31] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-24 17:05:31] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:05:31] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:05:31] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-24 17:05:31] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-24 17:05:31] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-24 17:05:31] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 18/198 constraints. Problems are: Problem set: 4 solved, 148 unsolved
[2024-05-24 17:05:31] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
[2024-05-24 17:05:31] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
[2024-05-24 17:05:31] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-24 17:05:31] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:05:32] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 2 ms to minimize.
[2024-05-24 17:05:32] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-24 17:05:32] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-24 17:05:32] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:05:32] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:05:32] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 0 ms to minimize.
[2024-05-24 17:05:32] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/98 variables, 11/209 constraints. Problems are: Problem set: 4 solved, 148 unsolved
[2024-05-24 17:05:32] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 5 ms to minimize.
[2024-05-24 17:05:32] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 0 ms to minimize.
[2024-05-24 17:05:33] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-24 17:05:33] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 0 ms to minimize.
[2024-05-24 17:05:33] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-24 17:05:33] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 0 ms to minimize.
[2024-05-24 17:05:33] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:05:33] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/98 variables, 8/217 constraints. Problems are: Problem set: 4 solved, 148 unsolved
[2024-05-24 17:05:33] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-05-24 17:05:34] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 0 ms to minimize.
[2024-05-24 17:05:34] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2024-05-24 17:05:34] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-24 17:05:34] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:05:34] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/98 variables, 6/223 constraints. Problems are: Problem set: 4 solved, 148 unsolved
[2024-05-24 17:05:34] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/98 variables, 1/224 constraints. Problems are: Problem set: 4 solved, 148 unsolved
[2024-05-24 17:05:35] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 0 ms to minimize.
[2024-05-24 17:05:35] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 6 ms to minimize.
[2024-05-24 17:05:35] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 0 ms to minimize.
[2024-05-24 17:05:35] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2024-05-24 17:05:35] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-24 17:05:35] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-24 17:05:35] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-24 17:05:35] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-24 17:05:35] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-24 17:05:35] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-24 17:05:35] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
[2024-05-24 17:05:35] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 0 ms to minimize.
[2024-05-24 17:05:35] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-05-24 17:05:36] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-24 17:05:36] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:05:36] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:05:36] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2024-05-24 17:05:36] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:05:36] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-24 17:05:36] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/98 variables, 20/244 constraints. Problems are: Problem set: 4 solved, 148 unsolved
[2024-05-24 17:05:36] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-24 17:05:36] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:05:36] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-24 17:05:36] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-24 17:05:36] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:05:36] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:05:36] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:05:37] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:05:37] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2024-05-24 17:05:37] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 0 ms to minimize.
[2024-05-24 17:05:37] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-24 17:05:37] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-24 17:05:37] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-05-24 17:05:37] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-05-24 17:05:37] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-24 17:05:37] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-24 17:05:37] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/98 variables, 17/261 constraints. Problems are: Problem set: 4 solved, 148 unsolved
[2024-05-24 17:05:37] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-24 17:05:38] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/98 variables, 2/263 constraints. Problems are: Problem set: 4 solved, 148 unsolved
[2024-05-24 17:05:38] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:05:38] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-24 17:05:38] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-05-24 17:05:38] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-24 17:05:38] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-05-24 17:05:38] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-05-24 17:05:38] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-24 17:05:39] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
[2024-05-24 17:05:39] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:05:39] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-24 17:05:39] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-24 17:05:39] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-24 17:05:39] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-24 17:05:39] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-24 17:05:39] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/98 variables, 15/278 constraints. Problems are: Problem set: 4 solved, 148 unsolved
[2024-05-24 17:05:39] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-24 17:05:40] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-05-24 17:05:40] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:05:40] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
[2024-05-24 17:05:40] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-24 17:05:40] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/98 variables, 6/284 constraints. Problems are: Problem set: 4 solved, 148 unsolved
[2024-05-24 17:05:40] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/98 variables, 1/285 constraints. Problems are: Problem set: 4 solved, 148 unsolved
[2024-05-24 17:05:41] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-24 17:05:41] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/98 variables, 2/287 constraints. Problems are: Problem set: 4 solved, 148 unsolved
[2024-05-24 17:05:42] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 0 ms to minimize.
[2024-05-24 17:05:42] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-24 17:05:42] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2024-05-24 17:05:42] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/98 variables, 4/291 constraints. Problems are: Problem set: 4 solved, 148 unsolved
[2024-05-24 17:05:43] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-05-24 17:05:43] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/98 variables, 2/293 constraints. Problems are: Problem set: 4 solved, 148 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/98 variables, 0/293 constraints. Problems are: Problem set: 4 solved, 148 unsolved
At refinement iteration 23 (OVERLAPS) 128/226 variables, 98/391 constraints. Problems are: Problem set: 4 solved, 148 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/226 variables, 20/411 constraints. Problems are: Problem set: 4 solved, 148 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/226 variables, 0/411 constraints. Problems are: Problem set: 4 solved, 148 unsolved
[2024-05-24 17:05:48] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:05:48] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
At refinement iteration 26 (OVERLAPS) 0/226 variables, 2/413 constraints. Problems are: Problem set: 4 solved, 148 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/226 variables, 0/413 constraints. Problems are: Problem set: 4 solved, 148 unsolved
At refinement iteration 28 (OVERLAPS) 0/226 variables, 0/413 constraints. Problems are: Problem set: 4 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Real declared 226/226 variables, and 413 constraints, problems are : Problem set: 4 solved, 148 unsolved in 28739 ms.
Refiners :[Domain max(s): 98/98 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 98/98 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 175/175 constraints]
Escalating to Integer solving :Problem set: 4 solved, 148 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 90/90 constraints. Problems are: Problem set: 4 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 6/96 constraints. Problems are: Problem set: 4 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 100/196 constraints. Problems are: Problem set: 4 solved, 148 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/196 constraints. Problems are: Problem set: 4 solved, 148 unsolved
At refinement iteration 4 (OVERLAPS) 8/98 variables, 16/212 constraints. Problems are: Problem set: 4 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 8/220 constraints. Problems are: Problem set: 4 solved, 148 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 75/295 constraints. Problems are: Problem set: 4 solved, 148 unsolved
[2024-05-24 17:05:55] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:05:55] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-24 17:05:55] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:05:55] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 4/299 constraints. Problems are: Problem set: 4 solved, 148 unsolved
[2024-05-24 17:05:56] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-24 17:05:56] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-24 17:05:56] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-05-24 17:05:56] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-24 17:05:56] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-05-24 17:05:56] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 6/305 constraints. Problems are: Problem set: 4 solved, 148 unsolved
[2024-05-24 17:05:57] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:05:57] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:05:57] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:05:57] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-24 17:05:57] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/98 variables, 5/310 constraints. Problems are: Problem set: 4 solved, 148 unsolved
[2024-05-24 17:05:58] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/98 variables, 1/311 constraints. Problems are: Problem set: 4 solved, 148 unsolved
[2024-05-24 17:05:58] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-24 17:05:58] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-24 17:05:58] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 0 ms to minimize.
[2024-05-24 17:05:58] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/98 variables, 4/315 constraints. Problems are: Problem set: 4 solved, 148 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/98 variables, 0/315 constraints. Problems are: Problem set: 4 solved, 148 unsolved
At refinement iteration 13 (OVERLAPS) 128/226 variables, 98/413 constraints. Problems are: Problem set: 4 solved, 148 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/226 variables, 20/433 constraints. Problems are: Problem set: 4 solved, 148 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/226 variables, 148/581 constraints. Problems are: Problem set: 4 solved, 148 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/226 variables, 0/581 constraints. Problems are: Problem set: 4 solved, 148 unsolved
At refinement iteration 17 (OVERLAPS) 0/226 variables, 0/581 constraints. Problems are: Problem set: 4 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Int declared 226/226 variables, and 581 constraints, problems are : Problem set: 4 solved, 148 unsolved in 16490 ms.
Refiners :[Domain max(s): 98/98 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 98/98 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 148/152 constraints, Known Traps: 195/195 constraints]
After SMT, in 45272ms problems are : Problem set: 4 solved, 148 unsolved
Search for dead transitions found 4 dead transitions in 45275ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 98/98 places, 152/156 transitions.
Graph (complete) has 417 edges and 98 vertex of which 94 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.7 ms
Discarding 4 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 15 ms. Remains 94 /98 variables (removed 4) and now considering 152/152 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 94/98 places, 152/156 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 45318 ms. Remains : 94/98 places, 152/156 transitions.
Built C files in :
/tmp/ltsmin18094267741419932485
[2024-05-24 17:06:11] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18094267741419932485
Running compilation step : cd /tmp/ltsmin18094267741419932485;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 526 ms.
Running link step : cd /tmp/ltsmin18094267741419932485;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin18094267741419932485;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4523285830846221590.hoa' '--buchi-type=spotba'
LTSmin run took 731 ms.
FORMULA LamportFastMutEx-PT-4-LTLFireability-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property LamportFastMutEx-PT-4-LTLFireability-07 finished in 100055 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X(!p1))))'
Support contains 4 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 180/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 99 /99 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-24 17:06:12] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
// Phase 1: matrix 144 rows 99 cols
[2024-05-24 17:06:12] [INFO ] Computed 23 invariants in 2 ms
[2024-05-24 17:06:12] [INFO ] Implicit Places using invariants in 90 ms returned [66]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 91 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/99 places, 180/180 transitions.
Applied a total of 0 rules in 5 ms. Remains 98 /98 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 100 ms. Remains : 98/99 places, 180/180 transitions.
Stuttering acceptance computed with spot in 124 ms :[p1, p1, p1, true]
Running random walk in product with property : LamportFastMutEx-PT-4-LTLFireability-08
Product exploration explored 100000 steps with 33328 reset in 124 ms.
Product exploration explored 100000 steps with 33358 reset in 152 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 100 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[p1, p1, p1, true]
RANDOM walk for 40000 steps (8 resets) in 204 ms. (195 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 92 ms. (430 steps per ms) remains 1/1 properties
[2024-05-24 17:06:13] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
// Phase 1: matrix 144 rows 98 cols
[2024-05-24 17:06:13] [INFO ] Computed 22 invariants in 1 ms
[2024-05-24 17:06:13] [INFO ] State equation strengthened by 24 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 41/45 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 41/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 88/133 variables, 45/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 12/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 41/174 variables, 17/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 17/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 3/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/174 variables, 6/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/174 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 32/206 variables, 8/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/206 variables, 32/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/206 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 36/242 variables, 36/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/242 variables, 4/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/242 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/242 variables, 6/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 242 constraints, problems are : Problem set: 0 solved, 1 unsolved in 102 ms.
Refiners :[Domain max(s): 98/98 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 98/98 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Int declared 45/242 variables, and 13 constraints, problems are : Problem set: 1 solved, 0 unsolved in 33 ms.
Refiners :[Domain max(s): 4/98 constraints, Positive P Invariants (semi-flows): 9/22 constraints, State Equation: 0/98 constraints, ReadFeed: 0/24 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 142ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 10 factoid took 229 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[true, p1, p1, (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 124 ms :[true, p1, p1, (AND (NOT p0) p1)]
Support contains 4 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 180/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-24 17:06:13] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
[2024-05-24 17:06:13] [INFO ] Invariant cache hit.
[2024-05-24 17:06:14] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-24 17:06:14] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
[2024-05-24 17:06:14] [INFO ] Invariant cache hit.
[2024-05-24 17:06:14] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-24 17:06:14] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
Running 176 sub problems to find dead transitions.
[2024-05-24 17:06:14] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
[2024-05-24 17:06:14] [INFO ] Invariant cache hit.
[2024-05-24 17:06:14] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 98/98 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 22/120 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-05-24 17:06:14] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-05-24 17:06:14] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-05-24 17:06:14] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:06:14] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-05-24 17:06:14] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:06:14] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-24 17:06:14] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-24 17:06:14] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-05-24 17:06:14] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-24 17:06:14] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2024-05-24 17:06:15] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2024-05-24 17:06:15] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:06:15] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:06:15] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:06:15] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-05-24 17:06:15] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2024-05-24 17:06:15] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-05-24 17:06:15] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:06:15] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:06:15] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD88 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 20/140 constraints. Problems are: Problem set: 11 solved, 165 unsolved
[2024-05-24 17:06:15] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2024-05-24 17:06:15] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 0 ms to minimize.
[2024-05-24 17:06:15] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:06:15] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 0 ms to minimize.
[2024-05-24 17:06:15] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-24 17:06:15] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2024-05-24 17:06:15] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:06:15] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-24 17:06:15] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-24 17:06:16] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:06:16] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:06:16] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2024-05-24 17:06:16] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
Problem TDEAD38 is UNSAT
[2024-05-24 17:06:16] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-05-24 17:06:16] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
Problem TDEAD46 is UNSAT
[2024-05-24 17:06:16] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-05-24 17:06:16] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
Problem TDEAD50 is UNSAT
[2024-05-24 17:06:16] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-24 17:06:16] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:06:16] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
Problem TDEAD38 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD102 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 20/160 constraints. Problems are: Problem set: 23 solved, 153 unsolved
[2024-05-24 17:06:16] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-05-24 17:06:16] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 0 ms to minimize.
[2024-05-24 17:06:16] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-24 17:06:16] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:06:16] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-24 17:06:17] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:06:17] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-24 17:06:17] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-05-24 17:06:17] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-24 17:06:17] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2024-05-24 17:06:17] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:06:17] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-24 17:06:17] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-05-24 17:06:17] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
Problem TDEAD80 is UNSAT
[2024-05-24 17:06:17] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-24 17:06:17] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 0 ms to minimize.
[2024-05-24 17:06:17] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-24 17:06:17] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:06:17] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:06:17] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
Problem TDEAD80 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 20/180 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:06:17] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-24 17:06:17] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-24 17:06:18] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:06:18] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-24 17:06:18] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-24 17:06:18] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-24 17:06:18] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 0 ms to minimize.
[2024-05-24 17:06:18] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
[2024-05-24 17:06:18] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:06:18] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-05-24 17:06:18] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-24 17:06:18] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-05-24 17:06:18] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-24 17:06:18] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-24 17:06:18] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 0 ms to minimize.
[2024-05-24 17:06:18] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-05-24 17:06:18] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:06:18] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:06:18] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 19/199 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:06:19] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:06:19] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 0 ms to minimize.
[2024-05-24 17:06:19] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-24 17:06:19] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-24 17:06:19] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2024-05-24 17:06:19] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-24 17:06:19] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 0 ms to minimize.
[2024-05-24 17:06:19] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 8/207 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:06:20] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-05-24 17:06:20] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:06:20] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 0 ms to minimize.
[2024-05-24 17:06:20] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:06:20] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-24 17:06:20] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:06:20] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-24 17:06:20] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 8/215 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:06:21] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:06:21] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-24 17:06:21] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 0 ms to minimize.
[2024-05-24 17:06:21] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-24 17:06:21] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
[2024-05-24 17:06:21] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-24 17:06:21] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 7/222 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:06:22] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-05-24 17:06:22] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-24 17:06:22] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:06:22] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-24 17:06:22] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-24 17:06:22] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:06:22] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/98 variables, 7/229 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:06:23] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:06:23] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:06:23] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 0 ms to minimize.
[2024-05-24 17:06:23] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:06:23] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/98 variables, 5/234 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:06:23] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-24 17:06:24] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-05-24 17:06:24] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-24 17:06:24] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 0 ms to minimize.
[2024-05-24 17:06:24] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:06:24] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 0 ms to minimize.
[2024-05-24 17:06:24] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-24 17:06:24] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/98 variables, 8/242 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:06:25] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/98 variables, 1/243 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:06:25] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-24 17:06:26] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-24 17:06:26] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:06:26] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-24 17:06:26] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-24 17:06:26] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-24 17:06:26] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2024-05-24 17:06:26] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/98 variables, 8/251 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/98 variables, 0/251 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 15 (OVERLAPS) 144/242 variables, 98/349 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/242 variables, 24/373 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:06:29] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/242 variables, 1/374 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/242 variables, 0/374 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 19 (OVERLAPS) 0/242 variables, 0/374 constraints. Problems are: Problem set: 24 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 374 constraints, problems are : Problem set: 24 solved, 152 unsolved in 19891 ms.
Refiners :[Domain max(s): 98/98 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 98/98 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 132/132 constraints]
Escalating to Integer solving :Problem set: 24 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 94/94 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 6/100 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 86/186 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/186 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 4/98 variables, 16/202 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 4/206 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 46/252 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:06:34] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:06:35] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-24 17:06:35] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 3/255 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 0/255 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 9 (OVERLAPS) 144/242 variables, 98/353 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 24/377 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 152/529 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:06:39] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-24 17:06:39] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-24 17:06:39] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-24 17:06:39] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-24 17:06:39] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 5/534 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:06:42] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-24 17:06:42] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-24 17:06:42] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
[2024-05-24 17:06:42] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-24 17:06:43] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-24 17:06:43] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/242 variables, 6/540 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/242 variables, 0/540 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:06:48] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:06:49] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/242 variables, 2/542 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:06:52] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:06:52] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:06:52] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 7 ms to minimize.
[2024-05-24 17:06:52] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-05-24 17:06:53] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 0 ms to minimize.
[2024-05-24 17:06:53] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 0 ms to minimize.
[2024-05-24 17:06:53] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:06:53] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:06:53] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-24 17:06:53] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 0 ms to minimize.
[2024-05-24 17:06:53] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 0 ms to minimize.
[2024-05-24 17:06:53] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:06:53] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 0 ms to minimize.
[2024-05-24 17:06:53] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2024-05-24 17:06:54] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-24 17:06:54] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 2 ms to minimize.
[2024-05-24 17:06:54] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/242 variables, 17/559 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/242 variables, 0/559 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:06:59] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 0 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/242 variables, 1/560 constraints. Problems are: Problem set: 24 solved, 152 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 242/242 variables, and 560 constraints, problems are : Problem set: 24 solved, 152 unsolved in 30013 ms.
Refiners :[Domain max(s): 98/98 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 98/98 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 152/176 constraints, Known Traps: 166/166 constraints]
After SMT, in 49953ms problems are : Problem set: 24 solved, 152 unsolved
Search for dead transitions found 24 dead transitions in 49956ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in LTL mode, iteration 1 : 98/98 places, 156/180 transitions.
Applied a total of 0 rules in 1 ms. Remains 98 /98 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 50163 ms. Remains : 98/98 places, 156/180 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 113 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[true, p1, p1, (AND (NOT p0) p1)]
RANDOM walk for 2052 steps (0 resets) in 24 ms. (82 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 213 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[true, p1, p1, (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 143 ms :[true, p1, p1, (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 137 ms :[true, p1, p1, (AND (NOT p0) p1)]
Entered a terminal (fully accepting) state of product in 91 steps with 0 reset in 1 ms.
FORMULA LamportFastMutEx-PT-4-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-4-LTLFireability-08 finished in 52598 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||X(p1)) U G((p0||G(!p0)))))'
Support contains 3 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 180/180 transitions.
Applied a total of 0 rules in 3 ms. Remains 99 /99 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-24 17:07:05] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
// Phase 1: matrix 144 rows 99 cols
[2024-05-24 17:07:05] [INFO ] Computed 23 invariants in 1 ms
[2024-05-24 17:07:05] [INFO ] Implicit Places using invariants in 97 ms returned [66]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 102 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/99 places, 180/180 transitions.
Applied a total of 0 rules in 1 ms. Remains 98 /98 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 106 ms. Remains : 98/99 places, 180/180 transitions.
Stuttering acceptance computed with spot in 113 ms :[false, (AND p0 (NOT p1)), true, (AND p0 p1)]
Running random walk in product with property : LamportFastMutEx-PT-4-LTLFireability-09
Entered a terminal (fully accepting) state of product in 52143 steps with 10427 reset in 68 ms.
FORMULA LamportFastMutEx-PT-4-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-4-LTLFireability-09 finished in 306 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 180/180 transitions.
Applied a total of 0 rules in 1 ms. Remains 99 /99 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-24 17:07:05] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
[2024-05-24 17:07:05] [INFO ] Invariant cache hit.
[2024-05-24 17:07:05] [INFO ] Implicit Places using invariants in 68 ms returned [66]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 69 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/99 places, 180/180 transitions.
Applied a total of 0 rules in 1 ms. Remains 98 /98 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 72 ms. Remains : 98/99 places, 180/180 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : LamportFastMutEx-PT-4-LTLFireability-10
Product exploration explored 100000 steps with 50000 reset in 107 ms.
Product exploration explored 100000 steps with 50000 reset in 120 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 16 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LamportFastMutEx-PT-4-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LamportFastMutEx-PT-4-LTLFireability-10 finished in 409 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 5 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 180/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 99 /99 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-24 17:07:05] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
[2024-05-24 17:07:05] [INFO ] Invariant cache hit.
[2024-05-24 17:07:05] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-24 17:07:05] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
[2024-05-24 17:07:05] [INFO ] Invariant cache hit.
[2024-05-24 17:07:05] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-24 17:07:05] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
Running 176 sub problems to find dead transitions.
[2024-05-24 17:07:05] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
[2024-05-24 17:07:05] [INFO ] Invariant cache hit.
[2024-05-24 17:07:05] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 23/122 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-05-24 17:07:06] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:07:06] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-05-24 17:07:06] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 0 ms to minimize.
[2024-05-24 17:07:06] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 0 ms to minimize.
[2024-05-24 17:07:06] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-24 17:07:06] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-24 17:07:06] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-24 17:07:06] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-05-24 17:07:06] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-05-24 17:07:06] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-05-24 17:07:06] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-24 17:07:06] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 0 ms to minimize.
[2024-05-24 17:07:06] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:07:07] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-05-24 17:07:07] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:07:07] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-05-24 17:07:07] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 0 ms to minimize.
Problem TDEAD38 is UNSAT
Problem TDEAD43 is UNSAT
[2024-05-24 17:07:07] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-05-24 17:07:07] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
Problem TDEAD46 is UNSAT
[2024-05-24 17:07:07] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD100 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 20/142 constraints. Problems are: Problem set: 19 solved, 157 unsolved
[2024-05-24 17:07:07] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-05-24 17:07:07] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-24 17:07:07] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2024-05-24 17:07:07] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
[2024-05-24 17:07:07] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-05-24 17:07:07] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 0 ms to minimize.
[2024-05-24 17:07:07] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-24 17:07:07] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-24 17:07:07] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 0 ms to minimize.
[2024-05-24 17:07:07] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-24 17:07:07] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 0 ms to minimize.
[2024-05-24 17:07:07] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-24 17:07:07] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-24 17:07:07] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-24 17:07:07] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-24 17:07:07] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2024-05-24 17:07:08] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-24 17:07:08] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-24 17:07:08] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-24 17:07:08] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
Problem TDEAD50 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD102 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 20/162 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:07:08] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-24 17:07:08] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-24 17:07:08] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-24 17:07:08] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-24 17:07:08] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-24 17:07:08] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2024-05-24 17:07:08] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-24 17:07:08] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-24 17:07:08] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-24 17:07:09] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-24 17:07:09] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-24 17:07:09] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 0 ms to minimize.
[2024-05-24 17:07:09] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-24 17:07:09] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 0 ms to minimize.
[2024-05-24 17:07:09] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 0 ms to minimize.
[2024-05-24 17:07:09] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 0 ms to minimize.
[2024-05-24 17:07:09] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:07:09] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-05-24 17:07:09] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 0 ms to minimize.
[2024-05-24 17:07:09] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 20/182 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:07:09] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-05-24 17:07:09] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
[2024-05-24 17:07:09] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 0 ms to minimize.
[2024-05-24 17:07:09] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-24 17:07:09] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-24 17:07:09] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:07:10] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-24 17:07:10] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:07:10] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-24 17:07:10] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-24 17:07:10] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 0 ms to minimize.
[2024-05-24 17:07:10] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-24 17:07:10] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-24 17:07:10] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:07:10] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-24 17:07:10] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
[2024-05-24 17:07:10] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-24 17:07:10] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 0 ms to minimize.
[2024-05-24 17:07:10] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-24 17:07:10] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 20/202 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:07:10] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:07:11] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:07:11] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-24 17:07:11] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-24 17:07:11] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:07:11] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:07:11] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 0 ms to minimize.
[2024-05-24 17:07:11] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-24 17:07:11] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-24 17:07:11] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-05-24 17:07:11] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-24 17:07:11] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2024-05-24 17:07:11] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-05-24 17:07:11] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2024-05-24 17:07:11] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-24 17:07:11] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 16/218 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:07:12] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
[2024-05-24 17:07:12] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:07:12] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-24 17:07:12] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-24 17:07:12] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 0 ms to minimize.
[2024-05-24 17:07:12] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:07:12] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:07:13] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-24 17:07:13] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-24 17:07:13] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:07:13] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 11/229 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:07:13] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 2 ms to minimize.
[2024-05-24 17:07:13] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 0 ms to minimize.
[2024-05-24 17:07:13] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:07:13] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-24 17:07:13] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2024-05-24 17:07:13] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:07:13] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-24 17:07:14] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-24 17:07:14] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-24 17:07:14] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-05-24 17:07:14] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-24 17:07:14] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 12/241 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:07:14] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-24 17:07:14] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-24 17:07:14] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:07:14] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-24 17:07:14] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:07:14] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/99 variables, 6/247 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:07:15] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-24 17:07:15] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:07:15] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2024-05-24 17:07:15] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/99 variables, 4/251 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:07:16] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2024-05-24 17:07:16] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/99 variables, 2/253 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/99 variables, 0/253 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 13 (OVERLAPS) 144/243 variables, 99/352 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/243 variables, 28/380 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/243 variables, 0/380 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 16 (OVERLAPS) 0/243 variables, 0/380 constraints. Problems are: Problem set: 24 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 380 constraints, problems are : Problem set: 24 solved, 152 unsolved in 16427 ms.
Refiners :[Domain max(s): 99/99 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 99/99 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 131/131 constraints]
Escalating to Integer solving :Problem set: 24 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 95/95 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 6/101 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 85/186 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/186 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 4/99 variables, 17/203 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 4/207 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 46/253 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 0/253 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 8 (OVERLAPS) 144/243 variables, 99/352 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/243 variables, 28/380 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/243 variables, 152/532 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:07:26] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-24 17:07:26] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-24 17:07:26] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-24 17:07:27] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/243 variables, 4/536 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:07:28] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-24 17:07:28] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-24 17:07:28] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/243 variables, 3/539 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:07:31] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2024-05-24 17:07:32] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/243 variables, 2/541 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:07:35] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/243 variables, 1/542 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:07:39] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-24 17:07:39] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-24 17:07:39] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/243 variables, 3/545 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/243 variables, 0/545 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:07:44] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-24 17:07:44] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/243 variables, 2/547 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 17:07:48] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-05-24 17:07:48] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-24 17:07:48] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-24 17:07:48] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/243 variables, 4/551 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/243 variables, 0/551 constraints. Problems are: Problem set: 24 solved, 152 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 243/243 variables, and 551 constraints, problems are : Problem set: 24 solved, 152 unsolved in 30025 ms.
Refiners :[Domain max(s): 99/99 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 99/99 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 152/176 constraints, Known Traps: 150/150 constraints]
After SMT, in 46496ms problems are : Problem set: 24 solved, 152 unsolved
Search for dead transitions found 24 dead transitions in 46498ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in LTL mode, iteration 1 : 99/99 places, 156/180 transitions.
Applied a total of 0 rules in 6 ms. Remains 99 /99 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 46721 ms. Remains : 99/99 places, 156/180 transitions.
Stuttering acceptance computed with spot in 147 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-PT-4-LTLFireability-11
Entered a terminal (fully accepting) state of product in 58 steps with 0 reset in 1 ms.
FORMULA LamportFastMutEx-PT-4-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-4-LTLFireability-11 finished in 46880 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p0) U (G(!p0)&&p1))))'
Support contains 4 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 180/180 transitions.
Applied a total of 0 rules in 1 ms. Remains 99 /99 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-24 17:07:52] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
[2024-05-24 17:07:52] [INFO ] Invariant cache hit.
[2024-05-24 17:07:52] [INFO ] Implicit Places using invariants in 73 ms returned [66]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 74 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/99 places, 180/180 transitions.
Applied a total of 0 rules in 0 ms. Remains 98 /98 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 76 ms. Remains : 98/99 places, 180/180 transitions.
Stuttering acceptance computed with spot in 153 ms :[p0, (OR (NOT p1) p0), true, (OR (NOT p1) p0)]
Running random walk in product with property : LamportFastMutEx-PT-4-LTLFireability-14
Entered a terminal (fully accepting) state of product in 26 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-PT-4-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-4-LTLFireability-14 finished in 267 ms.
All properties solved by simple procedures.
Total runtime 204604 ms.

BK_STOP 1716570472940

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;