fond

jQuery Multi Level CSS Menu Css3Menu.com

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

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

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
7750.867 170832.00 177472.00 842.00 FFTTFFTFTTFFTTFF 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-167838857300490.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-10a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838857300490
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 6.6K Feb 25 12:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 25 12:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 12:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 12:41 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:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Feb 25 12:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 12:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 25 12:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 25 12:53 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 94K 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-10a-CTLFireability-00
FORMULA_NAME FlexibleBarrier-PT-10a-CTLFireability-01
FORMULA_NAME FlexibleBarrier-PT-10a-CTLFireability-02
FORMULA_NAME FlexibleBarrier-PT-10a-CTLFireability-03
FORMULA_NAME FlexibleBarrier-PT-10a-CTLFireability-04
FORMULA_NAME FlexibleBarrier-PT-10a-CTLFireability-05
FORMULA_NAME FlexibleBarrier-PT-10a-CTLFireability-06
FORMULA_NAME FlexibleBarrier-PT-10a-CTLFireability-07
FORMULA_NAME FlexibleBarrier-PT-10a-CTLFireability-08
FORMULA_NAME FlexibleBarrier-PT-10a-CTLFireability-09
FORMULA_NAME FlexibleBarrier-PT-10a-CTLFireability-10
FORMULA_NAME FlexibleBarrier-PT-10a-CTLFireability-11
FORMULA_NAME FlexibleBarrier-PT-10a-CTLFireability-12
FORMULA_NAME FlexibleBarrier-PT-10a-CTLFireability-13
FORMULA_NAME FlexibleBarrier-PT-10a-CTLFireability-14
FORMULA_NAME FlexibleBarrier-PT-10a-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678555906817

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-10a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 17:31:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 17:31:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 17:31:48] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2023-03-11 17:31:48] [INFO ] Transformed 123 places.
[2023-03-11 17:31:48] [INFO ] Transformed 334 transitions.
[2023-03-11 17:31:48] [INFO ] Found NUPN structural information;
[2023-03-11 17:31:48] [INFO ] Parsed PT model containing 123 places and 334 transitions and 1467 arcs in 131 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Ensure Unique test removed 82 transitions
Reduce redundant transitions removed 82 transitions.
Support contains 66 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 252/252 transitions.
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 123 transition count 242
Applied a total of 10 rules in 16 ms. Remains 123 /123 variables (removed 0) and now considering 242/252 (removed 10) transitions.
// Phase 1: matrix 242 rows 123 cols
[2023-03-11 17:31:48] [INFO ] Computed 12 place invariants in 13 ms
[2023-03-11 17:31:48] [INFO ] Implicit Places using invariants in 195 ms returned []
[2023-03-11 17:31:48] [INFO ] Invariant cache hit.
[2023-03-11 17:31:48] [INFO ] State equation strengthened by 141 read => feed constraints.
[2023-03-11 17:31:48] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
[2023-03-11 17:31:48] [INFO ] Invariant cache hit.
[2023-03-11 17:31:49] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 123/123 places, 242/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 559 ms. Remains : 123/123 places, 242/252 transitions.
Support contains 66 out of 123 places after structural reductions.
[2023-03-11 17:31:49] [INFO ] Flatten gal took : 37 ms
[2023-03-11 17:31:49] [INFO ] Flatten gal took : 17 ms
[2023-03-11 17:31:49] [INFO ] Input system was already deterministic with 242 transitions.
Support contains 65 out of 123 places (down from 66) after GAL structural reductions.
Finished random walk after 7344 steps, including 2 resets, run visited all 80 properties in 162 ms. (steps per millisecond=45 )
[2023-03-11 17:31:49] [INFO ] Flatten gal took : 10 ms
[2023-03-11 17:31:49] [INFO ] Flatten gal took : 12 ms
[2023-03-11 17:31:49] [INFO ] Input system was already deterministic with 242 transitions.
Computed a total of 3 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 4 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 123/123 places, 242/242 transitions.
[2023-03-11 17:31:49] [INFO ] Flatten gal took : 9 ms
[2023-03-11 17:31:49] [INFO ] Flatten gal took : 15 ms
[2023-03-11 17:31:49] [INFO ] Input system was already deterministic with 242 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Graph (trivial) has 95 edges and 123 vertex of which 24 / 123 are part of one of the 8 SCC in 2 ms
Free SCC test removed 16 places
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 19 place count 98 transition count 196
Drop transitions removed 58 transitions
Redundant transition composition rules discarded 58 transitions
Iterating global reduction 0 with 58 rules applied. Total rules applied 77 place count 98 transition count 138
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 98 transition count 138
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 97 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 97 transition count 137
Applied a total of 80 rules in 40 ms. Remains 97 /123 variables (removed 26) and now considering 137/242 (removed 105) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 41 ms. Remains : 97/123 places, 137/242 transitions.
[2023-03-11 17:31:49] [INFO ] Flatten gal took : 4 ms
[2023-03-11 17:31:49] [INFO ] Flatten gal took : 5 ms
[2023-03-11 17:31:49] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 3 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 123/123 places, 242/242 transitions.
[2023-03-11 17:31:49] [INFO ] Flatten gal took : 9 ms
[2023-03-11 17:31:49] [INFO ] Flatten gal took : 14 ms
[2023-03-11 17:31:49] [INFO ] Input system was already deterministic with 242 transitions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 2 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 123/123 places, 242/242 transitions.
[2023-03-11 17:31:49] [INFO ] Flatten gal took : 8 ms
[2023-03-11 17:31:49] [INFO ] Flatten gal took : 9 ms
[2023-03-11 17:31:50] [INFO ] Input system was already deterministic with 242 transitions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 2 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 123/123 places, 242/242 transitions.
[2023-03-11 17:31:50] [INFO ] Flatten gal took : 8 ms
[2023-03-11 17:31:50] [INFO ] Flatten gal took : 9 ms
[2023-03-11 17:31:50] [INFO ] Input system was already deterministic with 242 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Graph (trivial) has 88 edges and 123 vertex of which 15 / 123 are part of one of the 5 SCC in 0 ms
Free SCC test removed 10 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 17 place count 105 transition count 218
Drop transitions removed 55 transitions
Redundant transition composition rules discarded 55 transitions
Iterating global reduction 0 with 55 rules applied. Total rules applied 72 place count 105 transition count 163
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 74 place count 105 transition count 163
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 76 place count 103 transition count 161
Iterating global reduction 0 with 2 rules applied. Total rules applied 78 place count 103 transition count 161
Applied a total of 78 rules in 24 ms. Remains 103 /123 variables (removed 20) and now considering 161/242 (removed 81) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 103/123 places, 161/242 transitions.
[2023-03-11 17:31:50] [INFO ] Flatten gal took : 4 ms
[2023-03-11 17:31:50] [INFO ] Flatten gal took : 5 ms
[2023-03-11 17:31:50] [INFO ] Input system was already deterministic with 161 transitions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 1 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 123/123 places, 242/242 transitions.
[2023-03-11 17:31:50] [INFO ] Flatten gal took : 7 ms
[2023-03-11 17:31:50] [INFO ] Flatten gal took : 7 ms
[2023-03-11 17:31:50] [INFO ] Input system was already deterministic with 242 transitions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 1 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 123/123 places, 242/242 transitions.
[2023-03-11 17:31:50] [INFO ] Flatten gal took : 7 ms
[2023-03-11 17:31:50] [INFO ] Flatten gal took : 7 ms
[2023-03-11 17:31:50] [INFO ] Input system was already deterministic with 242 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Graph (trivial) has 98 edges and 123 vertex of which 30 / 123 are part of one of the 10 SCC in 0 ms
Free SCC test removed 20 places
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 137 edges and 100 vertex of which 98 / 100 are part of one of the 10 SCC in 1 ms
Free SCC test removed 88 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 12 transition count 185
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 179 transitions
Reduce isomorphic transitions removed 179 transitions.
Iterating post reduction 1 with 188 rules applied. Total rules applied 192 place count 3 transition count 6
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 194 place count 3 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 194 place count 3 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 196 place count 2 transition count 3
Applied a total of 196 rules in 5 ms. Remains 2 /123 variables (removed 121) and now considering 3/242 (removed 239) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 2/123 places, 3/242 transitions.
[2023-03-11 17:31:50] [INFO ] Flatten gal took : 0 ms
[2023-03-11 17:31:50] [INFO ] Flatten gal took : 1 ms
[2023-03-11 17:31:50] [INFO ] Input system was already deterministic with 3 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
FORMULA FlexibleBarrier-PT-10a-CTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 1 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 123/123 places, 242/242 transitions.
[2023-03-11 17:31:50] [INFO ] Flatten gal took : 7 ms
[2023-03-11 17:31:50] [INFO ] Flatten gal took : 8 ms
[2023-03-11 17:31:50] [INFO ] Input system was already deterministic with 242 transitions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 2 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 123/123 places, 242/242 transitions.
[2023-03-11 17:31:50] [INFO ] Flatten gal took : 8 ms
[2023-03-11 17:31:50] [INFO ] Flatten gal took : 7 ms
[2023-03-11 17:31:50] [INFO ] Input system was already deterministic with 242 transitions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 1 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 123/123 places, 242/242 transitions.
[2023-03-11 17:31:50] [INFO ] Flatten gal took : 6 ms
[2023-03-11 17:31:50] [INFO ] Flatten gal took : 7 ms
[2023-03-11 17:31:50] [INFO ] Input system was already deterministic with 242 transitions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 6 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 123/123 places, 242/242 transitions.
[2023-03-11 17:31:50] [INFO ] Flatten gal took : 7 ms
[2023-03-11 17:31:50] [INFO ] Flatten gal took : 7 ms
[2023-03-11 17:31:50] [INFO ] Input system was already deterministic with 242 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Graph (trivial) has 80 edges and 123 vertex of which 15 / 123 are part of one of the 5 SCC in 0 ms
Free SCC test removed 10 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 17 place count 105 transition count 218
Drop transitions removed 51 transitions
Redundant transition composition rules discarded 51 transitions
Iterating global reduction 0 with 51 rules applied. Total rules applied 68 place count 105 transition count 167
Partial Post-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 72 place count 105 transition count 167
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 74 place count 103 transition count 165
Iterating global reduction 0 with 2 rules applied. Total rules applied 76 place count 103 transition count 165
Applied a total of 76 rules in 22 ms. Remains 103 /123 variables (removed 20) and now considering 165/242 (removed 77) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 103/123 places, 165/242 transitions.
[2023-03-11 17:31:50] [INFO ] Flatten gal took : 4 ms
[2023-03-11 17:31:50] [INFO ] Flatten gal took : 4 ms
[2023-03-11 17:31:50] [INFO ] Input system was already deterministic with 165 transitions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 1 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 123/123 places, 242/242 transitions.
[2023-03-11 17:31:50] [INFO ] Flatten gal took : 5 ms
[2023-03-11 17:31:50] [INFO ] Flatten gal took : 6 ms
[2023-03-11 17:31:50] [INFO ] Input system was already deterministic with 242 transitions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 1 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 123/123 places, 242/242 transitions.
[2023-03-11 17:31:50] [INFO ] Flatten gal took : 6 ms
[2023-03-11 17:31:50] [INFO ] Flatten gal took : 6 ms
[2023-03-11 17:31:50] [INFO ] Input system was already deterministic with 242 transitions.
[2023-03-11 17:31:50] [INFO ] Flatten gal took : 6 ms
[2023-03-11 17:31:50] [INFO ] Flatten gal took : 6 ms
[2023-03-11 17:31:50] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-11 17:31:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 123 places, 242 transitions and 939 arcs took 2 ms.
Total runtime 2306 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: 123 NrTr: 242 NrArc: 939)

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

