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.r202-smll-167840348800514.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 HouseConstruction-PT-00002, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r202-smll-167840348800514
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 6.5K Feb 25 13:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 25 13:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 13:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 13:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 13:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 13:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Feb 25 13:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Feb 25 13:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 13K 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 HouseConstruction-PT-00002-CTLFireability-00
FORMULA_NAME HouseConstruction-PT-00002-CTLFireability-01
FORMULA_NAME HouseConstruction-PT-00002-CTLFireability-02
FORMULA_NAME HouseConstruction-PT-00002-CTLFireability-03
FORMULA_NAME HouseConstruction-PT-00002-CTLFireability-04
FORMULA_NAME HouseConstruction-PT-00002-CTLFireability-05
FORMULA_NAME HouseConstruction-PT-00002-CTLFireability-06
FORMULA_NAME HouseConstruction-PT-00002-CTLFireability-07
FORMULA_NAME HouseConstruction-PT-00002-CTLFireability-08
FORMULA_NAME HouseConstruction-PT-00002-CTLFireability-09
FORMULA_NAME HouseConstruction-PT-00002-CTLFireability-10
FORMULA_NAME HouseConstruction-PT-00002-CTLFireability-11
FORMULA_NAME HouseConstruction-PT-00002-CTLFireability-12
FORMULA_NAME HouseConstruction-PT-00002-CTLFireability-13
FORMULA_NAME HouseConstruction-PT-00002-CTLFireability-14
FORMULA_NAME HouseConstruction-PT-00002-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678845902928

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=HouseConstruction-PT-00002
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-15 02:05:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-15 02:05:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 02:05:06] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2023-03-15 02:05:06] [INFO ] Transformed 26 places.
[2023-03-15 02:05:06] [INFO ] Transformed 18 transitions.
[2023-03-15 02:05:06] [INFO ] Parsed PT model containing 26 places and 18 transitions and 51 arcs in 194 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 23 ms.
Initial state reduction rules removed 2 formulas.
FORMULA HouseConstruction-PT-00002-CTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-00002-CTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Applied a total of 0 rules in 20 ms. Remains 26 /26 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 26 cols
[2023-03-15 02:05:06] [INFO ] Computed 8 place invariants in 8 ms
[2023-03-15 02:05:07] [INFO ] Implicit Places using invariants in 252 ms returned []
[2023-03-15 02:05:07] [INFO ] Invariant cache hit.
[2023-03-15 02:05:07] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
[2023-03-15 02:05:07] [INFO ] Invariant cache hit.
[2023-03-15 02:05:07] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 503 ms. Remains : 26/26 places, 18/18 transitions.
Support contains 26 out of 26 places after structural reductions.
[2023-03-15 02:05:07] [INFO ] Flatten gal took : 33 ms
[2023-03-15 02:05:07] [INFO ] Flatten gal took : 12 ms
[2023-03-15 02:05:07] [INFO ] Input system was already deterministic with 18 transitions.
Finished random walk after 2084 steps, including 38 resets, run visited all 32 properties in 112 ms. (steps per millisecond=18 )
[2023-03-15 02:05:07] [INFO ] Flatten gal took : 6 ms
[2023-03-15 02:05:07] [INFO ] Flatten gal took : 8 ms
[2023-03-15 02:05:07] [INFO ] Input system was already deterministic with 18 transitions.
Computed a total of 26 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 26 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 2 formulas.
FORMULA HouseConstruction-PT-00002-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-00002-CTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in SI_CTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 17
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 24 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 23 transition count 16
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 4 place count 23 transition count 15
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6 place count 22 transition count 15
Applied a total of 6 rules in 14 ms. Remains 22 /26 variables (removed 4) and now considering 15/18 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 22/26 places, 15/18 transitions.
[2023-03-15 02:05:07] [INFO ] Flatten gal took : 3 ms
[2023-03-15 02:05:07] [INFO ] Flatten gal took : 4 ms
[2023-03-15 02:05:07] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 26/26 places, 18/18 transitions.
[2023-03-15 02:05:07] [INFO ] Flatten gal took : 4 ms
[2023-03-15 02:05:07] [INFO ] Flatten gal took : 4 ms
[2023-03-15 02:05:07] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 24 transition count 17
Applied a total of 2 rules in 5 ms. Remains 24 /26 variables (removed 2) and now considering 17/18 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 24/26 places, 17/18 transitions.
[2023-03-15 02:05:07] [INFO ] Flatten gal took : 4 ms
[2023-03-15 02:05:07] [INFO ] Flatten gal took : 4 ms
[2023-03-15 02:05:07] [INFO ] Input system was already deterministic with 17 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Graph (complete) has 31 edges and 26 vertex of which 4 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.2 ms
Discarding 22 places :
Also discarding 14 output transitions
Drop transitions removed 14 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 2 transition count 2
Applied a total of 3 rules in 6 ms. Remains 2 /26 variables (removed 24) and now considering 2/18 (removed 16) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 2/26 places, 2/18 transitions.
[2023-03-15 02:05:07] [INFO ] Flatten gal took : 1 ms
[2023-03-15 02:05:07] [INFO ] Flatten gal took : 1 ms
[2023-03-15 02:05:07] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 2 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 25/26 places, 18/18 transitions.
[2023-03-15 02:05:07] [INFO ] Flatten gal took : 3 ms
[2023-03-15 02:05:07] [INFO ] Flatten gal took : 3 ms
[2023-03-15 02:05:08] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Graph (complete) has 31 edges and 26 vertex of which 13 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.0 ms
Discarding 13 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 2 ms. Remains 12 /26 variables (removed 14) and now considering 9/18 (removed 9) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 12/26 places, 9/18 transitions.
[2023-03-15 02:05:08] [INFO ] Flatten gal took : 1 ms
[2023-03-15 02:05:08] [INFO ] Flatten gal took : 2 ms
[2023-03-15 02:05:08] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 1 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 25/26 places, 18/18 transitions.
[2023-03-15 02:05:08] [INFO ] Flatten gal took : 3 ms
[2023-03-15 02:05:08] [INFO ] Flatten gal took : 3 ms
[2023-03-15 02:05:08] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 26/26 places, 18/18 transitions.
[2023-03-15 02:05:08] [INFO ] Flatten gal took : 2 ms
[2023-03-15 02:05:08] [INFO ] Flatten gal took : 2 ms
[2023-03-15 02:05:08] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 26 /26 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 26/26 places, 18/18 transitions.
[2023-03-15 02:05:08] [INFO ] Flatten gal took : 2 ms
[2023-03-15 02:05:08] [INFO ] Flatten gal took : 2 ms
[2023-03-15 02:05:08] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Graph (complete) has 31 edges and 26 vertex of which 7 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.0 ms
Discarding 19 places :
Also discarding 12 output transitions
Drop transitions removed 12 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 6 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 5 transition count 4
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 4 transition count 3
Applied a total of 4 rules in 7 ms. Remains 4 /26 variables (removed 22) and now considering 3/18 (removed 15) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 4/26 places, 3/18 transitions.
[2023-03-15 02:05:08] [INFO ] Flatten gal took : 1 ms
[2023-03-15 02:05:08] [INFO ] Flatten gal took : 1 ms
[2023-03-15 02:05:08] [INFO ] Input system was already deterministic with 3 transitions.
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
FORMULA HouseConstruction-PT-00002-CTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Graph (complete) has 31 edges and 26 vertex of which 17 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 17 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 16 transition count 12
Applied a total of 3 rules in 3 ms. Remains 16 /26 variables (removed 10) and now considering 12/18 (removed 6) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 16/26 places, 12/18 transitions.
[2023-03-15 02:05:08] [INFO ] Flatten gal took : 1 ms
[2023-03-15 02:05:08] [INFO ] Flatten gal took : 1 ms
[2023-03-15 02:05:08] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Graph (complete) has 31 edges and 26 vertex of which 6 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Discarding 20 places :
Also discarding 12 output transitions
Drop transitions removed 12 transitions
Applied a total of 1 rules in 1 ms. Remains 6 /26 variables (removed 20) and now considering 6/18 (removed 12) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 6/26 places, 6/18 transitions.
[2023-03-15 02:05:08] [INFO ] Flatten gal took : 0 ms
[2023-03-15 02:05:08] [INFO ] Flatten gal took : 1 ms
[2023-03-15 02:05:08] [INFO ] Input system was already deterministic with 6 transitions.
[2023-03-15 02:05:08] [INFO ] Flatten gal took : 4 ms
[2023-03-15 02:05:08] [INFO ] Flatten gal took : 4 ms
[2023-03-15 02:05:08] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-15 02:05:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 26 places, 18 transitions and 51 arcs took 0 ms.
Total runtime 1768 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 26 NrTr: 18 NrArc: 51)

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

