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-162075407300691.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-8, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-tall-162075407300691
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 121K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 636K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 125K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 609K 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 19K Apr 26 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 26 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 22K Apr 26 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 84K Apr 26 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 27 06:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 52K Mar 27 06:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K Mar 25 07:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Mar 25 07:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.7K 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 329K 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-8-UpperBounds-00
FORMULA_NAME LamportFastMutEx-PT-8-UpperBounds-01
FORMULA_NAME LamportFastMutEx-PT-8-UpperBounds-02
FORMULA_NAME LamportFastMutEx-PT-8-UpperBounds-03
FORMULA_NAME LamportFastMutEx-PT-8-UpperBounds-04
FORMULA_NAME LamportFastMutEx-PT-8-UpperBounds-05
FORMULA_NAME LamportFastMutEx-PT-8-UpperBounds-06
FORMULA_NAME LamportFastMutEx-PT-8-UpperBounds-07
FORMULA_NAME LamportFastMutEx-PT-8-UpperBounds-08
FORMULA_NAME LamportFastMutEx-PT-8-UpperBounds-09
FORMULA_NAME LamportFastMutEx-PT-8-UpperBounds-10
FORMULA_NAME LamportFastMutEx-PT-8-UpperBounds-11
FORMULA_NAME LamportFastMutEx-PT-8-UpperBounds-12
FORMULA_NAME LamportFastMutEx-PT-8-UpperBounds-13
FORMULA_NAME LamportFastMutEx-PT-8-UpperBounds-14
FORMULA_NAME LamportFastMutEx-PT-8-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1620887132127

