Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 920K
-rw-r--r-- 1 mcc users 13K Feb 25 13:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 13:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 13:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 25 13:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Feb 25 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 25K Feb 25 13:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 197K Feb 25 13:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 39K Feb 25 13:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 233K Feb 25 13:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.1K Feb 25 16:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 77K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679493507867

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-PT-3
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 13:58:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 13:58:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 13:58:29] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2023-03-22 13:58:29] [INFO ] Transformed 100 places.
[2023-03-22 13:58:29] [INFO ] Transformed 156 transitions.
[2023-03-22 13:58:29] [INFO ] Found NUPN structural information;
[2023-03-22 13:58:29] [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_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_setx_3_0, P_setx_3_1, P_setx_3_2, P_setx_3_3, P_setbi_5_0, P_setbi_5_1, P_setbi_5_2, P_setbi_5_3, P_ify0_4_0, P_ify0_4_1, P_ify0_4_2, P_ify0_4_3, P_sety_9_0, P_sety_9_1, P_sety_9_2, P_sety_9_3, P_ifxi_10_0, P_ifxi_10_1, P_ifxi_10_2, P_ifxi_10_3, P_setbi_11_0, P_setbi_11_1, P_setbi_11_2, P_setbi_11_3, P_fordo_12_0, P_fordo_12_1, P_fordo_12_2, P_fordo_12_3, P_wait_0_0, P_wait_0_1, P_wait_0_2, P_wait_0_3, P_wait_1_0, P_wait_1_1, P_wait_1_2, P_wait_1_3, P_wait_2_0, P_wait_2_1, P_wait_2_2, P_wait_2_3, P_wait_3_0, P_wait_3_1, P_wait_3_2, P_wait_3_3, P_await_13_0, P_await_13_1, P_await_13_2, P_await_13_3, P_done_0_0, P_done_0_1, P_done_0_2, P_done_0_3, P_done_1_0, P_done_1_1, P_done_1_2, P_done_1_3, P_done_2_0, P_done_2_1, P_done_2_2, P_done_2_3, P_done_3_0, P_done_3_1, P_done_3_2, P_done_3_3, P_ifyi_15_0, P_ifyi_15_1, P_ifyi_15_2, P_ifyi_15_3, P_awaity_0, P_awaity_1, P_awaity_2, P_awaity_3, P_CS_21_0, P_CS_21_1, P_CS_21_2, P_CS_21_3, P_setbi_24_0, P_setbi_24_1, P_setbi_24_2, P_setbi_24_3]
[2023-03-22 13:58:29] [INFO ] Parsed PT model containing 100 places and 156 transitions and 664 arcs in 105 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 42 transitions.
FORMULA LamportFastMutEx-PT-3-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-3-UpperBounds-03 3 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-3-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-3-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-3-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-3-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 96 out of 114 initially.
// Phase 1: matrix 96 rows 71 cols
[2023-03-22 13:58:29] [INFO ] Computed 17 place invariants in 17 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :21
FORMULA LamportFastMutEx-PT-3-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-3-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-3-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-3-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-3-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-3-UpperBounds-05 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :10
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 4) seen :10
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 4) seen :11
[2023-03-22 13:58:29] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
// Phase 1: matrix 96 rows 71 cols
[2023-03-22 13:58:29] [INFO ] Computed 17 place invariants in 11 ms
[2023-03-22 13:58:29] [INFO ] [Real]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-22 13:58:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:58:29] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2023-03-22 13:58:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:58:30] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2023-03-22 13:58:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:58:30] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-22 13:58:30] [INFO ] State equation strengthened by 27 read => feed constraints.
[2023-03-22 13:58:30] [INFO ] [Nat]Added 27 Read/Feed constraints in 9 ms returned sat
[2023-03-22 13:58:30] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 2 ms to minimize.
[2023-03-22 13:58:30] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2023-03-22 13:58:30] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2023-03-22 13:58:30] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 2 ms to minimize.
[2023-03-22 13:58:30] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2023-03-22 13:58:30] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2023-03-22 13:58:30] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2023-03-22 13:58:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 317 ms
[2023-03-22 13:58:30] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2023-03-22 13:58:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:58:30] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-22 13:58:30] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2023-03-22 13:58:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:58:30] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2023-03-22 13:58:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:58:30] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-22 13:58:30] [INFO ] [Nat]Added 27 Read/Feed constraints in 11 ms returned sat
[2023-03-22 13:58:30] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2023-03-22 13:58:30] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2023-03-22 13:58:30] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2023-03-22 13:58:30] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2023-03-22 13:58:30] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2023-03-22 13:58:30] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2023-03-22 13:58:30] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 0 ms to minimize.
[2023-03-22 13:58:30] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2023-03-22 13:58:30] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2023-03-22 13:58:30] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2023-03-22 13:58:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 336 ms
[2023-03-22 13:58:30] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2023-03-22 13:58:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:58:30] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-22 13:58:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:58:30] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2023-03-22 13:58:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:58:30] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-22 13:58:31] [INFO ] [Nat]Added 27 Read/Feed constraints in 6 ms returned sat
[2023-03-22 13:58:31] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2023-03-22 13:58:31] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2023-03-22 13:58:31] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2023-03-22 13:58:31] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2023-03-22 13:58:31] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2023-03-22 13:58:31] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2023-03-22 13:58:31] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2023-03-22 13:58:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 207 ms
[2023-03-22 13:58:31] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2023-03-22 13:58:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:58:31] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-22 13:58:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:58:31] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2023-03-22 13:58:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:58:31] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-22 13:58:31] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2023-03-22 13:58:31] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 0 ms to minimize.
[2023-03-22 13:58:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2023-03-22 13:58:31] [INFO ] Computed and/alt/rep : 93/306/87 causal constraints (skipped 6 transitions) in 6 ms.
[2023-03-22 13:58:31] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2023-03-22 13:58:31] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2023-03-22 13:58:31] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2023-03-22 13:58:31] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2023-03-22 13:58:31] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2023-03-22 13:58:31] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2023-03-22 13:58:31] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 265 ms
[2023-03-22 13:58:31] [INFO ] Added : 54 causal constraints over 12 iterations in 380 ms. Result :sat
Minimization took 43 ms.
Current structural bounds on expressions (after SMT) : [6, 2, 2, 3] Max seen :[6, 2, 2, 1]
FORMULA LamportFastMutEx-PT-3-UpperBounds-04 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-3-UpperBounds-02 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-3-UpperBounds-01 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 3 out of 71 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 114/114 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 68 transition count 111
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 9 place count 68 transition count 108
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 12 place count 65 transition count 108
Applied a total of 12 rules in 20 ms. Remains 65 /71 variables (removed 6) and now considering 108/114 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 65/71 places, 108/114 transitions.
Normalized transition count is 90 out of 108 initially.
// Phase 1: matrix 90 rows 65 cols
[2023-03-22 13:58:31] [INFO ] Computed 17 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1128 ms. (steps per millisecond=886 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 481 ms. (steps per millisecond=2079 ) properties (out of 1) seen :1
[2023-03-22 13:58:33] [INFO ] Flow matrix only has 90 transitions (discarded 18 similar events)
// Phase 1: matrix 90 rows 65 cols
[2023-03-22 13:58:33] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-22 13:58:33] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2023-03-22 13:58:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:58:33] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-22 13:58:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:58:33] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2023-03-22 13:58:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:58:33] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-22 13:58:33] [INFO ] State equation strengthened by 27 read => feed constraints.
[2023-03-22 13:58:33] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2023-03-22 13:58:33] [INFO ] Computed and/alt/rep : 78/291/78 causal constraints (skipped 9 transitions) in 6 ms.
[2023-03-22 13:58:33] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2023-03-22 13:58:33] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2023-03-22 13:58:33] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2023-03-22 13:58:33] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 7 ms to minimize.
[2023-03-22 13:58:33] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2023-03-22 13:58:33] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2023-03-22 13:58:33] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2023-03-22 13:58:33] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 290 ms
[2023-03-22 13:58:33] [INFO ] Added : 33 causal constraints over 8 iterations in 360 ms. Result :sat
Minimization took 32 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[1]
Support contains 3 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 108/108 transitions.
Applied a total of 0 rules in 7 ms. Remains 65 /65 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 65/65 places, 108/108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 108/108 transitions.
Applied a total of 0 rules in 5 ms. Remains 65 /65 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2023-03-22 13:58:34] [INFO ] Flow matrix only has 90 transitions (discarded 18 similar events)
[2023-03-22 13:58:34] [INFO ] Invariant cache hit.
[2023-03-22 13:58:34] [INFO ] Implicit Places using invariants in 62 ms returned [44, 45, 46]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 78 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 62/65 places, 108/108 transitions.
Applied a total of 0 rules in 4 ms. Remains 62 /62 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 87 ms. Remains : 62/65 places, 108/108 transitions.
Normalized transition count is 90 out of 108 initially.
// Phase 1: matrix 90 rows 62 cols
[2023-03-22 13:58:34] [INFO ] Computed 14 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 971 ms. (steps per millisecond=1029 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 415 ms. (steps per millisecond=2409 ) properties (out of 1) seen :1
[2023-03-22 13:58:35] [INFO ] Flow matrix only has 90 transitions (discarded 18 similar events)
// Phase 1: matrix 90 rows 62 cols
[2023-03-22 13:58:35] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-22 13:58:35] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-22 13:58:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:58:35] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-22 13:58:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:58:35] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2023-03-22 13:58:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:58:35] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-22 13:58:35] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-22 13:58:35] [INFO ] [Nat]Added 18 Read/Feed constraints in 6 ms returned sat
[2023-03-22 13:58:35] [INFO ] Computed and/alt/rep : 78/267/78 causal constraints (skipped 9 transitions) in 6 ms.
[2023-03-22 13:58:35] [INFO ] Added : 26 causal constraints over 6 iterations in 48 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[1]
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 108/108 transitions.
Applied a total of 0 rules in 4 ms. Remains 62 /62 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 62/62 places, 108/108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 108/108 transitions.
Applied a total of 0 rules in 4 ms. Remains 62 /62 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2023-03-22 13:58:35] [INFO ] Flow matrix only has 90 transitions (discarded 18 similar events)
[2023-03-22 13:58:35] [INFO ] Invariant cache hit.
[2023-03-22 13:58:35] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-22 13:58:35] [INFO ] Flow matrix only has 90 transitions (discarded 18 similar events)
[2023-03-22 13:58:35] [INFO ] Invariant cache hit.
[2023-03-22 13:58:35] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-22 13:58:35] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2023-03-22 13:58:35] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 13:58:35] [INFO ] Flow matrix only has 90 transitions (discarded 18 similar events)
[2023-03-22 13:58:35] [INFO ] Invariant cache hit.
[2023-03-22 13:58:35] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 233 ms. Remains : 62/62 places, 108/108 transitions.
Starting property specific reduction for LamportFastMutEx-PT-3-UpperBounds-07
Normalized transition count is 90 out of 108 initially.
// Phase 1: matrix 90 rows 62 cols
[2023-03-22 13:58:35] [INFO ] Computed 14 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 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :1
[2023-03-22 13:58:35] [INFO ] Flow matrix only has 90 transitions (discarded 18 similar events)
// Phase 1: matrix 90 rows 62 cols
[2023-03-22 13:58:35] [INFO ] Computed 14 place invariants in 3 ms
[2023-03-22 13:58:36] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-22 13:58:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:58:36] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-22 13:58:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:58:36] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-22 13:58:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:58:36] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-22 13:58:36] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-22 13:58:36] [INFO ] [Nat]Added 18 Read/Feed constraints in 2 ms returned sat
[2023-03-22 13:58:36] [INFO ] Computed and/alt/rep : 78/267/78 causal constraints (skipped 9 transitions) in 6 ms.
[2023-03-22 13:58:36] [INFO ] Added : 26 causal constraints over 6 iterations in 48 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[1]
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 108/108 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 62/62 places, 108/108 transitions.
Normalized transition count is 90 out of 108 initially.
// Phase 1: matrix 90 rows 62 cols
[2023-03-22 13:58:36] [INFO ] Computed 14 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 992 ms. (steps per millisecond=1008 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 419 ms. (steps per millisecond=2386 ) properties (out of 1) seen :1
[2023-03-22 13:58:37] [INFO ] Flow matrix only has 90 transitions (discarded 18 similar events)
// Phase 1: matrix 90 rows 62 cols
[2023-03-22 13:58:37] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-22 13:58:37] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-22 13:58:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:58:37] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-22 13:58:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:58:37] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-22 13:58:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:58:37] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-22 13:58:37] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-22 13:58:37] [INFO ] [Nat]Added 18 Read/Feed constraints in 2 ms returned sat
[2023-03-22 13:58:37] [INFO ] Computed and/alt/rep : 78/267/78 causal constraints (skipped 9 transitions) in 5 ms.
[2023-03-22 13:58:37] [INFO ] Added : 26 causal constraints over 6 iterations in 52 ms. Result :sat
Minimization took 33 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[1]
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 108/108 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 62/62 places, 108/108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 108/108 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2023-03-22 13:58:37] [INFO ] Flow matrix only has 90 transitions (discarded 18 similar events)
[2023-03-22 13:58:37] [INFO ] Invariant cache hit.
[2023-03-22 13:58:37] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-22 13:58:37] [INFO ] Flow matrix only has 90 transitions (discarded 18 similar events)
[2023-03-22 13:58:37] [INFO ] Invariant cache hit.
[2023-03-22 13:58:37] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-22 13:58:37] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2023-03-22 13:58:37] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 13:58:37] [INFO ] Flow matrix only has 90 transitions (discarded 18 similar events)
[2023-03-22 13:58:37] [INFO ] Invariant cache hit.
[2023-03-22 13:58:37] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 182 ms. Remains : 62/62 places, 108/108 transitions.
Ending property specific reduction for LamportFastMutEx-PT-3-UpperBounds-07 in 2053 ms.
[2023-03-22 13:58:38] [INFO ] Flatten gal took : 42 ms
[2023-03-22 13:58:38] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-22 13:58:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 62 places, 108 transitions and 468 arcs took 2 ms.
Total runtime 8939 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=UpperBounds.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: LamportFastMutEx_PT_3
(NrP: 62 NrTr: 108 NrArc: 468)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec

net check time: 0m 0.000sec

init dd package: 0m 2.778sec


RS generation: 0m 0.828sec


-> reachability set: #nodes 22594 (2.3e+04) #states 15,512 (4)



starting MCC model checker
--------------------------

checking: place_bound(p56,p57,p58)
normalized: place_bound(p56,p57,p58)

-> the formula is 1

FORMULA LamportFastMutEx-PT-3-UpperBounds-07 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

totally nodes used: 94362 (9.4e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 678188 3757914 4436102
used/not used/entry size/cache size: 3657752 63451112 16 1024MB
basic ops cache: hits/miss/sum: 1192 8950 10142
used/not used/entry size/cache size: 19631 16757585 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 3100 22598 25698
used/not used/entry size/cache size: 22584 8366024 32 256MB
max state cache: hits/miss/sum: 3100 22598 25698
used/not used/entry size/cache size: 22584 8366024 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 67019593
1 84503
2 4449
3 315
4 4
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 5.279sec


BK_STOP 1679493524344

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


iterations count:15048 (139), effective:483 (4)

initing FirstDep: 0m 0.000sec

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-3"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is LamportFastMutEx-PT-3, 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 r234-tall-167856420300405"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-PT-3.tgz
mv LamportFastMutEx-PT-3 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 ;