net check time: 0m 0.000sec

init dd package: 0m 3.406sec


RS generation: 0m 0.002sec


-> reachability set: #nodes 549 (5.5e+02) #states 1,501 (3)



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

checking: EG [AG [AF [p4<=0]]]
normalized: EG [~ [E [true U EG [~ [p4<=0]]]]]

abstracting: (p4<=0)
states: 1,375 (3)
.....................
EG iterations: 21

EG iterations: 0
-> the formula is TRUE

FORMULA HouseConstruction-PT-00002-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: EX [EG [AX [~ [E [[1<=p16 & 1<=p17] U 1<=p25]]]]]
normalized: EX [EG [~ [EX [E [[1<=p16 & 1<=p17] U 1<=p25]]]]]

abstracting: (1<=p25)
states: 446
abstracting: (1<=p17)
states: 375
abstracting: (1<=p16)
states: 375
...................
EG iterations: 18
.-> the formula is FALSE

FORMULA HouseConstruction-PT-00002-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.016sec

checking: A [E [1<=p1 U ~ [EF [1<=p6]]] U 1<=p5]
normalized: [~ [EG [~ [1<=p5]]] & ~ [E [~ [1<=p5] U [~ [E [1<=p1 U ~ [E [true U 1<=p6]]]] & ~ [1<=p5]]]]]

abstracting: (1<=p5)
states: 266
abstracting: (1<=p6)
states: 446
abstracting: (1<=p1)
states: 66
abstracting: (1<=p5)
states: 266
abstracting: (1<=p5)
states: 266
..................
EG iterations: 18
-> the formula is FALSE

FORMULA HouseConstruction-PT-00002-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.015sec

checking: EX [A [[p2<=0 & 1<=p6] U AF [[[EX [[1<=p10 & 1<=p11]] & 1<=p9] & [1<=p12 & 1<=p13]]]]]
normalized: EX [[~ [EG [EG [~ [[[1<=p12 & 1<=p13] & [EX [[1<=p10 & 1<=p11]] & 1<=p9]]]]]] & ~ [E [EG [~ [[[1<=p12 & 1<=p13] & [EX [[1<=p10 & 1<=p11]] & 1<=p9]]]] U [~ [[p2<=0 & 1<=p6]] & EG [~ [[[1<=p12 & 1<=p13] & [EX [[1<=p10 & 1<=p11]] & 1<=p9]]]]]]]]]

