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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 15K Apr 13 07:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 13 07:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 45K Apr 13 07:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 253K 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 8.3K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 22 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 13 07:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 13 07:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 72K Apr 13 07:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 382K Apr 13 07:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.1K 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 208K 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-6-CTLCardinality-2024-00
FORMULA_NAME LamportFastMutEx-PT-6-CTLCardinality-2024-01
FORMULA_NAME LamportFastMutEx-PT-6-CTLCardinality-2024-02
FORMULA_NAME LamportFastMutEx-PT-6-CTLCardinality-2024-03
FORMULA_NAME LamportFastMutEx-PT-6-CTLCardinality-2024-04
FORMULA_NAME LamportFastMutEx-PT-6-CTLCardinality-2024-05
FORMULA_NAME LamportFastMutEx-PT-6-CTLCardinality-2024-06
FORMULA_NAME LamportFastMutEx-PT-6-CTLCardinality-2024-07
FORMULA_NAME LamportFastMutEx-PT-6-CTLCardinality-2024-08
FORMULA_NAME LamportFastMutEx-PT-6-CTLCardinality-2024-09
FORMULA_NAME LamportFastMutEx-PT-6-CTLCardinality-2024-10
FORMULA_NAME LamportFastMutEx-PT-6-CTLCardinality-2024-11
FORMULA_NAME LamportFastMutEx-PT-6-CTLCardinality-2024-12
FORMULA_NAME LamportFastMutEx-PT-6-CTLCardinality-2024-13
FORMULA_NAME LamportFastMutEx-PT-6-CTLCardinality-2024-14
FORMULA_NAME LamportFastMutEx-PT-6-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716533891129

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-6
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 06:58:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-24 06:58:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 06:58:12] [INFO ] Load time of PNML (sax parser for PT used): 117 ms
[2024-05-24 06:58:12] [INFO ] Transformed 217 places.
[2024-05-24 06:58:12] [INFO ] Transformed 420 transitions.
[2024-05-24 06:58:12] [INFO ] Found NUPN structural information;
[2024-05-24 06:58:12] [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_start_1_6, 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_b_6_false, P_b_6_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_setx_3_6, 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_setbi_5_6, 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_ify0_4_6, 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_sety_9_6, 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_ifxi_10_6, 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_setbi_11_6, 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_fordo_12_6, 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_0_6, 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_1_6, 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_2_6, 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_3_6, 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_4_6, 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_wait_5_6, P_wait_6_0, P_wait_6_1, P_wait_6_2, P_wait_6_3, P_wait_6_4, P_wait_6_5, P_wait_6_6, 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_await_13_6, 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_0_6, 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_1_6, 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_2_6, 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_3_6, 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_4_6, 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_done_5_6, P_done_6_0, P_done_6_1, P_done_6_2, P_done_6_3, P_done_6_4, P_done_6_5, P_done_6_6, 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_ifyi_15_6, P_awaity_0, P_awaity_1, P_awaity_2, P_awaity_3, P_awaity_4, P_awaity_5, P_awaity_6, 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_CS_21_6, P_setbi_24_0, P_setbi_24_1, P_setbi_24_2, P_setbi_24_3, P_setbi_24_4, P_setbi_24_5, P_setbi_24_6]
[2024-05-24 06:58:12] [INFO ] Parsed PT model containing 217 places and 420 transitions and 1834 arcs in 218 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 18 ms.
Deduced a syphon composed of 41 places in 6 ms
Reduce places removed 41 places and 66 transitions.
Support contains 146 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 11 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2024-05-24 06:58:12] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2024-05-24 06:58:12] [INFO ] Computed 50 invariants in 18 ms
[2024-05-24 06:58:13] [INFO ] Implicit Places using invariants in 283 ms returned []
[2024-05-24 06:58:13] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2024-05-24 06:58:13] [INFO ] Invariant cache hit.
[2024-05-24 06:58:13] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-24 06:58:13] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 598 ms to find 0 implicit places.
Running 348 sub problems to find dead transitions.
[2024-05-24 06:58:13] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2024-05-24 06:58:13] [INFO ] Invariant cache hit.
[2024-05-24 06:58:13] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 176/176 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 50/226 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-05-24 06:58:15] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 17 ms to minimize.
[2024-05-24 06:58:15] [INFO ] Deduced a trap composed of 27 places in 171 ms of which 1 ms to minimize.
[2024-05-24 06:58:15] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 2 ms to minimize.
[2024-05-24 06:58:15] [INFO ] Deduced a trap composed of 38 places in 387 ms of which 14 ms to minimize.
[2024-05-24 06:58:15] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 1 ms to minimize.
[2024-05-24 06:58:16] [INFO ] Deduced a trap composed of 18 places in 133 ms of which 2 ms to minimize.
[2024-05-24 06:58:16] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 6 ms to minimize.
[2024-05-24 06:58:16] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 7 ms to minimize.
Problem TDEAD11 is UNSAT
[2024-05-24 06:58:16] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 1 ms to minimize.
[2024-05-24 06:58:16] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-05-24 06:58:16] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2024-05-24 06:58:16] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 1 ms to minimize.
[2024-05-24 06:58:16] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-05-24 06:58:16] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2024-05-24 06:58:16] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2024-05-24 06:58:16] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-24 06:58:16] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-24 06:58:16] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 1 ms to minimize.
[2024-05-24 06:58:17] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-24 06:58:17] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 2 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 20/246 constraints. Problems are: Problem set: 4 solved, 344 unsolved
[2024-05-24 06:58:17] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2024-05-24 06:58:17] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-24 06:58:17] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 1 ms to minimize.
[2024-05-24 06:58:17] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 2 ms to minimize.
[2024-05-24 06:58:17] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-05-24 06:58:17] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2024-05-24 06:58:17] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-24 06:58:17] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-05-24 06:58:17] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 2 ms to minimize.
[2024-05-24 06:58:17] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 2 ms to minimize.
[2024-05-24 06:58:17] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-05-24 06:58:17] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-05-24 06:58:18] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-05-24 06:58:18] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 3 ms to minimize.
[2024-05-24 06:58:18] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 4 ms to minimize.
[2024-05-24 06:58:18] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 2 ms to minimize.
[2024-05-24 06:58:18] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 2 ms to minimize.
[2024-05-24 06:58:18] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2024-05-24 06:58:18] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-24 06:58:18] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD196 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 20/266 constraints. Problems are: Problem set: 11 solved, 337 unsolved
[2024-05-24 06:58:19] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 2 ms to minimize.
[2024-05-24 06:58:19] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2024-05-24 06:58:19] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2024-05-24 06:58:19] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 1 ms to minimize.
[2024-05-24 06:58:20] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-05-24 06:58:20] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-05-24 06:58:20] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 2 ms to minimize.
[2024-05-24 06:58:20] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 2 ms to minimize.
[2024-05-24 06:58:20] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 2 ms to minimize.
[2024-05-24 06:58:20] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
[2024-05-24 06:58:20] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
[2024-05-24 06:58:20] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-05-24 06:58:20] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 2 ms to minimize.
[2024-05-24 06:58:20] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2024-05-24 06:58:20] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-05-24 06:58:20] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2024-05-24 06:58:20] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 3 ms to minimize.
[2024-05-24 06:58:20] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2024-05-24 06:58:21] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-05-24 06:58:21] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 1 ms to minimize.
Problem TDEAD92 is UNSAT
Problem TDEAD194 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 20/286 constraints. Problems are: Problem set: 13 solved, 335 unsolved
[2024-05-24 06:58:21] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2024-05-24 06:58:21] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
[2024-05-24 06:58:21] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2024-05-24 06:58:21] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-05-24 06:58:21] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-05-24 06:58:21] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-05-24 06:58:21] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-24 06:58:21] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-24 06:58:21] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2024-05-24 06:58:21] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2024-05-24 06:58:21] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-24 06:58:21] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-24 06:58:22] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-24 06:58:22] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-05-24 06:58:22] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-24 06:58:22] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 2 ms to minimize.
[2024-05-24 06:58:22] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-24 06:58:22] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-24 06:58:22] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-24 06:58:22] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
Problem TDEAD89 is UNSAT
Problem TDEAD155 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 20/306 constraints. Problems are: Problem set: 15 solved, 333 unsolved
[2024-05-24 06:58:22] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-05-24 06:58:22] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-24 06:58:22] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2024-05-24 06:58:22] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-24 06:58:22] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2024-05-24 06:58:22] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-05-24 06:58:23] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 1 ms to minimize.
[2024-05-24 06:58:23] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-24 06:58:23] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2024-05-24 06:58:23] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-05-24 06:58:23] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 1 ms to minimize.
[2024-05-24 06:58:23] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 1 ms to minimize.
[2024-05-24 06:58:23] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2024-05-24 06:58:23] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2024-05-24 06:58:23] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2024-05-24 06:58:23] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 2 ms to minimize.
[2024-05-24 06:58:23] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-24 06:58:23] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 2 ms to minimize.
[2024-05-24 06:58:23] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-05-24 06:58:24] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
Problem TDEAD98 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD200 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 20/326 constraints. Problems are: Problem set: 19 solved, 329 unsolved
[2024-05-24 06:58:25] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-05-24 06:58:25] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 2 ms to minimize.
[2024-05-24 06:58:25] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-24 06:58:25] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-24 06:58:25] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 2 ms to minimize.
[2024-05-24 06:58:25] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 1 ms to minimize.
[2024-05-24 06:58:25] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 2 ms to minimize.
[2024-05-24 06:58:25] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
[2024-05-24 06:58:26] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 1 ms to minimize.
[2024-05-24 06:58:26] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 3 ms to minimize.
[2024-05-24 06:58:26] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-05-24 06:58:26] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
[2024-05-24 06:58:26] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 1 ms to minimize.
[2024-05-24 06:58:26] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
Problem TDEAD54 is UNSAT
[2024-05-24 06:58:26] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-05-24 06:58:26] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-05-24 06:58:26] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2024-05-24 06:58:26] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-24 06:58:26] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-05-24 06:58:26] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
Problem TDEAD54 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD202 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 20/346 constraints. Problems are: Problem set: 27 solved, 321 unsolved
[2024-05-24 06:58:27] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-24 06:58:27] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-24 06:58:27] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-24 06:58:27] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-24 06:58:27] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-24 06:58:27] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-24 06:58:27] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 0 ms to minimize.
[2024-05-24 06:58:27] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2024-05-24 06:58:27] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-05-24 06:58:27] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 2 ms to minimize.
[2024-05-24 06:58:28] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-05-24 06:58:28] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 1 ms to minimize.
[2024-05-24 06:58:28] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 2 ms to minimize.
[2024-05-24 06:58:28] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2024-05-24 06:58:28] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 2 ms to minimize.
[2024-05-24 06:58:28] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-24 06:58:28] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 2 ms to minimize.
[2024-05-24 06:58:28] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2024-05-24 06:58:28] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 3 ms to minimize.
[2024-05-24 06:58:28] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
Problem TDEAD68 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD139 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/176 variables, 20/366 constraints. Problems are: Problem set: 31 solved, 317 unsolved
[2024-05-24 06:58:28] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-05-24 06:58:29] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 1 ms to minimize.
[2024-05-24 06:58:29] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2024-05-24 06:58:29] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-05-24 06:58:29] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 1 ms to minimize.
[2024-05-24 06:58:29] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 2 ms to minimize.
[2024-05-24 06:58:29] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 1 ms to minimize.
[2024-05-24 06:58:29] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-24 06:58:29] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 1 ms to minimize.
[2024-05-24 06:58:29] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-24 06:58:29] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-05-24 06:58:29] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2024-05-24 06:58:29] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-05-24 06:58:30] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 2 ms to minimize.
[2024-05-24 06:58:30] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 1 ms to minimize.
[2024-05-24 06:58:30] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 2 ms to minimize.
[2024-05-24 06:58:30] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 1 ms to minimize.
[2024-05-24 06:58:30] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
[2024-05-24 06:58:30] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 1 ms to minimize.
[2024-05-24 06:58:30] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/176 variables, 20/386 constraints. Problems are: Problem set: 32 solved, 316 unsolved
[2024-05-24 06:58:31] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-05-24 06:58:31] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 2 ms to minimize.
[2024-05-24 06:58:32] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-24 06:58:32] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 2 ms to minimize.
[2024-05-24 06:58:32] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 1 ms to minimize.
[2024-05-24 06:58:32] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 2 ms to minimize.
[2024-05-24 06:58:32] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2024-05-24 06:58:32] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 2 ms to minimize.
Problem TDEAD82 is UNSAT
[2024-05-24 06:58:32] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-24 06:58:32] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
Problem TDEAD96 is UNSAT
[2024-05-24 06:58:32] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 1 ms to minimize.
[2024-05-24 06:58:32] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 1 ms to minimize.
[2024-05-24 06:58:33] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
[2024-05-24 06:58:33] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 2 ms to minimize.
[2024-05-24 06:58:33] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2024-05-24 06:58:33] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-05-24 06:58:33] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2024-05-24 06:58:33] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2024-05-24 06:58:33] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
[2024-05-24 06:58:33] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
Problem TDEAD82 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD198 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/176 variables, 20/406 constraints. Problems are: Problem set: 36 solved, 312 unsolved
[2024-05-24 06:58:33] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-24 06:58:34] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2024-05-24 06:58:34] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2024-05-24 06:58:34] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2024-05-24 06:58:34] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 1 ms to minimize.
[2024-05-24 06:58:34] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
[2024-05-24 06:58:34] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 2 ms to minimize.
[2024-05-24 06:58:34] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2024-05-24 06:58:34] [INFO ] Deduced a trap composed of 46 places in 76 ms of which 2 ms to minimize.
[2024-05-24 06:58:34] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 2 ms to minimize.
[2024-05-24 06:58:34] [INFO ] Deduced a trap composed of 46 places in 70 ms of which 1 ms to minimize.
[2024-05-24 06:58:34] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 1 ms to minimize.
[2024-05-24 06:58:35] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-24 06:58:35] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 1 ms to minimize.
[2024-05-24 06:58:35] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 1 ms to minimize.
[2024-05-24 06:58:35] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 1 ms to minimize.
[2024-05-24 06:58:35] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 1 ms to minimize.
[2024-05-24 06:58:35] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 1 ms to minimize.
[2024-05-24 06:58:35] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 1 ms to minimize.
[2024-05-24 06:58:35] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/176 variables, 20/426 constraints. Problems are: Problem set: 36 solved, 312 unsolved
[2024-05-24 06:58:35] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-05-24 06:58:35] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2024-05-24 06:58:36] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-05-24 06:58:36] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 2 ms to minimize.
[2024-05-24 06:58:36] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2024-05-24 06:58:36] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2024-05-24 06:58:36] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-05-24 06:58:36] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2024-05-24 06:58:36] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 2 ms to minimize.
[2024-05-24 06:58:36] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-05-24 06:58:36] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2024-05-24 06:58:36] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 1 ms to minimize.
[2024-05-24 06:58:37] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 2 ms to minimize.
[2024-05-24 06:58:37] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2024-05-24 06:58:37] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-05-24 06:58:37] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 1 ms to minimize.
[2024-05-24 06:58:37] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 2 ms to minimize.
[2024-05-24 06:58:37] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 1 ms to minimize.
[2024-05-24 06:58:37] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 2 ms to minimize.
[2024-05-24 06:58:37] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/176 variables, 20/446 constraints. Problems are: Problem set: 36 solved, 312 unsolved
[2024-05-24 06:58:39] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 1 ms to minimize.
[2024-05-24 06:58:39] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 1 ms to minimize.
[2024-05-24 06:58:39] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-24 06:58:39] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 1 ms to minimize.
[2024-05-24 06:58:39] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-05-24 06:58:39] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2024-05-24 06:58:39] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2024-05-24 06:58:39] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-05-24 06:58:39] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
[2024-05-24 06:58:40] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-05-24 06:58:40] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-05-24 06:58:40] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 2 ms to minimize.
[2024-05-24 06:58:40] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 2 ms to minimize.
[2024-05-24 06:58:40] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-05-24 06:58:40] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-05-24 06:58:40] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2024-05-24 06:58:40] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
[2024-05-24 06:58:40] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 1 ms to minimize.
[2024-05-24 06:58:40] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 1 ms to minimize.
[2024-05-24 06:58:40] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/176 variables, 20/466 constraints. Problems are: Problem set: 36 solved, 312 unsolved
[2024-05-24 06:58:41] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2024-05-24 06:58:41] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 2 ms to minimize.
[2024-05-24 06:58:41] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2024-05-24 06:58:41] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2024-05-24 06:58:41] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2024-05-24 06:58:41] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2024-05-24 06:58:41] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2024-05-24 06:58:41] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 1 ms to minimize.
[2024-05-24 06:58:41] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 3 ms to minimize.
[2024-05-24 06:58:41] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 1 ms to minimize.
[2024-05-24 06:58:42] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-05-24 06:58:42] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2024-05-24 06:58:42] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2024-05-24 06:58:42] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-24 06:58:42] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-24 06:58:42] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-05-24 06:58:42] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2024-05-24 06:58:42] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2024-05-24 06:58:43] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 1 ms to minimize.
[2024-05-24 06:58:43] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/176 variables, 20/486 constraints. Problems are: Problem set: 36 solved, 312 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 176/440 variables, and 486 constraints, problems are : Problem set: 36 solved, 312 unsolved in 30034 ms.
Refiners :[Domain max(s): 176/176 constraints, Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 0/176 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 260/260 constraints]
Escalating to Integer solving :Problem set: 36 solved, 312 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 170/170 constraints. Problems are: Problem set: 36 solved, 312 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 8/178 constraints. Problems are: Problem set: 36 solved, 312 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 162/340 constraints. Problems are: Problem set: 36 solved, 312 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/340 constraints. Problems are: Problem set: 36 solved, 312 unsolved
At refinement iteration 4 (OVERLAPS) 6/176 variables, 42/382 constraints. Problems are: Problem set: 36 solved, 312 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 6/388 constraints. Problems are: Problem set: 36 solved, 312 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 98/486 constraints. Problems are: Problem set: 36 solved, 312 unsolved
[2024-05-24 06:58:46] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2024-05-24 06:58:46] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2024-05-24 06:58:46] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-05-24 06:58:46] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2024-05-24 06:58:46] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-24 06:58:46] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 1 ms to minimize.
[2024-05-24 06:58:46] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-05-24 06:58:46] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2024-05-24 06:58:46] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-05-24 06:58:47] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
[2024-05-24 06:58:47] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 2 ms to minimize.
[2024-05-24 06:58:47] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
[2024-05-24 06:58:47] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-24 06:58:47] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 1 ms to minimize.
[2024-05-24 06:58:47] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2024-05-24 06:58:47] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 1 ms to minimize.
[2024-05-24 06:58:47] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-05-24 06:58:47] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-24 06:58:47] [INFO ] Deduced a trap composed of 42 places in 66 ms of which 1 ms to minimize.
[2024-05-24 06:58:48] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 20/506 constraints. Problems are: Problem set: 36 solved, 312 unsolved
[2024-05-24 06:58:50] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 2 ms to minimize.
[2024-05-24 06:58:51] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
[2024-05-24 06:58:52] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-24 06:58:53] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-24 06:58:54] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2024-05-24 06:58:54] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2024-05-24 06:58:54] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-05-24 06:58:55] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 1 ms to minimize.
[2024-05-24 06:58:55] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-24 06:58:55] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-24 06:58:56] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 2 ms to minimize.
[2024-05-24 06:58:56] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-24 06:58:56] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 1 ms to minimize.
[2024-05-24 06:58:56] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 1 ms to minimize.
[2024-05-24 06:58:56] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 1 ms to minimize.
[2024-05-24 06:58:56] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2024-05-24 06:58:56] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-24 06:58:56] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
[2024-05-24 06:58:57] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-24 06:58:57] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/176 variables, 20/526 constraints. Problems are: Problem set: 36 solved, 312 unsolved
[2024-05-24 06:59:04] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2024-05-24 06:59:04] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2024-05-24 06:59:04] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-24 06:59:04] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 1 ms to minimize.
[2024-05-24 06:59:04] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-05-24 06:59:04] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 1 ms to minimize.
[2024-05-24 06:59:05] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2024-05-24 06:59:06] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-05-24 06:59:07] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-24 06:59:07] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-24 06:59:07] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2024-05-24 06:59:07] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-05-24 06:59:11] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-05-24 06:59:11] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
[2024-05-24 06:59:11] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 1 ms to minimize.
[2024-05-24 06:59:11] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2024-05-24 06:59:11] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2024-05-24 06:59:11] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2024-05-24 06:59:11] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 1 ms to minimize.
[2024-05-24 06:59:11] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/176 variables, 20/546 constraints. Problems are: Problem set: 36 solved, 312 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 176/440 variables, and 546 constraints, problems are : Problem set: 36 solved, 312 unsolved in 30020 ms.
Refiners :[Domain max(s): 176/176 constraints, Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 0/176 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/348 constraints, Known Traps: 320/320 constraints]
After SMT, in 60399ms problems are : Problem set: 36 solved, 312 unsolved
Search for dead transitions found 36 dead transitions in 60425ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in LTL mode, iteration 1 : 176/176 places, 318/354 transitions.
Applied a total of 0 rules in 8 ms. Remains 176 /176 variables (removed 0) and now considering 318/318 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61080 ms. Remains : 176/176 places, 318/354 transitions.
Support contains 146 out of 176 places after structural reductions.
[2024-05-24 06:59:13] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-24 06:59:13] [INFO ] Flatten gal took : 51 ms
FORMULA LamportFastMutEx-PT-6-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-6-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 06:59:14] [INFO ] Flatten gal took : 23 ms
[2024-05-24 06:59:14] [INFO ] Input system was already deterministic with 318 transitions.
Support contains 145 out of 176 places (down from 146) after GAL structural reductions.
FORMULA LamportFastMutEx-PT-6-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2379 ms. (16 steps per ms) remains 21/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 101 ms. (39 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
[2024-05-24 06:59:15] [INFO ] Flow matrix only has 240 transitions (discarded 78 similar events)
// Phase 1: matrix 240 rows 176 cols
[2024-05-24 06:59:15] [INFO ] Computed 50 invariants in 3 ms
[2024-05-24 06:59:15] [INFO ] State equation strengthened by 66 read => feed constraints.
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp26 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 108/108 constraints. Problems are: Problem set: 19 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/108 constraints. Problems are: Problem set: 19 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 42/150 variables, 42/150 constraints. Problems are: Problem set: 19 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 42/192 constraints. Problems are: Problem set: 19 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/192 constraints. Problems are: Problem set: 19 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 240/390 variables, 150/342 constraints. Problems are: Problem set: 19 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 66/408 constraints. Problems are: Problem set: 19 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/390 variables, 0/408 constraints. Problems are: Problem set: 19 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 26/416 variables, 26/434 constraints. Problems are: Problem set: 19 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/416 variables, 26/460 constraints. Problems are: Problem set: 19 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/416 variables, 8/468 constraints. Problems are: Problem set: 19 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/416 variables, 0/468 constraints. Problems are: Problem set: 19 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/416 variables, 0/468 constraints. Problems are: Problem set: 19 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 416/416 variables, and 468 constraints, problems are : Problem set: 19 solved, 2 unsolved in 237 ms.
Refiners :[Domain max(s): 176/176 constraints, Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 176/176 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 19 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 36/36 constraints. Problems are: Problem set: 19 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/36 constraints. Problems are: Problem set: 19 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 108/144 variables, 36/72 constraints. Problems are: Problem set: 19 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 108/180 constraints. Problems are: Problem set: 19 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/180 constraints. Problems are: Problem set: 19 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/150 variables, 6/186 constraints. Problems are: Problem set: 19 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 6/192 constraints. Problems are: Problem set: 19 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 0/192 constraints. Problems are: Problem set: 19 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 240/390 variables, 150/342 constraints. Problems are: Problem set: 19 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/390 variables, 66/408 constraints. Problems are: Problem set: 19 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/390 variables, 0/408 constraints. Problems are: Problem set: 19 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 26/416 variables, 26/434 constraints. Problems are: Problem set: 19 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/416 variables, 26/460 constraints. Problems are: Problem set: 19 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/416 variables, 8/468 constraints. Problems are: Problem set: 19 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/416 variables, 2/470 constraints. Problems are: Problem set: 19 solved, 2 unsolved
[2024-05-24 06:59:15] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-24 06:59:15] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-05-24 06:59:15] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 2 ms to minimize.
[2024-05-24 06:59:15] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 0 ms to minimize.
[2024-05-24 06:59:15] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-24 06:59:15] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-05-24 06:59:16] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2024-05-24 06:59:16] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-24 06:59:16] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-24 06:59:16] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-24 06:59:16] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-24 06:59:16] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/416 variables, 12/482 constraints. Problems are: Problem set: 19 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/416 variables, 0/482 constraints. Problems are: Problem set: 19 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/416 variables, 0/482 constraints. Problems are: Problem set: 19 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 416/416 variables, and 482 constraints, problems are : Problem set: 19 solved, 2 unsolved in 1047 ms.
Refiners :[Domain max(s): 176/176 constraints, Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 176/176 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 2/21 constraints, Known Traps: 12/12 constraints]
After SMT, in 1340ms problems are : Problem set: 19 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 109 ms.
Support contains 36 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 318/318 transitions.
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 176 transition count 312
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 170 transition count 312
Applied a total of 12 rules in 72 ms. Remains 170 /176 variables (removed 6) and now considering 312/318 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 170/176 places, 312/318 transitions.
RANDOM walk for 40000 steps (8 resets) in 366 ms. (108 steps per ms) remains 2/2 properties
BEST_FIRST walk for 24812 steps (5 resets) in 99 ms. (248 steps per ms) remains 0/2 properties
Successfully simplified 19 atomic propositions for a total of 13 simplifications.
FORMULA LamportFastMutEx-PT-6-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-6-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-6-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-6-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 06:59:16] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-24 06:59:16] [INFO ] Flatten gal took : 19 ms
[2024-05-24 06:59:16] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA LamportFastMutEx-PT-6-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-6-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 06:59:16] [INFO ] Flatten gal took : 18 ms
[2024-05-24 06:59:16] [INFO ] Input system was already deterministic with 318 transitions.
Support contains 97 out of 176 places (down from 118) after GAL structural reductions.
Computed a total of 1 stabilizing places and 6 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 176/176 places, 318/318 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 170 transition count 312
Applied a total of 12 rules in 23 ms. Remains 170 /176 variables (removed 6) and now considering 312/318 (removed 6) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 170/176 places, 312/318 transitions.
[2024-05-24 06:59:16] [INFO ] Flatten gal took : 20 ms
[2024-05-24 06:59:16] [INFO ] Flatten gal took : 17 ms
[2024-05-24 06:59:16] [INFO ] Input system was already deterministic with 312 transitions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 318/318 transitions.
Applied a total of 0 rules in 4 ms. Remains 176 /176 variables (removed 0) and now considering 318/318 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 176/176 places, 318/318 transitions.
[2024-05-24 06:59:16] [INFO ] Flatten gal took : 16 ms
[2024-05-24 06:59:17] [INFO ] Flatten gal took : 21 ms
[2024-05-24 06:59:17] [INFO ] Input system was already deterministic with 318 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 176/176 places, 318/318 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 173 transition count 315
Applied a total of 6 rules in 22 ms. Remains 173 /176 variables (removed 3) and now considering 315/318 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 173/176 places, 315/318 transitions.
[2024-05-24 06:59:17] [INFO ] Flatten gal took : 14 ms
[2024-05-24 06:59:17] [INFO ] Flatten gal took : 14 ms
[2024-05-24 06:59:17] [INFO ] Input system was already deterministic with 315 transitions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 318/318 transitions.
Applied a total of 0 rules in 3 ms. Remains 176 /176 variables (removed 0) and now considering 318/318 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 176/176 places, 318/318 transitions.
[2024-05-24 06:59:17] [INFO ] Flatten gal took : 11 ms
[2024-05-24 06:59:17] [INFO ] Flatten gal took : 12 ms
[2024-05-24 06:59:17] [INFO ] Input system was already deterministic with 318 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 176/176 places, 318/318 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 172 transition count 314
Applied a total of 8 rules in 16 ms. Remains 172 /176 variables (removed 4) and now considering 314/318 (removed 4) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 172/176 places, 314/318 transitions.
[2024-05-24 06:59:17] [INFO ] Flatten gal took : 11 ms
[2024-05-24 06:59:17] [INFO ] Flatten gal took : 13 ms
[2024-05-24 06:59:17] [INFO ] Input system was already deterministic with 314 transitions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 318/318 transitions.
Applied a total of 0 rules in 2 ms. Remains 176 /176 variables (removed 0) and now considering 318/318 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 176/176 places, 318/318 transitions.
[2024-05-24 06:59:17] [INFO ] Flatten gal took : 15 ms
[2024-05-24 06:59:17] [INFO ] Flatten gal took : 12 ms
[2024-05-24 06:59:17] [INFO ] Input system was already deterministic with 318 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 176/176 places, 318/318 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 171 transition count 313
Applied a total of 10 rules in 13 ms. Remains 171 /176 variables (removed 5) and now considering 313/318 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 171/176 places, 313/318 transitions.
[2024-05-24 06:59:17] [INFO ] Flatten gal took : 10 ms
[2024-05-24 06:59:17] [INFO ] Flatten gal took : 10 ms
[2024-05-24 06:59:17] [INFO ] Input system was already deterministic with 313 transitions.
[2024-05-24 06:59:17] [INFO ] Flatten gal took : 11 ms
[2024-05-24 06:59:17] [INFO ] Flatten gal took : 11 ms
[2024-05-24 06:59:17] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-24 06:59:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 176 places, 318 transitions and 1392 arcs took 3 ms.
Total runtime 65061 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running LamportFastMutEx-PT-6

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: 176
TRANSITIONS: 318
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.007s, Sys 0.001s]


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: 1552
MODEL NAME: /home/mcc/execution/412/model
176 places, 318 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-6-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA LamportFastMutEx-PT-6-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA LamportFastMutEx-PT-6-CTLCardinality-2024-05 CANNOT_COMPUTE
FORMULA LamportFastMutEx-PT-6-CTLCardinality-2024-10 CANNOT_COMPUTE
FORMULA LamportFastMutEx-PT-6-CTLCardinality-2024-13 CANNOT_COMPUTE
FORMULA LamportFastMutEx-PT-6-CTLCardinality-2024-14 CANNOT_COMPUTE
FORMULA LamportFastMutEx-PT-6-CTLCardinality-2024-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716534769091

--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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-6"
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-6, 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-171649611100289"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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