fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r170-tall-167838857300474
Last Updated
May 14, 2023

About the Execution of Marcie+red for FlexibleBarrier-PT-08a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5720.943 19896.00 24566.00 348.60 FFFTFTFTTFTTTFTF 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-167838857300474.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-08a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838857300474
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 7.6K Feb 25 12:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 25 12:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 12:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 25 12:35 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.5K Feb 25 16:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 12:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 25 12:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 12:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K Feb 25 12:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:07 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 64K 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-08a-CTLFireability-00
FORMULA_NAME FlexibleBarrier-PT-08a-CTLFireability-01
FORMULA_NAME FlexibleBarrier-PT-08a-CTLFireability-02
FORMULA_NAME FlexibleBarrier-PT-08a-CTLFireability-03
FORMULA_NAME FlexibleBarrier-PT-08a-CTLFireability-04
FORMULA_NAME FlexibleBarrier-PT-08a-CTLFireability-05
FORMULA_NAME FlexibleBarrier-PT-08a-CTLFireability-06
FORMULA_NAME FlexibleBarrier-PT-08a-CTLFireability-07
FORMULA_NAME FlexibleBarrier-PT-08a-CTLFireability-08
FORMULA_NAME FlexibleBarrier-PT-08a-CTLFireability-09
FORMULA_NAME FlexibleBarrier-PT-08a-CTLFireability-10
FORMULA_NAME FlexibleBarrier-PT-08a-CTLFireability-11
FORMULA_NAME FlexibleBarrier-PT-08a-CTLFireability-12
FORMULA_NAME FlexibleBarrier-PT-08a-CTLFireability-13
FORMULA_NAME FlexibleBarrier-PT-08a-CTLFireability-14
FORMULA_NAME FlexibleBarrier-PT-08a-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678553695987

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-08a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 16:54:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 16:54:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 16:54:57] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2023-03-11 16:54:57] [INFO ] Transformed 99 places.
[2023-03-11 16:54:57] [INFO ] Transformed 236 transitions.
[2023-03-11 16:54:57] [INFO ] Found NUPN structural information;
[2023-03-11 16:54:57] [INFO ] Parsed PT model containing 99 places and 236 transitions and 985 arcs in 113 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 50 transitions
Reduce redundant transitions removed 50 transitions.
FORMULA FlexibleBarrier-PT-08a-CTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-08a-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 186/186 transitions.
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 99 transition count 178
Applied a total of 8 rules in 15 ms. Remains 99 /99 variables (removed 0) and now considering 178/186 (removed 8) transitions.
// Phase 1: matrix 178 rows 99 cols
[2023-03-11 16:54:57] [INFO ] Computed 10 place invariants in 14 ms
[2023-03-11 16:54:58] [INFO ] Implicit Places using invariants in 398 ms returned []
[2023-03-11 16:54:58] [INFO ] Invariant cache hit.
[2023-03-11 16:54:58] [INFO ] State equation strengthened by 97 read => feed constraints.
[2023-03-11 16:54:58] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 539 ms to find 0 implicit places.
[2023-03-11 16:54:58] [INFO ] Invariant cache hit.
[2023-03-11 16:54:58] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 99/99 places, 178/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 667 ms. Remains : 99/99 places, 178/186 transitions.
Support contains 47 out of 99 places after structural reductions.
[2023-03-11 16:54:58] [INFO ] Flatten gal took : 31 ms
[2023-03-11 16:54:58] [INFO ] Flatten gal took : 18 ms
[2023-03-11 16:54:58] [INFO ] Input system was already deterministic with 178 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 54) seen :53
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 16:54:58] [INFO ] Invariant cache hit.
[2023-03-11 16:54:58] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-11 16:54:58] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
[2023-03-11 16:54:58] [INFO ] Flatten gal took : 9 ms
[2023-03-11 16:54:58] [INFO ] Flatten gal took : 8 ms
[2023-03-11 16:54:58] [INFO ] Input system was already deterministic with 178 transitions.
Computed a total of 3 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 178/178 transitions.
Applied a total of 0 rules in 3 ms. Remains 99 /99 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 99/99 places, 178/178 transitions.
[2023-03-11 16:54:58] [INFO ] Flatten gal took : 8 ms
[2023-03-11 16:54:58] [INFO ] Flatten gal took : 8 ms
[2023-03-11 16:54:58] [INFO ] Input system was already deterministic with 178 transitions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 178/178 transitions.
Applied a total of 0 rules in 3 ms. Remains 99 /99 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 99/99 places, 178/178 transitions.
[2023-03-11 16:54:58] [INFO ] Flatten gal took : 8 ms
[2023-03-11 16:54:58] [INFO ] Flatten gal took : 8 ms
[2023-03-11 16:54:58] [INFO ] Input system was already deterministic with 178 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 99/99 places, 178/178 transitions.
Graph (trivial) has 68 edges and 99 vertex of which 9 / 99 are part of one of the 3 SCC in 2 ms
Free SCC test removed 6 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 13 place count 87 transition count 163
Drop transitions removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 0 with 30 rules applied. Total rules applied 43 place count 87 transition count 133
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 45 place count 87 transition count 133
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 47 place count 85 transition count 131
Iterating global reduction 0 with 2 rules applied. Total rules applied 49 place count 85 transition count 131
Applied a total of 49 rules in 41 ms. Remains 85 /99 variables (removed 14) and now considering 131/178 (removed 47) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 41 ms. Remains : 85/99 places, 131/178 transitions.
[2023-03-11 16:54:58] [INFO ] Flatten gal took : 4 ms
[2023-03-11 16:54:58] [INFO ] Flatten gal took : 5 ms
[2023-03-11 16:54:58] [INFO ] Input system was already deterministic with 131 transitions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 178/178 transitions.
Applied a total of 0 rules in 3 ms. Remains 99 /99 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 99/99 places, 178/178 transitions.
[2023-03-11 16:54:59] [INFO ] Flatten gal took : 7 ms
[2023-03-11 16:54:59] [INFO ] Flatten gal took : 8 ms
[2023-03-11 16:54:59] [INFO ] Input system was already deterministic with 178 transitions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 178/178 transitions.
Applied a total of 0 rules in 3 ms. Remains 99 /99 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 99/99 places, 178/178 transitions.
[2023-03-11 16:54:59] [INFO ] Flatten gal took : 6 ms
[2023-03-11 16:54:59] [INFO ] Flatten gal took : 7 ms
[2023-03-11 16:54:59] [INFO ] Input system was already deterministic with 178 transitions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 178/178 transitions.
Applied a total of 0 rules in 3 ms. Remains 99 /99 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 99/99 places, 178/178 transitions.
[2023-03-11 16:54:59] [INFO ] Flatten gal took : 7 ms
[2023-03-11 16:54:59] [INFO ] Flatten gal took : 7 ms
[2023-03-11 16:54:59] [INFO ] Input system was already deterministic with 178 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 99/99 places, 178/178 transitions.
Graph (trivial) has 58 edges and 99 vertex of which 6 / 99 are part of one of the 2 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 91 transition count 170
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 0 with 18 rules applied. Total rules applied 27 place count 91 transition count 152
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 29 place count 91 transition count 152
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 30 place count 90 transition count 151
Iterating global reduction 0 with 1 rules applied. Total rules applied 31 place count 90 transition count 151
Applied a total of 31 rules in 25 ms. Remains 90 /99 variables (removed 9) and now considering 151/178 (removed 27) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 90/99 places, 151/178 transitions.
[2023-03-11 16:54:59] [INFO ] Flatten gal took : 5 ms
[2023-03-11 16:54:59] [INFO ] Flatten gal took : 5 ms
[2023-03-11 16:54:59] [INFO ] Input system was already deterministic with 151 transitions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 178/178 transitions.
Applied a total of 0 rules in 2 ms. Remains 99 /99 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 99/99 places, 178/178 transitions.
[2023-03-11 16:54:59] [INFO ] Flatten gal took : 6 ms
[2023-03-11 16:54:59] [INFO ] Flatten gal took : 6 ms
[2023-03-11 16:54:59] [INFO ] Input system was already deterministic with 178 transitions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 178/178 transitions.
Applied a total of 0 rules in 1 ms. Remains 99 /99 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 99/99 places, 178/178 transitions.
[2023-03-11 16:54:59] [INFO ] Flatten gal took : 5 ms
[2023-03-11 16:54:59] [INFO ] Flatten gal took : 5 ms
[2023-03-11 16:54:59] [INFO ] Input system was already deterministic with 178 transitions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 178/178 transitions.
Applied a total of 0 rules in 2 ms. Remains 99 /99 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 99/99 places, 178/178 transitions.
[2023-03-11 16:54:59] [INFO ] Flatten gal took : 5 ms
[2023-03-11 16:54:59] [INFO ] Flatten gal took : 5 ms
[2023-03-11 16:54:59] [INFO ] Input system was already deterministic with 178 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 99/99 places, 178/178 transitions.
Graph (trivial) has 61 edges and 99 vertex of which 6 / 99 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 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 13 place count 89 transition count 167
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 0 with 17 rules applied. Total rules applied 30 place count 89 transition count 150
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 89 transition count 150
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 87 transition count 148
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 87 transition count 148
Applied a total of 36 rules in 21 ms. Remains 87 /99 variables (removed 12) and now considering 148/178 (removed 30) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 87/99 places, 148/178 transitions.
[2023-03-11 16:54:59] [INFO ] Flatten gal took : 4 ms
[2023-03-11 16:54:59] [INFO ] Flatten gal took : 5 ms
[2023-03-11 16:54:59] [INFO ] Input system was already deterministic with 148 transitions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 178/178 transitions.
Applied a total of 0 rules in 1 ms. Remains 99 /99 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 99/99 places, 178/178 transitions.
[2023-03-11 16:54:59] [INFO ] Flatten gal took : 6 ms
[2023-03-11 16:54:59] [INFO ] Flatten gal took : 5 ms
[2023-03-11 16:54:59] [INFO ] Input system was already deterministic with 178 transitions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 178/178 transitions.
Applied a total of 0 rules in 1 ms. Remains 99 /99 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 99/99 places, 178/178 transitions.
[2023-03-11 16:54:59] [INFO ] Flatten gal took : 5 ms
[2023-03-11 16:54:59] [INFO ] Flatten gal took : 5 ms
[2023-03-11 16:54:59] [INFO ] Input system was already deterministic with 178 transitions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 178/178 transitions.
Applied a total of 0 rules in 1 ms. Remains 99 /99 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 99/99 places, 178/178 transitions.
[2023-03-11 16:54:59] [INFO ] Flatten gal took : 4 ms
[2023-03-11 16:54:59] [INFO ] Flatten gal took : 10 ms
[2023-03-11 16:54:59] [INFO ] Input system was already deterministic with 178 transitions.
[2023-03-11 16:54:59] [INFO ] Flatten gal took : 5 ms
[2023-03-11 16:54:59] [INFO ] Flatten gal took : 5 ms
[2023-03-11 16:54:59] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-11 16:54:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 99 places, 178 transitions and 657 arcs took 2 ms.
Total runtime 1970 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: 99 NrTr: 178 NrArc: 657)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.002sec

