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.r132-tall-162075428500336.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 gold2020
Input is LamportFastMutEx-PT-5, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-162075428500336
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 85K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 461K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 141K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 731K 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 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 11K Apr 26 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 47K Apr 26 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 26 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 26 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K Mar 27 06:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 27 06:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Mar 25 07:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Mar 25 07:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.0K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.4K 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 157K 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 booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME LamportFastMutEx-PT-5-ReachabilityFireability-00
FORMULA_NAME LamportFastMutEx-PT-5-ReachabilityFireability-01
FORMULA_NAME LamportFastMutEx-PT-5-ReachabilityFireability-02
FORMULA_NAME LamportFastMutEx-PT-5-ReachabilityFireability-03
FORMULA_NAME LamportFastMutEx-PT-5-ReachabilityFireability-04
FORMULA_NAME LamportFastMutEx-PT-5-ReachabilityFireability-05
FORMULA_NAME LamportFastMutEx-PT-5-ReachabilityFireability-06
FORMULA_NAME LamportFastMutEx-PT-5-ReachabilityFireability-07
FORMULA_NAME LamportFastMutEx-PT-5-ReachabilityFireability-08
FORMULA_NAME LamportFastMutEx-PT-5-ReachabilityFireability-09
FORMULA_NAME LamportFastMutEx-PT-5-ReachabilityFireability-10
FORMULA_NAME LamportFastMutEx-PT-5-ReachabilityFireability-11
FORMULA_NAME LamportFastMutEx-PT-5-ReachabilityFireability-12
FORMULA_NAME LamportFastMutEx-PT-5-ReachabilityFireability-13
FORMULA_NAME LamportFastMutEx-PT-5-ReachabilityFireability-14
FORMULA_NAME LamportFastMutEx-PT-5-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620932698036

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 19:04:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-13 19:04:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 19:04:59] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2021-05-13 19:04:59] [INFO ] Transformed 174 places.
[2021-05-13 19:04:59] [INFO ] Transformed 318 transitions.
[2021-05-13 19:04:59] [INFO ] Found NUPN structural information;
[2021-05-13 19:04:59] [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_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_setx_3_0, P_setx_3_1, P_setx_3_2, P_setx_3_3, P_setx_3_4, P_setx_3_5, 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_ify0_4_0, P_ify0_4_1, P_ify0_4_2, P_ify0_4_3, P_ify0_4_4, P_ify0_4_5, 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_ifxi_10_0, P_ifxi_10_1, P_ifxi_10_2, P_ifxi_10_3, P_ifxi_10_4, P_ifxi_10_5, 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_fordo_12_0, P_fordo_12_1, P_fordo_12_2, P_fordo_12_3, P_fordo_12_4, P_fordo_12_5, 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_1_0, P_wait_1_1, P_wait_1_2, P_wait_1_3, P_wait_1_4, P_wait_1_5, 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_3_0, P_wait_3_1, P_wait_3_2, P_wait_3_3, P_wait_3_4, P_wait_3_5, 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_5_0, P_wait_5_1, P_wait_5_2, P_wait_5_3, P_wait_5_4, P_wait_5_5, 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_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_1_0, P_done_1_1, P_done_1_2, P_done_1_3, P_done_1_4, P_done_1_5, 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_3_0, P_done_3_1, P_done_3_2, P_done_3_3, P_done_3_4, P_done_3_5, 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_5_0, P_done_5_1, P_done_5_2, P_done_5_3, P_done_5_4, P_done_5_5, 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_awaity_0, P_awaity_1, P_awaity_2, P_awaity_3, P_awaity_4, P_awaity_5, 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_setbi_24_0, P_setbi_24_1, P_setbi_24_2, P_setbi_24_3, P_setbi_24_4, P_setbi_24_5]
[2021-05-13 19:04:59] [INFO ] Parsed PT model containing 174 places and 318 transitions in 112 ms.
Deduced a syphon composed of 37 places in 3 ms
Reduce places removed 37 places and 58 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 40 ms.
Working with output stream class java.io.PrintStream
FORMULA LamportFastMutEx-PT-5-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-5-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 80 ms. (steps per millisecond=125 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0]
FORMULA LamportFastMutEx-PT-5-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-5-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-5-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-5-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-5-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-5-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-5-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-5-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-5-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-5-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0]
[2021-05-13 19:04:59] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2021-05-13 19:04:59] [INFO ] Computed 37 place invariants in 8 ms
[2021-05-13 19:05:00] [INFO ] [Real]Absence check using 37 positive place invariants in 24 ms returned sat
[2021-05-13 19:05:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 19:05:00] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2021-05-13 19:05:00] [INFO ] State equation strengthened by 65 read => feed constraints.
[2021-05-13 19:05:00] [INFO ] [Real]Added 65 Read/Feed constraints in 9 ms returned sat
[2021-05-13 19:05:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 19:05:00] [INFO ] [Nat]Absence check using 37 positive place invariants in 20 ms returned sat
[2021-05-13 19:05:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 19:05:00] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2021-05-13 19:05:00] [INFO ] [Nat]Added 65 Read/Feed constraints in 9 ms returned sat
[2021-05-13 19:05:00] [INFO ] Deduced a trap composed of 9 places in 90 ms
[2021-05-13 19:05:00] [INFO ] Deduced a trap composed of 30 places in 66 ms
[2021-05-13 19:05:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 195 ms
[2021-05-13 19:05:00] [INFO ] Computed and/alt/rep : 255/1495/195 causal constraints in 22 ms.
[2021-05-13 19:05:01] [INFO ] Added : 180 causal constraints over 37 iterations in 744 ms. Result :sat
[2021-05-13 19:05:01] [INFO ] Deduced a trap composed of 35 places in 55 ms
[2021-05-13 19:05:01] [INFO ] Deduced a trap composed of 36 places in 60 ms
[2021-05-13 19:05:01] [INFO ] Deduced a trap composed of 8 places in 79 ms
[2021-05-13 19:05:01] [INFO ] Deduced a trap composed of 9 places in 69 ms
[2021-05-13 19:05:01] [INFO ] Deduced a trap composed of 11 places in 55 ms
[2021-05-13 19:05:01] [INFO ] Deduced a trap composed of 14 places in 49 ms
[2021-05-13 19:05:01] [INFO ] Deduced a trap composed of 33 places in 50 ms
[2021-05-13 19:05:01] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 571 ms
Attempting to minimize the solution found.
Minimization took 14 ms.
[2021-05-13 19:05:01] [INFO ] [Real]Absence check using 37 positive place invariants in 9 ms returned unsat
[2021-05-13 19:05:02] [INFO ] [Real]Absence check using 37 positive place invariants in 15 ms returned sat
[2021-05-13 19:05:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 19:05:02] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2021-05-13 19:05:02] [INFO ] [Real]Added 65 Read/Feed constraints in 9 ms returned sat
[2021-05-13 19:05:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 19:05:02] [INFO ] [Nat]Absence check using 37 positive place invariants in 15 ms returned sat
[2021-05-13 19:05:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 19:05:02] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2021-05-13 19:05:02] [INFO ] [Nat]Added 65 Read/Feed constraints in 9 ms returned sat
[2021-05-13 19:05:02] [INFO ] Deduced a trap composed of 30 places in 46 ms
[2021-05-13 19:05:02] [INFO ] Deduced a trap composed of 9 places in 57 ms
[2021-05-13 19:05:02] [INFO ] Deduced a trap composed of 27 places in 51 ms
[2021-05-13 19:05:02] [INFO ] Deduced a trap composed of 9 places in 46 ms
[2021-05-13 19:05:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 236 ms
[2021-05-13 19:05:02] [INFO ] Computed and/alt/rep : 255/1495/195 causal constraints in 15 ms.
[2021-05-13 19:05:02] [INFO ] Added : 147 causal constraints over 30 iterations in 406 ms. Result :sat
[2021-05-13 19:05:02] [INFO ] Deduced a trap composed of 11 places in 18 ms
[2021-05-13 19:05:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
Attempting to minimize the solution found.
Minimization took 12 ms.
[2021-05-13 19:05:02] [INFO ] [Real]Absence check using 37 positive place invariants in 13 ms returned sat
[2021-05-13 19:05:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 19:05:03] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2021-05-13 19:05:03] [INFO ] [Real]Added 65 Read/Feed constraints in 8 ms returned sat
[2021-05-13 19:05:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 19:05:03] [INFO ] [Nat]Absence check using 37 positive place invariants in 15 ms returned sat
[2021-05-13 19:05:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 19:05:03] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2021-05-13 19:05:03] [INFO ] [Nat]Added 65 Read/Feed constraints in 14 ms returned sat
[2021-05-13 19:05:03] [INFO ] Deduced a trap composed of 9 places in 63 ms
[2021-05-13 19:05:03] [INFO ] Deduced a trap composed of 7 places in 53 ms
[2021-05-13 19:05:03] [INFO ] Deduced a trap composed of 7 places in 107 ms
[2021-05-13 19:05:03] [INFO ] Deduced a trap composed of 7 places in 55 ms
[2021-05-13 19:05:03] [INFO ] Deduced a trap composed of 7 places in 54 ms
[2021-05-13 19:05:03] [INFO ] Deduced a trap composed of 7 places in 57 ms
[2021-05-13 19:05:03] [INFO ] Deduced a trap composed of 7 places in 47 ms
[2021-05-13 19:05:03] [INFO ] Deduced a trap composed of 19 places in 57 ms
[2021-05-13 19:05:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 564 ms
FORMULA LamportFastMutEx-PT-5-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LamportFastMutEx-PT-5-ReachabilityFireability-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 42600 steps, including 852 resets, run finished after 178 ms. (steps per millisecond=239 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 69000 steps, including 1000 resets, run finished after 186 ms. (steps per millisecond=370 ) properties seen :[0, 0] could not realise parikh vector
Support contains 5 out of 137 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 137/137 places, 260/260 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 132 transition count 255
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 15 place count 132 transition count 250
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 20 place count 127 transition count 250
Applied a total of 20 rules in 70 ms. Remains 127 /137 variables (removed 10) and now considering 250/260 (removed 10) transitions.
Finished structural reductions, in 1 iterations. Remains : 127/137 places, 250/260 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2389 ms. (steps per millisecond=418 ) properties seen :[0, 1]
FORMULA LamportFastMutEx-PT-5-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 986 ms. (steps per millisecond=1014 ) properties seen :[0]
[2021-05-13 19:05:07] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 127 cols
[2021-05-13 19:05:07] [INFO ] Computed 37 place invariants in 3 ms
[2021-05-13 19:05:07] [INFO ] [Real]Absence check using 37 positive place invariants in 13 ms returned sat
[2021-05-13 19:05:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 19:05:07] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2021-05-13 19:05:07] [INFO ] State equation strengthened by 65 read => feed constraints.
[2021-05-13 19:05:07] [INFO ] [Real]Added 65 Read/Feed constraints in 8 ms returned sat
[2021-05-13 19:05:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 19:05:07] [INFO ] [Nat]Absence check using 37 positive place invariants in 14 ms returned sat
[2021-05-13 19:05:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 19:05:07] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2021-05-13 19:05:07] [INFO ] [Nat]Added 65 Read/Feed constraints in 9 ms returned sat
[2021-05-13 19:05:07] [INFO ] Deduced a trap composed of 7 places in 56 ms
[2021-05-13 19:05:08] [INFO ] Deduced a trap composed of 6 places in 73 ms
[2021-05-13 19:05:08] [INFO ] Deduced a trap composed of 37 places in 65 ms
[2021-05-13 19:05:08] [INFO ] Deduced a trap composed of 32 places in 58 ms
[2021-05-13 19:05:08] [INFO ] Deduced a trap composed of 32 places in 69 ms
[2021-05-13 19:05:08] [INFO ] Deduced a trap composed of 7 places in 12 ms
[2021-05-13 19:05:08] [INFO ] Deduced a trap composed of 29 places in 55 ms
[2021-05-13 19:05:08] [INFO ] Deduced a trap composed of 35 places in 68 ms
[2021-05-13 19:05:08] [INFO ] Deduced a trap composed of 27 places in 61 ms
[2021-05-13 19:05:08] [INFO ] Deduced a trap composed of 14 places in 59 ms
[2021-05-13 19:05:08] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 643 ms
[2021-05-13 19:05:08] [INFO ] Computed and/alt/rep : 245/1685/185 causal constraints in 14 ms.
[2021-05-13 19:05:08] [INFO ] Added : 133 causal constraints over 27 iterations in 368 ms. Result :sat
[2021-05-13 19:05:08] [INFO ] Deduced a trap composed of 9 places in 14 ms
[2021-05-13 19:05:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
Attempting to minimize the solution found.
Minimization took 8 ms.
Incomplete Parikh walk after 45000 steps, including 1000 resets, run finished after 124 ms. (steps per millisecond=362 ) properties seen :[0] could not realise parikh vector
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 127/127 places, 250/250 transitions.
Applied a total of 0 rules in 10 ms. Remains 127 /127 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 127/127 places, 250/250 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2400 ms. (steps per millisecond=416 ) properties seen :[0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 902 ms. (steps per millisecond=1108 ) properties seen :[0]
Interrupted probabilistic random walk after 15729921 steps, run timeout after 30001 ms. (steps per millisecond=524 ) properties seen :[0]
Probabilistic random walk after 15729921 steps, saw 2811101 distinct states, run finished after 30001 ms. (steps per millisecond=524 ) properties seen :[0]
[2021-05-13 19:05:42] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 127 cols
[2021-05-13 19:05:42] [INFO ] Computed 37 place invariants in 1 ms
[2021-05-13 19:05:42] [INFO ] [Real]Absence check using 37 positive place invariants in 12 ms returned sat
[2021-05-13 19:05:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 19:05:42] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2021-05-13 19:05:42] [INFO ] State equation strengthened by 65 read => feed constraints.
[2021-05-13 19:05:42] [INFO ] [Real]Added 65 Read/Feed constraints in 16 ms returned sat
[2021-05-13 19:05:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 19:05:42] [INFO ] [Nat]Absence check using 37 positive place invariants in 14 ms returned sat
[2021-05-13 19:05:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 19:05:42] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2021-05-13 19:05:42] [INFO ] [Nat]Added 65 Read/Feed constraints in 8 ms returned sat
[2021-05-13 19:05:42] [INFO ] Deduced a trap composed of 7 places in 57 ms
[2021-05-13 19:05:42] [INFO ] Deduced a trap composed of 6 places in 61 ms
[2021-05-13 19:05:42] [INFO ] Deduced a trap composed of 37 places in 70 ms
[2021-05-13 19:05:42] [INFO ] Deduced a trap composed of 32 places in 51 ms
[2021-05-13 19:05:42] [INFO ] Deduced a trap composed of 32 places in 51 ms
[2021-05-13 19:05:42] [INFO ] Deduced a trap composed of 7 places in 24 ms
[2021-05-13 19:05:43] [INFO ] Deduced a trap composed of 29 places in 54 ms
[2021-05-13 19:05:43] [INFO ] Deduced a trap composed of 35 places in 63 ms
[2021-05-13 19:05:43] [INFO ] Deduced a trap composed of 27 places in 61 ms
[2021-05-13 19:05:43] [INFO ] Deduced a trap composed of 14 places in 51 ms
[2021-05-13 19:05:43] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 608 ms
[2021-05-13 19:05:43] [INFO ] Computed and/alt/rep : 245/1685/185 causal constraints in 12 ms.
[2021-05-13 19:05:43] [INFO ] Added : 133 causal constraints over 27 iterations in 367 ms. Result :sat
[2021-05-13 19:05:43] [INFO ] Deduced a trap composed of 9 places in 16 ms
[2021-05-13 19:05:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
Attempting to minimize the solution found.
Minimization took 10 ms.
Incomplete Parikh walk after 45000 steps, including 1000 resets, run finished after 119 ms. (steps per millisecond=378 ) properties seen :[0] could not realise parikh vector
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 127/127 places, 250/250 transitions.
Applied a total of 0 rules in 10 ms. Remains 127 /127 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 127/127 places, 250/250 transitions.
Starting structural reductions, iteration 0 : 127/127 places, 250/250 transitions.
Applied a total of 0 rules in 11 ms. Remains 127 /127 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2021-05-13 19:05:43] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 127 cols
[2021-05-13 19:05:43] [INFO ] Computed 37 place invariants in 1 ms
[2021-05-13 19:05:43] [INFO ] Implicit Places using invariants in 138 ms returned [82, 83, 84, 85, 86]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 140 ms to find 5 implicit places.
[2021-05-13 19:05:43] [INFO ] Redundant transitions in 10 ms returned []
[2021-05-13 19:05:43] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2021-05-13 19:05:43] [INFO ] Computed 32 place invariants in 1 ms
[2021-05-13 19:05:44] [INFO ] Dead Transitions using invariants and state equation in 172 ms returned []
Starting structural reductions, iteration 1 : 122/127 places, 250/250 transitions.
Applied a total of 0 rules in 10 ms. Remains 122 /122 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2021-05-13 19:05:44] [INFO ] Redundant transitions in 3 ms returned []
[2021-05-13 19:05:44] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2021-05-13 19:05:44] [INFO ] Computed 32 place invariants in 1 ms
[2021-05-13 19:05:44] [INFO ] Dead Transitions using invariants and state equation in 168 ms returned []
Finished structural reductions, in 2 iterations. Remains : 122/127 places, 250/250 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2351 ms. (steps per millisecond=425 ) properties seen :[0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 803 ms. (steps per millisecond=1245 ) properties seen :[0]
Interrupted probabilistic random walk after 15976706 steps, run timeout after 30001 ms. (steps per millisecond=532 ) properties seen :[0]
Probabilistic random walk after 15976706 steps, saw 2854685 distinct states, run finished after 30001 ms. (steps per millisecond=532 ) properties seen :[0]
[2021-05-13 19:06:17] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2021-05-13 19:06:17] [INFO ] Computed 32 place invariants in 1 ms
[2021-05-13 19:06:17] [INFO ] [Real]Absence check using 32 positive place invariants in 11 ms returned sat
[2021-05-13 19:06:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 19:06:17] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2021-05-13 19:06:17] [INFO ] State equation strengthened by 40 read => feed constraints.
[2021-05-13 19:06:17] [INFO ] [Real]Added 40 Read/Feed constraints in 7 ms returned sat
[2021-05-13 19:06:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 19:06:17] [INFO ] [Nat]Absence check using 32 positive place invariants in 13 ms returned sat
[2021-05-13 19:06:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 19:06:17] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2021-05-13 19:06:17] [INFO ] [Nat]Added 40 Read/Feed constraints in 6 ms returned sat
[2021-05-13 19:06:17] [INFO ] Deduced a trap composed of 29 places in 51 ms
[2021-05-13 19:06:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2021-05-13 19:06:17] [INFO ] Computed and/alt/rep : 245/1575/185 causal constraints in 12 ms.
[2021-05-13 19:06:17] [INFO ] Added : 42 causal constraints over 10 iterations in 115 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 4 ms.
Incomplete Parikh walk after 3300 steps, including 290 resets, run finished after 10 ms. (steps per millisecond=330 ) properties seen :[0] could not realise parikh vector
Support contains 2 out of 122 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 122/122 places, 250/250 transitions.
Applied a total of 0 rules in 9 ms. Remains 122 /122 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 122/122 places, 250/250 transitions.
Starting structural reductions, iteration 0 : 122/122 places, 250/250 transitions.
Applied a total of 0 rules in 7 ms. Remains 122 /122 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2021-05-13 19:06:17] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2021-05-13 19:06:17] [INFO ] Computed 32 place invariants in 1 ms
[2021-05-13 19:06:18] [INFO ] Implicit Places using invariants in 125 ms returned []
[2021-05-13 19:06:18] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2021-05-13 19:06:18] [INFO ] Computed 32 place invariants in 1 ms
[2021-05-13 19:06:18] [INFO ] State equation strengthened by 40 read => feed constraints.
[2021-05-13 19:06:18] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
[2021-05-13 19:06:18] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-13 19:06:18] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2021-05-13 19:06:18] [INFO ] Computed 32 place invariants in 1 ms
[2021-05-13 19:06:18] [INFO ] Dead Transitions using invariants and state equation in 186 ms returned []
Finished structural reductions, in 1 iterations. Remains : 122/122 places, 250/250 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 233 ms. (steps per millisecond=429 ) properties seen :[0]
[2021-05-13 19:06:18] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2021-05-13 19:06:18] [INFO ] Computed 32 place invariants in 1 ms
[2021-05-13 19:06:18] [INFO ] [Real]Absence check using 32 positive place invariants in 11 ms returned sat
[2021-05-13 19:06:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 19:06:18] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2021-05-13 19:06:19] [INFO ] State equation strengthened by 40 read => feed constraints.
[2021-05-13 19:06:19] [INFO ] [Real]Added 40 Read/Feed constraints in 6 ms returned sat
[2021-05-13 19:06:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 19:06:19] [INFO ] [Nat]Absence check using 32 positive place invariants in 12 ms returned sat
[2021-05-13 19:06:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 19:06:19] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2021-05-13 19:06:19] [INFO ] [Nat]Added 40 Read/Feed constraints in 6 ms returned sat
[2021-05-13 19:06:19] [INFO ] Deduced a trap composed of 29 places in 61 ms
[2021-05-13 19:06:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2021-05-13 19:06:19] [INFO ] Computed and/alt/rep : 245/1575/185 causal constraints in 14 ms.
[2021-05-13 19:06:19] [INFO ] Added : 42 causal constraints over 10 iterations in 120 ms. Result :sat
Graph (trivial) has 118 edges and 122 vertex of which 41 / 122 are part of one of the 5 SCC in 3 ms
Free SCC test removed 36 places
Discarding 6 places :
Also discarding 0 output transitions
Graph (complete) has 222 edges and 86 vertex of which 80 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.8 ms
Drop transitions removed 90 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 138 transitions.
Iterating post reduction 0 with 138 rules applied. Total rules applied 140 place count 80 transition count 112
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 25 Pre rules applied. Total rules applied 140 place count 80 transition count 87
Deduced a syphon composed of 25 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 1 with 70 rules applied. Total rules applied 210 place count 35 transition count 87
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 218 place count 31 transition count 83
Graph (trivial) has 14 edges and 31 vertex of which 13 / 31 are part of one of the 5 SCC in 0 ms
Free SCC test removed 8 places
Discarding 8 places :
Also discarding 12 output transitions
Drop transitions removed 12 transitions
Remove reverse transitions (loop back) rule discarded transition T_setbi_24_4 and 8 places that fell out of Prefix Of Interest.
Iterating global reduction 1 with 2 rules applied. Total rules applied 220 place count 11 transition count 71
Drop transitions removed 13 transitions
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 30 transitions.
Graph (trivial) has 17 edges and 11 vertex of which 4 / 11 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 31 rules applied. Total rules applied 251 place count 8 transition count 41
Drop transitions removed 12 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 278 place count 8 transition count 14
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 279 place count 8 transition count 13
Applied a total of 279 rules in 39 ms. Remains 8 /122 variables (removed 114) and now considering 13/250 (removed 237) transitions.
// Phase 1: matrix 13 rows 8 cols
[2021-05-13 19:06:19] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-13 19:06:19] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-13 19:06:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 19:06:19] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2021-05-13 19:06:19] [INFO ] Computed and/alt/rep : 9/21/9 causal constraints in 1 ms.
[2021-05-13 19:06:19] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2021-05-13 19:06:19] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 1 ms.
[2021-05-13 19:06:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 7 ms.
[2021-05-13 19:06:19] [INFO ] Flatten gal took : 56 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ LamportFastMutEx-PT-5 @ 3570 seconds
vrfy: finished
info: timeLeft: 3568
rslt: Output for ReachabilityFireability @ LamportFastMutEx-PT-5

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"localtimelimit": 0,
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu May 13 19:06:20 2021
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 20128,
"runtime": 2.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p11) AND (1 <= p115))))",
"processed_size": 36,
"rewrites": 1,
"skeleton": "E(F(**))"
},
"net":
{
"arcs": 1160,
"conflict_clusters": 7,
"places": 122,
"places_significant": 90,
"singleton_clusters": 0,
"transitions": 250
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 372/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 122
lola: finding significant places
lola: 122 places, 250 transitions, 90 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityFireability.xml
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p115 <= 1)
lola: E (F (((1 <= p11) AND (1 <= p115))))
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p11) AND (1 <= p115))))
lola: processed formula length: 36
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: subprocess will run for 0 seconds at most (--localtimelimit)
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: local time limit reached - aborting
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p11) AND (1 <= p115))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
lola: memory consumption: 20128 KB
lola: time consumption: 2 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
rslt: finished

--------------------
content from stderr:

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-5"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2020"
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 gold2020"
echo " Input is LamportFastMutEx-PT-5, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r132-tall-162075428500336"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-PT-5.tgz
mv LamportFastMutEx-PT-5 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;