About the Execution of Marcie+red for ResAllocation-PT-R003C015
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5714.804 | 12266.00 | 17300.00 | 350.70 | FFFTFTTFFFTFFTFF | 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.r330-tall-167889203600698.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 ResAllocation-PT-R003C015, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-167889203600698
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 6.8K Feb 25 15:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 15:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 15:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 25 15:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 15:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 25 15:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 9 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 107K Mar 5 18:23 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 ResAllocation-PT-R003C015-CTLFireability-00
FORMULA_NAME ResAllocation-PT-R003C015-CTLFireability-01
FORMULA_NAME ResAllocation-PT-R003C015-CTLFireability-02
FORMULA_NAME ResAllocation-PT-R003C015-CTLFireability-03
FORMULA_NAME ResAllocation-PT-R003C015-CTLFireability-04
FORMULA_NAME ResAllocation-PT-R003C015-CTLFireability-05
FORMULA_NAME ResAllocation-PT-R003C015-CTLFireability-06
FORMULA_NAME ResAllocation-PT-R003C015-CTLFireability-07
FORMULA_NAME ResAllocation-PT-R003C015-CTLFireability-08
FORMULA_NAME ResAllocation-PT-R003C015-CTLFireability-09
FORMULA_NAME ResAllocation-PT-R003C015-CTLFireability-10
FORMULA_NAME ResAllocation-PT-R003C015-CTLFireability-11
FORMULA_NAME ResAllocation-PT-R003C015-CTLFireability-12
FORMULA_NAME ResAllocation-PT-R003C015-CTLFireability-13
FORMULA_NAME ResAllocation-PT-R003C015-CTLFireability-14
FORMULA_NAME ResAllocation-PT-R003C015-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679180862009
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=ResAllocation-PT-R003C015
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 23:07:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 23:07:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 23:07:43] [INFO ] Load time of PNML (sax parser for PT used): 48 ms
[2023-03-18 23:07:43] [INFO ] Transformed 90 places.
[2023-03-18 23:07:43] [INFO ] Transformed 60 transitions.
[2023-03-18 23:07:43] [INFO ] Parsed PT model containing 90 places and 60 transitions and 264 arcs in 108 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Support contains 84 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 60/60 transitions.
Applied a total of 0 rules in 10 ms. Remains 90 /90 variables (removed 0) and now considering 60/60 (removed 0) transitions.
// Phase 1: matrix 60 rows 90 cols
[2023-03-18 23:07:43] [INFO ] Computed 45 place invariants in 12 ms
[2023-03-18 23:07:44] [INFO ] Implicit Places using invariants in 401 ms returned []
[2023-03-18 23:07:44] [INFO ] Invariant cache hit.
[2023-03-18 23:07:44] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 506 ms to find 0 implicit places.
[2023-03-18 23:07:44] [INFO ] Invariant cache hit.
[2023-03-18 23:07:44] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 580 ms. Remains : 90/90 places, 60/60 transitions.
Support contains 84 out of 90 places after structural reductions.
[2023-03-18 23:07:44] [INFO ] Flatten gal took : 26 ms
[2023-03-18 23:07:44] [INFO ] Flatten gal took : 11 ms
[2023-03-18 23:07:44] [INFO ] Input system was already deterministic with 60 transitions.
Incomplete random walk after 10000 steps, including 293 resets, run finished after 392 ms. (steps per millisecond=25 ) properties (out of 68) seen :62
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-18 23:07:45] [INFO ] Invariant cache hit.
[2023-03-18 23:07:45] [INFO ] [Real]Absence check using 45 positive place invariants in 6 ms returned sat
[2023-03-18 23:07:45] [INFO ] After 36ms SMT Verify possible using state equation in real domain returned unsat :3 sat :1 real:1
[2023-03-18 23:07:45] [INFO ] After 48ms SMT Verify possible using trap constraints in real domain returned unsat :3 sat :0 real:2
[2023-03-18 23:07:45] [INFO ] After 128ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:2
[2023-03-18 23:07:45] [INFO ] [Nat]Absence check using 45 positive place invariants in 6 ms returned sat
[2023-03-18 23:07:45] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :2
[2023-03-18 23:07:45] [INFO ] After 43ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :2
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-18 23:07:45] [INFO ] After 110ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :2
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 60/60 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 21 rules applied. Total rules applied 21 place count 79 transition count 50
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 79 transition count 49
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 77 transition count 49
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 77 transition count 48
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 27 place count 76 transition count 47
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 2 with 14 rules applied. Total rules applied 41 place count 76 transition count 33
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t5.t4 and 2 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 43 place count 42 transition count 31
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 21 rules applied. Total rules applied 64 place count 29 transition count 23
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 72 place count 29 transition count 15
Ensure Unique test removed 6 places
Iterating post reduction 4 with 6 rules applied. Total rules applied 78 place count 23 transition count 15
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 78 place count 23 transition count 12
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 9 rules applied. Total rules applied 87 place count 17 transition count 12
Applied a total of 87 rules in 28 ms. Remains 17 /90 variables (removed 73) and now considering 12/60 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 17/90 places, 12/60 transitions.
Finished random walk after 110 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=110 )
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2023-03-18 23:07:45] [INFO ] Flatten gal took : 6 ms
[2023-03-18 23:07:45] [INFO ] Flatten gal took : 8 ms
[2023-03-18 23:07:45] [INFO ] Input system was already deterministic with 60 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 90/90 places, 60/60 transitions.
[2023-03-18 23:07:45] [INFO ] Flatten gal took : 6 ms
[2023-03-18 23:07:45] [INFO ] Flatten gal took : 6 ms
[2023-03-18 23:07:45] [INFO ] Input system was already deterministic with 60 transitions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 90/90 places, 60/60 transitions.
[2023-03-18 23:07:45] [INFO ] Flatten gal took : 5 ms
[2023-03-18 23:07:45] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:07:45] [INFO ] Input system was already deterministic with 60 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 90/90 places, 60/60 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 29 rules applied. Total rules applied 29 place count 75 transition count 46
Applied a total of 29 rules in 7 ms. Remains 75 /90 variables (removed 15) and now considering 46/60 (removed 14) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 75/90 places, 46/60 transitions.
[2023-03-18 23:07:45] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:07:45] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:07:45] [INFO ] Input system was already deterministic with 46 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 90/90 places, 60/60 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 84 transition count 54
Applied a total of 12 rules in 6 ms. Remains 84 /90 variables (removed 6) and now considering 54/60 (removed 6) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 84/90 places, 54/60 transitions.
[2023-03-18 23:07:45] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:07:45] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:07:45] [INFO ] Input system was already deterministic with 54 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 90/90 places, 60/60 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 23 rules applied. Total rules applied 23 place count 78 transition count 49
Applied a total of 23 rules in 6 ms. Remains 78 /90 variables (removed 12) and now considering 49/60 (removed 11) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 78/90 places, 49/60 transitions.
[2023-03-18 23:07:45] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:07:45] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:07:45] [INFO ] Input system was already deterministic with 49 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 90/90 places, 60/60 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 27 rules applied. Total rules applied 27 place count 76 transition count 47
Applied a total of 27 rules in 7 ms. Remains 76 /90 variables (removed 14) and now considering 47/60 (removed 13) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 76/90 places, 47/60 transitions.
[2023-03-18 23:07:45] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:07:45] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:07:45] [INFO ] Input system was already deterministic with 47 transitions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 90/90 places, 60/60 transitions.
[2023-03-18 23:07:45] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:07:45] [INFO ] Flatten gal took : 5 ms
[2023-03-18 23:07:45] [INFO ] Input system was already deterministic with 60 transitions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 90/90 places, 60/60 transitions.
[2023-03-18 23:07:45] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:07:45] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:07:45] [INFO ] Input system was already deterministic with 60 transitions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 60/60 transitions.
Applied a total of 0 rules in 1 ms. Remains 90 /90 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 90/90 places, 60/60 transitions.
[2023-03-18 23:07:45] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:07:45] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:07:45] [INFO ] Input system was already deterministic with 60 transitions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 60/60 transitions.
Applied a total of 0 rules in 1 ms. Remains 90 /90 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 90/90 places, 60/60 transitions.
[2023-03-18 23:07:45] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:07:45] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:07:45] [INFO ] Input system was already deterministic with 60 transitions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 90/90 places, 60/60 transitions.
[2023-03-18 23:07:45] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:07:45] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:07:45] [INFO ] Input system was already deterministic with 60 transitions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 60/60 transitions.
Applied a total of 0 rules in 1 ms. Remains 90 /90 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 90/90 places, 60/60 transitions.
[2023-03-18 23:07:45] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:07:45] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:07:45] [INFO ] Input system was already deterministic with 60 transitions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 60/60 transitions.
Applied a total of 0 rules in 1 ms. Remains 90 /90 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 90/90 places, 60/60 transitions.
[2023-03-18 23:07:45] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:07:45] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:07:45] [INFO ] Input system was already deterministic with 60 transitions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 60/60 transitions.
Applied a total of 0 rules in 1 ms. Remains 90 /90 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 90/90 places, 60/60 transitions.
[2023-03-18 23:07:45] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:07:45] [INFO ] Flatten gal took : 5 ms
[2023-03-18 23:07:45] [INFO ] Input system was already deterministic with 60 transitions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 60/60 transitions.
Applied a total of 0 rules in 1 ms. Remains 90 /90 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 90/90 places, 60/60 transitions.
[2023-03-18 23:07:45] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:07:45] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:07:45] [INFO ] Input system was already deterministic with 60 transitions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 60/60 transitions.
Applied a total of 0 rules in 1 ms. Remains 90 /90 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 90/90 places, 60/60 transitions.
[2023-03-18 23:07:45] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:07:45] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:07:45] [INFO ] Input system was already deterministic with 60 transitions.
[2023-03-18 23:07:45] [INFO ] Flatten gal took : 5 ms
[2023-03-18 23:07:45] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:07:45] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-18 23:07:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 90 places, 60 transitions and 264 arcs took 1 ms.
Total runtime 2415 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: 90 NrTr: 60 NrArc: 264)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.751sec
RS generation: 0m 0.006sec
-> reachability set: #nodes 586 (5.9e+02) #states 578,878,464 (8)
starting MCC model checker
--------------------------
checking: EF [AG [[p29<=0 | p35<=0]]]
normalized: E [true U ~ [E [true U ~ [[p29<=0 | p35<=0]]]]]
abstracting: (p35<=0)
states: 299,449,344 (8)
abstracting: (p29<=0)
states: 303,357,952 (8)
-> the formula is TRUE
FORMULA ResAllocation-PT-R003C015-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.025sec
checking: AF [EX [[1<=p47 & [1<=p50 & 1<=p53]]]]
normalized: ~ [EG [~ [EX [[[1<=p50 & 1<=p53] & 1<=p47]]]]]
abstracting: (1<=p47)
states: 277,919,232 (8)
abstracting: (1<=p53)
states: 279,429,120 (8)
abstracting: (1<=p50)
states: 151,635,968 (8)
......................
EG iterations: 21
-> the formula is FALSE
FORMULA ResAllocation-PT-R003C015-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.094sec
checking: E [[1<=p81 & [1<=p84 & 1<=p87]] U EX [~ [EF [1<=p4]]]]
normalized: E [[[1<=p84 & 1<=p87] & 1<=p81] U EX [~ [E [true U 1<=p4]]]]
abstracting: (1<=p4)
states: 168,312,832 (8)
.abstracting: (1<=p81)
states: 250,671,616 (8)
abstracting: (1<=p87)
states: 350,884,864 (8)
abstracting: (1<=p84)
states: 266,761,216 (8)
-> the formula is FALSE
FORMULA ResAllocation-PT-R003C015-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.034sec
checking: EG [AF [AG [EF [[[1<=p27 & [1<=p33 & 1<=p34]] | [1<=p47 & [1<=p50 & 1<=p53]]]]]]]
normalized: EG [~ [EG [E [true U ~ [E [true U [[[1<=p50 & 1<=p53] & 1<=p47] | [[1<=p33 & 1<=p34] & 1<=p27]]]]]]]]
abstracting: (1<=p27)
states: 278,065,664 (8)
abstracting: (1<=p34)
states: 221,420,544 (8)
abstracting: (1<=p33)
states: 283,005,952 (8)
abstracting: (1<=p47)
states: 277,919,232 (8)
abstracting: (1<=p53)
states: 279,429,120 (8)
abstracting: (1<=p50)
states: 151,635,968 (8)
EG iterations: 0
.
EG iterations: 1
-> the formula is FALSE
FORMULA ResAllocation-PT-R003C015-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.041sec
checking: EX [EG [[[AF [E [[1<=p67 & 1<=p73] U [1<=p81 & [1<=p84 & 1<=p87]]]] & 1<=p69] & [1<=p72 & 1<=p75]]]]
normalized: EX [EG [[[1<=p72 & 1<=p75] & [~ [EG [~ [E [[1<=p67 & 1<=p73] U [[1<=p84 & 1<=p87] & 1<=p81]]]]] & 1<=p69]]]]
abstracting: (1<=p69)
states: 270,111,744 (8)
abstracting: (1<=p81)
states: 250,671,616 (8)
abstracting: (1<=p87)
states: 350,884,864 (8)
abstracting: (1<=p84)
states: 266,761,216 (8)
abstracting: (1<=p73)
states: 293,114,880 (8)
abstracting: (1<=p67)
states: 272,586,752 (8)
.....................
EG iterations: 21
abstracting: (1<=p75)
states: 304,235,008 (8)
abstracting: (1<=p72)
states: 240,407,552 (8)
.......................
EG iterations: 23
.-> the formula is FALSE
FORMULA ResAllocation-PT-R003C015-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.090sec
checking: EX [A [AG [[~ [[1<=p49 & [1<=p55 & 1<=p56]]] | [[1<=p31 & 1<=p37] | [[1<=p71 & 1<=p74] & [1<=p77 & [1<=p2 & 1<=p5]]]]]] U EG [AG [[1<=p25 & [1<=p31 & 1<=p32]]]]]]
normalized: EX [[~ [EG [~ [EG [~ [E [true U ~ [[[1<=p31 & 1<=p32] & 1<=p25]]]]]]]] & ~ [E [~ [EG [~ [E [true U ~ [[[1<=p31 & 1<=p32] & 1<=p25]]]]]] U [E [true U ~ [[[[[[1<=p2 & 1<=p5] & 1<=p77] & [1<=p71 & 1<=p74]] | [1<=p31 & 1<=p37]] | ~ [[[1<=p55 & 1<=p56] & 1<=p49]]]]] & ~ [EG [~ [E [true U ~ [[[1<=p31 & 1<=p32] & 1<=p25]]]]]]]]]]]
abstracting: (1<=p25)
states: 276,522,496 (8)
abstracting: (1<=p32)
states: 144,236,544 (8)
abstracting: (1<=p31)
states: 279,715,840 (8)
.
EG iterations: 1
abstracting: (1<=p49)
states: 279,715,840 (8)
abstracting: (1<=p56)
states: 144,236,544 (8)
abstracting: (1<=p55)
states: 276,522,496 (8)
abstracting: (1<=p37)
states: 278,227,968 (8)
abstracting: (1<=p31)
states: 279,715,840 (8)
abstracting: (1<=p74)
states: 174,430,208 (8)
abstracting: (1<=p71)
states: 267,206,656 (8)
abstracting: (1<=p77)
states: 300,168,704 (8)
abstracting: (1<=p5)
states: 229,758,464 (8)
abstracting: (1<=p2)
states: 227,993,600 (8)
abstracting: (1<=p25)
states: 276,522,496 (8)
abstracting: (1<=p32)
states: 144,236,544 (8)
abstracting: (1<=p31)
states: 279,715,840 (8)
.
EG iterations: 1
abstracting: (1<=p25)
states: 276,522,496 (8)
abstracting: (1<=p32)
states: 144,236,544 (8)
abstracting: (1<=p31)
states: 279,715,840 (8)
.
EG iterations: 1
EG iterations: 0
.-> the formula is FALSE
FORMULA ResAllocation-PT-R003C015-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.026sec
checking: [EX [AX [E [1<=p30 U ~ [[1<=p2 & 1<=p5]]]]] & AX [E [[[1<=p9 & [1<=p12 & 1<=p15]] | AX [AX [[1<=p35 & [1<=p38 & 1<=p41]]]]] U [[1<=p43 & 1<=p49] | EG [[1<=p41 & 1<=p47]]]]]]
normalized: [~ [EX [~ [E [[~ [EX [EX [~ [[[1<=p38 & 1<=p41] & 1<=p35]]]]] | [[1<=p12 & 1<=p15] & 1<=p9]] U [EG [[1<=p41 & 1<=p47]] | [1<=p43 & 1<=p49]]]]]] & EX [~ [EX [~ [E [1<=p30 U ~ [[1<=p2 & 1<=p5]]]]]]]]
abstracting: (1<=p5)
states: 229,758,464 (8)
abstracting: (1<=p2)
states: 227,993,600 (8)
abstracting: (1<=p30)
states: 72,609,792 (7)
..abstracting: (1<=p49)
states: 279,715,840 (8)
abstracting: (1<=p43)
states: 278,227,968 (8)
abstracting: (1<=p47)
states: 277,919,232 (8)
abstracting: (1<=p41)
states: 277,919,232 (8)
...........................
EG iterations: 27
abstracting: (1<=p9)
states: 304,235,008 (8)
abstracting: (1<=p15)
states: 270,111,744 (8)
abstracting: (1<=p12)
states: 240,407,552 (8)
abstracting: (1<=p35)
states: 279,429,120 (8)
abstracting: (1<=p41)
states: 277,919,232 (8)
abstracting: (1<=p38)
states: 151,635,968 (8)
...-> the formula is TRUE
FORMULA ResAllocation-PT-R003C015-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.214sec
checking: AX [EX [E [[AG [1<=p78] | [E [[1<=p35 & [1<=p38 & 1<=p41]] U [1<=p75 & [1<=p81 & 1<=p82]]] & AF [[1<=p33 & [1<=p36 & 1<=p39]]]]] U ~ [[p47<=0 | [p50<=0 | p53<=0]]]]]]
normalized: ~ [EX [~ [EX [E [[[~ [EG [~ [[1<=p33 & [1<=p36 & 1<=p39]]]]] & E [[1<=p35 & [1<=p38 & 1<=p41]] U [1<=p75 & [1<=p81 & 1<=p82]]]] | ~ [E [true U ~ [1<=p78]]]] U ~ [[p47<=0 | [p50<=0 | p53<=0]]]]]]]]
abstracting: (p53<=0)
states: 299,449,344 (8)
abstracting: (p50<=0)
states: 427,242,496 (8)
abstracting: (p47<=0)
states: 300,959,232 (8)
abstracting: (1<=p78)
states: 45,356,032 (7)
abstracting: (1<=p82)
states: 180,807,168 (8)
abstracting: (1<=p81)
states: 250,671,616 (8)
abstracting: (1<=p75)
states: 304,235,008 (8)
abstracting: (1<=p41)
states: 277,919,232 (8)
abstracting: (1<=p38)
states: 151,635,968 (8)
abstracting: (1<=p35)
states: 279,429,120 (8)
abstracting: (1<=p39)
states: 280,910,336 (8)
abstracting: (1<=p36)
states: 226,552,832 (8)
abstracting: (1<=p33)
states: 283,005,952 (8)
.....................
EG iterations: 21
..-> the formula is FALSE
FORMULA ResAllocation-PT-R003C015-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.104sec
checking: [E [AF [EX [~ [[1<=p25 & [1<=p31 & 1<=p32]]]]] U AX [AG [A [[1<=p21 & [1<=p24 & 1<=p27]] U 1<=p16]]]] & EF [[EX [[AX [[p1<=0 | [p7<=0 | p8<=0]]] & [[p11<=0 | [p14<=0 | p17<=0]] & p4<=0]]] & AX [p40<=0]]]]
normalized: [E [true U [~ [EX [~ [p40<=0]]] & EX [[[p4<=0 & [p11<=0 | [p14<=0 | p17<=0]]] & ~ [EX [~ [[p1<=0 | [p7<=0 | p8<=0]]]]]]]]] & E [~ [EG [~ [EX [~ [[[1<=p31 & 1<=p32] & 1<=p25]]]]]] U ~ [EX [E [true U ~ [[~ [EG [~ [1<=p16]]] & ~ [E [~ [1<=p16] U [~ [[[1<=p24 & 1<=p27] & 1<=p21]] & ~ [1<=p16]]]]]]]]]]]
abstracting: (1<=p16)
states: 97,902,592 (7)
abstracting: (1<=p21)
states: 287,965,696 (8)
abstracting: (1<=p27)
states: 278,065,664 (8)
abstracting: (1<=p24)
states: 229,746,176 (8)
abstracting: (1<=p16)
states: 97,902,592 (7)
abstracting: (1<=p16)
states: 97,902,592 (7)
.
EG iterations: 1
.abstracting: (1<=p25)
states: 276,522,496 (8)
abstracting: (1<=p32)
states: 144,236,544 (8)
abstracting: (1<=p31)
states: 279,715,840 (8)
...
EG iterations: 2
abstracting: (p8<=0)
states: 478,665,216 (8)
abstracting: (p7<=0)
states: 285,763,584 (8)
abstracting: (p1<=0)
states: 312,117,248 (8)
.abstracting: (p17<=0)
states: 311,671,808 (8)
abstracting: (p14<=0)
states: 404,448,256 (8)
abstracting: (p11<=0)
states: 278,709,760 (8)
abstracting: (p4<=0)
states: 410,565,632 (8)
.abstracting: (p40<=0)
states: 500,849,664 (8)
.-> the formula is TRUE
FORMULA ResAllocation-PT-R003C015-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.093sec
checking: A [[EF [EX [[[EX [1<=p88] & [1<=p57 & 1<=p60]] & [1<=p63 & [1<=p49 & 1<=p43]]]]] | [1<=p43 & 1<=p49]] U AG [A [~ [AX [[1<=p75 & [1<=p81 & 1<=p82]]]] U EF [[1<=p88 | [1<=p73 & [1<=p79 & 1<=p80]]]]]]]
normalized: [~ [EG [E [true U ~ [[~ [EG [~ [E [true U [1<=p88 | [1<=p73 & [1<=p79 & 1<=p80]]]]]]] & ~ [E [~ [E [true U [1<=p88 | [1<=p73 & [1<=p79 & 1<=p80]]]]] U [~ [EX [~ [[1<=p75 & [1<=p81 & 1<=p82]]]]] & ~ [E [true U [1<=p88 | [1<=p73 & [1<=p79 & 1<=p80]]]]]]]]]]]]] & ~ [E [E [true U ~ [[~ [EG [~ [E [true U [1<=p88 | [1<=p73 & [1<=p79 & 1<=p80]]]]]]] & ~ [E [~ [E [true U [1<=p88 | [1<=p73 & [1<=p79 & 1<=p80]]]]] U [~ [EX [~ [[1<=p75 & [1<=p81 & 1<=p82]]]]] & ~ [E [true U [1<=p88 | [1<=p73 & [1<=p79 & 1<=p80]]]]]]]]]]] U [~ [[[1<=p43 & 1<=p49] | E [true U EX [[[1<=p63 & [1<=p49 & 1<=p43]] & [[1<=p57 & 1<=p60] & EX [1<=p88]]]]]]] & E [true U ~ [[~ [EG [~ [E [true U [1<=p88 | [1<=p73 & [1<=p79 & 1<=p80]]]]]]] & ~ [E [~ [E [true U [1<=p88 | [1<=p73 & [1<=p79 & 1<=p80]]]]] U [~ [EX [~ [[1<=p75 & [1<=p81 & 1<=p82]]]]] & ~ [E [true U [1<=p88 | [1<=p73 & [1<=p79 & 1<=p80]]]]]]]]]]]]]]]
abstracting: (1<=p80)
states: 100,213,248 (8)
abstracting: (1<=p79)
states: 266,761,216 (8)
abstracting: (1<=p73)
states: 293,114,880 (8)
abstracting: (1<=p88)
states: 168,312,832 (8)
abstracting: (1<=p82)
states: 180,807,168 (8)
abstracting: (1<=p81)
states: 250,671,616 (8)
abstracting: (1<=p75)
states: 304,235,008 (8)
.abstracting: (1<=p80)
states: 100,213,248 (8)
abstracting: (1<=p79)
states: 266,761,216 (8)
abstracting: (1<=p73)
states: 293,114,880 (8)
abstracting: (1<=p88)
states: 168,312,832 (8)
abstracting: (1<=p80)
states: 100,213,248 (8)
abstracting: (1<=p79)
states: 266,761,216 (8)
abstracting: (1<=p73)
states: 293,114,880 (8)
abstracting: (1<=p88)
states: 168,312,832 (8)
.
EG iterations: 1
abstracting: (1<=p88)
states: 168,312,832 (8)
.abstracting: (1<=p60)
states: 229,746,176 (8)
abstracting: (1<=p57)
states: 278,065,664 (8)
abstracting: (1<=p43)
states: 278,227,968 (8)
abstracting: (1<=p49)
states: 279,715,840 (8)
abstracting: (1<=p63)
states: 287,965,696 (8)
.abstracting: (1<=p49)
states: 279,715,840 (8)
abstracting: (1<=p43)
states: 278,227,968 (8)
abstracting: (1<=p80)
states: 100,213,248 (8)
abstracting: (1<=p79)
states: 266,761,216 (8)
abstracting: (1<=p73)
states: 293,114,880 (8)
abstracting: (1<=p88)
states: 168,312,832 (8)
abstracting: (1<=p82)
states: 180,807,168 (8)
abstracting: (1<=p81)
states: 250,671,616 (8)
abstracting: (1<=p75)
states: 304,235,008 (8)
.abstracting: (1<=p80)
states: 100,213,248 (8)
abstracting: (1<=p79)
states: 266,761,216 (8)
abstracting: (1<=p73)
states: 293,114,880 (8)
abstracting: (1<=p88)
states: 168,312,832 (8)
abstracting: (1<=p80)
states: 100,213,248 (8)
abstracting: (1<=p79)
states: 266,761,216 (8)
abstracting: (1<=p73)
states: 293,114,880 (8)
abstracting: (1<=p88)
states: 168,312,832 (8)
.
EG iterations: 1
abstracting: (1<=p80)
states: 100,213,248 (8)
abstracting: (1<=p79)
states: 266,761,216 (8)
abstracting: (1<=p73)
states: 293,114,880 (8)
abstracting: (1<=p88)
states: 168,312,832 (8)
abstracting: (1<=p82)
states: 180,807,168 (8)
abstracting: (1<=p81)
states: 250,671,616 (8)
abstracting: (1<=p75)
states: 304,235,008 (8)
.abstracting: (1<=p80)
states: 100,213,248 (8)
abstracting: (1<=p79)
states: 266,761,216 (8)
abstracting: (1<=p73)
states: 293,114,880 (8)
abstracting: (1<=p88)
states: 168,312,832 (8)
abstracting: (1<=p80)
states: 100,213,248 (8)
abstracting: (1<=p79)
states: 266,761,216 (8)
abstracting: (1<=p73)
states: 293,114,880 (8)
abstracting: (1<=p88)
states: 168,312,832 (8)
.
EG iterations: 1
EG iterations: 0
-> the formula is FALSE
FORMULA ResAllocation-PT-R003C015-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.040sec
checking: EF [EG [E [[[1<=p35 & [1<=p38 & 1<=p41]] | [EG [[1<=p57 & [1<=p60 & 1<=p63]]] & [[1<=p81 & [1<=p84 & 1<=p87]] | [1<=p47 & [1<=p50 & 1<=p53]]]]] U [AG [1<=p54] & [EF [1<=p76] | [[1<=p33 & 1<=p36] & [1<=p39 & 1<=p76]]]]]]]
normalized: E [true U EG [E [[[[[1<=p47 & [1<=p50 & 1<=p53]] | [1<=p81 & [1<=p84 & 1<=p87]]] & EG [[1<=p57 & [1<=p60 & 1<=p63]]]] | [1<=p35 & [1<=p38 & 1<=p41]]] U [[[[1<=p39 & 1<=p76] & [1<=p33 & 1<=p36]] | E [true U 1<=p76]] & ~ [E [true U ~ [1<=p54]]]]]]]
abstracting: (1<=p54)
states: 72,609,792 (7)
abstracting: (1<=p76)
states: 97,902,592 (7)
abstracting: (1<=p36)
states: 226,552,832 (8)
abstracting: (1<=p33)
states: 283,005,952 (8)
abstracting: (1<=p76)
states: 97,902,592 (7)
abstracting: (1<=p39)
states: 280,910,336 (8)
abstracting: (1<=p41)
states: 277,919,232 (8)
abstracting: (1<=p38)
states: 151,635,968 (8)
abstracting: (1<=p35)
states: 279,429,120 (8)
abstracting: (1<=p63)
states: 287,965,696 (8)
abstracting: (1<=p60)
states: 229,746,176 (8)
abstracting: (1<=p57)
states: 278,065,664 (8)
........................
EG iterations: 24
abstracting: (1<=p87)
states: 350,884,864 (8)
abstracting: (1<=p84)
states: 266,761,216 (8)
abstracting: (1<=p81)
states: 250,671,616 (8)
abstracting: (1<=p53)
states: 279,429,120 (8)
abstracting: (1<=p50)
states: 151,635,968 (8)
abstracting: (1<=p47)
states: 277,919,232 (8)
.
EG iterations: 1
-> the formula is FALSE
FORMULA ResAllocation-PT-R003C015-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.051sec
checking: [AX [[EG [[EX [[1<=p49 & [1<=p55 & 1<=p56]]] | [AF [1<=p52] | [1<=p77 & 1<=p83]]]] & [AF [[[p9<=0 | [p12<=0 | p15<=0]] & [p37<=0 | [p43<=0 | p44<=0]]]] | [AG [[p39<=0 | [p45<=0 | p46<=0]]] & 1<=p6]]]] | EF [AG [[p79<=0 | p85<=0]]]]
normalized: [E [true U ~ [E [true U ~ [[p79<=0 | p85<=0]]]]] | ~ [EX [~ [[[[1<=p6 & ~ [E [true U ~ [[p39<=0 | [p45<=0 | p46<=0]]]]]] | ~ [EG [~ [[[p37<=0 | [p43<=0 | p44<=0]] & [p9<=0 | [p12<=0 | p15<=0]]]]]]] & EG [[[[1<=p77 & 1<=p83] | ~ [EG [~ [1<=p52]]]] | EX [[1<=p49 & [1<=p55 & 1<=p56]]]]]]]]]]
abstracting: (1<=p56)
states: 144,236,544 (8)
abstracting: (1<=p55)
states: 276,522,496 (8)
abstracting: (1<=p49)
states: 279,715,840 (8)
.abstracting: (1<=p52)
states: 78,028,800 (7)
.
EG iterations: 1
abstracting: (1<=p83)
states: 229,758,464 (8)
abstracting: (1<=p77)
states: 300,168,704 (8)
.............................
EG iterations: 29
abstracting: (p15<=0)
states: 308,766,720 (8)
abstracting: (p12<=0)
states: 338,470,912 (8)
abstracting: (p9<=0)
states: 274,643,456 (8)
abstracting: (p44<=0)
states: 432,546,304 (8)
abstracting: (p43<=0)
states: 300,650,496 (8)
abstracting: (p37<=0)
states: 300,650,496 (8)
.......................
EG iterations: 23
abstracting: (p46<=0)
states: 355,948,032 (8)
abstracting: (p45<=0)
states: 297,968,128 (8)
abstracting: (p39<=0)
states: 297,968,128 (8)
abstracting: (1<=p6)
states: 45,356,032 (7)
.abstracting: (p85<=0)
states: 266,761,216 (8)
abstracting: (p79<=0)
states: 312,117,248 (8)
-> the formula is TRUE
FORMULA ResAllocation-PT-R003C015-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.347sec
checking: E [EG [~ [[1<=p76 & [1<=p54 & p18<=0]]]] U AF [[[~ [E [[1<=p69 & [1<=p72 & 1<=p75]] U [1<=p33 & [1<=p36 & 1<=p39]]]] & AG [AX [[1<=p53 & 1<=p59]]]] & [1<=p31 & [1<=p37 & [~ [[1<=p83 & [1<=p86 & 1<=p89]]] | [[AG [[1<=p5 & 1<=p11]] & [1<=p40 & 1<=p78]] | [1<=p53 & 1<=p59]]]]]]]]
normalized: E [EG [~ [[1<=p76 & [1<=p54 & p18<=0]]]] U ~ [EG [~ [[[1<=p31 & [1<=p37 & [[[1<=p53 & 1<=p59] | [[1<=p40 & 1<=p78] & ~ [E [true U ~ [[1<=p5 & 1<=p11]]]]]] | ~ [[1<=p83 & [1<=p86 & 1<=p89]]]]]] & [~ [E [true U EX [~ [[1<=p53 & 1<=p59]]]]] & ~ [E [[1<=p69 & [1<=p72 & 1<=p75]] U [1<=p33 & [1<=p36 & 1<=p39]]]]]]]]]]
abstracting: (1<=p39)
states: 280,910,336 (8)
abstracting: (1<=p36)
states: 226,552,832 (8)
abstracting: (1<=p33)
states: 283,005,952 (8)
abstracting: (1<=p75)
states: 304,235,008 (8)
abstracting: (1<=p72)
states: 240,407,552 (8)
abstracting: (1<=p69)
states: 270,111,744 (8)
abstracting: (1<=p59)
states: 275,520,512 (8)
abstracting: (1<=p53)
states: 279,429,120 (8)
.abstracting: (1<=p89)
states: 410,565,632 (8)
abstracting: (1<=p86)
states: 227,993,600 (8)
abstracting: (1<=p83)
states: 229,758,464 (8)
abstracting: (1<=p11)
states: 300,168,704 (8)
abstracting: (1<=p5)
states: 229,758,464 (8)
abstracting: (1<=p78)
states: 45,356,032 (7)
abstracting: (1<=p40)
states: 78,028,800 (7)
abstracting: (1<=p59)
states: 275,520,512 (8)
abstracting: (1<=p53)
states: 279,429,120 (8)
abstracting: (1<=p37)
states: 278,227,968 (8)
abstracting: (1<=p31)
states: 279,715,840 (8)
EG iterations: 0
abstracting: (p18<=0)
states: 512,994,304 (8)
abstracting: (1<=p54)
states: 72,609,792 (7)
abstracting: (1<=p76)
states: 97,902,592 (7)
.
EG iterations: 1
-> the formula is FALSE
FORMULA ResAllocation-PT-R003C015-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.025sec
checking: [E [~ [[[[1<=p4 & [1<=p41 & 1<=p47]] | [[1<=p37 & [1<=p43 & 1<=p44]] | ~ [[1<=p17 & [1<=p23 & 1<=p6]]]]] & [[[1<=p27 & 1<=p33] & [1<=p34 & [[1<=p27 & [1<=p33 & 1<=p34]] | [1<=p3 & [1<=p9 & 1<=p10]]]]] | [1<=p15 & [1<=p21 & 1<=p22]]]]] U EG [[[1<=p3 & 1<=p9] & [1<=p10 & 1<=p1]]]] & EG [[[[[[1<=p0 & 1<=p3] | [1<=p71 & [1<=p74 & 1<=p77]]] & 1<=p15] & [1<=p21 & 1<=p22]] | AF [~ [A [1<=p88 U 1<=p42]]]]]]
normalized: [EG [[~ [EG [[~ [EG [~ [1<=p42]]] & ~ [E [~ [1<=p42] U [~ [1<=p88] & ~ [1<=p42]]]]]]] | [[1<=p21 & 1<=p22] & [1<=p15 & [[1<=p71 & [1<=p74 & 1<=p77]] | [1<=p0 & 1<=p3]]]]]] & E [~ [[[[1<=p15 & [1<=p21 & 1<=p22]] | [[1<=p34 & [[1<=p3 & [1<=p9 & 1<=p10]] | [1<=p27 & [1<=p33 & 1<=p34]]]] & [1<=p27 & 1<=p33]]] & [[~ [[1<=p17 & [1<=p23 & 1<=p6]]] | [1<=p37 & [1<=p43 & 1<=p44]]] | [1<=p4 & [1<=p41 & 1<=p47]]]]] U EG [[[1<=p10 & 1<=p1] & [1<=p3 & 1<=p9]]]]]
abstracting: (1<=p9)
states: 304,235,008 (8)
abstracting: (1<=p3)
states: 250,671,616 (8)
abstracting: (1<=p1)
states: 266,761,216 (8)
abstracting: (1<=p10)
states: 180,807,168 (8)
.....................
EG iterations: 21
abstracting: (1<=p47)
states: 277,919,232 (8)
abstracting: (1<=p41)
states: 277,919,232 (8)
abstracting: (1<=p4)
states: 168,312,832 (8)
abstracting: (1<=p44)
states: 146,332,160 (8)
abstracting: (1<=p43)
states: 278,227,968 (8)
abstracting: (1<=p37)
states: 278,227,968 (8)
abstracting: (1<=p6)
states: 45,356,032 (7)
abstracting: (1<=p23)
states: 283,171,840 (8)
abstracting: (1<=p17)
states: 267,206,656 (8)
abstracting: (1<=p33)
states: 283,005,952 (8)
abstracting: (1<=p27)
states: 278,065,664 (8)
abstracting: (1<=p34)
states: 221,420,544 (8)
abstracting: (1<=p33)
states: 283,005,952 (8)
abstracting: (1<=p27)
states: 278,065,664 (8)
abstracting: (1<=p10)
states: 180,807,168 (8)
abstracting: (1<=p9)
states: 304,235,008 (8)
abstracting: (1<=p3)
states: 250,671,616 (8)
abstracting: (1<=p34)
states: 221,420,544 (8)
abstracting: (1<=p22)
states: 213,769,216 (8)
abstracting: (1<=p21)
states: 287,965,696 (8)
abstracting: (1<=p15)
states: 270,111,744 (8)
abstracting: (1<=p3)
states: 250,671,616 (8)
abstracting: (1<=p0)
states: 266,761,216 (8)
abstracting: (1<=p77)
states: 300,168,704 (8)
abstracting: (1<=p74)
states: 174,430,208 (8)
abstracting: (1<=p71)
states: 267,206,656 (8)
abstracting: (1<=p15)
states: 270,111,744 (8)
abstracting: (1<=p22)
states: 213,769,216 (8)
abstracting: (1<=p21)
states: 287,965,696 (8)
abstracting: (1<=p42)
states: 74,097,664 (7)
abstracting: (1<=p88)
states: 168,312,832 (8)
abstracting: (1<=p42)
states: 74,097,664 (7)
abstracting: (1<=p42)
states: 74,097,664 (7)
.
EG iterations: 1
.....................
EG iterations: 21
.
EG iterations: 1
-> the formula is TRUE
FORMULA ResAllocation-PT-R003C015-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.264sec
checking: [AG [E [A [[[[[1<=p9 & [1<=p12 & 1<=p15]] | [1<=p37 & [1<=p43 & 1<=p44]]] & [1<=p83 & 1<=p86]] & [[1<=p89 & 1<=p35] & [1<=p38 & 1<=p41]]] U [AX [~ [[p39<=0 | [p45<=0 | p46<=0]]]] | [[1<=p2 & 1<=p5] | [1<=p53 & 1<=p59]]]] U ~ [E [1<=p66 U 1<=p88]]]] | [[EX [[~ [A [p42<=0 U p4<=0]] & ~ [E [[[1<=p61 & [1<=p67 & 1<=p68]] | [1<=p5 & 1<=p11]] U E [[1<=p0 & 1<=p3] U [1<=p31 & 1<=p37]]]]]] & AF [[p47<=0 | [p50<=0 | p53<=0]]]] & [~ [A [[1<=p67 & 1<=p73] U [1<=p15 & [1<=p21 & 1<=p22]]]] & AX [[EX [p6<=0] & AF [[1<=p47 & [1<=p50 & 1<=p53]]]]]]]]
normalized: [[[~ [EX [~ [[~ [EG [~ [[1<=p47 & [1<=p50 & 1<=p53]]]]] & EX [p6<=0]]]]] & ~ [[~ [EG [~ [[1<=p15 & [1<=p21 & 1<=p22]]]]] & ~ [E [~ [[1<=p15 & [1<=p21 & 1<=p22]]] U [~ [[1<=p67 & 1<=p73]] & ~ [[1<=p15 & [1<=p21 & 1<=p22]]]]]]]]] & [~ [EG [~ [[p47<=0 | [p50<=0 | p53<=0]]]]] & EX [[~ [E [[[1<=p5 & 1<=p11] | [1<=p61 & [1<=p67 & 1<=p68]]] U E [[1<=p0 & 1<=p3] U [1<=p31 & 1<=p37]]]] & ~ [[~ [EG [~ [p4<=0]]] & ~ [E [~ [p4<=0] U [~ [p42<=0] & ~ [p4<=0]]]]]]]]]] | ~ [E [true U ~ [E [[~ [EG [~ [[[[1<=p53 & 1<=p59] | [1<=p2 & 1<=p5]] | ~ [EX [[p39<=0 | [p45<=0 | p46<=0]]]]]]]] & ~ [E [~ [[[[1<=p53 & 1<=p59] | [1<=p2 & 1<=p5]] | ~ [EX [[p39<=0 | [p45<=0 | p46<=0]]]]]] U [~ [[[[1<=p38 & 1<=p41] & [1<=p89 & 1<=p35]] & [[1<=p83 & 1<=p86] & [[1<=p37 & [1<=p43 & 1<=p44]] | [1<=p9 & [1<=p12 & 1<=p15]]]]]] & ~ [[[[1<=p53 & 1<=p59] | [1<=p2 & 1<=p5]] | ~ [EX [[p39<=0 | [p45<=0 | p46<=0]]]]]]]]]] U ~ [E [1<=p66 U 1<=p88]]]]]]]
abstracting: (1<=p88)
states: 168,312,832 (8)
abstracting: (1<=p66)
states: 65,884,160 (7)
abstracting: (p46<=0)
states: 355,948,032 (8)
abstracting: (p45<=0)
states: 297,968,128 (8)
abstracting: (p39<=0)
states: 297,968,128 (8)
.abstracting: (1<=p5)
states: 229,758,464 (8)
abstracting: (1<=p2)
states: 227,993,600 (8)
abstracting: (1<=p59)
states: 275,520,512 (8)
abstracting: (1<=p53)
states: 279,429,120 (8)
abstracting: (1<=p15)
states: 270,111,744 (8)
abstracting: (1<=p12)
states: 240,407,552 (8)
abstracting: (1<=p9)
states: 304,235,008 (8)
abstracting: (1<=p44)
states: 146,332,160 (8)
abstracting: (1<=p43)
states: 278,227,968 (8)
abstracting: (1<=p37)
states: 278,227,968 (8)
abstracting: (1<=p86)
states: 227,993,600 (8)
abstracting: (1<=p83)
states: 229,758,464 (8)
abstracting: (1<=p35)
states: 279,429,120 (8)
abstracting: (1<=p89)
states: 410,565,632 (8)
abstracting: (1<=p41)
states: 277,919,232 (8)
abstracting: (1<=p38)
states: 151,635,968 (8)
abstracting: (p46<=0)
states: 355,948,032 (8)
abstracting: (p45<=0)
states: 297,968,128 (8)
abstracting: (p39<=0)
states: 297,968,128 (8)
.abstracting: (1<=p5)
states: 229,758,464 (8)
abstracting: (1<=p2)
states: 227,993,600 (8)
abstracting: (1<=p59)
states: 275,520,512 (8)
abstracting: (1<=p53)
states: 279,429,120 (8)
abstracting: (p46<=0)
states: 355,948,032 (8)
abstracting: (p45<=0)
states: 297,968,128 (8)
abstracting: (p39<=0)
states: 297,968,128 (8)
.abstracting: (1<=p5)
states: 229,758,464 (8)
abstracting: (1<=p2)
states: 227,993,600 (8)
abstracting: (1<=p59)
states: 275,520,512 (8)
abstracting: (1<=p53)
states: 279,429,120 (8)
.............................
EG iterations: 29
abstracting: (p4<=0)
states: 410,565,632 (8)
abstracting: (p42<=0)
states: 504,780,800 (8)
abstracting: (p4<=0)
states: 410,565,632 (8)
abstracting: (p4<=0)
states: 410,565,632 (8)
.........................
EG iterations: 25
abstracting: (1<=p37)
states: 278,227,968 (8)
abstracting: (1<=p31)
states: 279,715,840 (8)
abstracting: (1<=p3)
states: 250,671,616 (8)
abstracting: (1<=p0)
states: 266,761,216 (8)
abstracting: (1<=p68)
states: 134,336,512 (8)
abstracting: (1<=p67)
states: 272,586,752 (8)
abstracting: (1<=p61)
states: 283,248,128 (8)
abstracting: (1<=p11)
states: 300,168,704 (8)
abstracting: (1<=p5)
states: 229,758,464 (8)
.abstracting: (p53<=0)
states: 299,449,344 (8)
abstracting: (p50<=0)
states: 427,242,496 (8)
abstracting: (p47<=0)
states: 300,959,232 (8)
......................
EG iterations: 22
abstracting: (1<=p22)
states: 213,769,216 (8)
abstracting: (1<=p21)
states: 287,965,696 (8)
abstracting: (1<=p15)
states: 270,111,744 (8)
abstracting: (1<=p73)
states: 293,114,880 (8)
abstracting: (1<=p67)
states: 272,586,752 (8)
abstracting: (1<=p22)
states: 213,769,216 (8)
abstracting: (1<=p21)
states: 287,965,696 (8)
abstracting: (1<=p15)
states: 270,111,744 (8)
abstracting: (1<=p22)
states: 213,769,216 (8)
abstracting: (1<=p21)
states: 287,965,696 (8)
abstracting: (1<=p15)
states: 270,111,744 (8)
...................
EG iterations: 19
abstracting: (p6<=0)
states: 533,522,432 (8)
.abstracting: (1<=p53)
states: 279,429,120 (8)
abstracting: (1<=p50)
states: 151,635,968 (8)
abstracting: (1<=p47)
states: 277,919,232 (8)
......................
EG iterations: 22
.-> the formula is FALSE
FORMULA ResAllocation-PT-R003C015-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.755sec
checking: A [[AX [AF [[[1<=p43 & 1<=p44] & 1<=p37]]] & EG [E [~ [E [1<=p76 U [1<=p21 & [1<=p24 & 1<=p27]]]] U [E [[1<=p65 & 1<=p71] U [1<=p2 & 1<=p5]] | ~ [[1<=p83 & [1<=p86 & 1<=p89]]]]]]] U [EG [[AF [[1<=p0 & 1<=p3]] & [A [[1<=p45 & [1<=p48 & 1<=p51]] U 1<=p6] | [[1<=p15 & [1<=p21 & 1<=p22]] | [1<=p41 & 1<=p47]]]]] | [[AG [~ [AX [[1<=p69 & [1<=p72 & 1<=p75]]]]] & [EX [~ [[1<=p63 & [1<=p69 & 1<=p70]]]] | [EX [[1<=p5 & 1<=p11]] & AF [[1<=p33 & [1<=p36 & 1<=p39]]]]]] | [EF [AG [[[1<=p69 & 1<=p72] & [1<=p75 & 1<=p76]]]] & ~ [[[1<=p79 & 1<=p85] & [[~ [[1<=p17 & 1<=p23]] | [[1<=p57 & 1<=p60] & [1<=p63 & 1<=p42]]] & [1<=p19 & 1<=p25]]]]]]]]
normalized: [~ [EG [~ [[[[~ [[[[1<=p19 & 1<=p25] & [[[1<=p63 & 1<=p42] & [1<=p57 & 1<=p60]] | ~ [[1<=p17 & 1<=p23]]]] & [1<=p79 & 1<=p85]]] & E [true U ~ [E [true U ~ [[[1<=p75 & 1<=p76] & [1<=p69 & 1<=p72]]]]]]] | [[[~ [EG [~ [[1<=p33 & [1<=p36 & 1<=p39]]]]] & EX [[1<=p5 & 1<=p11]]] | EX [~ [[1<=p63 & [1<=p69 & 1<=p70]]]]] & ~ [E [true U ~ [EX [~ [[1<=p69 & [1<=p72 & 1<=p75]]]]]]]]] | EG [[[[[1<=p41 & 1<=p47] | [1<=p15 & [1<=p21 & 1<=p22]]] | [~ [EG [~ [1<=p6]]] & ~ [E [~ [1<=p6] U [~ [[1<=p45 & [1<=p48 & 1<=p51]]] & ~ [1<=p6]]]]]] & ~ [EG [~ [[1<=p0 & 1<=p3]]]]]]]]]] & ~ [E [~ [[[[~ [[[[1<=p19 & 1<=p25] & [[[1<=p63 & 1<=p42] & [1<=p57 & 1<=p60]] | ~ [[1<=p17 & 1<=p23]]]] & [1<=p79 & 1<=p85]]] & E [true U ~ [E [true U ~ [[[1<=p75 & 1<=p76] & [1<=p69 & 1<=p72]]]]]]] | [[[~ [EG [~ [[1<=p33 & [1<=p36 & 1<=p39]]]]] & EX [[1<=p5 & 1<=p11]]] | EX [~ [[1<=p63 & [1<=p69 & 1<=p70]]]]] & ~ [E [true U ~ [EX [~ [[1<=p69 & [1<=p72 & 1<=p75]]]]]]]]] | EG [[[[[1<=p41 & 1<=p47] | [1<=p15 & [1<=p21 & 1<=p22]]] | [~ [EG [~ [1<=p6]]] & ~ [E [~ [1<=p6] U [~ [[1<=p45 & [1<=p48 & 1<=p51]]] & ~ [1<=p6]]]]]] & ~ [EG [~ [[1<=p0 & 1<=p3]]]]]]]] U [~ [[EG [E [~ [E [1<=p76 U [1<=p21 & [1<=p24 & 1<=p27]]]] U [~ [[1<=p83 & [1<=p86 & 1<=p89]]] | E [[1<=p65 & 1<=p71] U [1<=p2 & 1<=p5]]]]] & ~ [EX [EG [~ [[1<=p37 & [1<=p43 & 1<=p44]]]]]]]] & ~ [[[[~ [[[[1<=p19 & 1<=p25] & [[[1<=p63 & 1<=p42] & [1<=p57 & 1<=p60]] | ~ [[1<=p17 & 1<=p23]]]] & [1<=p79 & 1<=p85]]] & E [true U ~ [E [true U ~ [[[1<=p75 & 1<=p76] & [1<=p69 & 1<=p72]]]]]]] | [[[~ [EG [~ [[1<=p33 & [1<=p36 & 1<=p39]]]]] & EX [[1<=p5 & 1<=p11]]] | EX [~ [[1<=p63 & [1<=p69 & 1<=p70]]]]] & ~ [E [true U ~ [EX [~ [[1<=p69 & [1<=p72 & 1<=p75]]]]]]]]] | EG [[[[[1<=p41 & 1<=p47] | [1<=p15 & [1<=p21 & 1<=p22]]] | [~ [EG [~ [1<=p6]]] & ~ [E [~ [1<=p6] U [~ [[1<=p45 & [1<=p48 & 1<=p51]]] & ~ [1<=p6]]]]]] & ~ [EG [~ [[1<=p0 & 1<=p3]]]]]]]]]]]]
abstracting: (1<=p3)
states: 250,671,616 (8)
abstracting: (1<=p0)
states: 266,761,216 (8)
......................
EG iterations: 22
abstracting: (1<=p6)
states: 45,356,032 (7)
abstracting: (1<=p51)
states: 283,005,952 (8)
abstracting: (1<=p48)
states: 226,552,832 (8)
abstracting: (1<=p45)
states: 280,910,336 (8)
abstracting: (1<=p6)
states: 45,356,032 (7)
abstracting: (1<=p6)
states: 45,356,032 (7)
.
EG iterations: 1
abstracting: (1<=p22)
states: 213,769,216 (8)
abstracting: (1<=p21)
states: 287,965,696 (8)
abstracting: (1<=p15)
states: 270,111,744 (8)
abstracting: (1<=p47)
states: 277,919,232 (8)
abstracting: (1<=p41)
states: 277,919,232 (8)
..........................
EG iterations: 26
abstracting: (1<=p75)
states: 304,235,008 (8)
abstracting: (1<=p72)
states: 240,407,552 (8)
abstracting: (1<=p69)
states: 270,111,744 (8)
.abstracting: (1<=p70)
states: 213,769,216 (8)
abstracting: (1<=p69)
states: 270,111,744 (8)
abstracting: (1<=p63)
states: 287,965,696 (8)
.abstracting: (1<=p11)
states: 300,168,704 (8)
abstracting: (1<=p5)
states: 229,758,464 (8)
.abstracting: (1<=p39)
states: 280,910,336 (8)
abstracting: (1<=p36)
states: 226,552,832 (8)
abstracting: (1<=p33)
states: 283,005,952 (8)
.....................
EG iterations: 21
abstracting: (1<=p72)
states: 240,407,552 (8)
abstracting: (1<=p69)
states: 270,111,744 (8)
abstracting: (1<=p76)
states: 97,902,592 (7)
abstracting: (1<=p75)
states: 304,235,008 (8)
abstracting: (1<=p85)
states: 312,117,248 (8)
abstracting: (1<=p79)
states: 266,761,216 (8)
abstracting: (1<=p23)
states: 283,171,840 (8)
abstracting: (1<=p17)
states: 267,206,656 (8)
abstracting: (1<=p60)
states: 229,746,176 (8)
abstracting: (1<=p57)
states: 278,065,664 (8)
abstracting: (1<=p42)
states: 74,097,664 (7)
abstracting: (1<=p63)
states: 287,965,696 (8)
abstracting: (1<=p25)
states: 276,522,496 (8)
abstracting: (1<=p19)
states: 283,248,128 (8)
abstracting: (1<=p44)
states: 146,332,160 (8)
abstracting: (1<=p43)
states: 278,227,968 (8)
abstracting: (1<=p37)
states: 278,227,968 (8)
...................
EG iterations: 19
.abstracting: (1<=p5)
states: 229,758,464 (8)
abstracting: (1<=p2)
states: 227,993,600 (8)
abstracting: (1<=p71)
states: 267,206,656 (8)
abstracting: (1<=p65)
states: 283,171,840 (8)
abstracting: (1<=p89)
states: 410,565,632 (8)
abstracting: (1<=p86)
states: 227,993,600 (8)
abstracting: (1<=p83)
states: 229,758,464 (8)
abstracting: (1<=p27)
states: 278,065,664 (8)
abstracting: (1<=p24)
states: 229,746,176 (8)
abstracting: (1<=p21)
states: 287,965,696 (8)
abstracting: (1<=p76)
states: 97,902,592 (7)
.
EG iterations: 1
abstracting: (1<=p3)
states: 250,671,616 (8)
abstracting: (1<=p0)
states: 266,761,216 (8)
......................
EG iterations: 22
abstracting: (1<=p6)
states: 45,356,032 (7)
abstracting: (1<=p51)
states: 283,005,952 (8)
abstracting: (1<=p48)
states: 226,552,832 (8)
abstracting: (1<=p45)
states: 280,910,336 (8)
abstracting: (1<=p6)
states: 45,356,032 (7)
abstracting: (1<=p6)
states: 45,356,032 (7)
.
EG iterations: 1
abstracting: (1<=p22)
states: 213,769,216 (8)
abstracting: (1<=p21)
states: 287,965,696 (8)
abstracting: (1<=p15)
states: 270,111,744 (8)
abstracting: (1<=p47)
states: 277,919,232 (8)
abstracting: (1<=p41)
states: 277,919,232 (8)
..........................
EG iterations: 26
abstracting: (1<=p75)
states: 304,235,008 (8)
abstracting: (1<=p72)
states: 240,407,552 (8)
abstracting: (1<=p69)
states: 270,111,744 (8)
.abstracting: (1<=p70)
states: 213,769,216 (8)
abstracting: (1<=p69)
states: 270,111,744 (8)
abstracting: (1<=p63)
states: 287,965,696 (8)
.abstracting: (1<=p11)
states: 300,168,704 (8)
abstracting: (1<=p5)
states: 229,758,464 (8)
.abstracting: (1<=p39)
states: 280,910,336 (8)
abstracting: (1<=p36)
states: 226,552,832 (8)
abstracting: (1<=p33)
states: 283,005,952 (8)
.....................
EG iterations: 21
abstracting: (1<=p72)
states: 240,407,552 (8)
abstracting: (1<=p69)
states: 270,111,744 (8)
abstracting: (1<=p76)
states: 97,902,592 (7)
abstracting: (1<=p75)
states: 304,235,008 (8)
abstracting: (1<=p85)
states: 312,117,248 (8)
abstracting: (1<=p79)
states: 266,761,216 (8)
abstracting: (1<=p23)
states: 283,171,840 (8)
abstracting: (1<=p17)
states: 267,206,656 (8)
abstracting: (1<=p60)
states: 229,746,176 (8)
abstracting: (1<=p57)
states: 278,065,664 (8)
abstracting: (1<=p42)
states: 74,097,664 (7)
abstracting: (1<=p63)
states: 287,965,696 (8)
abstracting: (1<=p25)
states: 276,522,496 (8)
abstracting: (1<=p19)
states: 283,248,128 (8)
abstracting: (1<=p3)
states: 250,671,616 (8)
abstracting: (1<=p0)
states: 266,761,216 (8)
......................
EG iterations: 22
abstracting: (1<=p6)
states: 45,356,032 (7)
abstracting: (1<=p51)
states: 283,005,952 (8)
abstracting: (1<=p48)
states: 226,552,832 (8)
abstracting: (1<=p45)
states: 280,910,336 (8)
abstracting: (1<=p6)
states: 45,356,032 (7)
abstracting: (1<=p6)
states: 45,356,032 (7)
.
EG iterations: 1
abstracting: (1<=p22)
states: 213,769,216 (8)
abstracting: (1<=p21)
states: 287,965,696 (8)
abstracting: (1<=p15)
states: 270,111,744 (8)
abstracting: (1<=p47)
states: 277,919,232 (8)
abstracting: (1<=p41)
states: 277,919,232 (8)
..........................
EG iterations: 26
abstracting: (1<=p75)
states: 304,235,008 (8)
abstracting: (1<=p72)
states: 240,407,552 (8)
abstracting: (1<=p69)
states: 270,111,744 (8)
.abstracting: (1<=p70)
states: 213,769,216 (8)
abstracting: (1<=p69)
states: 270,111,744 (8)
abstracting: (1<=p63)
states: 287,965,696 (8)
.abstracting: (1<=p11)
states: 300,168,704 (8)
abstracting: (1<=p5)
states: 229,758,464 (8)
.abstracting: (1<=p39)
states: 280,910,336 (8)
abstracting: (1<=p36)
states: 226,552,832 (8)
abstracting: (1<=p33)
states: 283,005,952 (8)
.....................
EG iterations: 21
abstracting: (1<=p72)
states: 240,407,552 (8)
abstracting: (1<=p69)
states: 270,111,744 (8)
abstracting: (1<=p76)
states: 97,902,592 (7)
abstracting: (1<=p75)
states: 304,235,008 (8)
abstracting: (1<=p85)
states: 312,117,248 (8)
abstracting: (1<=p79)
states: 266,761,216 (8)
abstracting: (1<=p23)
states: 283,171,840 (8)
abstracting: (1<=p17)
states: 267,206,656 (8)
abstracting: (1<=p60)
states: 229,746,176 (8)
abstracting: (1<=p57)
states: 278,065,664 (8)
abstracting: (1<=p42)
states: 74,097,664 (7)
abstracting: (1<=p63)
states: 287,965,696 (8)
abstracting: (1<=p25)
states: 276,522,496 (8)
abstracting: (1<=p19)
states: 283,248,128 (8)
.
EG iterations: 1
-> the formula is FALSE
FORMULA ResAllocation-PT-R003C015-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.503sec
totally nodes used: 4103222 (4.1e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1355036 5674843 7029879
used/not used/entry size/cache size: 8794215 58314649 16 1024MB
basic ops cache: hits/miss/sum: 323348 1208534 1531882
used/not used/entry size/cache size: 2199529 14577687 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: 5415 28224 33639
used/not used/entry size/cache size: 28166 8360442 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 63464336
1 3248024
2 341152
3 49125
4 5653
5 539
6 33
7 2
8 0
9 0
>= 10 0
Total processing time: 0m 7.399sec
BK_STOP 1679180874275
--------------------
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:459 (7), effective:90 (1)
initing FirstDep: 0m 0.000sec
iterations count:96 (1), effective:5 (0)
iterations count:134 (2), effective:13 (0)
iterations count:96 (1), effective:9 (0)
iterations count:79 (1), effective:5 (0)
iterations count:224 (3), effective:24 (0)
iterations count:183 (3), effective:21 (0)
iterations count:77 (1), effective:3 (0)
iterations count:70 (1), effective:2 (0)
iterations count:225 (3), effective:26 (0)
iterations count:70 (1), effective:2 (0)
iterations count:60 (1), effective:0 (0)
iterations count:70 (1), effective:2 (0)
iterations count:62 (1), effective:1 (0)
iterations count:157 (2), effective:14 (0)
iterations count:67 (1), effective:1 (0)
iterations count:117 (1), effective:9 (0)
iterations count:118 (1), effective:9 (0)
iterations count:73 (1), effective:3 (0)
iterations count:70 (1), effective:1 (0)
iterations count:582 (9), effective:96 (1)
iterations count:213 (3), effective:35 (0)
iterations count:136 (2), effective:12 (0)
iterations count:136 (2), effective:12 (0)
iterations count:536 (8), effective:89 (1)
iterations count:136 (2), effective:12 (0)
iterations count:93 (1), effective:6 (0)
iterations count:219 (3), effective:23 (0)
iterations count:136 (2), effective:12 (0)
iterations count:136 (2), effective:12 (0)
iterations count:536 (8), effective:89 (1)
iterations count:136 (2), effective:12 (0)
iterations count:93 (1), effective:6 (0)
iterations count:194 (3), effective:22 (0)
iterations count:136 (2), effective:12 (0)
iterations count:136 (2), effective:12 (0)
iterations count:536 (8), effective:89 (1)
iterations count:136 (2), effective:12 (0)
iterations count:93 (1), effective:6 (0)
iterations count:67 (1), effective:1 (0)
iterations count:159 (2), effective:15 (0)
iterations count:124 (2), effective:9 (0)
iterations count:84 (1), effective:4 (0)
iterations count:132 (2), effective:12 (0)
iterations count:122 (2), effective:9 (0)
iterations count:81 (1), effective:3 (0)
iterations count:65 (1), effective:2 (0)
iterations count:181 (3), effective:23 (0)
iterations count:65 (1), effective:1 (0)
iterations count:120 (2), effective:9 (0)
iterations count:75 (1), effective:4 (0)
iterations count:72 (1), effective:2 (0)
iterations count:284 (4), effective:35 (0)
iterations count:162 (2), effective:15 (0)
iterations count:94 (1), effective:5 (0)
iterations count:113 (1), effective:11 (0)
iterations count:122 (2), effective:10 (0)
iterations count:96 (1), effective:6 (0)
iterations count:601 (10), effective:98 (1)
iterations count:65 (1), effective:1 (0)
iterations count:95 (1), effective:9 (0)
iterations count:122 (2), effective:9 (0)
iterations count:106 (1), effective:11 (0)
iterations count:96 (1), effective:6 (0)
iterations count:601 (10), effective:98 (1)
iterations count:65 (1), effective:1 (0)
iterations count:67 (1), effective:1 (0)
iterations count:96 (1), effective:6 (0)
iterations count:601 (10), effective:98 (1)
iterations count:65 (1), effective:1 (0)
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ResAllocation-PT-R003C015"
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 ResAllocation-PT-R003C015, 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 r330-tall-167889203600698"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ResAllocation-PT-R003C015.tgz
mv ResAllocation-PT-R003C015 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 ;