About the Execution of ITS-Tools for LamportFastMutEx-PT-7
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16222.304 | 3600000.00 | 2776510.00 | 544933.90 | 42 ? 6 7 7 42 6 6 1 1 1 1 1 0 1 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/mcc2023-input.r229-tall-167856413200437.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is LamportFastMutEx-PT-7, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r229-tall-167856413200437
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 30K Feb 25 13:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 198K Feb 25 13:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 30K Feb 25 13:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 165K Feb 25 13:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 13K Feb 25 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Feb 25 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 25 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 38K Feb 25 13:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 240K Feb 25 13:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 93K Feb 25 13:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 499K Feb 25 13:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.4K Feb 25 16:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 265K Mar 5 18:22 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-7-UpperBounds-00
FORMULA_NAME LamportFastMutEx-PT-7-UpperBounds-01
FORMULA_NAME LamportFastMutEx-PT-7-UpperBounds-02
FORMULA_NAME LamportFastMutEx-PT-7-UpperBounds-03
FORMULA_NAME LamportFastMutEx-PT-7-UpperBounds-04
FORMULA_NAME LamportFastMutEx-PT-7-UpperBounds-05
FORMULA_NAME LamportFastMutEx-PT-7-UpperBounds-06
FORMULA_NAME LamportFastMutEx-PT-7-UpperBounds-07
FORMULA_NAME LamportFastMutEx-PT-7-UpperBounds-08
FORMULA_NAME LamportFastMutEx-PT-7-UpperBounds-09
FORMULA_NAME LamportFastMutEx-PT-7-UpperBounds-10
FORMULA_NAME LamportFastMutEx-PT-7-UpperBounds-11
FORMULA_NAME LamportFastMutEx-PT-7-UpperBounds-12
FORMULA_NAME LamportFastMutEx-PT-7-UpperBounds-13
FORMULA_NAME LamportFastMutEx-PT-7-UpperBounds-14
FORMULA_NAME LamportFastMutEx-PT-7-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1679486042625
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=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-PT-7
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-22 11:54:04] [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]
[2023-03-22 11:54:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 11:54:04] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2023-03-22 11:54:04] [INFO ] Transformed 264 places.
[2023-03-22 11:54:04] [INFO ] Transformed 536 transitions.
[2023-03-22 11:54:04] [INFO ] Found NUPN structural information;
[2023-03-22 11:54:04] [INFO ] Completing missing partition info from NUPN : creating a component with [P_start_1_0, P_start_1_1, P_start_1_2, P_start_1_3, P_start_1_4, P_start_1_5, P_start_1_6, P_start_1_7, P_b_0_false, P_b_0_true, P_b_1_false, P_b_1_true, P_b_2_false, P_b_2_true, P_b_3_false, P_b_3_true, P_b_4_false, P_b_4_true, P_b_5_false, P_b_5_true, P_b_6_false, P_b_6_true, P_b_7_false, P_b_7_true, P_setx_3_0, P_setx_3_1, P_setx_3_2, P_setx_3_3, P_setx_3_4, P_setx_3_5, P_setx_3_6, P_setx_3_7, P_setbi_5_0, P_setbi_5_1, P_setbi_5_2, P_setbi_5_3, P_setbi_5_4, P_setbi_5_5, P_setbi_5_6, P_setbi_5_7, P_ify0_4_0, P_ify0_4_1, P_ify0_4_2, P_ify0_4_3, P_ify0_4_4, P_ify0_4_5, P_ify0_4_6, P_ify0_4_7, P_sety_9_0, P_sety_9_1, P_sety_9_2, P_sety_9_3, P_sety_9_4, P_sety_9_5, P_sety_9_6, P_sety_9_7, P_ifxi_10_0, P_ifxi_10_1, P_ifxi_10_2, P_ifxi_10_3, P_ifxi_10_4, P_ifxi_10_5, P_ifxi_10_6, P_ifxi_10_7, P_setbi_11_0, P_setbi_11_1, P_setbi_11_2, P_setbi_11_3, P_setbi_11_4, P_setbi_11_5, P_setbi_11_6, P_setbi_11_7, P_fordo_12_0, P_fordo_12_1, P_fordo_12_2, P_fordo_12_3, P_fordo_12_4, P_fordo_12_5, P_fordo_12_6, P_fordo_12_7, P_wait_0_0, P_wait_0_1, P_wait_0_2, P_wait_0_3, P_wait_0_4, P_wait_0_5, P_wait_0_6, P_wait_0_7, P_wait_1_0, P_wait_1_1, P_wait_1_2, P_wait_1_3, P_wait_1_4, P_wait_1_5, P_wait_1_6, P_wait_1_7, P_wait_2_0, P_wait_2_1, P_wait_2_2, P_wait_2_3, P_wait_2_4, P_wait_2_5, P_wait_2_6, P_wait_2_7, P_wait_3_0, P_wait_3_1, P_wait_3_2, P_wait_3_3, P_wait_3_4, P_wait_3_5, P_wait_3_6, P_wait_3_7, P_wait_4_0, P_wait_4_1, P_wait_4_2, P_wait_4_3, P_wait_4_4, P_wait_4_5, P_wait_4_6, P_wait_4_7, P_wait_5_0, P_wait_5_1, P_wait_5_2, P_wait_5_3, P_wait_5_4, P_wait_5_5, P_wait_5_6, P_wait_5_7, P_wait_6_0, P_wait_6_1, P_wait_6_2, P_wait_6_3, P_wait_6_4, P_wait_6_5, P_wait_6_6, P_wait_6_7, P_wait_7_0, P_wait_7_1, P_wait_7_2, P_wait_7_3, P_wait_7_4, P_wait_7_5, P_wait_7_6, P_wait_7_7, P_await_13_0, P_await_13_1, P_await_13_2, P_await_13_3, P_await_13_4, P_await_13_5, P_await_13_6, P_await_13_7, P_done_0_0, P_done_0_1, P_done_0_2, P_done_0_3, P_done_0_4, P_done_0_5, P_done_0_6, P_done_0_7, P_done_1_0, P_done_1_1, P_done_1_2, P_done_1_3, P_done_1_4, P_done_1_5, P_done_1_6, P_done_1_7, P_done_2_0, P_done_2_1, P_done_2_2, P_done_2_3, P_done_2_4, P_done_2_5, P_done_2_6, P_done_2_7, P_done_3_0, P_done_3_1, P_done_3_2, P_done_3_3, P_done_3_4, P_done_3_5, P_done_3_6, P_done_3_7, P_done_4_0, P_done_4_1, P_done_4_2, P_done_4_3, P_done_4_4, P_done_4_5, P_done_4_6, P_done_4_7, P_done_5_0, P_done_5_1, P_done_5_2, P_done_5_3, P_done_5_4, P_done_5_5, P_done_5_6, P_done_5_7, P_done_6_0, P_done_6_1, P_done_6_2, P_done_6_3, P_done_6_4, P_done_6_5, P_done_6_6, P_done_6_7, P_done_7_0, P_done_7_1, P_done_7_2, P_done_7_3, P_done_7_4, P_done_7_5, P_done_7_6, P_done_7_7, P_ifyi_15_0, P_ifyi_15_1, P_ifyi_15_2, P_ifyi_15_3, P_ifyi_15_4, P_ifyi_15_5, P_ifyi_15_6, P_ifyi_15_7, P_awaity_0, P_awaity_1, P_awaity_2, P_awaity_3, P_awaity_4, P_awaity_5, P_awaity_6, P_awaity_7, P_CS_21_0, P_CS_21_1, P_CS_21_2, P_CS_21_3, P_CS_21_4, P_CS_21_5, P_CS_21_6, P_CS_21_7, P_setbi_24_0, P_setbi_24_1, P_setbi_24_2, P_setbi_24_3, P_setbi_24_4, P_setbi_24_5, P_setbi_24_6, P_setbi_24_7]
[2023-03-22 11:54:04] [INFO ] Parsed PT model containing 264 places and 536 transitions and 2352 arcs in 153 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 45 places in 3 ms
Reduce places removed 45 places and 74 transitions.
FORMULA LamportFastMutEx-PT-7-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 336 out of 462 initially.
// Phase 1: matrix 336 rows 219 cols
[2023-03-22 11:54:04] [INFO ] Computed 65 place invariants in 21 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 15) seen :85
FORMULA LamportFastMutEx-PT-7-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-7-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-7-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-7-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-7-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-7-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-7-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :63
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :59
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :35
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :68
FORMULA LamportFastMutEx-PT-7-UpperBounds-03 7 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 :65
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 7) seen :46
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 7) seen :61
[2023-03-22 11:54:05] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2023-03-22 11:54:05] [INFO ] Computed 65 place invariants in 13 ms
[2023-03-22 11:54:05] [INFO ] [Real]Absence check using 65 positive place invariants in 27 ms returned sat
[2023-03-22 11:54:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:54:05] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2023-03-22 11:54:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:54:05] [INFO ] [Nat]Absence check using 65 positive place invariants in 14 ms returned sat
[2023-03-22 11:54:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:54:05] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2023-03-22 11:54:05] [INFO ] State equation strengthened by 91 read => feed constraints.
[2023-03-22 11:54:05] [INFO ] [Nat]Added 91 Read/Feed constraints in 46 ms returned sat
[2023-03-22 11:54:05] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 4 ms to minimize.
[2023-03-22 11:54:05] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2023-03-22 11:54:05] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2023-03-22 11:54:06] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 2 ms to minimize.
[2023-03-22 11:54:06] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2023-03-22 11:54:06] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2023-03-22 11:54:06] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2023-03-22 11:54:06] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 2 ms to minimize.
[2023-03-22 11:54:06] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2023-03-22 11:54:06] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2023-03-22 11:54:06] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 691 ms
[2023-03-22 11:54:06] [INFO ] Computed and/alt/rep : 301/1778/301 causal constraints (skipped 28 transitions) in 38 ms.
[2023-03-22 11:54:07] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2023-03-22 11:54:08] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 0 ms to minimize.
[2023-03-22 11:54:08] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 0 ms to minimize.
[2023-03-22 11:54:08] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 0 ms to minimize.
[2023-03-22 11:54:08] [INFO ] Deduced a trap composed of 52 places in 69 ms of which 0 ms to minimize.
[2023-03-22 11:54:08] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 0 ms to minimize.
[2023-03-22 11:54:08] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2023-03-22 11:54:08] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 0 ms to minimize.
[2023-03-22 11:54:08] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 0 ms to minimize.
[2023-03-22 11:54:08] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1032 ms
[2023-03-22 11:54:08] [INFO ] Added : 194 causal constraints over 41 iterations in 2577 ms. Result :sat
Minimization took 471 ms.
[2023-03-22 11:54:09] [INFO ] [Real]Absence check using 65 positive place invariants in 16 ms returned sat
[2023-03-22 11:54:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:54:09] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2023-03-22 11:54:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:54:09] [INFO ] [Nat]Absence check using 65 positive place invariants in 14 ms returned sat
[2023-03-22 11:54:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:54:09] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2023-03-22 11:54:09] [INFO ] [Nat]Added 91 Read/Feed constraints in 16 ms returned sat
[2023-03-22 11:54:09] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2023-03-22 11:54:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2023-03-22 11:54:09] [INFO ] Computed and/alt/rep : 301/1778/301 causal constraints (skipped 28 transitions) in 29 ms.
[2023-03-22 11:54:10] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 1 ms to minimize.
[2023-03-22 11:54:10] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 1 ms to minimize.
[2023-03-22 11:54:10] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 0 ms to minimize.
[2023-03-22 11:54:10] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 1 ms to minimize.
[2023-03-22 11:54:10] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2023-03-22 11:54:10] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 1 ms to minimize.
[2023-03-22 11:54:10] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 0 ms to minimize.
[2023-03-22 11:54:11] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 0 ms to minimize.
[2023-03-22 11:54:11] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2023-03-22 11:54:11] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2023-03-22 11:54:11] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 0 ms to minimize.
[2023-03-22 11:54:11] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1149 ms
[2023-03-22 11:54:11] [INFO ] Added : 83 causal constraints over 17 iterations in 1619 ms. Result :sat
Minimization took 182 ms.
[2023-03-22 11:54:11] [INFO ] [Real]Absence check using 65 positive place invariants in 11 ms returned sat
[2023-03-22 11:54:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:54:11] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2023-03-22 11:54:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:54:11] [INFO ] [Nat]Absence check using 65 positive place invariants in 13 ms returned sat
[2023-03-22 11:54:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:54:11] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2023-03-22 11:54:11] [INFO ] [Nat]Added 91 Read/Feed constraints in 23 ms returned sat
[2023-03-22 11:54:11] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 0 ms to minimize.
[2023-03-22 11:54:12] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 0 ms to minimize.
[2023-03-22 11:54:12] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2023-03-22 11:54:12] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 2 ms to minimize.
[2023-03-22 11:54:12] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 1 ms to minimize.
[2023-03-22 11:54:12] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 0 ms to minimize.
[2023-03-22 11:54:12] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 0 ms to minimize.
[2023-03-22 11:54:12] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 0 ms to minimize.
[2023-03-22 11:54:12] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
[2023-03-22 11:54:12] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2023-03-22 11:54:12] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2023-03-22 11:54:13] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2023-03-22 11:54:13] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 0 ms to minimize.
[2023-03-22 11:54:13] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2023-03-22 11:54:13] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2023-03-22 11:54:13] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2023-03-22 11:54:13] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 0 ms to minimize.
[2023-03-22 11:54:13] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 0 ms to minimize.
[2023-03-22 11:54:13] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 0 ms to minimize.
[2023-03-22 11:54:13] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2023-03-22 11:54:13] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 2 ms to minimize.
[2023-03-22 11:54:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 21 trap constraints in 1843 ms
[2023-03-22 11:54:13] [INFO ] [Real]Absence check using 65 positive place invariants in 12 ms returned sat
[2023-03-22 11:54:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:54:13] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2023-03-22 11:54:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:54:13] [INFO ] [Nat]Absence check using 65 positive place invariants in 16 ms returned sat
[2023-03-22 11:54:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:54:14] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2023-03-22 11:54:14] [INFO ] [Nat]Added 91 Read/Feed constraints in 12 ms returned sat
[2023-03-22 11:54:14] [INFO ] Computed and/alt/rep : 301/1778/301 causal constraints (skipped 28 transitions) in 27 ms.
[2023-03-22 11:54:14] [INFO ] Added : 77 causal constraints over 16 iterations in 465 ms. Result :sat
Minimization took 140 ms.
[2023-03-22 11:54:14] [INFO ] [Real]Absence check using 65 positive place invariants in 13 ms returned sat
[2023-03-22 11:54:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:54:14] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2023-03-22 11:54:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:54:14] [INFO ] [Nat]Absence check using 65 positive place invariants in 19 ms returned sat
[2023-03-22 11:54:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:54:14] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2023-03-22 11:54:15] [INFO ] [Nat]Added 91 Read/Feed constraints in 62 ms returned sat
[2023-03-22 11:54:15] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2023-03-22 11:54:15] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 0 ms to minimize.
[2023-03-22 11:54:15] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2023-03-22 11:54:15] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 0 ms to minimize.
[2023-03-22 11:54:15] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 4 ms to minimize.
[2023-03-22 11:54:15] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 0 ms to minimize.
[2023-03-22 11:54:15] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2023-03-22 11:54:15] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2023-03-22 11:54:15] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 0 ms to minimize.
[2023-03-22 11:54:15] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2023-03-22 11:54:15] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 685 ms
[2023-03-22 11:54:15] [INFO ] Computed and/alt/rep : 301/1778/301 causal constraints (skipped 28 transitions) in 27 ms.
[2023-03-22 11:54:16] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 0 ms to minimize.
[2023-03-22 11:54:16] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 0 ms to minimize.
[2023-03-22 11:54:16] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 0 ms to minimize.
[2023-03-22 11:54:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 282 ms
[2023-03-22 11:54:16] [INFO ] Added : 82 causal constraints over 17 iterations in 781 ms. Result :sat
Minimization took 255 ms.
[2023-03-22 11:54:16] [INFO ] [Real]Absence check using 65 positive place invariants in 13 ms returned sat
[2023-03-22 11:54:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:54:16] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2023-03-22 11:54:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:54:16] [INFO ] [Nat]Absence check using 65 positive place invariants in 14 ms returned sat
[2023-03-22 11:54:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:54:17] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2023-03-22 11:54:17] [INFO ] [Nat]Added 91 Read/Feed constraints in 11 ms returned sat
[2023-03-22 11:54:17] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 0 ms to minimize.
[2023-03-22 11:54:17] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2023-03-22 11:54:17] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2023-03-22 11:54:17] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 0 ms to minimize.
[2023-03-22 11:54:17] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2023-03-22 11:54:17] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2023-03-22 11:54:17] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 0 ms to minimize.
[2023-03-22 11:54:17] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 571 ms
[2023-03-22 11:54:17] [INFO ] Computed and/alt/rep : 301/1778/301 causal constraints (skipped 28 transitions) in 29 ms.
[2023-03-22 11:54:18] [INFO ] Added : 96 causal constraints over 20 iterations in 547 ms. Result :sat
Minimization took 195 ms.
[2023-03-22 11:54:18] [INFO ] [Real]Absence check using 65 positive place invariants in 13 ms returned sat
[2023-03-22 11:54:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:54:18] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2023-03-22 11:54:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:54:18] [INFO ] [Nat]Absence check using 65 positive place invariants in 13 ms returned sat
[2023-03-22 11:54:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:54:18] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2023-03-22 11:54:18] [INFO ] [Nat]Added 91 Read/Feed constraints in 23 ms returned sat
[2023-03-22 11:54:18] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 0 ms to minimize.
[2023-03-22 11:54:18] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 1 ms to minimize.
[2023-03-22 11:54:18] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 1 ms to minimize.
[2023-03-22 11:54:18] [INFO ] Deduced a trap composed of 42 places in 76 ms of which 1 ms to minimize.
[2023-03-22 11:54:19] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2023-03-22 11:54:19] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 0 ms to minimize.
[2023-03-22 11:54:19] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 1 ms to minimize.
[2023-03-22 11:54:19] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 1 ms to minimize.
[2023-03-22 11:54:19] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 0 ms to minimize.
[2023-03-22 11:54:19] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 0 ms to minimize.
[2023-03-22 11:54:19] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2023-03-22 11:54:19] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2023-03-22 11:54:19] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2023-03-22 11:54:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 13 trap constraints in 1238 ms
Current structural bounds on expressions (after SMT) : [49, 7, 6, 7, 49, 7, 6] Max seen :[38, 1, 6, 5, 28, 4, 6]
FORMULA LamportFastMutEx-PT-7-UpperBounds-07 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-7-UpperBounds-02 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-7-UpperBounds-04 7 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 112 out of 219 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 27 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 219/219 places, 462/462 transitions.
Normalized transition count is 336 out of 462 initially.
// Phase 1: matrix 336 rows 219 cols
[2023-03-22 11:54:21] [INFO ] Computed 65 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3570 ms. (steps per millisecond=280 ) properties (out of 4) seen :74
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1628 ms. (steps per millisecond=614 ) properties (out of 4) seen :60
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 896 ms. (steps per millisecond=1116 ) properties (out of 4) seen :70
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1671 ms. (steps per millisecond=598 ) properties (out of 4) seen :82
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 897 ms. (steps per millisecond=1114 ) properties (out of 4) seen :58
[2023-03-22 11:54:29] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2023-03-22 11:54:29] [INFO ] Computed 65 place invariants in 6 ms
[2023-03-22 11:54:29] [INFO ] [Real]Absence check using 65 positive place invariants in 13 ms returned sat
[2023-03-22 11:54:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:54:29] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2023-03-22 11:54:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:54:30] [INFO ] [Nat]Absence check using 65 positive place invariants in 12 ms returned sat
[2023-03-22 11:54:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:54:30] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2023-03-22 11:54:30] [INFO ] State equation strengthened by 91 read => feed constraints.
[2023-03-22 11:54:30] [INFO ] [Nat]Added 91 Read/Feed constraints in 61 ms returned sat
[2023-03-22 11:54:30] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 0 ms to minimize.
[2023-03-22 11:54:30] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2023-03-22 11:54:30] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2023-03-22 11:54:30] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2023-03-22 11:54:30] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2023-03-22 11:54:30] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2023-03-22 11:54:30] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2023-03-22 11:54:30] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2023-03-22 11:54:30] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
[2023-03-22 11:54:30] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2023-03-22 11:54:30] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2023-03-22 11:54:31] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2023-03-22 11:54:31] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
[2023-03-22 11:54:31] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2023-03-22 11:54:31] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2023-03-22 11:54:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 15 trap constraints in 1186 ms
[2023-03-22 11:54:31] [INFO ] [Real]Absence check using 65 positive place invariants in 12 ms returned sat
[2023-03-22 11:54:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:54:31] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2023-03-22 11:54:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:54:31] [INFO ] [Nat]Absence check using 65 positive place invariants in 13 ms returned sat
[2023-03-22 11:54:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:54:31] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2023-03-22 11:54:31] [INFO ] [Nat]Added 91 Read/Feed constraints in 17 ms returned sat
[2023-03-22 11:54:31] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2023-03-22 11:54:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2023-03-22 11:54:31] [INFO ] Computed and/alt/rep : 301/1778/301 causal constraints (skipped 28 transitions) in 20 ms.
[2023-03-22 11:54:32] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 1 ms to minimize.
[2023-03-22 11:54:32] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 0 ms to minimize.
[2023-03-22 11:54:32] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 0 ms to minimize.
[2023-03-22 11:54:32] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 0 ms to minimize.
[2023-03-22 11:54:32] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2023-03-22 11:54:32] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 0 ms to minimize.
[2023-03-22 11:54:32] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 0 ms to minimize.
[2023-03-22 11:54:32] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
[2023-03-22 11:54:33] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2023-03-22 11:54:33] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2023-03-22 11:54:33] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 0 ms to minimize.
[2023-03-22 11:54:33] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1097 ms
[2023-03-22 11:54:33] [INFO ] Added : 83 causal constraints over 17 iterations in 1527 ms. Result :sat
Minimization took 190 ms.
[2023-03-22 11:54:33] [INFO ] [Real]Absence check using 65 positive place invariants in 13 ms returned sat
[2023-03-22 11:54:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:54:33] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2023-03-22 11:54:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:54:33] [INFO ] [Nat]Absence check using 65 positive place invariants in 15 ms returned sat
[2023-03-22 11:54:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:54:33] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2023-03-22 11:54:33] [INFO ] [Nat]Added 91 Read/Feed constraints in 71 ms returned sat
[2023-03-22 11:54:33] [INFO ] Deduced a trap composed of 49 places in 74 ms of which 1 ms to minimize.
[2023-03-22 11:54:33] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 0 ms to minimize.
[2023-03-22 11:54:34] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2023-03-22 11:54:34] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2023-03-22 11:54:34] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2023-03-22 11:54:34] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 0 ms to minimize.
[2023-03-22 11:54:34] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 0 ms to minimize.
[2023-03-22 11:54:34] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 0 ms to minimize.
[2023-03-22 11:54:34] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2023-03-22 11:54:34] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2023-03-22 11:54:34] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2023-03-22 11:54:34] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 0 ms to minimize.
[2023-03-22 11:54:34] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 0 ms to minimize.
[2023-03-22 11:54:34] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 0 ms to minimize.
[2023-03-22 11:54:34] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2023-03-22 11:54:34] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 0 ms to minimize.
[2023-03-22 11:54:34] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 0 ms to minimize.
[2023-03-22 11:54:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 17 trap constraints in 1473 ms
[2023-03-22 11:54:35] [INFO ] [Real]Absence check using 65 positive place invariants in 14 ms returned sat
[2023-03-22 11:54:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:54:35] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2023-03-22 11:54:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:54:35] [INFO ] [Nat]Absence check using 65 positive place invariants in 13 ms returned sat
[2023-03-22 11:54:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:54:35] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2023-03-22 11:54:35] [INFO ] [Nat]Added 91 Read/Feed constraints in 19 ms returned sat
[2023-03-22 11:54:35] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 0 ms to minimize.
[2023-03-22 11:54:35] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 0 ms to minimize.
[2023-03-22 11:54:35] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 0 ms to minimize.
[2023-03-22 11:54:35] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 0 ms to minimize.
[2023-03-22 11:54:35] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2023-03-22 11:54:36] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2023-03-22 11:54:36] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 0 ms to minimize.
[2023-03-22 11:54:36] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2023-03-22 11:54:36] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
[2023-03-22 11:54:36] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 0 ms to minimize.
[2023-03-22 11:54:36] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2023-03-22 11:54:36] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 0 ms to minimize.
[2023-03-22 11:54:36] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 0 ms to minimize.
[2023-03-22 11:54:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 13 trap constraints in 1039 ms
Current structural bounds on expressions (after SMT) : [42, 7, 42, 6] Max seen :[42, 1, 42, 6]
FORMULA LamportFastMutEx-PT-7-UpperBounds-06 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-7-UpperBounds-05 42 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-7-UpperBounds-00 42 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 7 out of 219 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 462/462 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 212 transition count 455
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 21 place count 212 transition count 448
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 28 place count 205 transition count 448
Applied a total of 28 rules in 54 ms. Remains 205 /219 variables (removed 14) and now considering 448/462 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 205/219 places, 448/462 transitions.
Normalized transition count is 322 out of 448 initially.
// Phase 1: matrix 322 rows 205 cols
[2023-03-22 11:54:36] [INFO ] Computed 65 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2162 ms. (steps per millisecond=462 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 691 ms. (steps per millisecond=1447 ) properties (out of 1) seen :1
[2023-03-22 11:54:39] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 205 cols
[2023-03-22 11:54:39] [INFO ] Computed 65 place invariants in 6 ms
[2023-03-22 11:54:39] [INFO ] [Real]Absence check using 65 positive place invariants in 11 ms returned sat
[2023-03-22 11:54:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:54:39] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2023-03-22 11:54:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:54:39] [INFO ] [Nat]Absence check using 65 positive place invariants in 12 ms returned sat
[2023-03-22 11:54:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:54:39] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2023-03-22 11:54:39] [INFO ] State equation strengthened by 91 read => feed constraints.
[2023-03-22 11:54:39] [INFO ] [Nat]Added 91 Read/Feed constraints in 12 ms returned sat
[2023-03-22 11:54:39] [INFO ] Computed and/alt/rep : 280/1750/280 causal constraints (skipped 35 transitions) in 19 ms.
[2023-03-22 11:54:40] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 0 ms to minimize.
[2023-03-22 11:54:40] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 0 ms to minimize.
[2023-03-22 11:54:40] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2023-03-22 11:54:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 361 ms
[2023-03-22 11:54:40] [INFO ] Added : 77 causal constraints over 17 iterations in 810 ms. Result :sat
Minimization took 164 ms.
Current structural bounds on expressions (after SMT) : [7] Max seen :[1]
Support contains 7 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 448/448 transitions.
Applied a total of 0 rules in 12 ms. Remains 205 /205 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 205/205 places, 448/448 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 448/448 transitions.
Applied a total of 0 rules in 11 ms. Remains 205 /205 variables (removed 0) and now considering 448/448 (removed 0) transitions.
[2023-03-22 11:54:41] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 11:54:41] [INFO ] Invariant cache hit.
[2023-03-22 11:54:41] [INFO ] Implicit Places using invariants in 212 ms returned [128, 129, 130, 131, 132, 133, 134]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 214 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 198/205 places, 448/448 transitions.
Applied a total of 0 rules in 11 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 237 ms. Remains : 198/205 places, 448/448 transitions.
Normalized transition count is 322 out of 448 initially.
// Phase 1: matrix 322 rows 198 cols
[2023-03-22 11:54:41] [INFO ] Computed 58 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2056 ms. (steps per millisecond=486 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 666 ms. (steps per millisecond=1501 ) properties (out of 1) seen :1
[2023-03-22 11:54:44] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2023-03-22 11:54:44] [INFO ] Computed 58 place invariants in 4 ms
[2023-03-22 11:54:44] [INFO ] [Real]Absence check using 58 positive place invariants in 11 ms returned sat
[2023-03-22 11:54:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:54:44] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2023-03-22 11:54:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:54:44] [INFO ] [Nat]Absence check using 58 positive place invariants in 11 ms returned sat
[2023-03-22 11:54:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:54:44] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2023-03-22 11:54:44] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 11:54:44] [INFO ] [Nat]Added 42 Read/Feed constraints in 9 ms returned sat
[2023-03-22 11:54:44] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 1 ms to minimize.
[2023-03-22 11:54:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2023-03-22 11:54:44] [INFO ] Computed and/alt/rep : 280/1652/280 causal constraints (skipped 35 transitions) in 19 ms.
[2023-03-22 11:54:44] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2023-03-22 11:54:44] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2023-03-22 11:54:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 164 ms
[2023-03-22 11:54:44] [INFO ] Added : 71 causal constraints over 15 iterations in 530 ms. Result :sat
Minimization took 117 ms.
Current structural bounds on expressions (after SMT) : [7] Max seen :[1]
Support contains 7 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 448/448 transitions.
Applied a total of 0 rules in 18 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 198/198 places, 448/448 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 448/448 transitions.
Applied a total of 0 rules in 12 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
[2023-03-22 11:54:45] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 11:54:45] [INFO ] Invariant cache hit.
[2023-03-22 11:54:45] [INFO ] Implicit Places using invariants in 156 ms returned []
[2023-03-22 11:54:45] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 11:54:45] [INFO ] Invariant cache hit.
[2023-03-22 11:54:45] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 11:54:45] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
[2023-03-22 11:54:45] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-22 11:54:45] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 11:54:45] [INFO ] Invariant cache hit.
[2023-03-22 11:54:45] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 713 ms. Remains : 198/198 places, 448/448 transitions.
Starting property specific reduction for LamportFastMutEx-PT-7-UpperBounds-01
Normalized transition count is 322 out of 448 initially.
// Phase 1: matrix 322 rows 198 cols
[2023-03-22 11:54:45] [INFO ] Computed 58 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :1
[2023-03-22 11:54:45] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2023-03-22 11:54:45] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-22 11:54:45] [INFO ] [Real]Absence check using 58 positive place invariants in 10 ms returned sat
[2023-03-22 11:54:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:54:46] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2023-03-22 11:54:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:54:46] [INFO ] [Nat]Absence check using 58 positive place invariants in 12 ms returned sat
[2023-03-22 11:54:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:54:46] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2023-03-22 11:54:46] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 11:54:46] [INFO ] [Nat]Added 42 Read/Feed constraints in 11 ms returned sat
[2023-03-22 11:54:46] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 1 ms to minimize.
[2023-03-22 11:54:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2023-03-22 11:54:46] [INFO ] Computed and/alt/rep : 280/1652/280 causal constraints (skipped 35 transitions) in 20 ms.
[2023-03-22 11:54:46] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2023-03-22 11:54:46] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2023-03-22 11:54:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 175 ms
[2023-03-22 11:54:46] [INFO ] Added : 71 causal constraints over 15 iterations in 548 ms. Result :sat
Minimization took 120 ms.
Current structural bounds on expressions (after SMT) : [7] Max seen :[1]
Support contains 7 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 448/448 transitions.
Applied a total of 0 rules in 8 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 198/198 places, 448/448 transitions.
Normalized transition count is 322 out of 448 initially.
// Phase 1: matrix 322 rows 198 cols
[2023-03-22 11:54:47] [INFO ] Computed 58 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2056 ms. (steps per millisecond=486 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 674 ms. (steps per millisecond=1483 ) properties (out of 1) seen :1
[2023-03-22 11:54:49] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2023-03-22 11:54:49] [INFO ] Computed 58 place invariants in 5 ms
[2023-03-22 11:54:49] [INFO ] [Real]Absence check using 58 positive place invariants in 10 ms returned sat
[2023-03-22 11:54:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:54:49] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2023-03-22 11:54:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:54:50] [INFO ] [Nat]Absence check using 58 positive place invariants in 12 ms returned sat
[2023-03-22 11:54:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:54:50] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2023-03-22 11:54:50] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 11:54:50] [INFO ] [Nat]Added 42 Read/Feed constraints in 8 ms returned sat
[2023-03-22 11:54:50] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 0 ms to minimize.
[2023-03-22 11:54:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2023-03-22 11:54:50] [INFO ] Computed and/alt/rep : 280/1652/280 causal constraints (skipped 35 transitions) in 20 ms.
[2023-03-22 11:54:50] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2023-03-22 11:54:50] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2023-03-22 11:54:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 168 ms
[2023-03-22 11:54:50] [INFO ] Added : 71 causal constraints over 15 iterations in 539 ms. Result :sat
Minimization took 114 ms.
Current structural bounds on expressions (after SMT) : [7] Max seen :[1]
Support contains 7 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 448/448 transitions.
Applied a total of 0 rules in 8 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 198/198 places, 448/448 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 448/448 transitions.
Applied a total of 0 rules in 7 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
[2023-03-22 11:54:51] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 11:54:51] [INFO ] Invariant cache hit.
[2023-03-22 11:54:51] [INFO ] Implicit Places using invariants in 159 ms returned []
[2023-03-22 11:54:51] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 11:54:51] [INFO ] Invariant cache hit.
[2023-03-22 11:54:51] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 11:54:51] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 483 ms to find 0 implicit places.
[2023-03-22 11:54:51] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-22 11:54:51] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 11:54:51] [INFO ] Invariant cache hit.
[2023-03-22 11:54:51] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 674 ms. Remains : 198/198 places, 448/448 transitions.
Ending property specific reduction for LamportFastMutEx-PT-7-UpperBounds-01 in 5775 ms.
[2023-03-22 11:54:51] [INFO ] Flatten gal took : 67 ms
[2023-03-22 11:54:51] [INFO ] Applying decomposition
[2023-03-22 11:54:51] [INFO ] Flatten gal took : 30 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph4220541683435498235.txt' '-o' '/tmp/graph4220541683435498235.bin' '-w' '/tmp/graph4220541683435498235.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph4220541683435498235.bin' '-l' '-1' '-v' '-w' '/tmp/graph4220541683435498235.weights' '-q' '0' '-e' '0.001'
[2023-03-22 11:54:52] [INFO ] Decomposing Gal with order
[2023-03-22 11:54:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-22 11:54:52] [INFO ] Removed a total of 663 redundant transitions.
[2023-03-22 11:54:52] [INFO ] Flatten gal took : 71 ms
[2023-03-22 11:54:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 82 labels/synchronizations in 11 ms.
[2023-03-22 11:54:52] [INFO ] Time to serialize gal into /tmp/UpperBounds10890679106973814479.gal : 6 ms
[2023-03-22 11:54:52] [INFO ] Time to serialize properties into /tmp/UpperBounds6178960750647525187.prop : 0 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.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds10890679106973814479.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds6178960750647525187.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.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...305
Loading property file /tmp/UpperBounds6178960750647525187.prop.
Detected timeout of ITS tools.
[2023-03-22 12:15:21] [INFO ] Applying decomposition
[2023-03-22 12:15:21] [INFO ] Flatten gal took : 393 ms
[2023-03-22 12:15:21] [INFO ] Decomposing Gal with order
[2023-03-22 12:15:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-22 12:15:22] [INFO ] Removed a total of 495 redundant transitions.
[2023-03-22 12:15:22] [INFO ] Flatten gal took : 271 ms
[2023-03-22 12:15:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 133 labels/synchronizations in 42 ms.
[2023-03-22 12:15:22] [INFO ] Time to serialize gal into /tmp/UpperBounds10493295786005297309.gal : 37 ms
[2023-03-22 12:15:22] [INFO ] Time to serialize properties into /tmp/UpperBounds17200167486170455152.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.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds10493295786005297309.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds17200167486170455152.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.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...306
Loading property file /tmp/UpperBounds17200167486170455152.prop.
Detected timeout of ITS tools.
[2023-03-22 12:36:16] [INFO ] Flatten gal took : 242 ms
[2023-03-22 12:36:17] [INFO ] Input system was already deterministic with 448 transitions.
[2023-03-22 12:36:17] [INFO ] Transformed 198 places.
[2023-03-22 12:36:17] [INFO ] Transformed 448 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
[2023-03-22 12:36:18] [INFO ] Time to serialize gal into /tmp/UpperBounds8825498999944440260.gal : 14 ms
[2023-03-22 12:36:18] [INFO ] Time to serialize properties into /tmp/UpperBounds6397264377782636072.prop : 2 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.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds8825498999944440260.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds6397264377782636072.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.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...349
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds6397264377782636072.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 135496 kB
After kill :
MemTotal: 16393216 kB
MemFree: 11411720 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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-7"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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-5348"
echo " Executing tool itstools"
echo " Input is LamportFastMutEx-PT-7, 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 r229-tall-167856413200437"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-PT-7.tgz
mv LamportFastMutEx-PT-7 execution
cd execution
if [ "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 ;