About the Execution of Marcie+red for FMS-PT-00020
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
6755.903 | 29005.00 | 31890.00 | 437.10 | TFTFFTFFFTFFFTFT | 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-167838856900214.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-00020, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838856900214
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 7.8K Feb 25 20:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 25 20:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 20:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 20:10 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.6K Feb 25 16:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 18K Feb 25 16:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 20:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 25 20:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 20:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 20:12 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 16K 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-00020-ReachabilityCardinality-00
FORMULA_NAME FMS-PT-00020-ReachabilityCardinality-01
FORMULA_NAME FMS-PT-00020-ReachabilityCardinality-02
FORMULA_NAME FMS-PT-00020-ReachabilityCardinality-03
FORMULA_NAME FMS-PT-00020-ReachabilityCardinality-04
FORMULA_NAME FMS-PT-00020-ReachabilityCardinality-05
FORMULA_NAME FMS-PT-00020-ReachabilityCardinality-06
FORMULA_NAME FMS-PT-00020-ReachabilityCardinality-07
FORMULA_NAME FMS-PT-00020-ReachabilityCardinality-08
FORMULA_NAME FMS-PT-00020-ReachabilityCardinality-09
FORMULA_NAME FMS-PT-00020-ReachabilityCardinality-10
FORMULA_NAME FMS-PT-00020-ReachabilityCardinality-11
FORMULA_NAME FMS-PT-00020-ReachabilityCardinality-12
FORMULA_NAME FMS-PT-00020-ReachabilityCardinality-13
FORMULA_NAME FMS-PT-00020-ReachabilityCardinality-14
FORMULA_NAME FMS-PT-00020-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1678494061402
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-00020
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 00:21:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 00:21:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 00:21:03] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2023-03-11 00:21:03] [INFO ] Transformed 22 places.
[2023-03-11 00:21:03] [INFO ] Transformed 20 transitions.
[2023-03-11 00:21:03] [INFO ] Parsed PT model containing 22 places and 20 transitions and 50 arcs in 82 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 16) seen :8
FORMULA FMS-PT-00020-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FMS-PT-00020-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FMS-PT-00020-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FMS-PT-00020-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FMS-PT-00020-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FMS-PT-00020-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FMS-PT-00020-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FMS-PT-00020-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :1
FORMULA FMS-PT-00020-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 7) seen :1
FORMULA FMS-PT-00020-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 6 properties.
// Phase 1: matrix 20 rows 22 cols
[2023-03-11 00:21:03] [INFO ] Computed 6 place invariants in 5 ms
[2023-03-11 00:21:03] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-11 00:21:03] [INFO ] After 162ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:3
[2023-03-11 00:21:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-11 00:21:03] [INFO ] After 61ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :0
FORMULA FMS-PT-00020-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FMS-PT-00020-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FMS-PT-00020-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FMS-PT-00020-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FMS-PT-00020-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FMS-PT-00020-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
All properties solved without resorting to model-checking.
Total runtime 1006 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_00020
(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.742sec
RS generation: 0m 1.215sec
-> reachability set: #nodes 25410 (2.5e+04) #states 6,029,168,852,784 (12)
starting MCC model checker
--------------------------
checking: EF [13<=P1wP2]
normalized: E [true U 13<=P1wP2]
abstracting: (13<=P1wP2)
states: 29,010,582,678 (10)
-> the formula is TRUE
FORMULA FMS-PT-00020-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.448sec
checking: AG [P2d<=3]
normalized: ~ [E [true U ~ [P2d<=3]]]
abstracting: (P2d<=3)
states: 3,987,406,267,845 (12)
-> the formula is FALSE
FORMULA FMS-PT-00020-ReachabilityCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.009sec
checking: AG [M1<=12]
normalized: ~ [E [true U ~ [M1<=12]]]
abstracting: (M1<=12)
states: 6,029,168,852,784 (12)
-> the formula is TRUE
FORMULA FMS-PT-00020-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.020sec
checking: AG [P12M3<=1]
normalized: ~ [E [true U ~ [P12M3<=1]]]
abstracting: (P12M3<=1)
states: 4,912,161,830,730 (12)
-> the formula is FALSE
FORMULA FMS-PT-00020-ReachabilityCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.042sec
checking: AG [M1<=8]
normalized: ~ [E [true U ~ [M1<=8]]]
abstracting: (M1<=8)
states: 6,029,168,852,784 (12)
-> the formula is TRUE
FORMULA FMS-PT-00020-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.020sec
checking: AG [M1<=9]
normalized: ~ [E [true U ~ [M1<=9]]]
abstracting: (M1<=9)
states: 6,029,168,852,784 (12)
-> the formula is TRUE
FORMULA FMS-PT-00020-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.020sec
checking: AG [P1M1<=P1]
normalized: ~ [E [true U ~ [P1M1<=P1]]]
abstracting: (P1M1<=P1)
states: 4,512,423,037,353 (12)
-> the formula is FALSE
FORMULA FMS-PT-00020-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.805sec
checking: AG [P3s<=P3]
normalized: ~ [E [true U ~ [P3s<=P3]]]
abstracting: (P3s<=P3)
states: 3,158,136,065,744 (12)
-> the formula is FALSE
FORMULA FMS-PT-00020-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.724sec
checking: AG [[20<=P1wM1 | P12M3<=P1]]
normalized: ~ [E [true U ~ [[20<=P1wM1 | P12M3<=P1]]]]
abstracting: (P12M3<=P1)
states: 5,108,245,755,690 (12)
abstracting: (20<=P1wM1)
states: 4,500,111 (6)
-> the formula is FALSE
FORMULA FMS-PT-00020-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.529sec
checking: AG [[[[11<=M3 | [15<=P3s & ~ [[8<=P2wM2 | [[~ [M1<=P3M2] | [P2s<=2 & M1<=P1]] | [~ [P1<=19] | P2wP1<=11]]]]]] | P1M1<=15] | ~ [P2s<=16]]]
normalized: ~ [E [true U ~ [[~ [P2s<=16] | [P1M1<=15 | [11<=M3 | [15<=P3s & ~ [[8<=P2wM2 | [[P2wP1<=11 | ~ [P1<=19]] | [[P2s<=2 & M1<=P1] | ~ [M1<=P3M2]]]]]]]]]]]]
abstracting: (M1<=P3M2)
states: 5,069,246,103,500 (12)
abstracting: (M1<=P1)
states: 3,902,713,985,940 (12)
abstracting: (P2s<=2)
states: 3,285,873,603,474 (12)
abstracting: (P1<=19)
states: 6,029,164,352,673 (12)
abstracting: (P2wP1<=11)
states: 5,957,063,313,201 (12)
abstracting: (8<=P2wM2)
states: 501,526,585,560 (11)
abstracting: (15<=P3s)
states: 548,106,259,344 (11)
abstracting: (11<=M3)
states: 0
abstracting: (P1M1<=15)
states: 6,029,168,852,784 (12)
abstracting: (P2s<=16)
states: 6,027,908,086,200 (12)
-> the formula is TRUE
FORMULA FMS-PT-00020-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.541sec
checking: AG [~ [[[~ [[~ [[6<=P1M1 | 12<=P2d]] | P1<=P2d]] & [18<=P2wP1 & ~ [[[20<=M1 | [P1wP2<=9 & 5<=P2wP1]] | [~ [19<=P3M2] & ~ [9<=P2d]]]]]] | [P3M2<=13 & [19<=P2wM2 & 15<=P1s]]]]]
normalized: ~ [E [true U [[P3M2<=13 & [19<=P2wM2 & 15<=P1s]] | [[18<=P2wP1 & ~ [[[~ [9<=P2d] & ~ [19<=P3M2]] | [20<=M1 | [P1wP2<=9 & 5<=P2wP1]]]]] & ~ [[P1<=P2d | ~ [[6<=P1M1 | 12<=P2d]]]]]]]]
abstracting: (12<=P2d)
states: 72,105,539,583 (10)
abstracting: (6<=P1M1)
states: 0
abstracting: (P1<=P2d)
states: 3,518,954,295,780 (12)
abstracting: (5<=P2wP1)
states: 1,490,099,505,972 (12)
abstracting: (P1wP2<=9)
states: 5,858,394,829,749 (12)
abstracting: (20<=M1)
states: 0
abstracting: (19<=P3M2)
states: 78,300,894,192 (10)
abstracting: (9<=P2d)
states: 328,737,707,298 (11)
abstracting: (18<=P2wP1)
states: 352,004,730 (8)
abstracting: (15<=P1s)
states: 6,141,748,998 (9)
abstracting: (19<=P2wM2)
states: 70,382,466 (7)
abstracting: (P3M2<=13)
states: 5,298,360,506,992 (12)
-> the formula is FALSE
FORMULA FMS-PT-00020-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.554sec
checking: EF [[~ [P3<=4] & [[[~ [[[8<=M3 | [P1wP2<=0 & [12<=P2M2 | P2wM2<=M2]]] | ~ [[[18<=P2d & P2M2<=14] & P1s<=2]]]] & ~ [[~ [[[4<=P12 & P12wM3<=5] & [P2M2<=P1d | 14<=P2]]] & P3M2<=P1wP2]]] & ~ [1<=P1d]] & ~ [P1d<=6]]]]
normalized: E [true U [[~ [P1d<=6] & [~ [1<=P1d] & [~ [[P3M2<=P1wP2 & ~ [[[P2M2<=P1d | 14<=P2] & [4<=P12 & P12wM3<=5]]]]] & ~ [[~ [[P1s<=2 & [18<=P2d & P2M2<=14]]] | [8<=M3 | [P1wP2<=0 & [12<=P2M2 | P2wM2<=M2]]]]]]]] & ~ [P3<=4]]]
abstracting: (P3<=4)
states: 2,479,528,316,080 (12)
abstracting: (P2wM2<=M2)
states: 1,920,576,892,542 (12)
abstracting: (12<=P2M2)
states: 0
abstracting: (P1wP2<=0)
states: 1,384,159,920,990 (12)
abstracting: (8<=M3)
states: 0
abstracting: (P2M2<=14)
states: 6,029,168,852,784 (12)
abstracting: (18<=P2d)
states: 352,004,730 (8)
abstracting: (P1s<=2)
states: 3,400,452,100,122 (12)
abstracting: (P12wM3<=5)
states: 5,838,063,989,604 (12)
abstracting: (4<=P12)
states: 682,469,815,335 (11)
abstracting: (14<=P2)
states: 19,539,717,582 (10)
abstracting: (P2M2<=P1d)
states: 5,423,142,995,424 (12)
abstracting: (P3M2<=P1wP2)
states: 1,839,892,059,620 (12)
abstracting: (1<=P1d)
states: 4,645,008,931,794 (12)
abstracting: (P1d<=6)
states: 5,371,155,223,896 (12)
-> the formula is FALSE
FORMULA FMS-PT-00020-ReachabilityCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.842sec
checking: EF [[~ [P1wM1<=P3M2] & ~ [[[[18<=P3 | [[~ [12<=P3M2] & [P1s<=P3M2 | 8<=P1wM1]] & [[P2wP1<=P3 | 14<=P1wP2] | ~ [P1wM1<=P1wP2]]]] | ~ [[20<=M3 & [[17<=P3s & P1wP2<=16] & [M1<=11 | P12M3<=15]]]]] | ~ [[[~ [P12s<=13] & [P1wM1<=P12 | ~ [5<=P12s]]] | P1d<=P2M2]]]]]]
normalized: E [true U [~ [[~ [[P1d<=P2M2 | [[P1wM1<=P12 | ~ [5<=P12s]] & ~ [P12s<=13]]]] | [~ [[20<=M3 & [[M1<=11 | P12M3<=15] & [17<=P3s & P1wP2<=16]]]] | [18<=P3 | [[~ [P1wM1<=P1wP2] | [P2wP1<=P3 | 14<=P1wP2]] & [[P1s<=P3M2 | 8<=P1wM1] & ~ [12<=P3M2]]]]]]] & ~ [P1wM1<=P3M2]]]
abstracting: (P1wM1<=P3M2)
states: 4,664,582,459,690 (12)
abstracting: (12<=P3M2)
states: 1,174,513,412,880 (12)
abstracting: (8<=P1wM1)
states: 435,185,871,120 (11)
abstracting: (P1s<=P3M2)
states: 4,664,582,459,690 (12)
abstracting: (14<=P1wP2)
states: 13,996,379,628 (10)
abstracting: (P2wP1<=P3)
states: 4,600,197,985,012 (12)
abstracting: (P1wM1<=P1wP2)
states: 3,396,001,327,950 (12)
abstracting: (18<=P3)
states: 156,601,788,384 (11)
abstracting: (P1wP2<=16)
states: 6,028,371,213,018 (12)
abstracting: (17<=P3s)
states: 261,002,980,640 (11)
abstracting: (P12M3<=15)
states: 6,029,168,852,784 (12)
abstracting: (M1<=11)
states: 6,029,168,852,784 (12)
abstracting: (20<=M3)
states: 0
abstracting: (P12s<=13)
states: 6,029,044,059,654 (12)
abstracting: (5<=P12s)
states: 367,739,422,512 (11)
abstracting: (P1wM1<=P12)
states: 2,639,844,392,724 (12)
abstracting: (P1d<=P2M2)
states: 1,875,651,407,784 (12)
-> the formula is FALSE
FORMULA FMS-PT-00020-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.736sec
checking: AG [[~ [[~ [[~ [M2<=M2] | ~ [[~ [[P12<=P1wM1 & 2<=P1M1]] | P3s<=19]]]] & 4<=P1s]] & [[[2<=P1s | ~ [15<=M2]] | 9<=P2s] | [~ [[[P2s<=18 & P2<=20] & [P3s<=P3s & P12s<=1]]] & [[[[~ [P12wM3<=P2s] & [[P2s<=14 & P1wP2<=18] & [P3s<=9 | P1<=P3s]]] & P2<=P12] | 2<=P12wM3] & ~ [[~ [[P1M1<=P1wP2 & ~ [P1M1<=11]]] | [[P1wM1<=9 & ~ [M2<=P3M2]] & ~ [15<=P12s]]]]]]]]]
normalized: ~ [E [true U ~ [[[[[~ [[[~ [15<=P12s] & [P1wM1<=9 & ~ [M2<=P3M2]]] | ~ [[P1M1<=P1wP2 & ~ [P1M1<=11]]]]] & [2<=P12wM3 | [P2<=P12 & [[[P3s<=9 | P1<=P3s] & [P2s<=14 & P1wP2<=18]] & ~ [P12wM3<=P2s]]]]] & ~ [[[P3s<=P3s & P12s<=1] & [P2s<=18 & P2<=20]]]] | [9<=P2s | [2<=P1s | ~ [15<=M2]]]] & ~ [[4<=P1s & ~ [[~ [[P3s<=19 | ~ [[P12<=P1wM1 & 2<=P1M1]]]] | ~ [M2<=M2]]]]]]]]]
abstracting: (M2<=M2)
states: 6,029,168,852,784 (12)
abstracting: (2<=P1M1)
states: 2,257,088,105,580 (12)
abstracting: (P12<=P1wM1)
states: 4,421,411,310,855 (12)
abstracting: (P3s<=19)
states: 6,003,068,554,720 (12)
abstracting: (4<=P1s)
states: 1,924,155,076,767 (12)
abstracting: (15<=M2)
states: 0
abstracting: (2<=P1s)
states: 3,524,136,450,219 (12)
abstracting: (9<=P2s)
states: 328,737,707,298 (11)
abstracting: (P2<=20)
states: 6,029,168,852,784 (12)
abstracting: (P2s<=18)
states: 6,029,098,470,318 (12)
abstracting: (P12s<=1)
states: 3,889,873,633,338 (12)
abstracting: (P3s<=P3s)
states: 6,029,168,852,784 (12)
abstracting: (P12wM3<=P2s)
states: 4,474,086,660,120 (12)
abstracting: (P1wP2<=18)
states: 6,029,126,911,038 (12)
abstracting: (P2s<=14)
states: 6,020,235,422,586 (12)
abstracting: (P1<=P3s)
states: 4,664,582,459,690 (12)
abstracting: (P3s<=9)
states: 4,306,549,180,560 (12)
abstracting: (P2<=P12)
states: 2,555,867,709,549 (12)
abstracting: (2<=P12wM3)
states: 2,139,295,219,446 (12)
abstracting: (P1M1<=11)
states: 6,029,168,852,784 (12)
abstracting: (P1M1<=P1wP2)
states: 4,512,423,037,353 (12)
abstracting: (M2<=P3M2)
states: 5,722,156,044,129 (12)
abstracting: (P1wM1<=9)
states: 5,858,394,829,749 (12)
abstracting: (15<=P12s)
states: 31,845,198 (7)
-> the formula is FALSE
FORMULA FMS-PT-00020-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.705sec
checking: EF [[~ [13<=P2s] & [[[[13<=P12 & [19<=P2d | [~ [[6<=P12 & P12<=P1M1]] & [~ [14<=M1] | [3<=P2wM2 & 13<=P3]]]]] | [[[[[P12wM3<=2 & P1s<=P12] & P12M3<=M3] | [[P2d<=P2s | P12wM3<=2] | [P3<=P1wP2 & P2M2<=11]]] | [[~ [P1wP2<=20] & P2<=P12wM3] | ~ [[6<=P1s | P1d<=P3M2]]]] & ~ [[[[P1d<=1 | P1s<=P1wM1] & [P1s<=14 & P2s<=7]] & P2s<=8]]]] & 7<=P1M1] | 14<=P1wM1]]]
normalized: E [true U [[14<=P1wM1 | [7<=P1M1 & [[[[[[P3<=P1wP2 & P2M2<=11] | [P2d<=P2s | P12wM3<=2]] | [P12M3<=M3 & [P12wM3<=2 & P1s<=P12]]] | [~ [[6<=P1s | P1d<=P3M2]] | [P2<=P12wM3 & ~ [P1wP2<=20]]]] & ~ [[P2s<=8 & [[P1s<=14 & P2s<=7] & [P1d<=1 | P1s<=P1wM1]]]]] | [13<=P12 & [19<=P2d | [[[3<=P2wM2 & 13<=P3] | ~ [14<=M1]] & ~ [[6<=P12 & P12<=P1M1]]]]]]]] & ~ [13<=P2s]]]
abstracting: (13<=P2s)
states: 38,960,194,350 (10)
abstracting: (P12<=P1M1)
states: 3,793,498,399,845 (12)
abstracting: (6<=P12)
states: 191,104,863,180 (11)
abstracting: (14<=M1)
states: 0
abstracting: (13<=P3)
states: 939,610,730,304 (11)
abstracting: (3<=P2wM2)
states: 2,743,295,249,310 (12)
abstracting: (19<=P2d)
states: 70,382,466 (7)
abstracting: (13<=P12)
states: 422,773,428 (8)
abstracting: (P1s<=P1wM1)
states: 3,396,001,327,950 (12)
abstracting: (P1d<=1)
states: 2,505,032,402,565 (12)
abstracting: (P2s<=7)
states: 5,527,642,267,224 (12)
abstracting: (P1s<=14)
states: 6,023,027,103,786 (12)
abstracting: (P2s<=8)
states: 5,700,431,145,486 (12)
abstracting: (P1wP2<=20)
states: 6,029,168,852,784 (12)
abstracting: (P2<=P12wM3)
states: 2,555,867,709,549 (12)
abstracting: (P1d<=P3M2)
states: 4,664,582,459,690 (12)
abstracting: (6<=P1s)
states: 965,364,682,128 (11)
abstracting: (P1s<=P12)
states: 2,639,844,392,724 (12)
abstracting: (P12wM3<=2)
states: 4,803,056,741,868 (12)
abstracting: (P12M3<=M3)
states: 4,912,161,830,730 (12)
abstracting: (P12wM3<=2)
states: 4,803,056,741,868 (12)
abstracting: (P2d<=P2s)
states: 3,377,140,895,205 (12)
abstracting: (P2M2<=11)
states: 6,029,168,852,784 (12)
abstracting: (P3<=P1wP2)
states: 1,839,892,059,620 (12)
abstracting: (7<=P1M1)
states: 0
abstracting: (14<=P1wM1)
states: 13,996,379,628 (10)
-> the formula is TRUE
FORMULA FMS-PT-00020-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.665sec
checking: AG [[[[~ [[[P2wM2<=P12s & ~ [[~ [M2<=15] | [17<=P2wP1 | M3<=P2wP1]]]] | [[[~ [16<=P12wM3] | [P12M3<=0 | P3s<=14]] & [[1<=P1M1 | 20<=P3M2] | ~ [P2M2<=P1s]]] | [6<=P3 | 1<=P1M1]]]] & ~ [[~ [[[P12wM3<=4 | M3<=7] & ~ [P1<=P1d]]] & ~ [[[P12<=18 | 18<=P3M2] & [P1wM1<=P2M2 & 5<=P1M1]]]]]] | ~ [[[P1s<=P1wP2 | [~ [[~ [P1d<=M2] & ~ [P12M3<=P3M2]]] | ~ [[M3<=P1wM1 & [P12s<=P2wP1 | P2wM2<=P3M2]]]]] | [~ [19<=P2wM2] | [[[~ [P12M3<=P2wM2] | P2s<=P2wM2] & P12M3<=P3] & [~ [7<=P2wM2] & ~ [[P1<=P1 & P2d<=13]]]]]]]] | ~ [6<=P1s]]]
normalized: ~ [E [true U ~ [[~ [6<=P1s] | [~ [[[[[~ [[P1<=P1 & P2d<=13]] & ~ [7<=P2wM2]] & [P12M3<=P3 & [P2s<=P2wM2 | ~ [P12M3<=P2wM2]]]] | ~ [19<=P2wM2]] | [P1s<=P1wP2 | [~ [[M3<=P1wM1 & [P12s<=P2wP1 | P2wM2<=P3M2]]] | ~ [[~ [P12M3<=P3M2] & ~ [P1d<=M2]]]]]]] | [~ [[~ [[[P1wM1<=P2M2 & 5<=P1M1] & [P12<=18 | 18<=P3M2]]] & ~ [[~ [P1<=P1d] & [P12wM3<=4 | M3<=7]]]]] & ~ [[[[6<=P3 | 1<=P1M1] | [[~ [P2M2<=P1s] | [1<=P1M1 | 20<=P3M2]] & [[P12M3<=0 | P3s<=14] | ~ [16<=P12wM3]]]] | [P2wM2<=P12s & ~ [[[17<=P2wP1 | M3<=P2wP1] | ~ [M2<=15]]]]]]]]]]]]
abstracting: (M2<=15)
states: 6,029,168,852,784 (12)
abstracting: (M3<=P2wP1)
states: 4,428,325,431,222 (12)
abstracting: (17<=P2wP1)
states: 1,260,766,584 (9)
abstracting: (P2wM2<=P12s)
states: 2,555,867,709,549 (12)
abstracting: (16<=P12wM3)
states: 6,754,440 (6)
abstracting: (P3s<=14)
states: 5,481,062,593,440 (12)
abstracting: (P12M3<=0)
states: 3,046,261,998,780 (12)
abstracting: (20<=P3M2)
states: 26,100,298,064 (10)
abstracting: (1<=P1M1)
states: 3,914,577,133,929 (12)
abstracting: (P2M2<=P1s)
states: 5,423,142,995,424 (12)
abstracting: (1<=P1M1)
states: 3,914,577,133,929 (12)
abstracting: (6<=P3)
states: 3,132,035,767,680 (12)
abstracting: (M3<=7)
states: 6,029,168,852,784 (12)
abstracting: (P12wM3<=4)
states: 5,661,429,430,272 (12)
abstracting: (P1<=P1d)
states: 3,396,001,327,950 (12)
abstracting: (18<=P3M2)
states: 156,601,788,384 (11)
abstracting: (P12<=18)
states: 6,029,168,843,544 (12)
abstracting: (5<=P1M1)
states: 0
abstracting: (P1wM1<=P2M2)
states: 1,875,651,407,784 (12)
abstracting: (P1d<=M2)
states: 2,013,540,915,771 (12)
abstracting: (P12M3<=P3M2)
states: 5,661,284,937,740 (12)
abstracting: (P2wM2<=P3M2)
states: 4,600,197,985,012 (12)
abstracting: (P12s<=P2wP1)
states: 4,474,086,660,120 (12)
abstracting: (M3<=P1wM1)
states: 4,361,585,458,923 (12)
abstracting: (P1s<=P1wP2)
states: 3,396,001,327,950 (12)
abstracting: (19<=P2wM2)
states: 70,382,466 (7)
abstracting: (P12M3<=P2wM2)
states: 5,147,053,183,965 (12)
abstracting: (P2s<=P2wM2)
states: 3,377,140,895,205 (12)
abstracting: (P12M3<=P3)
states: 5,661,284,937,740 (12)
abstracting: (7<=P2wM2)
states: 740,812,197,972 (11)
abstracting: (P2d<=13)
states: 6,009,629,135,202 (12)
abstracting: (P1<=P1)
states: 6,029,168,852,784 (12)
abstracting: (6<=P1s)
states: 965,364,682,128 (11)
-> the formula is FALSE
FORMULA FMS-PT-00020-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 5.322sec
totally nodes used: 8468732 (8.5e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 51219763 10393495 61613258
used/not used/entry size/cache size: 12104245 55004619 16 1024MB
basic ops cache: hits/miss/sum: 59535355 15271917 74807272
used/not used/entry size/cache size: 12989439 3787777 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: 10116985 2114794 12231779
used/not used/entry size/cache size: 1861062 6527546 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 59390027
1 7190103
2 479201
3 29252
4 5024
5 2782
6 2369
7 2135
8 1688
9 1137
>= 10 5146
Total processing time: 0m25.438sec
BK_STOP 1678494090407
--------------------
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:1560 (78), effective:340 (17)
initing FirstDep: 0m 0.000sec
iterations count:618 (30), effective:117 (5)
iterations count:268 (13), effective:56 (2)
iterations count:148 (7), effective:28 (1)
iterations count:130 (6), effective:33 (1)
iterations count:113 (5), effective:31 (1)
iterations count:141 (7), effective:33 (1)
iterations count:1692 (84), effective:412 (20)
iterations count:241 (12), effective:59 (2)
iterations count:823 (41), effective:206 (10)
iterations count:371 (18), effective:103 (5)
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-00020"
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-00020, 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-167838856900214"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FMS-PT-00020.tgz
mv FMS-PT-00020 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 ;