About the Execution of Marcie+red for FlexibleBarrier-PT-04a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5448.756 | 8992.00 | 13156.00 | 474.40 | FTTTFFTFFTFTTFTT | 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-167838857200442.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 FlexibleBarrier-PT-04a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838857200442
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 6.7K Feb 25 12:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 12:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 12:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 12:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 25 12:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 12:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 25 12:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 23K 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 FlexibleBarrier-PT-04a-CTLFireability-00
FORMULA_NAME FlexibleBarrier-PT-04a-CTLFireability-01
FORMULA_NAME FlexibleBarrier-PT-04a-CTLFireability-02
FORMULA_NAME FlexibleBarrier-PT-04a-CTLFireability-03
FORMULA_NAME FlexibleBarrier-PT-04a-CTLFireability-04
FORMULA_NAME FlexibleBarrier-PT-04a-CTLFireability-05
FORMULA_NAME FlexibleBarrier-PT-04a-CTLFireability-06
FORMULA_NAME FlexibleBarrier-PT-04a-CTLFireability-07
FORMULA_NAME FlexibleBarrier-PT-04a-CTLFireability-08
FORMULA_NAME FlexibleBarrier-PT-04a-CTLFireability-09
FORMULA_NAME FlexibleBarrier-PT-04a-CTLFireability-10
FORMULA_NAME FlexibleBarrier-PT-04a-CTLFireability-11
FORMULA_NAME FlexibleBarrier-PT-04a-CTLFireability-12
FORMULA_NAME FlexibleBarrier-PT-04a-CTLFireability-13
FORMULA_NAME FlexibleBarrier-PT-04a-CTLFireability-14
FORMULA_NAME FlexibleBarrier-PT-04a-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1678549826890
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=FlexibleBarrier-PT-04a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 15:50:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 15:50:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 15:50:28] [INFO ] Load time of PNML (sax parser for PT used): 35 ms
[2023-03-11 15:50:28] [INFO ] Transformed 51 places.
[2023-03-11 15:50:28] [INFO ] Transformed 88 transitions.
[2023-03-11 15:50:28] [INFO ] Found NUPN structural information;
[2023-03-11 15:50:28] [INFO ] Parsed PT model containing 51 places and 88 transitions and 309 arcs in 101 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
FORMULA FlexibleBarrier-PT-04a-CTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04a-CTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 78/78 transitions.
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 51 transition count 74
Applied a total of 4 rules in 31 ms. Remains 51 /51 variables (removed 0) and now considering 74/78 (removed 4) transitions.
// Phase 1: matrix 74 rows 51 cols
[2023-03-11 15:50:28] [INFO ] Computed 6 place invariants in 4 ms
[2023-03-11 15:50:29] [INFO ] Implicit Places using invariants in 425 ms returned []
[2023-03-11 15:50:29] [INFO ] Invariant cache hit.
[2023-03-11 15:50:29] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-11 15:50:29] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 558 ms to find 0 implicit places.
[2023-03-11 15:50:29] [INFO ] Invariant cache hit.
[2023-03-11 15:50:29] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 51/51 places, 74/78 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 671 ms. Remains : 51/51 places, 74/78 transitions.
Support contains 43 out of 51 places after structural reductions.
[2023-03-11 15:50:29] [INFO ] Flatten gal took : 22 ms
[2023-03-11 15:50:29] [INFO ] Flatten gal took : 9 ms
[2023-03-11 15:50:29] [INFO ] Input system was already deterministic with 74 transitions.
Support contains 42 out of 51 places (down from 43) after GAL structural reductions.
Finished random walk after 1664 steps, including 0 resets, run visited all 54 properties in 84 ms. (steps per millisecond=19 )
[2023-03-11 15:50:29] [INFO ] Flatten gal took : 4 ms
[2023-03-11 15:50:29] [INFO ] Flatten gal took : 6 ms
[2023-03-11 15:50:29] [INFO ] Input system was already deterministic with 74 transitions.
Computed a total of 3 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Applied a total of 0 rules in 2 ms. Remains 51 /51 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 51/51 places, 74/74 transitions.
[2023-03-11 15:50:29] [INFO ] Flatten gal took : 4 ms
[2023-03-11 15:50:29] [INFO ] Flatten gal took : 4 ms
[2023-03-11 15:50:29] [INFO ] Input system was already deterministic with 74 transitions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Applied a total of 0 rules in 2 ms. Remains 51 /51 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 51/51 places, 74/74 transitions.
[2023-03-11 15:50:29] [INFO ] Flatten gal took : 3 ms
[2023-03-11 15:50:29] [INFO ] Flatten gal took : 4 ms
[2023-03-11 15:50:29] [INFO ] Input system was already deterministic with 74 transitions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Applied a total of 0 rules in 6 ms. Remains 51 /51 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 51/51 places, 74/74 transitions.
[2023-03-11 15:50:29] [INFO ] Flatten gal took : 3 ms
[2023-03-11 15:50:29] [INFO ] Flatten gal took : 4 ms
[2023-03-11 15:50:29] [INFO ] Input system was already deterministic with 74 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Graph (trivial) has 34 edges and 51 vertex of which 6 / 51 are part of one of the 2 SCC in 2 ms
Free SCC test removed 4 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 44 transition count 66
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 44 transition count 59
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 14 place count 44 transition count 58
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 43 transition count 58
Applied a total of 16 rules in 18 ms. Remains 43 /51 variables (removed 8) and now considering 58/74 (removed 16) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 43/51 places, 58/74 transitions.
[2023-03-11 15:50:29] [INFO ] Flatten gal took : 2 ms
[2023-03-11 15:50:29] [INFO ] Flatten gal took : 2 ms
[2023-03-11 15:50:29] [INFO ] Input system was already deterministic with 58 transitions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Applied a total of 0 rules in 2 ms. Remains 51 /51 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 51/51 places, 74/74 transitions.
[2023-03-11 15:50:30] [INFO ] Flatten gal took : 3 ms
[2023-03-11 15:50:30] [INFO ] Flatten gal took : 3 ms
[2023-03-11 15:50:30] [INFO ] Input system was already deterministic with 74 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Graph (trivial) has 31 edges and 51 vertex of which 6 / 51 are part of one of the 2 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 43 transition count 65
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 14 place count 43 transition count 60
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 17 place count 43 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 42 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 42 transition count 59
Applied a total of 19 rules in 18 ms. Remains 42 /51 variables (removed 9) and now considering 59/74 (removed 15) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 42/51 places, 59/74 transitions.
[2023-03-11 15:50:30] [INFO ] Flatten gal took : 2 ms
[2023-03-11 15:50:30] [INFO ] Flatten gal took : 3 ms
[2023-03-11 15:50:30] [INFO ] Input system was already deterministic with 59 transitions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 51/51 places, 74/74 transitions.
[2023-03-11 15:50:30] [INFO ] Flatten gal took : 2 ms
[2023-03-11 15:50:30] [INFO ] Flatten gal took : 3 ms
[2023-03-11 15:50:30] [INFO ] Input system was already deterministic with 74 transitions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 51/51 places, 74/74 transitions.
[2023-03-11 15:50:30] [INFO ] Flatten gal took : 2 ms
[2023-03-11 15:50:30] [INFO ] Flatten gal took : 3 ms
[2023-03-11 15:50:30] [INFO ] Input system was already deterministic with 74 transitions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 51/51 places, 74/74 transitions.
[2023-03-11 15:50:30] [INFO ] Flatten gal took : 3 ms
[2023-03-11 15:50:30] [INFO ] Flatten gal took : 4 ms
[2023-03-11 15:50:30] [INFO ] Input system was already deterministic with 74 transitions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 51/51 places, 74/74 transitions.
[2023-03-11 15:50:30] [INFO ] Flatten gal took : 2 ms
[2023-03-11 15:50:30] [INFO ] Flatten gal took : 3 ms
[2023-03-11 15:50:30] [INFO ] Input system was already deterministic with 74 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Graph (trivial) has 40 edges and 51 vertex of which 12 / 51 are part of one of the 4 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 39 transition count 59
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 15 place count 39 transition count 53
Applied a total of 15 rules in 7 ms. Remains 39 /51 variables (removed 12) and now considering 53/74 (removed 21) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 39/51 places, 53/74 transitions.
[2023-03-11 15:50:30] [INFO ] Flatten gal took : 1 ms
[2023-03-11 15:50:30] [INFO ] Flatten gal took : 2 ms
[2023-03-11 15:50:30] [INFO ] Input system was already deterministic with 53 transitions.
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
FORMULA FlexibleBarrier-PT-04a-CTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 51/51 places, 74/74 transitions.
[2023-03-11 15:50:30] [INFO ] Flatten gal took : 3 ms
[2023-03-11 15:50:30] [INFO ] Flatten gal took : 3 ms
[2023-03-11 15:50:30] [INFO ] Input system was already deterministic with 74 transitions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 51/51 places, 74/74 transitions.
[2023-03-11 15:50:30] [INFO ] Flatten gal took : 2 ms
[2023-03-11 15:50:30] [INFO ] Flatten gal took : 2 ms
[2023-03-11 15:50:30] [INFO ] Input system was already deterministic with 74 transitions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 51/51 places, 74/74 transitions.
[2023-03-11 15:50:30] [INFO ] Flatten gal took : 2 ms
[2023-03-11 15:50:30] [INFO ] Flatten gal took : 2 ms
[2023-03-11 15:50:30] [INFO ] Input system was already deterministic with 74 transitions.
[2023-03-11 15:50:30] [INFO ] Flatten gal took : 3 ms
[2023-03-11 15:50:30] [INFO ] Flatten gal took : 4 ms
[2023-03-11 15:50:30] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-11 15:50:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 51 places, 74 transitions and 237 arcs took 1 ms.
Total runtime 1768 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: 51 NrTr: 74 NrArc: 237)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.750sec
RS generation: 0m 0.013sec
-> reachability set: #nodes 580 (5.8e+02) #states 20,737 (4)
starting MCC model checker
--------------------------
checking: AX [EF [[p10<=1 & 1<=p10]]]
normalized: ~ [EX [~ [E [true U [p10<=1 & 1<=p10]]]]]
abstracting: (1<=p10)
states: 1,728 (3)
abstracting: (p10<=1)
states: 20,737 (4)
.-> the formula is TRUE
FORMULA FlexibleBarrier-PT-04a-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.018sec
checking: [AG [AX [[p22<=1 & 1<=p22]]] | EF [[[p2<=1 & 1<=p2] & [p50<=1 & 1<=p50]]]]
normalized: [E [true U [[p50<=1 & 1<=p50] & [p2<=1 & 1<=p2]]] | ~ [E [true U EX [~ [[p22<=1 & 1<=p22]]]]]]
abstracting: (1<=p22)
states: 1,728 (3)
abstracting: (p22<=1)
states: 20,737 (4)
.abstracting: (1<=p2)
states: 1,728 (3)
abstracting: (p2<=1)
states: 20,737 (4)
abstracting: (1<=p50)
states: 20,736 (4)
abstracting: (p50<=1)
states: 20,737 (4)
-> the formula is TRUE
FORMULA FlexibleBarrier-PT-04a-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.015sec
checking: AG [[AG [[[p36<=1 & 1<=p36] & [[p47<=1 & 1<=p47] & [p49<=1 & 1<=p49]]]] | [p17<=0 & 0<=p17]]]
normalized: ~ [E [true U ~ [[[p17<=0 & 0<=p17] | ~ [E [true U ~ [[[[p49<=1 & 1<=p49] & [p47<=1 & 1<=p47]] & [p36<=1 & 1<=p36]]]]]]]]]
abstracting: (1<=p36)
states: 1,728 (3)
abstracting: (p36<=1)
states: 20,737 (4)
abstracting: (1<=p47)
states: 1,728 (3)
abstracting: (p47<=1)
states: 20,737 (4)
abstracting: (1<=p49)
states: 20,736 (4)
abstracting: (p49<=1)
states: 20,737 (4)
abstracting: (0<=p17)
states: 20,737 (4)
abstracting: (p17<=0)
states: 19,009 (4)
-> the formula is FALSE
FORMULA FlexibleBarrier-PT-04a-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.011sec
checking: AF [[EF [AX [[[p41<=0 & 0<=p41] & [p36<=0 & 0<=p36]]]] | [EG [[p47<=1 & 1<=p47]] & [[p9<=1 & 1<=p9] & [p50<=1 & 1<=p50]]]]]
normalized: ~ [EG [~ [[[[[p50<=1 & 1<=p50] & [p9<=1 & 1<=p9]] & EG [[p47<=1 & 1<=p47]]] | E [true U ~ [EX [~ [[[p36<=0 & 0<=p36] & [p41<=0 & 0<=p41]]]]]]]]]]
abstracting: (0<=p41)
states: 20,737 (4)
abstracting: (p41<=0)
states: 19,009 (4)
abstracting: (0<=p36)
states: 20,737 (4)
abstracting: (p36<=0)
states: 19,009 (4)
.abstracting: (1<=p47)
states: 1,728 (3)
abstracting: (p47<=1)
states: 20,737 (4)
.
EG iterations: 1
abstracting: (1<=p9)
states: 1,728 (3)
abstracting: (p9<=1)
states: 20,737 (4)
abstracting: (1<=p50)
states: 20,736 (4)
abstracting: (p50<=1)
states: 20,737 (4)
.
EG iterations: 1
-> the formula is TRUE
FORMULA FlexibleBarrier-PT-04a-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.015sec
checking: [EX [[[p43<=1 & 1<=p43] & [p50<=1 & 1<=p50]]] | [E [~ [[[p4<=1 & 1<=p4] & [p50<=1 & 1<=p50]]] U ~ [[[p16<=1 & 1<=p16] & [p50<=1 & 1<=p50]]]] & EF [[[p38<=1 & 1<=p38] & [p50<=1 & 1<=p50]]]]]
normalized: [[E [true U [[p50<=1 & 1<=p50] & [p38<=1 & 1<=p38]]] & E [~ [[[p50<=1 & 1<=p50] & [p4<=1 & 1<=p4]]] U ~ [[[p50<=1 & 1<=p50] & [p16<=1 & 1<=p16]]]]] | EX [[[p50<=1 & 1<=p50] & [p43<=1 & 1<=p43]]]]
abstracting: (1<=p43)
states: 1,728 (3)
abstracting: (p43<=1)
states: 20,737 (4)
abstracting: (1<=p50)
states: 20,736 (4)
abstracting: (p50<=1)
states: 20,737 (4)
.abstracting: (1<=p16)
states: 1,728 (3)
abstracting: (p16<=1)
states: 20,737 (4)
abstracting: (1<=p50)
states: 20,736 (4)
abstracting: (p50<=1)
states: 20,737 (4)
abstracting: (1<=p4)
states: 1,728 (3)
abstracting: (p4<=1)
states: 20,737 (4)
abstracting: (1<=p50)
states: 20,736 (4)
abstracting: (p50<=1)
states: 20,737 (4)
abstracting: (1<=p38)
states: 1,728 (3)
abstracting: (p38<=1)
states: 20,737 (4)
abstracting: (1<=p50)
states: 20,736 (4)
abstracting: (p50<=1)
states: 20,737 (4)
-> the formula is TRUE
FORMULA FlexibleBarrier-PT-04a-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.012sec
checking: EF [EX [A [~ [EX [[[p12<=1 & 1<=p12] & [[p23<=1 & 1<=p23] & [p49<=1 & 1<=p49]]]]] U AX [[[[p24<=1 & 1<=p24] & [[p47<=1 & 1<=p47] & [p49<=1 & 1<=p49]]] | [[p7<=1 & 1<=p7] & [p50<=1 & 1<=p50]]]]]]]
normalized: E [true U EX [[~ [EG [EX [~ [[[[p50<=1 & 1<=p50] & [p7<=1 & 1<=p7]] | [[[p49<=1 & 1<=p49] & [p47<=1 & 1<=p47]] & [p24<=1 & 1<=p24]]]]]]] & ~ [E [EX [~ [[[[p50<=1 & 1<=p50] & [p7<=1 & 1<=p7]] | [[[p49<=1 & 1<=p49] & [p47<=1 & 1<=p47]] & [p24<=1 & 1<=p24]]]]] U [EX [[[[p49<=1 & 1<=p49] & [p23<=1 & 1<=p23]] & [p12<=1 & 1<=p12]]] & EX [~ [[[[p50<=1 & 1<=p50] & [p7<=1 & 1<=p7]] | [[[p49<=1 & 1<=p49] & [p47<=1 & 1<=p47]] & [p24<=1 & 1<=p24]]]]]]]]]]]
abstracting: (1<=p24)
states: 1,728 (3)
abstracting: (p24<=1)
states: 20,737 (4)
abstracting: (1<=p47)
states: 1,728 (3)
abstracting: (p47<=1)
states: 20,737 (4)
abstracting: (1<=p49)
states: 20,736 (4)
abstracting: (p49<=1)
states: 20,737 (4)
abstracting: (1<=p7)
states: 1,728 (3)
abstracting: (p7<=1)
states: 20,737 (4)
abstracting: (1<=p50)
states: 20,736 (4)
abstracting: (p50<=1)
states: 20,737 (4)
.abstracting: (1<=p12)
states: 1,728 (3)
abstracting: (p12<=1)
states: 20,737 (4)
abstracting: (1<=p23)
states: 1,728 (3)
abstracting: (p23<=1)
states: 20,737 (4)
abstracting: (1<=p49)
states: 20,736 (4)
abstracting: (p49<=1)
states: 20,737 (4)
.abstracting: (1<=p24)
states: 1,728 (3)
abstracting: (p24<=1)
states: 20,737 (4)
abstracting: (1<=p47)
states: 1,728 (3)
abstracting: (p47<=1)
states: 20,737 (4)
abstracting: (1<=p49)
states: 20,736 (4)
abstracting: (p49<=1)
states: 20,737 (4)
abstracting: (1<=p7)
states: 1,728 (3)
abstracting: (p7<=1)
states: 20,737 (4)
abstracting: (1<=p50)
states: 20,736 (4)
abstracting: (p50<=1)
states: 20,737 (4)
.abstracting: (1<=p24)
states: 1,728 (3)
abstracting: (p24<=1)
states: 20,737 (4)
abstracting: (1<=p47)
states: 1,728 (3)
abstracting: (p47<=1)
states: 20,737 (4)
abstracting: (1<=p49)
states: 20,736 (4)
abstracting: (p49<=1)
states: 20,737 (4)
abstracting: (1<=p7)
states: 1,728 (3)
abstracting: (p7<=1)
states: 20,737 (4)
abstracting: (1<=p50)
states: 20,736 (4)
abstracting: (p50<=1)
states: 20,737 (4)
..
EG iterations: 1
.-> the formula is TRUE
FORMULA FlexibleBarrier-PT-04a-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.033sec
checking: AF [[~ [A [[[[[p4<=1 & 1<=p4] & [p50<=1 & 1<=p50]] | EF [[[p19<=1 & 1<=p19] & [p50<=1 & 1<=p50]]]] & AG [[[p16<=1 & 1<=p16] & [p50<=1 & 1<=p50]]]] U EG [AF [[[p38<=1 & 1<=p38] & [p50<=1 & 1<=p50]]]]]] | [[p47<=1 & 1<=p47] & [[p49<=1 & 1<=p49] & [p22<=0 & 0<=p22]]]]]
normalized: ~ [EG [~ [[[[[p22<=0 & 0<=p22] & [p49<=1 & 1<=p49]] & [p47<=1 & 1<=p47]] | ~ [[~ [EG [~ [EG [~ [EG [~ [[[p50<=1 & 1<=p50] & [p38<=1 & 1<=p38]]]]]]]]] & ~ [E [~ [EG [~ [EG [~ [[[p50<=1 & 1<=p50] & [p38<=1 & 1<=p38]]]]]]] U [~ [[~ [E [true U ~ [[[p50<=1 & 1<=p50] & [p16<=1 & 1<=p16]]]]] & [E [true U [[p50<=1 & 1<=p50] & [p19<=1 & 1<=p19]]] | [[p50<=1 & 1<=p50] & [p4<=1 & 1<=p4]]]]] & ~ [EG [~ [EG [~ [[[p50<=1 & 1<=p50] & [p38<=1 & 1<=p38]]]]]]]]]]]]]]]]
abstracting: (1<=p38)
states: 1,728 (3)
abstracting: (p38<=1)
states: 20,737 (4)
abstracting: (1<=p50)
states: 20,736 (4)
abstracting: (p50<=1)
states: 20,737 (4)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p4)
states: 1,728 (3)
abstracting: (p4<=1)
states: 20,737 (4)
abstracting: (1<=p50)
states: 20,736 (4)
abstracting: (p50<=1)
states: 20,737 (4)
abstracting: (1<=p19)
states: 1,728 (3)
abstracting: (p19<=1)
states: 20,737 (4)
abstracting: (1<=p50)
states: 20,736 (4)
abstracting: (p50<=1)
states: 20,737 (4)
abstracting: (1<=p16)
states: 1,728 (3)
abstracting: (p16<=1)
states: 20,737 (4)
abstracting: (1<=p50)
states: 20,736 (4)
abstracting: (p50<=1)
states: 20,737 (4)
abstracting: (1<=p38)
states: 1,728 (3)
abstracting: (p38<=1)
states: 20,737 (4)
abstracting: (1<=p50)
states: 20,736 (4)
abstracting: (p50<=1)
states: 20,737 (4)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p38)
states: 1,728 (3)
abstracting: (p38<=1)
states: 20,737 (4)
abstracting: (1<=p50)
states: 20,736 (4)
abstracting: (p50<=1)
states: 20,737 (4)
.
EG iterations: 1
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p47)
states: 1,728 (3)
abstracting: (p47<=1)
states: 20,737 (4)
abstracting: (1<=p49)
states: 20,736 (4)
abstracting: (p49<=1)
states: 20,737 (4)
abstracting: (0<=p22)
states: 20,737 (4)
abstracting: (p22<=0)
states: 19,009 (4)
.
EG iterations: 1
-> the formula is TRUE
FORMULA FlexibleBarrier-PT-04a-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.010sec
checking: E [[~ [AG [[p36<=1 & 1<=p36]]] & [[p3<=1 & 1<=p3] | A [AG [~ [[p17<=1 & 1<=p17]]] U [p36<=1 & 1<=p36]]]] U ~ [EF [[A [~ [[[p45<=1 & 1<=p45] & [p50<=1 & 1<=p50]]] U [[p29<=1 & 1<=p29] & [[p50<=1 & 1<=p50] & [p37<=1 & 1<=p37]]]] & AG [AX [[[p12<=1 & 1<=p12] & [[p35<=1 & 1<=p35] & [p49<=1 & 1<=p49]]]]]]]]]
normalized: E [[[[~ [EG [~ [[p36<=1 & 1<=p36]]]] & ~ [E [~ [[p36<=1 & 1<=p36]] U [E [true U [p17<=1 & 1<=p17]] & ~ [[p36<=1 & 1<=p36]]]]]] | [p3<=1 & 1<=p3]] & E [true U ~ [[p36<=1 & 1<=p36]]]] U ~ [E [true U [~ [E [true U EX [~ [[[[p49<=1 & 1<=p49] & [p35<=1 & 1<=p35]] & [p12<=1 & 1<=p12]]]]]] & [~ [EG [~ [[[[p37<=1 & 1<=p37] & [p50<=1 & 1<=p50]] & [p29<=1 & 1<=p29]]]]] & ~ [E [~ [[[[p37<=1 & 1<=p37] & [p50<=1 & 1<=p50]] & [p29<=1 & 1<=p29]]] U [[[p50<=1 & 1<=p50] & [p45<=1 & 1<=p45]] & ~ [[[[p37<=1 & 1<=p37] & [p50<=1 & 1<=p50]] & [p29<=1 & 1<=p29]]]]]]]]]]]
abstracting: (1<=p29)
states: 1,728 (3)
abstracting: (p29<=1)
states: 20,737 (4)
abstracting: (1<=p50)
states: 20,736 (4)
abstracting: (p50<=1)
states: 20,737 (4)
abstracting: (1<=p37)
states: 1,728 (3)
abstracting: (p37<=1)
states: 20,737 (4)
abstracting: (1<=p45)
states: 1,728 (3)
abstracting: (p45<=1)
states: 20,737 (4)
abstracting: (1<=p50)
states: 20,736 (4)
abstracting: (p50<=1)
states: 20,737 (4)
abstracting: (1<=p29)
states: 1,728 (3)
abstracting: (p29<=1)
states: 20,737 (4)
abstracting: (1<=p50)
states: 20,736 (4)
abstracting: (p50<=1)
states: 20,737 (4)
abstracting: (1<=p37)
states: 1,728 (3)
abstracting: (p37<=1)
states: 20,737 (4)
abstracting: (1<=p29)
states: 1,728 (3)
abstracting: (p29<=1)
states: 20,737 (4)
abstracting: (1<=p50)
states: 20,736 (4)
abstracting: (p50<=1)
states: 20,737 (4)
abstracting: (1<=p37)
states: 1,728 (3)
abstracting: (p37<=1)
states: 20,737 (4)
.
EG iterations: 1
abstracting: (1<=p12)
states: 1,728 (3)
abstracting: (p12<=1)
states: 20,737 (4)
abstracting: (1<=p35)
states: 1,728 (3)
abstracting: (p35<=1)
states: 20,737 (4)
abstracting: (1<=p49)
states: 20,736 (4)
abstracting: (p49<=1)
states: 20,737 (4)
.abstracting: (1<=p36)
states: 1,728 (3)
abstracting: (p36<=1)
states: 20,737 (4)
abstracting: (1<=p3)
states: 1,728 (3)
abstracting: (p3<=1)
states: 20,737 (4)
abstracting: (1<=p36)
states: 1,728 (3)
abstracting: (p36<=1)
states: 20,737 (4)
abstracting: (1<=p17)
states: 1,728 (3)
abstracting: (p17<=1)
states: 20,737 (4)
abstracting: (1<=p36)
states: 1,728 (3)
abstracting: (p36<=1)
states: 20,737 (4)
abstracting: (1<=p36)
states: 1,728 (3)
abstracting: (p36<=1)
states: 20,737 (4)
..
EG iterations: 2
-> the formula is TRUE
FORMULA FlexibleBarrier-PT-04a-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.013sec
checking: EG [[AG [[EG [[[p47<=0 & 0<=p47] | [p49<=0 & 0<=p49]]] & [EX [[p11<=0 & 0<=p11]] & [A [[[p23<=1 & 1<=p23] & [p49<=1 & 1<=p49]] U [p37<=1 & 1<=p37]] | AX [[[p11<=1 & 1<=p11] & [p49<=1 & 1<=p49]]]]]]] | [[p48<=1 & 1<=p48] | AF [AG [A [[[p42<=1 & 1<=p42] & [p49<=1 & 1<=p49]] U [[p30<=1 & 1<=p30] & [p49<=1 & 1<=p49]]]]]]]]
normalized: EG [[[~ [EG [E [true U ~ [[~ [EG [~ [[[p49<=1 & 1<=p49] & [p30<=1 & 1<=p30]]]]] & ~ [E [~ [[[p49<=1 & 1<=p49] & [p30<=1 & 1<=p30]]] U [~ [[[p49<=1 & 1<=p49] & [p42<=1 & 1<=p42]]] & ~ [[[p49<=1 & 1<=p49] & [p30<=1 & 1<=p30]]]]]]]]]]] | [p48<=1 & 1<=p48]] | ~ [E [true U ~ [[[[~ [EX [~ [[[p49<=1 & 1<=p49] & [p11<=1 & 1<=p11]]]]] | [~ [EG [~ [[p37<=1 & 1<=p37]]]] & ~ [E [~ [[p37<=1 & 1<=p37]] U [~ [[[p49<=1 & 1<=p49] & [p23<=1 & 1<=p23]]] & ~ [[p37<=1 & 1<=p37]]]]]]] & EX [[p11<=0 & 0<=p11]]] & EG [[[p49<=0 & 0<=p49] | [p47<=0 & 0<=p47]]]]]]]]]
abstracting: (0<=p47)
states: 20,737 (4)
abstracting: (p47<=0)
states: 19,009 (4)
abstracting: (0<=p49)
states: 20,737 (4)
abstracting: (p49<=0)
states: 1
.
EG iterations: 1
abstracting: (0<=p11)
states: 20,737 (4)
abstracting: (p11<=0)
states: 19,009 (4)
.abstracting: (1<=p37)
states: 1,728 (3)
abstracting: (p37<=1)
states: 20,737 (4)
abstracting: (1<=p23)
states: 1,728 (3)
abstracting: (p23<=1)
states: 20,737 (4)
abstracting: (1<=p49)
states: 20,736 (4)
abstracting: (p49<=1)
states: 20,737 (4)
abstracting: (1<=p37)
states: 1,728 (3)
abstracting: (p37<=1)
states: 20,737 (4)
abstracting: (1<=p37)
states: 1,728 (3)
abstracting: (p37<=1)
states: 20,737 (4)
.
EG iterations: 1
abstracting: (1<=p11)
states: 1,728 (3)
abstracting: (p11<=1)
states: 20,737 (4)
abstracting: (1<=p49)
states: 20,736 (4)
abstracting: (p49<=1)
states: 20,737 (4)
.abstracting: (1<=p48)
states: 1,728 (3)
abstracting: (p48<=1)
states: 20,737 (4)
abstracting: (1<=p30)
states: 1,728 (3)
abstracting: (p30<=1)
states: 20,737 (4)
abstracting: (1<=p49)
states: 20,736 (4)
abstracting: (p49<=1)
states: 20,737 (4)
abstracting: (1<=p42)
states: 1,728 (3)
abstracting: (p42<=1)
states: 20,737 (4)
abstracting: (1<=p49)
states: 20,736 (4)
abstracting: (p49<=1)
states: 20,737 (4)
abstracting: (1<=p30)
states: 1,728 (3)
abstracting: (p30<=1)
states: 20,737 (4)
abstracting: (1<=p49)
states: 20,736 (4)
abstracting: (p49<=1)
states: 20,737 (4)
abstracting: (1<=p30)
states: 1,728 (3)
abstracting: (p30<=1)
states: 20,737 (4)
abstracting: (1<=p49)
states: 20,736 (4)
abstracting: (p49<=1)
states: 20,737 (4)
.
EG iterations: 1
EG iterations: 0
.
EG iterations: 1
-> the formula is FALSE
FORMULA FlexibleBarrier-PT-04a-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.015sec
checking: [E [AX [E [[[p24<=1 & 1<=p24] & [[p35<=1 & 1<=p35] & [p49<=1 & 1<=p49]]] U [[p36<=1 & 1<=p36] & [[p47<=1 & 1<=p47] & [p49<=1 & 1<=p49]]]]] U [[[p1<=1 & 1<=p1] | [[p26<=1 & 1<=p26] & [p50<=1 & 1<=p50]]] & [[p17<=1 & 1<=p17] & [p50<=1 & 1<=p50]]]] | EX [[[p36<=1 & 1<=p36] & [[p47<=1 & 1<=p47] & [p49<=1 & 1<=p49]]]]]
normalized: [EX [[[[p49<=1 & 1<=p49] & [p47<=1 & 1<=p47]] & [p36<=1 & 1<=p36]]] | E [~ [EX [~ [E [[[[p49<=1 & 1<=p49] & [p35<=1 & 1<=p35]] & [p24<=1 & 1<=p24]] U [[[p49<=1 & 1<=p49] & [p47<=1 & 1<=p47]] & [p36<=1 & 1<=p36]]]]]] U [[[p50<=1 & 1<=p50] & [p17<=1 & 1<=p17]] & [[[p50<=1 & 1<=p50] & [p26<=1 & 1<=p26]] | [p1<=1 & 1<=p1]]]]]
abstracting: (1<=p1)
states: 1,728 (3)
abstracting: (p1<=1)
states: 20,737 (4)
abstracting: (1<=p26)
states: 1,728 (3)
abstracting: (p26<=1)
states: 20,737 (4)
abstracting: (1<=p50)
states: 20,736 (4)
abstracting: (p50<=1)
states: 20,737 (4)
abstracting: (1<=p17)
states: 1,728 (3)
abstracting: (p17<=1)
states: 20,737 (4)
abstracting: (1<=p50)
states: 20,736 (4)
abstracting: (p50<=1)
states: 20,737 (4)
abstracting: (1<=p36)
states: 1,728 (3)
abstracting: (p36<=1)
states: 20,737 (4)
abstracting: (1<=p47)
states: 1,728 (3)
abstracting: (p47<=1)
states: 20,737 (4)
abstracting: (1<=p49)
states: 20,736 (4)
abstracting: (p49<=1)
states: 20,737 (4)
abstracting: (1<=p24)
states: 1,728 (3)
abstracting: (p24<=1)
states: 20,737 (4)
abstracting: (1<=p35)
states: 1,728 (3)
abstracting: (p35<=1)
states: 20,737 (4)
abstracting: (1<=p49)
states: 20,736 (4)
abstracting: (p49<=1)
states: 20,737 (4)
.abstracting: (1<=p36)
states: 1,728 (3)
abstracting: (p36<=1)
states: 20,737 (4)
abstracting: (1<=p47)
states: 1,728 (3)
abstracting: (p47<=1)
states: 20,737 (4)
abstracting: (1<=p49)
states: 20,736 (4)
abstracting: (p49<=1)
states: 20,737 (4)
.-> the formula is FALSE
FORMULA FlexibleBarrier-PT-04a-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: AX [E [[EF [EX [[p20<=1 & 1<=p20]]] & [~ [[[p35<=1 & 1<=p35] & [p49<=1 & 1<=p49]]] | [EX [[[p23<=1 & 1<=p23] & [[p36<=1 & 1<=p36] & [p49<=1 & 1<=p49]]]] | ~ [AF [[[p41<=1 & 1<=p41] & [p50<=1 & 1<=p50]]]]]]] U [[EG [[[p24<=1 & 1<=p24] & [[p47<=1 & 1<=p47] & [p49<=1 & 1<=p49]]]] & [p29<=1 & 1<=p29]] & [[p50<=1 & 1<=p50] & [AG [[[p11<=1 & 1<=p11] & [[p24<=1 & 1<=p24] & [p49<=1 & 1<=p49]]]] | [EG [[p37<=1 & 1<=p37]] | [[p2<=1 & 1<=p2] & [p27<=1 & 1<=p27]]]]]]]]
normalized: ~ [EX [~ [E [[[[EG [~ [[[p50<=1 & 1<=p50] & [p41<=1 & 1<=p41]]]] | EX [[[[p49<=1 & 1<=p49] & [p36<=1 & 1<=p36]] & [p23<=1 & 1<=p23]]]] | ~ [[[p49<=1 & 1<=p49] & [p35<=1 & 1<=p35]]]] & E [true U EX [[p20<=1 & 1<=p20]]]] U [[[[[[p27<=1 & 1<=p27] & [p2<=1 & 1<=p2]] | EG [[p37<=1 & 1<=p37]]] | ~ [E [true U ~ [[[[p49<=1 & 1<=p49] & [p24<=1 & 1<=p24]] & [p11<=1 & 1<=p11]]]]]] & [p50<=1 & 1<=p50]] & [[p29<=1 & 1<=p29] & EG [[[[p49<=1 & 1<=p49] & [p47<=1 & 1<=p47]] & [p24<=1 & 1<=p24]]]]]]]]]
abstracting: (1<=p24)
states: 1,728 (3)
abstracting: (p24<=1)
states: 20,737 (4)
abstracting: (1<=p47)
states: 1,728 (3)
abstracting: (p47<=1)
states: 20,737 (4)
abstracting: (1<=p49)
states: 20,736 (4)
abstracting: (p49<=1)
states: 20,737 (4)
.
EG iterations: 1
abstracting: (1<=p29)
states: 1,728 (3)
abstracting: (p29<=1)
states: 20,737 (4)
abstracting: (1<=p50)
states: 20,736 (4)
abstracting: (p50<=1)
states: 20,737 (4)
abstracting: (1<=p11)
states: 1,728 (3)
abstracting: (p11<=1)
states: 20,737 (4)
abstracting: (1<=p24)
states: 1,728 (3)
abstracting: (p24<=1)
states: 20,737 (4)
abstracting: (1<=p49)
states: 20,736 (4)
abstracting: (p49<=1)
states: 20,737 (4)
abstracting: (1<=p37)
states: 1,728 (3)
abstracting: (p37<=1)
states: 20,737 (4)
.
EG iterations: 1
abstracting: (1<=p2)
states: 1,728 (3)
abstracting: (p2<=1)
states: 20,737 (4)
abstracting: (1<=p27)
states: 1,728 (3)
abstracting: (p27<=1)
states: 20,737 (4)
abstracting: (1<=p20)
states: 1,728 (3)
abstracting: (p20<=1)
states: 20,737 (4)
.abstracting: (1<=p35)
states: 1,728 (3)
abstracting: (p35<=1)
states: 20,737 (4)
abstracting: (1<=p49)
states: 20,736 (4)
abstracting: (p49<=1)
states: 20,737 (4)
abstracting: (1<=p23)
states: 1,728 (3)
abstracting: (p23<=1)
states: 20,737 (4)
abstracting: (1<=p36)
states: 1,728 (3)
abstracting: (p36<=1)
states: 20,737 (4)
abstracting: (1<=p49)
states: 20,736 (4)
abstracting: (p49<=1)
states: 20,737 (4)
.abstracting: (1<=p41)
states: 1,728 (3)
abstracting: (p41<=1)
states: 20,737 (4)
abstracting: (1<=p50)
states: 20,736 (4)
abstracting: (p50<=1)
states: 20,737 (4)
.
EG iterations: 1
.-> the formula is FALSE
FORMULA FlexibleBarrier-PT-04a-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.016sec
checking: E [[AF [[[[p17<=1 & 1<=p17] & AF [[[p26<=1 & 1<=p26] & [p50<=1 & 1<=p50]]]] | E [[p48<=1 & 1<=p48] U [p35<=1 & 1<=p35]]]] & [~ [A [A [EF [[[p30<=1 & 1<=p30] & [p49<=1 & 1<=p49]]] U AX [[[p33<=1 & 1<=p33] & [p50<=1 & 1<=p50]]]] U AG [[[p23<=1 & 1<=p23] & [[p36<=1 & 1<=p36] & [p49<=1 & 1<=p49]]]]]] & [A [[[[p14<=1 & 1<=p14] & [p50<=1 & 1<=p50]] | [[[p16<=1 & 1<=p16] & [p50<=1 & 1<=p50]] | [[p5<=1 & 1<=p5] & [p50<=1 & 1<=p50]]]] U [[p11<=1 & 1<=p11] & [p49<=1 & 1<=p49]]] | ~ [[[p47<=1 & 1<=p47] & [p49<=1 & 1<=p49]]]]]] U AG [[[p41<=1 & 1<=p41] | AG [AF [[p34<=1 & 1<=p34]]]]]]
normalized: E [[[[~ [[[p49<=1 & 1<=p49] & [p47<=1 & 1<=p47]]] | [~ [EG [~ [[[p49<=1 & 1<=p49] & [p11<=1 & 1<=p11]]]]] & ~ [E [~ [[[p49<=1 & 1<=p49] & [p11<=1 & 1<=p11]]] U [~ [[[[[p50<=1 & 1<=p50] & [p5<=1 & 1<=p5]] | [[p50<=1 & 1<=p50] & [p16<=1 & 1<=p16]]] | [[p50<=1 & 1<=p50] & [p14<=1 & 1<=p14]]]] & ~ [[[p49<=1 & 1<=p49] & [p11<=1 & 1<=p11]]]]]]]] & ~ [[~ [EG [E [true U ~ [[[[p49<=1 & 1<=p49] & [p36<=1 & 1<=p36]] & [p23<=1 & 1<=p23]]]]]] & ~ [E [E [true U ~ [[[[p49<=1 & 1<=p49] & [p36<=1 & 1<=p36]] & [p23<=1 & 1<=p23]]]] U [~ [[~ [EG [EX [~ [[[p50<=1 & 1<=p50] & [p33<=1 & 1<=p33]]]]]] & ~ [E [EX [~ [[[p50<=1 & 1<=p50] & [p33<=1 & 1<=p33]]]] U [~ [E [true U [[p49<=1 & 1<=p49] & [p30<=1 & 1<=p30]]]] & EX [~ [[[p50<=1 & 1<=p50] & [p33<=1 & 1<=p33]]]]]]]]] & E [true U ~ [[[[p49<=1 & 1<=p49] & [p36<=1 & 1<=p36]] & [p23<=1 & 1<=p23]]]]]]]]]] & ~ [EG [~ [[E [[p48<=1 & 1<=p48] U [p35<=1 & 1<=p35]] | [~ [EG [~ [[[p50<=1 & 1<=p50] & [p26<=1 & 1<=p26]]]]] & [p17<=1 & 1<=p17]]]]]]] U ~ [E [true U ~ [[~ [E [true U EG [~ [[p34<=1 & 1<=p34]]]]] | [p41<=1 & 1<=p41]]]]]]
abstracting: (1<=p41)
states: 1,728 (3)
abstracting: (p41<=1)
states: 20,737 (4)
abstracting: (1<=p34)
states: 1,728 (3)
abstracting: (p34<=1)
states: 20,737 (4)
.
EG iterations: 1
abstracting: (1<=p17)
states: 1,728 (3)
abstracting: (p17<=1)
states: 20,737 (4)
abstracting: (1<=p26)
states: 1,728 (3)
abstracting: (p26<=1)
states: 20,737 (4)
abstracting: (1<=p50)
states: 20,736 (4)
abstracting: (p50<=1)
states: 20,737 (4)
.
EG iterations: 1
abstracting: (1<=p35)
states: 1,728 (3)
abstracting: (p35<=1)
states: 20,737 (4)
abstracting: (1<=p48)
states: 1,728 (3)
abstracting: (p48<=1)
states: 20,737 (4)
..
EG iterations: 2
abstracting: (1<=p23)
states: 1,728 (3)
abstracting: (p23<=1)
states: 20,737 (4)
abstracting: (1<=p36)
states: 1,728 (3)
abstracting: (p36<=1)
states: 20,737 (4)
abstracting: (1<=p49)
states: 20,736 (4)
abstracting: (p49<=1)
states: 20,737 (4)
abstracting: (1<=p33)
states: 1,728 (3)
abstracting: (p33<=1)
states: 20,737 (4)
abstracting: (1<=p50)
states: 20,736 (4)
abstracting: (p50<=1)
states: 20,737 (4)
.abstracting: (1<=p30)
states: 1,728 (3)
abstracting: (p30<=1)
states: 20,737 (4)
abstracting: (1<=p49)
states: 20,736 (4)
abstracting: (p49<=1)
states: 20,737 (4)
abstracting: (1<=p33)
states: 1,728 (3)
abstracting: (p33<=1)
states: 20,737 (4)
abstracting: (1<=p50)
states: 20,736 (4)
abstracting: (p50<=1)
states: 20,737 (4)
.abstracting: (1<=p33)
states: 1,728 (3)
abstracting: (p33<=1)
states: 20,737 (4)
abstracting: (1<=p50)
states: 20,736 (4)
abstracting: (p50<=1)
states: 20,737 (4)
.
EG iterations: 0
abstracting: (1<=p23)
states: 1,728 (3)
abstracting: (p23<=1)
states: 20,737 (4)
abstracting: (1<=p36)
states: 1,728 (3)
abstracting: (p36<=1)
states: 20,737 (4)
abstracting: (1<=p49)
states: 20,736 (4)
abstracting: (p49<=1)
states: 20,737 (4)
abstracting: (1<=p23)
states: 1,728 (3)
abstracting: (p23<=1)
states: 20,737 (4)
abstracting: (1<=p36)
states: 1,728 (3)
abstracting: (p36<=1)
states: 20,737 (4)
abstracting: (1<=p49)
states: 20,736 (4)
abstracting: (p49<=1)
states: 20,737 (4)
EG iterations: 0
abstracting: (1<=p11)
states: 1,728 (3)
abstracting: (p11<=1)
states: 20,737 (4)
abstracting: (1<=p49)
states: 20,736 (4)
abstracting: (p49<=1)
states: 20,737 (4)
abstracting: (1<=p14)
states: 1,728 (3)
abstracting: (p14<=1)
states: 20,737 (4)
abstracting: (1<=p50)
states: 20,736 (4)
abstracting: (p50<=1)
states: 20,737 (4)
abstracting: (1<=p16)
states: 1,728 (3)
abstracting: (p16<=1)
states: 20,737 (4)
abstracting: (1<=p50)
states: 20,736 (4)
abstracting: (p50<=1)
states: 20,737 (4)
abstracting: (1<=p5)
states: 1,728 (3)
abstracting: (p5<=1)
states: 20,737 (4)
abstracting: (1<=p50)
states: 20,736 (4)
abstracting: (p50<=1)
states: 20,737 (4)
abstracting: (1<=p11)
states: 1,728 (3)
abstracting: (p11<=1)
states: 20,737 (4)
abstracting: (1<=p49)
states: 20,736 (4)
abstracting: (p49<=1)
states: 20,737 (4)
abstracting: (1<=p11)
states: 1,728 (3)
abstracting: (p11<=1)
states: 20,737 (4)
abstracting: (1<=p49)
states: 20,736 (4)
abstracting: (p49<=1)
states: 20,737 (4)
.
EG iterations: 1
abstracting: (1<=p47)
states: 1,728 (3)
abstracting: (p47<=1)
states: 20,737 (4)
abstracting: (1<=p49)
states: 20,736 (4)
abstracting: (p49<=1)
states: 20,737 (4)
-> the formula is FALSE
FORMULA FlexibleBarrier-PT-04a-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.031sec
checking: [AG [[[1<=p9 & p9<=1] & [p50<=1 & 1<=p50]]] | E [[A [[[[[p21<=1 & 1<=p21] & [p50<=1 & 1<=p50]] | [[[p47<=1 & 1<=p47] & [p49<=1 & 1<=p49]] | ~ [[[p23<=1 & 1<=p23] & [[p36<=1 & 1<=p36] & [p49<=1 & 1<=p49]]]]]] & AG [[p48<=1 & 1<=p48]]] U E [~ [[p32<=1 & 1<=p32]] U AG [[[p33<=1 & 1<=p33] & [p50<=1 & 1<=p50]]]]] | [~ [[[[[p36<=1 & 1<=p36] & [[p47<=1 & 1<=p47] & [p49<=1 & 1<=p49]]] | [[p12<=1 & 1<=p12] & [[p23<=1 & 1<=p23] & [p49<=1 & 1<=p49]]]] | [~ [[p25<=1 & 1<=p25]] | [p36<=1 & 1<=p36]]]] | [p0<=1 & 1<=p0]]] U [[[[[EG [[p34<=1 & 1<=p34]] & AF [[p22<=1 & 1<=p22]]] | [[p33<=1 & 1<=p33] & [p50<=1 & 1<=p50]]] & EX [AF [[[p24<=1 & 1<=p24] & [[p35<=1 & 1<=p35] & [p49<=1 & 1<=p49]]]]]] | ~ [EF [[[p40<=1 & 1<=p40] & [p50<=1 & 1<=p50]]]]] & [A [[p27<=1 & 1<=p27] U EG [[[p2<=1 & 1<=p2] & [p50<=1 & 1<=p50]]]] & EG [[EF [[[p2<=1 & 1<=p2] & [p50<=1 & 1<=p50]]] & [p10<=1 & 1<=p10]]]]]]]
normalized: [E [[[[p0<=1 & 1<=p0] | ~ [[[[p36<=1 & 1<=p36] | ~ [[p25<=1 & 1<=p25]]] | [[[[p49<=1 & 1<=p49] & [p23<=1 & 1<=p23]] & [p12<=1 & 1<=p12]] | [[[p49<=1 & 1<=p49] & [p47<=1 & 1<=p47]] & [p36<=1 & 1<=p36]]]]]] | [~ [EG [~ [E [~ [[p32<=1 & 1<=p32]] U ~ [E [true U ~ [[[p50<=1 & 1<=p50] & [p33<=1 & 1<=p33]]]]]]]]] & ~ [E [~ [E [~ [[p32<=1 & 1<=p32]] U ~ [E [true U ~ [[[p50<=1 & 1<=p50] & [p33<=1 & 1<=p33]]]]]]] U [~ [[~ [E [true U ~ [[p48<=1 & 1<=p48]]]] & [[~ [[[[p49<=1 & 1<=p49] & [p36<=1 & 1<=p36]] & [p23<=1 & 1<=p23]]] | [[p49<=1 & 1<=p49] & [p47<=1 & 1<=p47]]] | [[p50<=1 & 1<=p50] & [p21<=1 & 1<=p21]]]]] & ~ [E [~ [[p32<=1 & 1<=p32]] U ~ [E [true U ~ [[[p50<=1 & 1<=p50] & [p33<=1 & 1<=p33]]]]]]]]]]]] U [[EG [[[p10<=1 & 1<=p10] & E [true U [[p50<=1 & 1<=p50] & [p2<=1 & 1<=p2]]]]] & [~ [EG [~ [EG [[[p50<=1 & 1<=p50] & [p2<=1 & 1<=p2]]]]]] & ~ [E [~ [EG [[[p50<=1 & 1<=p50] & [p2<=1 & 1<=p2]]]] U [~ [[p27<=1 & 1<=p27]] & ~ [EG [[[p50<=1 & 1<=p50] & [p2<=1 & 1<=p2]]]]]]]]] & [~ [E [true U [[p50<=1 & 1<=p50] & [p40<=1 & 1<=p40]]]] | [EX [~ [EG [~ [[[[p49<=1 & 1<=p49] & [p35<=1 & 1<=p35]] & [p24<=1 & 1<=p24]]]]]] & [[[p50<=1 & 1<=p50] & [p33<=1 & 1<=p33]] | [~ [EG [~ [[p22<=1 & 1<=p22]]]] & EG [[p34<=1 & 1<=p34]]]]]]]] | ~ [E [true U ~ [[[p50<=1 & 1<=p50] & [1<=p9 & p9<=1]]]]]]
abstracting: (p9<=1)
states: 20,737 (4)
abstracting: (1<=p9)
states: 1,728 (3)
abstracting: (1<=p50)
states: 20,736 (4)
abstracting: (p50<=1)
states: 20,737 (4)
abstracting: (1<=p34)
states: 1,728 (3)
abstracting: (p34<=1)
states: 20,737 (4)
.
EG iterations: 1
abstracting: (1<=p22)
states: 1,728 (3)
abstracting: (p22<=1)
states: 20,737 (4)
.
EG iterations: 1
abstracting: (1<=p33)
states: 1,728 (3)
abstracting: (p33<=1)
states: 20,737 (4)
abstracting: (1<=p50)
states: 20,736 (4)
abstracting: (p50<=1)
states: 20,737 (4)
abstracting: (1<=p24)
states: 1,728 (3)
abstracting: (p24<=1)
states: 20,737 (4)
abstracting: (1<=p35)
states: 1,728 (3)
abstracting: (p35<=1)
states: 20,737 (4)
abstracting: (1<=p49)
states: 20,736 (4)
abstracting: (p49<=1)
states: 20,737 (4)
.
EG iterations: 1
.abstracting: (1<=p40)
states: 1,728 (3)
abstracting: (p40<=1)
states: 20,737 (4)
abstracting: (1<=p50)
states: 20,736 (4)
abstracting: (p50<=1)
states: 20,737 (4)
abstracting: (1<=p2)
states: 1,728 (3)
abstracting: (p2<=1)
states: 20,737 (4)
abstracting: (1<=p50)
states: 20,736 (4)
abstracting: (p50<=1)
states: 20,737 (4)
.
EG iterations: 1
abstracting: (1<=p27)
states: 1,728 (3)
abstracting: (p27<=1)
states: 20,737 (4)
abstracting: (1<=p2)
states: 1,728 (3)
abstracting: (p2<=1)
states: 20,737 (4)
abstracting: (1<=p50)
states: 20,736 (4)
abstracting: (p50<=1)
states: 20,737 (4)
.
EG iterations: 1
abstracting: (1<=p2)
states: 1,728 (3)
abstracting: (p2<=1)
states: 20,737 (4)
abstracting: (1<=p50)
states: 20,736 (4)
abstracting: (p50<=1)
states: 20,737 (4)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p2)
states: 1,728 (3)
abstracting: (p2<=1)
states: 20,737 (4)
abstracting: (1<=p50)
states: 20,736 (4)
abstracting: (p50<=1)
states: 20,737 (4)
abstracting: (1<=p10)
states: 1,728 (3)
abstracting: (p10<=1)
states: 20,737 (4)
.
EG iterations: 1
abstracting: (1<=p33)
states: 1,728 (3)
abstracting: (p33<=1)
states: 20,737 (4)
abstracting: (1<=p50)
states: 20,736 (4)
abstracting: (p50<=1)
states: 20,737 (4)
abstracting: (1<=p32)
states: 1,728 (3)
abstracting: (p32<=1)
states: 20,737 (4)
abstracting: (1<=p21)
states: 1,728 (3)
abstracting: (p21<=1)
states: 20,737 (4)
abstracting: (1<=p50)
states: 20,736 (4)
abstracting: (p50<=1)
states: 20,737 (4)
abstracting: (1<=p47)
states: 1,728 (3)
abstracting: (p47<=1)
states: 20,737 (4)
abstracting: (1<=p49)
states: 20,736 (4)
abstracting: (p49<=1)
states: 20,737 (4)
abstracting: (1<=p23)
states: 1,728 (3)
abstracting: (p23<=1)
states: 20,737 (4)
abstracting: (1<=p36)
states: 1,728 (3)
abstracting: (p36<=1)
states: 20,737 (4)
abstracting: (1<=p49)
states: 20,736 (4)
abstracting: (p49<=1)
states: 20,737 (4)
abstracting: (1<=p48)
states: 1,728 (3)
abstracting: (p48<=1)
states: 20,737 (4)
abstracting: (1<=p33)
states: 1,728 (3)
abstracting: (p33<=1)
states: 20,737 (4)
abstracting: (1<=p50)
states: 20,736 (4)
abstracting: (p50<=1)
states: 20,737 (4)
abstracting: (1<=p32)
states: 1,728 (3)
abstracting: (p32<=1)
states: 20,737 (4)
abstracting: (1<=p33)
states: 1,728 (3)
abstracting: (p33<=1)
states: 20,737 (4)
abstracting: (1<=p50)
states: 20,736 (4)
abstracting: (p50<=1)
states: 20,737 (4)
abstracting: (1<=p32)
states: 1,728 (3)
abstracting: (p32<=1)
states: 20,737 (4)
EG iterations: 0
abstracting: (1<=p36)
states: 1,728 (3)
abstracting: (p36<=1)
states: 20,737 (4)
abstracting: (1<=p47)
states: 1,728 (3)
abstracting: (p47<=1)
states: 20,737 (4)
abstracting: (1<=p49)
states: 20,736 (4)
abstracting: (p49<=1)
states: 20,737 (4)
abstracting: (1<=p12)
states: 1,728 (3)
abstracting: (p12<=1)
states: 20,737 (4)
abstracting: (1<=p23)
states: 1,728 (3)
abstracting: (p23<=1)
states: 20,737 (4)
abstracting: (1<=p49)
states: 20,736 (4)
abstracting: (p49<=1)
states: 20,737 (4)
abstracting: (1<=p25)
states: 1,728 (3)
abstracting: (p25<=1)
states: 20,737 (4)
abstracting: (1<=p36)
states: 1,728 (3)
abstracting: (p36<=1)
states: 20,737 (4)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 20,737 (4)
-> the formula is FALSE
FORMULA FlexibleBarrier-PT-04a-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.026sec
totally nodes used: 76584 (7.7e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 298866 663287 962153
used/not used/entry size/cache size: 735335 66373529 16 1024MB
basic ops cache: hits/miss/sum: 35737 68141 103878
used/not used/entry size/cache size: 111249 16665967 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: 3285 6970 10255
used/not used/entry size/cache size: 6969 8381639 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 67034091
1 73029
2 1678
3 65
4 1
5 0
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 4.601sec
BK_STOP 1678549835882
--------------------
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:1313 (17), effective:78 (1)
initing FirstDep: 0m 0.000sec
iterations count:535 (7), effective:23 (0)
iterations count:74 (1), effective:0 (0)
iterations count:529 (7), effective:23 (0)
iterations count:91 (1), effective:1 (0)
iterations count:543 (7), effective:23 (0)
iterations count:883 (11), effective:41 (0)
iterations count:101 (1), effective:1 (0)
iterations count:304 (4), effective:12 (0)
iterations count:680 (9), effective:32 (0)
iterations count:1063 (14), effective:51 (0)
iterations count:539 (7), effective:23 (0)
iterations count:101 (1), effective:1 (0)
iterations count:74 (1), effective:0 (0)
iterations count:330 (4), effective:13 (0)
iterations count:74 (1), effective:0 (0)
iterations count:304 (4), effective:12 (0)
iterations count:543 (7), effective:23 (0)
iterations count:74 (1), effective:0 (0)
iterations count:74 (1), effective:0 (0)
iterations count:116 (1), effective:1 (0)
iterations count:77 (1), effective:1 (0)
iterations count:103 (1), effective:1 (0)
iterations count:108 (1), effective:1 (0)
iterations count:96 (1), effective:1 (0)
iterations count:74 (1), effective:0 (0)
iterations count:127 (1), effective:1 (0)
iterations count:536 (7), effective:22 (0)
iterations count:76 (1), effective:1 (0)
iterations count:92 (1), effective:1 (0)
iterations count:740 (10), effective:33 (0)
iterations count:116 (1), effective:1 (0)
iterations count:541 (7), effective:23 (0)
iterations count:116 (1), effective:1 (0)
iterations count:74 (1), effective:0 (0)
iterations count:116 (1), effective:1 (0)
iterations count:128 (1), effective:3 (0)
iterations count:81 (1), effective:1 (0)
iterations count:292 (3), effective:12 (0)
iterations count:105 (1), effective:1 (0)
iterations count:529 (7), effective:23 (0)
iterations count:90 (1), effective:1 (0)
iterations count:78 (1), effective:1 (0)
iterations count:90 (1), effective:1 (0)
iterations count:74 (1), effective:0 (0)
iterations count:90 (1), effective:1 (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="FlexibleBarrier-PT-04a"
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 FlexibleBarrier-PT-04a, 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 r170-tall-167838857200442"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-04a.tgz
mv FlexibleBarrier-PT-04a 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 ;