net check time: 0m 0.000sec

init dd package: 0m 2.685sec


RS generation: 0m 4.695sec


-> reachability set: #nodes 79518 (8.0e+04) #states 61,917,364,225 (10)



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

checking: EF [AG [[[p23<=1 & 1<=p23] & [[p108<=1 & 1<=p108] & [p121<=1 & 1<=p121]]]]]
normalized: E [true U ~ [E [true U ~ [[[[p108<=1 & 1<=p108] & [p121<=1 & 1<=p121]] & [p23<=1 & 1<=p23]]]]]]

abstracting: (1<=p23)
states: 5,159,780,352 (9)
abstracting: (p23<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p121)
states: 61,917,364,224 (10)
abstracting: (p121<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p108)
states: 5,159,780,352 (9)
abstracting: (p108<=1)
states: 61,917,364,225 (10)
-> the formula is FALSE

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

MC time: 0m 2.865sec

checking: EX [AG [[EF [[[[p74<=0 & 0<=p74] | [p122<=0 & 0<=p122]] & [p49<=0 & 0<=p49]]] | [[p11<=1 & 1<=p11] & [p121<=1 & 1<=p121]]]]]
normalized: EX [~ [E [true U ~ [[[[p121<=1 & 1<=p121] & [p11<=1 & 1<=p11]] | E [true U [[p49<=0 & 0<=p49] & [[p122<=0 & 0<=p122] | [p74<=0 & 0<=p74]]]]]]]]]

abstracting: (0<=p74)
states: 61,917,364,225 (10)
abstracting: (p74<=0)
states: 56,757,583,873 (10)
abstracting: (0<=p122)
states: 61,917,364,225 (10)
abstracting: (p122<=0)
states: 1
abstracting: (0<=p49)
states: 61,917,364,225 (10)
abstracting: (p49<=0)
states: 56,757,583,873 (10)
abstracting: (1<=p11)
states: 5,159,780,352 (9)
abstracting: (p11<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p121)
states: 61,917,364,224 (10)
abstracting: (p121<=1)
states: 61,917,364,225 (10)
.-> the formula is TRUE

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

MC time: 0m 3.446sec

checking: AX [[AX [[[p47<=1 & 1<=p47] & [[p84<=1 & 1<=p84] & [p121<=1 & 1<=p121]]]] | [[p88<=1 & 1<=p88] & [p122<=1 & 1<=p122]]]]
normalized: ~ [EX [~ [[[[p122<=1 & 1<=p122] & [p88<=1 & 1<=p88]] | ~ [EX [~ [[[[p121<=1 & 1<=p121] & [p84<=1 & 1<=p84]] & [p47<=1 & 1<=p47]]]]]]]]]

abstracting: (1<=p47)
states: 5,159,780,352 (9)
abstracting: (p47<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p84)
states: 5,159,780,352 (9)
abstracting: (p84<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p121)
states: 61,917,364,224 (10)
abstracting: (p121<=1)
states: 61,917,364,225 (10)
.abstracting: (1<=p88)
states: 5,159,780,352 (9)
abstracting: (p88<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p122)
states: 61,917,364,224 (10)
abstracting: (p122<=1)
states: 61,917,364,225 (10)
.-> the formula is FALSE

FORMULA FlexibleBarrier-PT-10a-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.567sec

checking: [EF [[[p35<=1 & 1<=p35] & [[p108<=1 & 1<=p108] & [p121<=1 & 1<=p121]]]] & EF [AG [AF [[[[p12<=0 & 0<=p12] | [[p59<=0 & 0<=p59] | [p121<=0 & 0<=p121]]] & [p83<=0 & 0<=p83]]]]]]
normalized: [E [true U ~ [E [true U EG [~ [[[p83<=0 & 0<=p83] & [[[p121<=0 & 0<=p121] | [p59<=0 & 0<=p59]] | [p12<=0 & 0<=p12]]]]]]]] & E [true U [[[p121<=1 & 1<=p121] & [p108<=1 & 1<=p108]] & [p35<=1 & 1<=p35]]]]

abstracting: (1<=p35)
states: 5,159,780,352 (9)
abstracting: (p35<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p108)
states: 5,159,780,352 (9)
abstracting: (p108<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p121)
states: 61,917,364,224 (10)
abstracting: (p121<=1)
states: 61,917,364,225 (10)
abstracting: (0<=p12)
states: 61,917,364,225 (10)
abstracting: (p12<=0)
states: 56,757,583,873 (10)
abstracting: (0<=p59)
states: 61,917,364,225 (10)
abstracting: (p59<=0)
states: 56,757,583,873 (10)
abstracting: (0<=p121)
states: 61,917,364,225 (10)
abstracting: (p121<=0)
states: 1
abstracting: (0<=p83)
states: 61,917,364,225 (10)
abstracting: (p83<=0)
states: 56,757,583,873 (10)
.
EG iterations: 1
-> the formula is FALSE

