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

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

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717226729188

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-PT-4
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:25:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 07:25:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:25:30] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2024-06-01 07:25:30] [INFO ] Transformed 135 places.
[2024-06-01 07:25:30] [INFO ] Transformed 230 transitions.
[2024-06-01 07:25:30] [INFO ] Found NUPN structural information;
[2024-06-01 07:25:30] [INFO ] Completing missing partition info from NUPN : creating a component with [P_start_1_0, P_start_1_1, P_start_1_2, P_start_1_3, P_start_1_4, P_b_0_false, P_b_0_true, P_b_1_false, P_b_1_true, P_b_2_false, P_b_2_true, P_b_3_false, P_b_3_true, P_b_4_false, P_b_4_true, P_setx_3_0, P_setx_3_1, P_setx_3_2, P_setx_3_3, P_setx_3_4, P_setbi_5_0, P_setbi_5_1, P_setbi_5_2, P_setbi_5_3, P_setbi_5_4, P_ify0_4_0, P_ify0_4_1, P_ify0_4_2, P_ify0_4_3, P_ify0_4_4, P_sety_9_0, P_sety_9_1, P_sety_9_2, P_sety_9_3, P_sety_9_4, P_ifxi_10_0, P_ifxi_10_1, P_ifxi_10_2, P_ifxi_10_3, P_ifxi_10_4, P_setbi_11_0, P_setbi_11_1, P_setbi_11_2, P_setbi_11_3, P_setbi_11_4, P_fordo_12_0, P_fordo_12_1, P_fordo_12_2, P_fordo_12_3, P_fordo_12_4, P_wait_0_0, P_wait_0_1, P_wait_0_2, P_wait_0_3, P_wait_0_4, P_wait_1_0, P_wait_1_1, P_wait_1_2, P_wait_1_3, P_wait_1_4, P_wait_2_0, P_wait_2_1, P_wait_2_2, P_wait_2_3, P_wait_2_4, P_wait_3_0, P_wait_3_1, P_wait_3_2, P_wait_3_3, P_wait_3_4, P_wait_4_0, P_wait_4_1, P_wait_4_2, P_wait_4_3, P_wait_4_4, P_await_13_0, P_await_13_1, P_await_13_2, P_await_13_3, P_await_13_4, P_done_0_0, P_done_0_1, P_done_0_2, P_done_0_3, P_done_0_4, P_done_1_0, P_done_1_1, P_done_1_2, P_done_1_3, P_done_1_4, P_done_2_0, P_done_2_1, P_done_2_2, P_done_2_3, P_done_2_4, P_done_3_0, P_done_3_1, P_done_3_2, P_done_3_3, P_done_3_4, P_done_4_0, P_done_4_1, P_done_4_2, P_done_4_3, P_done_4_4, P_ifyi_15_0, P_ifyi_15_1, P_ifyi_15_2, P_ifyi_15_3, P_ifyi_15_4, P_awaity_0, P_awaity_1, P_awaity_2, P_awaity_3, P_awaity_4, P_CS_21_0, P_CS_21_1, P_CS_21_2, P_CS_21_3, P_CS_21_4, P_setbi_24_0, P_setbi_24_1, P_setbi_24_2, P_setbi_24_3, P_setbi_24_4]
[2024-06-01 07:25:30] [INFO ] Parsed PT model containing 135 places and 230 transitions and 990 arcs in 174 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 20 ms.
Deduced a syphon composed of 33 places in 2 ms
Reduce places removed 33 places and 50 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA LamportFastMutEx-PT-4-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-4-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 91 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 180/180 transitions.
Applied a total of 0 rules in 9 ms. Remains 102 /102 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-06-01 07:25:30] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
// Phase 1: matrix 144 rows 102 cols
[2024-06-01 07:25:30] [INFO ] Computed 26 invariants in 14 ms
[2024-06-01 07:25:30] [INFO ] Implicit Places using invariants in 205 ms returned []
[2024-06-01 07:25:30] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
[2024-06-01 07:25:30] [INFO ] Invariant cache hit.
[2024-06-01 07:25:30] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-01 07:25:31] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
Running 176 sub problems to find dead transitions.
[2024-06-01 07:25:31] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
[2024-06-01 07:25:31] [INFO ] Invariant cache hit.
[2024-06-01 07:25:31] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 26/128 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 07:25:31] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 16 ms to minimize.
[2024-06-01 07:25:31] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 2 ms to minimize.
[2024-06-01 07:25:31] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:25:31] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:25:31] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:25:32] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-06-01 07:25:32] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:25:32] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:25:32] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:25:32] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:25:32] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2024-06-01 07:25:32] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:25:32] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:25:32] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:25:32] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:25:32] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:25:32] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:25:32] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:25:32] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:25:32] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD79 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 20/148 constraints. Problems are: Problem set: 6 solved, 170 unsolved
[2024-06-01 07:25:32] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:25:32] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:25:32] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:25:32] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:25:32] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:25:32] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:25:33] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:25:33] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:25:33] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:25:33] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:25:33] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2024-06-01 07:25:33] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:25:33] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:25:33] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:25:33] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 5 ms to minimize.
[2024-06-01 07:25:33] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:25:33] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:25:33] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:25:33] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:25:33] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
Problem TDEAD38 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD92 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 20/168 constraints. Problems are: Problem set: 12 solved, 164 unsolved
[2024-06-01 07:25:34] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:25:34] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:25:34] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:25:34] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:25:34] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-06-01 07:25:34] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:25:34] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:25:34] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-06-01 07:25:34] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-06-01 07:25:34] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
Problem TDEAD46 is UNSAT
[2024-06-01 07:25:34] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 2 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-06-01 07:25:34] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
Problem TDEAD50 is UNSAT
[2024-06-01 07:25:34] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:25:34] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:25:34] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 2 ms to minimize.
[2024-06-01 07:25:34] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:25:34] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 8 ms to minimize.
[2024-06-01 07:25:34] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:25:34] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:25:34] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
Problem TDEAD28 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD102 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 20/188 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-06-01 07:25:35] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:25:35] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:25:35] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:25:35] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 2 ms to minimize.
[2024-06-01 07:25:35] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:25:35] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:25:35] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:25:35] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:25:35] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:25:35] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:25:35] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:25:35] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2024-06-01 07:25:35] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:25:35] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:25:35] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:25:35] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:25:36] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:25:36] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:25:36] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
[2024-06-01 07:25:36] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 20/208 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-06-01 07:25:36] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:25:36] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:25:36] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:25:36] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:25:36] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:25:36] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:25:36] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:25:36] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:25:37] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:25:37] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:25:37] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:25:37] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:25:37] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:25:37] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:25:37] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:25:37] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 16/224 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-06-01 07:25:37] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:25:38] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
[2024-06-01 07:25:38] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:25:38] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:25:38] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:25:38] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 2 ms to minimize.
[2024-06-01 07:25:38] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:25:38] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2024-06-01 07:25:38] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:25:38] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:25:38] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
[2024-06-01 07:25:38] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:25:38] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:25:38] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:25:38] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:25:38] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 16/240 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-06-01 07:25:39] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 0 ms to minimize.
[2024-06-01 07:25:39] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:25:39] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:25:39] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 4/244 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-06-01 07:25:39] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:25:39] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
[2024-06-01 07:25:39] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 3 ms to minimize.
[2024-06-01 07:25:40] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:25:40] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:25:40] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:25:40] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:25:40] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:25:40] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:25:40] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:25:40] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:25:40] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:25:40] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:25:40] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:25:40] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:25:40] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 16/260 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-06-01 07:25:41] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:25:41] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:25:41] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:25:41] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 4/264 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-06-01 07:25:42] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 1/265 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-06-01 07:25:42] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 0 ms to minimize.
[2024-06-01 07:25:42] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:25:42] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
[2024-06-01 07:25:42] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:25:42] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:25:43] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 2 ms to minimize.
[2024-06-01 07:25:43] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:25:43] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:25:43] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:25:43] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:25:43] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/102 variables, 11/276 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-06-01 07:25:44] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/102 variables, 1/277 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-06-01 07:25:44] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:25:44] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:25:44] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:25:44] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:25:45] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/102 variables, 5/282 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-06-01 07:25:45] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 0 ms to minimize.
[2024-06-01 07:25:45] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:25:46] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/102 variables, 3/285 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/102 variables, 0/285 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 17 (OVERLAPS) 144/246 variables, 102/387 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/246 variables, 40/427 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/246 variables, 0/427 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 20 (OVERLAPS) 0/246 variables, 0/427 constraints. Problems are: Problem set: 24 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 427 constraints, problems are : Problem set: 24 solved, 152 unsolved in 21450 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 157/157 constraints]
Escalating to Integer solving :Problem set: 24 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 98/98 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 6/104 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 87/191 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/191 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 4/102 variables, 20/211 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 4/215 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 70/285 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-06-01 07:25:53] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:25:53] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:25:53] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:25:54] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:25:54] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 5/290 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-06-01 07:25:54] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:25:54] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:25:54] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:25:54] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 4/294 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-06-01 07:25:55] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:25:55] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:25:55] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:25:55] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:25:55] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 5/299 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-06-01 07:25:56] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 0 ms to minimize.
[2024-06-01 07:25:56] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 2/301 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-06-01 07:25:56] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:25:56] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:25:56] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:25:57] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 4/305 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-06-01 07:25:57] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/102 variables, 1/306 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-06-01 07:25:58] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 0 ms to minimize.
[2024-06-01 07:25:58] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/102 variables, 2/308 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-06-01 07:25:58] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:25:59] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:25:59] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:25:59] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:25:59] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/102 variables, 5/313 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-06-01 07:25:59] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/102 variables, 1/314 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-06-01 07:26:00] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:26:00] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/102 variables, 2/316 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/102 variables, 0/316 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 18 (OVERLAPS) 144/246 variables, 102/418 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/246 variables, 40/458 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/246 variables, 152/610 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/246 variables, 0/610 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-06-01 07:26:08] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
At refinement iteration 22 (OVERLAPS) 0/246 variables, 1/611 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-06-01 07:26:12] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 0 ms to minimize.
[2024-06-01 07:26:13] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 0 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/246 variables, 2/613 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/246 variables, 0/613 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-06-01 07:26:19] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
At refinement iteration 25 (OVERLAPS) 0/246 variables, 1/614 constraints. Problems are: Problem set: 24 solved, 152 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 246/246 variables, and 614 constraints, problems are : Problem set: 24 solved, 152 unsolved in 30021 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 152/176 constraints, Known Traps: 192/192 constraints]
After SMT, in 51590ms problems are : Problem set: 24 solved, 152 unsolved
Search for dead transitions found 24 dead transitions in 51602ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in LTL mode, iteration 1 : 102/102 places, 156/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 51998 ms. Remains : 102/102 places, 156/180 transitions.
Support contains 91 out of 102 places after structural reductions.
[2024-06-01 07:26:22] [INFO ] Flatten gal took : 34 ms
[2024-06-01 07:26:22] [INFO ] Flatten gal took : 15 ms
[2024-06-01 07:26:22] [INFO ] Input system was already deterministic with 156 transitions.
Support contains 89 out of 102 places (down from 91) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 64 to 63
RANDOM walk for 40000 steps (8 resets) in 1958 ms. (20 steps per ms) remains 29/63 properties
BEST_FIRST walk for 4003 steps (8 resets) in 59 ms. (66 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 29/29 properties
[2024-06-01 07:26:23] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
// Phase 1: matrix 128 rows 102 cols
[2024-06-01 07:26:23] [INFO ] Computed 26 invariants in 3 ms
[2024-06-01 07:26:23] [INFO ] State equation strengthened by 36 read => feed constraints.
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp41 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 26 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 26 solved, 3 unsolved
Problem AtomicPropp43 is UNSAT
At refinement iteration 2 (OVERLAPS) 12/84 variables, 20/92 constraints. Problems are: Problem set: 27 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 12/104 constraints. Problems are: Problem set: 27 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/104 constraints. Problems are: Problem set: 27 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 128/212 variables, 84/188 constraints. Problems are: Problem set: 27 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 36/224 constraints. Problems are: Problem set: 27 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 0/224 constraints. Problems are: Problem set: 27 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 18/230 variables, 18/242 constraints. Problems are: Problem set: 27 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/230 variables, 18/260 constraints. Problems are: Problem set: 27 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 6/266 constraints. Problems are: Problem set: 27 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/230 variables, 0/266 constraints. Problems are: Problem set: 27 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/230 variables, 0/266 constraints. Problems are: Problem set: 27 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 266 constraints, problems are : Problem set: 27 solved, 2 unsolved in 165 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 27 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 27 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 27 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 76/84 variables, 20/28 constraints. Problems are: Problem set: 27 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 76/104 constraints. Problems are: Problem set: 27 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/104 constraints. Problems are: Problem set: 27 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 128/212 variables, 84/188 constraints. Problems are: Problem set: 27 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 36/224 constraints. Problems are: Problem set: 27 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 1/225 constraints. Problems are: Problem set: 27 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 0/225 constraints. Problems are: Problem set: 27 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 18/230 variables, 18/243 constraints. Problems are: Problem set: 27 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 18/261 constraints. Problems are: Problem set: 27 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/230 variables, 6/267 constraints. Problems are: Problem set: 27 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/230 variables, 1/268 constraints. Problems are: Problem set: 27 solved, 2 unsolved
[2024-06-01 07:26:24] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:26:24] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:26:24] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:26:24] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:26:24] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-06-01 07:26:24] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp32 is UNSAT
After SMT solving in domain Int declared 230/230 variables, and 274 constraints, problems are : Problem set: 29 solved, 0 unsolved in 337 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 2/29 constraints, Known Traps: 6/6 constraints]
After SMT, in 529ms problems are : Problem set: 29 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 29 atomic propositions for a total of 14 simplifications.
FORMULA LamportFastMutEx-PT-4-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 07:26:24] [INFO ] Flatten gal took : 10 ms
[2024-06-01 07:26:24] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA LamportFastMutEx-PT-4-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 07:26:24] [INFO ] Flatten gal took : 10 ms
[2024-06-01 07:26:24] [INFO ] Input system was already deterministic with 156 transitions.
Support contains 68 out of 102 places (down from 84) after GAL structural reductions.
FORMULA LamportFastMutEx-PT-4-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 4 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 102/102 places, 156/156 transitions.
[2024-06-01 07:26:24] [INFO ] Flatten gal took : 8 ms
[2024-06-01 07:26:24] [INFO ] Flatten gal took : 9 ms
[2024-06-01 07:26:24] [INFO ] Input system was already deterministic with 156 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 102/102 places, 156/156 transitions.
[2024-06-01 07:26:24] [INFO ] Flatten gal took : 8 ms
[2024-06-01 07:26:24] [INFO ] Flatten gal took : 9 ms
[2024-06-01 07:26:24] [INFO ] Input system was already deterministic with 156 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 102/102 places, 156/156 transitions.
[2024-06-01 07:26:24] [INFO ] Flatten gal took : 7 ms
[2024-06-01 07:26:24] [INFO ] Flatten gal took : 8 ms
[2024-06-01 07:26:24] [INFO ] Input system was already deterministic with 156 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 10 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 102/102 places, 156/156 transitions.
[2024-06-01 07:26:24] [INFO ] Flatten gal took : 8 ms
[2024-06-01 07:26:24] [INFO ] Flatten gal took : 8 ms
[2024-06-01 07:26:24] [INFO ] Input system was already deterministic with 156 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 98 transition count 152
Applied a total of 8 rules in 16 ms. Remains 98 /102 variables (removed 4) and now considering 152/156 (removed 4) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16 ms. Remains : 98/102 places, 152/156 transitions.
[2024-06-01 07:26:24] [INFO ] Flatten gal took : 7 ms
[2024-06-01 07:26:24] [INFO ] Flatten gal took : 8 ms
[2024-06-01 07:26:24] [INFO ] Input system was already deterministic with 152 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 102/102 places, 156/156 transitions.
[2024-06-01 07:26:24] [INFO ] Flatten gal took : 7 ms
[2024-06-01 07:26:24] [INFO ] Flatten gal took : 9 ms
[2024-06-01 07:26:24] [INFO ] Input system was already deterministic with 156 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 102/102 places, 156/156 transitions.
[2024-06-01 07:26:24] [INFO ] Flatten gal took : 7 ms
[2024-06-01 07:26:24] [INFO ] Flatten gal took : 8 ms
[2024-06-01 07:26:24] [INFO ] Input system was already deterministic with 156 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 102/102 places, 156/156 transitions.
[2024-06-01 07:26:24] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:26:24] [INFO ] Flatten gal took : 7 ms
[2024-06-01 07:26:24] [INFO ] Input system was already deterministic with 156 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 156/156 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 98 transition count 152
Applied a total of 8 rules in 10 ms. Remains 98 /102 variables (removed 4) and now considering 152/156 (removed 4) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 98/102 places, 152/156 transitions.
[2024-06-01 07:26:24] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:26:24] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:26:24] [INFO ] Input system was already deterministic with 152 transitions.
RANDOM walk for 18 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
FORMULA LamportFastMutEx-PT-4-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 98 transition count 152
Applied a total of 8 rules in 12 ms. Remains 98 /102 variables (removed 4) and now considering 152/156 (removed 4) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 98/102 places, 152/156 transitions.
[2024-06-01 07:26:24] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:26:24] [INFO ] Flatten gal took : 5 ms
[2024-06-01 07:26:24] [INFO ] Input system was already deterministic with 152 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 1 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 102/102 places, 156/156 transitions.
[2024-06-01 07:26:24] [INFO ] Flatten gal took : 5 ms
[2024-06-01 07:26:24] [INFO ] Flatten gal took : 5 ms
[2024-06-01 07:26:24] [INFO ] Input system was already deterministic with 156 transitions.
[2024-06-01 07:26:24] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:26:24] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:26:24] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-06-01 07:26:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 102 places, 156 transitions and 672 arcs took 2 ms.
Total runtime 54671 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : LamportFastMutEx-PT-4-CTLCardinality-2024-00
Could not compute solution for formula : LamportFastMutEx-PT-4-CTLCardinality-2024-01
Could not compute solution for formula : LamportFastMutEx-PT-4-CTLCardinality-2024-05
Could not compute solution for formula : LamportFastMutEx-PT-4-CTLCardinality-2024-07
Could not compute solution for formula : LamportFastMutEx-PT-4-CTLCardinality-2024-08
Could not compute solution for formula : LamportFastMutEx-PT-4-CTLCardinality-2024-10
Could not compute solution for formula : LamportFastMutEx-PT-4-CTLCardinality-2024-11
Could not compute solution for formula : LamportFastMutEx-PT-4-CTLCardinality-2024-12
Could not compute solution for formula : LamportFastMutEx-PT-4-CTLCardinality-2024-14
Could not compute solution for formula : LamportFastMutEx-PT-4-CTLCardinality-2024-15

