About the Execution of LTSMin+red for LamportFastMutEx-PT-7
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 544.663 | 36872.00 | 60606.00 | 182.00 | ??????????FF?T?? | normal |
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.r504-tall-171649612500298.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 ltsminxred
Input is LamportFastMutEx-PT-7, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r504-tall-171649612500298
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 20K Apr 13 07:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 139K Apr 13 07:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 37K Apr 13 07:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 199K Apr 13 07:35 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 19K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 18K Apr 22 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 76K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 32K Apr 13 07:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 193K Apr 13 07:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 82K Apr 13 07:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 417K Apr 13 07:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.7K 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 265K 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-7-CTLFireability-2024-00
FORMULA_NAME LamportFastMutEx-PT-7-CTLFireability-2024-01
FORMULA_NAME LamportFastMutEx-PT-7-CTLFireability-2024-02
FORMULA_NAME LamportFastMutEx-PT-7-CTLFireability-2024-03
FORMULA_NAME LamportFastMutEx-PT-7-CTLFireability-2024-04
FORMULA_NAME LamportFastMutEx-PT-7-CTLFireability-2024-05
FORMULA_NAME LamportFastMutEx-PT-7-CTLFireability-2024-06
FORMULA_NAME LamportFastMutEx-PT-7-CTLFireability-2024-07
FORMULA_NAME LamportFastMutEx-PT-7-CTLFireability-2024-08
FORMULA_NAME LamportFastMutEx-PT-7-CTLFireability-2024-09
FORMULA_NAME LamportFastMutEx-PT-7-CTLFireability-2024-10
FORMULA_NAME LamportFastMutEx-PT-7-CTLFireability-2024-11
FORMULA_NAME LamportFastMutEx-PT-7-CTLFireability-2024-12
FORMULA_NAME LamportFastMutEx-PT-7-CTLFireability-2024-13
FORMULA_NAME LamportFastMutEx-PT-7-CTLFireability-2024-14
FORMULA_NAME LamportFastMutEx-PT-7-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717227596003
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-PT-7
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:39:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 07:39:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:39:57] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2024-06-01 07:39:57] [INFO ] Transformed 264 places.
[2024-06-01 07:39:57] [INFO ] Transformed 536 transitions.
[2024-06-01 07:39:57] [INFO ] Found NUPN structural information;
[2024-06-01 07:39:57] [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_start_1_7, 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_b_7_false, P_b_7_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_setx_3_7, 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_setbi_5_7, 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_ify0_4_7, 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_sety_9_7, 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_ifxi_10_7, 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_setbi_11_7, 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_fordo_12_7, 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_0_7, 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_1_7, 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_2_7, 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_3_7, 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_4_7, 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_5_7, 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_wait_6_7, P_wait_7_0, P_wait_7_1, P_wait_7_2, P_wait_7_3, P_wait_7_4, P_wait_7_5, P_wait_7_6, P_wait_7_7, 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_await_13_7, 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_0_7, 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_1_7, 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_2_7, 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_3_7, 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_4_7, 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_5_7, 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_done_6_7, P_done_7_0, P_done_7_1, P_done_7_2, P_done_7_3, P_done_7_4, P_done_7_5, P_done_7_6, P_done_7_7, 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_ifyi_15_7, P_awaity_0, P_awaity_1, P_awaity_2, P_awaity_3, P_awaity_4, P_awaity_5, P_awaity_6, P_awaity_7, 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_CS_21_7, 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, P_setbi_24_7]
[2024-06-01 07:39:57] [INFO ] Parsed PT model containing 264 places and 536 transitions and 2352 arcs in 215 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 24 ms.
Deduced a syphon composed of 45 places in 3 ms
Reduce places removed 45 places and 74 transitions.
Support contains 219 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 14 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2024-06-01 07:39:57] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2024-06-01 07:39:57] [INFO ] Computed 65 invariants in 21 ms
[2024-06-01 07:39:57] [INFO ] Implicit Places using invariants in 269 ms returned []
[2024-06-01 07:39:57] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2024-06-01 07:39:57] [INFO ] Invariant cache hit.
[2024-06-01 07:39:58] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-06-01 07:39:58] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 512 ms to find 0 implicit places.
Running 455 sub problems to find dead transitions.
[2024-06-01 07:39:58] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2024-06-01 07:39:58] [INFO ] Invariant cache hit.
[2024-06-01 07:39:58] [INFO ] State equation strengthened by 91 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 219/219 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/219 variables, 65/284 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-06-01 07:40:00] [INFO ] Deduced a trap composed of 33 places in 137 ms of which 20 ms to minimize.
[2024-06-01 07:40:00] [INFO ] Deduced a trap composed of 28 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:40:00] [INFO ] Deduced a trap composed of 26 places in 153 ms of which 2 ms to minimize.
[2024-06-01 07:40:01] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:40:01] [INFO ] Deduced a trap composed of 26 places in 206 ms of which 1 ms to minimize.
[2024-06-01 07:40:01] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:40:01] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 3 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-06-01 07:40:01] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:40:01] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:40:01] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 2 ms to minimize.
[2024-06-01 07:40:01] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:40:01] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:40:01] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-06-01 07:40:01] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-06-01 07:40:01] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:40:02] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:40:02] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:40:02] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:40:02] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:40:02] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD202 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 20/304 constraints. Problems are: Problem set: 8 solved, 447 unsolved
[2024-06-01 07:40:02] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:40:02] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:40:02] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 1 ms to minimize.
[2024-06-01 07:40:02] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-06-01 07:40:03] [INFO ] Deduced a trap composed of 52 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:40:03] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:40:03] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:40:03] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:40:03] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:40:03] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:40:03] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:40:03] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:40:03] [INFO ] Deduced a trap composed of 43 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:40:03] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:40:03] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:40:03] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:40:03] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:40:04] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:40:04] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:40:04] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 2 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD258 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 20/324 constraints. Problems are: Problem set: 13 solved, 442 unsolved
[2024-06-01 07:40:05] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:40:06] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:40:06] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:40:06] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:40:06] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:40:06] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:40:06] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:40:06] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:40:06] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:40:06] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:40:06] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:40:06] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:40:06] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:40:06] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:40:07] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:40:07] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:40:07] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 6 ms to minimize.
[2024-06-01 07:40:07] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:40:07] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:40:07] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
Problem TDEAD110 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD238 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 20/344 constraints. Problems are: Problem set: 17 solved, 438 unsolved
[2024-06-01 07:40:07] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:40:07] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:40:07] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:40:07] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:40:07] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:40:07] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:40:08] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:40:08] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:40:08] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:40:08] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:40:08] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:40:08] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:40:08] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:40:08] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:40:08] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:40:08] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:40:08] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:40:08] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:40:08] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:40:09] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 2 ms to minimize.
Problem TDEAD127 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD260 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 20/364 constraints. Problems are: Problem set: 22 solved, 433 unsolved
[2024-06-01 07:40:09] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:40:09] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:40:09] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:40:09] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:40:09] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:40:09] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:40:09] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:40:09] [INFO ] Deduced a trap composed of 43 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:40:09] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:40:09] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:40:09] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:40:10] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:40:10] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:40:10] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:40:10] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:40:10] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:40:10] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:40:10] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:40:10] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:40:10] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
Problem TDEAD123 is UNSAT
Problem TDEAD256 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 20/384 constraints. Problems are: Problem set: 24 solved, 431 unsolved
[2024-06-01 07:40:12] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:40:12] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:40:12] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:40:12] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:40:12] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:40:12] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:40:13] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:40:13] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:40:13] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:40:13] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:40:13] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:40:13] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:40:13] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:40:13] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:40:13] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:40:13] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:40:13] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:40:13] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:40:13] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:40:14] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
Problem TDEAD70 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD264 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 20/404 constraints. Problems are: Problem set: 30 solved, 425 unsolved
[2024-06-01 07:40:14] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:40:14] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:40:14] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:40:14] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:40:14] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:40:14] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:40:14] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:40:14] [INFO ] Deduced a trap composed of 42 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:40:15] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:40:15] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:40:15] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:40:15] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:40:15] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:40:15] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:40:15] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:40:15] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:40:15] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:40:15] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:40:15] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:40:15] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
Problem TDEAD78 is UNSAT
Problem TDEAD157 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 20/424 constraints. Problems are: Problem set: 32 solved, 423 unsolved
[2024-06-01 07:40:16] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:40:16] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:40:16] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:40:16] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:40:16] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:40:16] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:40:16] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:40:16] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:40:16] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:40:16] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:40:16] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:40:17] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:40:17] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:40:17] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:40:17] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:40:17] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:40:17] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:40:17] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:40:17] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:40:17] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
Problem TDEAD119 is UNSAT
Problem TDEAD252 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 20/444 constraints. Problems are: Problem set: 34 solved, 421 unsolved
[2024-06-01 07:40:19] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:40:19] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:40:19] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:40:19] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:40:19] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:40:20] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:40:20] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:40:20] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:40:20] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:40:20] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:40:20] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:40:20] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:40:20] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:40:20] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:40:20] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:40:20] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:40:20] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:40:20] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:40:21] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:40:21] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
Problem TDEAD129 is UNSAT
Problem TDEAD262 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 20/464 constraints. Problems are: Problem set: 36 solved, 419 unsolved
[2024-06-01 07:40:21] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:40:21] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:40:21] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:40:21] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:40:21] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:40:21] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:40:21] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:40:22] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:40:22] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:40:22] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:40:22] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:40:22] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:40:22] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:40:22] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:40:22] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:40:22] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:40:22] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:40:22] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:40:22] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:40:22] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 20/484 constraints. Problems are: Problem set: 36 solved, 419 unsolved
[2024-06-01 07:40:23] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:40:23] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:40:23] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:40:23] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:40:23] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:40:23] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:40:23] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:40:23] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:40:23] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:40:24] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:40:24] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:40:24] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:40:24] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:40:24] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:40:24] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:40:24] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:40:24] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:40:24] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:40:24] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:40:24] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 20/504 constraints. Problems are: Problem set: 36 solved, 419 unsolved
[2024-06-01 07:40:27] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:40:27] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:40:27] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:40:27] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:40:27] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:40:27] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:40:27] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:40:27] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:40:27] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:40:27] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:40:27] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:40:27] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:40:28] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:40:28] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:40:28] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:40:28] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:40:28] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 2 ms to minimize.
SMT process timed out in 30334ms, After SMT, problems are : Problem set: 36 solved, 419 unsolved
Search for dead transitions found 36 dead transitions in 30371ms
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 : 219/219 places, 426/462 transitions.
Applied a total of 0 rules in 7 ms. Remains 219 /219 variables (removed 0) and now considering 426/426 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30929 ms. Remains : 219/219 places, 426/462 transitions.
Support contains 219 out of 219 places after structural reductions.
[2024-06-01 07:40:28] [INFO ] Flatten gal took : 70 ms
[2024-06-01 07:40:28] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA LamportFastMutEx-PT-7-CTLFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 07:40:28] [INFO ] Flatten gal took : 55 ms
[2024-06-01 07:40:29] [INFO ] Input system was already deterministic with 426 transitions.
Reduction of identical properties reduced properties to check from 41 to 39
RANDOM walk for 40000 steps (8 resets) in 1914 ms. (20 steps per ms) remains 3/39 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 109 ms. (363 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 101 ms. (392 steps per ms) remains 3/3 properties
[2024-06-01 07:40:29] [INFO ] Flow matrix only has 311 transitions (discarded 115 similar events)
// Phase 1: matrix 311 rows 219 cols
[2024-06-01 07:40:29] [INFO ] Computed 65 invariants in 5 ms
[2024-06-01 07:40:29] [INFO ] State equation strengthened by 87 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp36 is UNSAT
At refinement iteration 2 (OVERLAPS) 116/126 variables, 35/45 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 116/161 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 07:40:30] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:40:30] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
Problem AtomicPropp34 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 2/163 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/163 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 241/367 variables, 126/289 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/367 variables, 50/339 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 0/339 constraints. Problems are: Problem set: 2 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 55/422 variables, 24/363 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/422 variables, 24/387 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/422 variables, 3/390 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/422 variables, 16/406 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/422 variables, 0/406 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 63/485 variables, 24/430 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/485 variables, 63/493 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/485 variables, 0/493 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 45/530 variables, 69/562 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/530 variables, 6/568 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/530 variables, 3/571 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/530 variables, 21/592 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/530 variables, 0/592 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/530 variables, 0/592 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 530/530 variables, and 592 constraints, problems are : Problem set: 2 solved, 1 unsolved in 320 ms.
Refiners :[Domain max(s): 219/219 constraints, Positive P Invariants (semi-flows): 65/65 constraints, State Equation: 219/219 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 33/35 variables, 9/11 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 33/44 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/44 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 128/163 variables, 35/79 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 11/90 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/90 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 121/284 variables, 34/124 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/284 variables, 34/158 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/284 variables, 2/160 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/284 variables, 22/182 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/284 variables, 1/183 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-06-01 07:40:30] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/284 variables, 1/184 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/284 variables, 0/184 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 138/422 variables, 48/232 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/422 variables, 138/370 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-06-01 07:40:30] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/422 variables, 1/371 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/422 variables, 0/371 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 108/530 variables, 150/521 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/530 variables, 12/533 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/530 variables, 6/539 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/530 variables, 54/593 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/530 variables, 2/595 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/530 variables, 0/595 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-06-01 07:40:30] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
At refinement iteration 25 (OVERLAPS) 0/530 variables, 1/596 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/530 variables, 0/596 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/530 variables, 0/596 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 530/530 variables, and 596 constraints, problems are : Problem set: 2 solved, 1 unsolved in 406 ms.
Refiners :[Domain max(s): 219/219 constraints, Positive P Invariants (semi-flows): 65/65 constraints, State Equation: 219/219 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 5/5 constraints]
After SMT, in 770ms problems are : Problem set: 2 solved, 1 unsolved
Finished Parikh walk after 4153 steps, including 226 resets, run visited all 1 properties in 19 ms. (steps per millisecond=218 )
Parikh walk visited 1 properties in 24 ms.
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
FORMULA LamportFastMutEx-PT-7-CTLFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 07:40:30] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 07:40:30] [INFO ] Flatten gal took : 37 ms
FORMULA LamportFastMutEx-PT-7-CTLFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 07:40:30] [INFO ] Flatten gal took : 39 ms
[2024-06-01 07:40:31] [INFO ] Input system was already deterministic with 426 transitions.
Computed a total of 1 stabilizing places and 7 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 426/426 transitions.
Applied a total of 0 rules in 4 ms. Remains 219 /219 variables (removed 0) and now considering 426/426 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 219/219 places, 426/426 transitions.
[2024-06-01 07:40:31] [INFO ] Flatten gal took : 21 ms
[2024-06-01 07:40:31] [INFO ] Flatten gal took : 24 ms
[2024-06-01 07:40:31] [INFO ] Input system was already deterministic with 426 transitions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 426/426 transitions.
Applied a total of 0 rules in 4 ms. Remains 219 /219 variables (removed 0) and now considering 426/426 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 219/219 places, 426/426 transitions.
[2024-06-01 07:40:31] [INFO ] Flatten gal took : 17 ms
[2024-06-01 07:40:31] [INFO ] Flatten gal took : 19 ms
[2024-06-01 07:40:31] [INFO ] Input system was already deterministic with 426 transitions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 426/426 transitions.
Applied a total of 0 rules in 8 ms. Remains 219 /219 variables (removed 0) and now considering 426/426 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 219/219 places, 426/426 transitions.
[2024-06-01 07:40:31] [INFO ] Flatten gal took : 17 ms
[2024-06-01 07:40:31] [INFO ] Flatten gal took : 19 ms
[2024-06-01 07:40:31] [INFO ] Input system was already deterministic with 426 transitions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 426/426 transitions.
Applied a total of 0 rules in 8 ms. Remains 219 /219 variables (removed 0) and now considering 426/426 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 219/219 places, 426/426 transitions.
[2024-06-01 07:40:31] [INFO ] Flatten gal took : 17 ms
[2024-06-01 07:40:31] [INFO ] Flatten gal took : 19 ms
[2024-06-01 07:40:31] [INFO ] Input system was already deterministic with 426 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 219/219 places, 426/426 transitions.
Applied a total of 0 rules in 17 ms. Remains 219 /219 variables (removed 0) and now considering 426/426 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 219/219 places, 426/426 transitions.
[2024-06-01 07:40:31] [INFO ] Flatten gal took : 18 ms
[2024-06-01 07:40:31] [INFO ] Flatten gal took : 19 ms
[2024-06-01 07:40:31] [INFO ] Input system was already deterministic with 426 transitions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 426/426 transitions.
Applied a total of 0 rules in 8 ms. Remains 219 /219 variables (removed 0) and now considering 426/426 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 219/219 places, 426/426 transitions.
[2024-06-01 07:40:31] [INFO ] Flatten gal took : 14 ms
[2024-06-01 07:40:31] [INFO ] Flatten gal took : 15 ms
[2024-06-01 07:40:31] [INFO ] Input system was already deterministic with 426 transitions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 426/426 transitions.
Applied a total of 0 rules in 4 ms. Remains 219 /219 variables (removed 0) and now considering 426/426 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 219/219 places, 426/426 transitions.
[2024-06-01 07:40:31] [INFO ] Flatten gal took : 14 ms
[2024-06-01 07:40:31] [INFO ] Flatten gal took : 15 ms
[2024-06-01 07:40:31] [INFO ] Input system was already deterministic with 426 transitions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 426/426 transitions.
Applied a total of 0 rules in 4 ms. Remains 219 /219 variables (removed 0) and now considering 426/426 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 219/219 places, 426/426 transitions.
[2024-06-01 07:40:31] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:40:31] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:40:31] [INFO ] Input system was already deterministic with 426 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 219/219 places, 426/426 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 212 transition count 419
Applied a total of 14 rules in 30 ms. Remains 212 /219 variables (removed 7) and now considering 419/426 (removed 7) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30 ms. Remains : 212/219 places, 419/426 transitions.
[2024-06-01 07:40:31] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:40:31] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:40:31] [INFO ] Input system was already deterministic with 419 transitions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 426/426 transitions.
Applied a total of 0 rules in 3 ms. Remains 219 /219 variables (removed 0) and now considering 426/426 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 219/219 places, 426/426 transitions.
[2024-06-01 07:40:31] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:40:31] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:40:31] [INFO ] Input system was already deterministic with 426 transitions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 426/426 transitions.
Applied a total of 0 rules in 3 ms. Remains 219 /219 variables (removed 0) and now considering 426/426 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 219/219 places, 426/426 transitions.
[2024-06-01 07:40:31] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:40:31] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:40:32] [INFO ] Input system was already deterministic with 426 transitions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 426/426 transitions.
Applied a total of 0 rules in 3 ms. Remains 219 /219 variables (removed 0) and now considering 426/426 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 219/219 places, 426/426 transitions.
[2024-06-01 07:40:32] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:40:32] [INFO ] Flatten gal took : 14 ms
[2024-06-01 07:40:32] [INFO ] Input system was already deterministic with 426 transitions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 426/426 transitions.
Applied a total of 0 rules in 4 ms. Remains 219 /219 variables (removed 0) and now considering 426/426 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 219/219 places, 426/426 transitions.
[2024-06-01 07:40:32] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:40:32] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:40:32] [INFO ] Input system was already deterministic with 426 transitions.
[2024-06-01 07:40:32] [INFO ] Flatten gal took : 28 ms
[2024-06-01 07:40:32] [INFO ] Flatten gal took : 35 ms
[2024-06-01 07:40:32] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 28 ms.
[2024-06-01 07:40:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 219 places, 426 transitions and 1872 arcs took 5 ms.
Total runtime 35306 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : LamportFastMutEx-PT-7-CTLFireability-2024-00
Could not compute solution for formula : LamportFastMutEx-PT-7-CTLFireability-2024-01
Could not compute solution for formula : LamportFastMutEx-PT-7-CTLFireability-2024-02
Could not compute solution for formula : LamportFastMutEx-PT-7-CTLFireability-2024-03
Could not compute solution for formula : LamportFastMutEx-PT-7-CTLFireability-2024-04
Could not compute solution for formula : LamportFastMutEx-PT-7-CTLFireability-2024-05
Could not compute solution for formula : LamportFastMutEx-PT-7-CTLFireability-2024-06
Could not compute solution for formula : LamportFastMutEx-PT-7-CTLFireability-2024-07
Could not compute solution for formula : LamportFastMutEx-PT-7-CTLFireability-2024-08
Could not compute solution for formula : LamportFastMutEx-PT-7-CTLFireability-2024-09
Could not compute solution for formula : LamportFastMutEx-PT-7-CTLFireability-2024-12
Could not compute solution for formula : LamportFastMutEx-PT-7-CTLFireability-2024-14
Could not compute solution for formula : LamportFastMutEx-PT-7-CTLFireability-2024-15
BK_STOP 1717227632875
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name LamportFastMutEx-PT-7-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/1247/ctl_0_
ctl formula name LamportFastMutEx-PT-7-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/1247/ctl_1_
ctl formula name LamportFastMutEx-PT-7-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/1247/ctl_2_
ctl formula name LamportFastMutEx-PT-7-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/1247/ctl_3_
ctl formula name LamportFastMutEx-PT-7-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/1247/ctl_4_
ctl formula name LamportFastMutEx-PT-7-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/1247/ctl_5_
ctl formula name LamportFastMutEx-PT-7-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/1247/ctl_6_
ctl formula name LamportFastMutEx-PT-7-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/1247/ctl_7_
ctl formula name LamportFastMutEx-PT-7-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/1247/ctl_8_
ctl formula name LamportFastMutEx-PT-7-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/1247/ctl_9_
ctl formula name LamportFastMutEx-PT-7-CTLFireability-2024-12
ctl formula formula --ctl=/tmp/1247/ctl_10_
ctl formula name LamportFastMutEx-PT-7-CTLFireability-2024-14
ctl formula formula --ctl=/tmp/1247/ctl_11_
ctl formula name LamportFastMutEx-PT-7-CTLFireability-2024-15
ctl formula formula --ctl=/tmp/1247/ctl_12_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
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-7"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is LamportFastMutEx-PT-7, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r504-tall-171649612500298"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-PT-7.tgz
mv LamportFastMutEx-PT-7 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;