About the Execution of 2023-gold for LamportFastMutEx-PT-8
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16217.563 | 3600000.00 | 2904914.00 | 484725.30 | 8 7 8 7 7 ? 56 7 1 1 1 1 1 1 0 1 | 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.r241-tall-171649628300191.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 gold2023
Input is LamportFastMutEx-PT-8, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r241-tall-171649628300191
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 33K Apr 13 07:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 200K Apr 13 07:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 75K Apr 13 07:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 408K Apr 13 07:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 11K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 46K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 28K Apr 22 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 108K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 39K Apr 13 07:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 243K Apr 13 07:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 42K Apr 13 07:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 206K Apr 13 07:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.4K 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 329K 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 positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME LamportFastMutEx-PT-8-UpperBounds-00
FORMULA_NAME LamportFastMutEx-PT-8-UpperBounds-01
FORMULA_NAME LamportFastMutEx-PT-8-UpperBounds-02
FORMULA_NAME LamportFastMutEx-PT-8-UpperBounds-03
FORMULA_NAME LamportFastMutEx-PT-8-UpperBounds-04
FORMULA_NAME LamportFastMutEx-PT-8-UpperBounds-05
FORMULA_NAME LamportFastMutEx-PT-8-UpperBounds-06
FORMULA_NAME LamportFastMutEx-PT-8-UpperBounds-07
FORMULA_NAME LamportFastMutEx-PT-8-UpperBounds-08
FORMULA_NAME LamportFastMutEx-PT-8-UpperBounds-09
FORMULA_NAME LamportFastMutEx-PT-8-UpperBounds-10
FORMULA_NAME LamportFastMutEx-PT-8-UpperBounds-11
FORMULA_NAME LamportFastMutEx-PT-8-UpperBounds-12
FORMULA_NAME LamportFastMutEx-PT-8-UpperBounds-13
FORMULA_NAME LamportFastMutEx-PT-8-UpperBounds-14
FORMULA_NAME LamportFastMutEx-PT-8-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716560459814
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-PT-8
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-24 14:21:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 14:21:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 14:21:01] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2024-05-24 14:21:01] [INFO ] Transformed 315 places.
[2024-05-24 14:21:01] [INFO ] Transformed 666 transitions.
[2024-05-24 14:21:01] [INFO ] Found NUPN structural information;
[2024-05-24 14:21:01] [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_start_1_8, 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_b_8_false, P_b_8_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_setx_3_8, 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_setbi_5_8, 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_ify0_4_8, 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_sety_9_8, 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_ifxi_10_8, 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_setbi_11_8, 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_fordo_12_8, 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_0_8, 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_1_8, 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_2_8, 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_3_8, 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_4_8, 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_5_8, 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_6_8, 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_wait_7_8, P_wait_8_0, P_wait_8_1, P_wait_8_2, P_wait_8_3, P_wait_8_4, P_wait_8_5, P_wait_8_6, P_wait_8_7, P_wait_8_8, 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_await_13_8, 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_0_8, 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_1_8, 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_2_8, 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_3_8, 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_4_8, 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_5_8, 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_6_8, 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_done_7_8, P_done_8_0, P_done_8_1, P_done_8_2, P_done_8_3, P_done_8_4, P_done_8_5, P_done_8_6, P_done_8_7, P_done_8_8, 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_ifyi_15_8, 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_awaity_8, 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_CS_21_8, 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, P_setbi_24_8]
[2024-05-24 14:21:01] [INFO ] Parsed PT model containing 315 places and 666 transitions and 2934 arcs in 150 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 49 places in 3 ms
Reduce places removed 49 places and 82 transitions.
FORMULA LamportFastMutEx-PT-8-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-8-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 416 out of 584 initially.
// Phase 1: matrix 416 rows 266 cols
[2024-05-24 14:21:01] [INFO ] Computed 82 invariants in 22 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 14) seen :73
FORMULA LamportFastMutEx-PT-8-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-8-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-8-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-8-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-8-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-8-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :28
FORMULA LamportFastMutEx-PT-8-UpperBounds-00 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :9
FORMULA LamportFastMutEx-PT-8-UpperBounds-02 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 6) seen :30
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 6) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :62
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :38
[2024-05-24 14:21:01] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2024-05-24 14:21:01] [INFO ] Computed 82 invariants in 7 ms
[2024-05-24 14:21:02] [INFO ] [Real]Absence check using 82 positive place invariants in 20 ms returned sat
[2024-05-24 14:21:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 14:21:02] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2024-05-24 14:21:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 14:21:02] [INFO ] [Nat]Absence check using 82 positive place invariants in 22 ms returned sat
[2024-05-24 14:21:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 14:21:02] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2024-05-24 14:21:02] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-24 14:21:02] [INFO ] [Nat]Added 112 Read/Feed constraints in 16 ms returned sat
[2024-05-24 14:21:02] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 6 ms to minimize.
[2024-05-24 14:21:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2024-05-24 14:21:02] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 46 ms.
[2024-05-24 14:21:02] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 0 ms to minimize.
[2024-05-24 14:21:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
[2024-05-24 14:21:02] [INFO ] Added : 7 causal constraints over 3 iterations in 333 ms. Result :sat
Minimization took 87 ms.
[2024-05-24 14:21:03] [INFO ] [Real]Absence check using 82 positive place invariants in 20 ms returned sat
[2024-05-24 14:21:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 14:21:03] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2024-05-24 14:21:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 14:21:03] [INFO ] [Nat]Absence check using 82 positive place invariants in 16 ms returned sat
[2024-05-24 14:21:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 14:21:03] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2024-05-24 14:21:03] [INFO ] [Nat]Added 112 Read/Feed constraints in 14 ms returned sat
[2024-05-24 14:21:03] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-05-24 14:21:03] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 2 ms to minimize.
[2024-05-24 14:21:03] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2024-05-24 14:21:03] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2024-05-24 14:21:03] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 0 ms to minimize.
[2024-05-24 14:21:04] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 0 ms to minimize.
[2024-05-24 14:21:04] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 0 ms to minimize.
[2024-05-24 14:21:04] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-24 14:21:04] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-24 14:21:04] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 0 ms to minimize.
[2024-05-24 14:21:04] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 879 ms
[2024-05-24 14:21:04] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 32 ms.
[2024-05-24 14:21:04] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2024-05-24 14:21:04] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-24 14:21:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 151 ms
[2024-05-24 14:21:04] [INFO ] Added : 40 causal constraints over 9 iterations in 455 ms. Result :sat
Minimization took 74 ms.
[2024-05-24 14:21:04] [INFO ] [Real]Absence check using 82 positive place invariants in 14 ms returned sat
[2024-05-24 14:21:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 14:21:05] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2024-05-24 14:21:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 14:21:05] [INFO ] [Nat]Absence check using 82 positive place invariants in 16 ms returned sat
[2024-05-24 14:21:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 14:21:05] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2024-05-24 14:21:05] [INFO ] [Nat]Added 112 Read/Feed constraints in 31 ms returned sat
[2024-05-24 14:21:05] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 0 ms to minimize.
[2024-05-24 14:21:05] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2024-05-24 14:21:05] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2024-05-24 14:21:05] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-24 14:21:05] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 0 ms to minimize.
[2024-05-24 14:21:05] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 0 ms to minimize.
[2024-05-24 14:21:05] [INFO ] Deduced a trap composed of 48 places in 63 ms of which 1 ms to minimize.
[2024-05-24 14:21:05] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 0 ms to minimize.
[2024-05-24 14:21:05] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 0 ms to minimize.
[2024-05-24 14:21:05] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 0 ms to minimize.
[2024-05-24 14:21:06] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 0 ms to minimize.
[2024-05-24 14:21:06] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-05-24 14:21:06] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-05-24 14:21:06] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 0 ms to minimize.
[2024-05-24 14:21:06] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-24 14:21:06] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-24 14:21:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 16 trap constraints in 1213 ms
[2024-05-24 14:21:06] [INFO ] [Real]Absence check using 82 positive place invariants in 15 ms returned sat
[2024-05-24 14:21:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 14:21:06] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2024-05-24 14:21:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 14:21:06] [INFO ] [Nat]Absence check using 82 positive place invariants in 17 ms returned sat
[2024-05-24 14:21:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 14:21:06] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2024-05-24 14:21:06] [INFO ] [Nat]Added 112 Read/Feed constraints in 12 ms returned sat
[2024-05-24 14:21:06] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 30 ms.
[2024-05-24 14:21:07] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 1 ms to minimize.
[2024-05-24 14:21:07] [INFO ] Deduced a trap composed of 46 places in 104 ms of which 1 ms to minimize.
[2024-05-24 14:21:07] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-24 14:21:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 319 ms
[2024-05-24 14:21:07] [INFO ] Added : 30 causal constraints over 7 iterations in 574 ms. Result :sat
Minimization took 91 ms.
[2024-05-24 14:21:07] [INFO ] [Real]Absence check using 82 positive place invariants in 16 ms returned sat
[2024-05-24 14:21:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 14:21:07] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2024-05-24 14:21:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 14:21:07] [INFO ] [Nat]Absence check using 82 positive place invariants in 18 ms returned sat
[2024-05-24 14:21:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 14:21:07] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2024-05-24 14:21:07] [INFO ] [Nat]Added 112 Read/Feed constraints in 85 ms returned sat
[2024-05-24 14:21:07] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-05-24 14:21:08] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 4 ms to minimize.
[2024-05-24 14:21:08] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-24 14:21:08] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2024-05-24 14:21:08] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 0 ms to minimize.
[2024-05-24 14:21:08] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 0 ms to minimize.
[2024-05-24 14:21:08] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 0 ms to minimize.
[2024-05-24 14:21:08] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 0 ms to minimize.
[2024-05-24 14:21:08] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-24 14:21:08] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-24 14:21:08] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 0 ms to minimize.
[2024-05-24 14:21:08] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 0 ms to minimize.
[2024-05-24 14:21:08] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-24 14:21:08] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 987 ms
[2024-05-24 14:21:08] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 27 ms.
[2024-05-24 14:21:09] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-05-24 14:21:09] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-05-24 14:21:09] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 0 ms to minimize.
[2024-05-24 14:21:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 308 ms
[2024-05-24 14:21:09] [INFO ] Added : 63 causal constraints over 13 iterations in 772 ms. Result :sat
Minimization took 169 ms.
[2024-05-24 14:21:09] [INFO ] [Real]Absence check using 82 positive place invariants in 16 ms returned sat
[2024-05-24 14:21:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 14:21:09] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2024-05-24 14:21:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 14:21:10] [INFO ] [Nat]Absence check using 82 positive place invariants in 17 ms returned sat
[2024-05-24 14:21:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 14:21:10] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2024-05-24 14:21:10] [INFO ] [Nat]Added 112 Read/Feed constraints in 24 ms returned sat
[2024-05-24 14:21:10] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2024-05-24 14:21:10] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2024-05-24 14:21:10] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2024-05-24 14:21:10] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2024-05-24 14:21:10] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 0 ms to minimize.
[2024-05-24 14:21:10] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2024-05-24 14:21:10] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 0 ms to minimize.
[2024-05-24 14:21:10] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 0 ms to minimize.
[2024-05-24 14:21:10] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 0 ms to minimize.
[2024-05-24 14:21:10] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-05-24 14:21:11] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 0 ms to minimize.
[2024-05-24 14:21:11] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-24 14:21:11] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 0 ms to minimize.
[2024-05-24 14:21:11] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 0 ms to minimize.
[2024-05-24 14:21:11] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1116 ms
[2024-05-24 14:21:11] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 25 ms.
[2024-05-24 14:21:11] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2024-05-24 14:21:11] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2024-05-24 14:21:12] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 2 ms to minimize.
[2024-05-24 14:21:12] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-24 14:21:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 359 ms
[2024-05-24 14:21:12] [INFO ] Added : 76 causal constraints over 16 iterations in 866 ms. Result :sat
Minimization took 98 ms.
Current structural bounds on expressions (after SMT) : [8, 8, 7, 8, 64, 8] Max seen :[5, 4, 7, 4, 41, 6]
FORMULA LamportFastMutEx-PT-8-UpperBounds-04 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 96 out of 266 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 34 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 266/266 places, 584/584 transitions.
Normalized transition count is 416 out of 584 initially.
// Phase 1: matrix 416 rows 266 cols
[2024-05-24 14:21:13] [INFO ] Computed 82 invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3589 ms. (steps per millisecond=278 ) properties (out of 5) seen :59
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1079 ms. (steps per millisecond=926 ) properties (out of 5) seen :50
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 851 ms. (steps per millisecond=1175 ) properties (out of 5) seen :27
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 899 ms. (steps per millisecond=1112 ) properties (out of 5) seen :17
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1746 ms. (steps per millisecond=572 ) properties (out of 5) seen :75
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1258 ms. (steps per millisecond=794 ) properties (out of 5) seen :48
[2024-05-24 14:21:23] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2024-05-24 14:21:23] [INFO ] Computed 82 invariants in 9 ms
[2024-05-24 14:21:23] [INFO ] [Real]Absence check using 82 positive place invariants in 15 ms returned sat
[2024-05-24 14:21:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 14:21:23] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2024-05-24 14:21:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 14:21:23] [INFO ] [Nat]Absence check using 82 positive place invariants in 16 ms returned sat
[2024-05-24 14:21:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 14:21:23] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2024-05-24 14:21:23] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-24 14:21:23] [INFO ] [Nat]Added 112 Read/Feed constraints in 34 ms returned sat
[2024-05-24 14:21:23] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 2 ms to minimize.
[2024-05-24 14:21:23] [INFO ] Deduced a trap composed of 43 places in 104 ms of which 0 ms to minimize.
[2024-05-24 14:21:23] [INFO ] Deduced a trap composed of 42 places in 105 ms of which 1 ms to minimize.
[2024-05-24 14:21:23] [INFO ] Deduced a trap composed of 43 places in 107 ms of which 0 ms to minimize.
[2024-05-24 14:21:24] [INFO ] Deduced a trap composed of 42 places in 100 ms of which 1 ms to minimize.
[2024-05-24 14:21:24] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 0 ms to minimize.
[2024-05-24 14:21:24] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 0 ms to minimize.
[2024-05-24 14:21:24] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 0 ms to minimize.
[2024-05-24 14:21:24] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 0 ms to minimize.
[2024-05-24 14:21:24] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 0 ms to minimize.
[2024-05-24 14:21:24] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 0 ms to minimize.
[2024-05-24 14:21:24] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 0 ms to minimize.
[2024-05-24 14:21:25] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 1 ms to minimize.
[2024-05-24 14:21:25] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 0 ms to minimize.
[2024-05-24 14:21:25] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 0 ms to minimize.
[2024-05-24 14:21:25] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2024-05-24 14:21:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 16 trap constraints in 1939 ms
[2024-05-24 14:21:25] [INFO ] [Real]Absence check using 82 positive place invariants in 15 ms returned sat
[2024-05-24 14:21:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 14:21:25] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2024-05-24 14:21:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 14:21:25] [INFO ] [Nat]Absence check using 82 positive place invariants in 17 ms returned sat
[2024-05-24 14:21:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 14:21:25] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2024-05-24 14:21:25] [INFO ] [Nat]Added 112 Read/Feed constraints in 36 ms returned sat
[2024-05-24 14:21:25] [INFO ] Deduced a trap composed of 46 places in 94 ms of which 1 ms to minimize.
[2024-05-24 14:21:25] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 0 ms to minimize.
[2024-05-24 14:21:26] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 0 ms to minimize.
[2024-05-24 14:21:26] [INFO ] Deduced a trap composed of 55 places in 89 ms of which 1 ms to minimize.
[2024-05-24 14:21:26] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2024-05-24 14:21:26] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
[2024-05-24 14:21:26] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-05-24 14:21:26] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 0 ms to minimize.
[2024-05-24 14:21:26] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 0 ms to minimize.
[2024-05-24 14:21:26] [INFO ] Deduced a trap composed of 45 places in 82 ms of which 0 ms to minimize.
[2024-05-24 14:21:26] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2024-05-24 14:21:26] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2024-05-24 14:21:27] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 0 ms to minimize.
[2024-05-24 14:21:27] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 0 ms to minimize.
[2024-05-24 14:21:27] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 0 ms to minimize.
[2024-05-24 14:21:27] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 0 ms to minimize.
[2024-05-24 14:21:27] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 1 ms to minimize.
[2024-05-24 14:21:27] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 0 ms to minimize.
[2024-05-24 14:21:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 18 trap constraints in 1732 ms
[2024-05-24 14:21:27] [INFO ] [Real]Absence check using 82 positive place invariants in 16 ms returned sat
[2024-05-24 14:21:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 14:21:27] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2024-05-24 14:21:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 14:21:27] [INFO ] [Nat]Absence check using 82 positive place invariants in 17 ms returned sat
[2024-05-24 14:21:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 14:21:27] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2024-05-24 14:21:27] [INFO ] [Nat]Added 112 Read/Feed constraints in 13 ms returned sat
[2024-05-24 14:21:27] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 37 ms.
[2024-05-24 14:21:28] [INFO ] Added : 68 causal constraints over 14 iterations in 418 ms. Result :sat
Minimization took 104 ms.
[2024-05-24 14:21:28] [INFO ] [Real]Absence check using 82 positive place invariants in 14 ms returned sat
[2024-05-24 14:21:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 14:21:28] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2024-05-24 14:21:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 14:21:28] [INFO ] [Nat]Absence check using 82 positive place invariants in 17 ms returned sat
[2024-05-24 14:21:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 14:21:28] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2024-05-24 14:21:28] [INFO ] [Nat]Added 112 Read/Feed constraints in 106 ms returned sat
[2024-05-24 14:21:28] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 0 ms to minimize.
[2024-05-24 14:21:29] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 0 ms to minimize.
[2024-05-24 14:21:29] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-24 14:21:29] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 0 ms to minimize.
[2024-05-24 14:21:29] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-05-24 14:21:29] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 0 ms to minimize.
[2024-05-24 14:21:29] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 1 ms to minimize.
[2024-05-24 14:21:29] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 0 ms to minimize.
[2024-05-24 14:21:29] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 0 ms to minimize.
[2024-05-24 14:21:29] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-24 14:21:29] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 0 ms to minimize.
[2024-05-24 14:21:29] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 0 ms to minimize.
[2024-05-24 14:21:29] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 0 ms to minimize.
[2024-05-24 14:21:30] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 0 ms to minimize.
[2024-05-24 14:21:30] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 0 ms to minimize.
[2024-05-24 14:21:30] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-24 14:21:30] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-05-24 14:21:30] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 0 ms to minimize.
[2024-05-24 14:21:30] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 0 ms to minimize.
[2024-05-24 14:21:30] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 0 ms to minimize.
[2024-05-24 14:21:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 20 trap constraints in 2391 ms
[2024-05-24 14:21:31] [INFO ] [Real]Absence check using 82 positive place invariants in 18 ms returned sat
[2024-05-24 14:21:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 14:21:31] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2024-05-24 14:21:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 14:21:31] [INFO ] [Nat]Absence check using 82 positive place invariants in 15 ms returned sat
[2024-05-24 14:21:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 14:21:31] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2024-05-24 14:21:31] [INFO ] [Nat]Added 112 Read/Feed constraints in 22 ms returned sat
[2024-05-24 14:21:31] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
[2024-05-24 14:21:31] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2024-05-24 14:21:31] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2024-05-24 14:21:31] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 0 ms to minimize.
[2024-05-24 14:21:32] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 0 ms to minimize.
[2024-05-24 14:21:32] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2024-05-24 14:21:32] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-05-24 14:21:32] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2024-05-24 14:21:32] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 0 ms to minimize.
[2024-05-24 14:21:32] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-05-24 14:21:32] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 0 ms to minimize.
[2024-05-24 14:21:32] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 0 ms to minimize.
[2024-05-24 14:21:32] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-05-24 14:21:32] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 0 ms to minimize.
[2024-05-24 14:21:32] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 0 ms to minimize.
[2024-05-24 14:21:32] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 0 ms to minimize.
[2024-05-24 14:21:32] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-24 14:21:33] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 0 ms to minimize.
[2024-05-24 14:21:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 18 trap constraints in 1476 ms
Current structural bounds on expressions (after SMT) : [7, 7, 8, 56, 7] Max seen :[7, 7, 6, 56, 7]
FORMULA LamportFastMutEx-PT-8-UpperBounds-07 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-8-UpperBounds-06 56 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-8-UpperBounds-03 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-8-UpperBounds-01 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 8 out of 266 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 584/584 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 258 transition count 576
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 24 place count 258 transition count 568
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 32 place count 250 transition count 568
Applied a total of 32 rules in 74 ms. Remains 250 /266 variables (removed 16) and now considering 568/584 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 250/266 places, 568/584 transitions.
Normalized transition count is 400 out of 568 initially.
// Phase 1: matrix 400 rows 250 cols
[2024-05-24 14:21:33] [INFO ] Computed 82 invariants in 6 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2459 ms. (steps per millisecond=406 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 690 ms. (steps per millisecond=1449 ) properties (out of 1) seen :1
[2024-05-24 14:21:36] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
// Phase 1: matrix 400 rows 250 cols
[2024-05-24 14:21:36] [INFO ] Computed 82 invariants in 8 ms
[2024-05-24 14:21:36] [INFO ] [Real]Absence check using 82 positive place invariants in 14 ms returned sat
[2024-05-24 14:21:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 14:21:36] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2024-05-24 14:21:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 14:21:36] [INFO ] [Nat]Absence check using 82 positive place invariants in 16 ms returned sat
[2024-05-24 14:21:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 14:21:36] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2024-05-24 14:21:36] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-24 14:21:36] [INFO ] [Nat]Added 112 Read/Feed constraints in 15 ms returned sat
[2024-05-24 14:21:36] [INFO ] Computed and/alt/rep : 216/1096/216 causal constraints (skipped 176 transitions) in 26 ms.
[2024-05-24 14:21:37] [INFO ] Deduced a trap composed of 50 places in 117 ms of which 0 ms to minimize.
[2024-05-24 14:21:37] [INFO ] Deduced a trap composed of 55 places in 116 ms of which 1 ms to minimize.
[2024-05-24 14:21:37] [INFO ] Deduced a trap composed of 45 places in 112 ms of which 0 ms to minimize.
[2024-05-24 14:21:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 444 ms
[2024-05-24 14:21:37] [INFO ] Added : 63 causal constraints over 13 iterations in 861 ms. Result :sat
Minimization took 96 ms.
Current structural bounds on expressions (after SMT) : [8] Max seen :[6]
Support contains 8 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 568/568 transitions.
Applied a total of 0 rules in 15 ms. Remains 250 /250 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 250/250 places, 568/568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 568/568 transitions.
Applied a total of 0 rules in 17 ms. Remains 250 /250 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2024-05-24 14:21:37] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2024-05-24 14:21:37] [INFO ] Invariant cache hit.
[2024-05-24 14:21:38] [INFO ] Implicit Places using invariants in 247 ms returned [154, 155, 156, 157, 158, 159, 160, 161]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 251 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 242/250 places, 568/568 transitions.
Applied a total of 0 rules in 12 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 280 ms. Remains : 242/250 places, 568/568 transitions.
Normalized transition count is 400 out of 568 initially.
// Phase 1: matrix 400 rows 242 cols
[2024-05-24 14:21:38] [INFO ] Computed 74 invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2262 ms. (steps per millisecond=442 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 689 ms. (steps per millisecond=1451 ) properties (out of 1) seen :1
[2024-05-24 14:21:41] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
// Phase 1: matrix 400 rows 242 cols
[2024-05-24 14:21:41] [INFO ] Computed 74 invariants in 8 ms
[2024-05-24 14:21:41] [INFO ] [Real]Absence check using 74 positive place invariants in 13 ms returned sat
[2024-05-24 14:21:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 14:21:41] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2024-05-24 14:21:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 14:21:41] [INFO ] [Nat]Absence check using 74 positive place invariants in 15 ms returned sat
[2024-05-24 14:21:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 14:21:41] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2024-05-24 14:21:41] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-24 14:21:41] [INFO ] [Nat]Added 48 Read/Feed constraints in 9 ms returned sat
[2024-05-24 14:21:41] [INFO ] Computed and/alt/rep : 216/968/216 causal constraints (skipped 176 transitions) in 26 ms.
[2024-05-24 14:21:42] [INFO ] Added : 121 causal constraints over 25 iterations in 711 ms. Result :sat
Minimization took 86 ms.
Current structural bounds on expressions (after SMT) : [8] Max seen :[6]
Support contains 8 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 568/568 transitions.
Applied a total of 0 rules in 9 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 242/242 places, 568/568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 568/568 transitions.
Applied a total of 0 rules in 9 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2024-05-24 14:21:42] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2024-05-24 14:21:42] [INFO ] Invariant cache hit.
[2024-05-24 14:21:42] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-05-24 14:21:42] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2024-05-24 14:21:42] [INFO ] Invariant cache hit.
[2024-05-24 14:21:42] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-24 14:21:43] [INFO ] Implicit Places using invariants and state equation in 421 ms returned []
Implicit Place search using SMT with State Equation took 618 ms to find 0 implicit places.
[2024-05-24 14:21:43] [INFO ] Redundant transitions in 35 ms returned []
[2024-05-24 14:21:43] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2024-05-24 14:21:43] [INFO ] Invariant cache hit.
[2024-05-24 14:21:43] [INFO ] Dead Transitions using invariants and state equation in 222 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 892 ms. Remains : 242/242 places, 568/568 transitions.
Starting property specific reduction for LamportFastMutEx-PT-8-UpperBounds-05
Normalized transition count is 400 out of 568 initially.
// Phase 1: matrix 400 rows 242 cols
[2024-05-24 14:21:43] [INFO ] Computed 74 invariants in 3 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :1
[2024-05-24 14:21:43] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
// Phase 1: matrix 400 rows 242 cols
[2024-05-24 14:21:43] [INFO ] Computed 74 invariants in 5 ms
[2024-05-24 14:21:43] [INFO ] [Real]Absence check using 74 positive place invariants in 13 ms returned sat
[2024-05-24 14:21:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 14:21:43] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2024-05-24 14:21:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 14:21:43] [INFO ] [Nat]Absence check using 74 positive place invariants in 15 ms returned sat
[2024-05-24 14:21:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 14:21:43] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2024-05-24 14:21:43] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-24 14:21:43] [INFO ] [Nat]Added 48 Read/Feed constraints in 9 ms returned sat
[2024-05-24 14:21:43] [INFO ] Computed and/alt/rep : 216/968/216 causal constraints (skipped 176 transitions) in 25 ms.
[2024-05-24 14:21:44] [INFO ] Added : 87 causal constraints over 18 iterations in 507 ms. Result :sat
Minimization took 71 ms.
Current structural bounds on expressions (after SMT) : [8] Max seen :[4]
Support contains 8 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 568/568 transitions.
Applied a total of 0 rules in 9 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 242/242 places, 568/568 transitions.
Normalized transition count is 400 out of 568 initially.
// Phase 1: matrix 400 rows 242 cols
[2024-05-24 14:21:44] [INFO ] Computed 74 invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2258 ms. (steps per millisecond=442 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 688 ms. (steps per millisecond=1453 ) properties (out of 1) seen :1
[2024-05-24 14:21:47] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
// Phase 1: matrix 400 rows 242 cols
[2024-05-24 14:21:47] [INFO ] Computed 74 invariants in 5 ms
[2024-05-24 14:21:47] [INFO ] [Real]Absence check using 74 positive place invariants in 12 ms returned sat
[2024-05-24 14:21:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 14:21:47] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2024-05-24 14:21:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 14:21:47] [INFO ] [Nat]Absence check using 74 positive place invariants in 15 ms returned sat
[2024-05-24 14:21:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 14:21:47] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2024-05-24 14:21:47] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-24 14:21:47] [INFO ] [Nat]Added 48 Read/Feed constraints in 9 ms returned sat
[2024-05-24 14:21:47] [INFO ] Computed and/alt/rep : 216/968/216 causal constraints (skipped 176 transitions) in 22 ms.
[2024-05-24 14:21:48] [INFO ] Added : 121 causal constraints over 25 iterations in 690 ms. Result :sat
Minimization took 82 ms.
Current structural bounds on expressions (after SMT) : [8] Max seen :[6]
Support contains 8 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 568/568 transitions.
Applied a total of 0 rules in 9 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 242/242 places, 568/568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 568/568 transitions.
Applied a total of 0 rules in 9 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2024-05-24 14:21:48] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2024-05-24 14:21:48] [INFO ] Invariant cache hit.
[2024-05-24 14:21:49] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-24 14:21:49] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2024-05-24 14:21:49] [INFO ] Invariant cache hit.
[2024-05-24 14:21:49] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-24 14:21:49] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 608 ms to find 0 implicit places.
[2024-05-24 14:21:49] [INFO ] Redundant transitions in 16 ms returned []
[2024-05-24 14:21:49] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2024-05-24 14:21:49] [INFO ] Invariant cache hit.
[2024-05-24 14:21:49] [INFO ] Dead Transitions using invariants and state equation in 225 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 869 ms. Remains : 242/242 places, 568/568 transitions.
Normalized transition count is 400 out of 568 initially.
// Phase 1: matrix 400 rows 242 cols
[2024-05-24 14:21:49] [INFO ] Computed 74 invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2258 ms. (steps per millisecond=442 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 679 ms. (steps per millisecond=1472 ) properties (out of 1) seen :1
[2024-05-24 14:21:52] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
// Phase 1: matrix 400 rows 242 cols
[2024-05-24 14:21:52] [INFO ] Computed 74 invariants in 5 ms
[2024-05-24 14:21:52] [INFO ] [Real]Absence check using 74 positive place invariants in 13 ms returned sat
[2024-05-24 14:21:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 14:21:52] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2024-05-24 14:21:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 14:21:52] [INFO ] [Nat]Absence check using 74 positive place invariants in 15 ms returned sat
[2024-05-24 14:21:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 14:21:52] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2024-05-24 14:21:52] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-24 14:21:52] [INFO ] [Nat]Added 48 Read/Feed constraints in 9 ms returned sat
[2024-05-24 14:21:52] [INFO ] Computed and/alt/rep : 216/968/216 causal constraints (skipped 176 transitions) in 22 ms.
[2024-05-24 14:21:53] [INFO ] Added : 121 causal constraints over 25 iterations in 661 ms. Result :sat
Minimization took 81 ms.
Current structural bounds on expressions (after SMT) : [8] Max seen :[6]
Support contains 8 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 568/568 transitions.
Applied a total of 0 rules in 18 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 242/242 places, 568/568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 568/568 transitions.
Applied a total of 0 rules in 10 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2024-05-24 14:21:53] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2024-05-24 14:21:53] [INFO ] Invariant cache hit.
[2024-05-24 14:21:54] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-05-24 14:21:54] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2024-05-24 14:21:54] [INFO ] Invariant cache hit.
[2024-05-24 14:21:54] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-24 14:21:54] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 615 ms to find 0 implicit places.
[2024-05-24 14:21:54] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-24 14:21:54] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2024-05-24 14:21:54] [INFO ] Invariant cache hit.
[2024-05-24 14:21:54] [INFO ] Dead Transitions using invariants and state equation in 270 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 916 ms. Remains : 242/242 places, 568/568 transitions.
Ending property specific reduction for LamportFastMutEx-PT-8-UpperBounds-05 in 11395 ms.
[2024-05-24 14:21:55] [INFO ] Flatten gal took : 108 ms
[2024-05-24 14:21:55] [INFO ] Applying decomposition
[2024-05-24 14:21:55] [INFO ] Flatten gal took : 40 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph8430575631692539595.txt' '-o' '/tmp/graph8430575631692539595.bin' '-w' '/tmp/graph8430575631692539595.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8430575631692539595.bin' '-l' '-1' '-v' '-w' '/tmp/graph8430575631692539595.weights' '-q' '0' '-e' '0.001'
[2024-05-24 14:21:55] [INFO ] Decomposing Gal with order
[2024-05-24 14:21:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 14:21:55] [INFO ] Removed a total of 871 redundant transitions.
[2024-05-24 14:21:55] [INFO ] Flatten gal took : 102 ms
[2024-05-24 14:21:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 95 labels/synchronizations in 12 ms.
[2024-05-24 14:21:55] [INFO ] Time to serialize gal into /tmp/UpperBounds15040031901706763411.gal : 8 ms
[2024-05-24 14:21:55] [INFO ] Time to serialize properties into /tmp/UpperBounds7116185719205473692.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds15040031901706763411.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7116185719205473692.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...305
Loading property file /tmp/UpperBounds7116185719205473692.prop.
Detected timeout of ITS tools.
[2024-05-24 14:42:34] [INFO ] Applying decomposition
[2024-05-24 14:42:34] [INFO ] Flatten gal took : 210 ms
[2024-05-24 14:42:34] [INFO ] Decomposing Gal with order
[2024-05-24 14:42:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 14:42:35] [INFO ] Removed a total of 646 redundant transitions.
[2024-05-24 14:42:35] [INFO ] Flatten gal took : 542 ms
[2024-05-24 14:42:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 168 labels/synchronizations in 30 ms.
[2024-05-24 14:42:35] [INFO ] Time to serialize gal into /tmp/UpperBounds13853738823711319726.gal : 11 ms
[2024-05-24 14:42:35] [INFO ] Time to serialize properties into /tmp/UpperBounds7681452057636658535.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds13853738823711319726.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7681452057636658535.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...305
Loading property file /tmp/UpperBounds7681452057636658535.prop.
Detected timeout of ITS tools.
[2024-05-24 15:02:59] [INFO ] Flatten gal took : 354 ms
[2024-05-24 15:03:00] [INFO ] Input system was already deterministic with 568 transitions.
[2024-05-24 15:03:00] [INFO ] Transformed 242 places.
[2024-05-24 15:03:00] [INFO ] Transformed 568 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-24 15:03:00] [INFO ] Time to serialize gal into /tmp/UpperBounds9028486546594230545.gal : 50 ms
[2024-05-24 15:03:00] [INFO ] Time to serialize properties into /tmp/UpperBounds168138970009646718.prop : 12 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds9028486546594230545.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds168138970009646718.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...348
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds168138970009646718.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 153884 kB
After kill :
MemTotal: 16393216 kB
MemFree: 14570068 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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-8"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is LamportFastMutEx-PT-8, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r241-tall-171649628300191"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-PT-8.tgz
mv LamportFastMutEx-PT-8 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;