About the Execution of Marcie+red for SmallOperatingSystem-PT-MT0256DC0064
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 7552.659 | 59349.00 | 63745.00 | 1428.80 | TFTFTTTFTFFTFTFF | 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.r458-smll-167912649800058.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 SmallOperatingSystem-PT-MT0256DC0064, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r458-smll-167912649800058
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 8.0K Feb 25 12:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 12:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 12:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 12:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 17:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 17:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 25 12:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Feb 25 12:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 12:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 25 12:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 17:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Feb 25 17:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 13 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 8.1K Mar 5 18:23 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 SmallOperatingSystem-PT-MT0256DC0064-CTLFireability-00
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0064-CTLFireability-01
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0064-CTLFireability-02
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0064-CTLFireability-03
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0064-CTLFireability-04
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0064-CTLFireability-05
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0064-CTLFireability-06
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0064-CTLFireability-07
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0064-CTLFireability-08
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0064-CTLFireability-09
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0064-CTLFireability-10
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0064-CTLFireability-11
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0064-CTLFireability-12
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0064-CTLFireability-13
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0064-CTLFireability-14
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0064-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679231789034
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=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SmallOperatingSystem-PT-MT0256DC0064
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-19 13:16:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 13:16:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 13:16:31] [INFO ] Load time of PNML (sax parser for PT used): 30 ms
[2023-03-19 13:16:31] [INFO ] Transformed 9 places.
[2023-03-19 13:16:31] [INFO ] Transformed 8 transitions.
[2023-03-19 13:16:31] [INFO ] Parsed PT model containing 9 places and 8 transitions and 27 arcs in 124 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 17 ms.
Initial state reduction rules removed 3 formulas.
FORMULA SmallOperatingSystem-PT-MT0256DC0064-CTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0256DC0064-CTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0256DC0064-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 12 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 9 cols
[2023-03-19 13:16:31] [INFO ] Computed 4 place invariants in 6 ms
[2023-03-19 13:16:32] [INFO ] Implicit Places using invariants in 225 ms returned []
[2023-03-19 13:16:32] [INFO ] Invariant cache hit.
[2023-03-19 13:16:32] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
[2023-03-19 13:16:32] [INFO ] Invariant cache hit.
[2023-03-19 13:16:32] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 371 ms. Remains : 9/9 places, 8/8 transitions.
Support contains 9 out of 9 places after structural reductions.
[2023-03-19 13:16:32] [INFO ] Flatten gal took : 19 ms
[2023-03-19 13:16:32] [INFO ] Flatten gal took : 6 ms
[2023-03-19 13:16:32] [INFO ] Input system was already deterministic with 8 transitions.
Finished random walk after 910 steps, including 0 resets, run visited all 17 properties in 25 ms. (steps per millisecond=36 )
[2023-03-19 13:16:32] [INFO ] Flatten gal took : 3 ms
[2023-03-19 13:16:32] [INFO ] Flatten gal took : 4 ms
[2023-03-19 13:16:32] [INFO ] Input system was already deterministic with 8 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 8
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 7 transition count 7
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 7 transition count 7
Applied a total of 3 rules in 4 ms. Remains 7 /9 variables (removed 2) and now considering 7/8 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 7/9 places, 7/8 transitions.
[2023-03-19 13:16:32] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:16:32] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:16:32] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 8/8 transitions.
[2023-03-19 13:16:32] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:16:32] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:16:32] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 8/8 transitions.
[2023-03-19 13:16:32] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:16:32] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:16:32] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 8/8 transitions.
[2023-03-19 13:16:32] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:16:32] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:16:32] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 4 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 9/9 places, 8/8 transitions.
[2023-03-19 13:16:32] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:16:32] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:16:32] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 8
Applied a total of 1 rules in 1 ms. Remains 8 /9 variables (removed 1) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 8/9 places, 8/8 transitions.
[2023-03-19 13:16:32] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:16:32] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:16:32] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Applied a total of 0 rules in 5 ms. Remains 8 /9 variables (removed 1) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 8/9 places, 8/8 transitions.
[2023-03-19 13:16:32] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:16:32] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:16:32] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 7 transition count 7
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 7 transition count 7
Applied a total of 2 rules in 2 ms. Remains 7 /9 variables (removed 2) and now considering 7/8 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 7/9 places, 7/8 transitions.
[2023-03-19 13:16:32] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:16:32] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:16:32] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 9/9 places, 8/8 transitions.
[2023-03-19 13:16:32] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:16:32] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:16:32] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 8
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 7 transition count 7
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 7 transition count 7
Applied a total of 3 rules in 2 ms. Remains 7 /9 variables (removed 2) and now considering 7/8 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 7/9 places, 7/8 transitions.
[2023-03-19 13:16:32] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:16:32] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:16:32] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 8
Applied a total of 1 rules in 1 ms. Remains 8 /9 variables (removed 1) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 8/9 places, 8/8 transitions.
[2023-03-19 13:16:32] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:16:32] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:16:32] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 8
Applied a total of 1 rules in 1 ms. Remains 8 /9 variables (removed 1) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 8/9 places, 8/8 transitions.
[2023-03-19 13:16:32] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:16:32] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:16:32] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 8
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 7 transition count 7
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 7 transition count 7
Applied a total of 3 rules in 2 ms. Remains 7 /9 variables (removed 2) and now considering 7/8 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 7/9 places, 7/8 transitions.
[2023-03-19 13:16:32] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:16:32] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:16:32] [INFO ] Input system was already deterministic with 7 transitions.
[2023-03-19 13:16:32] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:16:32] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:16:32] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-19 13:16:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 9 places, 8 transitions and 27 arcs took 0 ms.
Total runtime 1307 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=CTLFireability.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: Petri
(NrP: 9 NrTr: 8 NrArc: 27)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 3.633sec
RS generation: 0m 4.479sec
-> reachability set: #nodes 5193 (5.2e+03) #states 3,372,388,305 (9)
starting MCC model checker
--------------------------
checking: AG [AX [1<=p4]]
normalized: ~ [E [true U EX [~ [1<=p4]]]]
abstracting: (1<=p4)
states: 3,330,790,320 (9)
.-> the formula is FALSE
FORMULA SmallOperatingSystem-PT-MT0256DC0064-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.780sec
checking: EX [1<=p3]
normalized: EX [1<=p3]
abstracting: (1<=p3)
states: 3,255,750,160 (9)
.-> the formula is FALSE
FORMULA SmallOperatingSystem-PT-MT0256DC0064-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.224sec
checking: EX [[AF [1<=p4] | 1<=p7]]
normalized: EX [[1<=p7 | ~ [EG [~ [1<=p4]]]]]
abstracting: (1<=p4)
states: 3,330,790,320 (9)
..................................................................
EG iterations: 66
abstracting: (1<=p7)
states: 3,322,633,600 (9)
.-> the formula is TRUE
FORMULA SmallOperatingSystem-PT-MT0256DC0064-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.526sec
checking: EF [AX [~ [E [1<=p4 U 1<=p8]]]]
normalized: E [true U ~ [EX [E [1<=p4 U 1<=p8]]]]
abstracting: (1<=p8)
states: 3,255,750,160 (9)
abstracting: (1<=p4)
states: 3,330,790,320 (9)
.-> the formula is TRUE
FORMULA SmallOperatingSystem-PT-MT0256DC0064-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.183sec
checking: ~ [A [1<=p7 U AG [EF [[1<=p4 & 1<=p6]]]]]
normalized: ~ [[~ [EG [E [true U ~ [E [true U [1<=p4 & 1<=p6]]]]]] & ~ [E [E [true U ~ [E [true U [1<=p4 & 1<=p6]]]] U [E [true U ~ [E [true U [1<=p4 & 1<=p6]]]] & ~ [1<=p7]]]]]]
abstracting: (1<=p7)
states: 3,322,633,600 (9)
abstracting: (1<=p6)
states: 3,364,046,400 (9)
abstracting: (1<=p4)
states: 3,330,790,320 (9)
abstracting: (1<=p6)
states: 3,364,046,400 (9)
abstracting: (1<=p4)
states: 3,330,790,320 (9)
abstracting: (1<=p6)
states: 3,364,046,400 (9)
abstracting: (1<=p4)
states: 3,330,790,320 (9)
.
EG iterations: 1
-> the formula is FALSE
FORMULA SmallOperatingSystem-PT-MT0256DC0064-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.025sec
checking: AX [[AG [EX [p7<=0]] & [EF [1<=p7] & 1<=p4]]]
normalized: ~ [EX [~ [[[1<=p4 & E [true U 1<=p7]] & ~ [E [true U ~ [EX [p7<=0]]]]]]]]
abstracting: (p7<=0)
states: 49,754,705 (7)
.abstracting: (1<=p7)
states: 3,322,633,600 (9)
abstracting: (1<=p4)
states: 3,330,790,320 (9)
.-> the formula is FALSE
FORMULA SmallOperatingSystem-PT-MT0256DC0064-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.137sec
checking: AG [[EG [[1<=p3 | [[1<=p4 & 1<=p6] | EF [1<=p3]]]] & EG [EF [p4<=0]]]]
normalized: ~ [E [true U ~ [[EG [E [true U p4<=0]] & EG [[1<=p3 | [E [true U 1<=p3] | [1<=p4 & 1<=p6]]]]]]]]
abstracting: (1<=p6)
states: 3,364,046,400 (9)
abstracting: (1<=p4)
states: 3,330,790,320 (9)
abstracting: (1<=p3)
states: 3,255,750,160 (9)
abstracting: (1<=p3)
states: 3,255,750,160 (9)
EG iterations: 0
abstracting: (p4<=0)
states: 41,597,985 (7)
EG iterations: 0
-> the formula is TRUE
FORMULA SmallOperatingSystem-PT-MT0256DC0064-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.096sec
checking: AG [[EF [[AX [p8<=0] & ~ [A [1<=p3 U 1<=p8]]]] | [1<=p3 & EG [EF [[p5<=0 | p6<=0]]]]]]
normalized: ~ [E [true U ~ [[[1<=p3 & EG [E [true U [p5<=0 | p6<=0]]]] | E [true U [~ [[~ [EG [~ [1<=p8]]] & ~ [E [~ [1<=p8] U [~ [1<=p3] & ~ [1<=p8]]]]]] & ~ [EX [~ [p8<=0]]]]]]]]]
abstracting: (p8<=0)
states: 116,638,145 (8)
.abstracting: (1<=p8)
states: 3,255,750,160 (9)
abstracting: (1<=p3)
states: 3,255,750,160 (9)
abstracting: (1<=p8)
states: 3,255,750,160 (9)
abstracting: (1<=p8)
states: 3,255,750,160 (9)
..
EG iterations: 2
abstracting: (p6<=0)
states: 8,341,905 (6)
abstracting: (p5<=0)
states: 41,597,985 (7)
EG iterations: 0
abstracting: (1<=p3)
states: 3,255,750,160 (9)
-> the formula is TRUE
FORMULA SmallOperatingSystem-PT-MT0256DC0064-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m17.648sec
checking: EX [[AF [[1<=p5 & 1<=p6]] | [AG [EX [p8<=0]] | [[EF [AG [[1<=p0 & [1<=p2 & 1<=p5]]]] & 1<=p0] & [1<=p1 & 1<=p2]]]]]
normalized: EX [[[[[1<=p1 & 1<=p2] & [1<=p0 & E [true U ~ [E [true U ~ [[1<=p0 & [1<=p2 & 1<=p5]]]]]]]] | ~ [E [true U ~ [EX [p8<=0]]]]] | ~ [EG [~ [[1<=p5 & 1<=p6]]]]]]
abstracting: (1<=p6)
states: 3,364,046,400 (9)
abstracting: (1<=p5)
states: 3,330,790,320 (9)
.
EG iterations: 1
abstracting: (p8<=0)
states: 116,638,145 (8)
.abstracting: (1<=p5)
states: 3,330,790,320 (9)
abstracting: (1<=p2)
states: 3,296,266,480 (9)
abstracting: (1<=p0)
states: 3,372,388,305 (9)
abstracting: (1<=p0)
states: 3,372,388,305 (9)
abstracting: (1<=p2)
states: 3,296,266,480 (9)
abstracting: (1<=p1)
states: 3,330,790,320 (9)
.-> the formula is FALSE
FORMULA SmallOperatingSystem-PT-MT0256DC0064-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.027sec
checking: EX [[~ [A [[[1<=p0 & [1<=p1 & 1<=p2]] | ~ [EF [[1<=p5 & 1<=p6]]]] U [A [1<=p4 U 1<=p4] | [E [1<=p4 U 1<=p3] | 1<=p4]]]] | [A [AF [[1<=p0 & [1<=p2 & 1<=p5]]] U p3<=0] & EG [[p0<=0 | [p1<=0 | p2<=0]]]]]]
normalized: EX [[[EG [[p0<=0 | [p1<=0 | p2<=0]]] & [~ [EG [~ [p3<=0]]] & ~ [E [~ [p3<=0] U [EG [~ [[1<=p0 & [1<=p2 & 1<=p5]]]] & ~ [p3<=0]]]]]] | ~ [[~ [EG [~ [[[1<=p4 | E [1<=p4 U 1<=p3]] | [~ [EG [~ [1<=p4]]] & ~ [E [~ [1<=p4] U [~ [1<=p4] & ~ [1<=p4]]]]]]]]] & ~ [E [~ [[[1<=p4 | E [1<=p4 U 1<=p3]] | [~ [EG [~ [1<=p4]]] & ~ [E [~ [1<=p4] U [~ [1<=p4] & ~ [1<=p4]]]]]]] U [~ [[~ [E [true U [1<=p5 & 1<=p6]]] | [1<=p0 & [1<=p1 & 1<=p2]]]] & ~ [[[1<=p4 | E [1<=p4 U 1<=p3]] | [~ [EG [~ [1<=p4]]] & ~ [E [~ [1<=p4] U [~ [1<=p4] & ~ [1<=p4]]]]]]]]]]]]]]
abstracting: (1<=p4)
states: 3,330,790,320 (9)
abstracting: (1<=p4)
states: 3,330,790,320 (9)
abstracting: (1<=p4)
states: 3,330,790,320 (9)
abstracting: (1<=p4)
states: 3,330,790,320 (9)
..................................................................
EG iterations: 66
abstracting: (1<=p3)
states: 3,255,750,160 (9)
abstracting: (1<=p4)
states: 3,330,790,320 (9)
abstracting: (1<=p4)
states: 3,330,790,320 (9)
abstracting: (1<=p2)
states: 3,296,266,480 (9)
abstracting: (1<=p1)
states: 3,330,790,320 (9)
abstracting: (1<=p0)
states: 3,372,388,305 (9)
abstracting: (1<=p6)
states: 3,364,046,400 (9)
abstracting: (1<=p5)
states: 3,330,790,320 (9)
abstracting: (1<=p4)
states: 3,330,790,320 (9)
abstracting: (1<=p4)
states: 3,330,790,320 (9)
abstracting: (1<=p4)
states: 3,330,790,320 (9)
abstracting: (1<=p4)
states: 3,330,790,320 (9)
..................................................................
EG iterations: 66
abstracting: (1<=p3)
states: 3,255,750,160 (9)
abstracting: (1<=p4)
states: 3,330,790,320 (9)
abstracting: (1<=p4)
states: 3,330,790,320 (9)
abstracting: (1<=p4)
states: 3,330,790,320 (9)
abstracting: (1<=p4)
states: 3,330,790,320 (9)
abstracting: (1<=p4)
states: 3,330,790,320 (9)
abstracting: (1<=p4)
states: 3,330,790,320 (9)
..................................................................
EG iterations: 66
abstracting: (1<=p3)
states: 3,255,750,160 (9)
abstracting: (1<=p4)
states: 3,330,790,320 (9)
abstracting: (1<=p4)
states: 3,330,790,320 (9)
..................................................................
EG iterations: 66
abstracting: (p3<=0)
states: 116,638,145 (8)
abstracting: (1<=p5)
states: 3,330,790,320 (9)
abstracting: (1<=p2)
states: 3,296,266,480 (9)
abstracting: (1<=p0)
states: 3,372,388,305 (9)
.
EG iterations: 1
abstracting: (p3<=0)
states: 116,638,145 (8)
abstracting: (p3<=0)
states: 116,638,145 (8)
.
EG iterations: 1
abstracting: (p2<=0)
states: 76,121,825 (7)
abstracting: (p1<=0)
states: 41,597,985 (7)
abstracting: (p0<=0)
states: 0
..
EG iterations: 2
.-> the formula is TRUE
FORMULA SmallOperatingSystem-PT-MT0256DC0064-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 4.906sec
checking: AG [E [EF [[1<=p0 & [1<=p2 & 1<=p5]]] U [~ [[[[1<=p4 & [1<=p0 & 1<=p2]] & [1<=p5 & [1<=p5 & 1<=p6]]] | ~ [A [1<=p8 U 1<=p8]]]] | ~ [[p3<=0 | E [[1<=p4 & 1<=p6] U [1<=p0 & [1<=p1 & 1<=p2]]]]]]]]
normalized: ~ [E [true U ~ [E [E [true U [1<=p0 & [1<=p2 & 1<=p5]]] U [~ [[p3<=0 | E [[1<=p4 & 1<=p6] U [1<=p0 & [1<=p1 & 1<=p2]]]]] | ~ [[~ [[~ [EG [~ [1<=p8]]] & ~ [E [~ [1<=p8] U [~ [1<=p8] & ~ [1<=p8]]]]]] | [[1<=p5 & [1<=p5 & 1<=p6]] & [1<=p4 & [1<=p0 & 1<=p2]]]]]]]]]]
abstracting: (1<=p2)
states: 3,296,266,480 (9)
abstracting: (1<=p0)
states: 3,372,388,305 (9)
abstracting: (1<=p4)
states: 3,330,790,320 (9)
abstracting: (1<=p6)
states: 3,364,046,400 (9)
abstracting: (1<=p5)
states: 3,330,790,320 (9)
abstracting: (1<=p5)
states: 3,330,790,320 (9)
abstracting: (1<=p8)
states: 3,255,750,160 (9)
abstracting: (1<=p8)
states: 3,255,750,160 (9)
abstracting: (1<=p8)
states: 3,255,750,160 (9)
abstracting: (1<=p8)
states: 3,255,750,160 (9)
..
EG iterations: 2
abstracting: (1<=p2)
states: 3,296,266,480 (9)
abstracting: (1<=p1)
states: 3,330,790,320 (9)
abstracting: (1<=p0)
states: 3,372,388,305 (9)
abstracting: (1<=p6)
states: 3,364,046,400 (9)
abstracting: (1<=p4)
states: 3,330,790,320 (9)
abstracting: (p3<=0)
states: 116,638,145 (8)
abstracting: (1<=p5)
states: 3,330,790,320 (9)
abstracting: (1<=p2)
states: 3,296,266,480 (9)
abstracting: (1<=p0)
states: 3,372,388,305 (9)
-> the formula is TRUE
FORMULA SmallOperatingSystem-PT-MT0256DC0064-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.965sec
checking: ~ [A [[[[[[A [[1<=p4 & 1<=p6] U [1<=p0 & [1<=p1 & 1<=p2]]] | EG [1<=p7]] & 1<=p0] & [1<=p2 & [1<=p5 & AF [[[1<=p0 & [1<=p1 & 1<=p2]] | 1<=p8]]]]] | AF [EX [1<=p3]]] & EX [~ [E [1<=p7 U [1<=p0 & [1<=p2 & 1<=p5]]]]]] U AF [[~ [[1<=p7 & [[1<=p0 & [1<=p1 & 1<=p2]] | 1<=p7]]] & [1<=p4 & 1<=p6]]]]]
normalized: ~ [[~ [EG [EG [~ [[[1<=p4 & 1<=p6] & ~ [[1<=p7 & [1<=p7 | [1<=p0 & [1<=p1 & 1<=p2]]]]]]]]]] & ~ [E [EG [~ [[[1<=p4 & 1<=p6] & ~ [[1<=p7 & [1<=p7 | [1<=p0 & [1<=p1 & 1<=p2]]]]]]]] U [~ [[EX [~ [E [1<=p7 U [1<=p0 & [1<=p2 & 1<=p5]]]]] & [~ [EG [~ [EX [1<=p3]]]] | [[1<=p2 & [1<=p5 & ~ [EG [~ [[1<=p8 | [1<=p0 & [1<=p1 & 1<=p2]]]]]]]] & [1<=p0 & [EG [1<=p7] | [~ [EG [~ [[1<=p0 & [1<=p1 & 1<=p2]]]]] & ~ [E [~ [[1<=p0 & [1<=p1 & 1<=p2]]] U [~ [[1<=p4 & 1<=p6]] & ~ [[1<=p0 & [1<=p1 & 1<=p2]]]]]]]]]]]]] & EG [~ [[[1<=p4 & 1<=p6] & ~ [[1<=p7 & [1<=p7 | [1<=p0 & [1<=p1 & 1<=p2]]]]]]]]]]]]]
abstracting: (1<=p2)
states: 3,296,266,480 (9)
abstracting: (1<=p1)
states: 3,330,790,320 (9)
abstracting: (1<=p0)
states: 3,372,388,305 (9)
abstracting: (1<=p7)
states: 3,322,633,600 (9)
abstracting: (1<=p7)
states: 3,322,633,600 (9)
abstracting: (1<=p6)
states: 3,364,046,400 (9)
abstracting: (1<=p4)
states: 3,330,790,320 (9)
..................................................................
EG iterations: 66
abstracting: (1<=p2)
states: 3,296,266,480 (9)
abstracting: (1<=p1)
states: 3,330,790,320 (9)
abstracting: (1<=p0)
states: 3,372,388,305 (9)
abstracting: (1<=p6)
states: 3,364,046,400 (9)
abstracting: (1<=p4)
states: 3,330,790,320 (9)
abstracting: (1<=p2)
states: 3,296,266,480 (9)
abstracting: (1<=p1)
states: 3,330,790,320 (9)
abstracting: (1<=p0)
states: 3,372,388,305 (9)
abstracting: (1<=p2)
states: 3,296,266,480 (9)
abstracting: (1<=p1)
states: 3,330,790,320 (9)
abstracting: (1<=p0)
states: 3,372,388,305 (9)
..
EG iterations: 2
abstracting: (1<=p7)
states: 3,322,633,600 (9)
.
EG iterations: 1
abstracting: (1<=p0)
states: 3,372,388,305 (9)
abstracting: (1<=p2)
states: 3,296,266,480 (9)
abstracting: (1<=p1)
states: 3,330,790,320 (9)
abstracting: (1<=p0)
states: 3,372,388,305 (9)
abstracting: (1<=p8)
states: 3,255,750,160 (9)
..
EG iterations: 2
abstracting: (1<=p5)
states: 3,330,790,320 (9)
abstracting: (1<=p2)
states: 3,296,266,480 (9)
abstracting: (1<=p3)
states: 3,255,750,160 (9)
..
EG iterations: 1
abstracting: (1<=p5)
states: 3,330,790,320 (9)
abstracting: (1<=p2)
states: 3,296,266,480 (9)
abstracting: (1<=p0)
states: 3,372,388,305 (9)
abstracting: (1<=p7)
states: 3,322,633,600 (9)
.abstracting: (1<=p2)
states: 3,296,266,480 (9)
abstracting: (1<=p1)
states: 3,330,790,320 (9)
abstracting: (1<=p0)
states: 3,372,388,305 (9)
abstracting: (1<=p7)
states: 3,322,633,600 (9)
abstracting: (1<=p7)
states: 3,322,633,600 (9)
abstracting: (1<=p6)
states: 3,364,046,400 (9)
abstracting: (1<=p4)
states: 3,330,790,320 (9)
..................................................................
EG iterations: 66
abstracting: (1<=p2)
states: 3,296,266,480 (9)
abstracting: (1<=p1)
states: 3,330,790,320 (9)
abstracting: (1<=p0)
states: 3,372,388,305 (9)
abstracting: (1<=p7)
states: 3,322,633,600 (9)
abstracting: (1<=p7)
states: 3,322,633,600 (9)
abstracting: (1<=p6)
states: 3,364,046,400 (9)
abstracting: (1<=p4)
states: 3,330,790,320 (9)
..................................................................
EG iterations: 66
.
EG iterations: 1
-> the formula is FALSE
FORMULA SmallOperatingSystem-PT-MT0256DC0064-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 6.759sec
checking: [[AX [[E [EG [A [1<=p7 U [1<=p0 & [1<=p2 & 1<=p5]]]] U [1<=p5 & 1<=p6]] | [EX [[[p5<=0 | p6<=0] | [p4<=0 | p6<=0]]] | [[~ [A [1<=p3 U 1<=p3]] & [p0<=0 | [p2<=0 | p5<=0]]] & [[p5<=0 | p6<=0] & p8<=0]]]]] & EF [[p0<=0 | [p1<=0 | p2<=0]]]] & [EX [[[p7<=0 & [EX [p8<=0] & [p4<=0 | p6<=0]]] | AX [p7<=0]]] & EF [[1<=p0 & [1<=p2 & 1<=p5]]]]]
normalized: [[E [true U [1<=p0 & [1<=p2 & 1<=p5]]] & EX [[~ [EX [~ [p7<=0]]] | [p7<=0 & [[p4<=0 | p6<=0] & EX [p8<=0]]]]]] & [E [true U [p0<=0 | [p1<=0 | p2<=0]]] & ~ [EX [~ [[[[[p8<=0 & [p5<=0 | p6<=0]] & [[p0<=0 | [p2<=0 | p5<=0]] & ~ [[~ [EG [~ [1<=p3]]] & ~ [E [~ [1<=p3] U [~ [1<=p3] & ~ [1<=p3]]]]]]]] | EX [[[p4<=0 | p6<=0] | [p5<=0 | p6<=0]]]] | E [EG [[~ [EG [~ [[1<=p0 & [1<=p2 & 1<=p5]]]]] & ~ [E [~ [[1<=p0 & [1<=p2 & 1<=p5]]] U [~ [1<=p7] & ~ [[1<=p0 & [1<=p2 & 1<=p5]]]]]]]] U [1<=p5 & 1<=p6]]]]]]]]
abstracting: (1<=p6)
states: 3,364,046,400 (9)
abstracting: (1<=p5)
states: 3,330,790,320 (9)
abstracting: (1<=p5)
states: 3,330,790,320 (9)
abstracting: (1<=p2)
states: 3,296,266,480 (9)
abstracting: (1<=p0)
states: 3,372,388,305 (9)
abstracting: (1<=p7)
states: 3,322,633,600 (9)
abstracting: (1<=p5)
states: 3,330,790,320 (9)
abstracting: (1<=p2)
states: 3,296,266,480 (9)
abstracting: (1<=p0)
states: 3,372,388,305 (9)
abstracting: (1<=p5)
states: 3,330,790,320 (9)
abstracting: (1<=p2)
states: 3,296,266,480 (9)
abstracting: (1<=p0)
states: 3,372,388,305 (9)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p6<=0)
states: 8,341,905 (6)
abstracting: (p5<=0)
states: 41,597,985 (7)
abstracting: (p6<=0)
states: 8,341,905 (6)
abstracting: (p4<=0)
states: 41,597,985 (7)
.abstracting: (1<=p3)
states: 3,255,750,160 (9)
abstracting: (1<=p3)
states: 3,255,750,160 (9)
abstracting: (1<=p3)
states: 3,255,750,160 (9)
abstracting: (1<=p3)
states: 3,255,750,160 (9)
.
EG iterations: 1
abstracting: (p5<=0)
states: 41,597,985 (7)
abstracting: (p2<=0)
states: 76,121,825 (7)
abstracting: (p0<=0)
states: 0
abstracting: (p6<=0)
states: 8,341,905 (6)
abstracting: (p5<=0)
states: 41,597,985 (7)
abstracting: (p8<=0)
states: 116,638,145 (8)
.abstracting: (p2<=0)
states: 76,121,825 (7)
abstracting: (p1<=0)
states: 41,597,985 (7)
abstracting: (p0<=0)
states: 0
abstracting: (p8<=0)
states: 116,638,145 (8)
.abstracting: (p6<=0)
states: 8,341,905 (6)
abstracting: (p4<=0)
states: 41,597,985 (7)
abstracting: (p7<=0)
states: 49,754,705 (7)
abstracting: (p7<=0)
states: 49,754,705 (7)
..abstracting: (1<=p5)
states: 3,330,790,320 (9)
abstracting: (1<=p2)
states: 3,296,266,480 (9)
abstracting: (1<=p0)
states: 3,372,388,305 (9)
-> the formula is TRUE
FORMULA SmallOperatingSystem-PT-MT0256DC0064-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.464sec
totally nodes used: 1209021 (1.2e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 287970232 7757085 295727317
used/not used/entry size/cache size: 4773244 62335620 16 1024MB
basic ops cache: hits/miss/sum: 63509943 1158092 64668035
used/not used/entry size/cache size: 1740287 15036929 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: 674927 12530 687457
used/not used/entry size/cache size: 12524 8376084 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 66139501
1 893228
2 49804
3 11580
4 11011
5 946
6 111
7 58
8 82
9 56
>= 10 2487
Total processing time: 0m53.729sec
BK_STOP 1679231848383
--------------------
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 CTLFireability -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:4168 (521), effective:1088 (136)
initing FirstDep: 0m 0.000sec
iterations count:1031 (128), effective:257 (32)
iterations count:22 (2), effective:5 (0)
iterations count:3592 (449), effective:1152 (144)
iterations count:23 (2), effective:5 (0)
iterations count:23 (2), effective:5 (0)
iterations count:23 (2), effective:5 (0)
iterations count:42 (5), effective:10 (1)
iterations count:25 (3), effective:5 (0)
iterations count:30 (3), effective:6 (0)
iterations count:1032 (129), effective:256 (32)
iterations count:72 (9), effective:64 (8)
iterations count:1480 (185), effective:704 (88)
iterations count:1864 (233), effective:640 (80)
iterations count:36 (4), effective:10 (1)
iterations count:776 (97), effective:192 (24)
iterations count:8 (1), effective:0 (0)
iterations count:30 (3), effective:6 (0)
iterations count:24 (3), effective:5 (0)
iterations count:8 (1), effective:0 (0)
iterations count:30 (3), effective:6 (0)
iterations count:200 (25), effective:64 (8)
iterations count:8 (1), effective:0 (0)
iterations count:30 (3), effective:6 (0)
iterations count:764 (95), effective:189 (23)
iterations count:8 (1), effective:0 (0)
iterations count:18 (2), effective:5 (0)
iterations count:27 (3), effective:7 (0)
iterations count:462 (57), effective:130 (16)
iterations count:1864 (233), effective:384 (48)
iterations count:24 (3), effective:6 (0)
iterations count:206 (25), effective:66 (8)
iterations count:520 (65), effective:128 (16)
iterations count:12 (1), effective:1 (0)
iterations count:8 (1), effective:0 (0)
iterations count:200 (25), effective:64 (8)
iterations count:27 (3), effective:7 (0)
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="SmallOperatingSystem-PT-MT0256DC0064"
export BK_EXAMINATION="CTLFireability"
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 SmallOperatingSystem-PT-MT0256DC0064, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r458-smll-167912649800058"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SmallOperatingSystem-PT-MT0256DC0064.tgz
mv SmallOperatingSystem-PT-MT0256DC0064 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;