net check time: 0m 0.000sec

init dd package: 0m 2.713sec


RS generation: 0m 0.676sec


-> reachability set: #nodes 15370 (1.5e+04) #states 429,981,697 (8)



starting MCC model checker
--------------------------

checking: EX [[p25<=1 & 1<=p25]]
normalized: EX [[p25<=1 & 1<=p25]]

abstracting: (1<=p25)
states: 35,831,808 (7)
abstracting: (p25<=1)
states: 429,981,697 (8)
.-> the formula is FALSE

FORMULA FlexibleBarrier-PT-08a-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.218sec

checking: [EX [EG [AG [AF [[[p86<=0 & 0<=p86] | [p98<=0 & 0<=p98]]]]]] & EX [EX [[[p11<=0 & 0<=p11] | [[p72<=0 & 0<=p72] | [p97<=0 & 0<=p97]]]]]]
normalized: [EX [EX [[[[p97<=0 & 0<=p97] | [p72<=0 & 0<=p72]] | [p11<=0 & 0<=p11]]]] & EX [EG [~ [E [true U EG [~ [[[p98<=0 & 0<=p98] | [p86<=0 & 0<=p86]]]]]]]]]

abstracting: (0<=p86)
states: 429,981,697 (8)
abstracting: (p86<=0)
states: 394,149,889 (8)
abstracting: (0<=p98)
states: 429,981,697 (8)
abstracting: (p98<=0)
states: 1
.
EG iterations: 1
.
EG iterations: 1
.abstracting: (0<=p11)
states: 429,981,697 (8)
abstracting: (p11<=0)
states: 394,149,889 (8)
abstracting: (0<=p72)
states: 429,981,697 (8)
abstracting: (p72<=0)
states: 394,149,889 (8)
abstracting: (0<=p97)
states: 429,981,697 (8)
abstracting: (p97<=0)
states: 1
..-> the formula is FALSE

FORMULA FlexibleBarrier-PT-08a-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.875sec

checking: EF [[AF [[[~ [[p11<=1 & 1<=p11]] | ~ [[p84<=1 & 1<=p84]]] | [~ [[p97<=1 & 1<=p97]] | ~ [[p94<=1 & 1<=p94]]]]] & AX [[[p48<=1 & 1<=p48] & [[p59<=1 & 1<=p59] & [p97<=1 & 1<=p97]]]]]]
normalized: E [true U [~ [EX [~ [[[[p97<=1 & 1<=p97] & [p59<=1 & 1<=p59]] & [p48<=1 & 1<=p48]]]]] & ~ [EG [~ [[[~ [[p94<=1 & 1<=p94]] | ~ [[p97<=1 & 1<=p97]]] | [~ [[p84<=1 & 1<=p84]] | ~ [[p11<=1 & 1<=p11]]]]]]]]]

abstracting: (1<=p11)
states: 35,831,808 (7)
abstracting: (p11<=1)
states: 429,981,697 (8)
abstracting: (1<=p84)
states: 35,831,808 (7)
abstracting: (p84<=1)
states: 429,981,697 (8)
abstracting: (1<=p97)
states: 429,981,696 (8)
abstracting: (p97<=1)
states: 429,981,697 (8)
abstracting: (1<=p94)
states: 35,831,808 (7)
abstracting: (p94<=1)
states: 429,981,697 (8)
.
EG iterations: 1
abstracting: (1<=p48)
states: 35,831,808 (7)
abstracting: (p48<=1)
states: 429,981,697 (8)
abstracting: (1<=p59)
states: 35,831,808 (7)
abstracting: (p59<=1)
states: 429,981,697 (8)
abstracting: (1<=p97)
states: 429,981,696 (8)
abstracting: (p97<=1)
states: 429,981,697 (8)
.-> the formula is FALSE

FORMULA FlexibleBarrier-PT-08a-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.053sec

