About the Execution of ITS-Tools for LamportFastMutEx-PT-6
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2502.464 | 172537.00 | 192732.00 | 1053.40 | 6 5 1 6 30 6 6 30 1 1 0 1 1 1 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/mcc2021-input.r121-tall-162075407300675.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is LamportFastMutEx-PT-6, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-tall-162075407300675
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 58K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 312K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 127K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 635K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 12K Apr 26 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Apr 26 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 26 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 26 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.1K Mar 27 06:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 27 06:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Mar 25 07:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Mar 25 07:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.2K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 208K May 5 16:51 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-6-UpperBounds-00
FORMULA_NAME LamportFastMutEx-PT-6-UpperBounds-01
FORMULA_NAME LamportFastMutEx-PT-6-UpperBounds-02
FORMULA_NAME LamportFastMutEx-PT-6-UpperBounds-03
FORMULA_NAME LamportFastMutEx-PT-6-UpperBounds-04
FORMULA_NAME LamportFastMutEx-PT-6-UpperBounds-05
FORMULA_NAME LamportFastMutEx-PT-6-UpperBounds-06
FORMULA_NAME LamportFastMutEx-PT-6-UpperBounds-07
FORMULA_NAME LamportFastMutEx-PT-6-UpperBounds-08
FORMULA_NAME LamportFastMutEx-PT-6-UpperBounds-09
FORMULA_NAME LamportFastMutEx-PT-6-UpperBounds-10
FORMULA_NAME LamportFastMutEx-PT-6-UpperBounds-11
FORMULA_NAME LamportFastMutEx-PT-6-UpperBounds-12
FORMULA_NAME LamportFastMutEx-PT-6-UpperBounds-13
FORMULA_NAME LamportFastMutEx-PT-6-UpperBounds-14
FORMULA_NAME LamportFastMutEx-PT-6-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1620883205094
Running Version 0
[2021-05-13 05:20:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-13 05:20:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 05:20:06] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2021-05-13 05:20:06] [INFO ] Transformed 217 places.
[2021-05-13 05:20:06] [INFO ] Transformed 420 transitions.
[2021-05-13 05:20:06] [INFO ] Found NUPN structural information;
[2021-05-13 05:20:06] [INFO ] Completing missing partition info from NUPN : creating a component with [P_start_1_0, P_start_1_1, P_start_1_2, P_start_1_3, P_start_1_4, P_start_1_5, P_start_1_6, P_b_0_false, P_b_0_true, P_b_1_false, P_b_1_true, P_b_2_false, P_b_2_true, P_b_3_false, P_b_3_true, P_b_4_false, P_b_4_true, P_b_5_false, P_b_5_true, P_b_6_false, P_b_6_true, P_setx_3_0, P_setx_3_1, P_setx_3_2, P_setx_3_3, P_setx_3_4, P_setx_3_5, P_setx_3_6, P_setbi_5_0, P_setbi_5_1, P_setbi_5_2, P_setbi_5_3, P_setbi_5_4, P_setbi_5_5, P_setbi_5_6, P_ify0_4_0, P_ify0_4_1, P_ify0_4_2, P_ify0_4_3, P_ify0_4_4, P_ify0_4_5, P_ify0_4_6, P_sety_9_0, P_sety_9_1, P_sety_9_2, P_sety_9_3, P_sety_9_4, P_sety_9_5, P_sety_9_6, P_ifxi_10_0, P_ifxi_10_1, P_ifxi_10_2, P_ifxi_10_3, P_ifxi_10_4, P_ifxi_10_5, P_ifxi_10_6, P_setbi_11_0, P_setbi_11_1, P_setbi_11_2, P_setbi_11_3, P_setbi_11_4, P_setbi_11_5, P_setbi_11_6, P_fordo_12_0, P_fordo_12_1, P_fordo_12_2, P_fordo_12_3, P_fordo_12_4, P_fordo_12_5, P_fordo_12_6, P_wait_0_0, P_wait_0_1, P_wait_0_2, P_wait_0_3, P_wait_0_4, P_wait_0_5, P_wait_0_6, P_wait_1_0, P_wait_1_1, P_wait_1_2, P_wait_1_3, P_wait_1_4, P_wait_1_5, P_wait_1_6, P_wait_2_0, P_wait_2_1, P_wait_2_2, P_wait_2_3, P_wait_2_4, P_wait_2_5, P_wait_2_6, P_wait_3_0, P_wait_3_1, P_wait_3_2, P_wait_3_3, P_wait_3_4, P_wait_3_5, P_wait_3_6, P_wait_4_0, P_wait_4_1, P_wait_4_2, P_wait_4_3, P_wait_4_4, P_wait_4_5, P_wait_4_6, P_wait_5_0, P_wait_5_1, P_wait_5_2, P_wait_5_3, P_wait_5_4, P_wait_5_5, P_wait_5_6, P_wait_6_0, P_wait_6_1, P_wait_6_2, P_wait_6_3, P_wait_6_4, P_wait_6_5, P_wait_6_6, P_await_13_0, P_await_13_1, P_await_13_2, P_await_13_3, P_await_13_4, P_await_13_5, P_await_13_6, P_done_0_0, P_done_0_1, P_done_0_2, P_done_0_3, P_done_0_4, P_done_0_5, P_done_0_6, P_done_1_0, P_done_1_1, P_done_1_2, P_done_1_3, P_done_1_4, P_done_1_5, P_done_1_6, P_done_2_0, P_done_2_1, P_done_2_2, P_done_2_3, P_done_2_4, P_done_2_5, P_done_2_6, P_done_3_0, P_done_3_1, P_done_3_2, P_done_3_3, P_done_3_4, P_done_3_5, P_done_3_6, P_done_4_0, P_done_4_1, P_done_4_2, P_done_4_3, P_done_4_4, P_done_4_5, P_done_4_6, P_done_5_0, P_done_5_1, P_done_5_2, P_done_5_3, P_done_5_4, P_done_5_5, P_done_5_6, P_done_6_0, P_done_6_1, P_done_6_2, P_done_6_3, P_done_6_4, P_done_6_5, P_done_6_6, P_ifyi_15_0, P_ifyi_15_1, P_ifyi_15_2, P_ifyi_15_3, P_ifyi_15_4, P_ifyi_15_5, P_ifyi_15_6, P_awaity_0, P_awaity_1, P_awaity_2, P_awaity_3, P_awaity_4, P_awaity_5, P_awaity_6, P_CS_21_0, P_CS_21_1, P_CS_21_2, P_CS_21_3, P_CS_21_4, P_CS_21_5, P_CS_21_6, P_setbi_24_0, P_setbi_24_1, P_setbi_24_2, P_setbi_24_3, P_setbi_24_4, P_setbi_24_5, P_setbi_24_6]
[2021-05-13 05:20:06] [INFO ] Parsed PT model containing 217 places and 420 transitions in 118 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 66 transitions.
FORMULA LamportFastMutEx-PT-6-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 264 out of 354 initially.
// Phase 1: matrix 264 rows 176 cols
[2021-05-13 05:20:07] [INFO ] Computed 50 place invariants in 21 ms
FORMULA LamportFastMutEx-PT-6-UpperBounds-05 6 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-6-UpperBounds-03 6 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 13) seen :59
FORMULA LamportFastMutEx-PT-6-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-6-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-6-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-6-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-6-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-6-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-6-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :43
FORMULA LamportFastMutEx-PT-6-UpperBounds-00 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :33
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :57
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :47
[2021-05-13 05:20:07] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2021-05-13 05:20:07] [INFO ] Computed 50 place invariants in 4 ms
[2021-05-13 05:20:07] [INFO ] [Real]Absence check using 50 positive place invariants in 22 ms returned sat
[2021-05-13 05:20:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 05:20:07] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2021-05-13 05:20:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 05:20:07] [INFO ] [Nat]Absence check using 50 positive place invariants in 11 ms returned sat
[2021-05-13 05:20:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 05:20:07] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2021-05-13 05:20:07] [INFO ] State equation strengthened by 84 read => feed constraints.
[2021-05-13 05:20:07] [INFO ] [Nat]Added 84 Read/Feed constraints in 11 ms returned sat
[2021-05-13 05:20:07] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 3 ms to minimize.
[2021-05-13 05:20:07] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2021-05-13 05:20:07] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
[2021-05-13 05:20:08] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2021-05-13 05:20:08] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 0 ms to minimize.
[2021-05-13 05:20:08] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2021-05-13 05:20:08] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 0 ms to minimize.
[2021-05-13 05:20:08] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2021-05-13 05:20:08] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2021-05-13 05:20:08] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2021-05-13 05:20:08] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
[2021-05-13 05:20:08] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2021-05-13 05:20:08] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
[2021-05-13 05:20:08] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2021-05-13 05:20:08] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2021-05-13 05:20:08] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 0 ms to minimize.
[2021-05-13 05:20:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 16 trap constraints in 852 ms
[2021-05-13 05:20:08] [INFO ] [Real]Absence check using 50 positive place invariants in 9 ms returned sat
[2021-05-13 05:20:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 05:20:08] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2021-05-13 05:20:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 05:20:08] [INFO ] [Nat]Absence check using 50 positive place invariants in 16 ms returned sat
[2021-05-13 05:20:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 05:20:08] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2021-05-13 05:20:08] [INFO ] [Nat]Added 84 Read/Feed constraints in 10 ms returned sat
[2021-05-13 05:20:08] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 1 ms to minimize.
[2021-05-13 05:20:08] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 0 ms to minimize.
[2021-05-13 05:20:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 156 ms
[2021-05-13 05:20:08] [INFO ] Computed and/alt/rep : 234/1218/234 causal constraints (skipped 24 transitions) in 20 ms.
[2021-05-13 05:20:09] [INFO ] Added : 74 causal constraints over 16 iterations in 285 ms. Result :sat
Minimization took 105 ms.
[2021-05-13 05:20:09] [INFO ] [Real]Absence check using 50 positive place invariants in 24 ms returned sat
[2021-05-13 05:20:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 05:20:09] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2021-05-13 05:20:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 05:20:09] [INFO ] [Nat]Absence check using 50 positive place invariants in 10 ms returned sat
[2021-05-13 05:20:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 05:20:09] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2021-05-13 05:20:09] [INFO ] [Nat]Added 84 Read/Feed constraints in 12 ms returned sat
[2021-05-13 05:20:09] [INFO ] Deduced a trap composed of 42 places in 53 ms of which 1 ms to minimize.
[2021-05-13 05:20:09] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2021-05-13 05:20:09] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 0 ms to minimize.
[2021-05-13 05:20:09] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2021-05-13 05:20:09] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2021-05-13 05:20:09] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 0 ms to minimize.
[2021-05-13 05:20:09] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2021-05-13 05:20:10] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 0 ms to minimize.
[2021-05-13 05:20:10] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2021-05-13 05:20:10] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2021-05-13 05:20:10] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2021-05-13 05:20:10] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 0 ms to minimize.
[2021-05-13 05:20:10] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2021-05-13 05:20:10] [INFO ] Deduced a trap composed of 8 places in 11 ms of which 1 ms to minimize.
[2021-05-13 05:20:10] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 747 ms
[2021-05-13 05:20:10] [INFO ] Computed and/alt/rep : 234/1218/234 causal constraints (skipped 24 transitions) in 19 ms.
[2021-05-13 05:20:10] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2021-05-13 05:20:10] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2021-05-13 05:20:11] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 5 ms to minimize.
[2021-05-13 05:20:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 294 ms
[2021-05-13 05:20:11] [INFO ] Deduced a trap composed of 9 places in 14 ms of which 1 ms to minimize.
[2021-05-13 05:20:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2021-05-13 05:20:11] [INFO ] Added : 171 causal constraints over 36 iterations in 1110 ms. Result :sat
Minimization took 173 ms.
[2021-05-13 05:20:11] [INFO ] [Real]Absence check using 50 positive place invariants in 10 ms returned sat
[2021-05-13 05:20:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 05:20:11] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2021-05-13 05:20:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 05:20:11] [INFO ] [Nat]Absence check using 50 positive place invariants in 10 ms returned sat
[2021-05-13 05:20:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 05:20:11] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2021-05-13 05:20:11] [INFO ] [Nat]Added 84 Read/Feed constraints in 10 ms returned sat
[2021-05-13 05:20:11] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2021-05-13 05:20:11] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2021-05-13 05:20:11] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
[2021-05-13 05:20:11] [INFO ] Deduced a trap composed of 9 places in 10 ms of which 0 ms to minimize.
[2021-05-13 05:20:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 124 ms
[2021-05-13 05:20:11] [INFO ] Computed and/alt/rep : 234/1218/234 causal constraints (skipped 24 transitions) in 19 ms.
[2021-05-13 05:20:12] [INFO ] Added : 118 causal constraints over 25 iterations in 380 ms. Result :sat
Minimization took 104 ms.
[2021-05-13 05:20:12] [INFO ] [Real]Absence check using 50 positive place invariants in 9 ms returned sat
[2021-05-13 05:20:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 05:20:12] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2021-05-13 05:20:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 05:20:12] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2021-05-13 05:20:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 05:20:12] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2021-05-13 05:20:12] [INFO ] [Nat]Added 84 Read/Feed constraints in 11 ms returned sat
[2021-05-13 05:20:12] [INFO ] Deduced a trap composed of 42 places in 53 ms of which 1 ms to minimize.
[2021-05-13 05:20:12] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 0 ms to minimize.
[2021-05-13 05:20:12] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 0 ms to minimize.
[2021-05-13 05:20:12] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2021-05-13 05:20:12] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 0 ms to minimize.
[2021-05-13 05:20:12] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 0 ms to minimize.
[2021-05-13 05:20:13] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2021-05-13 05:20:13] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2021-05-13 05:20:13] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2021-05-13 05:20:13] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2021-05-13 05:20:13] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2021-05-13 05:20:13] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 0 ms to minimize.
[2021-05-13 05:20:13] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2021-05-13 05:20:13] [INFO ] Deduced a trap composed of 8 places in 14 ms of which 0 ms to minimize.
[2021-05-13 05:20:13] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 725 ms
[2021-05-13 05:20:13] [INFO ] Computed and/alt/rep : 234/1218/234 causal constraints (skipped 24 transitions) in 17 ms.
[2021-05-13 05:20:13] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2021-05-13 05:20:14] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2021-05-13 05:20:14] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 20 ms to minimize.
[2021-05-13 05:20:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 289 ms
[2021-05-13 05:20:14] [INFO ] Deduced a trap composed of 9 places in 15 ms of which 1 ms to minimize.
[2021-05-13 05:20:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2021-05-13 05:20:14] [INFO ] Added : 171 causal constraints over 36 iterations in 1090 ms. Result :sat
Minimization took 171 ms.
Current structural bounds on expressions (after SMT) : [5, 6, 36, 6, 36] Max seen :[5, 1, 24, 4, 24]
FORMULA LamportFastMutEx-PT-6-UpperBounds-01 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 29400 steps, including 848 resets, run finished after 163 ms. (steps per millisecond=180 ) properties (out of 4) seen :48 could not realise parikh vector
Incomplete Parikh walk after 39300 steps, including 884 resets, run finished after 173 ms. (steps per millisecond=227 ) properties (out of 4) seen :47 could not realise parikh vector
Incomplete Parikh walk after 29400 steps, including 832 resets, run finished after 142 ms. (steps per millisecond=207 ) properties (out of 4) seen :48 could not realise parikh vector
Incomplete Parikh walk after 41800 steps, including 1000 resets, run finished after 173 ms. (steps per millisecond=241 ) properties (out of 4) seen :37 could not realise parikh vector
Support contains 48 out of 176 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 176/176 places, 354/354 transitions.
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 176 transition count 348
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 170 transition count 348
Applied a total of 12 rules in 45 ms. Remains 170 /176 variables (removed 6) and now considering 348/354 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 170/176 places, 348/354 transitions.
Normalized transition count is 258 out of 348 initially.
// Phase 1: matrix 258 rows 170 cols
[2021-05-13 05:20:15] [INFO ] Computed 50 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4086 ms. (steps per millisecond=244 ) properties (out of 4) seen :62
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1076 ms. (steps per millisecond=929 ) properties (out of 4) seen :50
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1426 ms. (steps per millisecond=701 ) properties (out of 4) seen :65
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1037 ms. (steps per millisecond=964 ) properties (out of 4) seen :14
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1486 ms. (steps per millisecond=672 ) properties (out of 4) seen :65
[2021-05-13 05:20:24] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
// Phase 1: matrix 258 rows 170 cols
[2021-05-13 05:20:24] [INFO ] Computed 50 place invariants in 2 ms
[2021-05-13 05:20:24] [INFO ] [Real]Absence check using 50 positive place invariants in 9 ms returned sat
[2021-05-13 05:20:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 05:20:24] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2021-05-13 05:20:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 05:20:24] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2021-05-13 05:20:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 05:20:24] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2021-05-13 05:20:24] [INFO ] State equation strengthened by 84 read => feed constraints.
[2021-05-13 05:20:24] [INFO ] [Nat]Added 84 Read/Feed constraints in 9 ms returned sat
[2021-05-13 05:20:24] [INFO ] Computed and/alt/rep : 222/1134/222 causal constraints (skipped 30 transitions) in 19 ms.
[2021-05-13 05:20:24] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 0 ms to minimize.
[2021-05-13 05:20:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2021-05-13 05:20:25] [INFO ] Added : 73 causal constraints over 15 iterations in 328 ms. Result :sat
Minimization took 112 ms.
[2021-05-13 05:20:25] [INFO ] [Real]Absence check using 50 positive place invariants in 9 ms returned sat
[2021-05-13 05:20:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 05:20:25] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2021-05-13 05:20:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 05:20:25] [INFO ] [Nat]Absence check using 50 positive place invariants in 10 ms returned sat
[2021-05-13 05:20:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 05:20:25] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2021-05-13 05:20:25] [INFO ] [Nat]Added 84 Read/Feed constraints in 13 ms returned sat
[2021-05-13 05:20:25] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 0 ms to minimize.
[2021-05-13 05:20:25] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 0 ms to minimize.
[2021-05-13 05:20:25] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2021-05-13 05:20:25] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2021-05-13 05:20:25] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2021-05-13 05:20:25] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2021-05-13 05:20:25] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2021-05-13 05:20:25] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 9 ms to minimize.
[2021-05-13 05:20:25] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 2 ms to minimize.
[2021-05-13 05:20:25] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2021-05-13 05:20:26] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2021-05-13 05:20:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 11 trap constraints in 699 ms
[2021-05-13 05:20:26] [INFO ] [Real]Absence check using 50 positive place invariants in 9 ms returned sat
[2021-05-13 05:20:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 05:20:26] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2021-05-13 05:20:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 05:20:26] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2021-05-13 05:20:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 05:20:26] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2021-05-13 05:20:26] [INFO ] [Nat]Added 84 Read/Feed constraints in 9 ms returned sat
[2021-05-13 05:20:26] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 0 ms to minimize.
[2021-05-13 05:20:26] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 0 ms to minimize.
[2021-05-13 05:20:26] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 0 ms to minimize.
[2021-05-13 05:20:26] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 0 ms to minimize.
[2021-05-13 05:20:26] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 0 ms to minimize.
[2021-05-13 05:20:26] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 427 ms
[2021-05-13 05:20:26] [INFO ] Computed and/alt/rep : 222/1134/222 causal constraints (skipped 30 transitions) in 33 ms.
[2021-05-13 05:20:27] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2021-05-13 05:20:27] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 0 ms to minimize.
[2021-05-13 05:20:27] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2021-05-13 05:20:27] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 1 ms to minimize.
[2021-05-13 05:20:27] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 1 ms to minimize.
[2021-05-13 05:20:27] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 504 ms
[2021-05-13 05:20:27] [INFO ] Added : 192 causal constraints over 40 iterations in 1162 ms. Result :sat
Minimization took 105 ms.
[2021-05-13 05:20:28] [INFO ] [Real]Absence check using 50 positive place invariants in 10 ms returned sat
[2021-05-13 05:20:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 05:20:28] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2021-05-13 05:20:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 05:20:28] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2021-05-13 05:20:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 05:20:28] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2021-05-13 05:20:28] [INFO ] [Nat]Added 84 Read/Feed constraints in 13 ms returned sat
[2021-05-13 05:20:28] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 0 ms to minimize.
[2021-05-13 05:20:28] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2021-05-13 05:20:28] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2021-05-13 05:20:28] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2021-05-13 05:20:28] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 0 ms to minimize.
[2021-05-13 05:20:28] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2021-05-13 05:20:28] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2021-05-13 05:20:28] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2021-05-13 05:20:28] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2021-05-13 05:20:28] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 0 ms to minimize.
[2021-05-13 05:20:28] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2021-05-13 05:20:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 11 trap constraints in 696 ms
Current structural bounds on expressions (after SMT) : [6, 30, 6, 30] Max seen :[1, 30, 5, 30]
FORMULA LamportFastMutEx-PT-6-UpperBounds-07 30 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-6-UpperBounds-04 30 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 70300 steps, including 1000 resets, run finished after 223 ms. (steps per millisecond=315 ) properties (out of 2) seen :6 could not realise parikh vector
Incomplete Parikh walk after 80300 steps, including 1000 resets, run finished after 245 ms. (steps per millisecond=327 ) properties (out of 2) seen :5 could not realise parikh vector
Support contains 12 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 348/348 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 164 transition count 342
Applied a total of 12 rules in 24 ms. Remains 164 /170 variables (removed 6) and now considering 342/348 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 164/170 places, 342/348 transitions.
Normalized transition count is 252 out of 342 initially.
// Phase 1: matrix 252 rows 164 cols
[2021-05-13 05:20:29] [INFO ] Computed 50 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3160 ms. (steps per millisecond=316 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 844 ms. (steps per millisecond=1184 ) properties (out of 2) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 820 ms. (steps per millisecond=1219 ) properties (out of 2) seen :2
[2021-05-13 05:20:34] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 164 cols
[2021-05-13 05:20:34] [INFO ] Computed 50 place invariants in 5 ms
[2021-05-13 05:20:34] [INFO ] [Real]Absence check using 50 positive place invariants in 9 ms returned sat
[2021-05-13 05:20:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 05:20:34] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2021-05-13 05:20:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 05:20:34] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2021-05-13 05:20:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 05:20:34] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2021-05-13 05:20:34] [INFO ] State equation strengthened by 84 read => feed constraints.
[2021-05-13 05:20:34] [INFO ] [Nat]Added 84 Read/Feed constraints in 9 ms returned sat
[2021-05-13 05:20:34] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
[2021-05-13 05:20:34] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2021-05-13 05:20:34] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2021-05-13 05:20:34] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
[2021-05-13 05:20:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 242 ms
[2021-05-13 05:20:34] [INFO ] Computed and/alt/rep : 216/1194/216 causal constraints (skipped 30 transitions) in 19 ms.
[2021-05-13 05:20:34] [INFO ] Added : 61 causal constraints over 13 iterations in 220 ms. Result :sat
Minimization took 84 ms.
[2021-05-13 05:20:35] [INFO ] [Real]Absence check using 50 positive place invariants in 9 ms returned sat
[2021-05-13 05:20:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 05:20:35] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2021-05-13 05:20:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 05:20:35] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2021-05-13 05:20:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 05:20:35] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2021-05-13 05:20:35] [INFO ] [Nat]Added 84 Read/Feed constraints in 9 ms returned sat
[2021-05-13 05:20:35] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2021-05-13 05:20:35] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2021-05-13 05:20:35] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2021-05-13 05:20:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 130 ms
[2021-05-13 05:20:35] [INFO ] Computed and/alt/rep : 216/1194/216 causal constraints (skipped 30 transitions) in 18 ms.
[2021-05-13 05:20:36] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 0 ms to minimize.
[2021-05-13 05:20:36] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 0 ms to minimize.
[2021-05-13 05:20:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 202 ms
[2021-05-13 05:20:36] [INFO ] Added : 168 causal constraints over 34 iterations in 775 ms. Result :sat
Minimization took 87 ms.
Current structural bounds on expressions (after SMT) : [6, 6] Max seen :[1, 5]
Incomplete Parikh walk after 40100 steps, including 940 resets, run finished after 135 ms. (steps per millisecond=297 ) properties (out of 2) seen :6 could not realise parikh vector
Incomplete Parikh walk after 32000 steps, including 884 resets, run finished after 105 ms. (steps per millisecond=304 ) properties (out of 2) seen :5 could not realise parikh vector
Support contains 12 out of 164 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 164/164 places, 342/342 transitions.
Applied a total of 0 rules in 11 ms. Remains 164 /164 variables (removed 0) and now considering 342/342 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 164/164 places, 342/342 transitions.
Starting structural reductions, iteration 0 : 164/164 places, 342/342 transitions.
Applied a total of 0 rules in 11 ms. Remains 164 /164 variables (removed 0) and now considering 342/342 (removed 0) transitions.
[2021-05-13 05:20:36] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 164 cols
[2021-05-13 05:20:36] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-13 05:20:36] [INFO ] Implicit Places using invariants in 160 ms returned [104, 105, 106, 107, 108, 109]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 171 ms to find 6 implicit places.
[2021-05-13 05:20:36] [INFO ] Redundant transitions in 19 ms returned []
[2021-05-13 05:20:36] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 158 cols
[2021-05-13 05:20:36] [INFO ] Computed 44 place invariants in 2 ms
[2021-05-13 05:20:36] [INFO ] Dead Transitions using invariants and state equation in 148 ms returned []
Starting structural reductions, iteration 1 : 158/164 places, 342/342 transitions.
Applied a total of 0 rules in 9 ms. Remains 158 /158 variables (removed 0) and now considering 342/342 (removed 0) transitions.
[2021-05-13 05:20:36] [INFO ] Redundant transitions in 5 ms returned []
[2021-05-13 05:20:36] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 158 cols
[2021-05-13 05:20:36] [INFO ] Computed 44 place invariants in 1 ms
[2021-05-13 05:20:37] [INFO ] Dead Transitions using invariants and state equation in 191 ms returned []
Finished structural reductions, in 2 iterations. Remains : 158/164 places, 342/342 transitions.
Normalized transition count is 252 out of 342 initially.
// Phase 1: matrix 252 rows 158 cols
[2021-05-13 05:20:37] [INFO ] Computed 44 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2908 ms. (steps per millisecond=343 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 814 ms. (steps per millisecond=1228 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 812 ms. (steps per millisecond=1231 ) properties (out of 2) seen :2
[2021-05-13 05:20:41] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 158 cols
[2021-05-13 05:20:41] [INFO ] Computed 44 place invariants in 1 ms
[2021-05-13 05:20:41] [INFO ] [Real]Absence check using 44 positive place invariants in 21 ms returned sat
[2021-05-13 05:20:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 05:20:41] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2021-05-13 05:20:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 05:20:41] [INFO ] [Nat]Absence check using 44 positive place invariants in 8 ms returned sat
[2021-05-13 05:20:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 05:20:41] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2021-05-13 05:20:41] [INFO ] State equation strengthened by 48 read => feed constraints.
[2021-05-13 05:20:41] [INFO ] [Nat]Added 48 Read/Feed constraints in 7 ms returned sat
[2021-05-13 05:20:41] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 0 ms to minimize.
[2021-05-13 05:20:42] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
[2021-05-13 05:20:42] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 0 ms to minimize.
[2021-05-13 05:20:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 224 ms
[2021-05-13 05:20:42] [INFO ] Computed and/alt/rep : 216/1122/216 causal constraints (skipped 30 transitions) in 18 ms.
[2021-05-13 05:20:42] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 0 ms to minimize.
[2021-05-13 05:20:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2021-05-13 05:20:42] [INFO ] Added : 90 causal constraints over 18 iterations in 356 ms. Result :sat
Minimization took 110 ms.
[2021-05-13 05:20:42] [INFO ] [Real]Absence check using 44 positive place invariants in 8 ms returned sat
[2021-05-13 05:20:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 05:20:42] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2021-05-13 05:20:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 05:20:42] [INFO ] [Nat]Absence check using 44 positive place invariants in 9 ms returned sat
[2021-05-13 05:20:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 05:20:42] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2021-05-13 05:20:42] [INFO ] [Nat]Added 48 Read/Feed constraints in 7 ms returned sat
[2021-05-13 05:20:42] [INFO ] Computed and/alt/rep : 216/1122/216 causal constraints (skipped 30 transitions) in 18 ms.
[2021-05-13 05:20:43] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
[2021-05-13 05:20:43] [INFO ] Deduced a trap composed of 7 places in 12 ms of which 0 ms to minimize.
[2021-05-13 05:20:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 83 ms
[2021-05-13 05:20:43] [INFO ] Added : 164 causal constraints over 33 iterations in 654 ms. Result :sat
Minimization took 88 ms.
Current structural bounds on expressions (after SMT) : [6, 6] Max seen :[1, 5]
Incomplete Parikh walk after 74100 steps, including 1000 resets, run finished after 235 ms. (steps per millisecond=315 ) properties (out of 2) seen :5 could not realise parikh vector
Incomplete Parikh walk after 41100 steps, including 993 resets, run finished after 132 ms. (steps per millisecond=311 ) properties (out of 2) seen :6 could not realise parikh vector
Support contains 12 out of 158 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 158/158 places, 342/342 transitions.
Applied a total of 0 rules in 9 ms. Remains 158 /158 variables (removed 0) and now considering 342/342 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 158/158 places, 342/342 transitions.
Starting structural reductions, iteration 0 : 158/158 places, 342/342 transitions.
Applied a total of 0 rules in 8 ms. Remains 158 /158 variables (removed 0) and now considering 342/342 (removed 0) transitions.
[2021-05-13 05:20:43] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 158 cols
[2021-05-13 05:20:43] [INFO ] Computed 44 place invariants in 1 ms
[2021-05-13 05:20:44] [INFO ] Implicit Places using invariants in 117 ms returned []
[2021-05-13 05:20:44] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 158 cols
[2021-05-13 05:20:44] [INFO ] Computed 44 place invariants in 1 ms
[2021-05-13 05:20:44] [INFO ] State equation strengthened by 48 read => feed constraints.
[2021-05-13 05:20:44] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
[2021-05-13 05:20:44] [INFO ] Redundant transitions in 5 ms returned []
[2021-05-13 05:20:44] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 158 cols
[2021-05-13 05:20:44] [INFO ] Computed 44 place invariants in 1 ms
[2021-05-13 05:20:44] [INFO ] Dead Transitions using invariants and state equation in 131 ms returned []
Finished structural reductions, in 1 iterations. Remains : 158/158 places, 342/342 transitions.
Starting property specific reduction for LamportFastMutEx-PT-6-UpperBounds-02
Normalized transition count is 252 out of 342 initially.
// Phase 1: matrix 252 rows 158 cols
[2021-05-13 05:20:44] [INFO ] Computed 44 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :1
[2021-05-13 05:20:44] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 158 cols
[2021-05-13 05:20:44] [INFO ] Computed 44 place invariants in 1 ms
[2021-05-13 05:20:44] [INFO ] [Real]Absence check using 44 positive place invariants in 8 ms returned sat
[2021-05-13 05:20:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 05:20:44] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2021-05-13 05:20:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 05:20:44] [INFO ] [Nat]Absence check using 44 positive place invariants in 9 ms returned sat
[2021-05-13 05:20:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 05:20:44] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2021-05-13 05:20:44] [INFO ] State equation strengthened by 48 read => feed constraints.
[2021-05-13 05:20:44] [INFO ] [Nat]Added 48 Read/Feed constraints in 8 ms returned sat
[2021-05-13 05:20:44] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 0 ms to minimize.
[2021-05-13 05:20:44] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2021-05-13 05:20:44] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 0 ms to minimize.
[2021-05-13 05:20:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 185 ms
[2021-05-13 05:20:44] [INFO ] Computed and/alt/rep : 216/1122/216 causal constraints (skipped 30 transitions) in 18 ms.
[2021-05-13 05:20:45] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 0 ms to minimize.
[2021-05-13 05:20:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2021-05-13 05:20:45] [INFO ] Added : 90 causal constraints over 18 iterations in 357 ms. Result :sat
Minimization took 111 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[1]
Incomplete Parikh walk after 41100 steps, including 992 resets, run finished after 131 ms. (steps per millisecond=313 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 6 out of 158 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 158/158 places, 342/342 transitions.
Applied a total of 0 rules in 9 ms. Remains 158 /158 variables (removed 0) and now considering 342/342 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 158/158 places, 342/342 transitions.
Normalized transition count is 252 out of 342 initially.
// Phase 1: matrix 252 rows 158 cols
[2021-05-13 05:20:45] [INFO ] Computed 44 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2856 ms. (steps per millisecond=350 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 814 ms. (steps per millisecond=1228 ) properties (out of 1) seen :1
[2021-05-13 05:20:49] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 158 cols
[2021-05-13 05:20:49] [INFO ] Computed 44 place invariants in 4 ms
[2021-05-13 05:20:49] [INFO ] [Real]Absence check using 44 positive place invariants in 20 ms returned sat
[2021-05-13 05:20:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 05:20:49] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2021-05-13 05:20:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 05:20:49] [INFO ] [Nat]Absence check using 44 positive place invariants in 9 ms returned sat
[2021-05-13 05:20:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 05:20:49] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2021-05-13 05:20:49] [INFO ] State equation strengthened by 48 read => feed constraints.
[2021-05-13 05:20:49] [INFO ] [Nat]Added 48 Read/Feed constraints in 7 ms returned sat
[2021-05-13 05:20:49] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2021-05-13 05:20:49] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2021-05-13 05:20:49] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 0 ms to minimize.
[2021-05-13 05:20:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 230 ms
[2021-05-13 05:20:49] [INFO ] Computed and/alt/rep : 216/1122/216 causal constraints (skipped 30 transitions) in 15 ms.
[2021-05-13 05:20:50] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 0 ms to minimize.
[2021-05-13 05:20:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2021-05-13 05:20:50] [INFO ] Added : 90 causal constraints over 18 iterations in 561 ms. Result :sat
Minimization took 110 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[1]
Incomplete Parikh walk after 41100 steps, including 990 resets, run finished after 128 ms. (steps per millisecond=321 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 6 out of 158 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 158/158 places, 342/342 transitions.
Applied a total of 0 rules in 6 ms. Remains 158 /158 variables (removed 0) and now considering 342/342 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 158/158 places, 342/342 transitions.
Starting structural reductions, iteration 0 : 158/158 places, 342/342 transitions.
Applied a total of 0 rules in 6 ms. Remains 158 /158 variables (removed 0) and now considering 342/342 (removed 0) transitions.
[2021-05-13 05:20:50] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 158 cols
[2021-05-13 05:20:50] [INFO ] Computed 44 place invariants in 1 ms
[2021-05-13 05:20:50] [INFO ] Implicit Places using invariants in 115 ms returned []
[2021-05-13 05:20:50] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 158 cols
[2021-05-13 05:20:50] [INFO ] Computed 44 place invariants in 1 ms
[2021-05-13 05:20:50] [INFO ] State equation strengthened by 48 read => feed constraints.
[2021-05-13 05:20:50] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
[2021-05-13 05:20:50] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-13 05:20:50] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 158 cols
[2021-05-13 05:20:50] [INFO ] Computed 44 place invariants in 1 ms
[2021-05-13 05:20:51] [INFO ] Dead Transitions using invariants and state equation in 160 ms returned []
Finished structural reductions, in 1 iterations. Remains : 158/158 places, 342/342 transitions.
Ending property specific reduction for LamportFastMutEx-PT-6-UpperBounds-02 in 6557 ms.
Starting property specific reduction for LamportFastMutEx-PT-6-UpperBounds-06
Normalized transition count is 252 out of 342 initially.
// Phase 1: matrix 252 rows 158 cols
[2021-05-13 05:20:51] [INFO ] Computed 44 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :1
[2021-05-13 05:20:51] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 158 cols
[2021-05-13 05:20:51] [INFO ] Computed 44 place invariants in 1 ms
[2021-05-13 05:20:51] [INFO ] [Real]Absence check using 44 positive place invariants in 8 ms returned sat
[2021-05-13 05:20:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 05:20:51] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2021-05-13 05:20:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 05:20:51] [INFO ] [Nat]Absence check using 44 positive place invariants in 9 ms returned sat
[2021-05-13 05:20:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 05:20:51] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2021-05-13 05:20:51] [INFO ] State equation strengthened by 48 read => feed constraints.
[2021-05-13 05:20:51] [INFO ] [Nat]Added 48 Read/Feed constraints in 7 ms returned sat
[2021-05-13 05:20:51] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 0 ms to minimize.
[2021-05-13 05:20:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2021-05-13 05:20:51] [INFO ] Computed and/alt/rep : 216/1122/216 causal constraints (skipped 30 transitions) in 17 ms.
[2021-05-13 05:20:51] [INFO ] Added : 67 causal constraints over 14 iterations in 235 ms. Result :sat
Minimization took 119 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[3]
Incomplete Parikh walk after 32800 steps, including 992 resets, run finished after 99 ms. (steps per millisecond=331 ) properties (out of 1) seen :4 could not realise parikh vector
Support contains 6 out of 158 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 158/158 places, 342/342 transitions.
Applied a total of 0 rules in 5 ms. Remains 158 /158 variables (removed 0) and now considering 342/342 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 158/158 places, 342/342 transitions.
Normalized transition count is 252 out of 342 initially.
// Phase 1: matrix 252 rows 158 cols
[2021-05-13 05:20:51] [INFO ] Computed 44 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2862 ms. (steps per millisecond=349 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 817 ms. (steps per millisecond=1223 ) properties (out of 1) seen :1
[2021-05-13 05:20:55] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 158 cols
[2021-05-13 05:20:55] [INFO ] Computed 44 place invariants in 1 ms
[2021-05-13 05:20:55] [INFO ] [Real]Absence check using 44 positive place invariants in 7 ms returned sat
[2021-05-13 05:20:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 05:20:55] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2021-05-13 05:20:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 05:20:55] [INFO ] [Nat]Absence check using 44 positive place invariants in 8 ms returned sat
[2021-05-13 05:20:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 05:20:55] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2021-05-13 05:20:55] [INFO ] State equation strengthened by 48 read => feed constraints.
[2021-05-13 05:20:55] [INFO ] [Nat]Added 48 Read/Feed constraints in 7 ms returned sat
[2021-05-13 05:20:55] [INFO ] Computed and/alt/rep : 216/1122/216 causal constraints (skipped 30 transitions) in 20 ms.
[2021-05-13 05:20:56] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 1 ms to minimize.
[2021-05-13 05:20:56] [INFO ] Deduced a trap composed of 7 places in 10 ms of which 1 ms to minimize.
[2021-05-13 05:20:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 75 ms
[2021-05-13 05:20:56] [INFO ] Added : 164 causal constraints over 33 iterations in 648 ms. Result :sat
Minimization took 87 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[5]
Incomplete Parikh walk after 74100 steps, including 1000 resets, run finished after 229 ms. (steps per millisecond=323 ) properties (out of 1) seen :4 could not realise parikh vector
Support contains 6 out of 158 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 158/158 places, 342/342 transitions.
Applied a total of 0 rules in 6 ms. Remains 158 /158 variables (removed 0) and now considering 342/342 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 158/158 places, 342/342 transitions.
Starting structural reductions, iteration 0 : 158/158 places, 342/342 transitions.
Applied a total of 0 rules in 6 ms. Remains 158 /158 variables (removed 0) and now considering 342/342 (removed 0) transitions.
[2021-05-13 05:20:56] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 158 cols
[2021-05-13 05:20:56] [INFO ] Computed 44 place invariants in 1 ms
[2021-05-13 05:20:56] [INFO ] Implicit Places using invariants in 107 ms returned []
[2021-05-13 05:20:56] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 158 cols
[2021-05-13 05:20:56] [INFO ] Computed 44 place invariants in 1 ms
[2021-05-13 05:20:56] [INFO ] State equation strengthened by 48 read => feed constraints.
[2021-05-13 05:20:57] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
[2021-05-13 05:20:57] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-13 05:20:57] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 158 cols
[2021-05-13 05:20:57] [INFO ] Computed 44 place invariants in 1 ms
[2021-05-13 05:20:57] [INFO ] Dead Transitions using invariants and state equation in 130 ms returned []
Finished structural reductions, in 1 iterations. Remains : 158/158 places, 342/342 transitions.
Normalized transition count is 252 out of 342 initially.
// Phase 1: matrix 252 rows 158 cols
[2021-05-13 05:20:57] [INFO ] Computed 44 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2845 ms. (steps per millisecond=351 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 816 ms. (steps per millisecond=1225 ) properties (out of 1) seen :1
[2021-05-13 05:21:00] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 158 cols
[2021-05-13 05:21:00] [INFO ] Computed 44 place invariants in 1 ms
[2021-05-13 05:21:00] [INFO ] [Real]Absence check using 44 positive place invariants in 8 ms returned sat
[2021-05-13 05:21:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 05:21:00] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2021-05-13 05:21:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 05:21:00] [INFO ] [Nat]Absence check using 44 positive place invariants in 8 ms returned sat
[2021-05-13 05:21:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 05:21:01] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2021-05-13 05:21:01] [INFO ] State equation strengthened by 48 read => feed constraints.
[2021-05-13 05:21:01] [INFO ] [Nat]Added 48 Read/Feed constraints in 7 ms returned sat
[2021-05-13 05:21:01] [INFO ] Computed and/alt/rep : 216/1122/216 causal constraints (skipped 30 transitions) in 17 ms.
[2021-05-13 05:21:01] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
[2021-05-13 05:21:01] [INFO ] Deduced a trap composed of 7 places in 10 ms of which 0 ms to minimize.
[2021-05-13 05:21:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 99 ms
[2021-05-13 05:21:01] [INFO ] Added : 164 causal constraints over 33 iterations in 657 ms. Result :sat
Minimization took 86 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[5]
Incomplete Parikh walk after 74100 steps, including 1000 resets, run finished after 222 ms. (steps per millisecond=333 ) properties (out of 1) seen :5 could not realise parikh vector
Support contains 6 out of 158 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 158/158 places, 342/342 transitions.
Applied a total of 0 rules in 5 ms. Remains 158 /158 variables (removed 0) and now considering 342/342 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 158/158 places, 342/342 transitions.
Starting structural reductions, iteration 0 : 158/158 places, 342/342 transitions.
Applied a total of 0 rules in 6 ms. Remains 158 /158 variables (removed 0) and now considering 342/342 (removed 0) transitions.
[2021-05-13 05:21:02] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 158 cols
[2021-05-13 05:21:02] [INFO ] Computed 44 place invariants in 0 ms
[2021-05-13 05:21:02] [INFO ] Implicit Places using invariants in 174 ms returned []
[2021-05-13 05:21:02] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 158 cols
[2021-05-13 05:21:02] [INFO ] Computed 44 place invariants in 2 ms
[2021-05-13 05:21:02] [INFO ] State equation strengthened by 48 read => feed constraints.
[2021-05-13 05:21:02] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
[2021-05-13 05:21:02] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-13 05:21:02] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 158 cols
[2021-05-13 05:21:02] [INFO ] Computed 44 place invariants in 1 ms
[2021-05-13 05:21:02] [INFO ] Dead Transitions using invariants and state equation in 150 ms returned []
Finished structural reductions, in 1 iterations. Remains : 158/158 places, 342/342 transitions.
Ending property specific reduction for LamportFastMutEx-PT-6-UpperBounds-06 in 11615 ms.
[2021-05-13 05:21:02] [INFO ] Flatten gal took : 91 ms
[2021-05-13 05:21:02] [INFO ] Applying decomposition
[2021-05-13 05:21:02] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph9451102553776285081.txt, -o, /tmp/graph9451102553776285081.bin, -w, /tmp/graph9451102553776285081.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph9451102553776285081.bin, -l, -1, -v, -w, /tmp/graph9451102553776285081.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 05:21:03] [INFO ] Decomposing Gal with order
[2021-05-13 05:21:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 05:21:03] [INFO ] Removed a total of 494 redundant transitions.
[2021-05-13 05:21:03] [INFO ] Flatten gal took : 63 ms
[2021-05-13 05:21:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 12 ms.
[2021-05-13 05:21:03] [INFO ] Time to serialize gal into /tmp/UpperBounds17234119558721990687.gal : 6 ms
[2021-05-13 05:21:03] [INFO ] Time to serialize properties into /tmp/UpperBounds13779562817495023615.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds17234119558721990687.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds13779562817495023615.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds17234119558721990687.gal -t CGAL -reachable-file /tmp/UpperBounds13779562817495023615.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds13779562817495023615.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flatf,4.76379e+11,112.528,2120008,2,283576,5,7.4732e+06,6,0,1014,8.70879e+06,0
Total reachable state count : 476378803240
Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property LamportFastMutEx-PT-6-UpperBounds-02 :0 <= gi9.gu21.P_CS_21_1+gi10.gu22.P_CS_21_2+gi9.gu19.P_CS_21_3+gi6.gu20.P_CS_21_4+gi7.gu23.P_CS_21_5+gi8.gu24.P_CS_21_6 <= 1
FORMULA LamportFastMutEx-PT-6-UpperBounds-02 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
LamportFastMutEx-PT-6-UpperBounds-02,0,112.803,2120008,1,0,7,7.4732e+06,9,1,1396,8.70879e+06,4
Min sum of variable value : 0
Maximum sum along a path : 6
Bounds property LamportFastMutEx-PT-6-UpperBounds-06 :0 <= gi9.gu12.P_ifxi_10_1+gu7.P_ifxi_10_2+gi9.gu8.P_ifxi_10_3+gu9.P_ifxi_10_4+gu10.P_ifxi_10_5+gu11.P_ifxi_10_6 <= 6
FORMULA LamportFastMutEx-PT-6-UpperBounds-06 6 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
LamportFastMutEx-PT-6-UpperBounds-06,0,113.081,2120008,1,0,8,7.4732e+06,10,1,1600,8.70879e+06,5
BK_STOP 1620883377631
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="LamportFastMutEx-PT-6"
export BK_EXAMINATION="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-4028"
echo " Executing tool itstools"
echo " Input is LamportFastMutEx-PT-6, 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 r121-tall-162075407300675"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-PT-6.tgz
mv LamportFastMutEx-PT-6 execution
cd execution
if [ "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 ;