FORMULA FlexibleBarrier-PT-10a-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 8.408sec

checking: EF [EX [[AX [[[p12<=0 & 0<=p12] | [[p47<=0 & 0<=p47] | [p121<=0 & 0<=p121]]]] | [[[p36<=1 & 1<=p36] & [p95<=1 & 1<=p95]] & [[p121<=1 & 1<=p121] & [p99<=1 & 1<=p99]]]]]]
normalized: E [true U EX [[[[[p36<=1 & 1<=p36] & [p95<=1 & 1<=p95]] & [[p121<=1 & 1<=p121] & [p99<=1 & 1<=p99]]] | ~ [EX [~ [[[[p121<=0 & 0<=p121] | [p47<=0 & 0<=p47]] | [p12<=0 & 0<=p12]]]]]]]]

abstracting: (0<=p12)
states: 61,917,364,225 (10)
abstracting: (p12<=0)
states: 56,757,583,873 (10)
abstracting: (0<=p47)
states: 61,917,364,225 (10)
abstracting: (p47<=0)
states: 56,757,583,873 (10)
abstracting: (0<=p121)
states: 61,917,364,225 (10)
abstracting: (p121<=0)
states: 1
.abstracting: (1<=p99)
states: 5,159,780,352 (9)
abstracting: (p99<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p121)
states: 61,917,364,224 (10)
abstracting: (p121<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p95)
states: 5,159,780,352 (9)
abstracting: (p95<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p36)
states: 5,159,780,352 (9)
abstracting: (p36<=1)
states: 61,917,364,225 (10)
.-> the formula is TRUE

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

MC time: 0m 1.593sec

checking: EF [AX [EG [[[E [[p34<=1 & 1<=p34] U [[p114<=1 & 1<=p114] & [p121<=1 & 1<=p121]]] & [p119<=1 & 1<=p119]] & [[p73<=1 & 1<=p73] & EX [[[p23<=1 & 1<=p23] & [[p60<=1 & 1<=p60] & [p121<=1 & 1<=p121]]]]]]]]]
normalized: E [true U ~ [EX [~ [EG [[[EX [[[[p60<=1 & 1<=p60] & [p121<=1 & 1<=p121]] & [p23<=1 & 1<=p23]]] & [p73<=1 & 1<=p73]] & [[p119<=1 & 1<=p119] & E [[p34<=1 & 1<=p34] U [[p121<=1 & 1<=p121] & [p114<=1 & 1<=p114]]]]]]]]]]

abstracting: (1<=p114)
states: 5,159,780,352 (9)
abstracting: (p114<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p121)
states: 61,917,364,224 (10)
abstracting: (p121<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p34)
states: 5,159,780,352 (9)
abstracting: (p34<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p119)
states: 5,159,780,352 (9)
abstracting: (p119<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p73)
states: 5,159,780,352 (9)
abstracting: (p73<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p23)
states: 5,159,780,352 (9)
abstracting: (p23<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p121)
states: 61,917,364,224 (10)
abstracting: (p121<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p60)
states: 5,159,780,352 (9)
abstracting: (p60<=1)
states: 61,917,364,225 (10)
..
EG iterations: 1
.-> the formula is FALSE

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

MC time: 0m 2.468sec

checking: EF [AX [[A [~ [AG [[p109<=1 & 1<=p109]]] U [p104<=1 & 1<=p104]] & E [[[EG [[p87<=1 & 1<=p87]] & [p117<=1 & 1<=p117]] & [[p122<=1 & 1<=p122] & [p44<=1 & 1<=p44]]] U [[p4<=1 & 1<=p4] & [p122<=1 & 1<=p122]]]]]]
normalized: E [true U ~ [EX [~ [[E [[[[p44<=1 & 1<=p44] & [p122<=1 & 1<=p122]] & [[p117<=1 & 1<=p117] & EG [[p87<=1 & 1<=p87]]]] U [[p122<=1 & 1<=p122] & [p4<=1 & 1<=p4]]] & [~ [EG [~ [[p104<=1 & 1<=p104]]]] & ~ [E [~ [[p104<=1 & 1<=p104]] U [~ [E [true U ~ [[p109<=1 & 1<=p109]]]] & ~ [[p104<=1 & 1<=p104]]]]]]]]]]]

abstracting: (1<=p104)
states: 5,159,780,352 (9)
abstracting: (p104<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p109)
states: 5,159,780,352 (9)
abstracting: (p109<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p104)
states: 5,159,780,352 (9)
abstracting: (p104<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p104)
states: 5,159,780,352 (9)
abstracting: (p104<=1)
states: 61,917,364,225 (10)
.
EG iterations: 1
abstracting: (1<=p4)
states: 5,159,780,352 (9)
abstracting: (p4<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p122)
states: 61,917,364,224 (10)
abstracting: (p122<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p87)
states: 5,159,780,352 (9)
abstracting: (p87<=1)
states: 61,917,364,225 (10)
.
EG iterations: 1
abstracting: (1<=p117)
states: 5,159,780,352 (9)
abstracting: (p117<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p122)
states: 61,917,364,224 (10)
abstracting: (p122<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p44)
states: 5,159,780,352 (9)
abstracting: (p44<=1)
states: 61,917,364,225 (10)
.-> the formula is FALSE

FORMULA FlexibleBarrier-PT-10a-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.919sec

checking: EF [[[EX [AX [[[p12<=1 & 1<=p12] & [[p47<=1 & 1<=p47] & [p121<=1 & 1<=p121]]]]] & [p11<=1 & 1<=p11]] & [[p72<=1 & 1<=p72] & [[p121<=1 & 1<=p121] & [EF [[[p41<=1 & 1<=p41] | [p20<=1 & 1<=p20]]] | [[p81<=1 & 1<=p81] & [p122<=1 & 1<=p122]]]]]]]
normalized: E [true U [[[[[[p122<=1 & 1<=p122] & [p81<=1 & 1<=p81]] | E [true U [[p20<=1 & 1<=p20] | [p41<=1 & 1<=p41]]]] & [p121<=1 & 1<=p121]] & [p72<=1 & 1<=p72]] & [[p11<=1 & 1<=p11] & EX [~ [EX [~ [[[[p121<=1 & 1<=p121] & [p47<=1 & 1<=p47]] & [p12<=1 & 1<=p12]]]]]]]]]

abstracting: (1<=p12)
states: 5,159,780,352 (9)
abstracting: (p12<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p47)
states: 5,159,780,352 (9)
abstracting: (p47<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p121)
states: 61,917,364,224 (10)
abstracting: (p121<=1)
states: 61,917,364,225 (10)
..abstracting: (1<=p11)
states: 5,159,780,352 (9)
abstracting: (p11<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p72)
states: 5,159,780,352 (9)
abstracting: (p72<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p121)
states: 61,917,364,224 (10)
abstracting: (p121<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p41)
states: 5,159,780,352 (9)
abstracting: (p41<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p20)
states: 5,159,780,352 (9)
abstracting: (p20<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p81)
states: 5,159,780,352 (9)
abstracting: (p81<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p122)
states: 61,917,364,224 (10)
abstracting: (p122<=1)
states: 61,917,364,225 (10)
-> the formula is FALSE

FORMULA FlexibleBarrier-PT-10a-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.142sec

