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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 24K Feb 25 13:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 163K Feb 25 13:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 43K Feb 25 13:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 228K Feb 25 13:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Feb 25 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 25K Feb 25 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 101K Feb 25 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Feb 25 13:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Feb 25 13:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 64K Feb 25 13:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 321K Feb 25 13:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.3K 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 329K 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 booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679503083890

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-PT-8
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 16:38:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 16:38:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 16:38:05] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2023-03-22 16:38:05] [INFO ] Transformed 315 places.
[2023-03-22 16:38:05] [INFO ] Transformed 666 transitions.
[2023-03-22 16:38:05] [INFO ] Found NUPN structural information;
[2023-03-22 16:38:05] [INFO ] Completing missing partition info from NUPN : creating a component with [P_start_1_0, P_start_1_1, P_start_1_2, P_start_1_3, P_start_1_4, P_start_1_5, P_start_1_6, P_start_1_7, P_start_1_8, P_b_0_false, P_b_0_true, P_b_1_false, P_b_1_true, P_b_2_false, P_b_2_true, P_b_3_false, P_b_3_true, P_b_4_false, P_b_4_true, P_b_5_false, P_b_5_true, P_b_6_false, P_b_6_true, P_b_7_false, P_b_7_true, P_b_8_false, P_b_8_true, P_setx_3_0, P_setx_3_1, P_setx_3_2, P_setx_3_3, P_setx_3_4, P_setx_3_5, P_setx_3_6, P_setx_3_7, P_setx_3_8, P_setbi_5_0, P_setbi_5_1, P_setbi_5_2, P_setbi_5_3, P_setbi_5_4, P_setbi_5_5, P_setbi_5_6, P_setbi_5_7, P_setbi_5_8, P_ify0_4_0, P_ify0_4_1, P_ify0_4_2, P_ify0_4_3, P_ify0_4_4, P_ify0_4_5, P_ify0_4_6, P_ify0_4_7, P_ify0_4_8, P_sety_9_0, P_sety_9_1, P_sety_9_2, P_sety_9_3, P_sety_9_4, P_sety_9_5, P_sety_9_6, P_sety_9_7, P_sety_9_8, P_ifxi_10_0, P_ifxi_10_1, P_ifxi_10_2, P_ifxi_10_3, P_ifxi_10_4, P_ifxi_10_5, P_ifxi_10_6, P_ifxi_10_7, P_ifxi_10_8, P_setbi_11_0, P_setbi_11_1, P_setbi_11_2, P_setbi_11_3, P_setbi_11_4, P_setbi_11_5, P_setbi_11_6, P_setbi_11_7, P_setbi_11_8, P_fordo_12_0, P_fordo_12_1, P_fordo_12_2, P_fordo_12_3, P_fordo_12_4, P_fordo_12_5, P_fordo_12_6, P_fordo_12_7, P_fordo_12_8, P_wait_0_0, P_wait_0_1, P_wait_0_2, P_wait_0_3, P_wait_0_4, P_wait_0_5, P_wait_0_6, P_wait_0_7, P_wait_0_8, P_wait_1_0, P_wait_1_1, P_wait_1_2, P_wait_1_3, P_wait_1_4, P_wait_1_5, P_wait_1_6, P_wait_1_7, P_wait_1_8, P_wait_2_0, P_wait_2_1, P_wait_2_2, P_wait_2_3, P_wait_2_4, P_wait_2_5, P_wait_2_6, P_wait_2_7, P_wait_2_8, P_wait_3_0, P_wait_3_1, P_wait_3_2, P_wait_3_3, P_wait_3_4, P_wait_3_5, P_wait_3_6, P_wait_3_7, P_wait_3_8, P_wait_4_0, P_wait_4_1, P_wait_4_2, P_wait_4_3, P_wait_4_4, P_wait_4_5, P_wait_4_6, P_wait_4_7, P_wait_4_8, P_wait_5_0, P_wait_5_1, P_wait_5_2, P_wait_5_3, P_wait_5_4, P_wait_5_5, P_wait_5_6, P_wait_5_7, P_wait_5_8, P_wait_6_0, P_wait_6_1, P_wait_6_2, P_wait_6_3, P_wait_6_4, P_wait_6_5, P_wait_6_6, P_wait_6_7, P_wait_6_8, P_wait_7_0, P_wait_7_1, P_wait_7_2, P_wait_7_3, P_wait_7_4, P_wait_7_5, P_wait_7_6, P_wait_7_7, P_wait_7_8, P_wait_8_0, P_wait_8_1, P_wait_8_2, P_wait_8_3, P_wait_8_4, P_wait_8_5, P_wait_8_6, P_wait_8_7, P_wait_8_8, P_await_13_0, P_await_13_1, P_await_13_2, P_await_13_3, P_await_13_4, P_await_13_5, P_await_13_6, P_await_13_7, P_await_13_8, P_done_0_0, P_done_0_1, P_done_0_2, P_done_0_3, P_done_0_4, P_done_0_5, P_done_0_6, P_done_0_7, P_done_0_8, P_done_1_0, P_done_1_1, P_done_1_2, P_done_1_3, P_done_1_4, P_done_1_5, P_done_1_6, P_done_1_7, P_done_1_8, P_done_2_0, P_done_2_1, P_done_2_2, P_done_2_3, P_done_2_4, P_done_2_5, P_done_2_6, P_done_2_7, P_done_2_8, P_done_3_0, P_done_3_1, P_done_3_2, P_done_3_3, P_done_3_4, P_done_3_5, P_done_3_6, P_done_3_7, P_done_3_8, P_done_4_0, P_done_4_1, P_done_4_2, P_done_4_3, P_done_4_4, P_done_4_5, P_done_4_6, P_done_4_7, P_done_4_8, P_done_5_0, P_done_5_1, P_done_5_2, P_done_5_3, P_done_5_4, P_done_5_5, P_done_5_6, P_done_5_7, P_done_5_8, P_done_6_0, P_done_6_1, P_done_6_2, P_done_6_3, P_done_6_4, P_done_6_5, P_done_6_6, P_done_6_7, P_done_6_8, P_done_7_0, P_done_7_1, P_done_7_2, P_done_7_3, P_done_7_4, P_done_7_5, P_done_7_6, P_done_7_7, P_done_7_8, P_done_8_0, P_done_8_1, P_done_8_2, P_done_8_3, P_done_8_4, P_done_8_5, P_done_8_6, P_done_8_7, P_done_8_8, P_ifyi_15_0, P_ifyi_15_1, P_ifyi_15_2, P_ifyi_15_3, P_ifyi_15_4, P_ifyi_15_5, P_ifyi_15_6, P_ifyi_15_7, P_ifyi_15_8, P_awaity_0, P_awaity_1, P_awaity_2, P_awaity_3, P_awaity_4, P_awaity_5, P_awaity_6, P_awaity_7, P_awaity_8, P_CS_21_0, P_CS_21_1, P_CS_21_2, P_CS_21_3, P_CS_21_4, P_CS_21_5, P_CS_21_6, P_CS_21_7, P_CS_21_8, P_setbi_24_0, P_setbi_24_1, P_setbi_24_2, P_setbi_24_3, P_setbi_24_4, P_setbi_24_5, P_setbi_24_6, P_setbi_24_7, P_setbi_24_8]
[2023-03-22 16:38:05] [INFO ] Parsed PT model containing 315 places and 666 transitions and 2934 arcs in 176 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 49 places in 3 ms
Reduce places removed 49 places and 82 transitions.
FORMULA LamportFastMutEx-PT-8-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-8-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 418 ms. (steps per millisecond=23 ) properties (out of 14) seen :9
FORMULA LamportFastMutEx-PT-8-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-8-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-8-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-8-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-8-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-8-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-8-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-8-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-8-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 339 ms. (steps per millisecond=29 ) properties (out of 5) seen :1
FORMULA LamportFastMutEx-PT-8-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-22 16:38:06] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2023-03-22 16:38:06] [INFO ] Computed 82 place invariants in 16 ms
[2023-03-22 16:38:06] [INFO ] [Real]Absence check using 82 positive place invariants in 20 ms returned sat
[2023-03-22 16:38:06] [INFO ] After 261ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2023-03-22 16:38:06] [INFO ] [Nat]Absence check using 82 positive place invariants in 22 ms returned sat
[2023-03-22 16:38:07] [INFO ] After 148ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2023-03-22 16:38:07] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 16:38:07] [INFO ] After 86ms SMT Verify possible using 112 Read/Feed constraints in natural domain returned unsat :2 sat :2
[2023-03-22 16:38:07] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 4 ms to minimize.
[2023-03-22 16:38:07] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2023-03-22 16:38:07] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2023-03-22 16:38:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 250 ms
[2023-03-22 16:38:07] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 1 ms to minimize.
[2023-03-22 16:38:07] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2023-03-22 16:38:07] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2023-03-22 16:38:07] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2023-03-22 16:38:07] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 1 ms to minimize.
[2023-03-22 16:38:07] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 0 ms to minimize.
[2023-03-22 16:38:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 471 ms
[2023-03-22 16:38:07] [INFO ] After 856ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-22 16:38:08] [INFO ] After 1140ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :1
FORMULA LamportFastMutEx-PT-8-ReachabilityFireability-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LamportFastMutEx-PT-8-ReachabilityFireability-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LamportFastMutEx-PT-8-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 266 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 584/584 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 258 transition count 576
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 24 place count 258 transition count 568
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 32 place count 250 transition count 568
Applied a total of 32 rules in 96 ms. Remains 250 /266 variables (removed 16) and now considering 568/584 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 250/266 places, 568/584 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1041783 steps, run timeout after 3001 ms. (steps per millisecond=347 ) properties seen :{}
Probabilistic random walk after 1041783 steps, saw 511821 distinct states, run finished after 3002 ms. (steps per millisecond=347 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 16:38:11] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
// Phase 1: matrix 400 rows 250 cols
[2023-03-22 16:38:11] [INFO ] Computed 82 place invariants in 14 ms
[2023-03-22 16:38:11] [INFO ] [Real]Absence check using 82 positive place invariants in 13 ms returned sat
[2023-03-22 16:38:11] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 16:38:11] [INFO ] [Nat]Absence check using 82 positive place invariants in 13 ms returned sat
[2023-03-22 16:38:11] [INFO ] After 90ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 16:38:11] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 16:38:11] [INFO ] After 31ms SMT Verify possible using 112 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 16:38:11] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 0 ms to minimize.
[2023-03-22 16:38:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2023-03-22 16:38:11] [INFO ] After 157ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-22 16:38:11] [INFO ] After 337ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 568/568 transitions.
Applied a total of 0 rules in 16 ms. Remains 250 /250 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 250/250 places, 568/568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 568/568 transitions.
Applied a total of 0 rules in 15 ms. Remains 250 /250 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2023-03-22 16:38:11] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 16:38:11] [INFO ] Invariant cache hit.
[2023-03-22 16:38:12] [INFO ] Implicit Places using invariants in 315 ms returned [154, 155, 156, 157, 158, 159, 160, 161]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 317 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 242/250 places, 568/568 transitions.
Applied a total of 0 rules in 14 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 346 ms. Remains : 242/250 places, 568/568 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1041897 steps, run timeout after 3001 ms. (steps per millisecond=347 ) properties seen :{}
Probabilistic random walk after 1041897 steps, saw 508849 distinct states, run finished after 3001 ms. (steps per millisecond=347 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 16:38:15] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
// Phase 1: matrix 400 rows 242 cols
[2023-03-22 16:38:15] [INFO ] Computed 74 place invariants in 10 ms
[2023-03-22 16:38:15] [INFO ] [Real]Absence check using 74 positive place invariants in 12 ms returned sat
[2023-03-22 16:38:15] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 16:38:15] [INFO ] [Nat]Absence check using 74 positive place invariants in 13 ms returned sat
[2023-03-22 16:38:15] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 16:38:15] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 16:38:15] [INFO ] After 38ms SMT Verify possible using 48 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 16:38:15] [INFO ] After 73ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-22 16:38:15] [INFO ] After 284ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 568/568 transitions.
Applied a total of 0 rules in 13 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 242/242 places, 568/568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 568/568 transitions.
Applied a total of 0 rules in 9 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2023-03-22 16:38:15] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 16:38:15] [INFO ] Invariant cache hit.
[2023-03-22 16:38:15] [INFO ] Implicit Places using invariants in 192 ms returned []
[2023-03-22 16:38:15] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 16:38:15] [INFO ] Invariant cache hit.
[2023-03-22 16:38:15] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 16:38:16] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 588 ms to find 0 implicit places.
[2023-03-22 16:38:16] [INFO ] Redundant transitions in 37 ms returned []
[2023-03-22 16:38:16] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 16:38:16] [INFO ] Invariant cache hit.
[2023-03-22 16:38:16] [INFO ] Dead Transitions using invariants and state equation in 236 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 882 ms. Remains : 242/242 places, 568/568 transitions.
Graph (trivial) has 262 edges and 242 vertex of which 68 / 242 are part of one of the 8 SCC in 4 ms
Free SCC test removed 60 places
Drop transitions removed 131 transitions
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 257 transitions.
Graph (complete) has 495 edges and 182 vertex of which 173 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 66 place count 173 transition count 247
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 64 Pre rules applied. Total rules applied 66 place count 173 transition count 183
Deduced a syphon composed of 64 places in 1 ms
Ensure Unique test removed 56 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 1 with 184 rules applied. Total rules applied 250 place count 53 transition count 183
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 264 place count 46 transition count 176
Graph (trivial) has 20 edges and 46 vertex of which 19 / 46 are part of one of the 8 SCC in 0 ms
Free SCC test removed 11 places
Discarding 14 places :
Also discarding 21 output transitions
Drop transitions removed 21 transitions
Remove reverse transitions (loop back) rule discarded transition T_setbi_24_4 and 14 places that fell out of Prefix Of Interest.
Iterating global reduction 1 with 2 rules applied. Total rules applied 266 place count 14 transition count 155
Drop transitions removed 19 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 69 transitions.
Graph (trivial) has 50 edges and 14 vertex of which 7 / 14 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Iterating post reduction 1 with 70 rules applied. Total rules applied 336 place count 8 transition count 86
Drop transitions removed 42 transitions
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 71 transitions.
Iterating post reduction 2 with 71 rules applied. Total rules applied 407 place count 8 transition count 15
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 409 place count 8 transition count 13
Applied a total of 409 rules in 30 ms. Remains 8 /242 variables (removed 234) and now considering 13/568 (removed 555) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 13 rows 8 cols
[2023-03-22 16:38:16] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-22 16:38:16] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-22 16:38:16] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 16:38:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-22 16:38:16] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 16:38:16] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-22 16:38:16] [INFO ] After 27ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 16:38:16] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2023-03-22 16:38:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 242 places, 568 transitions and 2888 arcs took 4 ms.
[2023-03-22 16:38:16] [INFO ] Flatten gal took : 75 ms
Total runtime 11443 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=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: LamportFastMutEx_PT_8
(NrP: 242 NrTr: 568 NrArc: 2888)

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

net check time: 0m 0.000sec

init dd package: 0m 2.674sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 8100248 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16099488 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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 ReachabilityFireability -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.001sec

22174 65471 93734 683665 848118 227788 218622 650170 2262132 2346017

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="LamportFastMutEx-PT-8"
export BK_EXAMINATION="ReachabilityFireability"
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-8, 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 r234-tall-167856420300447"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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