About the Execution of Marcie+red for HouseConstruction-PT-00005
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6076.432 | 24750.00 | 30132.00 | 544.90 | TTTFTFTTTTTFTFTT | 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.r202-smll-167840348800522.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-00005, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r202-smll-167840348800522
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 4.9K Feb 25 13:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 45K Feb 25 13:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 13:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 13:04 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.5K Feb 25 16:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 12K Feb 25 13:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Feb 25 13:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 13:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 25 13:05 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-00005-CTLFireability-00
FORMULA_NAME HouseConstruction-PT-00005-CTLFireability-01
FORMULA_NAME HouseConstruction-PT-00005-CTLFireability-02
FORMULA_NAME HouseConstruction-PT-00005-CTLFireability-03
FORMULA_NAME HouseConstruction-PT-00005-CTLFireability-04
FORMULA_NAME HouseConstruction-PT-00005-CTLFireability-05
FORMULA_NAME HouseConstruction-PT-00005-CTLFireability-06
FORMULA_NAME HouseConstruction-PT-00005-CTLFireability-07
FORMULA_NAME HouseConstruction-PT-00005-CTLFireability-08
FORMULA_NAME HouseConstruction-PT-00005-CTLFireability-09
FORMULA_NAME HouseConstruction-PT-00005-CTLFireability-10
FORMULA_NAME HouseConstruction-PT-00005-CTLFireability-11
FORMULA_NAME HouseConstruction-PT-00005-CTLFireability-12
FORMULA_NAME HouseConstruction-PT-00005-CTLFireability-13
FORMULA_NAME HouseConstruction-PT-00005-CTLFireability-14
FORMULA_NAME HouseConstruction-PT-00005-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1678846083567
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-00005
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-15 02:08:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-15 02:08:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 02:08:06] [INFO ] Load time of PNML (sax parser for PT used): 49 ms
[2023-03-15 02:08:06] [INFO ] Transformed 26 places.
[2023-03-15 02:08:06] [INFO ] Transformed 18 transitions.
[2023-03-15 02:08:06] [INFO ] Parsed PT model containing 26 places and 18 transitions and 51 arcs in 191 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 25 ms.
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 21 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:08:06] [INFO ] Computed 8 place invariants in 6 ms
[2023-03-15 02:08:07] [INFO ] Implicit Places using invariants in 344 ms returned []
[2023-03-15 02:08:07] [INFO ] Invariant cache hit.
[2023-03-15 02:08:07] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
[2023-03-15 02:08:07] [INFO ] Invariant cache hit.
[2023-03-15 02:08:07] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 578 ms. Remains : 26/26 places, 18/18 transitions.
Support contains 26 out of 26 places after structural reductions.
[2023-03-15 02:08:07] [INFO ] Flatten gal took : 33 ms
[2023-03-15 02:08:07] [INFO ] Flatten gal took : 11 ms
[2023-03-15 02:08:07] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 10000 steps, including 91 resets, run finished after 371 ms. (steps per millisecond=26 ) properties (out of 38) seen :32
Finished Best-First random walk after 1581 steps, including 3 resets, run visited all 6 properties in 7 ms. (steps per millisecond=225 )
[2023-03-15 02:08:08] [INFO ] Flatten gal took : 4 ms
[2023-03-15 02:08:08] [INFO ] Flatten gal took : 5 ms
[2023-03-15 02:08:08] [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-00005-CTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-00005-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 15 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 1 place count 14 transition count 7
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 9 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 9 place count 9 transition count 6
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 11 place count 8 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 6 transition count 5
Applied a total of 14 rules in 15 ms. Remains 6 /26 variables (removed 20) and now considering 5/18 (removed 13) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 6/26 places, 5/18 transitions.
[2023-03-15 02:08:08] [INFO ] Flatten gal took : 1 ms
[2023-03-15 02:08:08] [INFO ] Flatten gal took : 1 ms
[2023-03-15 02:08:08] [INFO ] Input system was already deterministic with 5 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:08:08] [INFO ] Flatten gal took : 3 ms
[2023-03-15 02:08:08] [INFO ] Flatten gal took : 2 ms
[2023-03-15 02:08:08] [INFO ] Input system was already deterministic with 18 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:08:08] [INFO ] Flatten gal took : 3 ms
[2023-03-15 02:08:08] [INFO ] Flatten gal took : 2 ms
[2023-03-15 02:08:08] [INFO ] Input system was already deterministic with 18 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:08:08] [INFO ] Flatten gal took : 2 ms
[2023-03-15 02:08:08] [INFO ] Flatten gal took : 2 ms
[2023-03-15 02:08: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:08:08] [INFO ] Flatten gal took : 3 ms
[2023-03-15 02:08:08] [INFO ] Flatten gal took : 2 ms
[2023-03-15 02:08:08] [INFO ] Input system was already deterministic with 18 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 2 ms. Remains : 25/26 places, 18/18 transitions.
[2023-03-15 02:08:08] [INFO ] Flatten gal took : 2 ms
[2023-03-15 02:08:08] [INFO ] Flatten gal took : 2 ms
[2023-03-15 02:08: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 17 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions removed 5 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 16 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 15 transition count 11
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 3 place count 15 transition count 8
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 11 place count 10 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 13 place count 9 transition count 7
Applied a total of 13 rules in 6 ms. Remains 9 /26 variables (removed 17) and now considering 7/18 (removed 11) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 9/26 places, 7/18 transitions.
[2023-03-15 02:08:08] [INFO ] Flatten gal took : 1 ms
[2023-03-15 02:08:08] [INFO ] Flatten gal took : 1 ms
[2023-03-15 02:08:08] [INFO ] Input system was already deterministic with 7 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:08:08] [INFO ] Flatten gal took : 2 ms
[2023-03-15 02:08:08] [INFO ] Flatten gal took : 2 ms
[2023-03-15 02:08: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:08:08] [INFO ] Flatten gal took : 2 ms
[2023-03-15 02:08:08] [INFO ] Flatten gal took : 2 ms
[2023-03-15 02:08: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 12 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Discarding 14 places :
Also discarding 9 output transitions
Drop transitions removed 9 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 11 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 10 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 10 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 7 transition count 6
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 7 place count 7 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 12 place count 4 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 12 place count 4 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 14 place count 3 transition count 3
Applied a total of 14 rules in 6 ms. Remains 3 /26 variables (removed 23) and now considering 3/18 (removed 15) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 3/26 places, 3/18 transitions.
[2023-03-15 02:08:08] [INFO ] Flatten gal took : 1 ms
[2023-03-15 02:08:08] [INFO ] Flatten gal took : 1 ms
[2023-03-15 02:08:08] [INFO ] Input system was already deterministic with 3 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:08:08] [INFO ] Flatten gal took : 2 ms
[2023-03-15 02:08:08] [INFO ] Flatten gal took : 1 ms
[2023-03-15 02:08: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 0 ms. Remains : 26/26 places, 18/18 transitions.
[2023-03-15 02:08:08] [INFO ] Flatten gal took : 1 ms
[2023-03-15 02:08:08] [INFO ] Flatten gal took : 2 ms
[2023-03-15 02:08:08] [INFO ] Input system was already deterministic with 18 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:08:08] [INFO ] Flatten gal took : 1 ms
[2023-03-15 02:08:08] [INFO ] Flatten gal took : 2 ms
[2023-03-15 02:08: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 12 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.5 ms
Discarding 14 places :
Also discarding 9 output transitions
Drop transitions removed 9 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 11 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 10 transition count 7
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 9 transition count 6
Applied a total of 4 rules in 13 ms. Remains 9 /26 variables (removed 17) and now considering 6/18 (removed 12) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 9/26 places, 6/18 transitions.
[2023-03-15 02:08:08] [INFO ] Flatten gal took : 1 ms
[2023-03-15 02:08:08] [INFO ] Flatten gal took : 1 ms
[2023-03-15 02:08:08] [INFO ] Input system was already deterministic with 6 transitions.
[2023-03-15 02:08:08] [INFO ] Flatten gal took : 3 ms
[2023-03-15 02:08:08] [INFO ] Flatten gal took : 3 ms
[2023-03-15 02:08:08] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-15 02:08: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 2097 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.262sec
RS generation: 0m 0.031sec
-> reachability set: #nodes 6635 (6.6e+03) #states 1,187,984 (6)
starting MCC model checker
--------------------------
checking: EX [EG [EF [[p10<=0 | p11<=0]]]]
normalized: EX [EG [E [true U [p10<=0 | p11<=0]]]]
abstracting: (p11<=0)
states: 746,578 (5)
abstracting: (p10<=0)
states: 613,704 (5)
EG iterations: 0
.-> the formula is TRUE
FORMULA HouseConstruction-PT-00005-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.089sec
checking: EX [[p15<=0 & AF [AG [p19<=0]]]]
normalized: EX [[p15<=0 & ~ [EG [E [true U ~ [p19<=0]]]]]]
abstracting: (p19<=0)
states: 678,524 (5)
.........................................................................................
EG iterations: 89
abstracting: (p15<=0)
states: 846,104 (5)
.-> the formula is TRUE
FORMULA HouseConstruction-PT-00005-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.858sec
checking: AG [EF [[[p7<=0 | p3<=0] | 1<=p15]]]
normalized: ~ [E [true U ~ [E [true U [1<=p15 | [p7<=0 | p3<=0]]]]]]
abstracting: (p3<=0)
states: 62,288 (4)
abstracting: (p7<=0)
states: 598,348 (5)
abstracting: (1<=p15)
states: 341,880 (5)
-> the formula is TRUE
FORMULA HouseConstruction-PT-00005-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.039sec
checking: EF [AG [[1<=p15 | [p14<=0 & ~ [E [1<=p15 U 1<=p14]]]]]]
normalized: E [true U ~ [E [true U ~ [[1<=p15 | [p14<=0 & ~ [E [1<=p15 U 1<=p14]]]]]]]]
abstracting: (1<=p14)
states: 341,880 (5)
abstracting: (1<=p15)
states: 341,880 (5)
abstracting: (p14<=0)
states: 846,104 (5)
abstracting: (1<=p15)
states: 341,880 (5)
-> the formula is TRUE
FORMULA HouseConstruction-PT-00005-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.077sec
checking: EG [~ [E [1<=p14 U AF [EG [[1<=p9 & [1<=p12 & 1<=p13]]]]]]]
normalized: EG [~ [E [1<=p14 U ~ [EG [~ [EG [[1<=p9 & [1<=p12 & 1<=p13]]]]]]]]]
abstracting: (1<=p13)
states: 673,806 (5)
abstracting: (1<=p12)
states: 341,880 (5)
abstracting: (1<=p9)
states: 773,990 (5)
..............................................................................
EG iterations: 78
EG iterations: 0
abstracting: (1<=p14)
states: 341,880 (5)
EG iterations: 0
-> the formula is TRUE
FORMULA HouseConstruction-PT-00005-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.304sec
checking: AF [[1<=p8 | E [~ [AF [[1<=p3 & 1<=p7]]] U EG [[AX [1<=p6] & p5<=0]]]]]
normalized: ~ [EG [~ [[1<=p8 | E [EG [~ [[1<=p3 & 1<=p7]]] U EG [[p5<=0 & ~ [EX [~ [1<=p6]]]]]]]]]]
abstracting: (1<=p6)
states: 589,636 (5)
.abstracting: (p5<=0)
states: 746,578 (5)
............................................................
EG iterations: 60
abstracting: (1<=p7)
states: 589,636 (5)
abstracting: (1<=p3)
states: 1,125,696 (6)
........................................................................
EG iterations: 72
abstracting: (1<=p8)
states: 589,636 (5)
...................................................................
EG iterations: 67
-> the formula is TRUE
FORMULA HouseConstruction-PT-00005-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.634sec
checking: ~ [A [~ [A [AG [[1<=p18 & [1<=p16 & 1<=p17]]] U p15<=0]] U AF [[1<=p8 | [AX [[1<=p3 & 1<=p7]] & 1<=p25]]]]]
normalized: ~ [[~ [EG [EG [~ [[1<=p8 | [1<=p25 & ~ [EX [~ [[1<=p3 & 1<=p7]]]]]]]]]] & ~ [E [EG [~ [[1<=p8 | [1<=p25 & ~ [EX [~ [[1<=p3 & 1<=p7]]]]]]]] U [[~ [EG [~ [p15<=0]]] & ~ [E [~ [p15<=0] U [E [true U ~ [[1<=p18 & [1<=p16 & 1<=p17]]]] & ~ [p15<=0]]]]] & EG [~ [[1<=p8 | [1<=p25 & ~ [EX [~ [[1<=p3 & 1<=p7]]]]]]]]]]]]]
abstracting: (1<=p7)
states: 589,636 (5)
abstracting: (1<=p3)
states: 1,125,696 (6)
.abstracting: (1<=p25)
states: 589,636 (5)
abstracting: (1<=p8)
states: 589,636 (5)
...................................................................
EG iterations: 67
abstracting: (p15<=0)
states: 846,104 (5)
abstracting: (1<=p17)
states: 509,460 (5)
abstracting: (1<=p16)
states: 509,460 (5)
abstracting: (1<=p18)
states: 677,040 (5)
abstracting: (p15<=0)
states: 846,104 (5)
abstracting: (p15<=0)
states: 846,104 (5)
..............................................................................
EG iterations: 78
abstracting: (1<=p7)
states: 589,636 (5)
abstracting: (1<=p3)
states: 1,125,696 (6)
.abstracting: (1<=p25)
states: 589,636 (5)
abstracting: (1<=p8)
states: 589,636 (5)
...................................................................
EG iterations: 67
abstracting: (1<=p7)
states: 589,636 (5)
abstracting: (1<=p3)
states: 1,125,696 (6)
.abstracting: (1<=p25)
states: 589,636 (5)
abstracting: (1<=p8)
states: 589,636 (5)
...................................................................
EG iterations: 67
.
EG iterations: 1
-> the formula is FALSE
FORMULA HouseConstruction-PT-00005-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.123sec
checking: AF [EG [[[AF [p18<=0] | AF [[p3<=0 | p7<=0]]] & [p18<=0 | [EF [[1<=p3 & 1<=p7]] | A [A [1<=p2 U 1<=p5] U p5<=0]]]]]]
normalized: ~ [EG [~ [EG [[[p18<=0 | [[~ [EG [~ [p5<=0]]] & ~ [E [~ [p5<=0] U [~ [[~ [EG [~ [1<=p5]]] & ~ [E [~ [1<=p5] U [~ [1<=p2] & ~ [1<=p5]]]]]] & ~ [p5<=0]]]]] | E [true U [1<=p3 & 1<=p7]]]] & [~ [EG [~ [[p3<=0 | p7<=0]]]] | ~ [EG [~ [p18<=0]]]]]]]]]
abstracting: (p18<=0)
states: 510,944 (5)
................................................................................
EG iterations: 80
abstracting: (p7<=0)
states: 598,348 (5)
abstracting: (p3<=0)
states: 62,288 (4)
...................................................................................
EG iterations: 83
abstracting: (1<=p7)
states: 589,636 (5)
abstracting: (1<=p3)
states: 1,125,696 (6)
abstracting: (p5<=0)
states: 746,578 (5)
abstracting: (1<=p5)
states: 441,406 (5)
abstracting: (1<=p2)
states: 173,451 (5)
abstracting: (1<=p5)
states: 441,406 (5)
abstracting: (1<=p5)
states: 441,406 (5)
............................................................
EG iterations: 60
abstracting: (p5<=0)
states: 746,578 (5)
abstracting: (p5<=0)
states: 746,578 (5)
...............................................................................
EG iterations: 79
abstracting: (p18<=0)
states: 510,944 (5)
EG iterations: 0
.
EG iterations: 1
-> the formula is TRUE
FORMULA HouseConstruction-PT-00005-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.828sec
checking: [~ [A [[AF [[AF [1<=p6] & EX [[1<=p22 & 1<=p23]]]] | [1<=p19 | ~ [[~ [[1<=p22 & 1<=p23]] | 1<=p15]]]] U AF [AG [[1<=p0 & 1<=p18]]]]] & [EF [[p10<=0 | p11<=0]] | ~ [A [EG [1<=p8] U AF [1<=p8]]]]]
normalized: [[~ [[~ [EG [EG [~ [1<=p8]]]] & ~ [E [EG [~ [1<=p8]] U [~ [EG [1<=p8]] & EG [~ [1<=p8]]]]]]] | E [true U [p10<=0 | p11<=0]]] & ~ [[~ [EG [EG [E [true U ~ [[1<=p0 & 1<=p18]]]]]] & ~ [E [EG [E [true U ~ [[1<=p0 & 1<=p18]]]] U [~ [[[1<=p19 | ~ [[1<=p15 | ~ [[1<=p22 & 1<=p23]]]]] | ~ [EG [~ [[EX [[1<=p22 & 1<=p23]] & ~ [EG [~ [1<=p6]]]]]]]]] & EG [E [true U ~ [[1<=p0 & 1<=p18]]]]]]]]]]
abstracting: (1<=p18)
states: 677,040 (5)
abstracting: (1<=p0)
states: 173,451 (5)
EG iterations: 0
abstracting: (1<=p6)
states: 589,636 (5)
..........................................................
EG iterations: 58
abstracting: (1<=p23)
states: 509,460 (5)
abstracting: (1<=p22)
states: 677,040 (5)
..
EG iterations: 1
abstracting: (1<=p23)
states: 509,460 (5)
abstracting: (1<=p22)
states: 677,040 (5)
abstracting: (1<=p15)
states: 341,880 (5)
abstracting: (1<=p19)
states: 509,460 (5)
abstracting: (1<=p18)
states: 677,040 (5)
abstracting: (1<=p0)
states: 173,451 (5)
EG iterations: 0
abstracting: (1<=p18)
states: 677,040 (5)
abstracting: (1<=p0)
states: 173,451 (5)
EG iterations: 0
EG iterations: 0
abstracting: (p11<=0)
states: 746,578 (5)
abstracting: (p10<=0)
states: 613,704 (5)
abstracting: (1<=p8)
states: 589,636 (5)
...................................................................
EG iterations: 67
abstracting: (1<=p8)
states: 589,636 (5)
...................................................................................
EG iterations: 83
abstracting: (1<=p8)
states: 589,636 (5)
...................................................................
EG iterations: 67
abstracting: (1<=p8)
states: 589,636 (5)
...................................................................
EG iterations: 67
.
EG iterations: 1
-> the formula is TRUE
FORMULA HouseConstruction-PT-00005-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.948sec
checking: A [A [AX [[[p0<=0 & 1<=p20] & [1<=p21 & 1<=p24]]] U AF [[~ [[1<=p5 | 1<=p25]] | A [1<=p19 U 1<=p5]]]] U ~ [AG [[EF [1<=p0] | E [AF [1<=p18] U [1<=p0 & [1<=p16 & 1<=p17]]]]]]]
normalized: [~ [EG [~ [E [true U ~ [[E [~ [EG [~ [1<=p18]]] U [1<=p0 & [1<=p16 & 1<=p17]]] | E [true U 1<=p0]]]]]]] & ~ [E [~ [E [true U ~ [[E [~ [EG [~ [1<=p18]]] U [1<=p0 & [1<=p16 & 1<=p17]]] | E [true U 1<=p0]]]]] U [~ [[~ [EG [EG [~ [[[~ [EG [~ [1<=p5]]] & ~ [E [~ [1<=p5] U [~ [1<=p19] & ~ [1<=p5]]]]] | ~ [[1<=p5 | 1<=p25]]]]]]] & ~ [E [EG [~ [[[~ [EG [~ [1<=p5]]] & ~ [E [~ [1<=p5] U [~ [1<=p19] & ~ [1<=p5]]]]] | ~ [[1<=p5 | 1<=p25]]]]] U [EX [~ [[[1<=p21 & 1<=p24] & [p0<=0 & 1<=p20]]]] & EG [~ [[[~ [EG [~ [1<=p5]]] & ~ [E [~ [1<=p5] U [~ [1<=p19] & ~ [1<=p5]]]]] | ~ [[1<=p5 | 1<=p25]]]]]]]]]] & ~ [E [true U ~ [[E [~ [EG [~ [1<=p18]]] U [1<=p0 & [1<=p16 & 1<=p17]]] | E [true U 1<=p0]]]]]]]]]
abstracting: (1<=p0)
states: 173,451 (5)
abstracting: (1<=p17)
states: 509,460 (5)
abstracting: (1<=p16)
states: 509,460 (5)
abstracting: (1<=p0)
states: 173,451 (5)
abstracting: (1<=p18)
states: 677,040 (5)
..............................................................
EG iterations: 62
abstracting: (1<=p25)
states: 589,636 (5)
abstracting: (1<=p5)
states: 441,406 (5)
abstracting: (1<=p5)
states: 441,406 (5)
abstracting: (1<=p19)
states: 509,460 (5)
abstracting: (1<=p5)
states: 441,406 (5)
abstracting: (1<=p5)
states: 441,406 (5)
............................................................
EG iterations: 60
..................................................................
EG iterations: 66
abstracting: (1<=p20)
states: 723,345 (5)
abstracting: (p0<=0)
states: 1,014,533 (6)
abstracting: (1<=p24)
states: 589,636 (5)
abstracting: (1<=p21)
states: 341,880 (5)
.abstracting: (1<=p25)
states: 589,636 (5)
abstracting: (1<=p5)
states: 441,406 (5)
abstracting: (1<=p5)
states: 441,406 (5)
abstracting: (1<=p19)
states: 509,460 (5)
abstracting: (1<=p5)
states: 441,406 (5)
abstracting: (1<=p5)
states: 441,406 (5)
............................................................
EG iterations: 60
..................................................................
EG iterations: 66
abstracting: (1<=p25)
states: 589,636 (5)
abstracting: (1<=p5)
states: 441,406 (5)
abstracting: (1<=p5)
states: 441,406 (5)
abstracting: (1<=p19)
states: 509,460 (5)
abstracting: (1<=p5)
states: 441,406 (5)
abstracting: (1<=p5)
states: 441,406 (5)
............................................................
EG iterations: 60
..................................................................
EG iterations: 66
.
EG iterations: 1
abstracting: (1<=p0)
states: 173,451 (5)
abstracting: (1<=p17)
states: 509,460 (5)
abstracting: (1<=p16)
states: 509,460 (5)
abstracting: (1<=p0)
states: 173,451 (5)
abstracting: (1<=p18)
states: 677,040 (5)
..............................................................
EG iterations: 62
abstracting: (1<=p0)
states: 173,451 (5)
abstracting: (1<=p17)
states: 509,460 (5)
abstracting: (1<=p16)
states: 509,460 (5)
abstracting: (1<=p0)
states: 173,451 (5)
abstracting: (1<=p18)
states: 677,040 (5)
..............................................................
EG iterations: 62
.
EG iterations: 1
-> the formula is TRUE
FORMULA HouseConstruction-PT-00005-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.860sec
checking: [A [A [[~ [EG [1<=p4]] | AX [[1<=p18 & 1<=p4]]] U EG [[[1<=p1 | [1<=p10 & 1<=p11]] & E [1<=p18 U [1<=p3 & 1<=p7]]]]] U EX [EX [EG [[1<=p3 & 1<=p7]]]]] | AG [AF [[[1<=p5 | AX [1<=p19]] & AX [1<=p19]]]]]
normalized: [~ [E [true U EG [~ [[[1<=p5 | ~ [EX [~ [1<=p19]]]] & ~ [EX [~ [1<=p19]]]]]]]] | [~ [EG [~ [EX [EX [EG [[1<=p3 & 1<=p7]]]]]]] & ~ [E [~ [EX [EX [EG [[1<=p3 & 1<=p7]]]]] U [~ [[~ [EG [~ [EG [[E [1<=p18 U [1<=p3 & 1<=p7]] & [1<=p1 | [1<=p10 & 1<=p11]]]]]]] & ~ [E [~ [EG [[E [1<=p18 U [1<=p3 & 1<=p7]] & [1<=p1 | [1<=p10 & 1<=p11]]]]] U [~ [[~ [EX [~ [[1<=p18 & 1<=p4]]]] | ~ [EG [1<=p4]]]] & ~ [EG [[E [1<=p18 U [1<=p3 & 1<=p7]] & [1<=p1 | [1<=p10 & 1<=p11]]]]]]]]]] & ~ [EX [EX [EG [[1<=p3 & 1<=p7]]]]]]]]]]
abstracting: (1<=p7)
states: 589,636 (5)
abstracting: (1<=p3)
states: 1,125,696 (6)
...................................................................................
EG iterations: 83
..abstracting: (1<=p11)
states: 441,406 (5)
abstracting: (1<=p10)
states: 574,280 (5)
abstracting: (1<=p1)
states: 173,451 (5)
abstracting: (1<=p7)
states: 589,636 (5)
abstracting: (1<=p3)
states: 1,125,696 (6)
abstracting: (1<=p18)
states: 677,040 (5)
..........................................................................
EG iterations: 74
abstracting: (1<=p4)
states: 291,996 (5)
...........................................................................
EG iterations: 75
abstracting: (1<=p4)
states: 291,996 (5)
abstracting: (1<=p18)
states: 677,040 (5)
.abstracting: (1<=p11)
states: 441,406 (5)
abstracting: (1<=p10)
states: 574,280 (5)
abstracting: (1<=p1)
states: 173,451 (5)
abstracting: (1<=p7)
states: 589,636 (5)
abstracting: (1<=p3)
states: 1,125,696 (6)
abstracting: (1<=p18)
states: 677,040 (5)
..........................................................................
EG iterations: 74
abstracting: (1<=p11)
states: 441,406 (5)
abstracting: (1<=p10)
states: 574,280 (5)
abstracting: (1<=p1)
states: 173,451 (5)
abstracting: (1<=p7)
states: 589,636 (5)
abstracting: (1<=p3)
states: 1,125,696 (6)
abstracting: (1<=p18)
states: 677,040 (5)
..........................................................................
EG iterations: 74
EG iterations: 0
abstracting: (1<=p7)
states: 589,636 (5)
abstracting: (1<=p3)
states: 1,125,696 (6)
...................................................................................
EG iterations: 83
..abstracting: (1<=p7)
states: 589,636 (5)
abstracting: (1<=p3)
states: 1,125,696 (6)
...................................................................................
EG iterations: 83
..
EG iterations: 0
abstracting: (1<=p19)
states: 509,460 (5)
.abstracting: (1<=p19)
states: 509,460 (5)
.abstracting: (1<=p5)
states: 441,406 (5)
...........................................................................................
EG iterations: 91
-> the formula is TRUE
FORMULA HouseConstruction-PT-00005-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.375sec
checking: [EF [[E [~ [EX [1<=p18]] U [EG [1<=p14] | [[1<=p10 & 1<=p11] | ~ [[1<=p9 & [1<=p12 & 1<=p13]]]]]] & [AG [1<=p15] | EX [[[[1<=p16 & 1<=p17] | 1<=p2] & p1<=0]]]]] & [AX [[1<=p20 & [1<=p21 & 1<=p24]]] | EF [[AG [[1<=p3 & 1<=p7]] | AG [AX [p6<=0]]]]]]
normalized: [[E [true U [~ [E [true U EX [~ [p6<=0]]]] | ~ [E [true U ~ [[1<=p3 & 1<=p7]]]]]] | ~ [EX [~ [[1<=p20 & [1<=p21 & 1<=p24]]]]]] & E [true U [[EX [[p1<=0 & [1<=p2 | [1<=p16 & 1<=p17]]]] | ~ [E [true U ~ [1<=p15]]]] & E [~ [EX [1<=p18]] U [[~ [[1<=p9 & [1<=p12 & 1<=p13]]] | [1<=p10 & 1<=p11]] | EG [1<=p14]]]]]]
abstracting: (1<=p14)
states: 341,880 (5)
..............................................................................
EG iterations: 78
abstracting: (1<=p11)
states: 441,406 (5)
abstracting: (1<=p10)
states: 574,280 (5)
abstracting: (1<=p13)
states: 673,806 (5)
abstracting: (1<=p12)
states: 341,880 (5)
abstracting: (1<=p9)
states: 773,990 (5)
abstracting: (1<=p18)
states: 677,040 (5)
.abstracting: (1<=p15)
states: 341,880 (5)
abstracting: (1<=p17)
states: 509,460 (5)
abstracting: (1<=p16)
states: 509,460 (5)
abstracting: (1<=p2)
states: 173,451 (5)
abstracting: (p1<=0)
states: 1,014,533 (6)
.abstracting: (1<=p24)
states: 589,636 (5)
abstracting: (1<=p21)
states: 341,880 (5)
abstracting: (1<=p20)
states: 723,345 (5)
.abstracting: (1<=p7)
states: 589,636 (5)
abstracting: (1<=p3)
states: 1,125,696 (6)
abstracting: (p6<=0)
states: 598,348 (5)
.-> the formula is TRUE
FORMULA HouseConstruction-PT-00005-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.577sec
checking: EG [E [[A [1<=p8 U [[1<=p20 & [1<=p21 & 1<=p24]] | [1<=p2 | [1<=p3 & 1<=p7]]]] & [p8<=0 | 1<=p14]] U [[EX [1<=p18] | 1<=p18] | [EX [[[1<=p10 & 1<=p11] | [1<=p22 & 1<=p23]]] | EG [~ [[1<=p20 & [1<=p21 & 1<=p24]]]]]]]]
normalized: EG [E [[[p8<=0 | 1<=p14] & [~ [EG [~ [[[1<=p2 | [1<=p3 & 1<=p7]] | [1<=p20 & [1<=p21 & 1<=p24]]]]]] & ~ [E [~ [[[1<=p2 | [1<=p3 & 1<=p7]] | [1<=p20 & [1<=p21 & 1<=p24]]]] U [~ [1<=p8] & ~ [[[1<=p2 | [1<=p3 & 1<=p7]] | [1<=p20 & [1<=p21 & 1<=p24]]]]]]]]] U [[EG [~ [[1<=p20 & [1<=p21 & 1<=p24]]]] | EX [[[1<=p22 & 1<=p23] | [1<=p10 & 1<=p11]]]] | [1<=p18 | EX [1<=p18]]]]]
abstracting: (1<=p18)
states: 677,040 (5)
.abstracting: (1<=p18)
states: 677,040 (5)
abstracting: (1<=p11)
states: 441,406 (5)
abstracting: (1<=p10)
states: 574,280 (5)
abstracting: (1<=p23)
states: 509,460 (5)
abstracting: (1<=p22)
states: 677,040 (5)
.abstracting: (1<=p24)
states: 589,636 (5)
abstracting: (1<=p21)
states: 341,880 (5)
abstracting: (1<=p20)
states: 723,345 (5)
..................................................................................
EG iterations: 82
abstracting: (1<=p24)
states: 589,636 (5)
abstracting: (1<=p21)
states: 341,880 (5)
abstracting: (1<=p20)
states: 723,345 (5)
abstracting: (1<=p7)
states: 589,636 (5)
abstracting: (1<=p3)
states: 1,125,696 (6)
abstracting: (1<=p2)
states: 173,451 (5)
abstracting: (1<=p8)
states: 589,636 (5)
abstracting: (1<=p24)
states: 589,636 (5)
abstracting: (1<=p21)
states: 341,880 (5)
abstracting: (1<=p20)
states: 723,345 (5)
abstracting: (1<=p7)
states: 589,636 (5)
abstracting: (1<=p3)
states: 1,125,696 (6)
abstracting: (1<=p2)
states: 173,451 (5)
abstracting: (1<=p24)
states: 589,636 (5)
abstracting: (1<=p21)
states: 341,880 (5)
abstracting: (1<=p20)
states: 723,345 (5)
abstracting: (1<=p7)
states: 589,636 (5)
abstracting: (1<=p3)
states: 1,125,696 (6)
abstracting: (1<=p2)
states: 173,451 (5)
.........................................................
EG iterations: 57
abstracting: (1<=p14)
states: 341,880 (5)
abstracting: (p8<=0)
states: 598,348 (5)
.............
EG iterations: 13
-> the formula is FALSE
FORMULA HouseConstruction-PT-00005-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.843sec
checking: [EF [[1<=p18 | EX [A [[1<=p19 | 1<=p1] U [1<=p19 | [1<=p20 & [1<=p21 & 1<=p24]]]]]]] & E [A [~ [[[E [1<=p8 U 1<=p4] | EX [1<=p5]] & A [[1<=p20 & [1<=p21 & 1<=p24]] U 1<=p19]]] U EX [1<=p18]] U A [[AF [p0<=0] & AG [1<=p8]] U AX [[[[1<=p2 | [1<=p20 & [1<=p21 & 1<=p24]]] & 1<=p8] & [1<=p22 & 1<=p23]]]]]]
normalized: [E [[~ [EG [~ [EX [1<=p18]]]] & ~ [E [~ [EX [1<=p18]] U [[[~ [EG [~ [1<=p19]]] & ~ [E [~ [1<=p19] U [~ [[1<=p20 & [1<=p21 & 1<=p24]]] & ~ [1<=p19]]]]] & [EX [1<=p5] | E [1<=p8 U 1<=p4]]] & ~ [EX [1<=p18]]]]]] U [~ [EG [EX [~ [[[1<=p22 & 1<=p23] & [1<=p8 & [1<=p2 | [1<=p20 & [1<=p21 & 1<=p24]]]]]]]]] & ~ [E [EX [~ [[[1<=p22 & 1<=p23] & [1<=p8 & [1<=p2 | [1<=p20 & [1<=p21 & 1<=p24]]]]]]] U [~ [[~ [E [true U ~ [1<=p8]]] & ~ [EG [~ [p0<=0]]]]] & EX [~ [[[1<=p22 & 1<=p23] & [1<=p8 & [1<=p2 | [1<=p20 & [1<=p21 & 1<=p24]]]]]]]]]]]] & E [true U [1<=p18 | EX [[~ [EG [~ [[1<=p19 | [1<=p20 & [1<=p21 & 1<=p24]]]]]] & ~ [E [~ [[1<=p19 | [1<=p20 & [1<=p21 & 1<=p24]]]] U [~ [[1<=p19 | 1<=p1]] & ~ [[1<=p19 | [1<=p20 & [1<=p21 & 1<=p24]]]]]]]]]]]]
abstracting: (1<=p24)
states: 589,636 (5)
abstracting: (1<=p21)
states: 341,880 (5)
abstracting: (1<=p20)
states: 723,345 (5)
abstracting: (1<=p19)
states: 509,460 (5)
abstracting: (1<=p1)
states: 173,451 (5)
abstracting: (1<=p19)
states: 509,460 (5)
abstracting: (1<=p24)
states: 589,636 (5)
abstracting: (1<=p21)
states: 341,880 (5)
abstracting: (1<=p20)
states: 723,345 (5)
abstracting: (1<=p19)
states: 509,460 (5)
abstracting: (1<=p24)
states: 589,636 (5)
abstracting: (1<=p21)
states: 341,880 (5)
abstracting: (1<=p20)
states: 723,345 (5)
abstracting: (1<=p19)
states: 509,460 (5)
........................................................................
EG iterations: 72
.abstracting: (1<=p18)
states: 677,040 (5)
abstracting: (1<=p24)
states: 589,636 (5)
abstracting: (1<=p21)
states: 341,880 (5)
abstracting: (1<=p20)
states: 723,345 (5)
abstracting: (1<=p2)
states: 173,451 (5)
abstracting: (1<=p8)
states: 589,636 (5)
abstracting: (1<=p23)
states: 509,460 (5)
abstracting: (1<=p22)
states: 677,040 (5)
.abstracting: (p0<=0)
states: 1,014,533 (6)
..........................................................................
EG iterations: 74
abstracting: (1<=p8)
states: 589,636 (5)
abstracting: (1<=p24)
states: 589,636 (5)
abstracting: (1<=p21)
states: 341,880 (5)
abstracting: (1<=p20)
states: 723,345 (5)
abstracting: (1<=p2)
states: 173,451 (5)
abstracting: (1<=p8)
states: 589,636 (5)
abstracting: (1<=p23)
states: 509,460 (5)
abstracting: (1<=p22)
states: 677,040 (5)
.abstracting: (1<=p24)
states: 589,636 (5)
abstracting: (1<=p21)
states: 341,880 (5)
abstracting: (1<=p20)
states: 723,345 (5)
abstracting: (1<=p2)
states: 173,451 (5)
abstracting: (1<=p8)
states: 589,636 (5)
abstracting: (1<=p23)
states: 509,460 (5)
abstracting: (1<=p22)
states: 677,040 (5)
............................................................................................
EG iterations: 91
abstracting: (1<=p18)
states: 677,040 (5)
.abstracting: (1<=p4)
states: 291,996 (5)
abstracting: (1<=p8)
states: 589,636 (5)
abstracting: (1<=p5)
states: 441,406 (5)
.abstracting: (1<=p19)
states: 509,460 (5)
abstracting: (1<=p24)
states: 589,636 (5)
abstracting: (1<=p21)
states: 341,880 (5)
abstracting: (1<=p20)
states: 723,345 (5)
abstracting: (1<=p19)
states: 509,460 (5)
abstracting: (1<=p19)
states: 509,460 (5)
........................................................................
EG iterations: 72
abstracting: (1<=p18)
states: 677,040 (5)
.abstracting: (1<=p18)
states: 677,040 (5)
..........................................................
EG iterations: 57
-> the formula is TRUE
FORMULA HouseConstruction-PT-00005-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.423sec
totally nodes used: 6193524 (6.2e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 14567747 12717326 27285073
used/not used/entry size/cache size: 15836121 51272743 16 1024MB
basic ops cache: hits/miss/sum: 4776737 3966606 8743343
used/not used/entry size/cache size: 6320915 10456301 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: 82995 71173 154168
used/not used/entry size/cache size: 70947 8317661 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 61583724
1 4998299
2 434678
3 67210
4 16526
5 4511
6 1511
7 801
8 351
9 233
>= 10 1020
Total processing time: 0m18.746sec
BK_STOP 1678846108317
--------------------
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:343 (19), effective:90 (5)
initing FirstDep: 0m 0.000sec
iterations count:48 (2), effective:5 (0)
iterations count:50 (2), effective:10 (0)
iterations count:43 (2), effective:5 (0)
iterations count:20 (1), effective:1 (0)
iterations count:54 (3), effective:12 (0)
iterations count:168 (9), effective:45 (2)
iterations count:263 (14), effective:55 (3)
iterations count:28 (1), effective:5 (0)
iterations count:18 (1), effective:0 (0)
iterations count:28 (1), effective:5 (0)
iterations count:29 (1), effective:6 (0)
iterations count:18 (1), effective:0 (0)
iterations count:22 (1), effective:4 (0)
iterations count:22 (1), effective:4 (0)
iterations count:127 (7), effective:43 (2)
iterations count:22 (1), effective:4 (0)
iterations count:48 (2), effective:5 (0)
iterations count:18 (1), effective:0 (0)
iterations count:18 (1), effective:0 (0)
iterations count:48 (2), effective:9 (0)
iterations count:23 (1), effective:5 (0)
iterations count:33 (1), effective:5 (0)
iterations count:33 (1), effective:5 (0)
iterations count:33 (1), effective:5 (0)
iterations count:18 (1), effective:0 (0)
iterations count:48 (2), effective:9 (0)
iterations count:23 (1), effective:5 (0)
iterations count:18 (1), effective:0 (0)
iterations count:48 (2), effective:9 (0)
iterations count:23 (1), effective:5 (0)
iterations count:29 (1), effective:6 (0)
iterations count:29 (1), effective:6 (0)
iterations count:29 (1), effective:6 (0)
iterations count:18 (1), effective:0 (0)
iterations count:66 (3), effective:10 (0)
iterations count:28 (1), effective:5 (0)
iterations count:93 (5), effective:20 (1)
iterations count:43 (2), effective:5 (0)
iterations count:23 (1), effective:3 (0)
iterations count:63 (3), effective:25 (1)
iterations count:18 (1), effective:0 (0)
iterations count:147 (8), effective:23 (1)
iterations count:28 (1), effective:5 (0)
iterations count:63 (3), effective:14 (0)
iterations count:28 (1), effective:5 (0)
iterations count:18 (1), effective:0 (0)
iterations count:23 (1), effective:3 (0)
iterations count:38 (2), effective:5 (0)
iterations count:23 (1), effective:3 (0)
iterations count:227 (12), effective:64 (3)
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-00005"
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-00005, 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-167840348800522"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HouseConstruction-PT-00005.tgz
mv HouseConstruction-PT-00005 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;