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.r223-tall-171649611100279.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 greatspnxred
Input is LamportFastMutEx-PT-4, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-tall-171649611100279
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1716533316036

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-PT-4
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 06:48:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-24 06:48:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 06:48:37] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2024-05-24 06:48:37] [INFO ] Transformed 135 places.
[2024-05-24 06:48:37] [INFO ] Transformed 230 transitions.
[2024-05-24 06:48:37] [INFO ] Found NUPN structural information;
[2024-05-24 06:48:37] [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 06:48:37] [INFO ] Parsed PT model containing 135 places and 230 transitions and 990 arcs in 167 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 33 places in 2 ms
Reduce places removed 33 places and 50 transitions.
FORMULA LamportFastMutEx-PT-4-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-4-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-4-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-4-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-4-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 948 ms. (42 steps per ms) remains 5/11 properties
FORMULA LamportFastMutEx-PT-4-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-4-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-4-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-4-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-4-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-4-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (8 resets) in 1035 ms. (38 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1096 ms. (36 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (8 resets) in 178 ms. (223 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 5/5 properties
[2024-05-24 06:48:38] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
// Phase 1: matrix 144 rows 102 cols
[2024-05-24 06:48:38] [INFO ] Computed 26 invariants in 12 ms
[2024-05-24 06:48:38] [INFO ] State equation strengthened by 40 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 88/88 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 11/99 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem LamportFastMutEx-PT-4-ReachabilityFireability-2024-13 is UNSAT
FORMULA LamportFastMutEx-PT-4-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 14/102 variables, 15/114 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 14/128 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/128 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 144/246 variables, 102/230 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 40/270 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 0/270 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/246 variables, 0/270 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 270 constraints, problems are : Problem set: 1 solved, 4 unsolved in 518 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 85/85 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Problem LamportFastMutEx-PT-4-ReachabilityFireability-2024-04 is UNSAT
FORMULA LamportFastMutEx-PT-4-ReachabilityFireability-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
Problem LamportFastMutEx-PT-4-ReachabilityFireability-2024-09 is UNSAT
FORMULA LamportFastMutEx-PT-4-ReachabilityFireability-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 6/91 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-05-24 06:48:39] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 10 ms to minimize.
[2024-05-24 06:48:39] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 2/93 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/93 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 17/102 variables, 20/113 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 17/130 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-05-24 06:48:39] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 2 ms to minimize.
[2024-05-24 06:48:39] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-24 06:48:39] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2024-05-24 06:48:39] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2024-05-24 06:48:39] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 17 ms to minimize.
[2024-05-24 06:48:40] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-05-24 06:48:40] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
Problem LamportFastMutEx-PT-4-ReachabilityFireability-2024-14 is UNSAT
FORMULA LamportFastMutEx-PT-4-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 7/137 constraints. Problems are: Problem set: 4 solved, 1 unsolved
[2024-05-24 06:48:40] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 1/138 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/138 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 144/246 variables, 102/240 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 40/280 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 1/281 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/246 variables, 0/281 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/246 variables, 0/281 constraints. Problems are: Problem set: 4 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 281 constraints, problems are : Problem set: 4 solved, 1 unsolved in 1262 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 1/5 constraints, Known Traps: 10/10 constraints]
After SMT, in 2073ms problems are : Problem set: 4 solved, 1 unsolved
Parikh walk visited 0 properties in 22 ms.
Support contains 70 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 180/180 transitions.
Applied a total of 0 rules in 19 ms. Remains 102 /102 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 102/102 places, 180/180 transitions.
RANDOM walk for 40000 steps (8 resets) in 144 ms. (275 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 593 ms. (67 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1700300 steps, run timeout after 3001 ms. (steps per millisecond=566 ) properties seen :0 out of 1
Probabilistic random walk after 1700300 steps, saw 394459 distinct states, run finished after 3006 ms. (steps per millisecond=565 ) properties seen :0
[2024-05-24 06:48:43] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
[2024-05-24 06:48:43] [INFO ] Invariant cache hit.
[2024-05-24 06:48:43] [INFO ] State equation strengthened by 40 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 6/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/102 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 32/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 144/246 variables, 102/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 40/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/246 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 270 constraints, problems are : Problem set: 0 solved, 1 unsolved in 118 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 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/70 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 6/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/102 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 32/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 06:48:44] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-05-24 06:48:44] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 144/246 variables, 102/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 40/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/246 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 273 constraints, problems are : Problem set: 0 solved, 1 unsolved in 473 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 640ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 69 ms.
Support contains 70 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 180/180 transitions.
Applied a total of 0 rules in 6 ms. Remains 102 /102 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 102/102 places, 180/180 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 180/180 transitions.
Applied a total of 0 rules in 5 ms. Remains 102 /102 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-24 06:48:44] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
[2024-05-24 06:48:44] [INFO ] Invariant cache hit.
[2024-05-24 06:48:44] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-24 06:48:44] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
[2024-05-24 06:48:44] [INFO ] Invariant cache hit.
[2024-05-24 06:48:44] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-24 06:48:44] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
[2024-05-24 06:48:44] [INFO ] Redundant transitions in 6 ms returned []
Running 176 sub problems to find dead transitions.
[2024-05-24 06:48:44] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
[2024-05-24 06:48:44] [INFO ] Invariant cache hit.
[2024-05-24 06:48:44] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 26/128 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-05-24 06:48:45] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-05-24 06:48:45] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-24 06:48:45] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-05-24 06:48:45] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-24 06:48:45] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-24 06:48:45] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-05-24 06:48:45] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 0 ms to minimize.
[2024-05-24 06:48:45] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-05-24 06:48:45] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2024-05-24 06:48:45] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-24 06:48:46] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-24 06:48:46] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-05-24 06:48:46] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-24 06:48:46] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-24 06:48:46] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-24 06:48:46] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2024-05-24 06:48:46] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-24 06:48:46] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-05-24 06:48:46] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-24 06:48:46] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD79 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 20/148 constraints. Problems are: Problem set: 6 solved, 170 unsolved
[2024-05-24 06:48:46] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-05-24 06:48:46] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2024-05-24 06:48:46] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 5 ms to minimize.
[2024-05-24 06:48:46] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-24 06:48:46] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-24 06:48:46] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-24 06:48:46] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-24 06:48:46] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-24 06:48:46] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
[2024-05-24 06:48:46] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-24 06:48:46] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-05-24 06:48:47] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-24 06:48:47] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-05-24 06:48:47] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-24 06:48:47] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-24 06:48:47] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-24 06:48:47] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-24 06:48:47] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-24 06:48:47] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-24 06:48:47] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
Problem TDEAD38 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD92 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 20/168 constraints. Problems are: Problem set: 12 solved, 164 unsolved
[2024-05-24 06:48:47] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-24 06:48:47] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-24 06:48:47] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-24 06:48:47] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 7 ms to minimize.
[2024-05-24 06:48:48] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-05-24 06:48:48] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-24 06:48:48] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-05-24 06:48:48] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-05-24 06:48:48] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 0 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-05-24 06:48:48] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
Problem TDEAD46 is UNSAT
[2024-05-24 06:48:48] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-05-24 06:48:48] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
Problem TDEAD50 is UNSAT
[2024-05-24 06:48:48] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-24 06:48:48] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2024-05-24 06:48:48] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-05-24 06:48:48] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-24 06:48:48] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-24 06:48:48] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
[2024-05-24 06:48:48] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-24 06:48:48] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
Problem TDEAD28 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD102 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 20/188 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:48:48] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-24 06:48:48] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-24 06:48:48] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-24 06:48:48] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-24 06:48:49] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 0 ms to minimize.
[2024-05-24 06:48:49] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-24 06:48:49] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-24 06:48:49] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-24 06:48:49] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-05-24 06:48:49] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-05-24 06:48:49] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-05-24 06:48:49] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-24 06:48:49] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-24 06:48:49] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-24 06:48:49] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-24 06:48:49] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 0 ms to minimize.
[2024-05-24 06:48:49] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-24 06:48:49] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-24 06:48:49] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 0 ms to minimize.
[2024-05-24 06:48:49] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 20/208 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:48:50] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2024-05-24 06:48:50] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-24 06:48:50] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-24 06:48:50] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-05-24 06:48:50] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-24 06:48:50] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 0 ms to minimize.
[2024-05-24 06:48:50] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-24 06:48:50] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-24 06:48:50] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-24 06:48:50] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-24 06:48:50] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-05-24 06:48:50] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-24 06:48:50] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-05-24 06:48:50] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-24 06:48:50] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-24 06:48:50] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 16/224 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:48:51] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-24 06:48:51] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-24 06:48:51] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-24 06:48:51] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-24 06:48:52] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 0 ms to minimize.
[2024-05-24 06:48:52] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-24 06:48:52] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-24 06:48:52] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-24 06:48:52] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 0 ms to minimize.
[2024-05-24 06:48:52] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-24 06:48:52] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2024-05-24 06:48:52] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-24 06:48:52] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-24 06:48:52] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2024-05-24 06:48:52] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-24 06:48:52] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 16/240 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:48:52] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2024-05-24 06:48:53] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2024-05-24 06:48:53] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-24 06:48:53] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 4/244 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:48:53] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-24 06:48:53] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-24 06:48:53] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-24 06:48:53] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 0 ms to minimize.
[2024-05-24 06:48:53] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-24 06:48:53] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-24 06:48:53] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-24 06:48:53] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-24 06:48:53] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-24 06:48:54] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 0 ms to minimize.
[2024-05-24 06:48:54] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-24 06:48:54] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-24 06:48:54] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-24 06:48:54] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-24 06:48:54] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-24 06:48:54] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 16/260 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:48:55] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-24 06:48:55] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2024-05-24 06:48:55] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-05-24 06:48:55] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 4/264 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:48:55] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 1/265 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:48:56] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-24 06:48:56] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-24 06:48:56] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-24 06:48:56] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-24 06:48:56] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 0 ms to minimize.
[2024-05-24 06:48:57] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-24 06:48:57] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-24 06:48:57] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-24 06:48:57] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-24 06:48:57] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-24 06:48:57] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/102 variables, 11/276 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:48:57] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/102 variables, 1/277 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:48:58] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
[2024-05-24 06:48:58] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-24 06:48:58] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2024-05-24 06:48:58] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-24 06:48:58] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/102 variables, 5/282 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:48:59] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-05-24 06:48:59] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-05-24 06:48:59] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/102 variables, 3/285 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/102 variables, 0/285 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 17 (OVERLAPS) 144/246 variables, 102/387 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/246 variables, 40/427 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/246 variables, 0/427 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 20 (OVERLAPS) 0/246 variables, 0/427 constraints. Problems are: Problem set: 24 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 427 constraints, problems are : Problem set: 24 solved, 152 unsolved in 20695 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 157/157 constraints]
Escalating to Integer solving :Problem set: 24 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 98/98 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 6/104 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 87/191 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/191 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 4/102 variables, 20/211 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 4/215 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 70/285 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:49:06] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-05-24 06:49:06] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2024-05-24 06:49:07] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-24 06:49:07] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2024-05-24 06:49:07] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 5/290 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:49:07] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-24 06:49:07] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 0 ms to minimize.
[2024-05-24 06:49:07] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-24 06:49:07] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 4/294 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:49:08] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-24 06:49:08] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2024-05-24 06:49:08] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-05-24 06:49:08] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-24 06:49:08] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 5/299 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:49:09] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-24 06:49:09] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 2/301 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:49:09] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-24 06:49:09] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-24 06:49:09] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-24 06:49:09] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 4/305 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:49:10] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/102 variables, 1/306 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:49:11] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-24 06:49:11] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/102 variables, 2/308 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:49:11] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 0 ms to minimize.
[2024-05-24 06:49:11] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 0 ms to minimize.
[2024-05-24 06:49:11] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-24 06:49:11] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-24 06:49:11] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/102 variables, 5/313 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:49:12] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/102 variables, 1/314 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:49:13] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-24 06:49:13] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/102 variables, 2/316 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/102 variables, 0/316 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 18 (OVERLAPS) 144/246 variables, 102/418 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/246 variables, 40/458 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/246 variables, 152/610 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/246 variables, 0/610 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:49:21] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
At refinement iteration 22 (OVERLAPS) 0/246 variables, 1/611 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:49:25] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-24 06:49:25] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/246 variables, 2/613 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/246 variables, 0/613 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:49:32] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
At refinement iteration 25 (OVERLAPS) 0/246 variables, 1/614 constraints. Problems are: Problem set: 24 solved, 152 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 246/246 variables, and 614 constraints, problems are : Problem set: 24 solved, 152 unsolved in 30027 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 152/176 constraints, Known Traps: 192/192 constraints]
After SMT, in 50784ms problems are : Problem set: 24 solved, 152 unsolved
Search for dead transitions found 24 dead transitions in 50790ms
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 REACHABILITY mode, iteration 1 : 102/102 places, 156/180 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-05-24 06:49:35] [INFO ] Redundant transitions in 3 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 51088 ms. Remains : 102/102 places, 156/180 transitions.
RANDOM walk for 40000 steps (8 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 387 ms. (103 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1976117 steps, run timeout after 3001 ms. (steps per millisecond=658 ) properties seen :0 out of 1
Probabilistic random walk after 1976117 steps, saw 449766 distinct states, run finished after 3004 ms. (steps per millisecond=657 ) properties seen :0
[2024-05-24 06:49:38] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
// Phase 1: matrix 128 rows 102 cols
[2024-05-24 06:49:38] [INFO ] Computed 26 invariants in 5 ms
[2024-05-24 06:49:38] [INFO ] State equation strengthened by 36 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 6/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/102 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 32/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 128/230 variables, 102/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 36/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/230 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 266 constraints, problems are : Problem set: 0 solved, 1 unsolved in 110 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 36/36 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/70 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 6/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/102 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 32/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 06:49:39] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 128/230 variables, 102/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 36/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/230 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/230 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/230 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 405 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 564ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 30 ms.
Support contains 70 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 102/102 places, 156/156 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-05-24 06:49:39] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2024-05-24 06:49:39] [INFO ] Invariant cache hit.
[2024-05-24 06:49:39] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-24 06:49:39] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2024-05-24 06:49:39] [INFO ] Invariant cache hit.
[2024-05-24 06:49:39] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-24 06:49:39] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2024-05-24 06:49:39] [INFO ] Redundant transitions in 5 ms returned []
Running 152 sub problems to find dead transitions.
[2024-05-24 06:49:39] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2024-05-24 06:49:39] [INFO ] Invariant cache hit.
[2024-05-24 06:49:39] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 98/98 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 6/104 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (OVERLAPS) 4/102 variables, 20/124 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 4/128 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 06:49:40] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-05-24 06:49:40] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-05-24 06:49:40] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2024-05-24 06:49:40] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 0 ms to minimize.
[2024-05-24 06:49:40] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-24 06:49:40] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-24 06:49:40] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-24 06:49:40] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-24 06:49:41] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-24 06:49:41] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-24 06:49:41] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-24 06:49:41] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-05-24 06:49:41] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2024-05-24 06:49:41] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-24 06:49:41] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-24 06:49:41] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-24 06:49:41] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-24 06:49:41] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-05-24 06:49:41] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-24 06:49:41] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 20/148 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 06:49:41] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-24 06:49:41] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-05-24 06:49:41] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-05-24 06:49:41] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-24 06:49:41] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2024-05-24 06:49:41] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2024-05-24 06:49:41] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 2 ms to minimize.
[2024-05-24 06:49:41] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-24 06:49:41] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-24 06:49:41] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-24 06:49:41] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-24 06:49:41] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-24 06:49:42] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2024-05-24 06:49:42] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-24 06:49:42] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-24 06:49:42] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
[2024-05-24 06:49:42] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-24 06:49:42] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-24 06:49:42] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-24 06:49:42] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 20/168 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 06:49:42] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-05-24 06:49:42] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-24 06:49:42] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-24 06:49:42] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 2 ms to minimize.
[2024-05-24 06:49:42] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-24 06:49:42] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
[2024-05-24 06:49:42] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-24 06:49:43] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-24 06:49:43] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-05-24 06:49:43] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-24 06:49:43] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 4 ms to minimize.
[2024-05-24 06:49:43] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-24 06:49:43] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-24 06:49:43] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-05-24 06:49:43] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-24 06:49:43] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-05-24 06:49:43] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
[2024-05-24 06:49:43] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-24 06:49:43] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-24 06:49:43] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 20/188 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 06:49:43] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2024-05-24 06:49:43] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-24 06:49:43] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-24 06:49:43] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-05-24 06:49:43] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-24 06:49:44] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 0 ms to minimize.
[2024-05-24 06:49:44] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-24 06:49:44] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-24 06:49:44] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2024-05-24 06:49:44] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-05-24 06:49:44] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-24 06:49:44] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-05-24 06:49:44] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-24 06:49:44] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-05-24 06:49:44] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-05-24 06:49:44] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-24 06:49:44] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-24 06:49:44] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-24 06:49:44] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 0 ms to minimize.
[2024-05-24 06:49:44] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 20/208 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 06:49:44] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-24 06:49:45] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 0 ms to minimize.
[2024-05-24 06:49:45] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-24 06:49:45] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-05-24 06:49:45] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-05-24 06:49:45] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-24 06:49:45] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-24 06:49:45] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2024-05-24 06:49:45] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-05-24 06:49:45] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 0 ms to minimize.
[2024-05-24 06:49:45] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-24 06:49:45] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
[2024-05-24 06:49:45] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-24 06:49:45] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2024-05-24 06:49:45] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-24 06:49:45] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 16/224 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 06:49:46] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-24 06:49:46] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 0 ms to minimize.
[2024-05-24 06:49:46] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
[2024-05-24 06:49:46] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-05-24 06:49:46] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 0 ms to minimize.
[2024-05-24 06:49:46] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-24 06:49:46] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2024-05-24 06:49:46] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-05-24 06:49:47] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-24 06:49:47] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-24 06:49:47] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-24 06:49:47] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-24 06:49:47] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-24 06:49:47] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 14/238 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 06:49:47] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-24 06:49:47] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-24 06:49:47] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
[2024-05-24 06:49:47] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-24 06:49:47] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-24 06:49:47] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-24 06:49:48] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 7/245 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 06:49:48] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
[2024-05-24 06:49:48] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-24 06:49:48] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-24 06:49:48] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-24 06:49:48] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-24 06:49:48] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2024-05-24 06:49:48] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-24 06:49:48] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-24 06:49:48] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-24 06:49:48] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-05-24 06:49:48] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/102 variables, 11/256 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 06:49:49] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-05-24 06:49:49] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/102 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 06:49:50] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-24 06:49:50] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-24 06:49:50] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-24 06:49:50] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-24 06:49:50] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/102 variables, 5/263 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 06:49:50] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
[2024-05-24 06:49:51] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-24 06:49:51] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-24 06:49:51] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-24 06:49:51] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-24 06:49:51] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-24 06:49:51] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/102 variables, 7/270 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 06:49:51] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/102 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 06:49:52] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 0 ms to minimize.
[2024-05-24 06:49:52] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/102 variables, 2/273 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 06:49:53] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-24 06:49:53] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-05-24 06:49:53] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-24 06:49:53] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-24 06:49:53] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-24 06:49:53] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/102 variables, 6/279 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/102 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 20 (OVERLAPS) 128/230 variables, 102/381 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/230 variables, 36/417 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 06:49:56] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2024-05-24 06:49:56] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/230 variables, 2/419 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 06:49:58] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/230 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/230 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 25 (OVERLAPS) 0/230 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 420 constraints, problems are : Problem set: 0 solved, 152 unsolved in 23871 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 154/154 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 98/98 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 6/104 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 99/203 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 4/102 variables, 20/223 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 4/227 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 55/282 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 06:50:04] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-24 06:50:04] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-05-24 06:50:04] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-24 06:50:04] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-24 06:50:04] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-24 06:50:04] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-24 06:50:05] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 0 ms to minimize.
[2024-05-24 06:50:05] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 8/290 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 06:50:05] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-24 06:50:05] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-24 06:50:05] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
[2024-05-24 06:50:05] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-24 06:50:05] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 0 ms to minimize.
[2024-05-24 06:50:05] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 6/296 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 06:50:06] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-05-24 06:50:06] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-24 06:50:06] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-24 06:50:06] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-05-24 06:50:06] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 0 ms to minimize.
[2024-05-24 06:50:06] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 6/302 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 06:50:06] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-24 06:50:07] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-24 06:50:07] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 3/305 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 06:50:07] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
[2024-05-24 06:50:07] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 2/307 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 06:50:08] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-24 06:50:08] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-24 06:50:08] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-24 06:50:08] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-24 06:50:08] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 0 ms to minimize.
[2024-05-24 06:50:08] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-05-24 06:50:08] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/102 variables, 7/314 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 06:50:09] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-24 06:50:09] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/102 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 06:50:10] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/102 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/102 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 16 (OVERLAPS) 128/230 variables, 102/419 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/230 variables, 36/455 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/230 variables, 152/607 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 06:50:13] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/230 variables, 1/608 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/230 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 06:50:20] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-24 06:50:21] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-24 06:50:22] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-05-24 06:50:22] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-24 06:50:22] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
At refinement iteration 21 (OVERLAPS) 0/230 variables, 5/613 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/230 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 06:50:30] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
At refinement iteration 23 (OVERLAPS) 0/230 variables, 1/614 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 06:50:32] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 230/230 variables, and 615 constraints, problems are : Problem set: 0 solved, 152 unsolved in 30015 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 197/197 constraints]
After SMT, in 53919ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 53922ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54094 ms. Remains : 102/102 places, 156/156 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 102 transition count 128
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 32 place count 102 transition count 124
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 36 place count 98 transition count 124
Applied a total of 36 rules in 20 ms. Remains 98 /102 variables (removed 4) and now considering 124/156 (removed 32) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 124 rows 98 cols
[2024-05-24 06:50:33] [INFO ] Computed 26 invariants in 1 ms
[2024-05-24 06:50:33] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 06:50:33] [INFO ] [Nat]Absence check using 26 positive place invariants in 4 ms returned sat
[2024-05-24 06:50:33] [INFO ] After 153ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-24 06:50:34] [INFO ] After 275ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-24 06:50:34] [INFO ] After 428ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 513 ms.
[2024-05-24 06:50:34] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2024-05-24 06:50:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 102 places, 156 transitions and 672 arcs took 3 ms.
[2024-05-24 06:50:34] [INFO ] Flatten gal took : 33 ms
Total runtime 117106 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running LamportFastMutEx-PT-4

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 102
TRANSITIONS: 156
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.003s, Sys 0.000s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1816
MODEL NAME: /home/mcc/execution/412/model
102 places, 156 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA LamportFastMutEx-PT-4-ReachabilityFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716533436877

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML

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="ReachabilityFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is LamportFastMutEx-PT-4, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r223-tall-171649611100279"
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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;