About the Execution of Marcie+red for FMS-PT-00010
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5692.728 | 12749.00 | 14546.00 | 470.80 | FTFFTTFTFFTTFTFF | 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.r170-tall-167838856900206.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 FMS-PT-00010, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838856900206
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 6.3K Feb 25 20:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 25 20:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 20:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 20:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 20:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 25 20:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 20:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 25 20:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 16:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 17K 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 FMS-PT-00010-ReachabilityCardinality-00
FORMULA_NAME FMS-PT-00010-ReachabilityCardinality-01
FORMULA_NAME FMS-PT-00010-ReachabilityCardinality-02
FORMULA_NAME FMS-PT-00010-ReachabilityCardinality-03
FORMULA_NAME FMS-PT-00010-ReachabilityCardinality-04
FORMULA_NAME FMS-PT-00010-ReachabilityCardinality-05
FORMULA_NAME FMS-PT-00010-ReachabilityCardinality-06
FORMULA_NAME FMS-PT-00010-ReachabilityCardinality-07
FORMULA_NAME FMS-PT-00010-ReachabilityCardinality-08
FORMULA_NAME FMS-PT-00010-ReachabilityCardinality-09
FORMULA_NAME FMS-PT-00010-ReachabilityCardinality-10
FORMULA_NAME FMS-PT-00010-ReachabilityCardinality-11
FORMULA_NAME FMS-PT-00010-ReachabilityCardinality-12
FORMULA_NAME FMS-PT-00010-ReachabilityCardinality-13
FORMULA_NAME FMS-PT-00010-ReachabilityCardinality-14
FORMULA_NAME FMS-PT-00010-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1678493974606
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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FMS-PT-00010
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 00:19:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 00:19:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 00:19:36] [INFO ] Load time of PNML (sax parser for PT used): 21 ms
[2023-03-11 00:19:36] [INFO ] Transformed 22 places.
[2023-03-11 00:19:36] [INFO ] Transformed 20 transitions.
[2023-03-11 00:19:36] [INFO ] Parsed PT model containing 22 places and 20 transitions and 50 arcs in 80 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
FORMULA FMS-PT-00010-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10003 steps, including 2 resets, run finished after 249 ms. (steps per millisecond=40 ) properties (out of 15) seen :9
FORMULA FMS-PT-00010-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FMS-PT-00010-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FMS-PT-00010-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FMS-PT-00010-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FMS-PT-00010-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FMS-PT-00010-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FMS-PT-00010-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FMS-PT-00010-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FMS-PT-00010-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :1
FORMULA FMS-PT-00010-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :2
FORMULA FMS-PT-00010-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FMS-PT-00010-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :1
FORMULA FMS-PT-00010-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) 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 2) seen :1
FORMULA FMS-PT-00010-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 20 rows 22 cols
[2023-03-11 00:19:36] [INFO ] Computed 6 place invariants in 9 ms
[2023-03-11 00:19:37] [INFO ] After 143ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 00:19:37] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-11 00:19:37] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 00:19:37] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-11 00:19:37] [INFO ] After 112ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 73 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=36 )
FORMULA FMS-PT-00010-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 3 ms.
All properties solved without resorting to model-checking.
Total runtime 916 ms.
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=ReachabilityCardinality.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: FMS_PT_00010
(NrP: 22 NrTr: 20 NrArc: 50)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.794sec
RS generation: 0m 0.084sec
-> reachability set: #nodes 4565 (4.6e+03) #states 2,501,413,200 (9)
starting MCC model checker
--------------------------
checking: AG [P12<=6]
normalized: ~ [E [true U ~ [P12<=6]]]
abstracting: (P12<=6)
states: 2,501,092,506 (9)
-> the formula is FALSE
FORMULA FMS-PT-00010-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.060sec
checking: EF [8<=P1wP2]
normalized: E [true U 8<=P1wP2]
abstracting: (8<=P1wP2)
states: 4,839,516 (6)
-> the formula is TRUE
FORMULA FMS-PT-00010-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.022sec
checking: EF [4<=P1d]
normalized: E [true U 4<=P1d]
abstracting: (4<=P1d)
states: 252,962,028 (8)
-> the formula is TRUE
FORMULA FMS-PT-00010-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.081sec
checking: AG [P2d<=7]
normalized: ~ [E [true U ~ [P2d<=7]]]
abstracting: (P2d<=7)
states: 2,494,520,820 (9)
-> the formula is FALSE
FORMULA FMS-PT-00010-ReachabilityCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.067sec
checking: AG [2<=P1]
normalized: ~ [E [true U ~ [2<=P1]]]
abstracting: (2<=P1)
states: 903,699,852 (8)
-> the formula is FALSE
FORMULA FMS-PT-00010-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.038sec
checking: AG [P2wM2<=P2wM2]
normalized: ~ [E [true U ~ [P2wM2<=P2wM2]]]
abstracting: (P2wM2<=P2wM2)
states: 2,501,413,200 (9)
-> the formula is TRUE
FORMULA FMS-PT-00010-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [M3<=P12M3]
normalized: E [true U M3<=P12M3]
abstracting: (M3<=P12M3)
states: 906,943,752 (8)
-> the formula is TRUE
FORMULA FMS-PT-00010-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: AG [~ [[~ [P1wM1<=P3M2] & ~ [[~ [9<=P3M2] | ~ [P2wM2<=P2M2]]]]]]
normalized: ~ [E [true U [~ [[~ [P2wM2<=P2M2] | ~ [9<=P3M2]]] & ~ [P1wM1<=P3M2]]]]
abstracting: (P1wM1<=P3M2)
states: 1,990,375,656 (9)
abstracting: (9<=P3M2)
states: 113,700,600 (8)
abstracting: (P2wM2<=P2M2)
states: 1,156,904,958 (9)
-> the formula is FALSE
FORMULA FMS-PT-00010-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.060sec
checking: AG [[[[[[~ [M1<=8] & M1<=M1] | 8<=P3M2] & 8<=P1wM1] | [2<=M2 | ~ [M1<=0]]] | P2s<=1]]
normalized: ~ [E [true U ~ [[P2s<=1 | [[2<=M2 | ~ [M1<=0]] | [8<=P1wM1 & [8<=P3M2 | [M1<=M1 & ~ [M1<=8]]]]]]]]]
abstracting: (M1<=8)
states: 2,501,413,200 (9)
abstracting: (M1<=M1)
states: 2,501,413,200 (9)
abstracting: (8<=P3M2)
states: 227,401,200 (8)
abstracting: (8<=P1wM1)
states: 4,839,516 (6)
abstracting: (M1<=0)
states: 255,949,980 (8)
abstracting: (2<=M2)
states: 0
abstracting: (P2s<=1)
states: 1,530,536,502 (9)
-> the formula is FALSE
FORMULA FMS-PT-00010-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.116sec
checking: AG [[[P2s<=P12s | [[P3M2<=0 | [[M2<=10 & [[M3<=P1d | [P3M2<=P1d | 10<=P1]] & P3<=P12]] & [~ [P12s<=P2d] & [[[2<=M2 & P12wM3<=7] & ~ [P3M2<=1]] | [~ [P2<=9] | ~ [M2<=P12s]]]]]] & ~ [[[7<=P2s & P2wP1<=P1s] & P1d<=P2wM2]]]] | [[~ [P12s<=7] & ~ [7<=P2wP1]] | ~ [[~ [[[P2M2<=5 & P2wM2<=P3M2] & [P3s<=P2d & ~ [M2<=2]]]] & 4<=P2d]]]]]
normalized: ~ [E [true U ~ [[[~ [[4<=P2d & ~ [[[P3s<=P2d & ~ [M2<=2]] & [P2M2<=5 & P2wM2<=P3M2]]]]] | [~ [7<=P2wP1] & ~ [P12s<=7]]] | [P2s<=P12s | [~ [[P1d<=P2wM2 & [7<=P2s & P2wP1<=P1s]]] & [P3M2<=0 | [[[[~ [M2<=P12s] | ~ [P2<=9]] | [~ [P3M2<=1] & [2<=M2 & P12wM3<=7]]] & ~ [P12s<=P2d]] & [M2<=10 & [P3<=P12 & [M3<=P1d | [P3M2<=P1d | 10<=P1]]]]]]]]]]]]
abstracting: (10<=P1)
states: 113,256 (5)
abstracting: (P3M2<=P1d)
states: 876,645,696 (8)
abstracting: (M3<=P1d)
states: 1,247,806,494 (9)
abstracting: (P3<=P12)
states: 636,479,958 (8)
abstracting: (M2<=10)
states: 2,501,413,200 (9)
abstracting: (P12s<=P2d)
states: 1,999,708,128 (9)
abstracting: (P12wM3<=7)
states: 2,501,375,316 (9)
abstracting: (2<=M2)
states: 0
abstracting: (P3M2<=1)
states: 795,904,200 (8)
abstracting: (P2<=9)
states: 2,501,245,494 (9)
abstracting: (M2<=P12s)
states: 1,596,242,934 (9)
abstracting: (P3M2<=0)
states: 416,902,200 (8)
abstracting: (P2wP1<=P1s)
states: 1,516,999,770 (9)
abstracting: (7<=P2s)
states: 23,145,804 (7)
abstracting: (P1d<=P2wM2)
states: 1,606,245,498 (9)
abstracting: (P2s<=P12s)
states: 1,229,682,234 (9)
abstracting: (P12s<=7)
states: 2,501,375,316 (9)
abstracting: (7<=P2wP1)
states: 23,145,804 (7)
abstracting: (P2wM2<=P3M2)
states: 1,953,113,808 (9)
abstracting: (P2M2<=5)
states: 2,501,413,200 (9)
abstracting: (M2<=2)
states: 2,501,413,200 (9)
abstracting: (P3s<=P2d)
states: 909,759,218 (8)
abstracting: (4<=P2d)
states: 296,560,572 (8)
-> the formula is FALSE
FORMULA FMS-PT-00010-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.280sec
checking: EF [[[P12<=0 & ~ [2<=P12wM3]] & [[[P1s<=M3 | [P1s<=P1wP2 & ~ [[~ [7<=P12M3] | [[10<=M3 & 1<=P2d] | 10<=P1M1]]]]] & 3<=M1] & [[~ [[P12s<=1 | [M3<=P1wM1 & [P2d<=P2 | P2wM2<=6]]]] & ~ [[[[P1s<=7 & P3M2<=P2d] | ~ [P1d<=1]] & ~ [2<=P1d]]]] & [[~ [[1<=P1 | 6<=P1d]] | [[~ [1<=P12wM3] & ~ [P3M2<=4]] | M2<=P2d]] | [1<=P12s | [1<=P2 & [[10<=P1M1 & P12<=7] & ~ [P3<=P2wM2]]]]]]]]]
normalized: E [true U [[[[[1<=P12s | [1<=P2 & [~ [P3<=P2wM2] & [10<=P1M1 & P12<=7]]]] | [[M2<=P2d | [~ [P3M2<=4] & ~ [1<=P12wM3]]] | ~ [[1<=P1 | 6<=P1d]]]] & [~ [[~ [2<=P1d] & [~ [P1d<=1] | [P1s<=7 & P3M2<=P2d]]]] & ~ [[P12s<=1 | [M3<=P1wM1 & [P2d<=P2 | P2wM2<=6]]]]]] & [3<=M1 & [P1s<=M3 | [P1s<=P1wP2 & ~ [[[10<=P1M1 | [10<=M3 & 1<=P2d]] | ~ [7<=P12M3]]]]]]] & [P12<=0 & ~ [2<=P12wM3]]]]
abstracting: (2<=P12wM3)
states: 363,737,418 (8)
abstracting: (P12<=0)
states: 1,507,720,500 (9)
abstracting: (7<=P12M3)
states: 0
abstracting: (1<=P2d)
states: 1,596,875,280 (9)
abstracting: (10<=M3)
states: 0
abstracting: (10<=P1M1)
states: 0
abstracting: (P1s<=P1wP2)
states: 1,535,696,448 (9)
abstracting: (P1s<=M3)
states: 1,792,563,696 (9)
abstracting: (3<=M1)
states: 1,097,404,308 (9)
abstracting: (P2wM2<=6)
states: 2,478,267,396 (9)
abstracting: (P2d<=P2)
states: 1,516,159,788 (9)
abstracting: (M3<=P1wM1)
states: 1,247,806,494 (9)
abstracting: (P12s<=1)
states: 2,137,675,782 (9)
abstracting: (P3M2<=P2d)
states: 909,759,218 (8)
abstracting: (P1s<=7)
states: 2,496,573,684 (9)
abstracting: (P1d<=1)
states: 1,597,713,348 (9)
abstracting: (2<=P1d)
states: 903,699,852 (8)
abstracting: (6<=P1d)
states: 48,230,556 (7)
abstracting: (1<=P1)
states: 1,543,588,332 (9)
abstracting: (1<=P12wM3)
states: 993,692,700 (8)
abstracting: (P3M2<=4)
states: 1,705,509,000 (9)
abstracting: (M2<=P2d)
states: 1,970,506,824 (9)
abstracting: (P12<=7)
states: 2,501,375,316 (9)
abstracting: (10<=P1M1)
states: 0
abstracting: (P3<=P2wM2)
states: 909,759,218 (8)
abstracting: (1<=P2)
states: 1,596,875,280 (9)
abstracting: (1<=P12s)
states: 993,692,700 (8)
-> the formula is TRUE
FORMULA FMS-PT-00010-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.538sec
checking: AG [[[~ [[[~ [[[M1<=5 & [9<=P1wM1 & P2d<=P1wM1]] & ~ [[P1<=P12wM3 & P2wM2<=5]]]] | ~ [10<=P2]] | [P3s<=7 & [~ [[P2wM2<=M2 & P12s<=P1d]] & P2wM2<=P1wP2]]]] & [[~ [P2s<=P12M3] & ~ [[~ [[[P12s<=P1M1 | P1M1<=P3M2] | [P12<=3 | 8<=P3]]] & P1s<=P2wP1]]] & [P12M3<=1 | 7<=P1wP2]]] | [[~ [M2<=2] | [~ [[3<=P2 | P3s<=7]] | P1<=M3]] | [[P1d<=10 & P12wM3<=1] | ~ [2<=P2wP1]]]]]
normalized: ~ [E [true U ~ [[[[~ [2<=P2wP1] | [P1d<=10 & P12wM3<=1]] | [[P1<=M3 | ~ [[3<=P2 | P3s<=7]]] | ~ [M2<=2]]] | [[[P12M3<=1 | 7<=P1wP2] & [~ [[P1s<=P2wP1 & ~ [[[P12<=3 | 8<=P3] | [P12s<=P1M1 | P1M1<=P3M2]]]]] & ~ [P2s<=P12M3]]] & ~ [[[P3s<=7 & [P2wM2<=P1wP2 & ~ [[P2wM2<=M2 & P12s<=P1d]]]] | [~ [10<=P2] | ~ [[~ [[P1<=P12wM3 & P2wM2<=5]] & [M1<=5 & [9<=P1wM1 & P2d<=P1wM1]]]]]]]]]]]]
abstracting: (P2d<=P1wM1)
states: 1,516,999,770 (9)
abstracting: (9<=P1wM1)
states: 998,976 (5)
abstracting: (M1<=5)
states: 2,501,413,200 (9)
abstracting: (P2wM2<=5)
states: 2,438,938,920 (9)
abstracting: (P1<=P12wM3)
states: 1,283,872,326 (9)
abstracting: (10<=P2)
states: 167,706 (5)
abstracting: (P12s<=P1d)
states: 1,977,224,106 (9)
abstracting: (P2wM2<=M2)
states: 1,278,169,464 (9)
abstracting: (P2wM2<=P1wP2)
states: 1,516,999,770 (9)
abstracting: (P3s<=7)
states: 2,274,012,000 (9)
abstracting: (P2s<=P12M3)
states: 1,178,435,940 (9)
abstracting: (P1M1<=P3M2)
states: 2,127,321,248 (9)
abstracting: (P12s<=P1M1)
states: 1,925,224,488 (9)
abstracting: (8<=P3)
states: 227,401,200 (8)
abstracting: (P12<=3)
states: 2,465,758,020 (9)
abstracting: (P1s<=P2wP1)
states: 1,606,245,498 (9)
abstracting: (7<=P1wP2)
states: 16,994,736 (7)
abstracting: (P12M3<=1)
states: 2,251,264,158 (9)
abstracting: (M2<=2)
states: 2,501,413,200 (9)
abstracting: (P3s<=7)
states: 2,274,012,000 (9)
abstracting: (3<=P2)
states: 556,422,900 (8)
abstracting: (P1<=M3)
states: 1,792,563,696 (9)
abstracting: (P12wM3<=1)
states: 2,137,675,782 (9)
abstracting: (P1d<=10)
states: 2,501,413,200 (9)
abstracting: (2<=P2wP1)
states: 970,876,698 (8)
-> the formula is FALSE
FORMULA FMS-PT-00010-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.239sec
checking: AG [[~ [M1<=P1M1] | [[[9<=P12M3 & [M3<=5 | ~ [5<=P2d]]] | [[[[[~ [P3M2<=0] & P12<=4] | [~ [M3<=P2wM2] | P3s<=P1]] & ~ [[P3<=P3s & 2<=P2wM2]]] | [[8<=P1s | [[4<=M3 | P1M1<=P1d] & [6<=P2 & P12s<=M3]]] & [[[P12s<=6 & P1M1<=6] & ~ [P2M2<=5]] | ~ [[8<=M2 & P2wP1<=7]]]]] | 6<=P12s]] & [[~ [P3s<=P1wM1] & 9<=P12wM3] | [[~ [10<=P2] | P12s<=6] | [P1wM1<=M1 | [[9<=M1 | ~ [10<=P12M3]] | [~ [P2wP1<=P2s] | [~ [5<=P3M2] & ~ [4<=M3]]]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[P1wM1<=M1 | [[[~ [4<=M3] & ~ [5<=P3M2]] | ~ [P2wP1<=P2s]] | [9<=M1 | ~ [10<=P12M3]]]] | [P12s<=6 | ~ [10<=P2]]] | [9<=P12wM3 & ~ [P3s<=P1wM1]]] & [[6<=P12s | [[[~ [[8<=M2 & P2wP1<=7]] | [~ [P2M2<=5] & [P12s<=6 & P1M1<=6]]] & [8<=P1s | [[6<=P2 & P12s<=M3] & [4<=M3 | P1M1<=P1d]]]] | [~ [[P3<=P3s & 2<=P2wM2]] & [[P3s<=P1 | ~ [M3<=P2wM2]] | [P12<=4 & ~ [P3M2<=0]]]]]] | [9<=P12M3 & [M3<=5 | ~ [5<=P2d]]]]] | ~ [M1<=P1M1]]]]]
abstracting: (M1<=P1M1)
states: 694,242,120 (8)
abstracting: (5<=P2d)
states: 144,312,828 (8)
abstracting: (M3<=5)
states: 2,501,413,200 (9)
abstracting: (9<=P12M3)
states: 0
abstracting: (P3M2<=0)
states: 416,902,200 (8)
abstracting: (P12<=4)
states: 2,492,314,572 (9)
abstracting: (M3<=P2wM2)
states: 1,304,693,676 (9)
abstracting: (P3s<=P1)
states: 876,645,696 (8)
abstracting: (2<=P2wM2)
states: 970,876,698 (8)
abstracting: (P3<=P3s)
states: 1,364,407,200 (9)
abstracting: (P1M1<=P1d)
states: 1,706,624,964 (9)
abstracting: (4<=M3)
states: 0
abstracting: (P12s<=M3)
states: 2,241,166,356 (9)
abstracting: (6<=P2)
states: 62,474,280 (7)
abstracting: (8<=P1s)
states: 4,839,516 (6)
abstracting: (P1M1<=6)
states: 2,501,413,200 (9)
abstracting: (P12s<=6)
states: 2,501,092,506 (9)
abstracting: (P2M2<=5)
states: 2,501,413,200 (9)
abstracting: (P2wP1<=7)
states: 2,494,520,820 (9)
abstracting: (8<=M2)
states: 0
abstracting: (6<=P12s)
states: 1,929,840 (6)
abstracting: (P3s<=P1wM1)
states: 876,645,696 (8)
abstracting: (9<=P12wM3)
states: 2,640 (3)
abstracting: (10<=P2)
states: 167,706 (5)
abstracting: (P12s<=6)
states: 2,501,092,506 (9)
abstracting: (10<=P12M3)
states: 0
abstracting: (9<=M1)
states: 0
abstracting: (P2wP1<=P2s)
states: 1,516,159,788 (9)
abstracting: (5<=P3M2)
states: 795,904,200 (8)
abstracting: (4<=M3)
states: 0
abstracting: (P1wM1<=M1)
states: 1,943,095,440 (9)
-> the formula is FALSE
FORMULA FMS-PT-00010-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.526sec
checking: EF [[[[P1<=0 & [[[2<=M3 & ~ [P1wP2<=P1wP2]] | ~ [P2d<=P1]] & P1wM1<=P2wP1]] & [[~ [[[[P2wP1<=P3M2 & 8<=P2] & ~ [P1wM1<=P1wP2]] & ~ [[P3<=P12 & M2<=M1]]]] | [P2wP1<=7 & ~ [[[P3M2<=6 | 10<=P12wM3] | ~ [P12s<=P1wM1]]]]] | P2<=P1s]] & [~ [[~ [[~ [[P2wP1<=P2s | 3<=P12M3]] & P1<=M3]] | 1<=P2]] | [[~ [[[[~ [3<=P2wP1] | [4<=P1s | P2d<=P2M2]] | ~ [9<=P12wM3]] & 9<=P12wM3]] | P1M1<=P3s] & [~ [[~ [8<=P3s] | ~ [[P1wP2<=P1s & P2s<=P1s]]]] & [M1<=6 | P2d<=5]]]]]]
normalized: E [true U [[[[[M1<=6 | P2d<=5] & ~ [[~ [[P1wP2<=P1s & P2s<=P1s]] | ~ [8<=P3s]]]] & [P1M1<=P3s | ~ [[9<=P12wM3 & [~ [9<=P12wM3] | [[4<=P1s | P2d<=P2M2] | ~ [3<=P2wP1]]]]]]] | ~ [[1<=P2 | ~ [[P1<=M3 & ~ [[P2wP1<=P2s | 3<=P12M3]]]]]]] & [[P2<=P1s | [[P2wP1<=7 & ~ [[~ [P12s<=P1wM1] | [P3M2<=6 | 10<=P12wM3]]]] | ~ [[~ [[P3<=P12 & M2<=M1]] & [~ [P1wM1<=P1wP2] & [P2wP1<=P3M2 & 8<=P2]]]]]] & [P1<=0 & [P1wM1<=P2wP1 & [~ [P2d<=P1] | [2<=M3 & ~ [P1wP2<=P1wP2]]]]]]]]
abstracting: (P1wP2<=P1wP2)
states: 2,501,413,200 (9)
abstracting: (2<=M3)
states: 1,594,469,448 (9)
abstracting: (P2d<=P1)
states: 1,516,999,770 (9)
abstracting: (P1wM1<=P2wP1)
states: 1,606,245,498 (9)
abstracting: (P1<=0)
states: 957,824,868 (8)
abstracting: (8<=P2)
states: 6,892,380 (6)
abstracting: (P2wP1<=P3M2)
states: 1,953,113,808 (9)
abstracting: (P1wM1<=P1wP2)
states: 1,535,696,448 (9)
abstracting: (M2<=M1)
states: 2,347,389,330 (9)
abstracting: (P3<=P12)
states: 636,479,958 (8)
abstracting: (10<=P12wM3)
states: 66
abstracting: (P3M2<=6)
states: 2,122,411,200 (9)
abstracting: (P12s<=P1wM1)
states: 1,977,224,106 (9)
abstracting: (P2wP1<=7)
states: 2,494,520,820 (9)
abstracting: (P2<=P1s)
states: 1,516,999,770 (9)
abstracting: (3<=P12M3)
states: 0
abstracting: (P2wP1<=P2s)
states: 1,516,159,788 (9)
abstracting: (P1<=M3)
states: 1,792,563,696 (9)
abstracting: (1<=P2)
states: 1,596,875,280 (9)
abstracting: (3<=P2wP1)
states: 556,422,900 (8)
abstracting: (P2d<=P2M2)
states: 1,156,904,958 (9)
abstracting: (4<=P1s)
states: 252,962,028 (8)
abstracting: (9<=P12wM3)
states: 2,640 (3)
abstracting: (9<=P12wM3)
states: 2,640 (3)
abstracting: (P1M1<=P3s)
states: 2,127,321,248 (9)
abstracting: (8<=P3s)
states: 227,401,200 (8)
abstracting: (P2s<=P1s)
states: 1,516,999,770 (9)
abstracting: (P1wP2<=P1s)
states: 1,535,696,448 (9)
abstracting: (P2d<=5)
states: 2,438,938,920 (9)
abstracting: (M1<=6)
states: 2,501,413,200 (9)
-> the formula is TRUE
FORMULA FMS-PT-00010-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.615sec
checking: AG [[[[[[[[[[9<=P12wM3 | P12wM3<=M2] & P2s<=7] & M1<=2] & [~ [P2s<=P12wM3] | 1<=P3M2]] | ~ [[[[P2wM2<=4 & P12s<=P1s] & P12<=P2M2] & ~ [5<=P2]]]] & [~ [M2<=P1M1] & P12M3<=9]] & [9<=P1 | P1wM1<=4]] | [~ [[P1d<=P2d | P2wM2<=10]] | [~ [P2d<=P1d] & [~ [[~ [[P1M1<=10 | M3<=7]] | ~ [P12<=P2wM2]]] | P12<=P12M3]]]] | [~ [[[[4<=P12s & P2s<=P1s] & [[P1wM1<=2 & 10<=P12s] | [[~ [M3<=P12M3] & [M1<=M2 | 5<=P1d]] & [[10<=P1s & P1wM1<=P12] & [2<=P3s | P1wP2<=9]]]]] | ~ [[3<=P2wM2 & P1M1<=P2M2]]]] | [3<=P2 & P12M3<=P12s]]]]
normalized: ~ [E [true U ~ [[[[3<=P2 & P12M3<=P12s] | ~ [[~ [[3<=P2wM2 & P1M1<=P2M2]] | [[[[[2<=P3s | P1wP2<=9] & [10<=P1s & P1wM1<=P12]] & [[M1<=M2 | 5<=P1d] & ~ [M3<=P12M3]]] | [P1wM1<=2 & 10<=P12s]] & [4<=P12s & P2s<=P1s]]]]] | [[[[P12<=P12M3 | ~ [[~ [P12<=P2wM2] | ~ [[P1M1<=10 | M3<=7]]]]] & ~ [P2d<=P1d]] | ~ [[P1d<=P2d | P2wM2<=10]]] | [[9<=P1 | P1wM1<=4] & [[P12M3<=9 & ~ [M2<=P1M1]] & [~ [[~ [5<=P2] & [P12<=P2M2 & [P2wM2<=4 & P12s<=P1s]]]] | [[1<=P3M2 | ~ [P2s<=P12wM3]] & [M1<=2 & [P2s<=7 & [9<=P12wM3 | P12wM3<=M2]]]]]]]]]]]]
abstracting: (P12wM3<=M2)
states: 1,891,309,134 (9)
abstracting: (9<=P12wM3)
states: 2,640 (3)
abstracting: (P2s<=7)
states: 2,494,520,820 (9)
abstracting: (M1<=2)
states: 1,404,008,892 (9)
abstracting: (P2s<=P12wM3)
states: 1,229,682,234 (9)
abstracting: (1<=P3M2)
states: 2,084,511,000 (9)
abstracting: (P12s<=P1s)
states: 1,977,224,106 (9)
abstracting: (P2wM2<=4)
states: 2,357,100,372 (9)
abstracting: (P12<=P2M2)
states: 1,754,087,148 (9)
abstracting: (5<=P2)
states: 144,312,828 (8)
abstracting: (M2<=P1M1)
states: 1,834,188,642 (9)
abstracting: (P12M3<=9)
states: 2,501,413,200 (9)
abstracting: (P1wM1<=4)
states: 2,384,190,072 (9)
abstracting: (9<=P1)
states: 998,976 (5)
abstracting: (P2wM2<=10)
states: 2,501,413,200 (9)
abstracting: (P1d<=P2d)
states: 1,606,245,498 (9)
abstracting: (P2d<=P1d)
states: 1,516,999,770 (9)
abstracting: (M3<=7)
states: 2,501,413,200 (9)
abstracting: (P1M1<=10)
states: 2,501,413,200 (9)
abstracting: (P12<=P2wM2)
states: 1,999,708,128 (9)
abstracting: (P12<=P12M3)
states: 1,750,665,510 (9)
abstracting: (P2s<=P1s)
states: 1,516,999,770 (9)
abstracting: (4<=P12s)
states: 35,655,180 (7)
abstracting: (10<=P12s)
states: 66
abstracting: (P1wM1<=2)
states: 2,004,656,412 (9)
abstracting: (M3<=P12M3)
states: 906,943,752 (8)
abstracting: (5<=P1d)
states: 117,223,128 (8)
abstracting: (M1<=M2)
states: 520,681,590 (8)
abstracting: (P1wM1<=P12)
states: 1,283,872,326 (9)
abstracting: (10<=P1s)
states: 113,256 (5)
abstracting: (P1wP2<=9)
states: 2,501,299,944 (9)
abstracting: (2<=P3s)
states: 1,705,509,000 (9)
abstracting: (P1M1<=P2M2)
states: 1,376,991,330 (9)
abstracting: (3<=P2wM2)
states: 556,422,900 (8)
abstracting: (P12M3<=P12s)
states: 1,871,457,918 (9)
abstracting: (3<=P2)
states: 556,422,900 (8)
-> the formula is FALSE
FORMULA FMS-PT-00010-ReachabilityCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.978sec
checking: EF [[[9<=P2wP1 & ~ [[[[[[6<=P2wM2 & ~ [10<=P12s]] | [[M2<=P3s | P1wP2<=P1wM1] | 2<=P12s]] | [P2<=P1wP2 & [[P1s<=3 & P2d<=9] & P3M2<=M1]]] | [P12s<=P1wM1 | [[~ [P3<=4] & [P2<=6 & P2wP1<=P1s]] & P3M2<=P2d]]] & 1<=P2M2]]] & [[[~ [[P1wP2<=2 & ~ [[6<=P3 & P1<=4]]]] | [7<=P12M3 | P1wP2<=P2wP1]] & 2<=P3M2] | ~ [[[[[~ [[10<=P3 | 9<=P1M1]] & [[9<=P12M3 & 9<=P1wM1] & ~ [P12M3<=P1wM1]]] & ~ [[~ [7<=P1wP2] & [P12s<=P12M3 | P1<=P12s]]]] & [~ [[[P1wM1<=5 | M1<=4] | 5<=P2d]] | ~ [2<=P1wP2]]] | [~ [[P1s<=5 & ~ [P3<=3]]] & ~ [[[P12s<=8 & P1wM1<=10] & [P1<=2 | ~ [P2<=5]]]]]]]]]]
normalized: E [true U [[~ [[[~ [[[P1<=2 | ~ [P2<=5]] & [P12s<=8 & P1wM1<=10]]] & ~ [[P1s<=5 & ~ [P3<=3]]]] | [[~ [2<=P1wP2] | ~ [[5<=P2d | [P1wM1<=5 | M1<=4]]]] & [~ [[[P12s<=P12M3 | P1<=P12s] & ~ [7<=P1wP2]]] & [[~ [P12M3<=P1wM1] & [9<=P12M3 & 9<=P1wM1]] & ~ [[10<=P3 | 9<=P1M1]]]]]]] | [2<=P3M2 & [[7<=P12M3 | P1wP2<=P2wP1] | ~ [[P1wP2<=2 & ~ [[6<=P3 & P1<=4]]]]]]] & [9<=P2wP1 & ~ [[1<=P2M2 & [[P12s<=P1wM1 | [P3M2<=P2d & [[P2<=6 & P2wP1<=P1s] & ~ [P3<=4]]]] | [[P2<=P1wP2 & [P3M2<=M1 & [P1s<=3 & P2d<=9]]] | [[2<=P12s | [M2<=P3s | P1wP2<=P1wM1]] | [6<=P2wM2 & ~ [10<=P12s]]]]]]]]]]
abstracting: (10<=P12s)
states: 66
abstracting: (6<=P2wM2)
states: 62,474,280 (7)
abstracting: (P1wP2<=P1wM1)
states: 1,535,696,448 (9)
abstracting: (M2<=P3s)
states: 2,248,719,902 (9)
abstracting: (2<=P12s)
states: 363,737,418 (8)
abstracting: (P2d<=9)
states: 2,501,245,494 (9)
abstracting: (P1s<=3)
states: 2,248,451,172 (9)
abstracting: (P3M2<=M1)
states: 1,136,575,024 (9)
abstracting: (P2<=P1wP2)
states: 1,516,999,770 (9)
abstracting: (P3<=4)
states: 1,705,509,000 (9)
abstracting: (P2wP1<=P1s)
states: 1,516,999,770 (9)
abstracting: (P2<=6)
states: 2,478,267,396 (9)
abstracting: (P3M2<=P2d)
states: 909,759,218 (8)
abstracting: (P12s<=P1wM1)
states: 1,977,224,106 (9)
abstracting: (1<=P2M2)
states: 985,253,412 (8)
abstracting: (9<=P2wP1)
states: 1,468,236 (6)
abstracting: (P1<=4)
states: 2,384,190,072 (9)
abstracting: (6<=P3)
states: 568,503,000 (8)
abstracting: (P1wP2<=2)
states: 2,004,656,412 (9)
abstracting: (P1wP2<=P2wP1)
states: 1,606,245,498 (9)
abstracting: (7<=P12M3)
states: 0
abstracting: (2<=P3M2)
states: 1,705,509,000 (9)
abstracting: (9<=P1M1)
states: 0
abstracting: (10<=P3)
states: 37,900,200 (7)
abstracting: (9<=P1wM1)
states: 998,976 (5)
abstracting: (9<=P12M3)
states: 0
abstracting: (P12M3<=P1wM1)
states: 2,067,743,568 (9)
abstracting: (7<=P1wP2)
states: 16,994,736 (7)
abstracting: (P1<=P12s)
states: 1,283,872,326 (9)
abstracting: (P12s<=P12M3)
states: 1,750,665,510 (9)
abstracting: (M1<=4)
states: 2,501,413,200 (9)
abstracting: (P1wM1<=5)
states: 2,453,182,644 (9)
abstracting: (5<=P2d)
states: 144,312,828 (8)
abstracting: (2<=P1wP2)
states: 903,699,852 (8)
abstracting: (P3<=3)
states: 1,440,207,600 (9)
abstracting: (P1s<=5)
states: 2,453,182,644 (9)
abstracting: (P1wM1<=10)
states: 2,501,413,200 (9)
abstracting: (P12s<=8)
states: 2,501,410,560 (9)
abstracting: (P2<=5)
states: 2,438,938,920 (9)
abstracting: (P1<=2)
states: 2,004,656,412 (9)
-> the formula is TRUE
FORMULA FMS-PT-00010-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.304sec
totally nodes used: 2029814 (2.0e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 9423960 3867204 13291164
used/not used/entry size/cache size: 4847624 62261240 16 1024MB
basic ops cache: hits/miss/sum: 7232879 3227211 10460090
used/not used/entry size/cache size: 4625875 12151341 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 1008575 388339 1396914
used/not used/entry size/cache size: 379549 8009059 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 65196272
1 1844836
2 55758
3 5479
4 1658
5 1163
6 670
7 627
8 354
9 394
>= 10 1653
Total processing time: 0m 8.756sec
BK_STOP 1678493987355
--------------------
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 ReachabilityCardinality -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:790 (39), effective:170 (8)
initing FirstDep: 0m 0.000sec
iterations count:524 (26), effective:98 (4)
iterations count:388 (19), effective:72 (3)
iterations count:253 (12), effective:59 (2)
iterations count:516 (25), effective:112 (5)
iterations count:47 (2), effective:9 (0)
iterations count:84 (4), effective:14 (0)
iterations count:685 (34), effective:179 (8)
iterations count:279 (13), effective:64 (3)
iterations count:350 (17), effective:77 (3)
iterations count:355 (17), effective:86 (4)
iterations count:410 (20), effective:101 (5)
iterations count:321 (16), effective:87 (4)
iterations count:387 (19), effective:120 (6)
iterations count:300 (15), effective:99 (4)
iterations count:424 (21), effective:92 (4)
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="FMS-PT-00010"
export BK_EXAMINATION="ReachabilityCardinality"
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 FMS-PT-00010, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r170-tall-167838856900206"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FMS-PT-00010.tgz
mv FMS-PT-00010 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;