abstracting: (1<=p9)
states: 580
abstracting: (1<=p11)
states: 266
abstracting: (1<=p10)
states: 400
.abstracting: (1<=p13)
states: 456
abstracting: (1<=p12)
states: 210
............
EG iterations: 12
abstracting: (1<=p6)
states: 446
abstracting: (p2<=0)
states: 1,435 (3)
abstracting: (1<=p9)
states: 580
abstracting: (1<=p11)
states: 266
abstracting: (1<=p10)
states: 400
.abstracting: (1<=p13)
states: 456
abstracting: (1<=p12)
states: 210
............
EG iterations: 12
abstracting: (1<=p9)
states: 580
abstracting: (1<=p11)
states: 266
abstracting: (1<=p10)
states: 400
.abstracting: (1<=p13)
states: 456
abstracting: (1<=p12)
states: 210
............
EG iterations: 12
.
EG iterations: 1
.-> the formula is FALSE

FORMULA HouseConstruction-PT-00002-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

checking: AF [[AG [1<=p5] | AF [[[p2<=0 & [[1<=p18 & 1<=p14] | E [1<=p18 U 1<=p2]]] & [1<=p9 & [1<=p12 & 1<=p13]]]]]]
normalized: ~ [EG [~ [[~ [EG [~ [[[[1<=p12 & 1<=p13] & 1<=p9] & [[E [1<=p18 U 1<=p2] | [1<=p18 & 1<=p14]] & p2<=0]]]]] | ~ [E [true U ~ [1<=p5]]]]]]]

abstracting: (1<=p5)
states: 266
abstracting: (p2<=0)
states: 1,435 (3)
abstracting: (1<=p14)
states: 210
abstracting: (1<=p18)
states: 540
abstracting: (1<=p2)
states: 66
abstracting: (1<=p18)
states: 540
abstracting: (1<=p9)
states: 580
abstracting: (1<=p13)
states: 456
abstracting: (1<=p12)
states: 210

EG iterations: 0

EG iterations: 0
-> the formula is FALSE

FORMULA HouseConstruction-PT-00002-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: A [AF [[EG [1<=p6] & [E [EF [[1<=p3 & 1<=p7]] U [1<=p10 & 1<=p11]] | AG [p5<=0]]]] U EG [E [[AF [1<=p18] & [EF [1<=p14] | A [1<=p1 U 1<=p5]]] U A [1<=p0 U [1<=p4 | 1<=p2]]]]]
normalized: [~ [EG [~ [EG [E [[[[~ [EG [~ [1<=p5]]] & ~ [E [~ [1<=p5] U [~ [1<=p1] & ~ [1<=p5]]]]] | E [true U 1<=p14]] & ~ [EG [~ [1<=p18]]]] U [~ [EG [~ [[1<=p4 | 1<=p2]]]] & ~ [E [~ [[1<=p4 | 1<=p2]] U [~ [1<=p0] & ~ [[1<=p4 | 1<=p2]]]]]]]]]]] & ~ [E [~ [EG [E [[[[~ [EG [~ [1<=p5]]] & ~ [E [~ [1<=p5] U [~ [1<=p1] & ~ [1<=p5]]]]] | E [true U 1<=p14]] & ~ [EG [~ [1<=p18]]]] U [~ [EG [~ [[1<=p4 | 1<=p2]]]] & ~ [E [~ [[1<=p4 | 1<=p2]] U [~ [1<=p0] & ~ [[1<=p4 | 1<=p2]]]]]]]]] U [EG [~ [[[~ [E [true U ~ [p5<=0]]] | E [E [true U [1<=p3 & 1<=p7]] U [1<=p10 & 1<=p11]]] & EG [1<=p6]]]] & ~ [EG [E [[[[~ [EG [~ [1<=p5]]] & ~ [E [~ [1<=p5] U [~ [1<=p1] & ~ [1<=p5]]]]] | E [true U 1<=p14]] & ~ [EG [~ [1<=p18]]]] U [~ [EG [~ [[1<=p4 | 1<=p2]]]] & ~ [E [~ [[1<=p4 | 1<=p2]] U [~ [1<=p0] & ~ [[1<=p4 | 1<=p2]]]]]]]]]]]]]

abstracting: (1<=p2)
states: 66
abstracting: (1<=p4)
states: 126
abstracting: (1<=p0)
states: 66
abstracting: (1<=p2)
states: 66
abstracting: (1<=p4)
states: 126
abstracting: (1<=p2)
states: 66
abstracting: (1<=p4)
states: 126
.................
EG iterations: 17
abstracting: (1<=p18)
states: 540
..........................
EG iterations: 26
abstracting: (1<=p14)
states: 210
abstracting: (1<=p5)
states: 266
abstracting: (1<=p1)
states: 66
abstracting: (1<=p5)
states: 266
abstracting: (1<=p5)
states: 266
..................
EG iterations: 18
........................
EG iterations: 24
abstracting: (1<=p6)
states: 446
.............................
EG iterations: 29
abstracting: (1<=p11)
states: 266
abstracting: (1<=p10)
states: 400
abstracting: (1<=p7)
states: 446
abstracting: (1<=p3)
states: 1,170 (3)
abstracting: (p5<=0)
states: 1,235 (3)

