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-167814399900114.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-000100, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r074-smll-167814399900114
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 6.7K Feb 26 10:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 10:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 10:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 10:34 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.5K Feb 25 15:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 10:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Feb 26 10:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 10:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 26 10:38 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-000100-CTLFireability-00
FORMULA_NAME CircadianClock-PT-000100-CTLFireability-01
FORMULA_NAME CircadianClock-PT-000100-CTLFireability-02
FORMULA_NAME CircadianClock-PT-000100-CTLFireability-03
FORMULA_NAME CircadianClock-PT-000100-CTLFireability-04
FORMULA_NAME CircadianClock-PT-000100-CTLFireability-05
FORMULA_NAME CircadianClock-PT-000100-CTLFireability-06
FORMULA_NAME CircadianClock-PT-000100-CTLFireability-07
FORMULA_NAME CircadianClock-PT-000100-CTLFireability-08
FORMULA_NAME CircadianClock-PT-000100-CTLFireability-09
FORMULA_NAME CircadianClock-PT-000100-CTLFireability-10
FORMULA_NAME CircadianClock-PT-000100-CTLFireability-11
FORMULA_NAME CircadianClock-PT-000100-CTLFireability-12
FORMULA_NAME CircadianClock-PT-000100-CTLFireability-13
FORMULA_NAME CircadianClock-PT-000100-CTLFireability-14
FORMULA_NAME CircadianClock-PT-000100-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678299641788

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-000100
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-08 18:20:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 18:20:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 18:20:44] [INFO ] Load time of PNML (sax parser for PT used): 49 ms
[2023-03-08 18:20:44] [INFO ] Transformed 14 places.
[2023-03-08 18:20:44] [INFO ] Transformed 16 transitions.
[2023-03-08 18:20:44] [INFO ] Parsed PT model containing 14 places and 16 transitions and 58 arcs in 191 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 22 ms.
Initial state reduction rules removed 2 formulas.
FORMULA CircadianClock-PT-000100-CTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircadianClock-PT-000100-CTLFireability-14 FALSE 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 19 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-08 18:20:45] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2023-03-08 18:20:45] [INFO ] Computed 7 place invariants in 4 ms
[2023-03-08 18:20:45] [INFO ] Implicit Places using invariants in 333 ms returned []
[2023-03-08 18:20:45] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 18:20:45] [INFO ] Invariant cache hit.
[2023-03-08 18:20:45] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 18:20:45] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
[2023-03-08 18:20:45] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 18:20:45] [INFO ] Invariant cache hit.
[2023-03-08 18:20:45] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 604 ms. Remains : 14/14 places, 16/16 transitions.
Support contains 14 out of 14 places after structural reductions.
[2023-03-08 18:20:45] [INFO ] Flatten gal took : 29 ms
[2023-03-08 18:20:45] [INFO ] Flatten gal took : 11 ms
[2023-03-08 18:20:45] [INFO ] Input system was already deterministic with 16 transitions.
Incomplete random walk after 10021 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 33) seen :32
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 18:20:46] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 18:20:46] [INFO ] Invariant cache hit.
[2023-03-08 18:20:46] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-08 18:20:46] [INFO ] After 49ms 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 14 simplifications.
[2023-03-08 18:20:46] [INFO ] Flatten gal took : 8 ms
[2023-03-08 18:20:46] [INFO ] Flatten gal took : 6 ms
[2023-03-08 18:20:46] [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 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:20:46] [INFO ] Flatten gal took : 4 ms
[2023-03-08 18:20:46] [INFO ] Flatten gal took : 4 ms
[2023-03-08 18:20:46] [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 9 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 9 ms. Remains : 14/14 places, 16/16 transitions.
[2023-03-08 18:20:46] [INFO ] Flatten gal took : 3 ms
[2023-03-08 18:20:46] [INFO ] Flatten gal took : 3 ms
[2023-03-08 18:20:46] [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:20:46] [INFO ] Flatten gal took : 3 ms
[2023-03-08 18:20:46] [INFO ] Flatten gal took : 3 ms
[2023-03-08 18:20:46] [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 3 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 3 ms. Remains : 14/14 places, 16/16 transitions.
[2023-03-08 18:20:46] [INFO ] Flatten gal took : 3 ms
[2023-03-08 18:20:46] [INFO ] Flatten gal took : 4 ms
[2023-03-08 18:20:46] [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:20:46] [INFO ] Flatten gal took : 2 ms
[2023-03-08 18:20:46] [INFO ] Flatten gal took : 3 ms
[2023-03-08 18:20:46] [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:20:46] [INFO ] Flatten gal took : 2 ms
[2023-03-08 18:20:46] [INFO ] Flatten gal took : 3 ms
[2023-03-08 18:20:46] [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:20:46] [INFO ] Flatten gal took : 2 ms
[2023-03-08 18:20:46] [INFO ] Flatten gal took : 2 ms
[2023-03-08 18:20:46] [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 2 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 3 ms. Remains : 14/14 places, 16/16 transitions.
[2023-03-08 18:20:46] [INFO ] Flatten gal took : 2 ms
[2023-03-08 18:20:46] [INFO ] Flatten gal took : 3 ms
[2023-03-08 18:20:46] [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:20:46] [INFO ] Flatten gal took : 2 ms
[2023-03-08 18:20:46] [INFO ] Flatten gal took : 2 ms
[2023-03-08 18:20:46] [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:20:46] [INFO ] Flatten gal took : 3 ms
[2023-03-08 18:20:46] [INFO ] Flatten gal took : 3 ms
[2023-03-08 18:20:46] [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:20:46] [INFO ] Flatten gal took : 2 ms
[2023-03-08 18:20:46] [INFO ] Flatten gal took : 3 ms
[2023-03-08 18:20:46] [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 0 ms. Remains : 14/14 places, 16/16 transitions.
[2023-03-08 18:20:46] [INFO ] Flatten gal took : 2 ms
[2023-03-08 18:20:46] [INFO ] Flatten gal took : 3 ms
[2023-03-08 18:20:46] [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 2 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 2 ms. Remains : 14/14 places, 16/16 transitions.
[2023-03-08 18:20:46] [INFO ] Flatten gal took : 2 ms
[2023-03-08 18:20:46] [INFO ] Flatten gal took : 3 ms
[2023-03-08 18:20:46] [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:20:46] [INFO ] Flatten gal took : 2 ms
[2023-03-08 18:20:46] [INFO ] Flatten gal took : 3 ms
[2023-03-08 18:20:46] [INFO ] Input system was already deterministic with 16 transitions.
[2023-03-08 18:20:46] [INFO ] Flatten gal took : 11 ms
[2023-03-08 18:20:46] [INFO ] Flatten gal took : 4 ms
[2023-03-08 18:20:46] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-08 18:20:46] [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 1955 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.005sec

init dd package: 0m 3.609sec


RS generation: 0m 0.047sec


-> reachability set: #nodes 516 (5.2e+02) #states 42,040,402,004 (10)



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

checking: AG [EX [AG [EF [[1<=p0 & 1<=p2]]]]]
normalized: ~ [E [true U ~ [EX [~ [E [true U ~ [E [true U [1<=p0 & 1<=p2]]]]]]]]]

abstracting: (1<=p2)
states: 21,020,201,002 (10)
abstracting: (1<=p0)
states: 41,624,160,400 (10)
.-> the formula is TRUE

FORMULA CircadianClock-PT-000100-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.023sec

checking: AX [EG [[1<=p3 & 1<=p11]]]
normalized: ~ [EX [~ [EG [[1<=p3 & 1<=p11]]]]]

abstracting: (1<=p11)
states: 41,624,160,400 (10)
abstracting: (1<=p3)
states: 21,020,201,002 (10)
.
EG iterations: 1
.-> the formula is FALSE

FORMULA CircadianClock-PT-000100-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: AX [AG [[1<=p4 & 1<=p10]]]
normalized: ~ [EX [E [true U ~ [[1<=p4 & 1<=p10]]]]]

abstracting: (1<=p10)
states: 41,624,160,400 (10)
abstracting: (1<=p4)
states: 21,020,201,002 (10)
.-> the formula is FALSE

FORMULA CircadianClock-PT-000100-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.066sec

checking: AG [EF [[EG [[p5<=0 | p13<=0]] | [p7<=0 | p9<=0]]]]
normalized: ~ [E [true U ~ [E [true U [[p7<=0 | p9<=0] | EG [[p5<=0 | p13<=0]]]]]]]

abstracting: (p13<=0)
states: 416,241,604 (8)
abstracting: (p5<=0)
states: 21,020,201,002 (10)
.
EG iterations: 1
abstracting: (p9<=0)
states: 416,241,604 (8)
abstracting: (p7<=0)
states: 416,241,604 (8)
-> the formula is TRUE

FORMULA CircadianClock-PT-000100-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.058sec

checking: AX [[AG [EF [[p2<=0 | p11<=0]]] & EF [[EX [EX [1<=p6]] | [1<=p5 & 1<=p10]]]]]
normalized: ~ [EX [~ [[E [true U [[1<=p5 & 1<=p10] | EX [EX [1<=p6]]]] & ~ [E [true U ~ [E [true U [p2<=0 | p11<=0]]]]]]]]]

abstracting: (p11<=0)
states: 416,241,604 (8)
abstracting: (p2<=0)
states: 21,020,201,002 (10)
abstracting: (1<=p6)
states: 41,624,160,400 (10)
..abstracting: (1<=p10)
states: 41,624,160,400 (10)
abstracting: (1<=p5)
states: 21,020,201,002 (10)
.-> the formula is TRUE

FORMULA CircadianClock-PT-000100-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: AG [EF [~ [E [[1<=p4 & 1<=p10] U [[1<=p2 & [1<=p11 & 1<=p6]] | A [[1<=p5 & 1<=p13] U ~ [[p3<=0 | p13<=0]]]]]]]]
normalized: ~ [E [true U ~ [E [true U ~ [E [[1<=p4 & 1<=p10] U [[~ [EG [[p3<=0 | p13<=0]]] & ~ [E [[p3<=0 | p13<=0] U [~ [[1<=p5 & 1<=p13]] & [p3<=0 | p13<=0]]]]] | [[1<=p11 & 1<=p6] & 1<=p2]]]]]]]]

abstracting: (1<=p2)
states: 21,020,201,002 (10)
abstracting: (1<=p6)
states: 41,624,160,400 (10)
abstracting: (1<=p11)
states: 41,624,160,400 (10)
abstracting: (p13<=0)
states: 416,241,604 (8)
abstracting: (p3<=0)
states: 21,020,201,002 (10)
abstracting: (1<=p13)
states: 41,624,160,400 (10)
abstracting: (1<=p5)
states: 21,020,201,002 (10)
abstracting: (p13<=0)
states: 416,241,604 (8)
abstracting: (p3<=0)
states: 21,020,201,002 (10)
abstracting: (p13<=0)
states: 416,241,604 (8)
abstracting: (p3<=0)
states: 21,020,201,002 (10)
.
EG iterations: 1
abstracting: (1<=p10)
states: 41,624,160,400 (10)
abstracting: (1<=p4)
states: 21,020,201,002 (10)
-> the formula is TRUE

FORMULA CircadianClock-PT-000100-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.184sec

checking: EX [[EF [EX [AG [1<=p0]]] | [[1<=p3 & 1<=p11] | [AX [[[p4<=0 | p10<=0] & [p5<=0 | p10<=0]]] & [1<=p4 & 1<=p10]]]]]
normalized: EX [[[[[1<=p4 & 1<=p10] & ~ [EX [~ [[[p5<=0 | p10<=0] & [p4<=0 | p10<=0]]]]]] | [1<=p3 & 1<=p11]] | E [true U EX [~ [E [true U ~ [1<=p0]]]]]]]

abstracting: (1<=p0)
states: 41,624,160,400 (10)
.abstracting: (1<=p11)
states: 41,624,160,400 (10)
abstracting: (1<=p3)
states: 21,020,201,002 (10)
abstracting: (p10<=0)
states: 416,241,604 (8)
abstracting: (p4<=0)
states: 21,020,201,002 (10)
abstracting: (p10<=0)
states: 416,241,604 (8)
abstracting: (p5<=0)
states: 21,020,201,002 (10)
.abstracting: (1<=p10)
states: 41,624,160,400 (10)
abstracting: (1<=p4)
states: 21,020,201,002 (10)
.-> the formula is FALSE

FORMULA CircadianClock-PT-000100-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.068sec

checking: EG [AG [E [AG [1<=p6] U [p3<=0 | [p13<=0 | [E [[1<=p6 & 1<=p13] U [1<=p1 & 1<=p9]] & [1<=p4 & 1<=p10]]]]]]]
normalized: EG [~ [E [true U ~ [E [~ [E [true U ~ [1<=p6]]] U [[[[1<=p4 & 1<=p10] & E [[1<=p6 & 1<=p13] U [1<=p1 & 1<=p9]]] | p13<=0] | p3<=0]]]]]]

abstracting: (p3<=0)
states: 21,020,201,002 (10)
abstracting: (p13<=0)
states: 416,241,604 (8)
abstracting: (1<=p9)
states: 41,624,160,400 (10)
abstracting: (1<=p1)
states: 41,624,160,400 (10)
abstracting: (1<=p13)
states: 41,624,160,400 (10)
abstracting: (1<=p6)
states: 41,624,160,400 (10)
abstracting: (1<=p10)
states: 41,624,160,400 (10)
abstracting: (1<=p4)
states: 21,020,201,002 (10)
abstracting: (1<=p6)
states: 41,624,160,400 (10)
.
EG iterations: 1
-> the formula is FALSE

FORMULA CircadianClock-PT-000100-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.135sec

checking: A [[1<=p3 & 1<=p11] U AG [[~ [A [[p3<=0 | p13<=0] U [[1<=p2 & 1<=p11] & [1<=p5 & 1<=p13]]]] & ~ [EG [EX [~ [[p3<=0 | p13<=0]]]]]]]]
normalized: [~ [EG [E [true U ~ [[~ [EG [EX [~ [[p3<=0 | p13<=0]]]]] & ~ [[~ [EG [~ [[[1<=p5 & 1<=p13] & [1<=p2 & 1<=p11]]]]] & ~ [E [~ [[[1<=p5 & 1<=p13] & [1<=p2 & 1<=p11]]] U [~ [[p3<=0 | p13<=0]] & ~ [[[1<=p5 & 1<=p13] & [1<=p2 & 1<=p11]]]]]]]]]]]]] & ~ [E [E [true U ~ [[~ [EG [EX [~ [[p3<=0 | p13<=0]]]]] & ~ [[~ [EG [~ [[[1<=p5 & 1<=p13] & [1<=p2 & 1<=p11]]]]] & ~ [E [~ [[[1<=p5 & 1<=p13] & [1<=p2 & 1<=p11]]] U [~ [[p3<=0 | p13<=0]] & ~ [[[1<=p5 & 1<=p13] & [1<=p2 & 1<=p11]]]]]]]]]]] U [~ [[1<=p3 & 1<=p11]] & E [true U ~ [[~ [EG [EX [~ [[p3<=0 | p13<=0]]]]] & ~ [[~ [EG [~ [[[1<=p5 & 1<=p13] & [1<=p2 & 1<=p11]]]]] & ~ [E [~ [[[1<=p5 & 1<=p13] & [1<=p2 & 1<=p11]]] U [~ [[p3<=0 | p13<=0]] & ~ [[[1<=p5 & 1<=p13] & [1<=p2 & 1<=p11]]]]]]]]]]]]]]]

abstracting: (1<=p11)
states: 41,624,160,400 (10)
abstracting: (1<=p2)
states: 21,020,201,002 (10)
abstracting: (1<=p13)
states: 41,624,160,400 (10)
abstracting: (1<=p5)
states: 21,020,201,002 (10)
abstracting: (p13<=0)
states: 416,241,604 (8)
abstracting: (p3<=0)
states: 21,020,201,002 (10)
abstracting: (1<=p11)
states: 41,624,160,400 (10)
abstracting: (1<=p2)
states: 21,020,201,002 (10)
abstracting: (1<=p13)
states: 41,624,160,400 (10)
abstracting: (1<=p5)
states: 21,020,201,002 (10)
abstracting: (1<=p11)
states: 41,624,160,400 (10)
abstracting: (1<=p2)
states: 21,020,201,002 (10)
abstracting: (1<=p13)
states: 41,624,160,400 (10)
abstracting: (1<=p5)
states: 21,020,201,002 (10)
.
EG iterations: 1
abstracting: (p13<=0)
states: 416,241,604 (8)
abstracting: (p3<=0)
states: 21,020,201,002 (10)
..
EG iterations: 1
abstracting: (1<=p11)
states: 41,624,160,400 (10)
abstracting: (1<=p3)
states: 21,020,201,002 (10)
abstracting: (1<=p11)
states: 41,624,160,400 (10)
abstracting: (1<=p2)
states: 21,020,201,002 (10)
abstracting: (1<=p13)
states: 41,624,160,400 (10)
abstracting: (1<=p5)
states: 21,020,201,002 (10)
abstracting: (p13<=0)
states: 416,241,604 (8)
abstracting: (p3<=0)
states: 21,020,201,002 (10)
abstracting: (1<=p11)
states: 41,624,160,400 (10)
abstracting: (1<=p2)
states: 21,020,201,002 (10)
abstracting: (1<=p13)
states: 41,624,160,400 (10)
abstracting: (1<=p5)
states: 21,020,201,002 (10)
abstracting: (1<=p11)
states: 41,624,160,400 (10)
abstracting: (1<=p2)
states: 21,020,201,002 (10)
abstracting: (1<=p13)
states: 41,624,160,400 (10)
abstracting: (1<=p5)
states: 21,020,201,002 (10)
.
EG iterations: 1
abstracting: (p13<=0)
states: 416,241,604 (8)
abstracting: (p3<=0)
states: 21,020,201,002 (10)
..
EG iterations: 1
abstracting: (1<=p11)
states: 41,624,160,400 (10)
abstracting: (1<=p2)
states: 21,020,201,002 (10)
abstracting: (1<=p13)
states: 41,624,160,400 (10)
abstracting: (1<=p5)
states: 21,020,201,002 (10)
abstracting: (p13<=0)
states: 416,241,604 (8)
abstracting: (p3<=0)
states: 21,020,201,002 (10)
abstracting: (1<=p11)
states: 41,624,160,400 (10)
abstracting: (1<=p2)
states: 21,020,201,002 (10)
abstracting: (1<=p13)
states: 41,624,160,400 (10)
abstracting: (1<=p5)
states: 21,020,201,002 (10)
abstracting: (1<=p11)
states: 41,624,160,400 (10)
abstracting: (1<=p2)
states: 21,020,201,002 (10)
abstracting: (1<=p13)
states: 41,624,160,400 (10)
abstracting: (1<=p5)
states: 21,020,201,002 (10)
.
EG iterations: 1
abstracting: (p13<=0)
states: 416,241,604 (8)
abstracting: (p3<=0)
states: 21,020,201,002 (10)
..
EG iterations: 1

EG iterations: 0
-> the formula is FALSE

FORMULA CircadianClock-PT-000100-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.018sec

checking: EF [[~ [A [[~ [A [[1<=p2 & 1<=p11] U 1<=p7]] | [1<=p2 & 1<=p11]] U ~ [[AX [[1<=p3 & 1<=p11]] & ~ [[1<=p6 & 1<=p13]]]]]] & ~ [A [~ [[1<=p7 & 1<=p9]] U [AG [[1<=p0 & 1<=p2]] | [[1<=p0 & 1<=p4] | p7<=0]]]]]]
normalized: E [true U [~ [[~ [EG [~ [[[[1<=p0 & 1<=p4] | p7<=0] | ~ [E [true U ~ [[1<=p0 & 1<=p2]]]]]]]] & ~ [E [~ [[[[1<=p0 & 1<=p4] | p7<=0] | ~ [E [true U ~ [[1<=p0 & 1<=p2]]]]]] U [[1<=p7 & 1<=p9] & ~ [[[[1<=p0 & 1<=p4] | p7<=0] | ~ [E [true U ~ [[1<=p0 & 1<=p2]]]]]]]]]]] & ~ [[~ [EG [[~ [[1<=p6 & 1<=p13]] & ~ [EX [~ [[1<=p3 & 1<=p11]]]]]]] & ~ [E [[~ [[1<=p6 & 1<=p13]] & ~ [EX [~ [[1<=p3 & 1<=p11]]]]] U [~ [[[1<=p2 & 1<=p11] | ~ [[~ [EG [~ [1<=p7]]] & ~ [E [~ [1<=p7] U [~ [[1<=p2 & 1<=p11]] & ~ [1<=p7]]]]]]]] & [~ [[1<=p6 & 1<=p13]] & ~ [EX [~ [[1<=p3 & 1<=p11]]]]]]]]]]]]

abstracting: (1<=p11)
states: 41,624,160,400 (10)
abstracting: (1<=p3)
states: 21,020,201,002 (10)
.abstracting: (1<=p13)
states: 41,624,160,400 (10)
abstracting: (1<=p6)
states: 41,624,160,400 (10)
abstracting: (1<=p7)
states: 41,624,160,400 (10)
abstracting: (1<=p11)
states: 41,624,160,400 (10)
abstracting: (1<=p2)
states: 21,020,201,002 (10)
abstracting: (1<=p7)
states: 41,624,160,400 (10)
abstracting: (1<=p7)
states: 41,624,160,400 (10)
.
EG iterations: 1
abstracting: (1<=p11)
states: 41,624,160,400 (10)
abstracting: (1<=p2)
states: 21,020,201,002 (10)
abstracting: (1<=p11)
states: 41,624,160,400 (10)
abstracting: (1<=p3)
states: 21,020,201,002 (10)
.abstracting: (1<=p13)
states: 41,624,160,400 (10)
abstracting: (1<=p6)
states: 41,624,160,400 (10)
abstracting: (1<=p11)
states: 41,624,160,400 (10)
abstracting: (1<=p3)
states: 21,020,201,002 (10)
.abstracting: (1<=p13)
states: 41,624,160,400 (10)
abstracting: (1<=p6)
states: 41,624,160,400 (10)
.
EG iterations: 1
abstracting: (1<=p2)
states: 21,020,201,002 (10)
abstracting: (1<=p0)
states: 41,624,160,400 (10)
abstracting: (p7<=0)
states: 416,241,604 (8)
abstracting: (1<=p4)
states: 21,020,201,002 (10)
abstracting: (1<=p0)
states: 41,624,160,400 (10)
abstracting: (1<=p9)
states: 41,624,160,400 (10)
abstracting: (1<=p7)
states: 41,624,160,400 (10)
abstracting: (1<=p2)
states: 21,020,201,002 (10)
abstracting: (1<=p0)
states: 41,624,160,400 (10)
abstracting: (p7<=0)
states: 416,241,604 (8)
abstracting: (1<=p4)
states: 21,020,201,002 (10)
abstracting: (1<=p0)
states: 41,624,160,400 (10)
abstracting: (1<=p2)
states: 21,020,201,002 (10)
abstracting: (1<=p0)
states: 41,624,160,400 (10)
abstracting: (p7<=0)
states: 416,241,604 (8)
abstracting: (1<=p4)
states: 21,020,201,002 (10)
abstracting: (1<=p0)
states: 41,624,160,400 (10)
.
EG iterations: 1
-> the formula is TRUE

FORMULA CircadianClock-PT-000100-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.185sec

checking: A [[EG [EF [[[[1<=p7 & 1<=p9] | [1<=p1 & 1<=p9]] & EX [1<=p0]]]] | [1<=p7 & [[1<=p5 & 1<=p13] | [AX [[[1<=p1 & 1<=p9] & [1<=p0 & 1<=p2]]] & [A [[1<=p5 & 1<=p13] U 1<=p0] | EX [1<=p6]]]]]] U [1<=p7 & 1<=p9]]
normalized: [~ [EG [~ [[1<=p7 & 1<=p9]]]] & ~ [E [~ [[1<=p7 & 1<=p9]] U [~ [[[1<=p7 & [[~ [EX [~ [[[1<=p0 & 1<=p2] & [1<=p1 & 1<=p9]]]]] & [[~ [EG [~ [1<=p0]]] & ~ [E [~ [1<=p0] U [~ [1<=p0] & ~ [[1<=p5 & 1<=p13]]]]]] | EX [1<=p6]]] | [1<=p5 & 1<=p13]]] | EG [E [true U [EX [1<=p0] & [[1<=p1 & 1<=p9] | [1<=p7 & 1<=p9]]]]]]] & ~ [[1<=p7 & 1<=p9]]]]]]

abstracting: (1<=p9)
states: 41,624,160,400 (10)
abstracting: (1<=p7)
states: 41,624,160,400 (10)
abstracting: (1<=p9)
states: 41,624,160,400 (10)
abstracting: (1<=p7)
states: 41,624,160,400 (10)
abstracting: (1<=p9)
states: 41,624,160,400 (10)
abstracting: (1<=p1)
states: 41,624,160,400 (10)
abstracting: (1<=p0)
states: 41,624,160,400 (10)
.
EG iterations: 0
abstracting: (1<=p13)
states: 41,624,160,400 (10)
abstracting: (1<=p5)
states: 21,020,201,002 (10)
abstracting: (1<=p6)
states: 41,624,160,400 (10)
.abstracting: (1<=p13)
states: 41,624,160,400 (10)
abstracting: (1<=p5)
states: 21,020,201,002 (10)
abstracting: (1<=p0)
states: 41,624,160,400 (10)
abstracting: (1<=p0)
states: 41,624,160,400 (10)
abstracting: (1<=p0)
states: 41,624,160,400 (10)
.
EG iterations: 1
abstracting: (1<=p9)
states: 41,624,160,400 (10)
abstracting: (1<=p1)
states: 41,624,160,400 (10)
abstracting: (1<=p2)
states: 21,020,201,002 (10)
abstracting: (1<=p0)
states: 41,624,160,400 (10)
.abstracting: (1<=p7)
states: 41,624,160,400 (10)
abstracting: (1<=p9)
states: 41,624,160,400 (10)
abstracting: (1<=p7)
states: 41,624,160,400 (10)
abstracting: (1<=p9)
states: 41,624,160,400 (10)
abstracting: (1<=p7)
states: 41,624,160,400 (10)
.
EG iterations: 1
-> the formula is FALSE

FORMULA CircadianClock-PT-000100-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.018sec

checking: [AX [EG [[p0<=0 | p4<=0]]] | [AG [[p6<=0 | p13<=0]] | [AF [[EF [[p5<=0 | p13<=0]] & ~ [A [[1<=p0 & 1<=p4] U [1<=p5 & 1<=p10]]]]] & [~ [E [[[1<=p3 & 1<=p13] & [1<=p5 & [1<=p10 & p7<=0]]] U AG [[1<=p0 & 1<=p2]]]] & AX [[p0<=0 | [p8<=0 | p12<=0]]]]]]]
normalized: [[[[~ [EX [~ [[p0<=0 | [p8<=0 | p12<=0]]]]] & ~ [E [[[1<=p5 & [1<=p10 & p7<=0]] & [1<=p3 & 1<=p13]] U ~ [E [true U ~ [[1<=p0 & 1<=p2]]]]]]] & ~ [EG [~ [[~ [[~ [EG [~ [[1<=p5 & 1<=p10]]]] & ~ [E [~ [[1<=p5 & 1<=p10]] U [~ [[1<=p0 & 1<=p4]] & ~ [[1<=p5 & 1<=p10]]]]]]] & E [true U [p5<=0 | p13<=0]]]]]]] | ~ [E [true U ~ [[p6<=0 | p13<=0]]]]] | ~ [EX [~ [EG [[p0<=0 | p4<=0]]]]]]

abstracting: (p4<=0)
states: 21,020,201,002 (10)
abstracting: (p0<=0)
states: 416,241,604 (8)
.
EG iterations: 1
.abstracting: (p13<=0)
states: 416,241,604 (8)
abstracting: (p6<=0)
states: 416,241,604 (8)
abstracting: (p13<=0)
states: 416,241,604 (8)
abstracting: (p5<=0)
states: 21,020,201,002 (10)
abstracting: (1<=p10)
states: 41,624,160,400 (10)
abstracting: (1<=p5)
states: 21,020,201,002 (10)
abstracting: (1<=p4)
states: 21,020,201,002 (10)
abstracting: (1<=p0)
states: 41,624,160,400 (10)
abstracting: (1<=p10)
states: 41,624,160,400 (10)
abstracting: (1<=p5)
states: 21,020,201,002 (10)
abstracting: (1<=p10)
states: 41,624,160,400 (10)
abstracting: (1<=p5)
states: 21,020,201,002 (10)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p2)
states: 21,020,201,002 (10)
abstracting: (1<=p0)
states: 41,624,160,400 (10)
abstracting: (1<=p13)
states: 41,624,160,400 (10)
abstracting: (1<=p3)
states: 21,020,201,002 (10)
abstracting: (p7<=0)
states: 416,241,604 (8)
abstracting: (1<=p10)
states: 41,624,160,400 (10)
abstracting: (1<=p5)
states: 21,020,201,002 (10)
abstracting: (p12<=0)
states: 416,241,604 (8)
abstracting: (p8<=0)
states: 416,241,604 (8)
abstracting: (p0<=0)
states: 416,241,604 (8)
.-> the formula is TRUE

FORMULA CircadianClock-PT-000100-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.090sec

checking: [[AF [[1<=p3 & 1<=p11]] | ~ [A [[~ [[1<=p3 & 1<=p11]] | [[[1<=p3 & 1<=p11] & [1<=p2 & 1<=p11]] | ~ [[[1<=p5 & 1<=p13] & [1<=p5 & 1<=p10]]]]] U AF [1<=p8]]]] & [EF [[1<=p3 & 1<=p13]] | AG [[~ [A [[[1<=p5 & 1<=p13] | 1<=p8] U EG [~ [[p3<=0 | p13<=0]]]]] | p7<=0]]]]
normalized: [[~ [E [true U ~ [[p7<=0 | ~ [[~ [EG [~ [EG [~ [[p3<=0 | p13<=0]]]]]] & ~ [E [~ [EG [~ [[p3<=0 | p13<=0]]]] U [~ [[1<=p8 | [1<=p5 & 1<=p13]]] & ~ [EG [~ [[p3<=0 | p13<=0]]]]]]]]]]]]] | E [true U [1<=p3 & 1<=p13]]] & [~ [[~ [EG [EG [~ [1<=p8]]]] & ~ [E [EG [~ [1<=p8]] U [~ [[[~ [[[1<=p5 & 1<=p10] & [1<=p5 & 1<=p13]]] | [[1<=p2 & 1<=p11] & [1<=p3 & 1<=p11]]] | ~ [[1<=p3 & 1<=p11]]]] & EG [~ [1<=p8]]]]]]] | ~ [EG [~ [[1<=p3 & 1<=p11]]]]]]

abstracting: (1<=p11)
states: 41,624,160,400 (10)
abstracting: (1<=p3)
states: 21,020,201,002 (10)
.
EG iterations: 1
abstracting: (1<=p8)
states: 41,624,160,400 (10)
.
EG iterations: 1
abstracting: (1<=p11)
states: 41,624,160,400 (10)
abstracting: (1<=p3)
states: 21,020,201,002 (10)
abstracting: (1<=p11)
states: 41,624,160,400 (10)
abstracting: (1<=p3)
states: 21,020,201,002 (10)
abstracting: (1<=p11)
states: 41,624,160,400 (10)
abstracting: (1<=p2)
states: 21,020,201,002 (10)
abstracting: (1<=p13)
states: 41,624,160,400 (10)
abstracting: (1<=p5)
states: 21,020,201,002 (10)
abstracting: (1<=p10)
states: 41,624,160,400 (10)
abstracting: (1<=p5)
states: 21,020,201,002 (10)
abstracting: (1<=p8)
states: 41,624,160,400 (10)
.
EG iterations: 1
abstracting: (1<=p8)
states: 41,624,160,400 (10)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p13)
states: 41,624,160,400 (10)
abstracting: (1<=p3)
states: 21,020,201,002 (10)
abstracting: (p13<=0)
states: 416,241,604 (8)
abstracting: (p3<=0)
states: 21,020,201,002 (10)
.
EG iterations: 1
abstracting: (1<=p13)
states: 41,624,160,400 (10)
abstracting: (1<=p5)
states: 21,020,201,002 (10)
abstracting: (1<=p8)
states: 41,624,160,400 (10)
abstracting: (p13<=0)
states: 416,241,604 (8)
abstracting: (p3<=0)
states: 21,020,201,002 (10)
.
EG iterations: 1
abstracting: (p13<=0)
states: 416,241,604 (8)
abstracting: (p3<=0)
states: 21,020,201,002 (10)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p7<=0)
states: 416,241,604 (8)
-> the formula is TRUE

FORMULA CircadianClock-PT-000100-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.029sec

checking: AX [[AG [[[EF [[[1<=p0 & 1<=p2] & 1<=p0]] | [[p3<=0 | p13<=0] & EG [[1<=p2 & 1<=p11]]]] | [p7<=0 | p9<=0]]] & [AG [EF [1<=p8]] | [[EF [p0<=0] & [[[1<=p5 & 1<=p10] & [1<=p0 & 1<=p4]] | [1<=p6 & [[p3<=0 | p11<=0] | [p5<=0 | p13<=0]]]]] | [AX [[1<=p5 & 1<=p10]] & [EX [[1<=p3 & 1<=p11]] | [[p7<=0 & 1<=p5] & [1<=p10 & [1<=p1 & 1<=p9]]]]]]]]]
normalized: ~ [EX [~ [[[[[[[[1<=p10 & [1<=p1 & 1<=p9]] & [p7<=0 & 1<=p5]] | EX [[1<=p3 & 1<=p11]]] & ~ [EX [~ [[1<=p5 & 1<=p10]]]]] | [[[1<=p6 & [[p5<=0 | p13<=0] | [p3<=0 | p11<=0]]] | [[1<=p0 & 1<=p4] & [1<=p5 & 1<=p10]]] & E [true U p0<=0]]] | ~ [E [true U ~ [E [true U 1<=p8]]]]] & ~ [E [true U ~ [[[p7<=0 | p9<=0] | [[EG [[1<=p2 & 1<=p11]] & [p3<=0 | p13<=0]] | E [true U [1<=p0 & [1<=p0 & 1<=p2]]]]]]]]]]]]

abstracting: (1<=p2)
states: 21,020,201,002 (10)
abstracting: (1<=p0)
states: 41,624,160,400 (10)
abstracting: (1<=p0)
states: 41,624,160,400 (10)
abstracting: (p13<=0)
states: 416,241,604 (8)
abstracting: (p3<=0)
states: 21,020,201,002 (10)
abstracting: (1<=p11)
states: 41,624,160,400 (10)
abstracting: (1<=p2)
states: 21,020,201,002 (10)
.
EG iterations: 1
abstracting: (p9<=0)
states: 416,241,604 (8)
abstracting: (p7<=0)
states: 416,241,604 (8)
abstracting: (1<=p8)
states: 41,624,160,400 (10)
abstracting: (p0<=0)
states: 416,241,604 (8)
abstracting: (1<=p10)
states: 41,624,160,400 (10)
abstracting: (1<=p5)
states: 21,020,201,002 (10)
abstracting: (1<=p4)
states: 21,020,201,002 (10)
abstracting: (1<=p0)
states: 41,624,160,400 (10)
abstracting: (p11<=0)
states: 416,241,604 (8)
abstracting: (p3<=0)
states: 21,020,201,002 (10)
abstracting: (p13<=0)
states: 416,241,604 (8)
abstracting: (p5<=0)
states: 21,020,201,002 (10)
abstracting: (1<=p6)
states: 41,624,160,400 (10)
abstracting: (1<=p10)
states: 41,624,160,400 (10)
abstracting: (1<=p5)
states: 21,020,201,002 (10)
.abstracting: (1<=p11)
states: 41,624,160,400 (10)
abstracting: (1<=p3)
states: 21,020,201,002 (10)
.abstracting: (1<=p5)
states: 21,020,201,002 (10)
abstracting: (p7<=0)
states: 416,241,604 (8)
abstracting: (1<=p9)
states: 41,624,160,400 (10)
abstracting: (1<=p1)
states: 41,624,160,400 (10)
abstracting: (1<=p10)
states: 41,624,160,400 (10)
.-> the formula is TRUE

FORMULA CircadianClock-PT-000100-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

totally nodes used: 413863 (4.1e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1841389 1239051 3080440
used/not used/entry size/cache size: 1621140 65487724 16 1024MB
basic ops cache: hits/miss/sum: 483161 436176 919337
used/not used/entry size/cache size: 763550 16013666 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: 6943 6088 13031
used/not used/entry size/cache size: 6088 8382520 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 66696762
1 410388
2 1692
3 11
4 5
5 3
6 0
7 2
8 0
9 1
>= 10 0

Total processing time: 0m 6.524sec


BK_STOP 1678299654321

--------------------
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:8528 (533), effective:1503 (93)

initing FirstDep: 0m 0.014sec


iterations count:41 (2), effective:6 (0)

iterations count:216 (13), effective:100 (6)

iterations count:116 (7), effective:100 (6)

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

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

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

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

iterations count:838 (52), effective:205 (12)

iterations count:319 (19), effective:101 (6)

iterations count:63 (3), effective:8 (0)

iterations count:416 (26), effective:100 (6)

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

iterations count:240 (15), effective:106 (6)

iterations count:40 (2), effective:6 (0)

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

iterations count:40 (2), effective:6 (0)

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

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

iterations count:40 (2), effective:6 (0)

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

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

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

iterations count:319 (19), effective:101 (6)

iterations count:319 (19), effective:101 (6)

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

iterations count:319 (19), effective:101 (6)

iterations count:661 (41), effective:111 (6)

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

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

iterations count:37 (2), effective:6 (0)

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

iterations count:219 (13), effective:101 (6)

iterations count:319 (19), effective:101 (6)

iterations count:52 (3), effective:9 (0)

iterations count:40 (2), effective:6 (0)

iterations count:220 (13), effective:101 (6)

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

iterations count:41 (2), effective:6 (0)

iterations count:34 (2), effective:3 (0)

iterations count:319 (19), effective:101 (6)

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-000100"
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-000100, 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-167814399900114"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CircadianClock-PT-000100.tgz
mv CircadianClock-PT-000100 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;