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 |
5447.348 | 10630.00 | 14028.00 | 431.20 | FFTFFFTTTTFFFFTF | 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-167814399900110.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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r074-smll-167814399900110
=====================================================================
--------------------
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-ReachabilityCardinality-00
FORMULA_NAME CircadianClock-PT-000010-ReachabilityCardinality-01
FORMULA_NAME CircadianClock-PT-000010-ReachabilityCardinality-02
FORMULA_NAME CircadianClock-PT-000010-ReachabilityCardinality-03
FORMULA_NAME CircadianClock-PT-000010-ReachabilityCardinality-04
FORMULA_NAME CircadianClock-PT-000010-ReachabilityCardinality-05
FORMULA_NAME CircadianClock-PT-000010-ReachabilityCardinality-06
FORMULA_NAME CircadianClock-PT-000010-ReachabilityCardinality-07
FORMULA_NAME CircadianClock-PT-000010-ReachabilityCardinality-08
FORMULA_NAME CircadianClock-PT-000010-ReachabilityCardinality-09
FORMULA_NAME CircadianClock-PT-000010-ReachabilityCardinality-10
FORMULA_NAME CircadianClock-PT-000010-ReachabilityCardinality-11
FORMULA_NAME CircadianClock-PT-000010-ReachabilityCardinality-12
FORMULA_NAME CircadianClock-PT-000010-ReachabilityCardinality-13
FORMULA_NAME CircadianClock-PT-000010-ReachabilityCardinality-14
FORMULA_NAME CircadianClock-PT-000010-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1678299553003
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=ReachabilityCardinality
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:19:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-08 18:19:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 18:19:16] [INFO ] Load time of PNML (sax parser for PT used): 34 ms
[2023-03-08 18:19:16] [INFO ] Transformed 14 places.
[2023-03-08 18:19:16] [INFO ] Transformed 16 transitions.
[2023-03-08 18:19:16] [INFO ] Parsed PT model containing 14 places and 16 transitions and 58 arcs in 146 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CircadianClock-PT-000010-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircadianClock-PT-000010-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircadianClock-PT-000010-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10009 steps, including 2 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 13) seen :9
FORMULA CircadianClock-PT-000010-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CircadianClock-PT-000010-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CircadianClock-PT-000010-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CircadianClock-PT-000010-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CircadianClock-PT-000010-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CircadianClock-PT-000010-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CircadianClock-PT-000010-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CircadianClock-PT-000010-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CircadianClock-PT-000010-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-08 18:19:16] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2023-03-08 18:19:16] [INFO ] Computed 7 place invariants in 4 ms
[2023-03-08 18:19:17] [INFO ] After 200ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 18:19:17] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-08 18:19:17] [INFO ] After 69ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
FORMULA CircadianClock-PT-000010-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CircadianClock-PT-000010-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CircadianClock-PT-000010-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CircadianClock-PT-000010-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
All properties solved without resorting to model-checking.
Total runtime 1192 ms.
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=ReachabilityCardinality.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: CircadianClock_PT_000010
(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.698sec
RS generation: 0m 0.004sec
-> reachability set: #nodes 66 (6.6e+01) #states 644,204 (5)
starting MCC model checker
--------------------------
checking: EF [a_cap<=0]
normalized: E [true U a_cap<=0]
abstracting: (a_cap<=0)
states: 58,564 (4)
-> the formula is TRUE
FORMULA CircadianClock-PT-000010-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: AG [~ [4<=da]]
normalized: ~ [E [true U 4<=da]]
abstracting: (4<=da)
states: 0
-> the formula is TRUE
FORMULA CircadianClock-PT-000010-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [~ [4<=c]]
normalized: ~ [E [true U 4<=c]]
abstracting: (4<=c)
states: 409,948 (5)
-> the formula is FALSE
FORMULA CircadianClock-PT-000010-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [dr<=9]
normalized: E [true U dr<=9]
abstracting: (dr<=9)
states: 644,204 (5)
-> the formula is TRUE
FORMULA CircadianClock-PT-000010-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [~ [2<=a_cap]]
normalized: ~ [E [true U 2<=a_cap]]
abstracting: (2<=a_cap)
states: 527,076 (5)
-> the formula is FALSE
FORMULA CircadianClock-PT-000010-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [c<=c_cap]
normalized: ~ [E [true U ~ [c<=c_cap]]]
abstracting: (c<=c_cap)
states: 351,384 (5)
-> the formula is FALSE
FORMULA CircadianClock-PT-000010-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [da_a<=ma_cap]
normalized: ~ [E [true U ~ [da_a<=ma_cap]]]
abstracting: (da_a<=ma_cap)
states: 614,922 (5)
-> the formula is FALSE
FORMULA CircadianClock-PT-000010-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: AG [r<=c_cap]
normalized: ~ [E [true U ~ [r<=c_cap]]]
abstracting: (r<=c_cap)
states: 351,384 (5)
-> the formula is FALSE
FORMULA CircadianClock-PT-000010-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AG [ma<=da]
normalized: ~ [E [true U ~ [ma<=da]]]
abstracting: (ma<=da)
states: 87,846 (4)
-> the formula is FALSE
FORMULA CircadianClock-PT-000010-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [~ [[[[mr_cap<=9 | ~ [[[[[ma<=r | 4<=ma_cap] & [mr_cap<=2 | dr<=3]] | [[a_cap<=1 | mr<=8] & ~ [r<=9]]] | ~ [r_cap<=0]]]] | r_cap<=2] | ~ [[4<=dr & ~ [c_cap<=9]]]]]]
normalized: E [true U ~ [[~ [[~ [c_cap<=9] & 4<=dr]] | [[~ [[[[[a_cap<=1 | mr<=8] & ~ [r<=9]] | [[mr_cap<=2 | dr<=3] & [ma<=r | 4<=ma_cap]]] | ~ [r_cap<=0]]] | mr_cap<=9] | r_cap<=2]]]]
abstracting: (r_cap<=2)
states: 175,692 (5)
abstracting: (mr_cap<=9)
states: 585,640 (5)
abstracting: (r_cap<=0)
states: 58,564 (4)
abstracting: (4<=ma_cap)
states: 409,948 (5)
abstracting: (ma<=r)
states: 351,384 (5)
abstracting: (dr<=3)
states: 644,204 (5)
abstracting: (mr_cap<=2)
states: 175,692 (5)
abstracting: (r<=9)
states: 585,640 (5)
abstracting: (mr<=8)
states: 527,076 (5)
abstracting: (a_cap<=1)
states: 117,128 (5)
abstracting: (4<=dr)
states: 0
abstracting: (c_cap<=9)
states: 585,640 (5)
-> the formula is FALSE
FORMULA CircadianClock-PT-000010-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AG [[mr_cap<=da & [~ [mr_cap<=c] & ~ [[~ [ma<=6] | [[[~ [ma<=r] | 6<=c_cap] | [~ [da<=1] | ~ [da<=8]]] & ~ [[~ [ma<=r] | ~ [da<=a]]]]]]]]]
normalized: ~ [E [true U ~ [[[~ [[[[[~ [ma<=r] | 6<=c_cap] | [~ [da<=8] | ~ [da<=1]]] & ~ [[~ [da<=a] | ~ [ma<=r]]]] | ~ [ma<=6]]] & ~ [mr_cap<=c]] & mr_cap<=da]]]]
abstracting: (mr_cap<=da)
states: 87,846 (4)
abstracting: (mr_cap<=c)
states: 351,384 (5)
abstracting: (ma<=6)
states: 409,948 (5)
abstracting: (ma<=r)
states: 351,384 (5)
abstracting: (da<=a)
states: 614,922 (5)
abstracting: (da<=1)
states: 644,204 (5)
abstracting: (da<=8)
states: 644,204 (5)
abstracting: (6<=c_cap)
states: 292,820 (5)
abstracting: (ma<=r)
states: 351,384 (5)
-> the formula is FALSE
FORMULA CircadianClock-PT-000010-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: AG [[[[[~ [a<=da_a] & ~ [[~ [r<=mr] | [[[mr<=10 | 3<=c_cap] | ~ [c<=5]] | [a<=da | dr_a<=5]]]]] & ~ [5<=mr_cap]] & [1<=da_a & 6<=dr_a]] | dr_a<=ma_cap]]
normalized: ~ [E [true U ~ [[[[1<=da_a & 6<=dr_a] & [~ [5<=mr_cap] & [~ [[[[a<=da | dr_a<=5] | [~ [c<=5] | [mr<=10 | 3<=c_cap]]] | ~ [r<=mr]]] & ~ [a<=da_a]]]] | dr_a<=ma_cap]]]]
abstracting: (dr_a<=ma_cap)
states: 614,922 (5)
abstracting: (a<=da_a)
states: 87,846 (4)
abstracting: (r<=mr)
states: 351,384 (5)
abstracting: (3<=c_cap)
states: 468,512 (5)
abstracting: (mr<=10)
states: 644,204 (5)
abstracting: (c<=5)
states: 351,384 (5)
abstracting: (dr_a<=5)
states: 644,204 (5)
abstracting: (a<=da)
states: 87,846 (4)
abstracting: (5<=mr_cap)
states: 351,384 (5)
abstracting: (6<=dr_a)
states: 0
abstracting: (1<=da_a)
states: 322,102 (5)
-> the formula is FALSE
FORMULA CircadianClock-PT-000010-ReachabilityCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [[[[~ [[~ [[6<=da | [mr_cap<=1 | a_cap<=5]]] | [[r_cap<=2 & [[10<=dr & 4<=ma] & dr_a<=8]] | [~ [[9<=c_cap & mr_cap<=dr]] & ~ [ma_cap<=dr_a]]]]] | 7<=dr] & ~ [5<=ma_cap]] & [dr_a<=dr_a | r<=r]]]
normalized: E [true U [[dr_a<=dr_a | r<=r] & [~ [5<=ma_cap] & [~ [[[[~ [ma_cap<=dr_a] & ~ [[9<=c_cap & mr_cap<=dr]]] | [[[10<=dr & 4<=ma] & dr_a<=8] & r_cap<=2]] | ~ [[[mr_cap<=1 | a_cap<=5] | 6<=da]]]] | 7<=dr]]]]
abstracting: (7<=dr)
states: 0
abstracting: (6<=da)
states: 0
abstracting: (a_cap<=5)
states: 351,384 (5)
abstracting: (mr_cap<=1)
states: 117,128 (5)
abstracting: (r_cap<=2)
states: 175,692 (5)
abstracting: (dr_a<=8)
states: 644,204 (5)
abstracting: (4<=ma)
states: 409,948 (5)
abstracting: (10<=dr)
states: 0
abstracting: (mr_cap<=dr)
states: 87,846 (4)
abstracting: (9<=c_cap)
states: 117,128 (5)
abstracting: (ma_cap<=dr_a)
states: 87,846 (4)
abstracting: (5<=ma_cap)
states: 351,384 (5)
abstracting: (r<=r)
states: 644,204 (5)
abstracting: (dr_a<=dr_a)
states: 644,204 (5)
-> the formula is TRUE
FORMULA CircadianClock-PT-000010-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: AG [[[da_a<=3 | 10<=a] | [[[7<=r | [~ [[[[a<=2 | da<=a] & dr<=2] & r<=mr_cap]] | 3<=mr]] | [[[[[[c_cap<=1 & da<=5] & a<=8] & dr<=10] | [[[dr_a<=1 & r<=c] | ~ [4<=ma_cap]] & [~ [a<=8] | ~ [da<=0]]]] | ~ [mr_cap<=6]] | 10<=c_cap]] | ~ [[[mr_cap<=7 | [[4<=c & da_a<=dr_a] & 8<=c_cap]] | ~ [ma_cap<=ma]]]]]]
normalized: ~ [E [true U ~ [[[~ [[~ [ma_cap<=ma] | [[[4<=c & da_a<=dr_a] & 8<=c_cap] | mr_cap<=7]]] | [[[~ [mr_cap<=6] | [[[~ [da<=0] | ~ [a<=8]] & [~ [4<=ma_cap] | [dr_a<=1 & r<=c]]] | [[[c_cap<=1 & da<=5] & a<=8] & dr<=10]]] | 10<=c_cap] | [[~ [[[[a<=2 | da<=a] & dr<=2] & r<=mr_cap]] | 3<=mr] | 7<=r]]] | [da_a<=3 | 10<=a]]]]]
abstracting: (10<=a)
states: 58,564 (4)
abstracting: (da_a<=3)
states: 644,204 (5)
abstracting: (7<=r)
states: 234,256 (5)
abstracting: (3<=mr)
states: 468,512 (5)
abstracting: (r<=mr_cap)
states: 351,384 (5)
abstracting: (dr<=2)
states: 644,204 (5)
abstracting: (da<=a)
states: 614,922 (5)
abstracting: (a<=2)
states: 175,692 (5)
abstracting: (10<=c_cap)
states: 58,564 (4)
abstracting: (dr<=10)
states: 644,204 (5)
abstracting: (a<=8)
states: 527,076 (5)
abstracting: (da<=5)
states: 644,204 (5)
abstracting: (c_cap<=1)
states: 117,128 (5)
abstracting: (r<=c)
states: 351,384 (5)
abstracting: (dr_a<=1)
states: 644,204 (5)
abstracting: (4<=ma_cap)
states: 409,948 (5)
abstracting: (a<=8)
states: 527,076 (5)
abstracting: (da<=0)
states: 322,102 (5)
abstracting: (mr_cap<=6)
states: 409,948 (5)
abstracting: (mr_cap<=7)
states: 468,512 (5)
abstracting: (8<=c_cap)
states: 175,692 (5)
abstracting: (da_a<=dr_a)
states: 483,153 (5)
abstracting: (4<=c)
states: 409,948 (5)
abstracting: (ma_cap<=ma)
states: 351,384 (5)
-> the formula is TRUE
FORMULA CircadianClock-PT-000010-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: AG [[[~ [[c_cap<=4 | [[[~ [10<=c] & a_cap<=a_cap] | [[da_a<=9 | ~ [a<=ma]] | [[r_cap<=0 & dr<=3] | [r_cap<=6 | dr<=ma_cap]]]] & ~ [[~ [[a<=mr_cap & a<=r]] | [[a_cap<=c & mr<=dr_a] & ~ [da_a<=9]]]]]]] & [[[a_cap<=da & 6<=mr] & ~ [7<=da]] & 10<=dr]] | [~ [9<=c] | [da<=1 & r<=mr]]]]
normalized: ~ [E [true U ~ [[[[da<=1 & r<=mr] | ~ [9<=c]] | [[10<=dr & [~ [7<=da] & [a_cap<=da & 6<=mr]]] & ~ [[c_cap<=4 | [~ [[[~ [da_a<=9] & [a_cap<=c & mr<=dr_a]] | ~ [[a<=mr_cap & a<=r]]]] & [[[[r_cap<=6 | dr<=ma_cap] | [r_cap<=0 & dr<=3]] | [da_a<=9 | ~ [a<=ma]]] | [a_cap<=a_cap & ~ [10<=c]]]]]]]]]]]
abstracting: (10<=c)
states: 58,564 (4)
abstracting: (a_cap<=a_cap)
states: 644,204 (5)
abstracting: (a<=ma)
states: 351,384 (5)
abstracting: (da_a<=9)
states: 644,204 (5)
abstracting: (dr<=3)
states: 644,204 (5)
abstracting: (r_cap<=0)
states: 58,564 (4)
abstracting: (dr<=ma_cap)
states: 614,922 (5)
abstracting: (r_cap<=6)
states: 409,948 (5)
abstracting: (a<=r)
states: 351,384 (5)
abstracting: (a<=mr_cap)
states: 351,384 (5)
abstracting: (mr<=dr_a)
states: 87,846 (4)
abstracting: (a_cap<=c)
states: 351,384 (5)
abstracting: (da_a<=9)
states: 644,204 (5)
abstracting: (c_cap<=4)
states: 292,820 (5)
abstracting: (6<=mr)
states: 292,820 (5)
abstracting: (a_cap<=da)
states: 87,846 (4)
abstracting: (7<=da)
states: 0
abstracting: (10<=dr)
states: 0
abstracting: (9<=c)
states: 117,128 (5)
abstracting: (r<=mr)
states: 351,384 (5)
abstracting: (da<=1)
states: 644,204 (5)
-> the formula is FALSE
FORMULA CircadianClock-PT-000010-ReachabilityCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: AG [[~ [[~ [a<=r_cap] | [[[[6<=a_cap & da_a<=r] | ~ [8<=da_a]] | ~ [9<=dr]] & [~ [[3<=mr & dr_a<=r]] & r<=dr]]]] | [[~ [[[[~ [4<=ma_cap] | da_a<=4] & [[mr_cap<=1 | ~ [c_cap<=6]] | [[4<=mr_cap & 5<=a_cap] & [8<=ma & c_cap<=4]]]] & [10<=r | [[~ [mr<=0] & ~ [7<=a]] | [1<=c_cap | ~ [a<=9]]]]]] & [[[[c<=5 & ~ [a_cap<=r_cap]] & [r_cap<=4 & ~ [[dr<=c_cap & dr_a<=dr]]]] & ~ [dr<=ma_cap]] & 1<=dr]] | ma<=10]]]
normalized: ~ [E [true U ~ [[[ma<=10 | [[1<=dr & [~ [dr<=ma_cap] & [[r_cap<=4 & ~ [[dr<=c_cap & dr_a<=dr]]] & [c<=5 & ~ [a_cap<=r_cap]]]]] & ~ [[[10<=r | [[1<=c_cap | ~ [a<=9]] | [~ [7<=a] & ~ [mr<=0]]]] & [[[[8<=ma & c_cap<=4] & [4<=mr_cap & 5<=a_cap]] | [mr_cap<=1 | ~ [c_cap<=6]]] & [da_a<=4 | ~ [4<=ma_cap]]]]]]] | ~ [[[[r<=dr & ~ [[3<=mr & dr_a<=r]]] & [~ [9<=dr] | [~ [8<=da_a] | [6<=a_cap & da_a<=r]]]] | ~ [a<=r_cap]]]]]]]
abstracting: (a<=r_cap)
states: 351,384 (5)
abstracting: (da_a<=r)
states: 614,922 (5)
abstracting: (6<=a_cap)
states: 292,820 (5)
abstracting: (8<=da_a)
states: 0
abstracting: (9<=dr)
states: 0
abstracting: (dr_a<=r)
states: 614,922 (5)
abstracting: (3<=mr)
states: 468,512 (5)
abstracting: (r<=dr)
states: 87,846 (4)
abstracting: (4<=ma_cap)
states: 409,948 (5)
abstracting: (da_a<=4)
states: 644,204 (5)
abstracting: (c_cap<=6)
states: 409,948 (5)
abstracting: (mr_cap<=1)
states: 117,128 (5)
abstracting: (5<=a_cap)
states: 351,384 (5)
abstracting: (4<=mr_cap)
states: 409,948 (5)
abstracting: (c_cap<=4)
states: 292,820 (5)
abstracting: (8<=ma)
states: 175,692 (5)
abstracting: (mr<=0)
states: 58,564 (4)
abstracting: (7<=a)
states: 234,256 (5)
abstracting: (a<=9)
states: 585,640 (5)
abstracting: (1<=c_cap)
states: 585,640 (5)
abstracting: (10<=r)
states: 58,564 (4)
abstracting: (a_cap<=r_cap)
states: 351,384 (5)
abstracting: (c<=5)
states: 351,384 (5)
abstracting: (dr_a<=dr)
states: 322,102 (5)
abstracting: (dr<=c_cap)
states: 614,922 (5)
abstracting: (r_cap<=4)
states: 292,820 (5)
abstracting: (dr<=ma_cap)
states: 614,922 (5)
abstracting: (1<=dr)
states: 322,102 (5)
abstracting: (ma<=10)
states: 644,204 (5)
-> the formula is TRUE
FORMULA CircadianClock-PT-000010-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
totally nodes used: 10864 (1.1e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 28044 21496 49540
used/not used/entry size/cache size: 26559 67082305 16 1024MB
basic ops cache: hits/miss/sum: 16717 19768 36485
used/not used/entry size/cache size: 36102 16741114 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: 2613 2647 5260
used/not used/entry size/cache size: 2647 8385961 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 67098951
1 9706
2 112
3 16
4 9
5 4
6 10
7 1
8 10
9 2
>= 10 43
Total processing time: 0m 5.332sec
BK_STOP 1678299563633
--------------------
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 ReachabilityCardinality -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:94 (5), effective:14 (0)
iterations count:212 (13), effective:32 (2)
iterations count:16 (1), effective:0 (0)
iterations count:25 (1), effective:3 (0)
iterations count:310 (19), effective:48 (3)
iterations count:180 (11), effective:43 (2)
iterations count:245 (15), effective:38 (2)
iterations count:45 (2), effective:7 (0)
iterations count:17 (1), effective:1 (0)
iterations count:180 (11), effective:43 (2)
iterations count:213 (13), effective:58 (3)
iterations count:485 (30), effective:85 (5)
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="ReachabilityCardinality"
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 ReachabilityCardinality"
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-167814399900110"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;