checking: AX [~ [E [[[p95<=1 & 1<=p95] & [[p97<=1 & 1<=p97] & ~ [[[[[p24<=1 & 1<=p24] & [[p95<=1 & 1<=p95] & [p97<=1 & 1<=p97]]] | [p70<=1 & 1<=p70]] & ~ [[p22<=1 & 1<=p22]]]]]] U EG [EF [[p10<=1 & 1<=p10]]]]]]
normalized: ~ [EX [E [[[~ [[~ [[p22<=1 & 1<=p22]] & [[p70<=1 & 1<=p70] | [[[p97<=1 & 1<=p97] & [p95<=1 & 1<=p95]] & [p24<=1 & 1<=p24]]]]] & [p97<=1 & 1<=p97]] & [p95<=1 & 1<=p95]] U EG [E [true U [p10<=1 & 1<=p10]]]]]]

abstracting: (1<=p10)
states: 35,831,808 (7)
abstracting: (p10<=1)
states: 429,981,697 (8)

EG iterations: 0
abstracting: (1<=p95)
states: 35,831,808 (7)
abstracting: (p95<=1)
states: 429,981,697 (8)
abstracting: (1<=p97)
states: 429,981,696 (8)
abstracting: (p97<=1)
states: 429,981,697 (8)
abstracting: (1<=p24)
states: 35,831,808 (7)
abstracting: (p24<=1)
states: 429,981,697 (8)
abstracting: (1<=p95)
states: 35,831,808 (7)
abstracting: (p95<=1)
states: 429,981,697 (8)
abstracting: (1<=p97)
states: 429,981,696 (8)
abstracting: (p97<=1)
states: 429,981,697 (8)
abstracting: (1<=p70)
states: 35,831,808 (7)
abstracting: (p70<=1)
states: 429,981,697 (8)
abstracting: (1<=p22)
states: 35,831,808 (7)
abstracting: (p22<=1)
states: 429,981,697 (8)
.-> the formula is FALSE

FORMULA FlexibleBarrier-PT-08a-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.627sec

checking: EX [[AX [~ [E [[[p75<=1 & 1<=p75] | [[p60<=1 & 1<=p60] & [[p83<=1 & 1<=p83] & [p97<=1 & 1<=p97]]]] U [[p82<=1 & 1<=p82] | [[p53<=1 & 1<=p53] & [p98<=1 & 1<=p98]]]]]] | EX [[p0<=0 & 0<=p0]]]]
normalized: EX [[EX [[p0<=0 & 0<=p0]] | ~ [EX [E [[[[[p97<=1 & 1<=p97] & [p83<=1 & 1<=p83]] & [p60<=1 & 1<=p60]] | [p75<=1 & 1<=p75]] U [[[p98<=1 & 1<=p98] & [p53<=1 & 1<=p53]] | [p82<=1 & 1<=p82]]]]]]]

abstracting: (1<=p82)
states: 35,831,808 (7)
abstracting: (p82<=1)
states: 429,981,697 (8)
abstracting: (1<=p53)
states: 35,831,808 (7)
abstracting: (p53<=1)
states: 429,981,697 (8)
abstracting: (1<=p98)
states: 429,981,696 (8)
abstracting: (p98<=1)
states: 429,981,697 (8)
abstracting: (1<=p75)
states: 35,831,808 (7)
abstracting: (p75<=1)
states: 429,981,697 (8)
abstracting: (1<=p60)
states: 35,831,808 (7)
abstracting: (p60<=1)
states: 429,981,697 (8)
abstracting: (1<=p83)
states: 35,831,808 (7)
abstracting: (p83<=1)
states: 429,981,697 (8)
abstracting: (1<=p97)
states: 429,981,696 (8)
abstracting: (p97<=1)
states: 429,981,697 (8)
.abstracting: (0<=p0)
states: 429,981,697 (8)
abstracting: (p0<=0)
states: 429,981,696 (8)
..-> the formula is TRUE

FORMULA FlexibleBarrier-PT-08a-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.712sec

checking: AF [E [~ [[[p12<=1 & 1<=p12] & [[p71<=1 & 1<=p71] & [p97<=1 & 1<=p97]]]] U AG [[[[p95<=1 & 1<=p95] & [p97<=1 & 1<=p97]] & [~ [[[p35<=1 & 1<=p35] & [[p84<=1 & 1<=p84] & [p97<=1 & 1<=p97]]]] & ~ [[[p12<=1 & 1<=p12] & [[p95<=1 & 1<=p95] & [p97<=1 & 1<=p97]]]]]]]]]
normalized: ~ [EG [~ [E [~ [[[[p97<=1 & 1<=p97] & [p71<=1 & 1<=p71]] & [p12<=1 & 1<=p12]]] U ~ [E [true U ~ [[[~ [[[[p97<=1 & 1<=p97] & [p95<=1 & 1<=p95]] & [p12<=1 & 1<=p12]]] & ~ [[[[p97<=1 & 1<=p97] & [p84<=1 & 1<=p84]] & [p35<=1 & 1<=p35]]]] & [[p97<=1 & 1<=p97] & [p95<=1 & 1<=p95]]]]]]]]]]

abstracting: (1<=p95)
states: 35,831,808 (7)
abstracting: (p95<=1)
states: 429,981,697 (8)
abstracting: (1<=p97)
states: 429,981,696 (8)
abstracting: (p97<=1)
states: 429,981,697 (8)
abstracting: (1<=p35)
states: 35,831,808 (7)
abstracting: (p35<=1)
states: 429,981,697 (8)
abstracting: (1<=p84)
states: 35,831,808 (7)
abstracting: (p84<=1)
states: 429,981,697 (8)
abstracting: (1<=p97)
states: 429,981,696 (8)
abstracting: (p97<=1)
states: 429,981,697 (8)
abstracting: (1<=p12)
states: 35,831,808 (7)
abstracting: (p12<=1)
states: 429,981,697 (8)
abstracting: (1<=p95)
states: 35,831,808 (7)
abstracting: (p95<=1)
states: 429,981,697 (8)
abstracting: (1<=p97)
states: 429,981,696 (8)
abstracting: (p97<=1)
states: 429,981,697 (8)
abstracting: (1<=p12)
states: 35,831,808 (7)
abstracting: (p12<=1)
states: 429,981,697 (8)
abstracting: (1<=p71)
states: 35,831,808 (7)
abstracting: (p71<=1)
states: 429,981,697 (8)
abstracting: (1<=p97)
states: 429,981,696 (8)
abstracting: (p97<=1)
states: 429,981,697 (8)

EG iterations: 0
-> the formula is FALSE

FORMULA FlexibleBarrier-PT-08a-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.022sec

checking: [AG [AF [[AF [[p70<=1 & 1<=p70]] | EF [[[p29<=0 & 0<=p29] | [p98<=0 & 0<=p98]]]]]] & EF [[[[[p11<=0 & 0<=p11] | [p84<=0 & 0<=p84]] | [[p97<=0 & 0<=p97] | [p72<=0 & 0<=p72]]] & AX [[[p20<=0 & 0<=p20] & [[p59<=0 & 0<=p59] | [[p72<=0 & 0<=p72] | [p97<=0 & 0<=p97]]]]]]]]
normalized: [E [true U [~ [EX [~ [[[[[p97<=0 & 0<=p97] | [p72<=0 & 0<=p72]] | [p59<=0 & 0<=p59]] & [p20<=0 & 0<=p20]]]]] & [[[p72<=0 & 0<=p72] | [p97<=0 & 0<=p97]] | [[p84<=0 & 0<=p84] | [p11<=0 & 0<=p11]]]]] & ~ [E [true U EG [~ [[E [true U [[p98<=0 & 0<=p98] | [p29<=0 & 0<=p29]]] | ~ [EG [~ [[p70<=1 & 1<=p70]]]]]]]]]]