Running Version 0
[2021-05-13 06:25:47] [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 06:25:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 06:25:47] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2021-05-13 06:25:47] [INFO ] Transformed 315 places.
[2021-05-13 06:25:47] [INFO ] Transformed 666 transitions.
[2021-05-13 06:25:47] [INFO ] Found NUPN structural information;
[2021-05-13 06:25:47] [INFO ] Completing missing partition info from NUPN : creating a component with [P_start_1_0, P_start_1_1, P_start_1_2, P_start_1_3, P_start_1_4, P_start_1_5, P_start_1_6, P_start_1_7, P_start_1_8, P_b_0_false, P_b_0_true, P_b_1_false, P_b_1_true, P_b_2_false, P_b_2_true, P_b_3_false, P_b_3_true, P_b_4_false, P_b_4_true, P_b_5_false, P_b_5_true, P_b_6_false, P_b_6_true, P_b_7_false, P_b_7_true, P_b_8_false, P_b_8_true, P_setx_3_0, P_setx_3_1, P_setx_3_2, P_setx_3_3, P_setx_3_4, P_setx_3_5, P_setx_3_6, P_setx_3_7, P_setx_3_8, P_setbi_5_0, P_setbi_5_1, P_setbi_5_2, P_setbi_5_3, P_setbi_5_4, P_setbi_5_5, P_setbi_5_6, P_setbi_5_7, P_setbi_5_8, P_ify0_4_0, P_ify0_4_1, P_ify0_4_2, P_ify0_4_3, P_ify0_4_4, P_ify0_4_5, P_ify0_4_6, P_ify0_4_7, P_ify0_4_8, P_sety_9_0, P_sety_9_1, P_sety_9_2, P_sety_9_3, P_sety_9_4, P_sety_9_5, P_sety_9_6, P_sety_9_7, P_sety_9_8, P_ifxi_10_0, P_ifxi_10_1, P_ifxi_10_2, P_ifxi_10_3, P_ifxi_10_4, P_ifxi_10_5, P_ifxi_10_6, P_ifxi_10_7, P_ifxi_10_8, P_setbi_11_0, P_setbi_11_1, P_setbi_11_2, P_setbi_11_3, P_setbi_11_4, P_setbi_11_5, P_setbi_11_6, P_setbi_11_7, P_setbi_11_8, P_fordo_12_0, P_fordo_12_1, P_fordo_12_2, P_fordo_12_3, P_fordo_12_4, P_fordo_12_5, P_fordo_12_6, P_fordo_12_7, P_fordo_12_8, P_wait_0_0, P_wait_0_1, P_wait_0_2, P_wait_0_3, P_wait_0_4, P_wait_0_5, P_wait_0_6, P_wait_0_7, P_wait_0_8, P_wait_1_0, P_wait_1_1, P_wait_1_2, P_wait_1_3, P_wait_1_4, P_wait_1_5, P_wait_1_6, P_wait_1_7, P_wait_1_8, P_wait_2_0, P_wait_2_1, P_wait_2_2, P_wait_2_3, P_wait_2_4, P_wait_2_5, P_wait_2_6, P_wait_2_7, P_wait_2_8, P_wait_3_0, P_wait_3_1, P_wait_3_2, P_wait_3_3, P_wait_3_4, P_wait_3_5, P_wait_3_6, P_wait_3_7, P_wait_3_8, P_wait_4_0, P_wait_4_1, P_wait_4_2, P_wait_4_3, P_wait_4_4, P_wait_4_5, P_wait_4_6, P_wait_4_7, P_wait_4_8, P_wait_5_0, P_wait_5_1, P_wait_5_2, P_wait_5_3, P_wait_5_4, P_wait_5_5, P_wait_5_6, P_wait_5_7, P_wait_5_8, P_wait_6_0, P_wait_6_1, P_wait_6_2, P_wait_6_3, P_wait_6_4, P_wait_6_5, P_wait_6_6, P_wait_6_7, P_wait_6_8, P_wait_7_0, P_wait_7_1, P_wait_7_2, P_wait_7_3, P_wait_7_4, P_wait_7_5, P_wait_7_6, P_wait_7_7, P_wait_7_8, P_wait_8_0, P_wait_8_1, P_wait_8_2, P_wait_8_3, P_wait_8_4, P_wait_8_5, P_wait_8_6, P_wait_8_7, P_wait_8_8, P_await_13_0, P_await_13_1, P_await_13_2, P_await_13_3, P_await_13_4, P_await_13_5, P_await_13_6, P_await_13_7, P_await_13_8, P_done_0_0, P_done_0_1, P_done_0_2, P_done_0_3, P_done_0_4, P_done_0_5, P_done_0_6, P_done_0_7, P_done_0_8, P_done_1_0, P_done_1_1, P_done_1_2, P_done_1_3, P_done_1_4, P_done_1_5, P_done_1_6, P_done_1_7, P_done_1_8, P_done_2_0, P_done_2_1, P_done_2_2, P_done_2_3, P_done_2_4, P_done_2_5, P_done_2_6, P_done_2_7, P_done_2_8, P_done_3_0, P_done_3_1, P_done_3_2, P_done_3_3, P_done_3_4, P_done_3_5, P_done_3_6, P_done_3_7, P_done_3_8, P_done_4_0, P_done_4_1, P_done_4_2, P_done_4_3, P_done_4_4, P_done_4_5, P_done_4_6, P_done_4_7, P_done_4_8, P_done_5_0, P_done_5_1, P_done_5_2, P_done_5_3, P_done_5_4, P_done_5_5, P_done_5_6, P_done_5_7, P_done_5_8, P_done_6_0, P_done_6_1, P_done_6_2, P_done_6_3, P_done_6_4, P_done_6_5, P_done_6_6, P_done_6_7, P_done_6_8, P_done_7_0, P_done_7_1, P_done_7_2, P_done_7_3, P_done_7_4, P_done_7_5, P_done_7_6, P_done_7_7, P_done_7_8, P_done_8_0, P_done_8_1, P_done_8_2, P_done_8_3, P_done_8_4, P_done_8_5, P_done_8_6, P_done_8_7, P_done_8_8, P_ifyi_15_0, P_ifyi_15_1, P_ifyi_15_2, P_ifyi_15_3, P_ifyi_15_4, P_ifyi_15_5, P_ifyi_15_6, P_ifyi_15_7, P_ifyi_15_8, P_awaity_0, P_awaity_1, P_awaity_2, P_awaity_3, P_awaity_4, P_awaity_5, P_awaity_6, P_awaity_7, P_awaity_8, P_CS_21_0, P_CS_21_1, P_CS_21_2, P_CS_21_3, P_CS_21_4, P_CS_21_5, P_CS_21_6, P_CS_21_7, P_CS_21_8, P_setbi_24_0, P_setbi_24_1, P_setbi_24_2, P_setbi_24_3, P_setbi_24_4, P_setbi_24_5, P_setbi_24_6, P_setbi_24_7, P_setbi_24_8]
[2021-05-13 06:25:47] [INFO ] Parsed PT model containing 315 places and 666 transitions in 124 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 49 places in 3 ms
Reduce places removed 49 places and 82 transitions.
FORMULA LamportFastMutEx-PT-8-UpperBounds-00 8 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-8-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 416 out of 584 initially.
// Phase 1: matrix 416 rows 266 cols
[2021-05-13 06:25:47] [INFO ] Computed 82 place invariants in 18 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 14) seen :79
FORMULA LamportFastMutEx-PT-8-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-8-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-8-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-8-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-8-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-8-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-8-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :31
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :56
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :58
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :51
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :27
FORMULA LamportFastMutEx-PT-8-UpperBounds-05 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :43
[2021-05-13 06:25:47] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2021-05-13 06:25:47] [INFO ] Computed 82 place invariants in 6 ms
[2021-05-13 06:25:47] [INFO ] [Real]Absence check using 82 positive place invariants in 31 ms returned sat
[2021-05-13 06:25:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 06:25:48] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2021-05-13 06:25:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 06:25:48] [INFO ] [Nat]Absence check using 82 positive place invariants in 42 ms returned sat
[2021-05-13 06:25:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 06:25:48] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2021-05-13 06:25:48] [INFO ] State equation strengthened by 128 read => feed constraints.
[2021-05-13 06:25:48] [INFO ] [Nat]Added 128 Read/Feed constraints in 15 ms returned sat
[2021-05-13 06:25:48] [INFO ] Deduced a trap composed of 17 places in 171 ms of which 3 ms to minimize.
[2021-05-13 06:25:48] [INFO ] Deduced a trap composed of 9 places in 384 ms of which 1 ms to minimize.
[2021-05-13 06:25:49] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 1 ms to minimize.
[2021-05-13 06:25:49] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 1 ms to minimize.
[2021-05-13 06:25:49] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 1 ms to minimize.
[2021-05-13 06:25:49] [INFO ] Deduced a trap composed of 9 places in 245 ms of which 1 ms to minimize.
[2021-05-13 06:25:49] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2021-05-13 06:25:49] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2021-05-13 06:25:49] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2021-05-13 06:25:49] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 0 ms to minimize.
[2021-05-13 06:25:50] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 0 ms to minimize.
[2021-05-13 06:25:50] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2021-05-13 06:25:50] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2021-05-13 06:25:50] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2021-05-13 06:25:50] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2021-05-13 06:25:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 15 trap constraints in 1852 ms
[2021-05-13 06:25:50] [INFO ] [Real]Absence check using 82 positive place invariants in 20 ms returned sat
[2021-05-13 06:25:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 06:25:50] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2021-05-13 06:25:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 06:25:50] [INFO ] [Nat]Absence check using 82 positive place invariants in 17 ms returned sat
[2021-05-13 06:25:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 06:25:50] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2021-05-13 06:25:50] [INFO ] [Nat]Added 128 Read/Feed constraints in 15 ms returned sat
[2021-05-13 06:25:50] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2021-05-13 06:25:50] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2021-05-13 06:25:50] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2021-05-13 06:25:50] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 0 ms to minimize.
[2021-05-13 06:25:50] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2021-05-13 06:25:50] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2021-05-13 06:25:51] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2021-05-13 06:25:51] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 0 ms to minimize.
[2021-05-13 06:25:51] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2021-05-13 06:25:51] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2021-05-13 06:25:51] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2021-05-13 06:25:51] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2021-05-13 06:25:51] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
[2021-05-13 06:25:51] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2021-05-13 06:25:51] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2021-05-13 06:25:51] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2021-05-13 06:25:51] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2021-05-13 06:25:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 17 trap constraints in 1183 ms
[2021-05-13 06:25:51] [INFO ] [Real]Absence check using 82 positive place invariants in 16 ms returned sat
[2021-05-13 06:25:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 06:25:51] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2021-05-13 06:25:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 06:25:51] [INFO ] [Nat]Absence check using 82 positive place invariants in 16 ms returned sat
[2021-05-13 06:25:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 06:25:52] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2021-05-13 06:25:52] [INFO ] [Nat]Added 128 Read/Feed constraints in 14 ms returned sat
[2021-05-13 06:25:52] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 0 ms to minimize.
[2021-05-13 06:25:52] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 0 ms to minimize.
[2021-05-13 06:25:52] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 5 ms to minimize.
[2021-05-13 06:25:52] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2021-05-13 06:25:52] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 0 ms to minimize.
[2021-05-13 06:25:52] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 0 ms to minimize.
[2021-05-13 06:25:52] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2021-05-13 06:25:52] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
[2021-05-13 06:25:52] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2021-05-13 06:25:52] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2021-05-13 06:25:52] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2021-05-13 06:25:52] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2021-05-13 06:25:52] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2021-05-13 06:25:52] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2021-05-13 06:25:52] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2021-05-13 06:25:52] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2021-05-13 06:25:53] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2021-05-13 06:25:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 17 trap constraints in 1006 ms
[2021-05-13 06:25:53] [INFO ] [Real]Absence check using 82 positive place invariants in 15 ms returned sat
[2021-05-13 06:25:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 06:25:53] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2021-05-13 06:25:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 06:25:53] [INFO ] [Nat]Absence check using 82 positive place invariants in 16 ms returned sat
[2021-05-13 06:25:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 06:25:53] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2021-05-13 06:25:53] [INFO ] [Nat]Added 128 Read/Feed constraints in 15 ms returned sat
[2021-05-13 06:25:53] [INFO ] Deduced a trap composed of 52 places in 94 ms of which 1 ms to minimize.
[2021-05-13 06:25:53] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2021-05-13 06:25:53] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 0 ms to minimize.
[2021-05-13 06:25:53] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2021-05-13 06:25:53] [INFO ] Deduced a trap composed of 47 places in 83 ms of which 1 ms to minimize.
[2021-05-13 06:25:53] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 0 ms to minimize.
[2021-05-13 06:25:53] [INFO ] Deduced a trap composed of 47 places in 98 ms of which 7 ms to minimize.
[2021-05-13 06:25:54] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 1 ms to minimize.
[2021-05-13 06:25:54] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 0 ms to minimize.
[2021-05-13 06:25:54] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 858 ms
[2021-05-13 06:25:54] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 33 ms.
[2021-05-13 06:25:54] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 0 ms to minimize.
[2021-05-13 06:25:55] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2021-05-13 06:25:55] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2021-05-13 06:25:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 302 ms
[2021-05-13 06:25:55] [INFO ] Added : 148 causal constraints over 30 iterations in 995 ms. Result :sat
Minimization took 100 ms.
[2021-05-13 06:25:55] [INFO ] [Real]Absence check using 82 positive place invariants in 18 ms returned sat
[2021-05-13 06:25:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 06:25:55] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2021-05-13 06:25:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 06:25:55] [INFO ] [Nat]Absence check using 82 positive place invariants in 19 ms returned sat
[2021-05-13 06:25:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 06:25:55] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2021-05-13 06:25:55] [INFO ] [Nat]Added 128 Read/Feed constraints in 27 ms returned sat
[2021-05-13 06:25:55] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2021-05-13 06:25:55] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2021-05-13 06:25:55] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2021-05-13 06:25:56] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2021-05-13 06:25:56] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 0 ms to minimize.
[2021-05-13 06:25:56] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 2 ms to minimize.
[2021-05-13 06:25:56] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 2 ms to minimize.
[2021-05-13 06:25:56] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2021-05-13 06:25:56] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2021-05-13 06:25:56] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2021-05-13 06:25:56] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 0 ms to minimize.
[2021-05-13 06:25:56] [INFO ] Deduced a trap composed of 48 places in 65 ms of which 0 ms to minimize.
[2021-05-13 06:25:56] [INFO ] Deduced a trap composed of 55 places in 65 ms of which 0 ms to minimize.
[2021-05-13 06:25:56] [INFO ] Deduced a trap composed of 55 places in 67 ms of which 0 ms to minimize.
[2021-05-13 06:25:56] [INFO ] Deduced a trap composed of 58 places in 66 ms of which 1 ms to minimize.
[2021-05-13 06:25:56] [INFO ] Deduced a trap composed of 53 places in 66 ms of which 0 ms to minimize.
[2021-05-13 06:25:57] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2021-05-13 06:25:57] [INFO ] Deduced a trap composed of 47 places in 67 ms of which 1 ms to minimize.
[2021-05-13 06:25:57] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 0 ms to minimize.
[2021-05-13 06:25:57] [INFO ] Deduced a trap composed of 48 places in 76 ms of which 12 ms to minimize.
[2021-05-13 06:25:57] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2021-05-13 06:25:57] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2021-05-13 06:25:57] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 0 ms to minimize.
[2021-05-13 06:25:57] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 0 ms to minimize.
[2021-05-13 06:25:57] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 1 ms to minimize.
[2021-05-13 06:25:57] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 0 ms to minimize.
[2021-05-13 06:25:57] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 1 ms to minimize.
[2021-05-13 06:25:57] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 0 ms to minimize.
[2021-05-13 06:25:57] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2021-05-13 06:26:00] [INFO ] Deduced a trap composed of 2 places in 106 ms of which 1 ms to minimize.
[2021-05-13 06:26:00] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-13 06:26:05] [INFO ] [Real]Absence check using 82 positive place invariants in 17 ms returned sat
[2021-05-13 06:26:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 06:26:05] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2021-05-13 06:26:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 06:26:05] [INFO ] [Nat]Absence check using 82 positive place invariants in 16 ms returned sat
[2021-05-13 06:26:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 06:26:05] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2021-05-13 06:26:05] [INFO ] [Nat]Added 128 Read/Feed constraints in 15 ms returned sat
[2021-05-13 06:26:05] [INFO ] Deduced a trap composed of 52 places in 90 ms of which 1 ms to minimize.
[2021-05-13 06:26:05] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2021-05-13 06:26:05] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 2 ms to minimize.
[2021-05-13 06:26:06] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2021-05-13 06:26:06] [INFO ] Deduced a trap composed of 47 places in 86 ms of which 0 ms to minimize.
[2021-05-13 06:26:06] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 0 ms to minimize.
[2021-05-13 06:26:06] [INFO ] Deduced a trap composed of 47 places in 91 ms of which 1 ms to minimize.
[2021-05-13 06:26:06] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 1 ms to minimize.
[2021-05-13 06:26:06] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 0 ms to minimize.
[2021-05-13 06:26:06] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 914 ms
[2021-05-13 06:26:06] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 30 ms.
[2021-05-13 06:26:07] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 1 ms to minimize.
[2021-05-13 06:26:07] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2021-05-13 06:26:07] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 0 ms to minimize.
[2021-05-13 06:26:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 325 ms
[2021-05-13 06:26:07] [INFO ] Added : 148 causal constraints over 30 iterations in 983 ms. Result :sat
Minimization took 100 ms.
Current structural bounds on expressions (after SMT) : [7, 7, 7, 8, 64, 8] Max seen :[7, 7, 7, 4, 43, 4]
FORMULA LamportFastMutEx-PT-8-UpperBounds-03 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-8-UpperBounds-02 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-8-UpperBounds-01 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 105700 steps, including 1000 resets, run finished after 569 ms. (steps per millisecond=185 ) properties (out of 3) seen :50 could not realise parikh vector
Incomplete Parikh walk after 105700 steps, including 1000 resets, run finished after 498 ms. (steps per millisecond=212 ) properties (out of 3) seen :54 could not realise parikh vector
Support contains 72 out of 266 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 266/266 places, 584/584 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 258 transition count 576
Applied a total of 16 rules in 59 ms. Remains 258 /266 variables (removed 8) and now considering 576/584 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 258/266 places, 576/584 transitions.
Normalized transition count is 408 out of 576 initially.
// Phase 1: matrix 408 rows 258 cols
[2021-05-13 06:26:08] [INFO ] Computed 82 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4496 ms. (steps per millisecond=222 ) properties (out of 3) seen :59
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1074 ms. (steps per millisecond=931 ) properties (out of 3) seen :64
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2284 ms. (steps per millisecond=437 ) properties (out of 3) seen :64
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1024 ms. (steps per millisecond=976 ) properties (out of 3) seen :61
[2021-05-13 06:26:17] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
// Phase 1: matrix 408 rows 258 cols
[2021-05-13 06:26:17] [INFO ] Computed 82 place invariants in 9 ms
[2021-05-13 06:26:17] [INFO ] [Real]Absence check using 82 positive place invariants in 14 ms returned sat
[2021-05-13 06:26:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 06:26:17] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2021-05-13 06:26:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 06:26:17] [INFO ] [Nat]Absence check using 82 positive place invariants in 15 ms returned sat
[2021-05-13 06:26:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 06:26:17] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2021-05-13 06:26:17] [INFO ] State equation strengthened by 128 read => feed constraints.
[2021-05-13 06:26:17] [INFO ] [Nat]Added 128 Read/Feed constraints in 15 ms returned sat
[2021-05-13 06:26:18] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 0 ms to minimize.
[2021-05-13 06:26:18] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 0 ms to minimize.
[2021-05-13 06:26:18] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 1 ms to minimize.
[2021-05-13 06:26:18] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 1 ms to minimize.
[2021-05-13 06:26:18] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2021-05-13 06:26:18] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 0 ms to minimize.
[2021-05-13 06:26:18] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2021-05-13 06:26:18] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 0 ms to minimize.
[2021-05-13 06:26:18] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2021-05-13 06:26:18] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2021-05-13 06:26:18] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2021-05-13 06:26:18] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 0 ms to minimize.
[2021-05-13 06:26:19] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 0 ms to minimize.
[2021-05-13 06:26:19] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 0 ms to minimize.
[2021-05-13 06:26:19] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 0 ms to minimize.
[2021-05-13 06:26:19] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 0 ms to minimize.
[2021-05-13 06:26:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 16 trap constraints in 1305 ms
[2021-05-13 06:26:19] [INFO ] [Real]Absence check using 82 positive place invariants in 16 ms returned sat
[2021-05-13 06:26:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 06:26:19] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2021-05-13 06:26:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 06:26:19] [INFO ] [Nat]Absence check using 82 positive place invariants in 16 ms returned sat
[2021-05-13 06:26:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 06:26:19] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2021-05-13 06:26:22] [INFO ] [Nat]Added 128 Read/Feed constraints in 2450 ms returned sat
[2021-05-13 06:26:22] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 1 ms to minimize.
[2021-05-13 06:26:22] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 0 ms to minimize.
[2021-05-13 06:26:22] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 0 ms to minimize.
[2021-05-13 06:26:22] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 0 ms to minimize.
[2021-05-13 06:26:22] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 0 ms to minimize.
[2021-05-13 06:26:22] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 0 ms to minimize.
[2021-05-13 06:26:22] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2021-05-13 06:26:22] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 0 ms to minimize.
[2021-05-13 06:26:22] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2021-05-13 06:26:22] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2021-05-13 06:26:22] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2021-05-13 06:26:22] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2021-05-13 06:26:22] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2021-05-13 06:26:22] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2021-05-13 06:26:22] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2021-05-13 06:26:22] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2021-05-13 06:26:23] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2021-05-13 06:26:23] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2021-05-13 06:26:23] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2021-05-13 06:26:23] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 0 ms to minimize.
[2021-05-13 06:26:23] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 0 ms to minimize.
[2021-05-13 06:26:23] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2021-05-13 06:26:23] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2021-05-13 06:26:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 23 trap constraints in 1483 ms
[2021-05-13 06:26:23] [INFO ] [Real]Absence check using 82 positive place invariants in 15 ms returned sat
[2021-05-13 06:26:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 06:26:23] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2021-05-13 06:26:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 06:26:23] [INFO ] [Nat]Absence check using 82 positive place invariants in 17 ms returned sat
[2021-05-13 06:26:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 06:26:23] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2021-05-13 06:26:23] [INFO ] [Nat]Added 128 Read/Feed constraints in 18 ms returned sat
[2021-05-13 06:26:23] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 1 ms to minimize.
[2021-05-13 06:26:24] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 1 ms to minimize.
[2021-05-13 06:26:24] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 0 ms to minimize.
[2021-05-13 06:26:24] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 0 ms to minimize.
[2021-05-13 06:26:24] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2021-05-13 06:26:24] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 0 ms to minimize.
[2021-05-13 06:26:24] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 1 ms to minimize.
[2021-05-13 06:26:24] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2021-05-13 06:26:24] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 0 ms to minimize.
[2021-05-13 06:26:24] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 0 ms to minimize.
[2021-05-13 06:26:24] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 0 ms to minimize.
[2021-05-13 06:26:24] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2021-05-13 06:26:24] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2021-05-13 06:26:24] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 0 ms to minimize.
[2021-05-13 06:26:25] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 0 ms to minimize.
[2021-05-13 06:26:25] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 0 ms to minimize.
[2021-05-13 06:26:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 16 trap constraints in 1330 ms
Current structural bounds on expressions (after SMT) : [7, 56, 7] Max seen :[7, 56, 7]
FORMULA LamportFastMutEx-PT-8-UpperBounds-07 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-8-UpperBounds-06 56 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-8-UpperBounds-04 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1620887185986

--------------------
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-8"
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-8, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r121-tall-162075407300691"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-PT-8.tgz
mv LamportFastMutEx-PT-8 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;