checking: [EF [AG [[[[p95<=0 & 0<=p95] | [p121<=0 & 0<=p121]] | [0<=p60 & p60<=0]]]] | AX [A [E [AX [[[p102<=1 & 1<=p102] & [p121<=1 & 1<=p121]]] U [p92<=1 & 1<=p92]] U [[p96<=1 & 1<=p96] & AG [E [[[p96<=1 & 1<=p96] & [[p119<=1 & 1<=p119] & [p121<=1 & 1<=p121]]] U [[p11<=1 & 1<=p11] & [[p36<=1 & 1<=p36] & [p121<=1 & 1<=p121]]]]]]]]]
normalized: [~ [EX [~ [[~ [EG [~ [[~ [E [true U ~ [E [[[[p121<=1 & 1<=p121] & [p119<=1 & 1<=p119]] & [p96<=1 & 1<=p96]] U [[[p121<=1 & 1<=p121] & [p36<=1 & 1<=p36]] & [p11<=1 & 1<=p11]]]]]] & [p96<=1 & 1<=p96]]]]] & ~ [E [~ [[~ [E [true U ~ [E [[[[p121<=1 & 1<=p121] & [p119<=1 & 1<=p119]] & [p96<=1 & 1<=p96]] U [[[p121<=1 & 1<=p121] & [p36<=1 & 1<=p36]] & [p11<=1 & 1<=p11]]]]]] & [p96<=1 & 1<=p96]]] U [~ [E [~ [EX [~ [[[p121<=1 & 1<=p121] & [p102<=1 & 1<=p102]]]]] U [p92<=1 & 1<=p92]]] & ~ [[~ [E [true U ~ [E [[[[p121<=1 & 1<=p121] & [p119<=1 & 1<=p119]] & [p96<=1 & 1<=p96]] U [[[p121<=1 & 1<=p121] & [p36<=1 & 1<=p36]] & [p11<=1 & 1<=p11]]]]]] & [p96<=1 & 1<=p96]]]]]]]]]] | E [true U ~ [E [true U ~ [[[0<=p60 & p60<=0] | [[p121<=0 & 0<=p121] | [p95<=0 & 0<=p95]]]]]]]]

abstracting: (0<=p95)
states: 61,917,364,225 (10)
abstracting: (p95<=0)
states: 56,757,583,873 (10)
abstracting: (0<=p121)
states: 61,917,364,225 (10)
abstracting: (p121<=0)
states: 1
abstracting: (p60<=0)
states: 56,757,583,873 (10)
abstracting: (0<=p60)
states: 61,917,364,225 (10)
abstracting: (1<=p96)
states: 5,159,780,352 (9)
abstracting: (p96<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p11)
states: 5,159,780,352 (9)
abstracting: (p11<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p36)
states: 5,159,780,352 (9)
abstracting: (p36<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p121)
states: 61,917,364,224 (10)
abstracting: (p121<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p96)
states: 5,159,780,352 (9)
abstracting: (p96<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p119)
states: 5,159,780,352 (9)
abstracting: (p119<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p121)
states: 61,917,364,224 (10)
abstracting: (p121<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p92)
states: 5,159,780,352 (9)
abstracting: (p92<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p102)
states: 5,159,780,352 (9)
abstracting: (p102<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p121)
states: 61,917,364,224 (10)
abstracting: (p121<=1)
states: 61,917,364,225 (10)
.abstracting: (1<=p96)
states: 5,159,780,352 (9)
abstracting: (p96<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p11)
states: 5,159,780,352 (9)
abstracting: (p11<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p36)
states: 5,159,780,352 (9)
abstracting: (p36<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p121)
states: 61,917,364,224 (10)
abstracting: (p121<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p96)
states: 5,159,780,352 (9)
abstracting: (p96<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p119)
states: 5,159,780,352 (9)
abstracting: (p119<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p121)
states: 61,917,364,224 (10)
abstracting: (p121<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p96)
states: 5,159,780,352 (9)
abstracting: (p96<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p11)
states: 5,159,780,352 (9)
abstracting: (p11<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p36)
states: 5,159,780,352 (9)
abstracting: (p36<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p121)
states: 61,917,364,224 (10)
abstracting: (p121<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p96)
states: 5,159,780,352 (9)
abstracting: (p96<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p119)
states: 5,159,780,352 (9)
abstracting: (p119<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p121)
states: 61,917,364,224 (10)
abstracting: (p121<=1)
states: 61,917,364,225 (10)

EG iterations: 0
.-> the formula is FALSE

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

MC time: 0m 6.452sec

checking: [A [[[p48<=1 & 1<=p48] & [[p71<=1 & 1<=p71] & [p121<=1 & 1<=p121]]] U ~ [EG [[p106<=1 & 1<=p106]]]] & [EG [EX [[[[p12<=1 & 1<=p12] & [p35<=1 & 1<=p35]] & [[p121<=1 & 1<=p121] & [A [[[p11<=1 & 1<=p11] & [[p96<=1 & 1<=p96] & [p121<=1 & 1<=p121]]] U [[p12<=1 & 1<=p12] & [[p23<=1 & 1<=p23] & [p121<=1 & 1<=p121]]]] & [p108<=0 & 0<=p108]]]]]] & AF [[p95<=1 & 1<=p95]]]]
normalized: [[~ [EG [EG [[p106<=1 & 1<=p106]]]] & ~ [E [EG [[p106<=1 & 1<=p106]] U [~ [[[[p121<=1 & 1<=p121] & [p71<=1 & 1<=p71]] & [p48<=1 & 1<=p48]]] & EG [[p106<=1 & 1<=p106]]]]]] & [~ [EG [~ [[p95<=1 & 1<=p95]]]] & EG [EX [[[[[p108<=0 & 0<=p108] & [~ [EG [~ [[[[p121<=1 & 1<=p121] & [p23<=1 & 1<=p23]] & [p12<=1 & 1<=p12]]]]] & ~ [E [~ [[[[p121<=1 & 1<=p121] & [p23<=1 & 1<=p23]] & [p12<=1 & 1<=p12]]] U [~ [[[[p121<=1 & 1<=p121] & [p96<=1 & 1<=p96]] & [p11<=1 & 1<=p11]]] & ~ [[[[p121<=1 & 1<=p121] & [p23<=1 & 1<=p23]] & [p12<=1 & 1<=p12]]]]]]]] & [p121<=1 & 1<=p121]] & [[p35<=1 & 1<=p35] & [p12<=1 & 1<=p12]]]]]]]

abstracting: (1<=p12)
states: 5,159,780,352 (9)
abstracting: (p12<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p35)
states: 5,159,780,352 (9)
abstracting: (p35<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p121)
states: 61,917,364,224 (10)
abstracting: (p121<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p12)
states: 5,159,780,352 (9)
abstracting: (p12<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p23)
states: 5,159,780,352 (9)
abstracting: (p23<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p121)
states: 61,917,364,224 (10)
abstracting: (p121<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p11)
states: 5,159,780,352 (9)
abstracting: (p11<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p96)
states: 5,159,780,352 (9)
abstracting: (p96<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p121)
states: 61,917,364,224 (10)
abstracting: (p121<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p12)
states: 5,159,780,352 (9)
abstracting: (p12<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p23)
states: 5,159,780,352 (9)
abstracting: (p23<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p121)
states: 61,917,364,224 (10)
abstracting: (p121<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p12)
states: 5,159,780,352 (9)
abstracting: (p12<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p23)
states: 5,159,780,352 (9)
abstracting: (p23<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p121)
states: 61,917,364,224 (10)
abstracting: (p121<=1)
states: 61,917,364,225 (10)
.
EG iterations: 1
abstracting: (0<=p108)
states: 61,917,364,225 (10)
abstracting: (p108<=0)
states: 56,757,583,873 (10)
..
EG iterations: 1
abstracting: (1<=p95)
states: 5,159,780,352 (9)
abstracting: (p95<=1)
states: 61,917,364,225 (10)
.
EG iterations: 1
abstracting: (1<=p106)
states: 5,159,780,352 (9)
abstracting: (p106<=1)
states: 61,917,364,225 (10)
.
EG iterations: 1
abstracting: (1<=p48)
states: 5,159,780,352 (9)
abstracting: (p48<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p71)
states: 5,159,780,352 (9)
abstracting: (p71<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p121)
states: 61,917,364,224 (10)
abstracting: (p121<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p106)
states: 5,159,780,352 (9)
abstracting: (p106<=1)
states: 61,917,364,225 (10)
.
EG iterations: 1
abstracting: (1<=p106)
states: 5,159,780,352 (9)
abstracting: (p106<=1)
states: 61,917,364,225 (10)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA FlexibleBarrier-PT-10a-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.115sec