abstracting: (1<=p70)
states: 35,831,808 (7)
abstracting: (p70<=1)
states: 429,981,697 (8)
.
EG iterations: 1
abstracting: (0<=p29)
states: 429,981,697 (8)
abstracting: (p29<=0)
states: 394,149,889 (8)
abstracting: (0<=p98)
states: 429,981,697 (8)
abstracting: (p98<=0)
states: 1
.
EG iterations: 1
abstracting: (0<=p11)
states: 429,981,697 (8)
abstracting: (p11<=0)
states: 394,149,889 (8)
abstracting: (0<=p84)
states: 429,981,697 (8)
abstracting: (p84<=0)
states: 394,149,889 (8)
abstracting: (0<=p97)
states: 429,981,697 (8)
abstracting: (p97<=0)
states: 1
abstracting: (0<=p72)
states: 429,981,697 (8)
abstracting: (p72<=0)
states: 394,149,889 (8)
abstracting: (0<=p20)
states: 429,981,697 (8)
abstracting: (p20<=0)
states: 394,149,889 (8)
abstracting: (0<=p59)
states: 429,981,697 (8)
abstracting: (p59<=0)
states: 394,149,889 (8)
abstracting: (0<=p72)
states: 429,981,697 (8)
abstracting: (p72<=0)
states: 394,149,889 (8)
abstracting: (0<=p97)
states: 429,981,697 (8)
abstracting: (p97<=0)
states: 1
.-> the formula is TRUE

FORMULA FlexibleBarrier-PT-08a-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.614sec

checking: AX [[AG [[EF [AX [[p83<=1 & 1<=p83]]] & [A [[p68<=1 & 1<=p68] U [p20<=1 & 1<=p20]] & EX [[p24<=1 & 1<=p24]]]]] | E [~ [[[[p60<=1 & 1<=p60] & [p83<=1 & 1<=p83]] & [[p97<=1 & 1<=p97] & [[p35<=1 & 1<=p35] & [p97<=1 & 1<=p97]]]]] U [[p2<=1 & 1<=p2] & [p98<=1 & 1<=p98]]]]]
normalized: ~ [EX [~ [[E [~ [[[[[p97<=1 & 1<=p97] & [p35<=1 & 1<=p35]] & [p97<=1 & 1<=p97]] & [[p83<=1 & 1<=p83] & [p60<=1 & 1<=p60]]]] U [[p98<=1 & 1<=p98] & [p2<=1 & 1<=p2]]] | ~ [E [true U ~ [[[EX [[p24<=1 & 1<=p24]] & [~ [EG [~ [[p20<=1 & 1<=p20]]]] & ~ [E [~ [[p20<=1 & 1<=p20]] U [~ [[p68<=1 & 1<=p68]] & ~ [[p20<=1 & 1<=p20]]]]]]] & E [true U ~ [EX [~ [[p83<=1 & 1<=p83]]]]]]]]]]]]]

abstracting: (1<=p83)
states: 35,831,808 (7)
abstracting: (p83<=1)
states: 429,981,697 (8)
.abstracting: (1<=p20)
states: 35,831,808 (7)
abstracting: (p20<=1)
states: 429,981,697 (8)
abstracting: (1<=p68)
states: 35,831,808 (7)
abstracting: (p68<=1)
states: 429,981,697 (8)
abstracting: (1<=p20)
states: 35,831,808 (7)
abstracting: (p20<=1)
states: 429,981,697 (8)
abstracting: (1<=p20)
states: 35,831,808 (7)
abstracting: (p20<=1)
states: 429,981,697 (8)
.
EG iterations: 1
abstracting: (1<=p24)
states: 35,831,808 (7)
abstracting: (p24<=1)
states: 429,981,697 (8)
.abstracting: (1<=p2)
states: 35,831,808 (7)
abstracting: (p2<=1)
states: 429,981,697 (8)
abstracting: (1<=p98)
states: 429,981,696 (8)
abstracting: (p98<=1)
states: 429,981,697 (8)
abstracting: (1<=p60)
states: 35,831,808 (7)
abstracting: (p60<=1)
states: 429,981,697 (8)
abstracting: (1<=p83)
states: 35,831,808 (7)
abstracting: (p83<=1)
states: 429,981,697 (8)
abstracting: (1<=p97)
states: 429,981,696 (8)
abstracting: (p97<=1)
states: 429,981,697 (8)
abstracting: (1<=p35)
states: 35,831,808 (7)
abstracting: (p35<=1)
states: 429,981,697 (8)
abstracting: (1<=p97)
states: 429,981,696 (8)
abstracting: (p97<=1)
states: 429,981,697 (8)
.-> the formula is TRUE

FORMULA FlexibleBarrier-PT-08a-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.827sec

checking: [AX [AF [[AX [[p56<=0 & 0<=p56]] & [[[p36<=0 & 0<=p36] | [[p95<=0 & 0<=p95] | [p97<=0 & 0<=p97]]] & AG [[p60<=0 & 0<=p60]]]]]] | EX [[AF [[[p11<=0 & 0<=p11] | [[p36<=0 & 0<=p36] | [p97<=0 & 0<=p97]]]] & E [AF [~ [[[p35<=1 & 1<=p35] & [[p48<=1 & 1<=p48] & [p97<=1 & 1<=p97]]]]] U ~ [AX [[p13<=1 & 1<=p13]]]]]]]
normalized: [EX [[E [~ [EG [[[[p97<=1 & 1<=p97] & [p48<=1 & 1<=p48]] & [p35<=1 & 1<=p35]]]] U EX [~ [[p13<=1 & 1<=p13]]]] & ~ [EG [~ [[[[p97<=0 & 0<=p97] | [p36<=0 & 0<=p36]] | [p11<=0 & 0<=p11]]]]]]] | ~ [EX [EG [~ [[[~ [E [true U ~ [[p60<=0 & 0<=p60]]]] & [[[p97<=0 & 0<=p97] | [p95<=0 & 0<=p95]] | [p36<=0 & 0<=p36]]] & ~ [EX [~ [[p56<=0 & 0<=p56]]]]]]]]]]

abstracting: (0<=p56)
states: 429,981,697 (8)
abstracting: (p56<=0)
states: 394,149,889 (8)
.abstracting: (0<=p36)
states: 429,981,697 (8)
abstracting: (p36<=0)
states: 394,149,889 (8)
abstracting: (0<=p95)
states: 429,981,697 (8)
abstracting: (p95<=0)
states: 394,149,889 (8)
abstracting: (0<=p97)
states: 429,981,697 (8)
abstracting: (p97<=0)
states: 1
abstracting: (0<=p60)
states: 429,981,697 (8)
abstracting: (p60<=0)
states: 394,149,889 (8)

EG iterations: 0
.abstracting: (0<=p11)
states: 429,981,697 (8)
abstracting: (p11<=0)
states: 394,149,889 (8)
abstracting: (0<=p36)
states: 429,981,697 (8)
abstracting: (p36<=0)
states: 394,149,889 (8)
abstracting: (0<=p97)
states: 429,981,697 (8)
abstracting: (p97<=0)
states: 1
.
EG iterations: 1
abstracting: (1<=p13)
states: 35,831,808 (7)
abstracting: (p13<=1)
states: 429,981,697 (8)
.abstracting: (1<=p35)
states: 35,831,808 (7)
abstracting: (p35<=1)
states: 429,981,697 (8)
abstracting: (1<=p48)
states: 35,831,808 (7)
abstracting: (p48<=1)
states: 429,981,697 (8)
abstracting: (1<=p97)
states: 429,981,696 (8)
abstracting: (p97<=1)
states: 429,981,697 (8)
.
EG iterations: 1
.-> the formula is TRUE

