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-171649611100281.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-5, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-tall-171649611100281
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 18K Apr 13 07:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 121K Apr 13 07:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 22K Apr 13 07:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 127K Apr 13 07:42 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 9.7K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K 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 36K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 13 07:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Apr 13 07:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 51K Apr 13 07:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 276K Apr 13 07:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.2K 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 157K 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-5-CTLCardinality-2024-00
FORMULA_NAME LamportFastMutEx-PT-5-CTLCardinality-2024-01
FORMULA_NAME LamportFastMutEx-PT-5-CTLCardinality-2024-02
FORMULA_NAME LamportFastMutEx-PT-5-CTLCardinality-2024-03
FORMULA_NAME LamportFastMutEx-PT-5-CTLCardinality-2024-04
FORMULA_NAME LamportFastMutEx-PT-5-CTLCardinality-2024-05
FORMULA_NAME LamportFastMutEx-PT-5-CTLCardinality-2024-06
FORMULA_NAME LamportFastMutEx-PT-5-CTLCardinality-2024-07
FORMULA_NAME LamportFastMutEx-PT-5-CTLCardinality-2024-08
FORMULA_NAME LamportFastMutEx-PT-5-CTLCardinality-2024-09
FORMULA_NAME LamportFastMutEx-PT-5-CTLCardinality-2024-10
FORMULA_NAME LamportFastMutEx-PT-5-CTLCardinality-2024-11
FORMULA_NAME LamportFastMutEx-PT-5-CTLCardinality-2024-12
FORMULA_NAME LamportFastMutEx-PT-5-CTLCardinality-2024-13
FORMULA_NAME LamportFastMutEx-PT-5-CTLCardinality-2024-14
FORMULA_NAME LamportFastMutEx-PT-5-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716533461248

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-PT-5
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 06:51:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-24 06:51:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 06:51:02] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2024-05-24 06:51:02] [INFO ] Transformed 174 places.
[2024-05-24 06:51:02] [INFO ] Transformed 318 transitions.
[2024-05-24 06:51:02] [INFO ] Found NUPN structural information;
[2024-05-24 06:51:02] [INFO ] Completing missing partition info from NUPN : creating a component with [P_start_1_0, P_start_1_1, P_start_1_2, P_start_1_3, P_start_1_4, P_start_1_5, P_b_0_false, P_b_0_true, P_b_1_false, P_b_1_true, P_b_2_false, P_b_2_true, P_b_3_false, P_b_3_true, P_b_4_false, P_b_4_true, P_b_5_false, P_b_5_true, P_setx_3_0, P_setx_3_1, P_setx_3_2, P_setx_3_3, P_setx_3_4, P_setx_3_5, P_setbi_5_0, P_setbi_5_1, P_setbi_5_2, P_setbi_5_3, P_setbi_5_4, P_setbi_5_5, P_ify0_4_0, P_ify0_4_1, P_ify0_4_2, P_ify0_4_3, P_ify0_4_4, P_ify0_4_5, P_sety_9_0, P_sety_9_1, P_sety_9_2, P_sety_9_3, P_sety_9_4, P_sety_9_5, P_ifxi_10_0, P_ifxi_10_1, P_ifxi_10_2, P_ifxi_10_3, P_ifxi_10_4, P_ifxi_10_5, P_setbi_11_0, P_setbi_11_1, P_setbi_11_2, P_setbi_11_3, P_setbi_11_4, P_setbi_11_5, P_fordo_12_0, P_fordo_12_1, P_fordo_12_2, P_fordo_12_3, P_fordo_12_4, P_fordo_12_5, P_wait_0_0, P_wait_0_1, P_wait_0_2, P_wait_0_3, P_wait_0_4, P_wait_0_5, P_wait_1_0, P_wait_1_1, P_wait_1_2, P_wait_1_3, P_wait_1_4, P_wait_1_5, P_wait_2_0, P_wait_2_1, P_wait_2_2, P_wait_2_3, P_wait_2_4, P_wait_2_5, P_wait_3_0, P_wait_3_1, P_wait_3_2, P_wait_3_3, P_wait_3_4, P_wait_3_5, P_wait_4_0, P_wait_4_1, P_wait_4_2, P_wait_4_3, P_wait_4_4, P_wait_4_5, P_wait_5_0, P_wait_5_1, P_wait_5_2, P_wait_5_3, P_wait_5_4, P_wait_5_5, P_await_13_0, P_await_13_1, P_await_13_2, P_await_13_3, P_await_13_4, P_await_13_5, P_done_0_0, P_done_0_1, P_done_0_2, P_done_0_3, P_done_0_4, P_done_0_5, P_done_1_0, P_done_1_1, P_done_1_2, P_done_1_3, P_done_1_4, P_done_1_5, P_done_2_0, P_done_2_1, P_done_2_2, P_done_2_3, P_done_2_4, P_done_2_5, P_done_3_0, P_done_3_1, P_done_3_2, P_done_3_3, P_done_3_4, P_done_3_5, P_done_4_0, P_done_4_1, P_done_4_2, P_done_4_3, P_done_4_4, P_done_4_5, P_done_5_0, P_done_5_1, P_done_5_2, P_done_5_3, P_done_5_4, P_done_5_5, P_ifyi_15_0, P_ifyi_15_1, P_ifyi_15_2, P_ifyi_15_3, P_ifyi_15_4, P_ifyi_15_5, P_awaity_0, P_awaity_1, P_awaity_2, P_awaity_3, P_awaity_4, P_awaity_5, P_CS_21_0, P_CS_21_1, P_CS_21_2, P_CS_21_3, P_CS_21_4, P_CS_21_5, P_setbi_24_0, P_setbi_24_1, P_setbi_24_2, P_setbi_24_3, P_setbi_24_4, P_setbi_24_5]
[2024-05-24 06:51:02] [INFO ] Parsed PT model containing 174 places and 318 transitions and 1380 arcs in 177 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 58 transitions.
FORMULA LamportFastMutEx-PT-5-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-5-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 121 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 260/260 transitions.
Applied a total of 0 rules in 9 ms. Remains 137 /137 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2024-05-24 06:51:02] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2024-05-24 06:51:02] [INFO ] Computed 37 invariants in 20 ms
[2024-05-24 06:51:02] [INFO ] Implicit Places using invariants in 238 ms returned []
[2024-05-24 06:51:02] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
[2024-05-24 06:51:02] [INFO ] Invariant cache hit.
[2024-05-24 06:51:03] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-24 06:51:03] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2024-05-24 06:51:03] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
[2024-05-24 06:51:03] [INFO ] Invariant cache hit.
[2024-05-24 06:51:03] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 137/137 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 37/174 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-05-24 06:51:04] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 12 ms to minimize.
[2024-05-24 06:51:04] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 2 ms to minimize.
[2024-05-24 06:51:04] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 2 ms to minimize.
[2024-05-24 06:51:04] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-24 06:51:04] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-24 06:51:04] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-24 06:51:04] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-24 06:51:04] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2024-05-24 06:51:04] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-05-24 06:51:04] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 2 ms to minimize.
[2024-05-24 06:51:04] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 3 ms to minimize.
[2024-05-24 06:51:04] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 2 ms to minimize.
[2024-05-24 06:51:04] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 2 ms to minimize.
[2024-05-24 06:51:05] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 0 ms to minimize.
[2024-05-24 06:51:05] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-05-24 06:51:05] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
[2024-05-24 06:51:05] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-24 06:51:05] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2024-05-24 06:51:05] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-24 06:51:05] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD135 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 20/194 constraints. Problems are: Problem set: 11 solved, 244 unsolved
[2024-05-24 06:51:05] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-05-24 06:51:05] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-24 06:51:05] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-24 06:51:05] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-05-24 06:51:05] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-05-24 06:51:05] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-05-24 06:51:05] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-05-24 06:51:05] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-05-24 06:51:05] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-24 06:51:05] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-24 06:51:06] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 2 ms to minimize.
[2024-05-24 06:51:06] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-24 06:51:06] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-24 06:51:06] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 2 ms to minimize.
[2024-05-24 06:51:06] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 2 ms to minimize.
[2024-05-24 06:51:06] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-24 06:51:06] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-24 06:51:06] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-05-24 06:51:06] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 2 ms to minimize.
[2024-05-24 06:51:06] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 2 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD146 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 20/214 constraints. Problems are: Problem set: 18 solved, 237 unsolved
[2024-05-24 06:51:07] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
[2024-05-24 06:51:07] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-05-24 06:51:07] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-24 06:51:07] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-24 06:51:07] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-24 06:51:07] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-24 06:51:07] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-24 06:51:07] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-24 06:51:07] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-24 06:51:07] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-24 06:51:07] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 2 ms to minimize.
[2024-05-24 06:51:07] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-24 06:51:07] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-24 06:51:07] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-24 06:51:08] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-24 06:51:08] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-24 06:51:08] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 2 ms to minimize.
[2024-05-24 06:51:08] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
Problem TDEAD40 is UNSAT
[2024-05-24 06:51:08] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-24 06:51:08] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
Problem TDEAD40 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD148 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 20/234 constraints. Problems are: Problem set: 25 solved, 230 unsolved
[2024-05-24 06:51:08] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
[2024-05-24 06:51:08] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-24 06:51:08] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-24 06:51:08] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-05-24 06:51:08] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-24 06:51:08] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-24 06:51:08] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-24 06:51:08] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-24 06:51:08] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-05-24 06:51:08] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-24 06:51:08] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 2 ms to minimize.
[2024-05-24 06:51:09] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-24 06:51:09] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-24 06:51:09] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-24 06:51:09] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-24 06:51:09] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-24 06:51:09] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-24 06:51:09] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-24 06:51:09] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-24 06:51:09] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
Problem TDEAD120 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 20/254 constraints. Problems are: Problem set: 26 solved, 229 unsolved
[2024-05-24 06:51:09] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-24 06:51:09] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2024-05-24 06:51:09] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2024-05-24 06:51:09] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-05-24 06:51:09] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2024-05-24 06:51:10] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2024-05-24 06:51:10] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-24 06:51:10] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2024-05-24 06:51:10] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-24 06:51:10] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2024-05-24 06:51:10] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-05-24 06:51:10] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-24 06:51:10] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-05-24 06:51:10] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-05-24 06:51:10] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-05-24 06:51:10] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 17 ms to minimize.
[2024-05-24 06:51:10] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-24 06:51:10] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 1 ms to minimize.
[2024-05-24 06:51:11] [INFO ] Deduced a trap composed of 28 places in 143 ms of which 1 ms to minimize.
[2024-05-24 06:51:11] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
Problem TDEAD52 is UNSAT
Problem TDEAD100 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 20/274 constraints. Problems are: Problem set: 28 solved, 227 unsolved
[2024-05-24 06:51:11] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 0 ms to minimize.
[2024-05-24 06:51:12] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-24 06:51:12] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
[2024-05-24 06:51:12] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-24 06:51:12] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 0 ms to minimize.
[2024-05-24 06:51:12] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-05-24 06:51:12] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 1 ms to minimize.
[2024-05-24 06:51:12] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
[2024-05-24 06:51:12] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
Problem TDEAD67 is UNSAT
[2024-05-24 06:51:12] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
[2024-05-24 06:51:12] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-05-24 06:51:12] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-24 06:51:12] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-05-24 06:51:12] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-05-24 06:51:12] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-05-24 06:51:12] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2024-05-24 06:51:13] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 0 ms to minimize.
[2024-05-24 06:51:13] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-24 06:51:13] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 1 ms to minimize.
[2024-05-24 06:51:13] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 1 ms to minimize.
Problem TDEAD67 is UNSAT
Problem TDEAD142 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 20/294 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-05-24 06:51:13] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-24 06:51:13] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-05-24 06:51:13] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2024-05-24 06:51:13] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-24 06:51:13] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-05-24 06:51:13] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-24 06:51:13] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2024-05-24 06:51:13] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-24 06:51:13] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-24 06:51:14] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2024-05-24 06:51:14] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-24 06:51:14] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 0 ms to minimize.
[2024-05-24 06:51:14] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-05-24 06:51:14] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-24 06:51:14] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
[2024-05-24 06:51:14] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-05-24 06:51:14] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-05-24 06:51:14] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 0 ms to minimize.
[2024-05-24 06:51:14] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-24 06:51:14] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 20/314 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-05-24 06:51:14] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-24 06:51:14] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-24 06:51:14] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-24 06:51:15] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 0 ms to minimize.
[2024-05-24 06:51:15] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2024-05-24 06:51:15] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-05-24 06:51:15] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-05-24 06:51:15] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-24 06:51:15] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-24 06:51:15] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-24 06:51:15] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-24 06:51:15] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-05-24 06:51:15] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-24 06:51:15] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2024-05-24 06:51:16] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-05-24 06:51:16] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-24 06:51:16] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-24 06:51:16] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
[2024-05-24 06:51:16] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-24 06:51:16] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 20/334 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-05-24 06:51:17] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-24 06:51:17] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-24 06:51:17] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-24 06:51:18] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-24 06:51:18] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-24 06:51:18] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-24 06:51:18] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 1 ms to minimize.
[2024-05-24 06:51:18] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
[2024-05-24 06:51:18] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-24 06:51:18] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2024-05-24 06:51:18] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-24 06:51:18] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-24 06:51:18] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 1 ms to minimize.
[2024-05-24 06:51:18] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 1 ms to minimize.
[2024-05-24 06:51:18] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2024-05-24 06:51:19] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-24 06:51:19] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2024-05-24 06:51:19] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2024-05-24 06:51:19] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 1 ms to minimize.
[2024-05-24 06:51:19] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 20/354 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-05-24 06:51:20] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-24 06:51:20] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-24 06:51:20] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 1 ms to minimize.
[2024-05-24 06:51:20] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2024-05-24 06:51:20] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2024-05-24 06:51:20] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-24 06:51:20] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-24 06:51:20] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2024-05-24 06:51:20] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2024-05-24 06:51:20] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-24 06:51:20] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-24 06:51:21] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-24 06:51:21] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-24 06:51:21] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-24 06:51:21] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-24 06:51:21] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-24 06:51:21] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-24 06:51:21] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/137 variables, 18/372 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-05-24 06:51:22] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-24 06:51:22] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 1 ms to minimize.
[2024-05-24 06:51:22] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-24 06:51:22] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-24 06:51:22] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 1 ms to minimize.
[2024-05-24 06:51:22] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-24 06:51:22] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 0 ms to minimize.
[2024-05-24 06:51:22] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/137 variables, 8/380 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-05-24 06:51:24] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 1 ms to minimize.
[2024-05-24 06:51:24] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-24 06:51:24] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 1 ms to minimize.
[2024-05-24 06:51:24] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 0 ms to minimize.
[2024-05-24 06:51:25] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 0 ms to minimize.
[2024-05-24 06:51:25] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-24 06:51:25] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/137 variables, 7/387 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-05-24 06:51:25] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-24 06:51:25] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-24 06:51:26] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-24 06:51:26] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-05-24 06:51:26] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 2 ms to minimize.
[2024-05-24 06:51:26] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2024-05-24 06:51:26] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 1 ms to minimize.
[2024-05-24 06:51:26] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-05-24 06:51:26] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 1 ms to minimize.
[2024-05-24 06:51:26] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 0 ms to minimize.
[2024-05-24 06:51:27] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 0 ms to minimize.
[2024-05-24 06:51:27] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/137 variables, 12/399 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-05-24 06:51:28] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-24 06:51:28] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-24 06:51:28] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 3 ms to minimize.
[2024-05-24 06:51:28] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/137 variables, 4/403 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-05-24 06:51:29] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2024-05-24 06:51:30] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-24 06:51:30] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 0 ms to minimize.
[2024-05-24 06:51:30] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/137 variables, 4/407 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-05-24 06:51:31] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-24 06:51:31] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/137 variables, 2/409 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-05-24 06:51:32] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2024-05-24 06:51:32] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 1 ms to minimize.
[2024-05-24 06:51:32] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-24 06:51:33] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-24 06:51:33] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2024-05-24 06:51:33] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 137/337 variables, and 415 constraints, problems are : Problem set: 30 solved, 225 unsolved in 30019 ms.
Refiners :[Domain max(s): 137/137 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 0/137 constraints, ReadFeed: 0/55 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 241/241 constraints]
Escalating to Integer solving :Problem set: 30 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 132/132 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 7/139 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 138/277 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/277 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 4 (OVERLAPS) 5/137 variables, 30/307 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 5/312 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 103/415 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-05-24 06:51:35] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2024-05-24 06:51:35] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-24 06:51:35] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-24 06:51:35] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-24 06:51:35] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2024-05-24 06:51:36] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
[2024-05-24 06:51:36] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
[2024-05-24 06:51:36] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 2 ms to minimize.
[2024-05-24 06:51:36] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
[2024-05-24 06:51:36] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2024-05-24 06:51:36] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-24 06:51:36] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-24 06:51:36] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-05-24 06:51:36] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
[2024-05-24 06:51:36] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 4 ms to minimize.
[2024-05-24 06:51:36] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-24 06:51:37] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-24 06:51:37] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-24 06:51:37] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-05-24 06:51:37] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 20/435 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-05-24 06:51:37] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 17 ms to minimize.
[2024-05-24 06:51:38] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-05-24 06:51:38] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2024-05-24 06:51:38] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-24 06:51:38] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2024-05-24 06:51:38] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2024-05-24 06:51:38] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2024-05-24 06:51:38] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-05-24 06:51:38] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-05-24 06:51:38] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-24 06:51:39] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 0 ms to minimize.
[2024-05-24 06:51:39] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-24 06:51:39] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-24 06:51:39] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-24 06:51:39] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 0 ms to minimize.
[2024-05-24 06:51:39] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-24 06:51:39] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 0 ms to minimize.
[2024-05-24 06:51:39] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-05-24 06:51:39] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-05-24 06:51:39] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 20/455 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-05-24 06:51:39] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 0 ms to minimize.
[2024-05-24 06:51:40] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-24 06:51:40] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-05-24 06:51:40] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-05-24 06:51:41] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 0 ms to minimize.
[2024-05-24 06:51:41] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
[2024-05-24 06:51:41] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-05-24 06:51:41] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
[2024-05-24 06:51:41] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2024-05-24 06:51:41] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-05-24 06:51:41] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 0 ms to minimize.
[2024-05-24 06:51:41] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-24 06:51:41] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 13/468 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-05-24 06:51:42] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-24 06:51:43] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2024-05-24 06:51:43] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 1 ms to minimize.
[2024-05-24 06:51:43] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-05-24 06:51:43] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2024-05-24 06:51:43] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 0 ms to minimize.
[2024-05-24 06:51:43] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2024-05-24 06:51:43] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 8/476 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-05-24 06:51:44] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
[2024-05-24 06:51:44] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-05-24 06:51:44] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-05-24 06:51:44] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-24 06:51:45] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 1 ms to minimize.
[2024-05-24 06:51:45] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-05-24 06:51:45] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-05-24 06:51:45] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/137 variables, 8/484 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-05-24 06:51:46] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-24 06:51:46] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 1 ms to minimize.
[2024-05-24 06:51:47] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-24 06:51:47] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-24 06:51:47] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2024-05-24 06:51:47] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2024-05-24 06:51:47] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2024-05-24 06:51:47] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-05-24 06:51:47] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-24 06:51:47] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2024-05-24 06:51:47] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/137 variables, 11/495 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-05-24 06:51:48] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-24 06:51:48] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-05-24 06:51:48] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-24 06:51:48] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
[2024-05-24 06:51:48] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 0 ms to minimize.
[2024-05-24 06:51:48] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 1 ms to minimize.
[2024-05-24 06:51:48] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-05-24 06:51:49] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 0 ms to minimize.
[2024-05-24 06:51:49] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 1 ms to minimize.
[2024-05-24 06:51:49] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2024-05-24 06:51:49] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-24 06:51:50] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 0 ms to minimize.
[2024-05-24 06:51:50] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-24 06:51:50] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-05-24 06:51:50] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/137 variables, 15/510 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-05-24 06:51:50] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 1 ms to minimize.
[2024-05-24 06:51:50] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2024-05-24 06:51:50] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 0 ms to minimize.
[2024-05-24 06:51:51] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 0 ms to minimize.
[2024-05-24 06:51:51] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-24 06:51:51] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-24 06:51:52] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-24 06:51:52] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-05-24 06:51:52] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2024-05-24 06:51:52] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 0 ms to minimize.
[2024-05-24 06:51:52] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 3 ms to minimize.
[2024-05-24 06:51:52] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/137 variables, 12/522 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-05-24 06:51:53] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-05-24 06:51:53] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-24 06:51:54] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/137 variables, 3/525 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-05-24 06:51:54] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2024-05-24 06:51:55] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2024-05-24 06:51:55] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-24 06:51:55] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 0 ms to minimize.
[2024-05-24 06:51:55] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-05-24 06:51:55] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-24 06:51:56] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-24 06:51:56] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
[2024-05-24 06:51:56] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 0 ms to minimize.
[2024-05-24 06:51:56] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 1 ms to minimize.
[2024-05-24 06:51:56] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 0 ms to minimize.
[2024-05-24 06:51:57] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-24 06:51:57] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-05-24 06:51:57] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-24 06:51:57] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/137 variables, 15/540 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-05-24 06:51:58] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-24 06:51:58] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-24 06:51:58] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2024-05-24 06:51:59] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2024-05-24 06:51:59] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 ms to minimize.
[2024-05-24 06:51:59] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-24 06:51:59] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 0 ms to minimize.
[2024-05-24 06:51:59] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-24 06:51:59] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 0 ms to minimize.
[2024-05-24 06:51:59] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/137 variables, 10/550 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-05-24 06:52:00] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-05-24 06:52:00] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-05-24 06:52:00] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-05-24 06:52:00] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2024-05-24 06:52:00] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-24 06:52:01] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-24 06:52:01] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/137 variables, 7/557 constraints. Problems are: Problem set: 30 solved, 225 unsolved
[2024-05-24 06:52:03] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 137/337 variables, and 558 constraints, problems are : Problem set: 30 solved, 225 unsolved in 30031 ms.
Refiners :[Domain max(s): 137/137 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 0/137 constraints, ReadFeed: 0/55 constraints, PredecessorRefiner: 0/255 constraints, Known Traps: 384/384 constraints]
After SMT, in 60206ms problems are : Problem set: 30 solved, 225 unsolved
Search for dead transitions found 30 dead transitions in 60221ms
Found 30 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 30 transitions
Dead transitions reduction (with SMT) removed 30 transitions
Starting structural reductions in LTL mode, iteration 1 : 137/137 places, 230/260 transitions.
Applied a total of 0 rules in 2 ms. Remains 137 /137 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60675 ms. Remains : 137/137 places, 230/260 transitions.
Support contains 121 out of 137 places after structural reductions.
[2024-05-24 06:52:03] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-24 06:52:03] [INFO ] Flatten gal took : 80 ms
FORMULA LamportFastMutEx-PT-5-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-5-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 06:52:03] [INFO ] Flatten gal took : 51 ms
[2024-05-24 06:52:03] [INFO ] Input system was already deterministic with 230 transitions.
RANDOM walk for 40000 steps (8 resets) in 3026 ms. (13 steps per ms) remains 16/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 63 ms. (62 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 16/16 properties
[2024-05-24 06:52:05] [INFO ] Flow matrix only has 180 transitions (discarded 50 similar events)
// Phase 1: matrix 180 rows 137 cols
[2024-05-24 06:52:05] [INFO ] Computed 37 invariants in 5 ms
[2024-05-24 06:52:05] [INFO ] State equation strengthened by 50 read => feed constraints.
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
After SMT solving in domain Real declared 75/317 variables, and 75 constraints, problems are : Problem set: 16 solved, 0 unsolved in 123 ms.
Refiners :[Domain max(s): 75/137 constraints, Positive P Invariants (semi-flows): 0/37 constraints, State Equation: 0/137 constraints, ReadFeed: 0/50 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 146ms problems are : Problem set: 16 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 16 atomic propositions for a total of 12 simplifications.
[2024-05-24 06:52:05] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-24 06:52:05] [INFO ] Flatten gal took : 30 ms
[2024-05-24 06:52:05] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA LamportFastMutEx-PT-5-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-5-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-5-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 06:52:05] [INFO ] Flatten gal took : 13 ms
[2024-05-24 06:52:05] [INFO ] Input system was already deterministic with 230 transitions.
Support contains 64 out of 137 places (down from 107) after GAL structural reductions.
Computed a total of 1 stabilizing places and 5 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 230/230 transitions.
Applied a total of 0 rules in 3 ms. Remains 137 /137 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 137/137 places, 230/230 transitions.
[2024-05-24 06:52:05] [INFO ] Flatten gal took : 11 ms
[2024-05-24 06:52:05] [INFO ] Flatten gal took : 28 ms
[2024-05-24 06:52:05] [INFO ] Input system was already deterministic with 230 transitions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 230/230 transitions.
Applied a total of 0 rules in 4 ms. Remains 137 /137 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 137/137 places, 230/230 transitions.
[2024-05-24 06:52:05] [INFO ] Flatten gal took : 15 ms
[2024-05-24 06:52:05] [INFO ] Flatten gal took : 12 ms
[2024-05-24 06:52:05] [INFO ] Input system was already deterministic with 230 transitions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 230/230 transitions.
Applied a total of 0 rules in 4 ms. Remains 137 /137 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 137/137 places, 230/230 transitions.
[2024-05-24 06:52:05] [INFO ] Flatten gal took : 10 ms
[2024-05-24 06:52:05] [INFO ] Flatten gal took : 10 ms
[2024-05-24 06:52:05] [INFO ] Input system was already deterministic with 230 transitions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 230/230 transitions.
Applied a total of 0 rules in 4 ms. Remains 137 /137 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 137/137 places, 230/230 transitions.
[2024-05-24 06:52:05] [INFO ] Flatten gal took : 21 ms
[2024-05-24 06:52:05] [INFO ] Flatten gal took : 17 ms
[2024-05-24 06:52:05] [INFO ] Input system was already deterministic with 230 transitions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 230/230 transitions.
Applied a total of 0 rules in 4 ms. Remains 137 /137 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 137/137 places, 230/230 transitions.
[2024-05-24 06:52:05] [INFO ] Flatten gal took : 8 ms
[2024-05-24 06:52:05] [INFO ] Flatten gal took : 13 ms
[2024-05-24 06:52:05] [INFO ] Input system was already deterministic with 230 transitions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 230/230 transitions.
Applied a total of 0 rules in 13 ms. Remains 137 /137 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 137/137 places, 230/230 transitions.
[2024-05-24 06:52:05] [INFO ] Flatten gal took : 7 ms
[2024-05-24 06:52:05] [INFO ] Flatten gal took : 9 ms
[2024-05-24 06:52:05] [INFO ] Input system was already deterministic with 230 transitions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 230/230 transitions.
Applied a total of 0 rules in 4 ms. Remains 137 /137 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 137/137 places, 230/230 transitions.
[2024-05-24 06:52:05] [INFO ] Flatten gal took : 24 ms
[2024-05-24 06:52:05] [INFO ] Flatten gal took : 8 ms
[2024-05-24 06:52:05] [INFO ] Input system was already deterministic with 230 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 137/137 places, 230/230 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 133 transition count 226
Applied a total of 8 rules in 52 ms. Remains 133 /137 variables (removed 4) and now considering 226/230 (removed 4) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 52 ms. Remains : 133/137 places, 226/230 transitions.
[2024-05-24 06:52:05] [INFO ] Flatten gal took : 23 ms
[2024-05-24 06:52:05] [INFO ] Flatten gal took : 7 ms
[2024-05-24 06:52:06] [INFO ] Input system was already deterministic with 226 transitions.
RANDOM walk for 701 steps (0 resets) in 5 ms. (116 steps per ms) remains 0/1 properties
FORMULA LamportFastMutEx-PT-5-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 137/137 places, 230/230 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 133 transition count 226
Applied a total of 8 rules in 11 ms. Remains 133 /137 variables (removed 4) and now considering 226/230 (removed 4) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 133/137 places, 226/230 transitions.
[2024-05-24 06:52:06] [INFO ] Flatten gal took : 7 ms
[2024-05-24 06:52:06] [INFO ] Flatten gal took : 19 ms
[2024-05-24 06:52:06] [INFO ] Input system was already deterministic with 226 transitions.
[2024-05-24 06:52:06] [INFO ] Flatten gal took : 24 ms
[2024-05-24 06:52:06] [INFO ] Flatten gal took : 7 ms
[2024-05-24 06:52:06] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-24 06:52:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 137 places, 230 transitions and 1000 arcs took 2 ms.
Total runtime 63833 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running LamportFastMutEx-PT-5

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 137
TRANSITIONS: 230
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.002s, Sys 0.005s]


SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.001s, 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: 1707
MODEL NAME: /home/mcc/execution/413/model
137 places, 230 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-5-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA LamportFastMutEx-PT-5-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA LamportFastMutEx-PT-5-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA LamportFastMutEx-PT-5-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA LamportFastMutEx-PT-5-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA LamportFastMutEx-PT-5-CTLCardinality-2024-08 CANNOT_COMPUTE
FORMULA LamportFastMutEx-PT-5-CTLCardinality-2024-12 CANNOT_COMPUTE
FORMULA LamportFastMutEx-PT-5-CTLCardinality-2024-14 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716534112236

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 CTLCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="LamportFastMutEx-PT-5"
export BK_EXAMINATION="CTLCardinality"
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-5, examination is CTLCardinality"
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-171649611100281"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-PT-5.tgz
mv LamportFastMutEx-PT-5 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;