checking: EF [[AF [[[p83<=1 & 1<=p83] & [E [[[p12<=1 & 1<=p12] & [[p47<=1 & 1<=p47] & [p121<=1 & 1<=p121]]] U [[p24<=1 & 1<=p24] & [[p35<=1 & 1<=p35] & [p121<=1 & 1<=p121]]]] & [[p31<=0 & 0<=p31] | [p122<=0 & 0<=p122]]]]] | EG [AF [[[p46<=1 & 1<=p46] | [[[p40<=1 & 1<=p40] & [p122<=1 & 1<=p122]] | E [[[p79<=1 & 1<=p79] & [p122<=1 & 1<=p122]] U [p8<=1 & 1<=p8]]]]]]]]
normalized: E [true U [EG [~ [EG [~ [[[E [[[p122<=1 & 1<=p122] & [p79<=1 & 1<=p79]] U [p8<=1 & 1<=p8]] | [[p122<=1 & 1<=p122] & [p40<=1 & 1<=p40]]] | [p46<=1 & 1<=p46]]]]]] | ~ [EG [~ [[[[[p122<=0 & 0<=p122] | [p31<=0 & 0<=p31]] & E [[[[p121<=1 & 1<=p121] & [p47<=1 & 1<=p47]] & [p12<=1 & 1<=p12]] U [[[p121<=1 & 1<=p121] & [p35<=1 & 1<=p35]] & [p24<=1 & 1<=p24]]]] & [p83<=1 & 1<=p83]]]]]]]

abstracting: (1<=p83)
states: 5,159,780,352 (9)
abstracting: (p83<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p24)
states: 5,159,780,352 (9)
abstracting: (p24<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p35)
states: 5,159,780,352 (9)
abstracting: (p35<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p121)
states: 61,917,364,224 (10)
abstracting: (p121<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p12)
states: 5,159,780,352 (9)
abstracting: (p12<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p47)
states: 5,159,780,352 (9)
abstracting: (p47<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p121)
states: 61,917,364,224 (10)
abstracting: (p121<=1)
states: 61,917,364,225 (10)
abstracting: (0<=p31)
states: 61,917,364,225 (10)
abstracting: (p31<=0)
states: 56,757,583,873 (10)
abstracting: (0<=p122)
states: 61,917,364,225 (10)
abstracting: (p122<=0)
states: 1
.
EG iterations: 1
abstracting: (1<=p46)
states: 5,159,780,352 (9)
abstracting: (p46<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p40)
states: 5,159,780,352 (9)
abstracting: (p40<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p122)
states: 61,917,364,224 (10)
abstracting: (p122<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p8)
states: 5,159,780,352 (9)
abstracting: (p8<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p79)
states: 5,159,780,352 (9)
abstracting: (p79<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p122)
states: 61,917,364,224 (10)
abstracting: (p122<=1)
states: 61,917,364,225 (10)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m19.110sec

checking: EF [[E [AX [~ [[p36<=1 & 1<=p36]]] U [[[p12<=1 & 1<=p12] & [p23<=1 & 1<=p23]] & [[p121<=1 & 1<=p121] & [[[[[p32<=1 & 1<=p32] & [p48<=1 & 1<=p48]] & [[p95<=1 & 1<=p95] & [p121<=1 & 1<=p121]]] | [[p94<=1 & 1<=p94] | [[p41<=1 & 1<=p41] & [p122<=1 & 1<=p122]]]] & EX [[p75<=1 & 1<=p75]]]]]] & A [A [~ [[[[p24<=1 & 1<=p24] & [[p107<=1 & 1<=p107] & [p121<=1 & 1<=p121]]] | [[p29<=1 & 1<=p29] & [p122<=1 & 1<=p122]]]] U EX [[[p12<=1 & 1<=p12] & [[p35<=1 & 1<=p35] & [p121<=1 & 1<=p121]]]]] U A [[p92<=1 & 1<=p92] U ~ [AF [[[p47<=1 & 1<=p47] & [[p96<=1 & 1<=p96] & [p121<=1 & 1<=p121]]]]]]]]]
normalized: E [true U [[~ [E [~ [[~ [EG [~ [EG [~ [[[[p121<=1 & 1<=p121] & [p96<=1 & 1<=p96]] & [p47<=1 & 1<=p47]]]]]]] & ~ [E [~ [EG [~ [[[[p121<=1 & 1<=p121] & [p96<=1 & 1<=p96]] & [p47<=1 & 1<=p47]]]]] U [~ [[p92<=1 & 1<=p92]] & ~ [EG [~ [[[[p121<=1 & 1<=p121] & [p96<=1 & 1<=p96]] & [p47<=1 & 1<=p47]]]]]]]]]] U [~ [[~ [EG [~ [EX [[[[p121<=1 & 1<=p121] & [p35<=1 & 1<=p35]] & [p12<=1 & 1<=p12]]]]]] & ~ [E [~ [EX [[[[p121<=1 & 1<=p121] & [p35<=1 & 1<=p35]] & [p12<=1 & 1<=p12]]]] U [[[[p122<=1 & 1<=p122] & [p29<=1 & 1<=p29]] | [[[p121<=1 & 1<=p121] & [p107<=1 & 1<=p107]] & [p24<=1 & 1<=p24]]] & ~ [EX [[[[p121<=1 & 1<=p121] & [p35<=1 & 1<=p35]] & [p12<=1 & 1<=p12]]]]]]]]] & ~ [[~ [EG [~ [EG [~ [[[[p121<=1 & 1<=p121] & [p96<=1 & 1<=p96]] & [p47<=1 & 1<=p47]]]]]]] & ~ [E [~ [EG [~ [[[[p121<=1 & 1<=p121] & [p96<=1 & 1<=p96]] & [p47<=1 & 1<=p47]]]]] U [~ [[p92<=1 & 1<=p92]] & ~ [EG [~ [[[[p121<=1 & 1<=p121] & [p96<=1 & 1<=p96]] & [p47<=1 & 1<=p47]]]]]]]]]]]]] & ~ [EG [~ [[~ [EG [~ [EG [~ [[[[p121<=1 & 1<=p121] & [p96<=1 & 1<=p96]] & [p47<=1 & 1<=p47]]]]]]] & ~ [E [~ [EG [~ [[[[p121<=1 & 1<=p121] & [p96<=1 & 1<=p96]] & [p47<=1 & 1<=p47]]]]] U [~ [[p92<=1 & 1<=p92]] & ~ [EG [~ [[[[p121<=1 & 1<=p121] & [p96<=1 & 1<=p96]] & [p47<=1 & 1<=p47]]]]]]]]]]]]] & E [~ [EX [[p36<=1 & 1<=p36]]] U [[[EX [[p75<=1 & 1<=p75]] & [[[[p122<=1 & 1<=p122] & [p41<=1 & 1<=p41]] | [p94<=1 & 1<=p94]] | [[[p121<=1 & 1<=p121] & [p95<=1 & 1<=p95]] & [[p48<=1 & 1<=p48] & [p32<=1 & 1<=p32]]]]] & [p121<=1 & 1<=p121]] & [[p23<=1 & 1<=p23] & [p12<=1 & 1<=p12]]]]]]