EG iterations: 0
abstracting: (1<=p2)
states: 66
abstracting: (1<=p4)
states: 126
abstracting: (1<=p0)
states: 66
abstracting: (1<=p2)
states: 66
abstracting: (1<=p4)
states: 126
abstracting: (1<=p2)
states: 66
abstracting: (1<=p4)
states: 126
.................
EG iterations: 17
abstracting: (1<=p18)
states: 540
..........................
EG iterations: 26
abstracting: (1<=p14)
states: 210
abstracting: (1<=p5)
states: 266
abstracting: (1<=p1)
states: 66
abstracting: (1<=p5)
states: 266
abstracting: (1<=p5)
states: 266
..................
EG iterations: 18
........................
EG iterations: 24
abstracting: (1<=p2)
states: 66
abstracting: (1<=p4)
states: 126
abstracting: (1<=p0)
states: 66
abstracting: (1<=p2)
states: 66
abstracting: (1<=p4)
states: 126
abstracting: (1<=p2)
states: 66
abstracting: (1<=p4)
states: 126
.................
EG iterations: 17
abstracting: (1<=p18)
states: 540
..........................
EG iterations: 26
abstracting: (1<=p14)
states: 210
abstracting: (1<=p5)
states: 266
abstracting: (1<=p1)
states: 66
abstracting: (1<=p5)
states: 266
abstracting: (1<=p5)
states: 266
..................
EG iterations: 18
........................
EG iterations: 24

EG iterations: 0
-> the formula is FALSE

FORMULA HouseConstruction-PT-00002-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.055sec

checking: AF [[[~ [A [[1<=p6 | [[1<=p9 & [1<=p12 & 1<=p13]] | EG [1<=p1]]] U 1<=p19]] & EG [[[p19<=0 & p2<=0] | [p18<=0 | p8<=0]]]] | [AF [[p3<=0 | p7<=0]] & AG [[1<=p20 & [1<=p21 & 1<=p24]]]]]]
normalized: ~ [EG [~ [[[~ [E [true U ~ [[[1<=p21 & 1<=p24] & 1<=p20]]]] & ~ [EG [~ [[p3<=0 | p7<=0]]]]] | [EG [[[p18<=0 | p8<=0] | [p19<=0 & p2<=0]]] & ~ [[~ [EG [~ [1<=p19]]] & ~ [E [~ [1<=p19] U [~ [[[EG [1<=p1] | [[1<=p12 & 1<=p13] & 1<=p9]] | 1<=p6]] & ~ [1<=p19]]]]]]]]]]]

abstracting: (1<=p19)
states: 375
abstracting: (1<=p6)
states: 446
abstracting: (1<=p9)
states: 580
abstracting: (1<=p13)
states: 456
abstracting: (1<=p12)
states: 210
abstracting: (1<=p1)
states: 66
....................
EG iterations: 20
abstracting: (1<=p19)
states: 375
abstracting: (1<=p19)
states: 375
..............................
EG iterations: 30
abstracting: (p2<=0)
states: 1,435 (3)
abstracting: (p19<=0)
states: 1,126 (3)
abstracting: (p8<=0)
states: 1,055 (3)
abstracting: (p18<=0)
states: 961
.
EG iterations: 1
abstracting: (p7<=0)
states: 1,055 (3)
abstracting: (p3<=0)
states: 331
.............................
EG iterations: 29
abstracting: (1<=p20)
states: 555
abstracting: (1<=p24)
states: 446
abstracting: (1<=p21)
states: 210
.........................
EG iterations: 25
-> the formula is TRUE

FORMULA HouseConstruction-PT-00002-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.037sec

checking: AX [[[1<=p20 & [1<=p21 & 1<=p24]] | [1<=p8 & [[EF [[1<=p10 & 1<=p11]] | [AG [1<=p5] | 1<=p19]] & [[AF [1<=p4] & [E [[1<=p10 & 1<=p11] U 1<=p8] | AF [1<=p18]]] | [1<=p20 & [1<=p21 & 1<=p24]]]]]]]
normalized: ~ [EX [~ [[[1<=p8 & [[[1<=p20 & [1<=p21 & 1<=p24]] | [[~ [EG [~ [1<=p18]]] | E [[1<=p10 & 1<=p11] U 1<=p8]] & ~ [EG [~ [1<=p4]]]]] & [[1<=p19 | ~ [E [true U ~ [1<=p5]]]] | E [true U [1<=p10 & 1<=p11]]]]] | [1<=p20 & [1<=p21 & 1<=p24]]]]]]

abstracting: (1<=p24)
states: 446
abstracting: (1<=p21)
states: 210
abstracting: (1<=p20)
states: 555
abstracting: (1<=p11)
states: 266
abstracting: (1<=p10)
states: 400
abstracting: (1<=p5)
states: 266
abstracting: (1<=p19)
states: 375
abstracting: (1<=p4)
states: 126
..................
EG iterations: 18
abstracting: (1<=p8)
states: 446
abstracting: (1<=p11)
states: 266
abstracting: (1<=p10)
states: 400
abstracting: (1<=p18)
states: 540
..........................
EG iterations: 26
abstracting: (1<=p24)
states: 446
abstracting: (1<=p21)
states: 210
abstracting: (1<=p20)
states: 555
abstracting: (1<=p8)
states: 446
.-> the formula is FALSE

FORMULA HouseConstruction-PT-00002-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: EG [E [[1<=p1 | ~ [[EF [1<=p14] | 1<=p6]]] U [[AF [[[1<=p9 & [1<=p12 & 1<=p13]] | 1<=p19]] | [EG [[1<=p9 & [1<=p12 & 1<=p13]]] & ~ [[1<=p20 & [1<=p21 & 1<=p24]]]]] & [AX [1<=p0] | [1<=p16 & 1<=p17]]]]]
normalized: EG [E [[1<=p1 | ~ [[1<=p6 | E [true U 1<=p14]]]] U [[[1<=p16 & 1<=p17] | ~ [EX [~ [1<=p0]]]] & [[~ [[1<=p20 & [1<=p21 & 1<=p24]]] & EG [[1<=p9 & [1<=p12 & 1<=p13]]]] | ~ [EG [~ [[1<=p19 | [1<=p9 & [1<=p12 & 1<=p13]]]]]]]]]]