BK_STOP 1717226785345

--------------------
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
mcc2024
ctl formula name LamportFastMutEx-PT-4-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/1118/ctl_0_
ctl formula name LamportFastMutEx-PT-4-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/1118/ctl_1_
ctl formula name LamportFastMutEx-PT-4-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/1118/ctl_2_
ctl formula name LamportFastMutEx-PT-4-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/1118/ctl_3_
ctl formula name LamportFastMutEx-PT-4-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/1118/ctl_4_
ctl formula name LamportFastMutEx-PT-4-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/1118/ctl_5_
ctl formula name LamportFastMutEx-PT-4-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/1118/ctl_6_
ctl formula name LamportFastMutEx-PT-4-CTLCardinality-2024-12
ctl formula formula --ctl=/tmp/1118/ctl_7_
ctl formula name LamportFastMutEx-PT-4-CTLCardinality-2024-14
ctl formula formula --ctl=/tmp/1118/ctl_8_
ctl formula name LamportFastMutEx-PT-4-CTLCardinality-2024-15
ctl formula formula --ctl=/tmp/1118/ctl_9_
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-4"
export BK_EXAMINATION="CTLCardinality"
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-4, 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 r504-tall-171649612400273"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-PT-4.tgz
mv LamportFastMutEx-PT-4 execution
cd execution
if [ "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 ;