abstracting: (1<=p12)
states: 5,159,780,352 (9)
abstracting: (p12<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p23)
states: 5,159,780,352 (9)
abstracting: (p23<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p121)
states: 61,917,364,224 (10)
abstracting: (p121<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p32)
states: 5,159,780,352 (9)
abstracting: (p32<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p48)
states: 5,159,780,352 (9)
abstracting: (p48<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p95)
states: 5,159,780,352 (9)
abstracting: (p95<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p121)
states: 61,917,364,224 (10)
abstracting: (p121<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p94)
states: 5,159,780,352 (9)
abstracting: (p94<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p41)
states: 5,159,780,352 (9)
abstracting: (p41<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p122)
states: 61,917,364,224 (10)
abstracting: (p122<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p75)
states: 5,159,780,352 (9)
abstracting: (p75<=1)
states: 61,917,364,225 (10)
.abstracting: (1<=p36)
states: 5,159,780,352 (9)
abstracting: (p36<=1)
states: 61,917,364,225 (10)
.abstracting: (1<=p47)
states: 5,159,780,352 (9)
abstracting: (p47<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p96)
states: 5,159,780,352 (9)
abstracting: (p96<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p121)
states: 61,917,364,224 (10)
abstracting: (p121<=1)
states: 61,917,364,225 (10)
.
EG iterations: 1
abstracting: (1<=p92)
states: 5,159,780,352 (9)
abstracting: (p92<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p47)
states: 5,159,780,352 (9)
abstracting: (p47<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p96)
states: 5,159,780,352 (9)
abstracting: (p96<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p121)
states: 61,917,364,224 (10)
abstracting: (p121<=1)
states: 61,917,364,225 (10)
.
EG iterations: 1
abstracting: (1<=p47)
states: 5,159,780,352 (9)
abstracting: (p47<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p96)
states: 5,159,780,352 (9)
abstracting: (p96<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p121)
states: 61,917,364,224 (10)
abstracting: (p121<=1)
states: 61,917,364,225 (10)
.
EG iterations: 1
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p47)
states: 5,159,780,352 (9)
abstracting: (p47<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p96)
states: 5,159,780,352 (9)
abstracting: (p96<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p121)
states: 61,917,364,224 (10)
abstracting: (p121<=1)
states: 61,917,364,225 (10)
.
EG iterations: 1
abstracting: (1<=p92)
states: 5,159,780,352 (9)
abstracting: (p92<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p47)
states: 5,159,780,352 (9)
abstracting: (p47<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p96)
states: 5,159,780,352 (9)
abstracting: (p96<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p121)
states: 61,917,364,224 (10)
abstracting: (p121<=1)
states: 61,917,364,225 (10)
.
EG iterations: 1
abstracting: (1<=p47)
states: 5,159,780,352 (9)
abstracting: (p47<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p96)
states: 5,159,780,352 (9)
abstracting: (p96<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p121)
states: 61,917,364,224 (10)
abstracting: (p121<=1)
states: 61,917,364,225 (10)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p12)
states: 5,159,780,352 (9)
abstracting: (p12<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p35)
states: 5,159,780,352 (9)
abstracting: (p35<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p121)
states: 61,917,364,224 (10)
abstracting: (p121<=1)
states: 61,917,364,225 (10)
.abstracting: (1<=p24)
states: 5,159,780,352 (9)
abstracting: (p24<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p107)
states: 5,159,780,352 (9)
abstracting: (p107<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p121)
states: 61,917,364,224 (10)
abstracting: (p121<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p29)
states: 5,159,780,352 (9)
abstracting: (p29<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p122)
states: 61,917,364,224 (10)
abstracting: (p122<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p12)
states: 5,159,780,352 (9)
abstracting: (p12<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p35)
states: 5,159,780,352 (9)
abstracting: (p35<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p121)
states: 61,917,364,224 (10)
abstracting: (p121<=1)
states: 61,917,364,225 (10)
.abstracting: (1<=p12)
states: 5,159,780,352 (9)
abstracting: (p12<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p35)
states: 5,159,780,352 (9)
abstracting: (p35<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p121)
states: 61,917,364,224 (10)
abstracting: (p121<=1)
states: 61,917,364,225 (10)
...
EG iterations: 2
abstracting: (1<=p47)
states: 5,159,780,352 (9)
abstracting: (p47<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p96)
states: 5,159,780,352 (9)
abstracting: (p96<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p121)
states: 61,917,364,224 (10)
abstracting: (p121<=1)
states: 61,917,364,225 (10)
.
EG iterations: 1
abstracting: (1<=p92)
states: 5,159,780,352 (9)
abstracting: (p92<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p47)
states: 5,159,780,352 (9)
abstracting: (p47<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p96)
states: 5,159,780,352 (9)
abstracting: (p96<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p121)
states: 61,917,364,224 (10)
abstracting: (p121<=1)
states: 61,917,364,225 (10)
.
EG iterations: 1
abstracting: (1<=p47)
states: 5,159,780,352 (9)
abstracting: (p47<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p96)
states: 5,159,780,352 (9)
abstracting: (p96<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p121)
states: 61,917,364,224 (10)
abstracting: (p121<=1)
states: 61,917,364,225 (10)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m26.771sec

checking: [EF [[[A [[[p105<=1 & 1<=p105] & [p122<=1 & 1<=p122]] U [p89<=1 & 1<=p89]] & [[p115<=1 & 1<=p115] & [p122<=1 & 1<=p122]]] & [[p23<=1 & 1<=p23] & [[p72<=1 & 1<=p72] & [p121<=1 & 1<=p121]]]]] & [EX [[EG [[p44<=0 & 0<=p44]] & [AF [[[p35<=0 & 0<=p35] | [[p108<=0 & 0<=p108] | [p121<=0 & 0<=p121]]]] & [p61<=0 & 0<=p61]]]] | [AG [[AG [[[[p11<=1 & 1<=p11] & [[p60<=1 & 1<=p60] & [p121<=1 & 1<=p121]]] | [[p23<=1 & 1<=p23] & [[p108<=1 & 1<=p108] & [p121<=1 & 1<=p121]]]]] | EG [[[[p7<=1 & 1<=p7] & [p122<=1 & 1<=p122]] & [[p69<=1 & 1<=p69] & [p122<=1 & 1<=p122]]]]]] & AF [[[p13<=0 & 0<=p13] | [AF [[p32<=0 & 0<=p32]] | EG [[p109<=0 & 0<=p109]]]]]]]]
normalized: [[EX [[[~ [EG [~ [[[[p121<=0 & 0<=p121] | [p108<=0 & 0<=p108]] | [p35<=0 & 0<=p35]]]]] & [p61<=0 & 0<=p61]] & EG [[p44<=0 & 0<=p44]]]] | [~ [EG [~ [[[EG [[p109<=0 & 0<=p109]] | ~ [EG [~ [[p32<=0 & 0<=p32]]]]] | [p13<=0 & 0<=p13]]]]] & ~ [E [true U ~ [[EG [[[[p122<=1 & 1<=p122] & [p69<=1 & 1<=p69]] & [[p122<=1 & 1<=p122] & [p7<=1 & 1<=p7]]]] | ~ [E [true U ~ [[[[[p121<=1 & 1<=p121] & [p108<=1 & 1<=p108]] & [p23<=1 & 1<=p23]] | [[[p121<=1 & 1<=p121] & [p60<=1 & 1<=p60]] & [p11<=1 & 1<=p11]]]]]]]]]]]] & E [true U [[[[p121<=1 & 1<=p121] & [p72<=1 & 1<=p72]] & [p23<=1 & 1<=p23]] & [[[p122<=1 & 1<=p122] & [p115<=1 & 1<=p115]] & [~ [EG [~ [[p89<=1 & 1<=p89]]]] & ~ [E [~ [[p89<=1 & 1<=p89]] U [~ [[[p122<=1 & 1<=p122] & [p105<=1 & 1<=p105]]] & ~ [[p89<=1 & 1<=p89]]]]]]]]]]