abstracting: (1<=p13)
states: 456
abstracting: (1<=p12)
states: 210
abstracting: (1<=p9)
states: 580
abstracting: (1<=p19)
states: 375
....................
EG iterations: 20
abstracting: (1<=p13)
states: 456
abstracting: (1<=p12)
states: 210
abstracting: (1<=p9)
states: 580
........................
EG iterations: 24
abstracting: (1<=p24)
states: 446
abstracting: (1<=p21)
states: 210
abstracting: (1<=p20)
states: 555
abstracting: (1<=p0)
states: 66
.abstracting: (1<=p17)
states: 375
abstracting: (1<=p16)
states: 375
abstracting: (1<=p14)
states: 210
abstracting: (1<=p6)
states: 446
abstracting: (1<=p1)
states: 66
..................................
EG iterations: 34
-> the formula is FALSE

FORMULA HouseConstruction-PT-00002-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.026sec

checking: EG [[[EF [[[p13<=0 | p12<=0] | p9<=0]] | EG [p1<=0]] & [~ [E [[A [[1<=p22 & 1<=p23] U 1<=p8] & A [[1<=p10 & 1<=p11] U [1<=p22 & 1<=p23]]] U [1<=p25 | [[1<=p20 & 1<=p21] & [1<=p24 & 1<=p4]]]]] | p4<=0]]]
normalized: EG [[[p4<=0 | ~ [E [[[~ [EG [~ [[1<=p22 & 1<=p23]]]] & ~ [E [~ [[1<=p22 & 1<=p23]] U [~ [[1<=p10 & 1<=p11]] & ~ [[1<=p22 & 1<=p23]]]]]] & [~ [EG [~ [1<=p8]]] & ~ [E [~ [1<=p8] U [~ [[1<=p22 & 1<=p23]] & ~ [1<=p8]]]]]] U [1<=p25 | [[1<=p24 & 1<=p4] & [1<=p20 & 1<=p21]]]]]] & [EG [p1<=0] | E [true U [p9<=0 | [p13<=0 | p12<=0]]]]]]

abstracting: (p12<=0)
states: 1,291 (3)
abstracting: (p13<=0)
states: 1,045 (3)
abstracting: (p9<=0)
states: 921
abstracting: (p1<=0)
states: 1,435 (3)
..................
EG iterations: 18
abstracting: (1<=p21)
states: 210
abstracting: (1<=p20)
states: 555
abstracting: (1<=p4)
states: 126
abstracting: (1<=p24)
states: 446
abstracting: (1<=p25)
states: 446
abstracting: (1<=p8)
states: 446
abstracting: (1<=p23)
states: 375
abstracting: (1<=p22)
states: 540
abstracting: (1<=p8)
states: 446
abstracting: (1<=p8)
states: 446
............................
EG iterations: 28
abstracting: (1<=p23)
states: 375
abstracting: (1<=p22)
states: 540
abstracting: (1<=p11)
states: 266
abstracting: (1<=p10)
states: 400
abstracting: (1<=p23)
states: 375
abstracting: (1<=p22)
states: 540
abstracting: (1<=p23)
states: 375
abstracting: (1<=p22)
states: 540
................................
EG iterations: 32
abstracting: (p4<=0)
states: 1,375 (3)
.
EG iterations: 1
-> the formula is TRUE

FORMULA HouseConstruction-PT-00002-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.040sec

