Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r143-tall-165271830300154.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is LamportFastMutEx-PT-4, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r143-tall-165271830300154
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 572K
-rw-r--r-- 1 mcc users 13K Apr 29 19:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K Apr 29 19:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 30K Apr 29 19:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 180K Apr 29 19:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.4K May 9 08:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 39K May 9 08:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 9 08:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 33K May 9 08:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.9K May 9 08:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 114K May 10 09:34 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-4-UpperBounds-00
FORMULA_NAME LamportFastMutEx-PT-4-UpperBounds-01
FORMULA_NAME LamportFastMutEx-PT-4-UpperBounds-02
FORMULA_NAME LamportFastMutEx-PT-4-UpperBounds-03
FORMULA_NAME LamportFastMutEx-PT-4-UpperBounds-04
FORMULA_NAME LamportFastMutEx-PT-4-UpperBounds-05
FORMULA_NAME LamportFastMutEx-PT-4-UpperBounds-06
FORMULA_NAME LamportFastMutEx-PT-4-UpperBounds-07
FORMULA_NAME LamportFastMutEx-PT-4-UpperBounds-08
FORMULA_NAME LamportFastMutEx-PT-4-UpperBounds-09
FORMULA_NAME LamportFastMutEx-PT-4-UpperBounds-10
FORMULA_NAME LamportFastMutEx-PT-4-UpperBounds-11
FORMULA_NAME LamportFastMutEx-PT-4-UpperBounds-12
FORMULA_NAME LamportFastMutEx-PT-4-UpperBounds-13
FORMULA_NAME LamportFastMutEx-PT-4-UpperBounds-14
FORMULA_NAME LamportFastMutEx-PT-4-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652742975299