abstracting: (1<=p89)
states: 5,159,780,352 (9)
abstracting: (p89<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p105)
states: 5,159,780,352 (9)
abstracting: (p105<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p122)
states: 61,917,364,224 (10)
abstracting: (p122<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p89)
states: 5,159,780,352 (9)
abstracting: (p89<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p89)
states: 5,159,780,352 (9)
abstracting: (p89<=1)
states: 61,917,364,225 (10)
.
EG iterations: 1
abstracting: (1<=p115)
states: 5,159,780,352 (9)
abstracting: (p115<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p122)
states: 61,917,364,224 (10)
abstracting: (p122<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p23)
states: 5,159,780,352 (9)
abstracting: (p23<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p72)
states: 5,159,780,352 (9)
abstracting: (p72<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p121)
states: 61,917,364,224 (10)
abstracting: (p121<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p11)
states: 5,159,780,352 (9)
abstracting: (p11<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p60)
states: 5,159,780,352 (9)
abstracting: (p60<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p121)
states: 61,917,364,224 (10)
abstracting: (p121<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p23)
states: 5,159,780,352 (9)
abstracting: (p23<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p108)
states: 5,159,780,352 (9)
abstracting: (p108<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p121)
states: 61,917,364,224 (10)
abstracting: (p121<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p7)
states: 5,159,780,352 (9)
abstracting: (p7<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p122)
states: 61,917,364,224 (10)
abstracting: (p122<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p69)
states: 5,159,780,352 (9)
abstracting: (p69<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p122)
states: 61,917,364,224 (10)
abstracting: (p122<=1)
states: 61,917,364,225 (10)
.
EG iterations: 1
abstracting: (0<=p13)
states: 61,917,364,225 (10)
abstracting: (p13<=0)
states: 56,757,583,873 (10)
abstracting: (0<=p32)
states: 61,917,364,225 (10)
abstracting: (p32<=0)
states: 56,757,583,873 (10)
.
EG iterations: 1
abstracting: (0<=p109)
states: 61,917,364,225 (10)
abstracting: (p109<=0)
states: 56,757,583,873 (10)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (0<=p44)
states: 61,917,364,225 (10)
abstracting: (p44<=0)
states: 56,757,583,873 (10)
.
EG iterations: 1
abstracting: (0<=p61)
states: 61,917,364,225 (10)
abstracting: (p61<=0)
states: 56,757,583,873 (10)
abstracting: (0<=p35)
states: 61,917,364,225 (10)
abstracting: (p35<=0)
states: 56,757,583,873 (10)
abstracting: (0<=p108)
states: 61,917,364,225 (10)
abstracting: (p108<=0)
states: 56,757,583,873 (10)
abstracting: (0<=p121)
states: 61,917,364,225 (10)
abstracting: (p121<=0)
states: 1
.
EG iterations: 1
.-> the formula is TRUE

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

MC time: 0m15.938sec

checking: AG [[E [[AG [[[p24<=1 & 1<=p24] & [[p119<=1 & 1<=p119] & [p121<=1 & 1<=p121]]]] | [AF [[[p26<=1 & 1<=p26] & [p122<=1 & 1<=p122]]] | [p75<=1 & 1<=p75]]] U [[[p12<=1 & 1<=p12] & [[p59<=1 & 1<=p59] & [p121<=1 & 1<=p121]]] | [[[p47<=1 & 1<=p47] & [p108<=1 & 1<=p108]] & [[p121<=1 & 1<=p121] & AG [[p29<=1 & 1<=p29]]]]]] & [AX [A [[p119<=1 & 1<=p119] U [[p11<=1 & 1<=p11] & [[p96<=1 & 1<=p96] & [p121<=1 & 1<=p121]]]]] & [AX [[[p47<=0 & 0<=p47] | [[p60<=0 & 0<=p60] | [p121<=0 & 0<=p121]]]] | [EX [A [[[p71<=1 & 1<=p71] & [[p84<=1 & 1<=p84] & [p121<=1 & 1<=p121]]] U [p68<=1 & 1<=p68]]] | [E [EF [[p1<=1 & 1<=p1]] U ~ [[p60<=1 & 1<=p60]]] & [p36<=1 & 1<=p36]]]]]]]
normalized: ~ [E [true U ~ [[[~ [EX [~ [[~ [EG [~ [[[[p121<=1 & 1<=p121] & [p96<=1 & 1<=p96]] & [p11<=1 & 1<=p11]]]]] & ~ [E [~ [[[[p121<=1 & 1<=p121] & [p96<=1 & 1<=p96]] & [p11<=1 & 1<=p11]]] U [~ [[p119<=1 & 1<=p119]] & ~ [[[[p121<=1 & 1<=p121] & [p96<=1 & 1<=p96]] & [p11<=1 & 1<=p11]]]]]]]]]] & [[[[p36<=1 & 1<=p36] & E [E [true U [p1<=1 & 1<=p1]] U ~ [[p60<=1 & 1<=p60]]]] | EX [[~ [EG [~ [[p68<=1 & 1<=p68]]]] & ~ [E [~ [[p68<=1 & 1<=p68]] U [~ [[[[p121<=1 & 1<=p121] & [p84<=1 & 1<=p84]] & [p71<=1 & 1<=p71]]] & ~ [[p68<=1 & 1<=p68]]]]]]]] | ~ [EX [~ [[[[p121<=0 & 0<=p121] | [p60<=0 & 0<=p60]] | [p47<=0 & 0<=p47]]]]]]] & E [[[[p75<=1 & 1<=p75] | ~ [EG [~ [[[p122<=1 & 1<=p122] & [p26<=1 & 1<=p26]]]]]] | ~ [E [true U ~ [[[[p121<=1 & 1<=p121] & [p119<=1 & 1<=p119]] & [p24<=1 & 1<=p24]]]]]] U [[[~ [E [true U ~ [[p29<=1 & 1<=p29]]]] & [p121<=1 & 1<=p121]] & [[p108<=1 & 1<=p108] & [p47<=1 & 1<=p47]]] | [[[p121<=1 & 1<=p121] & [p59<=1 & 1<=p59]] & [p12<=1 & 1<=p12]]]]]]]]

abstracting: (1<=p12)
states: 5,159,780,352 (9)
abstracting: (p12<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p59)
states: 5,159,780,352 (9)
abstracting: (p59<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p121)
states: 61,917,364,224 (10)
abstracting: (p121<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p47)
states: 5,159,780,352 (9)
abstracting: (p47<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p108)
states: 5,159,780,352 (9)
abstracting: (p108<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p121)
states: 61,917,364,224 (10)
abstracting: (p121<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p29)
states: 5,159,780,352 (9)
abstracting: (p29<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p24)
states: 5,159,780,352 (9)
abstracting: (p24<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p119)
states: 5,159,780,352 (9)
abstracting: (p119<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p121)
states: 61,917,364,224 (10)
abstracting: (p121<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p26)
states: 5,159,780,352 (9)
abstracting: (p26<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p122)
states: 61,917,364,224 (10)
abstracting: (p122<=1)
states: 61,917,364,225 (10)
.
EG iterations: 1
abstracting: (1<=p75)
states: 5,159,780,352 (9)
abstracting: (p75<=1)
states: 61,917,364,225 (10)
abstracting: (0<=p47)
states: 61,917,364,225 (10)
abstracting: (p47<=0)
states: 56,757,583,873 (10)
abstracting: (0<=p60)
states: 61,917,364,225 (10)
abstracting: (p60<=0)
states: 56,757,583,873 (10)
abstracting: (0<=p121)
states: 61,917,364,225 (10)
abstracting: (p121<=0)
states: 1
.abstracting: (1<=p68)
states: 5,159,780,352 (9)
abstracting: (p68<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p71)
states: 5,159,780,352 (9)
abstracting: (p71<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p84)
states: 5,159,780,352 (9)
abstracting: (p84<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p121)
states: 61,917,364,224 (10)
abstracting: (p121<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p68)
states: 5,159,780,352 (9)
abstracting: (p68<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p68)
states: 5,159,780,352 (9)
abstracting: (p68<=1)
states: 61,917,364,225 (10)
.
EG iterations: 1
.abstracting: (1<=p60)
states: 5,159,780,352 (9)
abstracting: (p60<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p1)
states: 5,159,780,352 (9)
abstracting: (p1<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p36)
states: 5,159,780,352 (9)
abstracting: (p36<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p11)
states: 5,159,780,352 (9)
abstracting: (p11<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p96)
states: 5,159,780,352 (9)
abstracting: (p96<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p121)
states: 61,917,364,224 (10)
abstracting: (p121<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p119)
states: 5,159,780,352 (9)
abstracting: (p119<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p11)
states: 5,159,780,352 (9)
abstracting: (p11<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p96)
states: 5,159,780,352 (9)
abstracting: (p96<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p121)
states: 61,917,364,224 (10)
abstracting: (p121<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p11)
states: 5,159,780,352 (9)
abstracting: (p11<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p96)
states: 5,159,780,352 (9)
abstracting: (p96<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p121)
states: 61,917,364,224 (10)
abstracting: (p121<=1)
states: 61,917,364,225 (10)
.
EG iterations: 1
.-> the formula is FALSE

FORMULA FlexibleBarrier-PT-10a-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m15.746sec