checking: A [A [EF [[[1<=p14 | ~ [[1<=p20 & [1<=p21 & 1<=p24]]]] | [1<=p25 | [1<=p2 | 1<=p15]]]] U [EG [A [[1<=p20 & [1<=p21 & 1<=p24]] U 1<=p14]] | [1<=p6 | [EG [E [1<=p25 U [1<=p3 & 1<=p7]]] & E [1<=p4 U EX [1<=p0]]]]]] U [AG [AX [[AX [1<=p2] & A [1<=p4 U 1<=p8]]]] & [A [E [EF [[1<=p20 & [1<=p21 & 1<=p24]]] U [1<=p6 & 1<=p4]] U [A [[1<=p10 & 1<=p11] U [1<=p22 & 1<=p23]] | [~ [[1<=p16 & 1<=p17]] & [1<=p4 | [1<=p10 & 1<=p11]]]]] | ~ [AX [~ [[1<=p25 & 1<=p6]]]]]]]
normalized: [~ [EG [~ [[[EX [[1<=p25 & 1<=p6]] | [~ [EG [~ [[[[1<=p4 | [1<=p10 & 1<=p11]] & ~ [[1<=p16 & 1<=p17]]] | [~ [EG [~ [[1<=p22 & 1<=p23]]]] & ~ [E [~ [[1<=p22 & 1<=p23]] U [~ [[1<=p10 & 1<=p11]] & ~ [[1<=p22 & 1<=p23]]]]]]]]]] & ~ [E [~ [[[[1<=p4 | [1<=p10 & 1<=p11]] & ~ [[1<=p16 & 1<=p17]]] | [~ [EG [~ [[1<=p22 & 1<=p23]]]] & ~ [E [~ [[1<=p22 & 1<=p23]] U [~ [[1<=p10 & 1<=p11]] & ~ [[1<=p22 & 1<=p23]]]]]]]] U [~ [E [E [true U [1<=p20 & [1<=p21 & 1<=p24]]] U [1<=p6 & 1<=p4]]] & ~ [[[[1<=p4 | [1<=p10 & 1<=p11]] & ~ [[1<=p16 & 1<=p17]]] | [~ [EG [~ [[1<=p22 & 1<=p23]]]] & ~ [E [~ [[1<=p22 & 1<=p23]] U [~ [[1<=p10 & 1<=p11]] & ~ [[1<=p22 & 1<=p23]]]]]]]]]]]]] & ~ [E [true U EX [~ [[[~ [EG [~ [1<=p8]]] & ~ [E [~ [1<=p8] U [~ [1<=p4] & ~ [1<=p8]]]]] & ~ [EX [~ [1<=p2]]]]]]]]]]]] & ~ [E [~ [[[EX [[1<=p25 & 1<=p6]] | [~ [EG [~ [[[[1<=p4 | [1<=p10 & 1<=p11]] & ~ [[1<=p16 & 1<=p17]]] | [~ [EG [~ [[1<=p22 & 1<=p23]]]] & ~ [E [~ [[1<=p22 & 1<=p23]] U [~ [[1<=p10 & 1<=p11]] & ~ [[1<=p22 & 1<=p23]]]]]]]]]] & ~ [E [~ [[[[1<=p4 | [1<=p10 & 1<=p11]] & ~ [[1<=p16 & 1<=p17]]] | [~ [EG [~ [[1<=p22 & 1<=p23]]]] & ~ [E [~ [[1<=p22 & 1<=p23]] U [~ [[1<=p10 & 1<=p11]] & ~ [[1<=p22 & 1<=p23]]]]]]]] U [~ [E [E [true U [1<=p20 & [1<=p21 & 1<=p24]]] U [1<=p6 & 1<=p4]]] & ~ [[[[1<=p4 | [1<=p10 & 1<=p11]] & ~ [[1<=p16 & 1<=p17]]] | [~ [EG [~ [[1<=p22 & 1<=p23]]]] & ~ [E [~ [[1<=p22 & 1<=p23]] U [~ [[1<=p10 & 1<=p11]] & ~ [[1<=p22 & 1<=p23]]]]]]]]]]]]] & ~ [E [true U EX [~ [[[~ [EG [~ [1<=p8]]] & ~ [E [~ [1<=p8] U [~ [1<=p4] & ~ [1<=p8]]]]] & ~ [EX [~ [1<=p2]]]]]]]]]] U [~ [[~ [EG [~ [[[1<=p6 | [E [1<=p4 U EX [1<=p0]] & EG [E [1<=p25 U [1<=p3 & 1<=p7]]]]] | EG [[~ [EG [~ [1<=p14]]] & ~ [E [~ [1<=p14] U [~ [[1<=p20 & [1<=p21 & 1<=p24]]] & ~ [1<=p14]]]]]]]]]] & ~ [E [~ [[[1<=p6 | [E [1<=p4 U EX [1<=p0]] & EG [E [1<=p25 U [1<=p3 & 1<=p7]]]]] | EG [[~ [EG [~ [1<=p14]]] & ~ [E [~ [1<=p14] U [~ [[1<=p20 & [1<=p21 & 1<=p24]]] & ~ [1<=p14]]]]]]]] U [~ [E [true U [[1<=p25 | [1<=p2 | 1<=p15]] | [1<=p14 | ~ [[1<=p20 & [1<=p21 & 1<=p24]]]]]]] & ~ [[[1<=p6 | [E [1<=p4 U EX [1<=p0]] & EG [E [1<=p25 U [1<=p3 & 1<=p7]]]]] | EG [[~ [EG [~ [1<=p14]]] & ~ [E [~ [1<=p14] U [~ [[1<=p20 & [1<=p21 & 1<=p24]]] & ~ [1<=p14]]]]]]]]]]]]] & ~ [[[EX [[1<=p25 & 1<=p6]] | [~ [EG [~ [[[[1<=p4 | [1<=p10 & 1<=p11]] & ~ [[1<=p16 & 1<=p17]]] | [~ [EG [~ [[1<=p22 & 1<=p23]]]] & ~ [E [~ [[1<=p22 & 1<=p23]] U [~ [[1<=p10 & 1<=p11]] & ~ [[1<=p22 & 1<=p23]]]]]]]]]] & ~ [E [~ [[[[1<=p4 | [1<=p10 & 1<=p11]] & ~ [[1<=p16 & 1<=p17]]] | [~ [EG [~ [[1<=p22 & 1<=p23]]]] & ~ [E [~ [[1<=p22 & 1<=p23]] U [~ [[1<=p10 & 1<=p11]] & ~ [[1<=p22 & 1<=p23]]]]]]]] U [~ [E [E [true U [1<=p20 & [1<=p21 & 1<=p24]]] U [1<=p6 & 1<=p4]]] & ~ [[[[1<=p4 | [1<=p10 & 1<=p11]] & ~ [[1<=p16 & 1<=p17]]] | [~ [EG [~ [[1<=p22 & 1<=p23]]]] & ~ [E [~ [[1<=p22 & 1<=p23]] U [~ [[1<=p10 & 1<=p11]] & ~ [[1<=p22 & 1<=p23]]]]]]]]]]]]] & ~ [E [true U EX [~ [[[~ [EG [~ [1<=p8]]] & ~ [E [~ [1<=p8] U [~ [1<=p4] & ~ [1<=p8]]]]] & ~ [EX [~ [1<=p2]]]]]]]]]]]]]]

