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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 30K Feb 25 13:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 198K Feb 25 13:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 30K Feb 25 13:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 165K Feb 25 13:41 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 13K Feb 25 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Feb 25 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 25 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 38K Feb 25 13:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 240K Feb 25 13:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 93K Feb 25 13:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 499K Feb 25 13:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.4K 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 265K 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-7-CTLCardinality-00
FORMULA_NAME LamportFastMutEx-PT-7-CTLCardinality-01
FORMULA_NAME LamportFastMutEx-PT-7-CTLCardinality-02
FORMULA_NAME LamportFastMutEx-PT-7-CTLCardinality-03
FORMULA_NAME LamportFastMutEx-PT-7-CTLCardinality-04
FORMULA_NAME LamportFastMutEx-PT-7-CTLCardinality-05
FORMULA_NAME LamportFastMutEx-PT-7-CTLCardinality-06
FORMULA_NAME LamportFastMutEx-PT-7-CTLCardinality-07
FORMULA_NAME LamportFastMutEx-PT-7-CTLCardinality-08
FORMULA_NAME LamportFastMutEx-PT-7-CTLCardinality-09
FORMULA_NAME LamportFastMutEx-PT-7-CTLCardinality-10
FORMULA_NAME LamportFastMutEx-PT-7-CTLCardinality-11
FORMULA_NAME LamportFastMutEx-PT-7-CTLCardinality-12
FORMULA_NAME LamportFastMutEx-PT-7-CTLCardinality-13
FORMULA_NAME LamportFastMutEx-PT-7-CTLCardinality-14
FORMULA_NAME LamportFastMutEx-PT-7-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679498476890

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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-PT-7
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 15:21:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 15:21:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 15:21:18] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2023-03-22 15:21:18] [INFO ] Transformed 264 places.
[2023-03-22 15:21:18] [INFO ] Transformed 536 transitions.
[2023-03-22 15:21:18] [INFO ] Found NUPN structural information;
[2023-03-22 15:21:18] [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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_awaity_0, P_awaity_1, P_awaity_2, P_awaity_3, P_awaity_4, P_awaity_5, P_awaity_6, P_awaity_7, 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_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]
[2023-03-22 15:21:18] [INFO ] Parsed PT model containing 264 places and 536 transitions and 2352 arcs in 133 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 18 ms.
Deduced a syphon composed of 45 places in 3 ms
Reduce places removed 45 places and 74 transitions.
Support contains 191 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 18 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 15:21:18] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2023-03-22 15:21:18] [INFO ] Computed 65 place invariants in 22 ms
[2023-03-22 15:21:18] [INFO ] Implicit Places using invariants in 265 ms returned []
[2023-03-22 15:21:18] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 15:21:18] [INFO ] Invariant cache hit.
[2023-03-22 15:21:18] [INFO ] State equation strengthened by 91 read => feed constraints.
[2023-03-22 15:21:19] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 536 ms to find 0 implicit places.
[2023-03-22 15:21:19] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 15:21:19] [INFO ] Invariant cache hit.
[2023-03-22 15:21:19] [INFO ] Dead Transitions using invariants and state equation in 236 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 794 ms. Remains : 219/219 places, 462/462 transitions.
Support contains 191 out of 219 places after structural reductions.
[2023-03-22 15:21:19] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-22 15:21:19] [INFO ] Flatten gal took : 67 ms
[2023-03-22 15:21:19] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA LamportFastMutEx-PT-7-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-7-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-7-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-22 15:21:19] [INFO ] Flatten gal took : 31 ms
[2023-03-22 15:21:19] [INFO ] Input system was already deterministic with 462 transitions.
Support contains 190 out of 219 places (down from 191) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 591 ms. (steps per millisecond=16 ) properties (out of 66) seen :23
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 43) seen :0
Running SMT prover for 43 properties.
[2023-03-22 15:21:20] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 15:21:20] [INFO ] Invariant cache hit.
[2023-03-22 15:21:21] [INFO ] [Real]Absence check using 65 positive place invariants in 11 ms returned sat
[2023-03-22 15:21:21] [INFO ] After 459ms SMT Verify possible using all constraints in real domain returned unsat :39 sat :0 real:4
[2023-03-22 15:21:21] [INFO ] [Nat]Absence check using 65 positive place invariants in 36 ms returned sat
[2023-03-22 15:21:21] [INFO ] After 270ms SMT Verify possible using state equation in natural domain returned unsat :39 sat :4
[2023-03-22 15:21:21] [INFO ] State equation strengthened by 91 read => feed constraints.
[2023-03-22 15:21:21] [INFO ] After 140ms SMT Verify possible using 91 Read/Feed constraints in natural domain returned unsat :39 sat :4
[2023-03-22 15:21:22] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 5 ms to minimize.
[2023-03-22 15:21:22] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 4 ms to minimize.
[2023-03-22 15:21:22] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2023-03-22 15:21:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 300 ms
[2023-03-22 15:21:22] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2023-03-22 15:21:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2023-03-22 15:21:22] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2023-03-22 15:21:22] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2023-03-22 15:21:22] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2023-03-22 15:21:22] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2023-03-22 15:21:22] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2023-03-22 15:21:22] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 0 ms to minimize.
[2023-03-22 15:21:23] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 0 ms to minimize.
[2023-03-22 15:21:23] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 0 ms to minimize.
[2023-03-22 15:21:23] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2023-03-22 15:21:23] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 707 ms
[2023-03-22 15:21:23] [INFO ] After 1380ms SMT Verify possible using trap constraints in natural domain returned unsat :39 sat :4
Attempting to minimize the solution found.
Minimization took 125 ms.
[2023-03-22 15:21:23] [INFO ] After 2043ms SMT Verify possible using all constraints in natural domain returned unsat :39 sat :4
Fused 43 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 51 ms.
Support contains 112 out of 219 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 20 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 219/219 places, 462/462 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-22 15:21:23] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 15:21:23] [INFO ] Invariant cache hit.
[2023-03-22 15:21:23] [INFO ] [Real]Absence check using 65 positive place invariants in 10 ms returned sat
[2023-03-22 15:21:23] [INFO ] After 150ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 15:21:23] [INFO ] [Nat]Absence check using 65 positive place invariants in 11 ms returned sat
[2023-03-22 15:21:23] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 15:21:23] [INFO ] State equation strengthened by 91 read => feed constraints.
[2023-03-22 15:21:23] [INFO ] After 51ms SMT Verify possible using 91 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 15:21:24] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 0 ms to minimize.
[2023-03-22 15:21:24] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 0 ms to minimize.
[2023-03-22 15:21:24] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2023-03-22 15:21:24] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2023-03-22 15:21:24] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 0 ms to minimize.
[2023-03-22 15:21:24] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2023-03-22 15:21:24] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2023-03-22 15:21:24] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2023-03-22 15:21:24] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2023-03-22 15:21:24] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2023-03-22 15:21:24] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2023-03-22 15:21:24] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2023-03-22 15:21:24] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 852 ms
[2023-03-22 15:21:24] [INFO ] After 929ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-22 15:21:24] [INFO ] After 1111ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 49 out of 219 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 462/462 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 219 transition count 455
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 212 transition count 455
Applied a total of 14 rules in 41 ms. Remains 212 /219 variables (removed 7) and now considering 455/462 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 212/219 places, 455/462 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1082839 steps, run timeout after 3001 ms. (steps per millisecond=360 ) properties seen :{}
Probabilistic random walk after 1082839 steps, saw 464090 distinct states, run finished after 3002 ms. (steps per millisecond=360 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 15:21:28] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
// Phase 1: matrix 329 rows 212 cols
[2023-03-22 15:21:28] [INFO ] Computed 65 place invariants in 12 ms
[2023-03-22 15:21:28] [INFO ] [Real]Absence check using 65 positive place invariants in 10 ms returned sat
[2023-03-22 15:21:28] [INFO ] After 157ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 15:21:28] [INFO ] [Nat]Absence check using 65 positive place invariants in 11 ms returned sat
[2023-03-22 15:21:28] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 15:21:28] [INFO ] State equation strengthened by 91 read => feed constraints.
[2023-03-22 15:21:28] [INFO ] After 43ms SMT Verify possible using 91 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 15:21:28] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 0 ms to minimize.
[2023-03-22 15:21:28] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 0 ms to minimize.
[2023-03-22 15:21:28] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 0 ms to minimize.
[2023-03-22 15:21:28] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 2 ms to minimize.
[2023-03-22 15:21:28] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 0 ms to minimize.
[2023-03-22 15:21:29] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 0 ms to minimize.
[2023-03-22 15:21:29] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 0 ms to minimize.
[2023-03-22 15:21:29] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 1 ms to minimize.
[2023-03-22 15:21:29] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2023-03-22 15:21:29] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 0 ms to minimize.
[2023-03-22 15:21:29] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 0 ms to minimize.
[2023-03-22 15:21:29] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 0 ms to minimize.
[2023-03-22 15:21:29] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2023-03-22 15:21:29] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1254 ms
[2023-03-22 15:21:29] [INFO ] After 1320ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-22 15:21:29] [INFO ] After 1520ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 49 out of 212 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 455/455 transitions.
Applied a total of 0 rules in 13 ms. Remains 212 /212 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 212/212 places, 455/455 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 455/455 transitions.
Applied a total of 0 rules in 16 ms. Remains 212 /212 variables (removed 0) and now considering 455/455 (removed 0) transitions.
[2023-03-22 15:21:29] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 15:21:29] [INFO ] Invariant cache hit.
[2023-03-22 15:21:30] [INFO ] Implicit Places using invariants in 417 ms returned [135, 136, 137, 138, 139, 140, 141]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 419 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 205/212 places, 455/455 transitions.
Applied a total of 0 rules in 13 ms. Remains 205 /205 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 448 ms. Remains : 205/212 places, 455/455 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 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1102185 steps, run timeout after 3001 ms. (steps per millisecond=367 ) properties seen :{}
Probabilistic random walk after 1102185 steps, saw 474224 distinct states, run finished after 3001 ms. (steps per millisecond=367 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 15:21:33] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
// Phase 1: matrix 329 rows 205 cols
[2023-03-22 15:21:33] [INFO ] Computed 58 place invariants in 8 ms
[2023-03-22 15:21:33] [INFO ] [Real]Absence check using 58 positive place invariants in 9 ms returned sat
[2023-03-22 15:21:33] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 15:21:33] [INFO ] [Nat]Absence check using 58 positive place invariants in 9 ms returned sat
[2023-03-22 15:21:33] [INFO ] After 86ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 15:21:33] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 15:21:33] [INFO ] After 34ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 15:21:33] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 0 ms to minimize.
[2023-03-22 15:21:33] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 0 ms to minimize.
[2023-03-22 15:21:33] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 0 ms to minimize.
[2023-03-22 15:21:33] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2023-03-22 15:21:34] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 1 ms to minimize.
[2023-03-22 15:21:34] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2023-03-22 15:21:34] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2023-03-22 15:21:34] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 0 ms to minimize.
[2023-03-22 15:21:34] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2023-03-22 15:21:34] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2023-03-22 15:21:34] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 0 ms to minimize.
[2023-03-22 15:21:34] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 0 ms to minimize.
[2023-03-22 15:21:34] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 0 ms to minimize.
[2023-03-22 15:21:34] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2023-03-22 15:21:34] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2023-03-22 15:21:34] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1256 ms
[2023-03-22 15:21:34] [INFO ] After 1310ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-22 15:21:34] [INFO ] After 1494ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 49 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 455/455 transitions.
Applied a total of 0 rules in 12 ms. Remains 205 /205 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 205/205 places, 455/455 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 455/455 transitions.
Applied a total of 0 rules in 9 ms. Remains 205 /205 variables (removed 0) and now considering 455/455 (removed 0) transitions.
[2023-03-22 15:21:34] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 15:21:34] [INFO ] Invariant cache hit.
[2023-03-22 15:21:35] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-22 15:21:35] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 15:21:35] [INFO ] Invariant cache hit.
[2023-03-22 15:21:35] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 15:21:35] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
[2023-03-22 15:21:35] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-22 15:21:35] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 15:21:35] [INFO ] Invariant cache hit.
[2023-03-22 15:21:35] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 698 ms. Remains : 205/205 places, 455/455 transitions.
Graph (trivial) has 168 edges and 205 vertex of which 63 / 205 are part of one of the 7 SCC in 3 ms
Free SCC test removed 56 places
Drop transitions removed 112 transitions
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 210 transitions.
Graph (complete) has 329 edges and 149 vertex of which 133 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.2 ms
Discarding 16 places :
Also discarding 0 output transitions
Drop transitions removed 147 transitions
Reduce isomorphic transitions removed 147 transitions.
Iterating post reduction 0 with 147 rules applied. Total rules applied 149 place count 133 transition count 98
Free-agglomeration rule applied 7 times.
Iterating global reduction 1 with 7 rules applied. Total rules applied 156 place count 133 transition count 91
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 163 place count 126 transition count 91
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 170 place count 126 transition count 84
Graph (complete) has 182 edges and 126 vertex of which 112 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Discarding 14 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 1 rules applied. Total rules applied 171 place count 112 transition count 84
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 185 place count 112 transition count 70
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 185 place count 112 transition count 63
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 199 place count 105 transition count 63
Applied a total of 199 rules in 32 ms. Remains 105 /205 variables (removed 100) and now considering 63/455 (removed 392) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 63 rows 105 cols
[2023-03-22 15:21:35] [INFO ] Computed 49 place invariants in 2 ms
[2023-03-22 15:21:35] [INFO ] [Real]Absence check using 49 positive place invariants in 5 ms returned sat
[2023-03-22 15:21:35] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 15:21:35] [INFO ] [Nat]Absence check using 49 positive place invariants in 5 ms returned sat
[2023-03-22 15:21:35] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 15:21:35] [INFO ] After 43ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-22 15:21:35] [INFO ] After 107ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Successfully simplified 39 atomic propositions for a total of 13 simplifications.
FORMULA LamportFastMutEx-PT-7-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-7-CTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-7-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-22 15:21:35] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-22 15:21:35] [INFO ] Flatten gal took : 24 ms
FORMULA LamportFastMutEx-PT-7-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-7-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-22 15:21:35] [INFO ] Flatten gal took : 25 ms
[2023-03-22 15:21:35] [INFO ] Input system was already deterministic with 462 transitions.
Support contains 80 out of 219 places (down from 92) after GAL structural reductions.
Computed a total of 1 stabilizing places and 7 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 2 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 219/219 places, 462/462 transitions.
[2023-03-22 15:21:35] [INFO ] Flatten gal took : 20 ms
[2023-03-22 15:21:35] [INFO ] Flatten gal took : 21 ms
[2023-03-22 15:21:36] [INFO ] Input system was already deterministic with 462 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 212 transition count 455
Applied a total of 14 rules in 16 ms. Remains 212 /219 variables (removed 7) and now considering 455/462 (removed 7) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16 ms. Remains : 212/219 places, 455/462 transitions.
[2023-03-22 15:21:36] [INFO ] Flatten gal took : 18 ms
[2023-03-22 15:21:36] [INFO ] Flatten gal took : 18 ms
[2023-03-22 15:21:36] [INFO ] Input system was already deterministic with 455 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 219/219 places, 462/462 transitions.
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 0 with 14 rules applied. Total rules applied 14 place count 212 transition count 455
Applied a total of 14 rules in 15 ms. Remains 212 /219 variables (removed 7) and now considering 455/462 (removed 7) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16 ms. Remains : 212/219 places, 455/462 transitions.
[2023-03-22 15:21:36] [INFO ] Flatten gal took : 16 ms
[2023-03-22 15:21:36] [INFO ] Flatten gal took : 17 ms
[2023-03-22 15:21:36] [INFO ] Input system was already deterministic with 455 transitions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 1 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 219/219 places, 462/462 transitions.
[2023-03-22 15:21:36] [INFO ] Flatten gal took : 16 ms
[2023-03-22 15:21:36] [INFO ] Flatten gal took : 17 ms
[2023-03-22 15:21:36] [INFO ] Input system was already deterministic with 462 transitions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 1 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 219/219 places, 462/462 transitions.
[2023-03-22 15:21:36] [INFO ] Flatten gal took : 16 ms
[2023-03-22 15:21:36] [INFO ] Flatten gal took : 17 ms
[2023-03-22 15:21:36] [INFO ] Input system was already deterministic with 462 transitions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 1 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 219/219 places, 462/462 transitions.
[2023-03-22 15:21:36] [INFO ] Flatten gal took : 14 ms
[2023-03-22 15:21:36] [INFO ] Flatten gal took : 15 ms
[2023-03-22 15:21:36] [INFO ] Input system was already deterministic with 462 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 214 transition count 457
Applied a total of 10 rules in 12 ms. Remains 214 /219 variables (removed 5) and now considering 457/462 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 214/219 places, 457/462 transitions.
[2023-03-22 15:21:36] [INFO ] Flatten gal took : 13 ms
[2023-03-22 15:21:36] [INFO ] Flatten gal took : 14 ms
[2023-03-22 15:21:36] [INFO ] Input system was already deterministic with 457 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 213 transition count 456
Applied a total of 12 rules in 12 ms. Remains 213 /219 variables (removed 6) and now considering 456/462 (removed 6) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 213/219 places, 456/462 transitions.
[2023-03-22 15:21:36] [INFO ] Flatten gal took : 13 ms
[2023-03-22 15:21:36] [INFO ] Flatten gal took : 14 ms
[2023-03-22 15:21:36] [INFO ] Input system was already deterministic with 456 transitions.
[2023-03-22 15:21:36] [INFO ] Flatten gal took : 14 ms
[2023-03-22 15:21:36] [INFO ] Flatten gal took : 13 ms
[2023-03-22 15:21:36] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-03-22 15:21:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 219 places, 462 transitions and 2016 arcs took 3 ms.
Total runtime 18277 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=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 219 NrTr: 462 NrArc: 2016)

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

net check time: 0m 0.000sec

init dd package: 0m 2.705sec


before gc: list nodes free: 1743306

after gc: idd nodes used:639969, unused:63360031; list nodes free:276074730
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6362048 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16100432 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 CTLCardinality -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

19727 51901 50039 86257 85346 178993 250642 236788 208580 217916 297233 470022 483587 480055 503962 488820 503987 543317 527345 459297 635338 629338 577288 597005 661573 668249 625307 623699 595274 601404 603553 608825 596505 634987 638571 644418 669162 682138 686357 698031 704198 755924 761438 780129 1452373 1752832

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-7"
export BK_EXAMINATION="CTLCardinality"
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-7, examination is CTLCardinality"
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-167856420300433"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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