checking: E [AF [[E [[[p67<=1 & 1<=p67] & [p122<=1 & 1<=p122]] U [E [[p104<=1 & 1<=p104] U [p49<=1 & 1<=p49]] | AF [[p120<=1 & 1<=p120]]]] | [AG [[p17<=1 & 1<=p17]] & [~ [AF [[[p84<=1 & 1<=p84] & [[p119<=1 & 1<=p119] & [p121<=1 & 1<=p121]]]]] | [[p72<=1 & 1<=p72] & [[p107<=1 & 1<=p107] & [p121<=1 & 1<=p121]]]]]]] U AX [[EG [E [[p44<=1 & 1<=p44] U [p73<=1 & 1<=p73]]] | [~ [[~ [[[p11<=1 & 1<=p11] & [[p36<=1 & 1<=p36] & [p121<=1 & 1<=p121]]]] | [[[p15<=1 & 1<=p15] & [p24<=1 & 1<=p24]] & [[p83<=1 & 1<=p83] & [p121<=1 & 1<=p121]]]]] & [A [[[p72<=1 & 1<=p72] & [[p83<=1 & 1<=p83] & [p121<=1 & 1<=p121]]] U [[p9<=1 & 1<=p9] & [p122<=1 & 1<=p122]]] | [[p40<=1 & 1<=p40] & [[p122<=1 & 1<=p122] & [[p77<=1 & 1<=p77] | [[p11<=1 & 1<=p11] & [[p96<=1 & 1<=p96] & [p121<=1 & 1<=p121]]]]]]]]]]]
normalized: E [~ [EG [~ [[[[[[[p121<=1 & 1<=p121] & [p107<=1 & 1<=p107]] & [p72<=1 & 1<=p72]] | EG [~ [[[[p121<=1 & 1<=p121] & [p119<=1 & 1<=p119]] & [p84<=1 & 1<=p84]]]]] & ~ [E [true U ~ [[p17<=1 & 1<=p17]]]]] | E [[[p122<=1 & 1<=p122] & [p67<=1 & 1<=p67]] U [~ [EG [~ [[p120<=1 & 1<=p120]]]] | E [[p104<=1 & 1<=p104] U [p49<=1 & 1<=p49]]]]]]]] U ~ [EX [~ [[[[[[[[[[p121<=1 & 1<=p121] & [p96<=1 & 1<=p96]] & [p11<=1 & 1<=p11]] | [p77<=1 & 1<=p77]] & [p122<=1 & 1<=p122]] & [p40<=1 & 1<=p40]] | [~ [EG [~ [[[p122<=1 & 1<=p122] & [p9<=1 & 1<=p9]]]]] & ~ [E [~ [[[p122<=1 & 1<=p122] & [p9<=1 & 1<=p9]]] U [~ [[[[p121<=1 & 1<=p121] & [p83<=1 & 1<=p83]] & [p72<=1 & 1<=p72]]] & ~ [[[p122<=1 & 1<=p122] & [p9<=1 & 1<=p9]]]]]]]] & ~ [[[[[p121<=1 & 1<=p121] & [p83<=1 & 1<=p83]] & [[p24<=1 & 1<=p24] & [p15<=1 & 1<=p15]]] | ~ [[[[p121<=1 & 1<=p121] & [p36<=1 & 1<=p36]] & [p11<=1 & 1<=p11]]]]]] | EG [E [[p44<=1 & 1<=p44] U [p73<=1 & 1<=p73]]]]]]]]

abstracting: (1<=p73)
states: 5,159,780,352 (9)
abstracting: (p73<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p44)
states: 5,159,780,352 (9)
abstracting: (p44<=1)
states: 61,917,364,225 (10)
.
EG iterations: 1
abstracting: (1<=p11)
states: 5,159,780,352 (9)
abstracting: (p11<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p36)
states: 5,159,780,352 (9)
abstracting: (p36<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p121)
states: 61,917,364,224 (10)
abstracting: (p121<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p15)
states: 5,159,780,352 (9)
abstracting: (p15<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p24)
states: 5,159,780,352 (9)
abstracting: (p24<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p83)
states: 5,159,780,352 (9)
abstracting: (p83<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p121)
states: 61,917,364,224 (10)
abstracting: (p121<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p9)
states: 5,159,780,352 (9)
abstracting: (p9<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p122)
states: 61,917,364,224 (10)
abstracting: (p122<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p72)
states: 5,159,780,352 (9)
abstracting: (p72<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p83)
states: 5,159,780,352 (9)
abstracting: (p83<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p121)
states: 61,917,364,224 (10)
abstracting: (p121<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p9)
states: 5,159,780,352 (9)
abstracting: (p9<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p122)
states: 61,917,364,224 (10)
abstracting: (p122<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p9)
states: 5,159,780,352 (9)
abstracting: (p9<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p122)
states: 61,917,364,224 (10)
abstracting: (p122<=1)
states: 61,917,364,225 (10)
.
EG iterations: 1
abstracting: (1<=p40)
states: 5,159,780,352 (9)
abstracting: (p40<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p122)
states: 61,917,364,224 (10)
abstracting: (p122<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p77)
states: 5,159,780,352 (9)
abstracting: (p77<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p11)
states: 5,159,780,352 (9)
abstracting: (p11<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p96)
states: 5,159,780,352 (9)
abstracting: (p96<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p121)
states: 61,917,364,224 (10)
abstracting: (p121<=1)
states: 61,917,364,225 (10)
.abstracting: (1<=p49)
states: 5,159,780,352 (9)
abstracting: (p49<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p104)
states: 5,159,780,352 (9)
abstracting: (p104<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p120)
states: 5,159,780,352 (9)
abstracting: (p120<=1)
states: 61,917,364,225 (10)
..
EG iterations: 2
abstracting: (1<=p67)
states: 5,159,780,352 (9)
abstracting: (p67<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p122)
states: 61,917,364,224 (10)
abstracting: (p122<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p17)
states: 5,159,780,352 (9)
abstracting: (p17<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p84)
states: 5,159,780,352 (9)
abstracting: (p84<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p119)
states: 5,159,780,352 (9)
abstracting: (p119<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p121)
states: 61,917,364,224 (10)
abstracting: (p121<=1)
states: 61,917,364,225 (10)
.
EG iterations: 1
abstracting: (1<=p72)
states: 5,159,780,352 (9)
abstracting: (p72<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p107)
states: 5,159,780,352 (9)
abstracting: (p107<=1)
states: 61,917,364,225 (10)
abstracting: (1<=p121)
states: 61,917,364,224 (10)
abstracting: (p121<=1)
states: 61,917,364,225 (10)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m37.250sec

totally nodes used: 31694609 (3.2e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 195220347 430102165 625322512
used/not used/entry size/cache size: 66957576 151288 16 1024MB
basic ops cache: hits/miss/sum: 8593635 18249280 26842915
used/not used/entry size/cache size: 13231466 3545750 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: 592298 1272922 1865220
used/not used/entry size/cache size: 1182022 7206586 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 42839260
1 18253967
2 4829231
3 993314
4 166540
5 23561
6 2699
7 258
8 33
9 1
>= 10 0

Total processing time: 2m46.031sec


BK_STOP 1678556077649

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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:8665 (35), effective:210 (0)

initing FirstDep: 0m 0.000sec


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

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

iterations count:2351 (9), effective:34 (0)

iterations count:2107 (8), effective:34 (0)

iterations count:1955 (8), effective:35 (0)

iterations count:608 (2), effective:11 (0)

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

iterations count:663 (2), effective:11 (0)

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

iterations count:2387 (9), effective:34 (0)

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

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

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

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

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

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

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

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

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

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

iterations count:1802 (7), effective:33 (0)

iterations count:1195 (4), effective:22 (0)

iterations count:1973 (8), effective:41 (0)

iterations count:5026 (20), effective:105 (0)

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

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

iterations count:3093 (12), effective:55 (0)

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

iterations count:1021 (4), effective:15 (0)

iterations count:3753 (15), effective:74 (0)

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

iterations count:3672 (15), effective:67 (0)

iterations count:491 (2), effective:2 (0)

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

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

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

iterations count:1897 (7), effective:33 (0)

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

iterations count:1404 (5), effective:23 (0)

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

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

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

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

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

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

iterations count:987 (4), effective:17 (0)

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

iterations count:9848 (40), effective:217 (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-10a"
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-10a, 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-167838857300490"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-10a.tgz
mv FlexibleBarrier-PT-10a 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 ;