abstracting: (1<=p2)
states: 66
.abstracting: (1<=p8)
states: 446
abstracting: (1<=p4)
states: 126
abstracting: (1<=p8)
states: 446
abstracting: (1<=p8)
states: 446
............................
EG iterations: 28
.abstracting: (1<=p23)
states: 375
abstracting: (1<=p22)
states: 540
abstracting: (1<=p11)
states: 266
abstracting: (1<=p10)
states: 400
abstracting: (1<=p23)
states: 375
abstracting: (1<=p22)
states: 540
abstracting: (1<=p23)
states: 375
abstracting: (1<=p22)
states: 540
................................
EG iterations: 32
abstracting: (1<=p17)
states: 375
abstracting: (1<=p16)
states: 375
abstracting: (1<=p11)
states: 266
abstracting: (1<=p10)
states: 400
abstracting: (1<=p4)
states: 126
abstracting: (1<=p4)
states: 126
abstracting: (1<=p6)
states: 446
abstracting: (1<=p24)
states: 446
abstracting: (1<=p21)
states: 210
abstracting: (1<=p20)
states: 555
abstracting: (1<=p23)
states: 375
abstracting: (1<=p22)
states: 540
abstracting: (1<=p11)
states: 266
abstracting: (1<=p10)
states: 400
abstracting: (1<=p23)
states: 375
abstracting: (1<=p22)
states: 540
abstracting: (1<=p23)
states: 375
abstracting: (1<=p22)
states: 540
................................
EG iterations: 32
abstracting: (1<=p17)
states: 375
abstracting: (1<=p16)
states: 375
abstracting: (1<=p11)
states: 266
abstracting: (1<=p10)
states: 400
abstracting: (1<=p4)
states: 126
abstracting: (1<=p23)
states: 375
abstracting: (1<=p22)
states: 540
abstracting: (1<=p11)
states: 266
abstracting: (1<=p10)
states: 400
abstracting: (1<=p23)
states: 375
abstracting: (1<=p22)
states: 540
abstracting: (1<=p23)
states: 375
abstracting: (1<=p22)
states: 540
................................
EG iterations: 32
abstracting: (1<=p17)
states: 375
abstracting: (1<=p16)
states: 375
abstracting: (1<=p11)
states: 266
abstracting: (1<=p10)
states: 400
abstracting: (1<=p4)
states: 126
..........................
EG iterations: 26
abstracting: (1<=p6)
states: 446
abstracting: (1<=p25)
states: 446
.abstracting: (1<=p14)
states: 210
abstracting: (1<=p24)
states: 446
abstracting: (1<=p21)
states: 210
abstracting: (1<=p20)
states: 555
abstracting: (1<=p14)
states: 210
abstracting: (1<=p14)
states: 210
........................
EG iterations: 24
........................
EG iterations: 24
abstracting: (1<=p7)
states: 446
abstracting: (1<=p3)
states: 1,170 (3)
abstracting: (1<=p25)
states: 446
.............................
EG iterations: 29
abstracting: (1<=p0)
states: 66
.abstracting: (1<=p4)
states: 126
abstracting: (1<=p6)
states: 446
abstracting: (1<=p24)
states: 446
abstracting: (1<=p21)
states: 210
abstracting: (1<=p20)
states: 555
abstracting: (1<=p14)
states: 210
abstracting: (1<=p15)
states: 210
abstracting: (1<=p2)
states: 66
abstracting: (1<=p25)
states: 446
abstracting: (1<=p14)
states: 210
abstracting: (1<=p24)
states: 446
abstracting: (1<=p21)
states: 210
abstracting: (1<=p20)
states: 555
abstracting: (1<=p14)
states: 210
abstracting: (1<=p14)
states: 210
........................
EG iterations: 24
........................
EG iterations: 24
abstracting: (1<=p7)
states: 446
abstracting: (1<=p3)
states: 1,170 (3)
abstracting: (1<=p25)
states: 446
.............................
EG iterations: 29
abstracting: (1<=p0)
states: 66
.abstracting: (1<=p4)
states: 126
abstracting: (1<=p6)
states: 446
abstracting: (1<=p14)
states: 210
abstracting: (1<=p24)
states: 446
abstracting: (1<=p21)
states: 210
abstracting: (1<=p20)
states: 555
abstracting: (1<=p14)
states: 210
abstracting: (1<=p14)
states: 210
........................
EG iterations: 24
........................
EG iterations: 24
abstracting: (1<=p7)
states: 446
abstracting: (1<=p3)
states: 1,170 (3)
abstracting: (1<=p25)
states: 446
.............................
EG iterations: 29
abstracting: (1<=p0)
states: 66
.abstracting: (1<=p4)
states: 126
abstracting: (1<=p6)
states: 446
...................
EG iterations: 19
abstracting: (1<=p2)
states: 66
.abstracting: (1<=p8)
states: 446
abstracting: (1<=p4)
states: 126
abstracting: (1<=p8)
states: 446
abstracting: (1<=p8)
states: 446
............................
EG iterations: 28
.abstracting: (1<=p23)
states: 375
abstracting: (1<=p22)
states: 540
abstracting: (1<=p11)
states: 266
abstracting: (1<=p10)
states: 400
abstracting: (1<=p23)
states: 375
abstracting: (1<=p22)
states: 540
abstracting: (1<=p23)
states: 375
abstracting: (1<=p22)
states: 540
................................
EG iterations: 32
abstracting: (1<=p17)
states: 375
abstracting: (1<=p16)
states: 375
abstracting: (1<=p11)
states: 266
abstracting: (1<=p10)
states: 400
abstracting: (1<=p4)
states: 126
abstracting: (1<=p4)
states: 126
abstracting: (1<=p6)
states: 446
abstracting: (1<=p24)
states: 446
abstracting: (1<=p21)
states: 210
abstracting: (1<=p20)
states: 555
abstracting: (1<=p23)
states: 375
abstracting: (1<=p22)
states: 540
abstracting: (1<=p11)
states: 266
abstracting: (1<=p10)
states: 400
abstracting: (1<=p23)
states: 375
abstracting: (1<=p22)
states: 540
abstracting: (1<=p23)
states: 375
abstracting: (1<=p22)
states: 540
................................
EG iterations: 32
abstracting: (1<=p17)
states: 375
abstracting: (1<=p16)
states: 375
abstracting: (1<=p11)
states: 266
abstracting: (1<=p10)
states: 400
abstracting: (1<=p4)
states: 126
abstracting: (1<=p23)
states: 375
abstracting: (1<=p22)
states: 540
abstracting: (1<=p11)
states: 266
abstracting: (1<=p10)
states: 400
abstracting: (1<=p23)
states: 375
abstracting: (1<=p22)
states: 540
abstracting: (1<=p23)
states: 375
abstracting: (1<=p22)
states: 540
................................
EG iterations: 32
abstracting: (1<=p17)
states: 375
abstracting: (1<=p16)
states: 375
abstracting: (1<=p11)
states: 266
abstracting: (1<=p10)
states: 400
abstracting: (1<=p4)
states: 126
..........................
EG iterations: 26
abstracting: (1<=p6)
states: 446
abstracting: (1<=p25)
states: 446
.abstracting: (1<=p2)
states: 66
.abstracting: (1<=p8)
states: 446
abstracting: (1<=p4)
states: 126
abstracting: (1<=p8)
states: 446
abstracting: (1<=p8)
states: 446
............................
EG iterations: 28
.abstracting: (1<=p23)
states: 375
abstracting: (1<=p22)
states: 540
abstracting: (1<=p11)
states: 266
abstracting: (1<=p10)
states: 400
abstracting: (1<=p23)
states: 375
abstracting: (1<=p22)
states: 540
abstracting: (1<=p23)
states: 375
abstracting: (1<=p22)
states: 540
................................
EG iterations: 32
abstracting: (1<=p17)
states: 375
abstracting: (1<=p16)
states: 375
abstracting: (1<=p11)
states: 266
abstracting: (1<=p10)
states: 400
abstracting: (1<=p4)
states: 126
abstracting: (1<=p4)
states: 126
abstracting: (1<=p6)
states: 446
abstracting: (1<=p24)
states: 446
abstracting: (1<=p21)
states: 210
abstracting: (1<=p20)
states: 555
abstracting: (1<=p23)
states: 375
abstracting: (1<=p22)
states: 540
abstracting: (1<=p11)
states: 266
abstracting: (1<=p10)
states: 400
abstracting: (1<=p23)
states: 375
abstracting: (1<=p22)
states: 540
abstracting: (1<=p23)
states: 375
abstracting: (1<=p22)
states: 540
................................
EG iterations: 32
abstracting: (1<=p17)
states: 375
abstracting: (1<=p16)
states: 375
abstracting: (1<=p11)
states: 266
abstracting: (1<=p10)
states: 400
abstracting: (1<=p4)
states: 126
abstracting: (1<=p23)
states: 375
abstracting: (1<=p22)
states: 540
abstracting: (1<=p11)
states: 266
abstracting: (1<=p10)
states: 400
abstracting: (1<=p23)
states: 375
abstracting: (1<=p22)
states: 540
abstracting: (1<=p23)
states: 375
abstracting: (1<=p22)
states: 540
................................
EG iterations: 32
abstracting: (1<=p17)
states: 375
abstracting: (1<=p16)
states: 375
abstracting: (1<=p11)
states: 266
abstracting: (1<=p10)
states: 400
abstracting: (1<=p4)
states: 126
..........................
EG iterations: 26
abstracting: (1<=p6)
states: 446
abstracting: (1<=p25)
states: 446
.
EG iterations: 0
-> the formula is FALSE

