About the Execution of Marcie+red for SmallOperatingSystem-PT-MT0064DC0016
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5582.275 | 13685.00 | 19728.00 | 571.10 | FTFTFFFFFFFFFFFF | 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.r458-smll-167912649700026.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 SmallOperatingSystem-PT-MT0064DC0016, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r458-smll-167912649700026
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 7.1K Feb 25 12:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 25 12:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 12:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 12:49 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 4.5K Feb 25 17:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 17:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 12:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Feb 25 12:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 12:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Feb 25 12:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Feb 25 17:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 13 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 8.2K 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 SmallOperatingSystem-PT-MT0064DC0016-CTLFireability-00
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0016-CTLFireability-01
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0016-CTLFireability-02
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0016-CTLFireability-03
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0016-CTLFireability-04
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0016-CTLFireability-05
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0016-CTLFireability-06
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0016-CTLFireability-07
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0016-CTLFireability-08
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0016-CTLFireability-09
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0016-CTLFireability-10
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0016-CTLFireability-11
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0016-CTLFireability-12
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0016-CTLFireability-13
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0016-CTLFireability-14
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0016-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679231304247
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=SmallOperatingSystem-PT-MT0064DC0016
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-19 13:08:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 13:08:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 13:08:27] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2023-03-19 13:08:27] [INFO ] Transformed 9 places.
[2023-03-19 13:08:27] [INFO ] Transformed 8 transitions.
[2023-03-19 13:08:27] [INFO ] Parsed PT model containing 9 places and 8 transitions and 27 arcs in 216 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 26 ms.
Initial state reduction rules removed 3 formulas.
FORMULA SmallOperatingSystem-PT-MT0064DC0016-CTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0064DC0016-CTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0064DC0016-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 21 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 9 cols
[2023-03-19 13:08:27] [INFO ] Computed 4 place invariants in 7 ms
[2023-03-19 13:08:27] [INFO ] Implicit Places using invariants in 232 ms returned []
[2023-03-19 13:08:27] [INFO ] Invariant cache hit.
[2023-03-19 13:08:28] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
[2023-03-19 13:08:28] [INFO ] Invariant cache hit.
[2023-03-19 13:08:28] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 417 ms. Remains : 9/9 places, 8/8 transitions.
Support contains 9 out of 9 places after structural reductions.
[2023-03-19 13:08:28] [INFO ] Flatten gal took : 30 ms
[2023-03-19 13:08:28] [INFO ] Flatten gal took : 10 ms
[2023-03-19 13:08:28] [INFO ] Input system was already deterministic with 8 transitions.
Incomplete random walk after 10017 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 21) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 13:08:28] [INFO ] Invariant cache hit.
[2023-03-19 13:08:28] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
[2023-03-19 13:08:28] [INFO ] Flatten gal took : 5 ms
[2023-03-19 13:08:28] [INFO ] Flatten gal took : 5 ms
[2023-03-19 13:08:28] [INFO ] Input system was already deterministic with 8 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 8
Applied a total of 1 rules in 2 ms. Remains 8 /9 variables (removed 1) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 8/9 places, 8/8 transitions.
[2023-03-19 13:08:28] [INFO ] Flatten gal took : 3 ms
[2023-03-19 13:08:28] [INFO ] Flatten gal took : 3 ms
[2023-03-19 13:08:28] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 7 transition count 7
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 7 transition count 7
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 5 transition count 6
Applied a total of 5 rules in 15 ms. Remains 5 /9 variables (removed 4) and now considering 6/8 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 5/9 places, 6/8 transitions.
[2023-03-19 13:08:28] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:08:28] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:08:28] [INFO ] Input system was already deterministic with 6 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 2 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 9/9 places, 8/8 transitions.
[2023-03-19 13:08:28] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:08:29] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:08:29] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 6 transition count 7
Applied a total of 3 rules in 2 ms. Remains 6 /9 variables (removed 3) and now considering 7/8 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 6/9 places, 7/8 transitions.
[2023-03-19 13:08:29] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:08:29] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:08:29] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 8
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 7 transition count 7
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 7 transition count 7
Applied a total of 3 rules in 1 ms. Remains 7 /9 variables (removed 2) and now considering 7/8 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 7/9 places, 7/8 transitions.
[2023-03-19 13:08:29] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:08:29] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:08:29] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 9/9 places, 8/8 transitions.
[2023-03-19 13:08:29] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:08:29] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:08:29] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 8/8 transitions.
[2023-03-19 13:08:29] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:08:29] [INFO ] Flatten gal took : 3 ms
[2023-03-19 13:08:29] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 9/9 places, 8/8 transitions.
[2023-03-19 13:08:29] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:08:29] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:08:29] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 8/8 transitions.
[2023-03-19 13:08:29] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:08:29] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:08:29] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 8
Applied a total of 1 rules in 0 ms. Remains 8 /9 variables (removed 1) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 8/9 places, 8/8 transitions.
[2023-03-19 13:08:29] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:08:29] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:08:29] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 9/9 places, 8/8 transitions.
[2023-03-19 13:08:29] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:08:29] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:08:29] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 8/8 transitions.
[2023-03-19 13:08:29] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:08:29] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:08:29] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 9/9 places, 8/8 transitions.
[2023-03-19 13:08:29] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:08:29] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:08:29] [INFO ] Input system was already deterministic with 8 transitions.
[2023-03-19 13:08:29] [INFO ] Flatten gal took : 3 ms
[2023-03-19 13:08:29] [INFO ] Flatten gal took : 3 ms
[2023-03-19 13:08:29] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-19 13:08:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 9 places, 8 transitions and 27 arcs took 0 ms.
Total runtime 1837 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: 9 NrTr: 8 NrArc: 27)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 3.439sec
RS generation: 0m 0.071sec
-> reachability set: #nodes 537 (5.4e+02) #states 4,077,909 (6)
starting MCC model checker
--------------------------
checking: AG [[p4<=0 | AF [1<=p4]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [1<=p4]]] | p4<=0]]]]
abstracting: (p4<=0)
states: 193,545 (5)
abstracting: (1<=p4)
states: 3,884,364 (6)
..................
EG iterations: 18
-> the formula is TRUE
FORMULA SmallOperatingSystem-PT-MT0064DC0016-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.019sec
checking: AG [[1<=p4 | EF [AG [EF [1<=p8]]]]]
normalized: ~ [E [true U ~ [[E [true U ~ [E [true U ~ [E [true U 1<=p8]]]]] | 1<=p4]]]]
abstracting: (1<=p4)
states: 3,884,364 (6)
abstracting: (1<=p8)
states: 3,562,724 (6)
-> the formula is TRUE
FORMULA SmallOperatingSystem-PT-MT0064DC0016-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.007sec
checking: AX [EF [AG [[1<=p4 & 1<=p6]]]]
normalized: ~ [EX [~ [E [true U ~ [E [true U ~ [[1<=p4 & 1<=p6]]]]]]]]
abstracting: (1<=p6)
states: 4,036,752 (6)
abstracting: (1<=p4)
states: 3,884,364 (6)
.-> the formula is FALSE
FORMULA SmallOperatingSystem-PT-MT0064DC0016-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.061sec
checking: EF [[AF [AG [p8<=0]] & EF [[1<=p0 & [1<=p2 & 1<=p5]]]]]
normalized: E [true U [E [true U [[1<=p2 & 1<=p5] & 1<=p0]] & ~ [EG [E [true U ~ [p8<=0]]]]]]
abstracting: (p8<=0)
states: 515,185 (5)
EG iterations: 0
abstracting: (1<=p0)
states: 4,077,909 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p2)
states: 3,737,756 (6)
-> the formula is FALSE
FORMULA SmallOperatingSystem-PT-MT0064DC0016-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.007sec
checking: ~ [E [p4<=0 U AF [~ [AX [[1<=p5 & [1<=p6 & 1<=p3]]]]]]]
normalized: ~ [E [p4<=0 U ~ [EG [~ [EX [~ [[[1<=p6 & 1<=p3] & 1<=p5]]]]]]]]
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p3)
states: 3,562,724 (6)
abstracting: (1<=p6)
states: 4,036,752 (6)
..
EG iterations: 1
abstracting: (p4<=0)
states: 193,545 (5)
-> the formula is FALSE
FORMULA SmallOperatingSystem-PT-MT0064DC0016-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.078sec
checking: EX [AG [[1<=p3 & AF [[p0<=0 | [p2<=0 | p5<=0]]]]]]
normalized: EX [~ [E [true U ~ [[~ [EG [~ [[[p2<=0 | p5<=0] | p0<=0]]]] & 1<=p3]]]]]
abstracting: (1<=p3)
states: 3,562,724 (6)
abstracting: (p0<=0)
states: 0
abstracting: (p5<=0)
states: 193,545 (5)
abstracting: (p2<=0)
states: 340,153 (5)
.
EG iterations: 1
.-> the formula is FALSE
FORMULA SmallOperatingSystem-PT-MT0064DC0016-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.021sec
checking: EF [EX [[EF [1<=p8] & [AG [p3<=0] & [[p4<=0 | p0<=0] | [p1<=0 | p2<=0]]]]]]
normalized: E [true U EX [[[[[p1<=0 | p2<=0] | [p4<=0 | p0<=0]] & ~ [E [true U ~ [p3<=0]]]] & E [true U 1<=p8]]]]
abstracting: (1<=p8)
states: 3,562,724 (6)
abstracting: (p3<=0)
states: 515,185 (5)
abstracting: (p0<=0)
states: 0
abstracting: (p4<=0)
states: 193,545 (5)
abstracting: (p2<=0)
states: 340,153 (5)
abstracting: (p1<=0)
states: 193,545 (5)
.-> the formula is FALSE
FORMULA SmallOperatingSystem-PT-MT0064DC0016-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.008sec
checking: ~ [E [[1<=p6 & 1<=p5] U AG [[EF [AX [[1<=p4 & 1<=p6]]] | [A [1<=p3 U 1<=p8] | 1<=p3]]]]]
normalized: ~ [E [[1<=p6 & 1<=p5] U ~ [E [true U ~ [[[1<=p3 | [~ [EG [~ [1<=p8]]] & ~ [E [~ [1<=p8] U [~ [1<=p3] & ~ [1<=p8]]]]]] | E [true U ~ [EX [~ [[1<=p4 & 1<=p6]]]]]]]]]]]
abstracting: (1<=p6)
states: 4,036,752 (6)
abstracting: (1<=p4)
states: 3,884,364 (6)
.abstracting: (1<=p8)
states: 3,562,724 (6)
abstracting: (1<=p3)
states: 3,562,724 (6)
abstracting: (1<=p8)
states: 3,562,724 (6)
abstracting: (1<=p8)
states: 3,562,724 (6)
..
EG iterations: 2
abstracting: (1<=p3)
states: 3,562,724 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p6)
states: 4,036,752 (6)
-> the formula is FALSE
FORMULA SmallOperatingSystem-PT-MT0064DC0016-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.028sec
checking: A [1<=p3 U [AG [EX [~ [[1<=p0 & [1<=p2 & 1<=p5]]]]] | [AX [~ [AF [1<=p8]]] | [[AF [AG [[1<=p4 & 1<=p6]]] & 1<=p0] & [1<=p1 & 1<=p2]]]]]
normalized: [~ [EG [~ [[[[[1<=p1 & 1<=p2] & [~ [EG [E [true U ~ [[1<=p4 & 1<=p6]]]]] & 1<=p0]] | ~ [EX [~ [EG [~ [1<=p8]]]]]] | ~ [E [true U ~ [EX [~ [[[1<=p2 & 1<=p5] & 1<=p0]]]]]]]]]] & ~ [E [~ [[[[[1<=p1 & 1<=p2] & [~ [EG [E [true U ~ [[1<=p4 & 1<=p6]]]]] & 1<=p0]] | ~ [EX [~ [EG [~ [1<=p8]]]]]] | ~ [E [true U ~ [EX [~ [[[1<=p2 & 1<=p5] & 1<=p0]]]]]]]] U [~ [1<=p3] & ~ [[[[[1<=p1 & 1<=p2] & [~ [EG [E [true U ~ [[1<=p4 & 1<=p6]]]]] & 1<=p0]] | ~ [EX [~ [EG [~ [1<=p8]]]]]] | ~ [E [true U ~ [EX [~ [[[1<=p2 & 1<=p5] & 1<=p0]]]]]]]]]]]]
abstracting: (1<=p0)
states: 4,077,909 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p2)
states: 3,737,756 (6)
.abstracting: (1<=p8)
states: 3,562,724 (6)
..
EG iterations: 2
.abstracting: (1<=p0)
states: 4,077,909 (6)
abstracting: (1<=p6)
states: 4,036,752 (6)
abstracting: (1<=p4)
states: 3,884,364 (6)
EG iterations: 0
abstracting: (1<=p2)
states: 3,737,756 (6)
abstracting: (1<=p1)
states: 3,884,364 (6)
abstracting: (1<=p3)
states: 3,562,724 (6)
abstracting: (1<=p0)
states: 4,077,909 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p2)
states: 3,737,756 (6)
.abstracting: (1<=p8)
states: 3,562,724 (6)
..
EG iterations: 2
.abstracting: (1<=p0)
states: 4,077,909 (6)
abstracting: (1<=p6)
states: 4,036,752 (6)
abstracting: (1<=p4)
states: 3,884,364 (6)
EG iterations: 0
abstracting: (1<=p2)
states: 3,737,756 (6)
abstracting: (1<=p1)
states: 3,884,364 (6)
abstracting: (1<=p0)
states: 4,077,909 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p2)
states: 3,737,756 (6)
.abstracting: (1<=p8)
states: 3,562,724 (6)
..
EG iterations: 2
.abstracting: (1<=p0)
states: 4,077,909 (6)
abstracting: (1<=p6)
states: 4,036,752 (6)
abstracting: (1<=p4)
states: 3,884,364 (6)
EG iterations: 0
abstracting: (1<=p2)
states: 3,737,756 (6)
abstracting: (1<=p1)
states: 3,884,364 (6)
.
EG iterations: 1
-> the formula is FALSE
FORMULA SmallOperatingSystem-PT-MT0064DC0016-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.043sec
checking: [EG [A [[A [1<=p4 U 1<=p4] | [[1<=p5 & 1<=p6] | [1<=p0 & [1<=p1 & 1<=p2]]]] U [[1<=p3 & 1<=p4] & [1<=p6 & [1<=p7 | 1<=p4]]]]] | EX [1<=p7]]
normalized: [EG [[~ [EG [~ [[[[1<=p7 | 1<=p4] & 1<=p6] & [1<=p3 & 1<=p4]]]]] & ~ [E [~ [[[[1<=p7 | 1<=p4] & 1<=p6] & [1<=p3 & 1<=p4]]] U [~ [[[[[1<=p1 & 1<=p2] & 1<=p0] | [1<=p5 & 1<=p6]] | [~ [EG [~ [1<=p4]]] & ~ [E [~ [1<=p4] U [~ [1<=p4] & ~ [1<=p4]]]]]]] & ~ [[[[1<=p7 | 1<=p4] & 1<=p6] & [1<=p3 & 1<=p4]]]]]]]] | EX [1<=p7]]
abstracting: (1<=p7)
states: 3,846,624 (6)
.abstracting: (1<=p4)
states: 3,884,364 (6)
abstracting: (1<=p3)
states: 3,562,724 (6)
abstracting: (1<=p6)
states: 4,036,752 (6)
abstracting: (1<=p4)
states: 3,884,364 (6)
abstracting: (1<=p7)
states: 3,846,624 (6)
abstracting: (1<=p4)
states: 3,884,364 (6)
abstracting: (1<=p4)
states: 3,884,364 (6)
abstracting: (1<=p4)
states: 3,884,364 (6)
abstracting: (1<=p4)
states: 3,884,364 (6)
..................
EG iterations: 18
abstracting: (1<=p6)
states: 4,036,752 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p0)
states: 4,077,909 (6)
abstracting: (1<=p2)
states: 3,737,756 (6)
abstracting: (1<=p1)
states: 3,884,364 (6)
abstracting: (1<=p4)
states: 3,884,364 (6)
abstracting: (1<=p3)
states: 3,562,724 (6)
abstracting: (1<=p6)
states: 4,036,752 (6)
abstracting: (1<=p4)
states: 3,884,364 (6)
abstracting: (1<=p7)
states: 3,846,624 (6)
abstracting: (1<=p4)
states: 3,884,364 (6)
abstracting: (1<=p3)
states: 3,562,724 (6)
abstracting: (1<=p6)
states: 4,036,752 (6)
abstracting: (1<=p4)
states: 3,884,364 (6)
abstracting: (1<=p7)
states: 3,846,624 (6)
................
EG iterations: 16
.
EG iterations: 1
-> the formula is FALSE
FORMULA SmallOperatingSystem-PT-MT0064DC0016-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.872sec
checking: EG [[AX [EF [[1<=p0 & [1<=p2 & 1<=p5]]]] & [[p3<=0 & [[p5<=0 | p6<=0] & [p0<=0 | [p1<=0 | p2<=0]]]] | [[EX [[p0<=0 | [p1<=0 | p2<=0]]] & [[p0<=0 | p2<=0] | [p5<=0 | [p1<=0 | [p8<=0 & [p5<=0 | p6<=0]]]]]] | [EX [1<=p4] & [p0<=0 | [p2<=0 | p5<=0]]]]]]]
normalized: EG [[[[[[[p2<=0 | p5<=0] | p0<=0] & EX [1<=p4]] | [[[p0<=0 | p2<=0] | [[[[p5<=0 | p6<=0] & p8<=0] | p1<=0] | p5<=0]] & EX [[[p1<=0 | p2<=0] | p0<=0]]]] | [[[[p1<=0 | p2<=0] | p0<=0] & [p5<=0 | p6<=0]] & p3<=0]] & ~ [EX [~ [E [true U [[1<=p2 & 1<=p5] & 1<=p0]]]]]]]
abstracting: (1<=p0)
states: 4,077,909 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p2)
states: 3,737,756 (6)
.abstracting: (p3<=0)
states: 515,185 (5)
abstracting: (p6<=0)
states: 41,157 (4)
abstracting: (p5<=0)
states: 193,545 (5)
abstracting: (p0<=0)
states: 0
abstracting: (p2<=0)
states: 340,153 (5)
abstracting: (p1<=0)
states: 193,545 (5)
abstracting: (p0<=0)
states: 0
abstracting: (p2<=0)
states: 340,153 (5)
abstracting: (p1<=0)
states: 193,545 (5)
.abstracting: (p5<=0)
states: 193,545 (5)
abstracting: (p1<=0)
states: 193,545 (5)
abstracting: (p8<=0)
states: 515,185 (5)
abstracting: (p6<=0)
states: 41,157 (4)
abstracting: (p5<=0)
states: 193,545 (5)
abstracting: (p2<=0)
states: 340,153 (5)
abstracting: (p0<=0)
states: 0
abstracting: (1<=p4)
states: 3,884,364 (6)
.abstracting: (p0<=0)
states: 0
abstracting: (p5<=0)
states: 193,545 (5)
abstracting: (p2<=0)
states: 340,153 (5)
.
EG iterations: 1
-> the formula is FALSE
FORMULA SmallOperatingSystem-PT-MT0064DC0016-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.027sec
checking: [E [[~ [A [AX [[1<=p4 & 1<=p6]] U EX [[1<=p0 & [1<=p1 & 1<=p2]]]]] & AX [~ [E [[1<=p5 & 1<=p6] U 1<=p3]]]] U E [[[1<=p0 & 1<=p2] & [1<=p5 & 1<=p6]] U [1<=p4 & 1<=p6]]] & [EG [E [A [~ [[1<=p4 & 1<=p6]] U EG [[1<=p0 & [1<=p2 & 1<=p5]]]] U [1<=p0 & [1<=p1 & 1<=p2]]]] | EF [[[1<=p4 & 1<=p0] & [1<=p2 & 1<=p5]]]]]
normalized: [[E [true U [[1<=p2 & 1<=p5] & [1<=p4 & 1<=p0]]] | EG [E [[~ [EG [~ [EG [[[1<=p2 & 1<=p5] & 1<=p0]]]]] & ~ [E [~ [EG [[[1<=p2 & 1<=p5] & 1<=p0]]] U [[1<=p4 & 1<=p6] & ~ [EG [[[1<=p2 & 1<=p5] & 1<=p0]]]]]]] U [[1<=p1 & 1<=p2] & 1<=p0]]]] & E [[~ [EX [E [[1<=p5 & 1<=p6] U 1<=p3]]] & ~ [[~ [EG [~ [EX [[[1<=p1 & 1<=p2] & 1<=p0]]]]] & ~ [E [~ [EX [[[1<=p1 & 1<=p2] & 1<=p0]]] U [EX [~ [[1<=p4 & 1<=p6]]] & ~ [EX [[[1<=p1 & 1<=p2] & 1<=p0]]]]]]]]] U E [[[1<=p5 & 1<=p6] & [1<=p0 & 1<=p2]] U [1<=p4 & 1<=p6]]]]
abstracting: (1<=p6)
states: 4,036,752 (6)
abstracting: (1<=p4)
states: 3,884,364 (6)
abstracting: (1<=p2)
states: 3,737,756 (6)
abstracting: (1<=p0)
states: 4,077,909 (6)
abstracting: (1<=p6)
states: 4,036,752 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p0)
states: 4,077,909 (6)
abstracting: (1<=p2)
states: 3,737,756 (6)
abstracting: (1<=p1)
states: 3,884,364 (6)
.abstracting: (1<=p6)
states: 4,036,752 (6)
abstracting: (1<=p4)
states: 3,884,364 (6)
.abstracting: (1<=p0)
states: 4,077,909 (6)
abstracting: (1<=p2)
states: 3,737,756 (6)
abstracting: (1<=p1)
states: 3,884,364 (6)
.abstracting: (1<=p0)
states: 4,077,909 (6)
abstracting: (1<=p2)
states: 3,737,756 (6)
abstracting: (1<=p1)
states: 3,884,364 (6)
..
EG iterations: 1
abstracting: (1<=p3)
states: 3,562,724 (6)
abstracting: (1<=p6)
states: 4,036,752 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
.abstracting: (1<=p0)
states: 4,077,909 (6)
abstracting: (1<=p2)
states: 3,737,756 (6)
abstracting: (1<=p1)
states: 3,884,364 (6)
abstracting: (1<=p0)
states: 4,077,909 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p2)
states: 3,737,756 (6)
.
EG iterations: 1
abstracting: (1<=p6)
states: 4,036,752 (6)
abstracting: (1<=p4)
states: 3,884,364 (6)
abstracting: (1<=p0)
states: 4,077,909 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p2)
states: 3,737,756 (6)
.
EG iterations: 1
abstracting: (1<=p0)
states: 4,077,909 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p2)
states: 3,737,756 (6)
.
EG iterations: 1
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p0)
states: 4,077,909 (6)
abstracting: (1<=p4)
states: 3,884,364 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p2)
states: 3,737,756 (6)
-> the formula is FALSE
FORMULA SmallOperatingSystem-PT-MT0064DC0016-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.072sec
checking: A [[[EG [p8<=0] & EG [1<=p8]] & [1<=p7 & [1<=p3 | [1<=p0 & [1<=p1 & 1<=p2]]]]] U A [[EX [[[1<=p0 & [1<=p2 & 1<=p5]] | AF [[1<=p0 & [1<=p2 & 1<=p5]]]]] & [~ [[1<=p3 | [1<=p4 & 1<=p6]]] | ~ [EX [[1<=p0 & [1<=p1 & 1<=p2]]]]]] U A [EG [[1<=p7 | 1<=p4]] U ~ [[EF [[1<=p5 & 1<=p6]] | [1<=p0 & [1<=p2 & 1<=p5]]]]]]]
normalized: [~ [EG [~ [[~ [EG [~ [[~ [EG [[[[1<=p2 & 1<=p5] & 1<=p0] | E [true U [1<=p5 & 1<=p6]]]]] & ~ [E [[[[1<=p2 & 1<=p5] & 1<=p0] | E [true U [1<=p5 & 1<=p6]]] U [~ [EG [[1<=p7 | 1<=p4]]] & [[[1<=p2 & 1<=p5] & 1<=p0] | E [true U [1<=p5 & 1<=p6]]]]]]]]]] & ~ [E [~ [[~ [EG [[[[1<=p2 & 1<=p5] & 1<=p0] | E [true U [1<=p5 & 1<=p6]]]]] & ~ [E [[[[1<=p2 & 1<=p5] & 1<=p0] | E [true U [1<=p5 & 1<=p6]]] U [~ [EG [[1<=p7 | 1<=p4]]] & [[[1<=p2 & 1<=p5] & 1<=p0] | E [true U [1<=p5 & 1<=p6]]]]]]]] U [~ [[[~ [EX [[[1<=p1 & 1<=p2] & 1<=p0]]] | ~ [[[1<=p4 & 1<=p6] | 1<=p3]]] & EX [[~ [EG [~ [[[1<=p2 & 1<=p5] & 1<=p0]]]] | [[1<=p2 & 1<=p5] & 1<=p0]]]]] & ~ [[~ [EG [[[[1<=p2 & 1<=p5] & 1<=p0] | E [true U [1<=p5 & 1<=p6]]]]] & ~ [E [[[[1<=p2 & 1<=p5] & 1<=p0] | E [true U [1<=p5 & 1<=p6]]] U [~ [EG [[1<=p7 | 1<=p4]]] & [[[1<=p2 & 1<=p5] & 1<=p0] | E [true U [1<=p5 & 1<=p6]]]]]]]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[~ [EG [[[[1<=p2 & 1<=p5] & 1<=p0] | E [true U [1<=p5 & 1<=p6]]]]] & ~ [E [[[[1<=p2 & 1<=p5] & 1<=p0] | E [true U [1<=p5 & 1<=p6]]] U [~ [EG [[1<=p7 | 1<=p4]]] & [[[1<=p2 & 1<=p5] & 1<=p0] | E [true U [1<=p5 & 1<=p6]]]]]]]]]] & ~ [E [~ [[~ [EG [[[[1<=p2 & 1<=p5] & 1<=p0] | E [true U [1<=p5 & 1<=p6]]]]] & ~ [E [[[[1<=p2 & 1<=p5] & 1<=p0] | E [true U [1<=p5 & 1<=p6]]] U [~ [EG [[1<=p7 | 1<=p4]]] & [[[1<=p2 & 1<=p5] & 1<=p0] | E [true U [1<=p5 & 1<=p6]]]]]]]] U [~ [[[~ [EX [[[1<=p1 & 1<=p2] & 1<=p0]]] | ~ [[[1<=p4 & 1<=p6] | 1<=p3]]] & EX [[~ [EG [~ [[[1<=p2 & 1<=p5] & 1<=p0]]]] | [[1<=p2 & 1<=p5] & 1<=p0]]]]] & ~ [[~ [EG [[[[1<=p2 & 1<=p5] & 1<=p0] | E [true U [1<=p5 & 1<=p6]]]]] & ~ [E [[[[1<=p2 & 1<=p5] & 1<=p0] | E [true U [1<=p5 & 1<=p6]]] U [~ [EG [[1<=p7 | 1<=p4]]] & [[[1<=p2 & 1<=p5] & 1<=p0] | E [true U [1<=p5 & 1<=p6]]]]]]]]]]]]] U [~ [[[[[[1<=p1 & 1<=p2] & 1<=p0] | 1<=p3] & 1<=p7] & [EG [1<=p8] & EG [p8<=0]]]] & ~ [[~ [EG [~ [[~ [EG [[[[1<=p2 & 1<=p5] & 1<=p0] | E [true U [1<=p5 & 1<=p6]]]]] & ~ [E [[[[1<=p2 & 1<=p5] & 1<=p0] | E [true U [1<=p5 & 1<=p6]]] U [~ [EG [[1<=p7 | 1<=p4]]] & [[[1<=p2 & 1<=p5] & 1<=p0] | E [true U [1<=p5 & 1<=p6]]]]]]]]]] & ~ [E [~ [[~ [EG [[[[1<=p2 & 1<=p5] & 1<=p0] | E [true U [1<=p5 & 1<=p6]]]]] & ~ [E [[[[1<=p2 & 1<=p5] & 1<=p0] | E [true U [1<=p5 & 1<=p6]]] U [~ [EG [[1<=p7 | 1<=p4]]] & [[[1<=p2 & 1<=p5] & 1<=p0] | E [true U [1<=p5 & 1<=p6]]]]]]]] U [~ [[[~ [EX [[[1<=p1 & 1<=p2] & 1<=p0]]] | ~ [[[1<=p4 & 1<=p6] | 1<=p3]]] & EX [[~ [EG [~ [[[1<=p2 & 1<=p5] & 1<=p0]]]] | [[1<=p2 & 1<=p5] & 1<=p0]]]]] & ~ [[~ [EG [[[[1<=p2 & 1<=p5] & 1<=p0] | E [true U [1<=p5 & 1<=p6]]]]] & ~ [E [[[[1<=p2 & 1<=p5] & 1<=p0] | E [true U [1<=p5 & 1<=p6]]] U [~ [EG [[1<=p7 | 1<=p4]]] & [[[1<=p2 & 1<=p5] & 1<=p0] | E [true U [1<=p5 & 1<=p6]]]]]]]]]]]]]]]]]
abstracting: (1<=p6)
states: 4,036,752 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p0)
states: 4,077,909 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p2)
states: 3,737,756 (6)
abstracting: (1<=p4)
states: 3,884,364 (6)
abstracting: (1<=p7)
states: 3,846,624 (6)
.
EG iterations: 1
abstracting: (1<=p6)
states: 4,036,752 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p0)
states: 4,077,909 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p2)
states: 3,737,756 (6)
abstracting: (1<=p6)
states: 4,036,752 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p0)
states: 4,077,909 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p2)
states: 3,737,756 (6)
EG iterations: 0
abstracting: (1<=p0)
states: 4,077,909 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p2)
states: 3,737,756 (6)
abstracting: (1<=p0)
states: 4,077,909 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p2)
states: 3,737,756 (6)
.
EG iterations: 1
.abstracting: (1<=p3)
states: 3,562,724 (6)
abstracting: (1<=p6)
states: 4,036,752 (6)
abstracting: (1<=p4)
states: 3,884,364 (6)
abstracting: (1<=p0)
states: 4,077,909 (6)
abstracting: (1<=p2)
states: 3,737,756 (6)
abstracting: (1<=p1)
states: 3,884,364 (6)
.abstracting: (1<=p6)
states: 4,036,752 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p0)
states: 4,077,909 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p2)
states: 3,737,756 (6)
abstracting: (1<=p4)
states: 3,884,364 (6)
abstracting: (1<=p7)
states: 3,846,624 (6)
.
EG iterations: 1
abstracting: (1<=p6)
states: 4,036,752 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p0)
states: 4,077,909 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p2)
states: 3,737,756 (6)
abstracting: (1<=p6)
states: 4,036,752 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p0)
states: 4,077,909 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p2)
states: 3,737,756 (6)
EG iterations: 0
abstracting: (1<=p6)
states: 4,036,752 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p0)
states: 4,077,909 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p2)
states: 3,737,756 (6)
abstracting: (1<=p4)
states: 3,884,364 (6)
abstracting: (1<=p7)
states: 3,846,624 (6)
.
EG iterations: 1
abstracting: (1<=p6)
states: 4,036,752 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p0)
states: 4,077,909 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p2)
states: 3,737,756 (6)
abstracting: (1<=p6)
states: 4,036,752 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p0)
states: 4,077,909 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p2)
states: 3,737,756 (6)
EG iterations: 0
EG iterations: 0
abstracting: (p8<=0)
states: 515,185 (5)
..
EG iterations: 2
abstracting: (1<=p8)
states: 3,562,724 (6)
.
EG iterations: 1
abstracting: (1<=p7)
states: 3,846,624 (6)
abstracting: (1<=p3)
states: 3,562,724 (6)
abstracting: (1<=p0)
states: 4,077,909 (6)
abstracting: (1<=p2)
states: 3,737,756 (6)
abstracting: (1<=p1)
states: 3,884,364 (6)
abstracting: (1<=p6)
states: 4,036,752 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p0)
states: 4,077,909 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p2)
states: 3,737,756 (6)
abstracting: (1<=p4)
states: 3,884,364 (6)
abstracting: (1<=p7)
states: 3,846,624 (6)
.
EG iterations: 1
abstracting: (1<=p6)
states: 4,036,752 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p0)
states: 4,077,909 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p2)
states: 3,737,756 (6)
abstracting: (1<=p6)
states: 4,036,752 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p0)
states: 4,077,909 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p2)
states: 3,737,756 (6)
EG iterations: 0
abstracting: (1<=p0)
states: 4,077,909 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p2)
states: 3,737,756 (6)
abstracting: (1<=p0)
states: 4,077,909 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p2)
states: 3,737,756 (6)
.
EG iterations: 1
.abstracting: (1<=p3)
states: 3,562,724 (6)
abstracting: (1<=p6)
states: 4,036,752 (6)
abstracting: (1<=p4)
states: 3,884,364 (6)
abstracting: (1<=p0)
states: 4,077,909 (6)
abstracting: (1<=p2)
states: 3,737,756 (6)
abstracting: (1<=p1)
states: 3,884,364 (6)
.abstracting: (1<=p6)
states: 4,036,752 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p0)
states: 4,077,909 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p2)
states: 3,737,756 (6)
abstracting: (1<=p4)
states: 3,884,364 (6)
abstracting: (1<=p7)
states: 3,846,624 (6)
.
EG iterations: 1
abstracting: (1<=p6)
states: 4,036,752 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p0)
states: 4,077,909 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p2)
states: 3,737,756 (6)
abstracting: (1<=p6)
states: 4,036,752 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p0)
states: 4,077,909 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p2)
states: 3,737,756 (6)
EG iterations: 0
abstracting: (1<=p6)
states: 4,036,752 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p0)
states: 4,077,909 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p2)
states: 3,737,756 (6)
abstracting: (1<=p4)
states: 3,884,364 (6)
abstracting: (1<=p7)
states: 3,846,624 (6)
.
EG iterations: 1
abstracting: (1<=p6)
states: 4,036,752 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p0)
states: 4,077,909 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p2)
states: 3,737,756 (6)
abstracting: (1<=p6)
states: 4,036,752 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p0)
states: 4,077,909 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p2)
states: 3,737,756 (6)
EG iterations: 0
EG iterations: 0
abstracting: (1<=p6)
states: 4,036,752 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p0)
states: 4,077,909 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p2)
states: 3,737,756 (6)
abstracting: (1<=p4)
states: 3,884,364 (6)
abstracting: (1<=p7)
states: 3,846,624 (6)
.
EG iterations: 1
abstracting: (1<=p6)
states: 4,036,752 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p0)
states: 4,077,909 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p2)
states: 3,737,756 (6)
abstracting: (1<=p6)
states: 4,036,752 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p0)
states: 4,077,909 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p2)
states: 3,737,756 (6)
EG iterations: 0
abstracting: (1<=p0)
states: 4,077,909 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p2)
states: 3,737,756 (6)
abstracting: (1<=p0)
states: 4,077,909 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p2)
states: 3,737,756 (6)
.
EG iterations: 1
.abstracting: (1<=p3)
states: 3,562,724 (6)
abstracting: (1<=p6)
states: 4,036,752 (6)
abstracting: (1<=p4)
states: 3,884,364 (6)
abstracting: (1<=p0)
states: 4,077,909 (6)
abstracting: (1<=p2)
states: 3,737,756 (6)
abstracting: (1<=p1)
states: 3,884,364 (6)
.abstracting: (1<=p6)
states: 4,036,752 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p0)
states: 4,077,909 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p2)
states: 3,737,756 (6)
abstracting: (1<=p4)
states: 3,884,364 (6)
abstracting: (1<=p7)
states: 3,846,624 (6)
.
EG iterations: 1
abstracting: (1<=p6)
states: 4,036,752 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p0)
states: 4,077,909 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p2)
states: 3,737,756 (6)
abstracting: (1<=p6)
states: 4,036,752 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p0)
states: 4,077,909 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p2)
states: 3,737,756 (6)
EG iterations: 0
abstracting: (1<=p6)
states: 4,036,752 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p0)
states: 4,077,909 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p2)
states: 3,737,756 (6)
abstracting: (1<=p4)
states: 3,884,364 (6)
abstracting: (1<=p7)
states: 3,846,624 (6)
.
EG iterations: 1
abstracting: (1<=p6)
states: 4,036,752 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p0)
states: 4,077,909 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p2)
states: 3,737,756 (6)
abstracting: (1<=p6)
states: 4,036,752 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p0)
states: 4,077,909 (6)
abstracting: (1<=p5)
states: 3,884,364 (6)
abstracting: (1<=p2)
states: 3,737,756 (6)
EG iterations: 0
EG iterations: 0
EG iterations: 0
-> the formula is FALSE
FORMULA SmallOperatingSystem-PT-MT0064DC0016-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.017sec
totally nodes used: 387666 (3.9e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 9186115 706136 9892251
used/not used/entry size/cache size: 871141 66237723 16 1024MB
basic ops cache: hits/miss/sum: 3888752 283041 4171793
used/not used/entry size/cache size: 645904 16131312 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: 43066 2400 45466
used/not used/entry size/cache size: 2400 8386208 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 66912911
1 182995
2 2400
3 1746
4 412
5 313
6 448
7 277
8 309
9 254
>= 10 6799
Total processing time: 0m 7.342sec
BK_STOP 1679231317932
--------------------
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:1048 (131), effective:272 (34)
initing FirstDep: 0m 0.000sec
iterations count:22 (2), effective:5 (0)
iterations count:8 (1), effective:0 (0)
iterations count:264 (33), effective:64 (8)
iterations count:22 (2), effective:5 (0)
iterations count:27 (3), effective:7 (0)
iterations count:167 (20), effective:45 (5)
iterations count:24 (3), effective:16 (2)
iterations count:22 (2), effective:5 (0)
iterations count:30 (3), effective:6 (0)
iterations count:38 (4), effective:10 (1)
iterations count:24 (3), effective:16 (2)
iterations count:8 (1), effective:0 (0)
iterations count:46 (5), effective:14 (1)
iterations count:264 (33), effective:64 (8)
iterations count:46 (5), effective:14 (1)
iterations count:264 (33), effective:64 (8)
iterations count:23 (2), effective:15 (1)
iterations count:46 (5), effective:14 (1)
iterations count:264 (33), effective:64 (8)
iterations count:8 (1), effective:0 (0)
iterations count:8951 (1118), effective:2303 (287)
iterations count:27 (3), effective:7 (0)
iterations count:19 (2), effective:4 (0)
iterations count:194 (24), effective:31 (3)
iterations count:15 (1), effective:2 (0)
iterations count:8 (1), effective:0 (0)
iterations count:111 (13), effective:35 (4)
iterations count:20 (2), effective:4 (0)
iterations count:35 (4), effective:9 (1)
iterations count:24 (3), effective:5 (0)
iterations count:24 (3), effective:5 (0)
iterations count:392 (49), effective:96 (12)
iterations count:24 (3), effective:5 (0)
iterations count:24 (3), effective:5 (0)
iterations count:24 (3), effective:5 (0)
iterations count:392 (49), effective:96 (12)
iterations count:24 (3), effective:5 (0)
iterations count:135 (16), effective:37 (4)
iterations count:24 (3), effective:5 (0)
iterations count:24 (3), effective:5 (0)
iterations count:392 (49), effective:96 (12)
iterations count:24 (3), effective:5 (0)
iterations count:24 (3), effective:5 (0)
iterations count:24 (3), effective:5 (0)
iterations count:392 (49), effective:96 (12)
iterations count:24 (3), effective:5 (0)
iterations count:24 (3), effective:5 (0)
iterations count:24 (3), effective:5 (0)
iterations count:392 (49), effective:96 (12)
iterations count:24 (3), effective:5 (0)
iterations count:135 (16), effective:37 (4)
iterations count:24 (3), effective:5 (0)
iterations count:24 (3), effective:5 (0)
iterations count:392 (49), effective:96 (12)
iterations count:24 (3), effective:5 (0)
iterations count:8 (1), effective:0 (0)
iterations count:24 (3), effective:5 (0)
iterations count:24 (3), effective:5 (0)
iterations count:392 (49), effective:96 (12)
iterations count:24 (3), effective:5 (0)
iterations count:24 (3), effective:5 (0)
iterations count:24 (3), effective:5 (0)
iterations count:392 (49), effective:96 (12)
iterations count:24 (3), effective:5 (0)
iterations count:135 (16), effective:37 (4)
iterations count:24 (3), effective:5 (0)
iterations count:24 (3), effective:5 (0)
iterations count:392 (49), effective:96 (12)
iterations count:24 (3), effective:5 (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="SmallOperatingSystem-PT-MT0064DC0016"
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 SmallOperatingSystem-PT-MT0064DC0016, 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 r458-smll-167912649700026"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SmallOperatingSystem-PT-MT0064DC0016.tgz
mv SmallOperatingSystem-PT-MT0064DC0016 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 ;