Running Version 0
[2022-05-16 23:16:16] [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]
[2022-05-16 23:16:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 23:16:16] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2022-05-16 23:16:16] [INFO ] Transformed 135 places.
[2022-05-16 23:16:16] [INFO ] Transformed 230 transitions.
[2022-05-16 23:16:16] [INFO ] Found NUPN structural information;
[2022-05-16 23:16:16] [INFO ] Completing missing partition info from NUPN : creating a component with [P_start_1_0, P_start_1_1, P_start_1_2, P_start_1_3, P_start_1_4, P_b_0_false, P_b_0_true, P_b_1_false, P_b_1_true, P_b_2_false, P_b_2_true, P_b_3_false, P_b_3_true, P_b_4_false, P_b_4_true, P_setx_3_0, P_setx_3_1, P_setx_3_2, P_setx_3_3, P_setx_3_4, P_setbi_5_0, P_setbi_5_1, P_setbi_5_2, P_setbi_5_3, P_setbi_5_4, P_ify0_4_0, P_ify0_4_1, P_ify0_4_2, P_ify0_4_3, P_ify0_4_4, P_sety_9_0, P_sety_9_1, P_sety_9_2, P_sety_9_3, P_sety_9_4, P_ifxi_10_0, P_ifxi_10_1, P_ifxi_10_2, P_ifxi_10_3, P_ifxi_10_4, P_setbi_11_0, P_setbi_11_1, P_setbi_11_2, P_setbi_11_3, P_setbi_11_4, P_fordo_12_0, P_fordo_12_1, P_fordo_12_2, P_fordo_12_3, P_fordo_12_4, P_wait_0_0, P_wait_0_1, P_wait_0_2, P_wait_0_3, P_wait_0_4, P_wait_1_0, P_wait_1_1, P_wait_1_2, P_wait_1_3, P_wait_1_4, P_wait_2_0, P_wait_2_1, P_wait_2_2, P_wait_2_3, P_wait_2_4, P_wait_3_0, P_wait_3_1, P_wait_3_2, P_wait_3_3, P_wait_3_4, P_wait_4_0, P_wait_4_1, P_wait_4_2, P_wait_4_3, P_wait_4_4, P_await_13_0, P_await_13_1, P_await_13_2, P_await_13_3, P_await_13_4, P_done_0_0, P_done_0_1, P_done_0_2, P_done_0_3, P_done_0_4, P_done_1_0, P_done_1_1, P_done_1_2, P_done_1_3, P_done_1_4, P_done_2_0, P_done_2_1, P_done_2_2, P_done_2_3, P_done_2_4, P_done_3_0, P_done_3_1, P_done_3_2, P_done_3_3, P_done_3_4, P_done_4_0, P_done_4_1, P_done_4_2, P_done_4_3, P_done_4_4, P_ifyi_15_0, P_ifyi_15_1, P_ifyi_15_2, P_ifyi_15_3, P_ifyi_15_4, P_awaity_0, P_awaity_1, P_awaity_2, P_awaity_3, P_awaity_4, P_CS_21_0, P_CS_21_1, P_CS_21_2, P_CS_21_3, P_CS_21_4, P_setbi_24_0, P_setbi_24_1, P_setbi_24_2, P_setbi_24_3, P_setbi_24_4]
[2022-05-16 23:16:16] [INFO ] Parsed PT model containing 135 places and 230 transitions in 100 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 33 places in 2 ms
Reduce places removed 33 places and 50 transitions.
FORMULA LamportFastMutEx-PT-4-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-4-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-4-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 144 out of 180 initially.
// Phase 1: matrix 144 rows 102 cols
[2022-05-16 23:16:16] [INFO ] Computed 26 place invariants in 19 ms
FORMULA LamportFastMutEx-PT-4-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 12) seen :25
FORMULA LamportFastMutEx-PT-4-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-4-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-4-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-4-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-4-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-4-UpperBounds-03 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-4-UpperBounds-01 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 5) seen :12
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 5) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 5) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 5) seen :12
FORMULA LamportFastMutEx-PT-4-UpperBounds-07 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2022-05-16 23:16:17] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
// Phase 1: matrix 144 rows 102 cols
[2022-05-16 23:16:17] [INFO ] Computed 26 place invariants in 3 ms
[2022-05-16 23:16:17] [INFO ] [Real]Absence check using 26 positive place invariants in 13 ms returned sat
[2022-05-16 23:16:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 23:16:17] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2022-05-16 23:16:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 23:16:17] [INFO ] [Nat]Absence check using 26 positive place invariants in 8 ms returned sat
[2022-05-16 23:16:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 23:16:17] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2022-05-16 23:16:17] [INFO ] State equation strengthened by 48 read => feed constraints.
[2022-05-16 23:16:17] [INFO ] [Nat]Added 48 Read/Feed constraints in 6 ms returned sat
[2022-05-16 23:16:17] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 4 ms to minimize.
[2022-05-16 23:16:17] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2022-05-16 23:16:17] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2022-05-16 23:16:17] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2022-05-16 23:16:17] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2022-05-16 23:16:17] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2022-05-16 23:16:17] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 0 ms to minimize.
[2022-05-16 23:16:17] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 1 ms to minimize.
[2022-05-16 23:16:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 342 ms
[2022-05-16 23:16:17] [INFO ] [Real]Absence check using 26 positive place invariants in 4 ms returned sat
[2022-05-16 23:16:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 23:16:17] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2022-05-16 23:16:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 23:16:17] [INFO ] [Nat]Absence check using 26 positive place invariants in 5 ms returned sat
[2022-05-16 23:16:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 23:16:17] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2022-05-16 23:16:17] [INFO ] [Nat]Added 48 Read/Feed constraints in 5 ms returned sat
[2022-05-16 23:16:17] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2022-05-16 23:16:17] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2022-05-16 23:16:17] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2022-05-16 23:16:18] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2022-05-16 23:16:18] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2022-05-16 23:16:18] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2022-05-16 23:16:18] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2022-05-16 23:16:18] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2022-05-16 23:16:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 265 ms
[2022-05-16 23:16:18] [INFO ] [Real]Absence check using 26 positive place invariants in 5 ms returned sat
[2022-05-16 23:16:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 23:16:18] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2022-05-16 23:16:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 23:16:18] [INFO ] [Nat]Absence check using 26 positive place invariants in 5 ms returned sat
[2022-05-16 23:16:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 23:16:18] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2022-05-16 23:16:18] [INFO ] [Nat]Added 48 Read/Feed constraints in 6 ms returned sat
[2022-05-16 23:16:18] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2022-05-16 23:16:18] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2022-05-16 23:16:18] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2022-05-16 23:16:18] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2022-05-16 23:16:18] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2022-05-16 23:16:18] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2022-05-16 23:16:18] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2022-05-16 23:16:18] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2022-05-16 23:16:18] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2022-05-16 23:16:18] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2022-05-16 23:16:18] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2022-05-16 23:16:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 11 trap constraints in 433 ms
[2022-05-16 23:16:18] [INFO ] [Real]Absence check using 26 positive place invariants in 9 ms returned sat
[2022-05-16 23:16:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 23:16:18] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-05-16 23:16:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 23:16:18] [INFO ] [Nat]Absence check using 26 positive place invariants in 5 ms returned sat
[2022-05-16 23:16:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 23:16:18] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2022-05-16 23:16:18] [INFO ] [Nat]Added 48 Read/Feed constraints in 4 ms returned sat
[2022-05-16 23:16:18] [INFO ] Computed and/alt/rep : 128/512/128 causal constraints (skipped 12 transitions) in 12 ms.
[2022-05-16 23:16:19] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2022-05-16 23:16:19] [INFO ] Deduced a trap composed of 9 places in 11 ms of which 0 ms to minimize.
[2022-05-16 23:16:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 77 ms
[2022-05-16 23:16:19] [INFO ] Added : 70 causal constraints over 15 iterations in 276 ms. Result :sat
Minimization took 48 ms.
Current structural bounds on expressions (after SMT) : [3, 3, 3, 4] Max seen :[3, 3, 3, 1]
FORMULA LamportFastMutEx-PT-4-UpperBounds-05 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-4-UpperBounds-04 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-4-UpperBounds-02 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 29400 steps, including 901 resets, run finished after 74 ms. (steps per millisecond=397 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 4 out of 102 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 102/102 places, 180/180 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 98 transition count 176
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 12 place count 98 transition count 172
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 16 place count 94 transition count 172
Applied a total of 16 rules in 29 ms. Remains 94 /102 variables (removed 8) and now considering 172/180 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 94/102 places, 172/180 transitions.
Normalized transition count is 136 out of 172 initially.
// Phase 1: matrix 136 rows 94 cols
[2022-05-16 23:16:19] [INFO ] Computed 26 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1379 ms. (steps per millisecond=725 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 532 ms. (steps per millisecond=1879 ) properties (out of 1) seen :1
[2022-05-16 23:16:21] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
// Phase 1: matrix 136 rows 94 cols
[2022-05-16 23:16:21] [INFO ] Computed 26 place invariants in 6 ms
[2022-05-16 23:16:21] [INFO ] [Real]Absence check using 26 positive place invariants in 5 ms returned sat
[2022-05-16 23:16:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 23:16:21] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-05-16 23:16:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 23:16:21] [INFO ] [Nat]Absence check using 26 positive place invariants in 5 ms returned sat
[2022-05-16 23:16:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 23:16:21] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2022-05-16 23:16:21] [INFO ] State equation strengthened by 48 read => feed constraints.
[2022-05-16 23:16:21] [INFO ] [Nat]Added 48 Read/Feed constraints in 5 ms returned sat
[2022-05-16 23:16:21] [INFO ] Computed and/alt/rep : 116/496/116 causal constraints (skipped 16 transitions) in 23 ms.
[2022-05-16 23:16:21] [INFO ] Added : 49 causal constraints over 10 iterations in 120 ms. Result :sat
Minimization took 59 ms.
Current structural bounds on expressions (after SMT) : [4] Max seen :[1]
Incomplete Parikh walk after 11200 steps, including 617 resets, run finished after 23 ms. (steps per millisecond=486 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 4 out of 94 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 94/94 places, 172/172 transitions.
Applied a total of 0 rules in 6 ms. Remains 94 /94 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 94/94 places, 172/172 transitions.
Starting structural reductions, iteration 0 : 94/94 places, 172/172 transitions.
Applied a total of 0 rules in 6 ms. Remains 94 /94 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2022-05-16 23:16:21] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
// Phase 1: matrix 136 rows 94 cols
[2022-05-16 23:16:21] [INFO ] Computed 26 place invariants in 2 ms
[2022-05-16 23:16:21] [INFO ] Implicit Places using invariants in 97 ms returned [62, 63, 64, 65]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 98 ms to find 4 implicit places.
[2022-05-16 23:16:21] [INFO ] Redundant transitions in 4 ms returned []
[2022-05-16 23:16:21] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
// Phase 1: matrix 136 rows 90 cols
[2022-05-16 23:16:21] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-16 23:16:21] [INFO ] Dead Transitions using invariants and state equation in 81 ms returned []
Starting structural reductions, iteration 1 : 90/94 places, 172/172 transitions.
Applied a total of 0 rules in 5 ms. Remains 90 /90 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2022-05-16 23:16:21] [INFO ] Redundant transitions in 5 ms returned []
[2022-05-16 23:16:21] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
// Phase 1: matrix 136 rows 90 cols
[2022-05-16 23:16:21] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-16 23:16:21] [INFO ] Dead Transitions using invariants and state equation in 71 ms returned []
Finished structural reductions, in 2 iterations. Remains : 90/94 places, 172/172 transitions.
Normalized transition count is 136 out of 172 initially.
// Phase 1: matrix 136 rows 90 cols
[2022-05-16 23:16:21] [INFO ] Computed 22 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1251 ms. (steps per millisecond=799 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 475 ms. (steps per millisecond=2105 ) properties (out of 1) seen :1
[2022-05-16 23:16:23] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
// Phase 1: matrix 136 rows 90 cols
[2022-05-16 23:16:23] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-16 23:16:23] [INFO ] [Real]Absence check using 22 positive place invariants in 4 ms returned sat
[2022-05-16 23:16:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 23:16:23] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2022-05-16 23:16:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 23:16:23] [INFO ] [Nat]Absence check using 22 positive place invariants in 4 ms returned sat
[2022-05-16 23:16:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 23:16:23] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2022-05-16 23:16:23] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-05-16 23:16:23] [INFO ] [Nat]Added 32 Read/Feed constraints in 3 ms returned sat
[2022-05-16 23:16:23] [INFO ] Deduced a trap composed of 7 places in 9 ms of which 0 ms to minimize.
[2022-05-16 23:16:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2022-05-16 23:16:23] [INFO ] Computed and/alt/rep : 120/496/120 causal constraints (skipped 12 transitions) in 15 ms.
[2022-05-16 23:16:23] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2022-05-16 23:16:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2022-05-16 23:16:23] [INFO ] Added : 48 causal constraints over 10 iterations in 183 ms. Result :sat
Minimization took 60 ms.
Current structural bounds on expressions (after SMT) : [4] Max seen :[1]
Incomplete Parikh walk after 8000 steps, including 551 resets, run finished after 17 ms. (steps per millisecond=470 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 4 out of 90 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 90/90 places, 172/172 transitions.
Applied a total of 0 rules in 6 ms. Remains 90 /90 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 90/90 places, 172/172 transitions.
Starting structural reductions, iteration 0 : 90/90 places, 172/172 transitions.
Applied a total of 0 rules in 5 ms. Remains 90 /90 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2022-05-16 23:16:23] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
// Phase 1: matrix 136 rows 90 cols
[2022-05-16 23:16:23] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-16 23:16:24] [INFO ] Implicit Places using invariants in 62 ms returned []
[2022-05-16 23:16:24] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
// Phase 1: matrix 136 rows 90 cols
[2022-05-16 23:16:24] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-16 23:16:24] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-05-16 23:16:24] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
[2022-05-16 23:16:24] [INFO ] Redundant transitions in 8 ms returned []
[2022-05-16 23:16:24] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
// Phase 1: matrix 136 rows 90 cols
[2022-05-16 23:16:24] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-16 23:16:24] [INFO ] Dead Transitions using invariants and state equation in 69 ms returned []
Finished structural reductions, in 1 iterations. Remains : 90/90 places, 172/172 transitions.
Starting property specific reduction for LamportFastMutEx-PT-4-UpperBounds-06
Normalized transition count is 136 out of 172 initially.
// Phase 1: matrix 136 rows 90 cols
[2022-05-16 23:16:24] [INFO ] Computed 22 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :1
[2022-05-16 23:16:24] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
// Phase 1: matrix 136 rows 90 cols
[2022-05-16 23:16:24] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-16 23:16:24] [INFO ] [Real]Absence check using 22 positive place invariants in 9 ms returned sat
[2022-05-16 23:16:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 23:16:24] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2022-05-16 23:16:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 23:16:24] [INFO ] [Nat]Absence check using 22 positive place invariants in 4 ms returned sat
[2022-05-16 23:16:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 23:16:24] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-05-16 23:16:24] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-05-16 23:16:24] [INFO ] [Nat]Added 32 Read/Feed constraints in 3 ms returned sat
[2022-05-16 23:16:24] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 0 ms to minimize.
[2022-05-16 23:16:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2022-05-16 23:16:24] [INFO ] Computed and/alt/rep : 120/496/120 causal constraints (skipped 12 transitions) in 10 ms.
[2022-05-16 23:16:24] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2022-05-16 23:16:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2022-05-16 23:16:24] [INFO ] Added : 48 causal constraints over 10 iterations in 164 ms. Result :sat
Minimization took 60 ms.
Current structural bounds on expressions (after SMT) : [4] Max seen :[1]
Incomplete Parikh walk after 8000 steps, including 548 resets, run finished after 21 ms. (steps per millisecond=380 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 4 out of 90 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 90/90 places, 172/172 transitions.
Applied a total of 0 rules in 6 ms. Remains 90 /90 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 90/90 places, 172/172 transitions.
Normalized transition count is 136 out of 172 initially.
// Phase 1: matrix 136 rows 90 cols
[2022-05-16 23:16:24] [INFO ] Computed 22 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1247 ms. (steps per millisecond=801 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 491 ms. (steps per millisecond=2036 ) properties (out of 1) seen :1
[2022-05-16 23:16:26] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
// Phase 1: matrix 136 rows 90 cols
[2022-05-16 23:16:26] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-16 23:16:26] [INFO ] [Real]Absence check using 22 positive place invariants in 5 ms returned sat
[2022-05-16 23:16:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 23:16:26] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2022-05-16 23:16:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 23:16:26] [INFO ] [Nat]Absence check using 22 positive place invariants in 4 ms returned sat
[2022-05-16 23:16:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 23:16:26] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2022-05-16 23:16:26] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-05-16 23:16:26] [INFO ] [Nat]Added 32 Read/Feed constraints in 3 ms returned sat
[2022-05-16 23:16:26] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 0 ms to minimize.
[2022-05-16 23:16:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2022-05-16 23:16:26] [INFO ] Computed and/alt/rep : 120/496/120 causal constraints (skipped 12 transitions) in 8 ms.
[2022-05-16 23:16:26] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 5 ms to minimize.
[2022-05-16 23:16:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2022-05-16 23:16:26] [INFO ] Added : 48 causal constraints over 10 iterations in 172 ms. Result :sat
Minimization took 60 ms.
Current structural bounds on expressions (after SMT) : [4] Max seen :[1]
Incomplete Parikh walk after 8000 steps, including 558 resets, run finished after 12 ms. (steps per millisecond=666 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 4 out of 90 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 90/90 places, 172/172 transitions.
Applied a total of 0 rules in 5 ms. Remains 90 /90 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 90/90 places, 172/172 transitions.
Starting structural reductions, iteration 0 : 90/90 places, 172/172 transitions.
Applied a total of 0 rules in 5 ms. Remains 90 /90 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2022-05-16 23:16:26] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
// Phase 1: matrix 136 rows 90 cols
[2022-05-16 23:16:26] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-16 23:16:26] [INFO ] Implicit Places using invariants in 58 ms returned []
[2022-05-16 23:16:26] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
// Phase 1: matrix 136 rows 90 cols
[2022-05-16 23:16:26] [INFO ] Computed 22 place invariants in 5 ms
[2022-05-16 23:16:26] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-05-16 23:16:27] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2022-05-16 23:16:27] [INFO ] Redundant transitions in 3 ms returned []
[2022-05-16 23:16:27] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
// Phase 1: matrix 136 rows 90 cols
[2022-05-16 23:16:27] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-16 23:16:27] [INFO ] Dead Transitions using invariants and state equation in 71 ms returned []
Finished structural reductions, in 1 iterations. Remains : 90/90 places, 172/172 transitions.
Ending property specific reduction for LamportFastMutEx-PT-4-UpperBounds-06 in 2855 ms.
[2022-05-16 23:16:27] [INFO ] Flatten gal took : 45 ms
[2022-05-16 23:16:27] [INFO ] Applying decomposition
[2022-05-16 23:16:27] [INFO ] Flatten gal took : 17 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/graph18358794704835922067.txt, -o, /tmp/graph18358794704835922067.bin, -w, /tmp/graph18358794704835922067.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/graph18358794704835922067.bin, -l, -1, -v, -w, /tmp/graph18358794704835922067.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-16 23:16:27] [INFO ] Decomposing Gal with order
[2022-05-16 23:16:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 23:16:27] [INFO ] Removed a total of 219 redundant transitions.
[2022-05-16 23:16:27] [INFO ] Flatten gal took : 46 ms
[2022-05-16 23:16:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 7 ms.
[2022-05-16 23:16:27] [INFO ] Time to serialize gal into /tmp/UpperBounds9710616238756960095.gal : 7 ms
[2022-05-16 23:16:27] [INFO ] Time to serialize properties into /tmp/UpperBounds11770156386925459701.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/UpperBounds9710616238756960095.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds11770156386925459701.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/UpperBounds9710616238756960095.gal -t CGAL -reachable-file /tmp/UpperBounds11770156386925459701.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds11770156386925459701.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,1.4985e+06,2.0373,62660,2,12335,5,191835,6,0,557,275360,0
Total reachable state count : 1498496

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property LamportFastMutEx-PT-4-UpperBounds-06 :0 <= gi5.gu14.P_CS_21_1+gi6.gu15.P_CS_21_2+gi0.gu16.P_CS_21_3+gi4.gu17.P_CS_21_4 <= 1
FORMULA LamportFastMutEx-PT-4-UpperBounds-06 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-4-UpperBounds-06,0,2.05651,62660,1,0,7,191835,9,1,775,275360,4

BK_STOP 1652742990696

--------------------
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-4"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is LamportFastMutEx-PT-4, 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 r143-tall-165271830300154"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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