FORMULA FlexibleBarrier-PT-08a-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.830sec

checking: E [[EG [EX [[1<=p8 & p8<=1]]] | AF [[EF [[p82<=1 & 1<=p82]] | [[~ [[[p60<=1 & 1<=p60] & [[p83<=1 & 1<=p83] & [p97<=1 & 1<=p97]]]] | [[p12<=1 & 1<=p12] & [[p83<=1 & 1<=p83] & [p97<=1 & 1<=p97]]]] & AX [[[p23<=1 & 1<=p23] & [[p84<=1 & 1<=p84] & [p97<=1 & 1<=p97]]]]]]]] U AG [[[p50<=1 & 1<=p50] & [p98<=1 & 1<=p98]]]]
normalized: E [[~ [EG [~ [[[~ [EX [~ [[[[p97<=1 & 1<=p97] & [p84<=1 & 1<=p84]] & [p23<=1 & 1<=p23]]]]] & [[[[p97<=1 & 1<=p97] & [p83<=1 & 1<=p83]] & [p12<=1 & 1<=p12]] | ~ [[[[p97<=1 & 1<=p97] & [p83<=1 & 1<=p83]] & [p60<=1 & 1<=p60]]]]] | E [true U [p82<=1 & 1<=p82]]]]]] | EG [EX [[1<=p8 & p8<=1]]]] U ~ [E [true U ~ [[[p98<=1 & 1<=p98] & [p50<=1 & 1<=p50]]]]]]

abstracting: (1<=p50)
states: 35,831,808 (7)
abstracting: (p50<=1)
states: 429,981,697 (8)
abstracting: (1<=p98)
states: 429,981,696 (8)
abstracting: (p98<=1)
states: 429,981,697 (8)
abstracting: (p8<=1)
states: 429,981,697 (8)
abstracting: (1<=p8)
states: 35,831,808 (7)
..
EG iterations: 1
abstracting: (1<=p82)
states: 35,831,808 (7)
abstracting: (p82<=1)
states: 429,981,697 (8)
abstracting: (1<=p60)
states: 35,831,808 (7)
abstracting: (p60<=1)
states: 429,981,697 (8)
abstracting: (1<=p83)
states: 35,831,808 (7)
abstracting: (p83<=1)
states: 429,981,697 (8)
abstracting: (1<=p97)
states: 429,981,696 (8)
abstracting: (p97<=1)
states: 429,981,697 (8)
abstracting: (1<=p12)
states: 35,831,808 (7)
abstracting: (p12<=1)
states: 429,981,697 (8)
abstracting: (1<=p83)
states: 35,831,808 (7)
abstracting: (p83<=1)
states: 429,981,697 (8)
abstracting: (1<=p97)
states: 429,981,696 (8)
abstracting: (p97<=1)
states: 429,981,697 (8)
abstracting: (1<=p23)
states: 35,831,808 (7)
abstracting: (p23<=1)
states: 429,981,697 (8)
abstracting: (1<=p84)
states: 35,831,808 (7)
abstracting: (p84<=1)
states: 429,981,697 (8)
abstracting: (1<=p97)
states: 429,981,696 (8)
abstracting: (p97<=1)
states: 429,981,697 (8)
..
EG iterations: 1
-> the formula is FALSE

FORMULA FlexibleBarrier-PT-08a-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.846sec

