About the Execution of Marcie+red for CircadianClock-PT-000010
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5449.695 | 12047.00 | 16408.00 | 530.20 | FTTFTFTTTFFTTFFF | 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.r074-smll-167814399900106.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 CircadianClock-PT-000010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r074-smll-167814399900106
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 7.4K Feb 26 10:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 10:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 10:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 10:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 15:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 10:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 26 10:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 10:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 26 10:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 11K Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME CircadianClock-PT-000010-CTLFireability-00
FORMULA_NAME CircadianClock-PT-000010-CTLFireability-01
FORMULA_NAME CircadianClock-PT-000010-CTLFireability-02
FORMULA_NAME CircadianClock-PT-000010-CTLFireability-03
FORMULA_NAME CircadianClock-PT-000010-CTLFireability-04
FORMULA_NAME CircadianClock-PT-000010-CTLFireability-05
FORMULA_NAME CircadianClock-PT-000010-CTLFireability-06
FORMULA_NAME CircadianClock-PT-000010-CTLFireability-07
FORMULA_NAME CircadianClock-PT-000010-CTLFireability-08
FORMULA_NAME CircadianClock-PT-000010-CTLFireability-09
FORMULA_NAME CircadianClock-PT-000010-CTLFireability-10
FORMULA_NAME CircadianClock-PT-000010-CTLFireability-11
FORMULA_NAME CircadianClock-PT-000010-CTLFireability-12
FORMULA_NAME CircadianClock-PT-000010-CTLFireability-13
FORMULA_NAME CircadianClock-PT-000010-CTLFireability-14
FORMULA_NAME CircadianClock-PT-000010-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1678299466881
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=CircadianClock-PT-000010
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-08 18:17:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 18:17:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 18:17:50] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2023-03-08 18:17:50] [INFO ] Transformed 14 places.
[2023-03-08 18:17:50] [INFO ] Transformed 16 transitions.
[2023-03-08 18:17:50] [INFO ] Parsed PT model containing 14 places and 16 transitions and 58 arcs in 243 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 26 ms.
Initial state reduction rules removed 2 formulas.
FORMULA CircadianClock-PT-000010-CTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircadianClock-PT-000010-CTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 14 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 25 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-08 18:17:50] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2023-03-08 18:17:50] [INFO ] Computed 7 place invariants in 7 ms
[2023-03-08 18:17:50] [INFO ] Implicit Places using invariants in 241 ms returned []
[2023-03-08 18:17:50] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 18:17:50] [INFO ] Invariant cache hit.
[2023-03-08 18:17:50] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 18:17:50] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
[2023-03-08 18:17:50] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 18:17:50] [INFO ] Invariant cache hit.
[2023-03-08 18:17:50] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 462 ms. Remains : 14/14 places, 16/16 transitions.
Support contains 14 out of 14 places after structural reductions.
[2023-03-08 18:17:51] [INFO ] Flatten gal took : 33 ms
[2023-03-08 18:17:51] [INFO ] Flatten gal took : 11 ms
[2023-03-08 18:17:51] [INFO ] Input system was already deterministic with 16 transitions.
Finished random walk after 1635 steps, including 0 resets, run visited all 38 properties in 83 ms. (steps per millisecond=19 )
[2023-03-08 18:17:51] [INFO ] Flatten gal took : 6 ms
[2023-03-08 18:17:51] [INFO ] Flatten gal took : 9 ms
[2023-03-08 18:17:51] [INFO ] Input system was already deterministic with 16 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 2 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 14/14 places, 16/16 transitions.
[2023-03-08 18:17:51] [INFO ] Flatten gal took : 4 ms
[2023-03-08 18:17:51] [INFO ] Flatten gal took : 4 ms
[2023-03-08 18:17:51] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 14/14 places, 16/16 transitions.
[2023-03-08 18:17:51] [INFO ] Flatten gal took : 4 ms
[2023-03-08 18:17:51] [INFO ] Flatten gal took : 3 ms
[2023-03-08 18:17:51] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 14/14 places, 16/16 transitions.
[2023-03-08 18:17:51] [INFO ] Flatten gal took : 3 ms
[2023-03-08 18:17:51] [INFO ] Flatten gal took : 4 ms
[2023-03-08 18:17:51] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 14/14 places, 16/16 transitions.
[2023-03-08 18:17:51] [INFO ] Flatten gal took : 3 ms
[2023-03-08 18:17:51] [INFO ] Flatten gal took : 4 ms
[2023-03-08 18:17:51] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 14/14 places, 16/16 transitions.
[2023-03-08 18:17:51] [INFO ] Flatten gal took : 3 ms
[2023-03-08 18:17:51] [INFO ] Flatten gal took : 4 ms
[2023-03-08 18:17:51] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 5 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 14/14 places, 16/16 transitions.
[2023-03-08 18:17:51] [INFO ] Flatten gal took : 4 ms
[2023-03-08 18:17:51] [INFO ] Flatten gal took : 3 ms
[2023-03-08 18:17:51] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 14/14 places, 16/16 transitions.
[2023-03-08 18:17:51] [INFO ] Flatten gal took : 3 ms
[2023-03-08 18:17:51] [INFO ] Flatten gal took : 3 ms
[2023-03-08 18:17:51] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 14/14 places, 16/16 transitions.
[2023-03-08 18:17:51] [INFO ] Flatten gal took : 3 ms
[2023-03-08 18:17:51] [INFO ] Flatten gal took : 3 ms
[2023-03-08 18:17:51] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 14/14 places, 16/16 transitions.
[2023-03-08 18:17:51] [INFO ] Flatten gal took : 3 ms
[2023-03-08 18:17:51] [INFO ] Flatten gal took : 3 ms
[2023-03-08 18:17:51] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 14/14 places, 16/16 transitions.
[2023-03-08 18:17:51] [INFO ] Flatten gal took : 2 ms
[2023-03-08 18:17:51] [INFO ] Flatten gal took : 3 ms
[2023-03-08 18:17:51] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 14/14 places, 16/16 transitions.
[2023-03-08 18:17:51] [INFO ] Flatten gal took : 3 ms
[2023-03-08 18:17:51] [INFO ] Flatten gal took : 3 ms
[2023-03-08 18:17:51] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 14/14 places, 16/16 transitions.
[2023-03-08 18:17:51] [INFO ] Flatten gal took : 2 ms
[2023-03-08 18:17:51] [INFO ] Flatten gal took : 3 ms
[2023-03-08 18:17:51] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 14/14 places, 16/16 transitions.
[2023-03-08 18:17:51] [INFO ] Flatten gal took : 2 ms
[2023-03-08 18:17:51] [INFO ] Flatten gal took : 3 ms
[2023-03-08 18:17:51] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 14/14 places, 16/16 transitions.
[2023-03-08 18:17:51] [INFO ] Flatten gal took : 2 ms
[2023-03-08 18:17:51] [INFO ] Flatten gal took : 2 ms
[2023-03-08 18:17:51] [INFO ] Input system was already deterministic with 16 transitions.
[2023-03-08 18:17:51] [INFO ] Flatten gal took : 4 ms
[2023-03-08 18:17:51] [INFO ] Flatten gal took : 5 ms
[2023-03-08 18:17:51] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 6 ms.
[2023-03-08 18:17:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 14 places, 16 transitions and 58 arcs took 1 ms.
Total runtime 1942 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: 14 NrTr: 16 NrArc: 58)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 3.740sec
RS generation: 0m 0.002sec
-> reachability set: #nodes 66 (6.6e+01) #states 644,204 (5)
starting MCC model checker
--------------------------
checking: AX [[1<=p8 & AX [EX [AX [[p0<=0 | p4<=0]]]]]]
normalized: ~ [EX [~ [[~ [EX [~ [EX [~ [EX [~ [[p0<=0 | p4<=0]]]]]]]] & 1<=p8]]]]
abstracting: (1<=p8)
states: 585,640 (5)
abstracting: (p4<=0)
states: 322,102 (5)
abstracting: (p0<=0)
states: 58,564 (4)
....-> the formula is FALSE
FORMULA CircadianClock-PT-000010-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: EF [[EF [[1<=p2 & 1<=p11]] & AX [AF [[1<=p5 & 1<=p10]]]]]
normalized: E [true U [~ [EX [EG [~ [[1<=p5 & 1<=p10]]]]] & E [true U [1<=p2 & 1<=p11]]]]
abstracting: (1<=p11)
states: 585,640 (5)
abstracting: (1<=p2)
states: 322,102 (5)
abstracting: (1<=p10)
states: 585,640 (5)
abstracting: (1<=p5)
states: 322,102 (5)
.
EG iterations: 1
.-> the formula is TRUE
FORMULA CircadianClock-PT-000010-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: AG [EF [[A [~ [[[1<=p2 & 1<=p11] | 1<=p7]] U ~ [EX [[1<=p4 & 1<=p10]]]] | [p8<=0 & [p3<=0 | p11<=0]]]]]
normalized: ~ [E [true U ~ [E [true U [[[p3<=0 | p11<=0] & p8<=0] | [~ [EG [EX [[1<=p4 & 1<=p10]]]] & ~ [E [EX [[1<=p4 & 1<=p10]] U [[[1<=p2 & 1<=p11] | 1<=p7] & EX [[1<=p4 & 1<=p10]]]]]]]]]]]
abstracting: (1<=p10)
states: 585,640 (5)
abstracting: (1<=p4)
states: 322,102 (5)
.abstracting: (1<=p7)
states: 585,640 (5)
abstracting: (1<=p11)
states: 585,640 (5)
abstracting: (1<=p2)
states: 322,102 (5)
abstracting: (1<=p10)
states: 585,640 (5)
abstracting: (1<=p4)
states: 322,102 (5)
.abstracting: (1<=p10)
states: 585,640 (5)
abstracting: (1<=p4)
states: 322,102 (5)
..
EG iterations: 1
abstracting: (p8<=0)
states: 58,564 (4)
abstracting: (p11<=0)
states: 58,564 (4)
abstracting: (p3<=0)
states: 322,102 (5)
-> the formula is TRUE
FORMULA CircadianClock-PT-000010-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: EG [~ [A [~ [[1<=p6 & 1<=p13]] U E [[AG [[1<=p5 & 1<=p10]] | ~ [[1<=p3 & 1<=p11]]] U EX [[1<=p3 & 1<=p13]]]]]]
normalized: EG [~ [[~ [EG [~ [E [[~ [[1<=p3 & 1<=p11]] | ~ [E [true U ~ [[1<=p5 & 1<=p10]]]]] U EX [[1<=p3 & 1<=p13]]]]]] & ~ [E [~ [E [[~ [[1<=p3 & 1<=p11]] | ~ [E [true U ~ [[1<=p5 & 1<=p10]]]]] U EX [[1<=p3 & 1<=p13]]]] U [[1<=p6 & 1<=p13] & ~ [E [[~ [[1<=p3 & 1<=p11]] | ~ [E [true U ~ [[1<=p5 & 1<=p10]]]]] U EX [[1<=p3 & 1<=p13]]]]]]]]]]
abstracting: (1<=p13)
states: 585,640 (5)
abstracting: (1<=p3)
states: 322,102 (5)
.abstracting: (1<=p10)
states: 585,640 (5)
abstracting: (1<=p5)
states: 322,102 (5)
abstracting: (1<=p11)
states: 585,640 (5)
abstracting: (1<=p3)
states: 322,102 (5)
abstracting: (1<=p13)
states: 585,640 (5)
abstracting: (1<=p6)
states: 585,640 (5)
abstracting: (1<=p13)
states: 585,640 (5)
abstracting: (1<=p3)
states: 322,102 (5)
.abstracting: (1<=p10)
states: 585,640 (5)
abstracting: (1<=p5)
states: 322,102 (5)
abstracting: (1<=p11)
states: 585,640 (5)
abstracting: (1<=p3)
states: 322,102 (5)
abstracting: (1<=p13)
states: 585,640 (5)
abstracting: (1<=p3)
states: 322,102 (5)
.abstracting: (1<=p10)
states: 585,640 (5)
abstracting: (1<=p5)
states: 322,102 (5)
abstracting: (1<=p11)
states: 585,640 (5)
abstracting: (1<=p3)
states: 322,102 (5)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE
FORMULA CircadianClock-PT-000010-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: ~ [A [EF [AX [~ [[[1<=p5 & 1<=p10] | 1<=p7]]]] U EG [E [~ [[[1<=p5 & 1<=p10] | [1<=p0 & 1<=p2]]] U AG [[1<=p0 & [1<=p8 & 1<=p12]]]]]]]
normalized: ~ [[~ [EG [~ [EG [E [~ [[[1<=p0 & 1<=p2] | [1<=p5 & 1<=p10]]] U ~ [E [true U ~ [[[1<=p8 & 1<=p12] & 1<=p0]]]]]]]]] & ~ [E [~ [EG [E [~ [[[1<=p0 & 1<=p2] | [1<=p5 & 1<=p10]]] U ~ [E [true U ~ [[[1<=p8 & 1<=p12] & 1<=p0]]]]]]] U [~ [EG [E [~ [[[1<=p0 & 1<=p2] | [1<=p5 & 1<=p10]]] U ~ [E [true U ~ [[[1<=p8 & 1<=p12] & 1<=p0]]]]]]] & ~ [E [true U ~ [EX [[[1<=p5 & 1<=p10] | 1<=p7]]]]]]]]]]
abstracting: (1<=p7)
states: 585,640 (5)
abstracting: (1<=p10)
states: 585,640 (5)
abstracting: (1<=p5)
states: 322,102 (5)
.abstracting: (1<=p0)
states: 585,640 (5)
abstracting: (1<=p12)
states: 585,640 (5)
abstracting: (1<=p8)
states: 585,640 (5)
abstracting: (1<=p10)
states: 585,640 (5)
abstracting: (1<=p5)
states: 322,102 (5)
abstracting: (1<=p2)
states: 322,102 (5)
abstracting: (1<=p0)
states: 585,640 (5)
.
EG iterations: 1
abstracting: (1<=p0)
states: 585,640 (5)
abstracting: (1<=p12)
states: 585,640 (5)
abstracting: (1<=p8)
states: 585,640 (5)
abstracting: (1<=p10)
states: 585,640 (5)
abstracting: (1<=p5)
states: 322,102 (5)
abstracting: (1<=p2)
states: 322,102 (5)
abstracting: (1<=p0)
states: 585,640 (5)
.
EG iterations: 1
abstracting: (1<=p0)
states: 585,640 (5)
abstracting: (1<=p12)
states: 585,640 (5)
abstracting: (1<=p8)
states: 585,640 (5)
abstracting: (1<=p10)
states: 585,640 (5)
abstracting: (1<=p5)
states: 322,102 (5)
abstracting: (1<=p2)
states: 322,102 (5)
abstracting: (1<=p0)
states: 585,640 (5)
.
EG iterations: 1
EG iterations: 0
-> the formula is TRUE
FORMULA CircadianClock-PT-000010-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: EF [AG [[EX [[EX [[1<=p7 & 1<=p9]] | [p4<=0 | p10<=0]]] | [1<=p7 & [EF [[1<=p0 & [1<=p8 & 1<=p12]]] | [AG [1<=p7] | [[1<=p9 & 1<=p0] & [1<=p8 & 1<=p12]]]]]]]]
normalized: E [true U ~ [E [true U ~ [[[[[[[1<=p9 & 1<=p0] & [1<=p8 & 1<=p12]] | ~ [E [true U ~ [1<=p7]]]] | E [true U [[1<=p8 & 1<=p12] & 1<=p0]]] & 1<=p7] | EX [[[p4<=0 | p10<=0] | EX [[1<=p7 & 1<=p9]]]]]]]]]
abstracting: (1<=p9)
states: 585,640 (5)
abstracting: (1<=p7)
states: 585,640 (5)
.abstracting: (p10<=0)
states: 58,564 (4)
abstracting: (p4<=0)
states: 322,102 (5)
.abstracting: (1<=p7)
states: 585,640 (5)
abstracting: (1<=p0)
states: 585,640 (5)
abstracting: (1<=p12)
states: 585,640 (5)
abstracting: (1<=p8)
states: 585,640 (5)
abstracting: (1<=p7)
states: 585,640 (5)
abstracting: (1<=p12)
states: 585,640 (5)
abstracting: (1<=p8)
states: 585,640 (5)
abstracting: (1<=p0)
states: 585,640 (5)
abstracting: (1<=p9)
states: 585,640 (5)
-> the formula is TRUE
FORMULA CircadianClock-PT-000010-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: EF [[EG [EX [~ [A [1<=p6 U [1<=p3 & 1<=p13]]]]] | [~ [E [AX [1<=p7] U ~ [EX [[1<=p3 & 1<=p13]]]]] & A [[1<=p5 & 1<=p13] U [1<=p6 & [[1<=p3 & 1<=p11] | [1<=p7 & [1<=p5 & 1<=p13]]]]]]]]
normalized: E [true U [[[~ [EG [~ [[[[[1<=p5 & 1<=p13] & 1<=p7] | [1<=p3 & 1<=p11]] & 1<=p6]]]] & ~ [E [~ [[[[[1<=p5 & 1<=p13] & 1<=p7] | [1<=p3 & 1<=p11]] & 1<=p6]] U [~ [[1<=p5 & 1<=p13]] & ~ [[[[[1<=p5 & 1<=p13] & 1<=p7] | [1<=p3 & 1<=p11]] & 1<=p6]]]]]] & ~ [E [~ [EX [~ [1<=p7]]] U ~ [EX [[1<=p3 & 1<=p13]]]]]] | EG [EX [~ [[~ [EG [~ [[1<=p3 & 1<=p13]]]] & ~ [E [~ [[1<=p3 & 1<=p13]] U [~ [1<=p6] & ~ [[1<=p3 & 1<=p13]]]]]]]]]]]
abstracting: (1<=p13)
states: 585,640 (5)
abstracting: (1<=p3)
states: 322,102 (5)
abstracting: (1<=p6)
states: 585,640 (5)
abstracting: (1<=p13)
states: 585,640 (5)
abstracting: (1<=p3)
states: 322,102 (5)
abstracting: (1<=p13)
states: 585,640 (5)
abstracting: (1<=p3)
states: 322,102 (5)
.
EG iterations: 1
.
EG iterations: 0
abstracting: (1<=p13)
states: 585,640 (5)
abstracting: (1<=p3)
states: 322,102 (5)
.abstracting: (1<=p7)
states: 585,640 (5)
.abstracting: (1<=p6)
states: 585,640 (5)
abstracting: (1<=p11)
states: 585,640 (5)
abstracting: (1<=p3)
states: 322,102 (5)
abstracting: (1<=p7)
states: 585,640 (5)
abstracting: (1<=p13)
states: 585,640 (5)
abstracting: (1<=p5)
states: 322,102 (5)
abstracting: (1<=p13)
states: 585,640 (5)
abstracting: (1<=p5)
states: 322,102 (5)
abstracting: (1<=p6)
states: 585,640 (5)
abstracting: (1<=p11)
states: 585,640 (5)
abstracting: (1<=p3)
states: 322,102 (5)
abstracting: (1<=p7)
states: 585,640 (5)
abstracting: (1<=p13)
states: 585,640 (5)
abstracting: (1<=p5)
states: 322,102 (5)
abstracting: (1<=p6)
states: 585,640 (5)
abstracting: (1<=p11)
states: 585,640 (5)
abstracting: (1<=p3)
states: 322,102 (5)
abstracting: (1<=p7)
states: 585,640 (5)
abstracting: (1<=p13)
states: 585,640 (5)
abstracting: (1<=p5)
states: 322,102 (5)
.
EG iterations: 1
-> the formula is TRUE
FORMULA CircadianClock-PT-000010-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.006sec
checking: [A [[1<=p0 & 1<=p2] U [AF [[[1<=p3 & [1<=p11 & 1<=p7]] | 1<=p8]] | [AX [~ [[1<=p5 & 1<=p10]]] | EX [AX [[1<=p0 & [1<=p8 & 1<=p12]]]]]]] & [EX [1<=p7] | AX [[EX [1<=p0] | EX [[1<=p5 & 1<=p13]]]]]]
normalized: [[~ [EX [~ [[EX [1<=p0] | EX [[1<=p5 & 1<=p13]]]]]] | EX [1<=p7]] & [~ [EG [~ [[[EX [~ [EX [~ [[[1<=p8 & 1<=p12] & 1<=p0]]]]] | ~ [EX [[1<=p5 & 1<=p10]]]] | ~ [EG [~ [[[[1<=p11 & 1<=p7] & 1<=p3] | 1<=p8]]]]]]]] & ~ [E [~ [[[EX [~ [EX [~ [[[1<=p8 & 1<=p12] & 1<=p0]]]]] | ~ [EX [[1<=p5 & 1<=p10]]]] | ~ [EG [~ [[[[1<=p11 & 1<=p7] & 1<=p3] | 1<=p8]]]]]] U [~ [[1<=p0 & 1<=p2]] & ~ [[[EX [~ [EX [~ [[[1<=p8 & 1<=p12] & 1<=p0]]]]] | ~ [EX [[1<=p5 & 1<=p10]]]] | ~ [EG [~ [[[[1<=p11 & 1<=p7] & 1<=p3] | 1<=p8]]]]]]]]]]]
abstracting: (1<=p8)
states: 585,640 (5)
abstracting: (1<=p3)
states: 322,102 (5)
abstracting: (1<=p7)
states: 585,640 (5)
abstracting: (1<=p11)
states: 585,640 (5)
.
EG iterations: 1
abstracting: (1<=p10)
states: 585,640 (5)
abstracting: (1<=p5)
states: 322,102 (5)
.abstracting: (1<=p0)
states: 585,640 (5)
abstracting: (1<=p12)
states: 585,640 (5)
abstracting: (1<=p8)
states: 585,640 (5)
..abstracting: (1<=p2)
states: 322,102 (5)
abstracting: (1<=p0)
states: 585,640 (5)
abstracting: (1<=p8)
states: 585,640 (5)
abstracting: (1<=p3)
states: 322,102 (5)
abstracting: (1<=p7)
states: 585,640 (5)
abstracting: (1<=p11)
states: 585,640 (5)
.
EG iterations: 1
abstracting: (1<=p10)
states: 585,640 (5)
abstracting: (1<=p5)
states: 322,102 (5)
.abstracting: (1<=p0)
states: 585,640 (5)
abstracting: (1<=p12)
states: 585,640 (5)
abstracting: (1<=p8)
states: 585,640 (5)
..abstracting: (1<=p8)
states: 585,640 (5)
abstracting: (1<=p3)
states: 322,102 (5)
abstracting: (1<=p7)
states: 585,640 (5)
abstracting: (1<=p11)
states: 585,640 (5)
.
EG iterations: 1
abstracting: (1<=p10)
states: 585,640 (5)
abstracting: (1<=p5)
states: 322,102 (5)
.abstracting: (1<=p0)
states: 585,640 (5)
abstracting: (1<=p12)
states: 585,640 (5)
abstracting: (1<=p8)
states: 585,640 (5)
...
EG iterations: 1
abstracting: (1<=p7)
states: 585,640 (5)
.abstracting: (1<=p13)
states: 585,640 (5)
abstracting: (1<=p5)
states: 322,102 (5)
.abstracting: (1<=p0)
states: 585,640 (5)
..-> the formula is TRUE
FORMULA CircadianClock-PT-000010-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.006sec
checking: [A [[A [[1<=p0 & 1<=p2] U [1<=p3 & 1<=p13]] & ~ [[[[1<=p5 & 1<=p10] & [1<=p0 & 1<=p2]] | ~ [[1<=p0 & 1<=p4]]]]] U E [AG [[1<=p0 & 1<=p2]] U AF [[1<=p7 & 1<=p9]]]] | AF [AX [AF [AG [p7<=0]]]]]
normalized: [~ [EG [EX [EG [E [true U ~ [p7<=0]]]]]] | [~ [EG [~ [E [~ [E [true U ~ [[1<=p0 & 1<=p2]]]] U ~ [EG [~ [[1<=p7 & 1<=p9]]]]]]]] & ~ [E [~ [E [~ [E [true U ~ [[1<=p0 & 1<=p2]]]] U ~ [EG [~ [[1<=p7 & 1<=p9]]]]]] U [~ [[~ [[~ [[1<=p0 & 1<=p4]] | [[1<=p0 & 1<=p2] & [1<=p5 & 1<=p10]]]] & [~ [EG [~ [[1<=p3 & 1<=p13]]]] & ~ [E [~ [[1<=p3 & 1<=p13]] U [~ [[1<=p0 & 1<=p2]] & ~ [[1<=p3 & 1<=p13]]]]]]]] & ~ [E [~ [E [true U ~ [[1<=p0 & 1<=p2]]]] U ~ [EG [~ [[1<=p7 & 1<=p9]]]]]]]]]]]
abstracting: (1<=p9)
states: 585,640 (5)
abstracting: (1<=p7)
states: 585,640 (5)
.
EG iterations: 1
abstracting: (1<=p2)
states: 322,102 (5)
abstracting: (1<=p0)
states: 585,640 (5)
abstracting: (1<=p13)
states: 585,640 (5)
abstracting: (1<=p3)
states: 322,102 (5)
abstracting: (1<=p2)
states: 322,102 (5)
abstracting: (1<=p0)
states: 585,640 (5)
abstracting: (1<=p13)
states: 585,640 (5)
abstracting: (1<=p3)
states: 322,102 (5)
abstracting: (1<=p13)
states: 585,640 (5)
abstracting: (1<=p3)
states: 322,102 (5)
.
EG iterations: 1
abstracting: (1<=p10)
states: 585,640 (5)
abstracting: (1<=p5)
states: 322,102 (5)
abstracting: (1<=p2)
states: 322,102 (5)
abstracting: (1<=p0)
states: 585,640 (5)
abstracting: (1<=p4)
states: 322,102 (5)
abstracting: (1<=p0)
states: 585,640 (5)
abstracting: (1<=p9)
states: 585,640 (5)
abstracting: (1<=p7)
states: 585,640 (5)
.
EG iterations: 1
abstracting: (1<=p2)
states: 322,102 (5)
abstracting: (1<=p0)
states: 585,640 (5)
abstracting: (1<=p9)
states: 585,640 (5)
abstracting: (1<=p7)
states: 585,640 (5)
.
EG iterations: 1
abstracting: (1<=p2)
states: 322,102 (5)
abstracting: (1<=p0)
states: 585,640 (5)
.
EG iterations: 1
abstracting: (p7<=0)
states: 58,564 (4)
EG iterations: 0
.
EG iterations: 0
-> the formula is FALSE
FORMULA CircadianClock-PT-000010-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.005sec
checking: EX [E [[A [[[1<=p7 & 1<=p5] & [1<=p10 & ~ [[1<=p0 & 1<=p2]]]] U ~ [[1<=p0 & 1<=p4]]] & [[1<=p1 & 1<=p9] | [[1<=p0 & [1<=p8 & 1<=p12]] | [1<=p3 & 1<=p13]]]] U AX [[1<=p0 & 1<=p4]]]]
normalized: EX [E [[[[[1<=p3 & 1<=p13] | [[1<=p8 & 1<=p12] & 1<=p0]] | [1<=p1 & 1<=p9]] & [~ [EG [[1<=p0 & 1<=p4]]] & ~ [E [[1<=p0 & 1<=p4] U [~ [[[~ [[1<=p0 & 1<=p2]] & 1<=p10] & [1<=p7 & 1<=p5]]] & [1<=p0 & 1<=p4]]]]]] U ~ [EX [~ [[1<=p0 & 1<=p4]]]]]]
abstracting: (1<=p4)
states: 322,102 (5)
abstracting: (1<=p0)
states: 585,640 (5)
.abstracting: (1<=p4)
states: 322,102 (5)
abstracting: (1<=p0)
states: 585,640 (5)
abstracting: (1<=p5)
states: 322,102 (5)
abstracting: (1<=p7)
states: 585,640 (5)
abstracting: (1<=p10)
states: 585,640 (5)
abstracting: (1<=p2)
states: 322,102 (5)
abstracting: (1<=p0)
states: 585,640 (5)
abstracting: (1<=p4)
states: 322,102 (5)
abstracting: (1<=p0)
states: 585,640 (5)
abstracting: (1<=p4)
states: 322,102 (5)
abstracting: (1<=p0)
states: 585,640 (5)
.
EG iterations: 1
abstracting: (1<=p9)
states: 585,640 (5)
abstracting: (1<=p1)
states: 585,640 (5)
abstracting: (1<=p0)
states: 585,640 (5)
abstracting: (1<=p12)
states: 585,640 (5)
abstracting: (1<=p8)
states: 585,640 (5)
abstracting: (1<=p13)
states: 585,640 (5)
abstracting: (1<=p3)
states: 322,102 (5)
.-> the formula is FALSE
FORMULA CircadianClock-PT-000010-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: [EX [AF [[AX [[p7<=0 | p9<=0]] | EX [1<=p6]]]] & E [~ [AX [AX [[[1<=p4 & 1<=p10] & [1<=p0 & 1<=p2]]]]] U E [EG [[[1<=p2 & 1<=p11] | [[1<=p6 & 1<=p13] | AX [[1<=p1 & 1<=p9]]]]] U [1<=p8 & [AG [[1<=p6 & 1<=p13]] & AF [[1<=p5 & 1<=p10]]]]]]]
normalized: [EX [~ [EG [~ [[EX [1<=p6] | ~ [EX [~ [[p7<=0 | p9<=0]]]]]]]]] & E [EX [EX [~ [[[1<=p0 & 1<=p2] & [1<=p4 & 1<=p10]]]]] U E [EG [[[~ [EX [~ [[1<=p1 & 1<=p9]]]] | [1<=p6 & 1<=p13]] | [1<=p2 & 1<=p11]]] U [[~ [EG [~ [[1<=p5 & 1<=p10]]]] & ~ [E [true U ~ [[1<=p6 & 1<=p13]]]]] & 1<=p8]]]]
abstracting: (1<=p8)
states: 585,640 (5)
abstracting: (1<=p13)
states: 585,640 (5)
abstracting: (1<=p6)
states: 585,640 (5)
abstracting: (1<=p10)
states: 585,640 (5)
abstracting: (1<=p5)
states: 322,102 (5)
.
EG iterations: 1
abstracting: (1<=p11)
states: 585,640 (5)
abstracting: (1<=p2)
states: 322,102 (5)
abstracting: (1<=p13)
states: 585,640 (5)
abstracting: (1<=p6)
states: 585,640 (5)
abstracting: (1<=p9)
states: 585,640 (5)
abstracting: (1<=p1)
states: 585,640 (5)
..
EG iterations: 1
abstracting: (1<=p10)
states: 585,640 (5)
abstracting: (1<=p4)
states: 322,102 (5)
abstracting: (1<=p2)
states: 322,102 (5)
abstracting: (1<=p0)
states: 585,640 (5)
..abstracting: (p9<=0)
states: 58,564 (4)
abstracting: (p7<=0)
states: 58,564 (4)
.abstracting: (1<=p6)
states: 585,640 (5)
..
EG iterations: 1
.-> the formula is FALSE
FORMULA CircadianClock-PT-000010-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: AF [[[AG [[[AG [[p1<=0 | p9<=0]] | p4<=0] | [p10<=0 | [p0<=0 | p4<=0]]]] & [EF [[[p5<=0 | p13<=0] | [p1<=0 | p9<=0]]] | EX [[[1<=p1 & 1<=p9] & [1<=p2 & [1<=p11 & 1<=p8]]]]]] | [AX [[AF [1<=p7] | EG [[p6<=0 | p13<=0]]]] & 1<=p0]]]
normalized: ~ [EG [~ [[[~ [EX [~ [[EG [[p6<=0 | p13<=0]] | ~ [EG [~ [1<=p7]]]]]]] & 1<=p0] | [[EX [[[[1<=p11 & 1<=p8] & 1<=p2] & [1<=p1 & 1<=p9]]] | E [true U [[p1<=0 | p9<=0] | [p5<=0 | p13<=0]]]] & ~ [E [true U ~ [[[[p0<=0 | p4<=0] | p10<=0] | [~ [E [true U ~ [[p1<=0 | p9<=0]]]] | p4<=0]]]]]]]]]]
abstracting: (p4<=0)
states: 322,102 (5)
abstracting: (p9<=0)
states: 58,564 (4)
abstracting: (p1<=0)
states: 58,564 (4)
abstracting: (p10<=0)
states: 58,564 (4)
abstracting: (p4<=0)
states: 322,102 (5)
abstracting: (p0<=0)
states: 58,564 (4)
abstracting: (p13<=0)
states: 58,564 (4)
abstracting: (p5<=0)
states: 322,102 (5)
abstracting: (p9<=0)
states: 58,564 (4)
abstracting: (p1<=0)
states: 58,564 (4)
abstracting: (1<=p9)
states: 585,640 (5)
abstracting: (1<=p1)
states: 585,640 (5)
abstracting: (1<=p2)
states: 322,102 (5)
abstracting: (1<=p8)
states: 585,640 (5)
abstracting: (1<=p11)
states: 585,640 (5)
.abstracting: (1<=p0)
states: 585,640 (5)
abstracting: (1<=p7)
states: 585,640 (5)
.
EG iterations: 1
abstracting: (p13<=0)
states: 58,564 (4)
abstracting: (p6<=0)
states: 58,564 (4)
.
EG iterations: 1
..
EG iterations: 1
-> the formula is FALSE
FORMULA CircadianClock-PT-000010-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: E [E [EF [[A [[1<=p3 & 1<=p11] U 1<=p8] & [E [[1<=p7 & 1<=p9] U [1<=p0 & [1<=p8 & 1<=p12]]] & [[1<=p1 & 1<=p9] | [1<=p4 & 1<=p10]]]]] U ~ [[[1<=p0 & 1<=p4] | [[[[1<=p5 & 1<=p10] | [1<=p4 & 1<=p10]] & EG [[1<=p3 & 1<=p11]]] | [1<=p6 & 1<=p13]]]]] U AG [~ [EF [[1<=p7 & 1<=p9]]]]]
normalized: E [E [E [true U [[[[1<=p4 & 1<=p10] | [1<=p1 & 1<=p9]] & E [[1<=p7 & 1<=p9] U [[1<=p8 & 1<=p12] & 1<=p0]]] & [~ [EG [~ [1<=p8]]] & ~ [E [~ [1<=p8] U [~ [[1<=p3 & 1<=p11]] & ~ [1<=p8]]]]]]] U ~ [[[[1<=p6 & 1<=p13] | [EG [[1<=p3 & 1<=p11]] & [[1<=p4 & 1<=p10] | [1<=p5 & 1<=p10]]]] | [1<=p0 & 1<=p4]]]] U ~ [E [true U E [true U [1<=p7 & 1<=p9]]]]]
abstracting: (1<=p9)
states: 585,640 (5)
abstracting: (1<=p7)
states: 585,640 (5)
abstracting: (1<=p4)
states: 322,102 (5)
abstracting: (1<=p0)
states: 585,640 (5)
abstracting: (1<=p10)
states: 585,640 (5)
abstracting: (1<=p5)
states: 322,102 (5)
abstracting: (1<=p10)
states: 585,640 (5)
abstracting: (1<=p4)
states: 322,102 (5)
abstracting: (1<=p11)
states: 585,640 (5)
abstracting: (1<=p3)
states: 322,102 (5)
.
EG iterations: 1
abstracting: (1<=p13)
states: 585,640 (5)
abstracting: (1<=p6)
states: 585,640 (5)
abstracting: (1<=p8)
states: 585,640 (5)
abstracting: (1<=p11)
states: 585,640 (5)
abstracting: (1<=p3)
states: 322,102 (5)
abstracting: (1<=p8)
states: 585,640 (5)
abstracting: (1<=p8)
states: 585,640 (5)
.
EG iterations: 1
abstracting: (1<=p0)
states: 585,640 (5)
abstracting: (1<=p12)
states: 585,640 (5)
abstracting: (1<=p8)
states: 585,640 (5)
abstracting: (1<=p9)
states: 585,640 (5)
abstracting: (1<=p7)
states: 585,640 (5)
abstracting: (1<=p9)
states: 585,640 (5)
abstracting: (1<=p1)
states: 585,640 (5)
abstracting: (1<=p10)
states: 585,640 (5)
abstracting: (1<=p4)
states: 322,102 (5)
-> the formula is FALSE
FORMULA CircadianClock-PT-000010-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.006sec
checking: E [~ [EG [EF [p8<=0]]] U [[~ [[AG [EF [[1<=p3 & 1<=p13]]] & [[A [[1<=p3 & 1<=p13] U [1<=p7 & 1<=p9]] & ~ [[1<=p0 & 1<=p4]]] | ~ [AG [[1<=p7 & 1<=p9]]]]]] | AG [EX [[[1<=p3 & 1<=p11] | [1<=p3 & 1<=p13]]]]] & [A [AX [1<=p0] U [~ [E [[1<=p5 & 1<=p10] U [1<=p0 & 1<=p2]]] | ~ [[[1<=p0 & [1<=p8 & 1<=p12]] | 1<=p0]]]] | [~ [[1<=p0 & [1<=p8 & 1<=p12]]] & E [AX [[1<=p4 & 1<=p10]] U ~ [[1<=p8 & 1<=p6]]]]]]]
normalized: E [~ [EG [E [true U p8<=0]]] U [[[E [~ [EX [~ [[1<=p4 & 1<=p10]]]] U ~ [[1<=p8 & 1<=p6]]] & ~ [[[1<=p8 & 1<=p12] & 1<=p0]]] | [~ [EG [~ [[~ [[[[1<=p8 & 1<=p12] & 1<=p0] | 1<=p0]] | ~ [E [[1<=p5 & 1<=p10] U [1<=p0 & 1<=p2]]]]]]] & ~ [E [~ [[~ [[[[1<=p8 & 1<=p12] & 1<=p0] | 1<=p0]] | ~ [E [[1<=p5 & 1<=p10] U [1<=p0 & 1<=p2]]]]] U [EX [~ [1<=p0]] & ~ [[~ [[[[1<=p8 & 1<=p12] & 1<=p0] | 1<=p0]] | ~ [E [[1<=p5 & 1<=p10] U [1<=p0 & 1<=p2]]]]]]]]]] & [~ [E [true U ~ [EX [[[1<=p3 & 1<=p13] | [1<=p3 & 1<=p11]]]]]] | ~ [[[E [true U ~ [[1<=p7 & 1<=p9]]] | [~ [[1<=p0 & 1<=p4]] & [~ [EG [~ [[1<=p7 & 1<=p9]]]] & ~ [E [~ [[1<=p7 & 1<=p9]] U [~ [[1<=p3 & 1<=p13]] & ~ [[1<=p7 & 1<=p9]]]]]]]] & ~ [E [true U ~ [E [true U [1<=p3 & 1<=p13]]]]]]]]]]
abstracting: (1<=p13)
states: 585,640 (5)
abstracting: (1<=p3)
states: 322,102 (5)
abstracting: (1<=p9)
states: 585,640 (5)
abstracting: (1<=p7)
states: 585,640 (5)
abstracting: (1<=p13)
states: 585,640 (5)
abstracting: (1<=p3)
states: 322,102 (5)
abstracting: (1<=p9)
states: 585,640 (5)
abstracting: (1<=p7)
states: 585,640 (5)
abstracting: (1<=p9)
states: 585,640 (5)
abstracting: (1<=p7)
states: 585,640 (5)
.
EG iterations: 1
abstracting: (1<=p4)
states: 322,102 (5)
abstracting: (1<=p0)
states: 585,640 (5)
abstracting: (1<=p9)
states: 585,640 (5)
abstracting: (1<=p7)
states: 585,640 (5)
abstracting: (1<=p11)
states: 585,640 (5)
abstracting: (1<=p3)
states: 322,102 (5)
abstracting: (1<=p13)
states: 585,640 (5)
abstracting: (1<=p3)
states: 322,102 (5)
.abstracting: (1<=p2)
states: 322,102 (5)
abstracting: (1<=p0)
states: 585,640 (5)
abstracting: (1<=p10)
states: 585,640 (5)
abstracting: (1<=p5)
states: 322,102 (5)
abstracting: (1<=p0)
states: 585,640 (5)
abstracting: (1<=p0)
states: 585,640 (5)
abstracting: (1<=p12)
states: 585,640 (5)
abstracting: (1<=p8)
states: 585,640 (5)
abstracting: (1<=p0)
states: 585,640 (5)
.abstracting: (1<=p2)
states: 322,102 (5)
abstracting: (1<=p0)
states: 585,640 (5)
abstracting: (1<=p10)
states: 585,640 (5)
abstracting: (1<=p5)
states: 322,102 (5)
abstracting: (1<=p0)
states: 585,640 (5)
abstracting: (1<=p0)
states: 585,640 (5)
abstracting: (1<=p12)
states: 585,640 (5)
abstracting: (1<=p8)
states: 585,640 (5)
abstracting: (1<=p2)
states: 322,102 (5)
abstracting: (1<=p0)
states: 585,640 (5)
abstracting: (1<=p10)
states: 585,640 (5)
abstracting: (1<=p5)
states: 322,102 (5)
abstracting: (1<=p0)
states: 585,640 (5)
abstracting: (1<=p0)
states: 585,640 (5)
abstracting: (1<=p12)
states: 585,640 (5)
abstracting: (1<=p8)
states: 585,640 (5)
.
EG iterations: 1
abstracting: (1<=p0)
states: 585,640 (5)
abstracting: (1<=p12)
states: 585,640 (5)
abstracting: (1<=p8)
states: 585,640 (5)
abstracting: (1<=p6)
states: 585,640 (5)
abstracting: (1<=p8)
states: 585,640 (5)
abstracting: (1<=p10)
states: 585,640 (5)
abstracting: (1<=p4)
states: 322,102 (5)
.abstracting: (p8<=0)
states: 58,564 (4)
EG iterations: 0
-> the formula is FALSE
FORMULA CircadianClock-PT-000010-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.008sec
totally nodes used: 21943 (2.2e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 63584 66565 130149
used/not used/entry size/cache size: 85536 67023328 16 1024MB
basic ops cache: hits/miss/sum: 23270 22568 45838
used/not used/entry size/cache size: 43517 16733699 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: 986 779 1765
used/not used/entry size/cache size: 779 8387829 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 67087171
1 21541
2 119
3 17
4 7
5 1
6 2
7 1
8 0
9 1
>= 10 4
Total processing time: 0m 5.694sec
BK_STOP 1678299478928
--------------------
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:878 (54), effective:153 (9)
initing FirstDep: 0m 0.000sec
iterations count:31 (1), effective:4 (0)
iterations count:104 (6), effective:18 (1)
iterations count:21 (1), effective:2 (0)
iterations count:64 (4), effective:14 (0)
iterations count:46 (2), effective:10 (0)
iterations count:30 (1), effective:3 (0)
iterations count:46 (2), effective:10 (0)
iterations count:30 (1), effective:3 (0)
iterations count:46 (2), effective:10 (0)
iterations count:30 (1), effective:3 (0)
iterations count:49 (3), effective:11 (0)
iterations count:49 (3), effective:11 (0)
iterations count:16 (1), effective:0 (0)
iterations count:49 (3), effective:11 (0)
iterations count:59 (3), effective:9 (0)
iterations count:26 (1), effective:10 (0)
iterations count:16 (1), effective:0 (0)
iterations count:56 (3), effective:10 (0)
iterations count:60 (3), effective:14 (0)
iterations count:20 (1), effective:1 (0)
iterations count:16 (1), effective:0 (0)
iterations count:49 (3), effective:11 (0)
iterations count:49 (3), effective:11 (0)
iterations count:16 (1), effective:0 (0)
iterations count:49 (3), effective:11 (0)
iterations count:49 (3), effective:11 (0)
iterations count:16 (1), effective:0 (0)
iterations count:19 (1), effective:1 (0)
iterations count:49 (3), effective:11 (0)
iterations count:16 (1), effective:0 (0)
iterations count:21 (1), effective:2 (0)
iterations count:16 (1), effective:0 (0)
iterations count:85 (5), effective:12 (0)
iterations count:67 (4), effective:9 (0)
iterations count:39 (2), effective:6 (0)
iterations count:20 (1), effective:1 (0)
iterations count:23 (1), effective:3 (0)
iterations count:16 (1), effective:0 (0)
iterations count:27 (1), effective:3 (0)
iterations count:54 (3), effective:7 (0)
iterations count:64 (4), effective:12 (0)
iterations count:146 (9), effective:35 (2)
iterations count:40 (2), effective:6 (0)
iterations count:25 (1), effective:2 (0)
iterations count:26 (1), effective:10 (0)
iterations count:60 (3), effective:14 (0)
iterations count:28 (1), effective:3 (0)
iterations count:28 (1), effective:3 (0)
iterations count:46 (2), effective:10 (0)
iterations count:28 (1), effective:3 (0)
iterations count:56 (3), effective:10 (0)
iterations count:36 (2), effective:10 (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="CircadianClock-PT-000010"
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 CircadianClock-PT-000010, 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 r074-smll-167814399900106"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CircadianClock-PT-000010.tgz
mv CircadianClock-PT-000010 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 ;