FORMULA HouseConstruction-PT-00002-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.064sec

totally nodes used: 147240 (1.5e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 236000 377718 613718
used/not used/entry size/cache size: 524788 66584076 16 1024MB
basic ops cache: hits/miss/sum: 57365 127112 184477
used/not used/entry size/cache size: 243585 16533631 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: 2970 4845 7815
used/not used/entry size/cache size: 4845 8383763 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 66967755
1 135421
2 5317
3 319
4 40
5 7
6 3
7 1
8 1
9 0
>= 10 0

Total processing time: 0m 5.208sec


BK_STOP 1678845914439

--------------------
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:148 (8), effective:36 (2)

initing FirstDep: 0m 0.000sec


iterations count:34 (1), effective:7 (0)

iterations count:25 (1), effective:4 (0)

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

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

iterations count:25 (1), effective:4 (0)

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

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

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

iterations count:46 (2), effective:8 (0)

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

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

iterations count:29 (1), effective:6 (0)

iterations count:31 (1), effective:5 (0)

iterations count:23 (1), effective:3 (0)

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

iterations count:46 (2), effective:8 (0)

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

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

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

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

iterations count:46 (2), effective:8 (0)

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

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

iterations count:36 (2), effective:4 (0)

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

iterations count:31 (1), effective:5 (0)

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

iterations count:27 (1), effective:5 (0)

iterations count:46 (2), effective:8 (0)

iterations count:48 (2), effective:9 (0)

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

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

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

iterations count:34 (1), effective:7 (0)

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

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

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

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

iterations count:30 (1), effective:7 (0)

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

iterations count:27 (1), effective:5 (0)

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

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

iterations count:29 (1), effective:6 (0)

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

iterations count:59 (3), effective:11 (0)

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

iterations count:29 (1), effective:6 (0)

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

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

iterations count:29 (1), effective:6 (0)

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

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

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

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

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

iterations count:30 (1), effective:7 (0)

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

iterations count:27 (1), effective:5 (0)

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

iterations count:36 (2), effective:10 (0)

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

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

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

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

iterations count:30 (1), effective:7 (0)

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

iterations count:27 (1), effective:5 (0)

iterations count:30 (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="HouseConstruction-PT-00002"
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 HouseConstruction-PT-00002, 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 r202-smll-167840348800514"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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