checking: [AX [EG [[[p1<=0 & 0<=p1] | [[p82<=1 & 1<=p82] | [p24<=1 & 1<=p24]]]]] | A [AG [A [[p24<=1 & 1<=p24] U [[p36<=1 & 1<=p36] & [[p47<=1 & 1<=p47] & [p97<=1 & 1<=p97]]]]] U [AF [[[p47<=1 & 1<=p47] & [[p72<=1 & 1<=p72] & [p97<=1 & 1<=p97]]]] | AF [[[p12<=1 & 1<=p12] & [[p35<=1 & 1<=p35] & [p97<=1 & 1<=p97]]]]]]]
normalized: [[~ [EG [~ [[~ [EG [~ [[[[p97<=1 & 1<=p97] & [p35<=1 & 1<=p35]] & [p12<=1 & 1<=p12]]]]] | ~ [EG [~ [[[[p97<=1 & 1<=p97] & [p72<=1 & 1<=p72]] & [p47<=1 & 1<=p47]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[[[p97<=1 & 1<=p97] & [p35<=1 & 1<=p35]] & [p12<=1 & 1<=p12]]]]] | ~ [EG [~ [[[[p97<=1 & 1<=p97] & [p72<=1 & 1<=p72]] & [p47<=1 & 1<=p47]]]]]]] U [E [true U ~ [[~ [EG [~ [[[[p97<=1 & 1<=p97] & [p47<=1 & 1<=p47]] & [p36<=1 & 1<=p36]]]]] & ~ [E [~ [[[[p97<=1 & 1<=p97] & [p47<=1 & 1<=p47]] & [p36<=1 & 1<=p36]]] U [~ [[p24<=1 & 1<=p24]] & ~ [[[[p97<=1 & 1<=p97] & [p47<=1 & 1<=p47]] & [p36<=1 & 1<=p36]]]]]]]]] & ~ [[~ [EG [~ [[[[p97<=1 & 1<=p97] & [p35<=1 & 1<=p35]] & [p12<=1 & 1<=p12]]]]] | ~ [EG [~ [[[[p97<=1 & 1<=p97] & [p72<=1 & 1<=p72]] & [p47<=1 & 1<=p47]]]]]]]]]]] | ~ [EX [~ [EG [[[[p24<=1 & 1<=p24] | [p82<=1 & 1<=p82]] | [p1<=0 & 0<=p1]]]]]]]

abstracting: (0<=p1)
states: 429,981,697 (8)
abstracting: (p1<=0)
states: 394,149,889 (8)
abstracting: (1<=p82)
states: 35,831,808 (7)
abstracting: (p82<=1)
states: 429,981,697 (8)
abstracting: (1<=p24)
states: 35,831,808 (7)
abstracting: (p24<=1)
states: 429,981,697 (8)
.
EG iterations: 1
.abstracting: (1<=p47)
states: 35,831,808 (7)
abstracting: (p47<=1)
states: 429,981,697 (8)
abstracting: (1<=p72)
states: 35,831,808 (7)
abstracting: (p72<=1)
states: 429,981,697 (8)
abstracting: (1<=p97)
states: 429,981,696 (8)
abstracting: (p97<=1)
states: 429,981,697 (8)
.
EG iterations: 1
abstracting: (1<=p12)
states: 35,831,808 (7)
abstracting: (p12<=1)
states: 429,981,697 (8)
abstracting: (1<=p35)
states: 35,831,808 (7)
abstracting: (p35<=1)
states: 429,981,697 (8)
abstracting: (1<=p97)
states: 429,981,696 (8)
abstracting: (p97<=1)
states: 429,981,697 (8)
.
EG iterations: 1
abstracting: (1<=p36)
states: 35,831,808 (7)
abstracting: (p36<=1)
states: 429,981,697 (8)
abstracting: (1<=p47)
states: 35,831,808 (7)
abstracting: (p47<=1)
states: 429,981,697 (8)
abstracting: (1<=p97)
states: 429,981,696 (8)
abstracting: (p97<=1)
states: 429,981,697 (8)
abstracting: (1<=p24)
states: 35,831,808 (7)
abstracting: (p24<=1)
states: 429,981,697 (8)
abstracting: (1<=p36)
states: 35,831,808 (7)
abstracting: (p36<=1)
states: 429,981,697 (8)
abstracting: (1<=p47)
states: 35,831,808 (7)
abstracting: (p47<=1)
states: 429,981,697 (8)
abstracting: (1<=p97)
states: 429,981,696 (8)
abstracting: (p97<=1)
states: 429,981,697 (8)
abstracting: (1<=p36)
states: 35,831,808 (7)
abstracting: (p36<=1)
states: 429,981,697 (8)
abstracting: (1<=p47)
states: 35,831,808 (7)
abstracting: (p47<=1)
states: 429,981,697 (8)
abstracting: (1<=p97)
states: 429,981,696 (8)
abstracting: (p97<=1)
states: 429,981,697 (8)
.
EG iterations: 1
abstracting: (1<=p47)
states: 35,831,808 (7)
abstracting: (p47<=1)
states: 429,981,697 (8)
abstracting: (1<=p72)
states: 35,831,808 (7)
abstracting: (p72<=1)
states: 429,981,697 (8)
abstracting: (1<=p97)
states: 429,981,696 (8)
abstracting: (p97<=1)
states: 429,981,697 (8)
.
EG iterations: 1
abstracting: (1<=p12)
states: 35,831,808 (7)
abstracting: (p12<=1)
states: 429,981,697 (8)
abstracting: (1<=p35)
states: 35,831,808 (7)
abstracting: (p35<=1)
states: 429,981,697 (8)
abstracting: (1<=p97)
states: 429,981,696 (8)
abstracting: (p97<=1)
states: 429,981,697 (8)
.
EG iterations: 1
abstracting: (1<=p47)
states: 35,831,808 (7)
abstracting: (p47<=1)
states: 429,981,697 (8)
abstracting: (1<=p72)
states: 35,831,808 (7)
abstracting: (p72<=1)
states: 429,981,697 (8)
abstracting: (1<=p97)
states: 429,981,696 (8)
abstracting: (p97<=1)
states: 429,981,697 (8)
.
EG iterations: 1
abstracting: (1<=p12)
states: 35,831,808 (7)
abstracting: (p12<=1)
states: 429,981,697 (8)
abstracting: (1<=p35)
states: 35,831,808 (7)
abstracting: (p35<=1)
states: 429,981,697 (8)
abstracting: (1<=p97)
states: 429,981,696 (8)
abstracting: (p97<=1)
states: 429,981,697 (8)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA FlexibleBarrier-PT-08a-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.577sec

checking: EG [[AF [[[EG [[p82<=0 & 0<=p82]] | [p11<=0 & 0<=p11]] | [[p48<=0 & 0<=p48] | [p97<=0 & 0<=p97]]]] | EG [A [[[[[p56<=1 & 1<=p56] | [[p57<=1 & 1<=p57] & [p98<=1 & 1<=p98]]] & [p63<=1 & 1<=p63]] & [[p35<=1 & 1<=p35] & [[p84<=1 & 1<=p84] & [p97<=1 & 1<=p97]]]] U AG [[[p23<=1 & 1<=p23] & [[p60<=1 & 1<=p60] & [p97<=1 & 1<=p97]]]]]]]]
normalized: EG [[EG [[~ [EG [E [true U ~ [[[[p97<=1 & 1<=p97] & [p60<=1 & 1<=p60]] & [p23<=1 & 1<=p23]]]]]] & ~ [E [E [true U ~ [[[[p97<=1 & 1<=p97] & [p60<=1 & 1<=p60]] & [p23<=1 & 1<=p23]]]] U [~ [[[[[p97<=1 & 1<=p97] & [p84<=1 & 1<=p84]] & [p35<=1 & 1<=p35]] & [[p63<=1 & 1<=p63] & [[[p98<=1 & 1<=p98] & [p57<=1 & 1<=p57]] | [p56<=1 & 1<=p56]]]]] & E [true U ~ [[[[p97<=1 & 1<=p97] & [p60<=1 & 1<=p60]] & [p23<=1 & 1<=p23]]]]]]]]] | ~ [EG [~ [[[[p97<=0 & 0<=p97] | [p48<=0 & 0<=p48]] | [[p11<=0 & 0<=p11] | EG [[p82<=0 & 0<=p82]]]]]]]]]

abstracting: (0<=p82)
states: 429,981,697 (8)
abstracting: (p82<=0)
states: 394,149,889 (8)
.
EG iterations: 1
abstracting: (0<=p11)
states: 429,981,697 (8)
abstracting: (p11<=0)
states: 394,149,889 (8)
abstracting: (0<=p48)
states: 429,981,697 (8)
abstracting: (p48<=0)
states: 394,149,889 (8)
abstracting: (0<=p97)
states: 429,981,697 (8)
abstracting: (p97<=0)
states: 1
.
EG iterations: 1
abstracting: (1<=p23)
states: 35,831,808 (7)
abstracting: (p23<=1)
states: 429,981,697 (8)
abstracting: (1<=p60)
states: 35,831,808 (7)
abstracting: (p60<=1)
states: 429,981,697 (8)
abstracting: (1<=p97)
states: 429,981,696 (8)
abstracting: (p97<=1)
states: 429,981,697 (8)
abstracting: (1<=p56)
states: 35,831,808 (7)
abstracting: (p56<=1)
states: 429,981,697 (8)
abstracting: (1<=p57)
states: 35,831,808 (7)
abstracting: (p57<=1)
states: 429,981,697 (8)
abstracting: (1<=p98)
states: 429,981,696 (8)
abstracting: (p98<=1)
states: 429,981,697 (8)
abstracting: (1<=p63)
states: 35,831,808 (7)
abstracting: (p63<=1)
states: 429,981,697 (8)
abstracting: (1<=p35)
states: 35,831,808 (7)
abstracting: (p35<=1)
states: 429,981,697 (8)
abstracting: (1<=p84)
states: 35,831,808 (7)
abstracting: (p84<=1)
states: 429,981,697 (8)
abstracting: (1<=p97)
states: 429,981,696 (8)
abstracting: (p97<=1)
states: 429,981,697 (8)
abstracting: (1<=p23)
states: 35,831,808 (7)
abstracting: (p23<=1)
states: 429,981,697 (8)
abstracting: (1<=p60)
states: 35,831,808 (7)
abstracting: (p60<=1)
states: 429,981,697 (8)
abstracting: (1<=p97)
states: 429,981,696 (8)
abstracting: (p97<=1)
states: 429,981,697 (8)
abstracting: (1<=p23)
states: 35,831,808 (7)
abstracting: (p23<=1)
states: 429,981,697 (8)
abstracting: (1<=p60)
states: 35,831,808 (7)
abstracting: (p60<=1)
states: 429,981,697 (8)
abstracting: (1<=p97)
states: 429,981,696 (8)
abstracting: (p97<=1)
states: 429,981,697 (8)

EG iterations: 0
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA FlexibleBarrier-PT-08a-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.228sec

checking: AF [[E [EG [[~ [[[p52<=1 & 1<=p52] & [p98<=1 & 1<=p98]]] & ~ [[[p84<=1 & 1<=p84] & [[p95<=1 & 1<=p95] & [p97<=1 & 1<=p97]]]]]] U E [EG [[[p72<=1 & 1<=p72] & [[p83<=1 & 1<=p83] & [p97<=1 & 1<=p97]]]] U [~ [[p73<=1 & 1<=p73]] & [[p22<=1 & 1<=p22] | [[p4<=1 & 1<=p4] & [p98<=1 & 1<=p98]]]]]] & EG [[~ [E [[[p59<=1 & 1<=p59] & [[p84<=1 & 1<=p84] & [p97<=1 & 1<=p97]]] U [p10<=1 & 1<=p10]]] & AF [[[p59<=0 & 0<=p59] | [[p72<=0 & 0<=p72] | [p97<=0 & 0<=p97]]]]]]]]
normalized: ~ [EG [~ [[EG [[~ [EG [~ [[[[p97<=0 & 0<=p97] | [p72<=0 & 0<=p72]] | [p59<=0 & 0<=p59]]]]] & ~ [E [[[[p97<=1 & 1<=p97] & [p84<=1 & 1<=p84]] & [p59<=1 & 1<=p59]] U [p10<=1 & 1<=p10]]]]] & E [EG [[~ [[[[p97<=1 & 1<=p97] & [p95<=1 & 1<=p95]] & [p84<=1 & 1<=p84]]] & ~ [[[p98<=1 & 1<=p98] & [p52<=1 & 1<=p52]]]]] U E [EG [[[[p97<=1 & 1<=p97] & [p83<=1 & 1<=p83]] & [p72<=1 & 1<=p72]]] U [[[[p98<=1 & 1<=p98] & [p4<=1 & 1<=p4]] | [p22<=1 & 1<=p22]] & ~ [[p73<=1 & 1<=p73]]]]]]]]]

abstracting: (1<=p73)
states: 35,831,808 (7)
abstracting: (p73<=1)
states: 429,981,697 (8)
abstracting: (1<=p22)
states: 35,831,808 (7)
abstracting: (p22<=1)
states: 429,981,697 (8)
abstracting: (1<=p4)
states: 35,831,808 (7)
abstracting: (p4<=1)
states: 429,981,697 (8)
abstracting: (1<=p98)
states: 429,981,696 (8)
abstracting: (p98<=1)
states: 429,981,697 (8)
abstracting: (1<=p72)
states: 35,831,808 (7)
abstracting: (p72<=1)
states: 429,981,697 (8)
abstracting: (1<=p83)
states: 35,831,808 (7)
abstracting: (p83<=1)
states: 429,981,697 (8)
abstracting: (1<=p97)
states: 429,981,696 (8)
abstracting: (p97<=1)
states: 429,981,697 (8)
.
EG iterations: 1
abstracting: (1<=p52)
states: 35,831,808 (7)
abstracting: (p52<=1)
states: 429,981,697 (8)
abstracting: (1<=p98)
states: 429,981,696 (8)
abstracting: (p98<=1)
states: 429,981,697 (8)
abstracting: (1<=p84)
states: 35,831,808 (7)
abstracting: (p84<=1)
states: 429,981,697 (8)
abstracting: (1<=p95)
states: 35,831,808 (7)
abstracting: (p95<=1)
states: 429,981,697 (8)
abstracting: (1<=p97)
states: 429,981,696 (8)
abstracting: (p97<=1)
states: 429,981,697 (8)
.
EG iterations: 1
abstracting: (1<=p10)
states: 35,831,808 (7)
abstracting: (p10<=1)
states: 429,981,697 (8)
abstracting: (1<=p59)
states: 35,831,808 (7)
abstracting: (p59<=1)
states: 429,981,697 (8)
abstracting: (1<=p84)
states: 35,831,808 (7)
abstracting: (p84<=1)
states: 429,981,697 (8)
abstracting: (1<=p97)
states: 429,981,696 (8)
abstracting: (p97<=1)
states: 429,981,697 (8)
abstracting: (0<=p59)
states: 429,981,697 (8)
abstracting: (p59<=0)
states: 394,149,889 (8)
abstracting: (0<=p72)
states: 429,981,697 (8)
abstracting: (p72<=0)
states: 394,149,889 (8)
abstracting: (0<=p97)
states: 429,981,697 (8)
abstracting: (p97<=0)
states: 1
.
EG iterations: 1
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA FlexibleBarrier-PT-08a-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.336sec

checking: ~ [E [AF [EX [A [[[p93<=1 & 1<=p93] & [p98<=1 & 1<=p98]] U [p48<=1 & 1<=p48]]]] U [~ [[~ [AX [[[p72<=1 & 1<=p72] & [[p83<=1 & 1<=p83] & [p97<=1 & 1<=p97]]]]] & EX [[[p59<=1 & 1<=p59] & [[p21<=1 & 1<=p21] & [p98<=1 & 1<=p98]]]]]] & A [[EF [[[p72<=1 & 1<=p72] & [[p83<=1 & 1<=p83] & [p97<=1 & 1<=p97]]]] & [AG [[[p71<=1 & 1<=p71] & [[p84<=1 & 1<=p84] & [p97<=1 & 1<=p97]]]] | [[[p90<=1 & 1<=p90] & [p97<=1 & 1<=p97]] | [[p57<=1 & 1<=p57] & [p98<=1 & 1<=p98]]]]] U [EF [[p23<=1 & 1<=p23]] | [[[p91<=1 & 1<=p91] & [p98<=1 & 1<=p98]] | [[[p67<=1 & 1<=p67] & [p98<=1 & 1<=p98]] & [[p59<=1 & 1<=p59] & [p97<=1 & 1<=p97]]]]]]]]]
normalized: ~ [E [~ [EG [~ [EX [[~ [EG [~ [[p48<=1 & 1<=p48]]]] & ~ [E [~ [[p48<=1 & 1<=p48]] U [~ [[[p98<=1 & 1<=p98] & [p93<=1 & 1<=p93]]] & ~ [[p48<=1 & 1<=p48]]]]]]]]]] U [[~ [EG [~ [[[[[[p97<=1 & 1<=p97] & [p59<=1 & 1<=p59]] & [[p98<=1 & 1<=p98] & [p67<=1 & 1<=p67]]] | [[p98<=1 & 1<=p98] & [p91<=1 & 1<=p91]]] | E [true U [p23<=1 & 1<=p23]]]]]] & ~ [E [~ [[[[[[p97<=1 & 1<=p97] & [p59<=1 & 1<=p59]] & [[p98<=1 & 1<=p98] & [p67<=1 & 1<=p67]]] | [[p98<=1 & 1<=p98] & [p91<=1 & 1<=p91]]] | E [true U [p23<=1 & 1<=p23]]]] U [~ [[[~ [E [true U ~ [[[[p97<=1 & 1<=p97] & [p84<=1 & 1<=p84]] & [p71<=1 & 1<=p71]]]]] | [[[p98<=1 & 1<=p98] & [p57<=1 & 1<=p57]] | [[p97<=1 & 1<=p97] & [p90<=1 & 1<=p90]]]] & E [true U [[[p97<=1 & 1<=p97] & [p83<=1 & 1<=p83]] & [p72<=1 & 1<=p72]]]]] & ~ [[[[[[p97<=1 & 1<=p97] & [p59<=1 & 1<=p59]] & [[p98<=1 & 1<=p98] & [p67<=1 & 1<=p67]]] | [[p98<=1 & 1<=p98] & [p91<=1 & 1<=p91]]] | E [true U [p23<=1 & 1<=p23]]]]]]]] & ~ [[EX [[[[p98<=1 & 1<=p98] & [p21<=1 & 1<=p21]] & [p59<=1 & 1<=p59]]] & EX [~ [[[[p97<=1 & 1<=p97] & [p83<=1 & 1<=p83]] & [p72<=1 & 1<=p72]]]]]]]]]

abstracting: (1<=p72)
states: 35,831,808 (7)
abstracting: (p72<=1)
states: 429,981,697 (8)
abstracting: (1<=p83)
states: 35,831,808 (7)
abstracting: (p83<=1)
states: 429,981,697 (8)
abstracting: (1<=p97)
states: 429,981,696 (8)
abstracting: (p97<=1)
states: 429,981,697 (8)
.abstracting: (1<=p59)
states: 35,831,808 (7)
abstracting: (p59<=1)
states: 429,981,697 (8)
abstracting: (1<=p21)
states: 35,831,808 (7)
abstracting: (p21<=1)
states: 429,981,697 (8)
abstracting: (1<=p98)
states: 429,981,696 (8)
abstracting: (p98<=1)
states: 429,981,697 (8)
.abstracting: (1<=p23)
states: 35,831,808 (7)
abstracting: (p23<=1)
states: 429,981,697 (8)
abstracting: (1<=p91)
states: 35,831,808 (7)
abstracting: (p91<=1)
states: 429,981,697 (8)
abstracting: (1<=p98)
states: 429,981,696 (8)
abstracting: (p98<=1)
states: 429,981,697 (8)
abstracting: (1<=p67)
states: 35,831,808 (7)
abstracting: (p67<=1)
states: 429,981,697 (8)
abstracting: (1<=p98)
states: 429,981,696 (8)
abstracting: (p98<=1)
states: 429,981,697 (8)
abstracting: (1<=p59)
states: 35,831,808 (7)
abstracting: (p59<=1)
states: 429,981,697 (8)
abstracting: (1<=p97)
states: 429,981,696 (8)
abstracting: (p97<=1)
states: 429,981,697 (8)
abstracting: (1<=p72)
states: 35,831,808 (7)
abstracting: (p72<=1)
states: 429,981,697 (8)
abstracting: (1<=p83)
states: 35,831,808 (7)
abstracting: (p83<=1)
states: 429,981,697 (8)
abstracting: (1<=p97)
states: 429,981,696 (8)
abstracting: (p97<=1)
states: 429,981,697 (8)
abstracting: (1<=p90)
states: 35,831,808 (7)
abstracting: (p90<=1)
states: 429,981,697 (8)
abstracting: (1<=p97)
states: 429,981,696 (8)
abstracting: (p97<=1)
states: 429,981,697 (8)
abstracting: (1<=p57)
states: 35,831,808 (7)
abstracting: (p57<=1)
states: 429,981,697 (8)
abstracting: (1<=p98)
states: 429,981,696 (8)
abstracting: (p98<=1)
states: 429,981,697 (8)
abstracting: (1<=p71)
states: 35,831,808 (7)
abstracting: (p71<=1)
states: 429,981,697 (8)
abstracting: (1<=p84)
states: 35,831,808 (7)
abstracting: (p84<=1)
states: 429,981,697 (8)
abstracting: (1<=p97)
states: 429,981,696 (8)
abstracting: (p97<=1)
states: 429,981,697 (8)
abstracting: (1<=p23)
states: 35,831,808 (7)
abstracting: (p23<=1)
states: 429,981,697 (8)
abstracting: (1<=p91)
states: 35,831,808 (7)
abstracting: (p91<=1)
states: 429,981,697 (8)
abstracting: (1<=p98)
states: 429,981,696 (8)
abstracting: (p98<=1)
states: 429,981,697 (8)
abstracting: (1<=p67)
states: 35,831,808 (7)
abstracting: (p67<=1)
states: 429,981,697 (8)
abstracting: (1<=p98)
states: 429,981,696 (8)
abstracting: (p98<=1)
states: 429,981,697 (8)
abstracting: (1<=p59)
states: 35,831,808 (7)
abstracting: (p59<=1)
states: 429,981,697 (8)
abstracting: (1<=p97)
states: 429,981,696 (8)
abstracting: (p97<=1)
states: 429,981,697 (8)
abstracting: (1<=p23)
states: 35,831,808 (7)
abstracting: (p23<=1)
states: 429,981,697 (8)
abstracting: (1<=p91)
states: 35,831,808 (7)
abstracting: (p91<=1)
states: 429,981,697 (8)
abstracting: (1<=p98)
states: 429,981,696 (8)
abstracting: (p98<=1)
states: 429,981,697 (8)
abstracting: (1<=p67)
states: 35,831,808 (7)
abstracting: (p67<=1)
states: 429,981,697 (8)
abstracting: (1<=p98)
states: 429,981,696 (8)
abstracting: (p98<=1)
states: 429,981,697 (8)
abstracting: (1<=p59)
states: 35,831,808 (7)
abstracting: (p59<=1)
states: 429,981,697 (8)
abstracting: (1<=p97)
states: 429,981,696 (8)
abstracting: (p97<=1)
states: 429,981,697 (8)
.
EG iterations: 1
abstracting: (1<=p48)
states: 35,831,808 (7)
abstracting: (p48<=1)
states: 429,981,697 (8)
abstracting: (1<=p93)
states: 35,831,808 (7)
abstracting: (p93<=1)
states: 429,981,697 (8)
abstracting: (1<=p98)
states: 429,981,696 (8)
abstracting: (p98<=1)
states: 429,981,697 (8)
abstracting: (1<=p48)
states: 35,831,808 (7)
abstracting: (p48<=1)
states: 429,981,697 (8)
abstracting: (1<=p48)
states: 35,831,808 (7)
abstracting: (p48<=1)
states: 429,981,697 (8)
..
EG iterations: 2
..
EG iterations: 1
-> the formula is FALSE

FORMULA FlexibleBarrier-PT-08a-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.167sec

totally nodes used: 3725718 (3.7e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 14548946 32104342 46653288
used/not used/entry size/cache size: 27648067 39460797 16 1024MB
basic ops cache: hits/miss/sum: 943060 1941005 2884065
used/not used/entry size/cache size: 2732143 14045073 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: 81994 175236 257230
used/not used/entry size/cache size: 173455 8215153 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 63747071
1 3044841
2 275024
3 37327
4 4199
5 362
6 38
7 2
8 0
9 0
>= 10 0

Total processing time: 0m15.483sec


BK_STOP 1678553715883

--------------------
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:5344 (30), effective:166 (0)

initing FirstDep: 0m 0.000sec


iterations count:654 (3), effective:12 (0)

iterations count:1097 (6), effective:23 (0)

iterations count:178 (1), effective:0 (0)

iterations count:1134 (6), effective:23 (0)

iterations count:210 (1), effective:1 (0)

iterations count:189 (1), effective:1 (0)

iterations count:2533 (14), effective:65 (0)

iterations count:181 (1), effective:1 (0)

iterations count:178 (1), effective:0 (0)

iterations count:1085 (6), effective:23 (0)

iterations count:872 (4), effective:12 (0)

iterations count:178 (1), effective:0 (0)

iterations count:236 (1), effective:1 (0)

iterations count:1332 (7), effective:23 (0)

iterations count:598 (3), effective:12 (0)

iterations count:605 (3), effective:12 (0)

iterations count:178 (1), effective:0 (0)

iterations count:278 (1), effective:1 (0)

iterations count:278 (1), effective:1 (0)

iterations count:208 (1), effective:2 (0)

iterations count:278 (1), effective:1 (0)

iterations count:939 (5), effective:22 (0)

iterations count:1212 (6), effective:28 (0)

iterations count:947 (5), effective:22 (0)

iterations count:1091 (6), effective:23 (0)

iterations count:1922 (10), effective:34 (0)

iterations count:279 (1), effective:1 (0)

iterations count:1091 (6), effective:23 (0)

iterations count:1091 (6), effective:23 (0)

iterations count:223 (1), effective:1 (0)

iterations count:191 (1), effective:2 (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-08a"
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-08a, 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-167838857300474"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-08a.tgz
mv FlexibleBarrier-PT-08a 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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;