About the Execution of Marcie+red for LamportFastMutEx-PT-2
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5449.623 | 9752.00 | 14754.00 | 355.50 | TFTFTFFFTFTFTTTF | normal |
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-167856420200393.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-2, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856420200393
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 708K
-rw-r--r-- 1 mcc users 13K Feb 25 13:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 25 13:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 13:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 25 13:42 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 5.7K Feb 25 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Feb 25 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Feb 25 13:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 154K Feb 25 13:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 21K Feb 25 13:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 133K Feb 25 13:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.8K 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 48K 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-2-CTLCardinality-00
FORMULA_NAME LamportFastMutEx-PT-2-CTLCardinality-01
FORMULA_NAME LamportFastMutEx-PT-2-CTLCardinality-02
FORMULA_NAME LamportFastMutEx-PT-2-CTLCardinality-03
FORMULA_NAME LamportFastMutEx-PT-2-CTLCardinality-04
FORMULA_NAME LamportFastMutEx-PT-2-CTLCardinality-05
FORMULA_NAME LamportFastMutEx-PT-2-CTLCardinality-06
FORMULA_NAME LamportFastMutEx-PT-2-CTLCardinality-07
FORMULA_NAME LamportFastMutEx-PT-2-CTLCardinality-08
FORMULA_NAME LamportFastMutEx-PT-2-CTLCardinality-09
FORMULA_NAME LamportFastMutEx-PT-2-CTLCardinality-10
FORMULA_NAME LamportFastMutEx-PT-2-CTLCardinality-11
FORMULA_NAME LamportFastMutEx-PT-2-CTLCardinality-12
FORMULA_NAME LamportFastMutEx-PT-2-CTLCardinality-13
FORMULA_NAME LamportFastMutEx-PT-2-CTLCardinality-14
FORMULA_NAME LamportFastMutEx-PT-2-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679493352987
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-2
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 13:55:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 13:55:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 13:55:54] [INFO ] Load time of PNML (sax parser for PT used): 35 ms
[2023-03-22 13:55:54] [INFO ] Transformed 69 places.
[2023-03-22 13:55:54] [INFO ] Transformed 96 transitions.
[2023-03-22 13:55:54] [INFO ] Found NUPN structural information;
[2023-03-22 13:55:54] [INFO ] Completing missing partition info from NUPN : creating a component with [P_start_1_0, P_start_1_1, P_start_1_2, 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_setx_3_0, P_setx_3_1, P_setx_3_2, P_setbi_5_0, P_setbi_5_1, P_setbi_5_2, P_ify0_4_0, P_ify0_4_1, P_ify0_4_2, P_sety_9_0, P_sety_9_1, P_sety_9_2, P_ifxi_10_0, P_ifxi_10_1, P_ifxi_10_2, P_setbi_11_0, P_setbi_11_1, P_setbi_11_2, P_fordo_12_0, P_fordo_12_1, P_fordo_12_2, P_wait_0_0, P_wait_0_1, P_wait_0_2, P_wait_1_0, P_wait_1_1, P_wait_1_2, P_wait_2_0, P_wait_2_1, P_wait_2_2, P_await_13_0, P_await_13_1, P_await_13_2, P_done_0_0, P_done_0_1, P_done_0_2, P_done_1_0, P_done_1_1, P_done_1_2, P_done_2_0, P_done_2_1, P_done_2_2, P_ifyi_15_0, P_ifyi_15_1, P_ifyi_15_2, P_awaity_0, P_awaity_1, P_awaity_2, P_CS_21_0, P_CS_21_1, P_CS_21_2, P_setbi_24_0, P_setbi_24_1, P_setbi_24_2]
[2023-03-22 13:55:54] [INFO ] Parsed PT model containing 69 places and 96 transitions and 402 arcs in 96 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 34 transitions.
FORMULA LamportFastMutEx-PT-2-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-2-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-2-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 62/62 transitions.
Applied a total of 0 rules in 7 ms. Remains 44 /44 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2023-03-22 13:55:54] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
// Phase 1: matrix 56 rows 44 cols
[2023-03-22 13:55:54] [INFO ] Computed 10 place invariants in 10 ms
[2023-03-22 13:55:54] [INFO ] Implicit Places using invariants in 359 ms returned []
[2023-03-22 13:55:54] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
[2023-03-22 13:55:54] [INFO ] Invariant cache hit.
[2023-03-22 13:55:55] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-22 13:55:55] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
[2023-03-22 13:55:55] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
[2023-03-22 13:55:55] [INFO ] Invariant cache hit.
[2023-03-22 13:55:55] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 516 ms. Remains : 44/44 places, 62/62 transitions.
Support contains 36 out of 44 places after structural reductions.
[2023-03-22 13:55:55] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-22 13:55:55] [INFO ] Flatten gal took : 25 ms
FORMULA LamportFastMutEx-PT-2-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-22 13:55:55] [INFO ] Flatten gal took : 9 ms
[2023-03-22 13:55:55] [INFO ] Input system was already deterministic with 62 transitions.
Support contains 34 out of 44 places (down from 36) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 533 ms. (steps per millisecond=18 ) properties (out of 47) seen :20
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 27) 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 27) 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 27) 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 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) 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 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) 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 27) 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 27) 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 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) 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 27) 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 27) 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 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) 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 27) 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 27) 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 27) 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 27) 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 27) seen :0
Running SMT prover for 27 properties.
[2023-03-22 13:55:56] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
[2023-03-22 13:55:56] [INFO ] Invariant cache hit.
[2023-03-22 13:55:56] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-22 13:55:56] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :25 sat :0 real:2
[2023-03-22 13:55:56] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2023-03-22 13:55:56] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :25 sat :2
[2023-03-22 13:55:56] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-22 13:55:56] [INFO ] After 18ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :25 sat :2
[2023-03-22 13:55:56] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 2 ms to minimize.
[2023-03-22 13:55:56] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2023-03-22 13:55:56] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2023-03-22 13:55:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 89 ms
[2023-03-22 13:55:56] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2023-03-22 13:55:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2023-03-22 13:55:56] [INFO ] After 149ms SMT Verify possible using trap constraints in natural domain returned unsat :26 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-22 13:55:56] [INFO ] After 231ms SMT Verify possible using all constraints in natural domain returned unsat :26 sat :1
Fused 27 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 44 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 44/44 places, 62/62 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 44 transition count 60
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 42 transition count 60
Applied a total of 4 rules in 9 ms. Remains 42 /44 variables (removed 2) and now considering 60/62 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 42/44 places, 60/62 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Probably explored full state space saw : 356 states, properties seen :0
Probabilistic random walk after 1026 steps, saw 356 distinct states, run finished after 15 ms. (steps per millisecond=68 ) properties seen :0
Explored full state space saw : 356 states, properties seen :0
Exhaustive walk after 1026 steps, saw 356 distinct states, run finished after 3 ms. (steps per millisecond=342 ) properties seen :0
Successfully simplified 27 atomic propositions for a total of 11 simplifications.
FORMULA LamportFastMutEx-PT-2-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-22 13:55:56] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-22 13:55:56] [INFO ] Flatten gal took : 5 ms
FORMULA LamportFastMutEx-PT-2-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-2-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-22 13:55:56] [INFO ] Flatten gal took : 4 ms
[2023-03-22 13:55:56] [INFO ] Input system was already deterministic with 62 transitions.
Support contains 25 out of 44 places (down from 30) after GAL structural reductions.
Computed a total of 1 stabilizing places and 2 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 44/44 places, 62/62 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 42 transition count 60
Applied a total of 4 rules in 4 ms. Remains 42 /44 variables (removed 2) and now considering 60/62 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 42/44 places, 60/62 transitions.
[2023-03-22 13:55:56] [INFO ] Flatten gal took : 4 ms
[2023-03-22 13:55:56] [INFO ] Flatten gal took : 4 ms
[2023-03-22 13:55:56] [INFO ] Input system was already deterministic with 60 transitions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 62/62 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 44/44 places, 62/62 transitions.
[2023-03-22 13:55:56] [INFO ] Flatten gal took : 4 ms
[2023-03-22 13:55:56] [INFO ] Flatten gal took : 4 ms
[2023-03-22 13:55:56] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 62/62 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 44/44 places, 62/62 transitions.
[2023-03-22 13:55:56] [INFO ] Flatten gal took : 3 ms
[2023-03-22 13:55:56] [INFO ] Flatten gal took : 4 ms
[2023-03-22 13:55:56] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 62/62 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 44/44 places, 62/62 transitions.
[2023-03-22 13:55:56] [INFO ] Flatten gal took : 3 ms
[2023-03-22 13:55:56] [INFO ] Flatten gal took : 4 ms
[2023-03-22 13:55:56] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 62/62 transitions.
Applied a total of 0 rules in 0 ms. Remains 44 /44 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 44/44 places, 62/62 transitions.
[2023-03-22 13:55:56] [INFO ] Flatten gal took : 3 ms
[2023-03-22 13:55:56] [INFO ] Flatten gal took : 3 ms
[2023-03-22 13:55:56] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 62/62 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 44/44 places, 62/62 transitions.
[2023-03-22 13:55:56] [INFO ] Flatten gal took : 3 ms
[2023-03-22 13:55:56] [INFO ] Flatten gal took : 3 ms
[2023-03-22 13:55:56] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 44/44 places, 62/62 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 43 transition count 61
Applied a total of 2 rules in 3 ms. Remains 43 /44 variables (removed 1) and now considering 61/62 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 43/44 places, 61/62 transitions.
[2023-03-22 13:55:56] [INFO ] Flatten gal took : 3 ms
[2023-03-22 13:55:56] [INFO ] Flatten gal took : 3 ms
[2023-03-22 13:55:56] [INFO ] Input system was already deterministic with 61 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 44/44 places, 62/62 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 42 transition count 60
Applied a total of 4 rules in 3 ms. Remains 42 /44 variables (removed 2) and now considering 60/62 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 42/44 places, 60/62 transitions.
[2023-03-22 13:55:56] [INFO ] Flatten gal took : 3 ms
[2023-03-22 13:55:56] [INFO ] Flatten gal took : 3 ms
[2023-03-22 13:55:56] [INFO ] Input system was already deterministic with 60 transitions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 62/62 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 44/44 places, 62/62 transitions.
[2023-03-22 13:55:56] [INFO ] Flatten gal took : 3 ms
[2023-03-22 13:55:56] [INFO ] Flatten gal took : 3 ms
[2023-03-22 13:55:56] [INFO ] Input system was already deterministic with 62 transitions.
[2023-03-22 13:55:56] [INFO ] Flatten gal took : 3 ms
[2023-03-22 13:55:56] [INFO ] Flatten gal took : 4 ms
[2023-03-22 13:55:56] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-03-22 13:55:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 44 places, 62 transitions and 256 arcs took 1 ms.
Total runtime 2328 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: 44 NrTr: 62 NrArc: 256)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.907sec
RS generation: 0m 0.010sec
-> reachability set: #nodes 372 (3.7e+02) #states 380
starting MCC model checker
--------------------------
checking: AF [AX [1<=0]]
normalized: ~ [EG [EX [~ [1<=0]]]]
abstracting: (1<=0)
states: 0
.
EG iterations: 0
-> the formula is FALSE
FORMULA LamportFastMutEx-PT-2-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.038sec
checking: AG [EX [0<=0]]
normalized: ~ [E [true U ~ [EX [0<=0]]]]
abstracting: (0<=0)
states: 380
.-> the formula is TRUE
FORMULA LamportFastMutEx-PT-2-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [EG [AG [sum(p39, p38)<=sum(p17, p16)]]]
normalized: E [true U EG [~ [E [true U ~ [sum(p39, p38)<=sum(p17, p16)]]]]]
abstracting: (sum(p39, p38)<=sum(p17, p16))
states: 340
.
EG iterations: 1
-> the formula is FALSE
FORMULA LamportFastMutEx-PT-2-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.051sec
checking: AX [~ [A [AX [[p24<=0 & 0<=p24]] U ~ [[p0<=0 & 0<=p0]]]]]
normalized: ~ [EX [[~ [EG [[p0<=0 & 0<=p0]]] & ~ [E [[p0<=0 & 0<=p0] U [EX [~ [[p24<=0 & 0<=p24]]] & [p0<=0 & 0<=p0]]]]]]]
abstracting: (0<=p0)
states: 380
abstracting: (p0<=0)
states: 344
abstracting: (0<=p24)
states: 380
abstracting: (p24<=0)
states: 364
.abstracting: (0<=p0)
states: 380
abstracting: (p0<=0)
states: 344
abstracting: (0<=p0)
states: 380
abstracting: (p0<=0)
states: 344
...........
EG iterations: 11
.-> the formula is FALSE
FORMULA LamportFastMutEx-PT-2-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.025sec
checking: E [EX [0<=0] U EX [AG [[[p36<=1 & 1<=p36] & [p28<=0 & 0<=p28]]]]]
normalized: E [EX [0<=0] U EX [~ [E [true U ~ [[[p28<=0 & 0<=p28] & [p36<=1 & 1<=p36]]]]]]]
abstracting: (1<=p36)
states: 12
abstracting: (p36<=1)
states: 380
abstracting: (0<=p28)
states: 380
abstracting: (p28<=0)
states: 348
.abstracting: (0<=0)
states: 380
.-> the formula is FALSE
FORMULA LamportFastMutEx-PT-2-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: EX [EX [[AX [1<=0] | AG [[[p25<=0 & 0<=p25] | [p18<=1 & 1<=p18]]]]]]
normalized: EX [EX [[~ [E [true U ~ [[[p18<=1 & 1<=p18] | [p25<=0 & 0<=p25]]]]] | ~ [EX [~ [1<=0]]]]]]
abstracting: (1<=0)
states: 0
.abstracting: (0<=p25)
states: 380
abstracting: (p25<=0)
states: 364
abstracting: (1<=p18)
states: 28
abstracting: (p18<=1)
states: 380
..-> the formula is FALSE
FORMULA LamportFastMutEx-PT-2-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.016sec
checking: EF [[A [[p31<=1 & 1<=p31] U [p14<=1 & 1<=p14]] & ~ [[p0<=1 & 1<=p0]]]]
normalized: E [true U [~ [[p0<=1 & 1<=p0]] & [~ [EG [~ [[p14<=1 & 1<=p14]]]] & ~ [E [~ [[p14<=1 & 1<=p14]] U [~ [[p31<=1 & 1<=p31]] & ~ [[p14<=1 & 1<=p14]]]]]]]]
abstracting: (1<=p14)
states: 21
abstracting: (p14<=1)
states: 380
abstracting: (1<=p31)
states: 56
abstracting: (p31<=1)
states: 380
abstracting: (1<=p14)
states: 21
abstracting: (p14<=1)
states: 380
abstracting: (1<=p14)
states: 21
abstracting: (p14<=1)
states: 380
.......
EG iterations: 7
abstracting: (1<=p0)
states: 36
abstracting: (p0<=1)
states: 380
-> the formula is TRUE
FORMULA LamportFastMutEx-PT-2-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.030sec
checking: AF [[A [EF [~ [[p1<=1 & 1<=p1]]] U EF [[p39<=1 & 1<=p39]]] | [EG [[p0<=0 & 0<=p0]] | [p38<=1 & 1<=p38]]]]
normalized: ~ [EG [~ [[[[p38<=1 & 1<=p38] | EG [[p0<=0 & 0<=p0]]] | [~ [EG [~ [E [true U [p39<=1 & 1<=p39]]]]] & ~ [E [~ [E [true U [p39<=1 & 1<=p39]]] U [~ [E [true U ~ [[p1<=1 & 1<=p1]]]] & ~ [E [true U [p39<=1 & 1<=p39]]]]]]]]]]]
abstracting: (1<=p39)
states: 21
abstracting: (p39<=1)
states: 380
abstracting: (1<=p1)
states: 36
abstracting: (p1<=1)
states: 380
abstracting: (1<=p39)
states: 21
abstracting: (p39<=1)
states: 380
abstracting: (1<=p39)
states: 21
abstracting: (p39<=1)
states: 380
.
EG iterations: 1
abstracting: (0<=p0)
states: 380
abstracting: (p0<=0)
states: 344
...........
EG iterations: 11
abstracting: (1<=p38)
states: 21
abstracting: (p38<=1)
states: 380
.
EG iterations: 1
-> the formula is TRUE
FORMULA LamportFastMutEx-PT-2-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.013sec
checking: [EF [[[sum(p43, p42)<=7 & sum(p21, p20)<=sum(p23, p22)] | 73<=sum(p15, p14)]] & [EF [EG [~ [sum(p29, p28, p27, p26)<=sum(p41, p40)]]] & [EX [0<=0] | AX [1<=0]]]]
normalized: [[E [true U EG [~ [sum(p29, p28, p27, p26)<=sum(p41, p40)]]] & [EX [0<=0] | ~ [EX [~ [1<=0]]]]] & E [true U [73<=sum(p15, p14) | [sum(p43, p42)<=7 & sum(p21, p20)<=sum(p23, p22)]]]]
abstracting: (sum(p21, p20)<=sum(p23, p22))
states: 314
abstracting: (sum(p43, p42)<=7)
states: 380
abstracting: (73<=sum(p15, p14))
states: 0
abstracting: (1<=0)
states: 0
.abstracting: (0<=0)
states: 380
.abstracting: (sum(p29, p28, p27, p26)<=sum(p41, p40))
states: 298
........
EG iterations: 8
-> the formula is TRUE
FORMULA LamportFastMutEx-PT-2-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.144sec
totally nodes used: 89238 (8.9e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 83244 309893 393137
used/not used/entry size/cache size: 394253 66714611 16 1024MB
basic ops cache: hits/miss/sum: 30461 76438 106899
used/not used/entry size/cache size: 142091 16635125 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 99 99
used/not used/entry size/cache size: 1 16777215 12 192MB
state nr cache: hits/miss/sum: 462 2068 2530
used/not used/entry size/cache size: 2068 8386540 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 67024074
1 80687
2 3770
3 321
4 12
5 0
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 5.151sec
BK_STOP 1679493362739
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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.000sec
iterations count:1654 (26), effective:107 (1)
initing FirstDep: 0m 0.002sec
iterations count:1190 (19), effective:83 (1)
iterations count:558 (9), effective:26 (0)
iterations count:122 (1), effective:3 (0)
iterations count:1523 (24), effective:106 (1)
iterations count:211 (3), effective:12 (0)
iterations count:1509 (24), effective:103 (1)
iterations count:1409 (22), effective:100 (1)
iterations count:75 (1), effective:1 (0)
iterations count:1409 (22), effective:100 (1)
iterations count:1409 (22), effective:100 (1)
iterations count:230 (3), effective:9 (0)
iterations count:1680 (27), effective:117 (1)
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-2"
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-2, 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-167856420200393"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-PT-2.tgz
mv LamportFastMutEx-PT-2 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 '
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 ;