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.r522-tall-167987246800014.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 Anderson-PT-05, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987246800014
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.1K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Mar 23 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Mar 23 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 7.5K Mar 23 15:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K Mar 23 15:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Mar 23 15:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Mar 23 15:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 23 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 185K Mar 31 16:48 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 Anderson-PT-05-ReachabilityCardinality-00
FORMULA_NAME Anderson-PT-05-ReachabilityCardinality-01
FORMULA_NAME Anderson-PT-05-ReachabilityCardinality-02
FORMULA_NAME Anderson-PT-05-ReachabilityCardinality-03
FORMULA_NAME Anderson-PT-05-ReachabilityCardinality-04
FORMULA_NAME Anderson-PT-05-ReachabilityCardinality-05
FORMULA_NAME Anderson-PT-05-ReachabilityCardinality-06
FORMULA_NAME Anderson-PT-05-ReachabilityCardinality-07
FORMULA_NAME Anderson-PT-05-ReachabilityCardinality-08
FORMULA_NAME Anderson-PT-05-ReachabilityCardinality-09
FORMULA_NAME Anderson-PT-05-ReachabilityCardinality-10
FORMULA_NAME Anderson-PT-05-ReachabilityCardinality-11
FORMULA_NAME Anderson-PT-05-ReachabilityCardinality-12
FORMULA_NAME Anderson-PT-05-ReachabilityCardinality-13
FORMULA_NAME Anderson-PT-05-ReachabilityCardinality-14
FORMULA_NAME Anderson-PT-05-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1680839193999

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=Anderson-PT-05
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-07 03:46:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 03:46:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 03:46:35] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2023-04-07 03:46:35] [INFO ] Transformed 161 places.
[2023-04-07 03:46:35] [INFO ] Transformed 365 transitions.
[2023-04-07 03:46:35] [INFO ] Found NUPN structural information;
[2023-04-07 03:46:35] [INFO ] Parsed PT model containing 161 places and 365 transitions and 1380 arcs in 126 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
FORMULA Anderson-PT-05-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-05-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-05-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-05-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-05-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-05-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-05-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-05-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 395 ms. (steps per millisecond=25 ) properties (out of 8) seen :1
FORMULA Anderson-PT-05-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 7) seen :1
FORMULA Anderson-PT-05-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 365 rows 161 cols
[2023-04-07 03:46:36] [INFO ] Computed 13 invariants in 19 ms
[2023-04-07 03:46:36] [INFO ] After 181ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-07 03:46:36] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-04-07 03:46:36] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2023-04-07 03:46:37] [INFO ] After 206ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :3
[2023-04-07 03:46:37] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 03:46:37] [INFO ] After 122ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :3 sat :3
[2023-04-07 03:46:37] [INFO ] After 292ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :3
Attempting to minimize the solution found.
Minimization took 139 ms.
[2023-04-07 03:46:37] [INFO ] After 734ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :3
FORMULA Anderson-PT-05-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Anderson-PT-05-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Anderson-PT-05-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 8 ms.
Support contains 23 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 365/365 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 161 transition count 353
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 149 transition count 353
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 52 place count 121 transition count 205
Iterating global reduction 0 with 28 rules applied. Total rules applied 80 place count 121 transition count 205
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 92 place count 115 transition count 199
Applied a total of 92 rules in 38 ms. Remains 115 /161 variables (removed 46) and now considering 199/365 (removed 166) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 115/161 places, 199/365 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Finished probabilistic random walk after 8671 steps, run visited all 3 properties in 46 ms. (steps per millisecond=188 )
Probabilistic random walk after 8671 steps, saw 4992 distinct states, run finished after 46 ms. (steps per millisecond=188 ) properties seen :3
FORMULA Anderson-PT-05-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA Anderson-PT-05-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA Anderson-PT-05-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Parikh walk visited 0 properties in 0 ms.
All properties solved without resorting to model-checking.
Total runtime 2437 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: Anderson_PT_05
(NrP: 161 NrTr: 365 NrArc: 1380)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.004sec

net check time: 0m 0.000sec

init dd package: 0m 2.758sec


RS generation: 1m42.221sec


-> reachability set: #nodes 96853 (9.7e+04) #states 689,901 (5)



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

checking: EF [1<=p1_2_7]
normalized: E [true U 1<=p1_2_7]

abstracting: (1<=p1_2_7)
states: 17,988 (4)
-> the formula is TRUE

FORMULA Anderson-PT-05-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m14.397sec

checking: AG [next_6<=1]
normalized: ~ [E [true U ~ [next_6<=1]]]

abstracting: (next_6<=1)
states: 689,901 (5)
-> the formula is TRUE

FORMULA Anderson-PT-05-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.019sec

checking: AG [p2_1_0<=1]
normalized: ~ [E [true U ~ [p2_1_0<=1]]]

abstracting: (p2_1_0<=1)
states: 689,901 (5)
-> the formula is TRUE

FORMULA Anderson-PT-05-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EF [1<=p1_0_7]
normalized: E [true U 1<=p1_0_7]

abstracting: (1<=p1_0_7)
states: 17,988 (4)
-> the formula is TRUE

FORMULA Anderson-PT-05-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m 8.634sec

checking: AG [cs_3_0<=1]
normalized: ~ [E [true U ~ [cs_3_0<=1]]]

abstracting: (cs_3_0<=1)
states: 689,901 (5)
-> the formula is TRUE

FORMULA Anderson-PT-05-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [p1_1_6<=1]]
normalized: E [true U ~ [p1_1_6<=1]]

abstracting: (p1_1_6<=1)
states: 689,901 (5)
-> the formula is FALSE

FORMULA Anderson-PT-05-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: AG [next_6<=p1_0_5]
normalized: ~ [E [true U ~ [next_6<=p1_0_5]]]

abstracting: (next_6<=p1_0_5)
states: 652,137 (5)

before gc: list nodes free: 1675509

after gc: idd nodes used:141440, unused:63858560; list nodes free:290896855
-> the formula is FALSE

FORMULA Anderson-PT-05-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m17.011sec

checking: AG [[p1_4_8<=p3_0_4 | 1<=p1_3_0]]
normalized: ~ [E [true U ~ [[p1_4_8<=p3_0_4 | 1<=p1_3_0]]]]

abstracting: (1<=p1_3_0)
states: 15,485 (4)
abstracting: (p1_4_8<=p3_0_4)
states: 680,085 (5)
-> the formula is FALSE

FORMULA Anderson-PT-05-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m53.284sec

checking: AG [[p2_2_1<=1 | slot_F_F_F_F_T<=ncs_2_3]]
normalized: ~ [E [true U ~ [[p2_2_1<=1 | slot_F_F_F_F_T<=ncs_2_3]]]]

abstracting: (slot_F_F_F_F_T<=ncs_2_3)
states: 594,262 (5)
abstracting: (p2_2_1<=1)
states: 689,901 (5)
-> the formula is TRUE

FORMULA Anderson-PT-05-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.073sec

checking: AG [[[[~ [ncs_3_1<=ncs_3_0] | p2_2_1<=p1_1_1] | p1_1_1<=p2_0_3] | p1_3_4<=cs_4_3]]
normalized: ~ [E [true U ~ [[p1_3_4<=cs_4_3 | [p1_1_1<=p2_0_3 | [p2_2_1<=p1_1_1 | ~ [ncs_3_1<=ncs_3_0]]]]]]]

abstracting: (ncs_3_1<=ncs_3_0)
states: 639,240 (5)
abstracting: (p2_2_1<=p1_1_1)
states: 658,452 (5)
abstracting: (p1_1_1<=p2_0_3)
states: 668,670 (5)
abstracting: (p1_3_4<=cs_4_3)
states: 663,031 (5)
-> the formula is TRUE

FORMULA Anderson-PT-05-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.323sec

checking: EF [~ [[p2_2_3<=p1_3_0 | [~ [[1<=p2_3_2 | p3_1_1<=0]] | [p3_2_4<=p3_0_2 | ~ [[1<=p1_2_2 & [[cs_3_1<=1 & cs_4_4<=p2_3_0] & 1<=p2_1_2]]]]]]]]
normalized: E [true U ~ [[p2_2_3<=p1_3_0 | [[p3_2_4<=p3_0_2 | ~ [[1<=p1_2_2 & [1<=p2_1_2 & [cs_3_1<=1 & cs_4_4<=p2_3_0]]]]] | ~ [[1<=p2_3_2 | p3_1_1<=0]]]]]]

abstracting: (p3_1_1<=0)
states: 683,956 (5)
abstracting: (1<=p2_3_2)
states: 31,281 (4)
abstracting: (cs_4_4<=p2_3_0)
states: 682,534 (5)
abstracting: (cs_3_1<=1)
states: 689,901 (5)
abstracting: (1<=p2_1_2)
states: 31,281 (4)
abstracting: (1<=p1_2_2)
states: 27,489 (4)
abstracting: (p3_2_4<=p3_0_2)
states: 681,824 (5)
abstracting: (p2_2_3<=p1_3_0)
states: 659,285 (5)
-> the formula is FALSE

FORMULA Anderson-PT-05-ReachabilityCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.239sec

checking: AG [[~ [[[~ [[p2_0_3<=0 | [[~ [p1_1_6<=0] & 1<=p3_0_4] | [[p1_1_4<=0 & p2_4_4<=0] & [p2_1_2<=0 & ncs_2_2<=1]]]]] & [~ [p2_1_1<=p2_4_2] & [slot_F_F_F_F_F<=0 | ~ [cs_3_2<=p1_4_8]]]] & ~ [[p1_4_2<=0 | p2_1_3<=0]]]] | p2_1_3<=p3_2_1]]
normalized: ~ [E [true U ~ [[p2_1_3<=p3_2_1 | ~ [[~ [[p1_4_2<=0 | p2_1_3<=0]] & [[[slot_F_F_F_F_F<=0 | ~ [cs_3_2<=p1_4_8]] & ~ [p2_1_1<=p2_4_2]] & ~ [[p2_0_3<=0 | [[[p2_1_2<=0 & ncs_2_2<=1] & [p1_1_4<=0 & p2_4_4<=0]] | [1<=p3_0_4 & ~ [p1_1_6<=0]]]]]]]]]]]]

abstracting: (p1_1_6<=0)
states: 664,955 (5)
abstracting: (1<=p3_0_4)
states: 8,077 (3)
abstracting: (p2_4_4<=0)
states: 649,896 (5)
abstracting: (p1_1_4<=0)
states: 662,588 (5)
abstracting: (ncs_2_2<=1)
states: 689,901 (5)
abstracting: (p2_1_2<=0)
states: 658,620 (5)
abstracting: (p2_0_3<=0)
states: 658,592 (5)
abstracting: (p2_1_1<=p2_4_2)
states: 660,572 (5)
abstracting: (cs_3_2<=p1_4_8)
states: 684,688 (5)
abstracting: (slot_F_F_F_F_F<=0)
states: 532,216 (5)
abstracting: (p2_1_3<=0)
states: 658,592 (5)
abstracting: (p1_4_2<=0)
states: 662,412 (5)
abstracting: (p2_1_3<=p3_2_1)
states: 659,060 (5)
-> the formula is TRUE

FORMULA Anderson-PT-05-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.451sec

checking: AG [~ [[p3_3_0<=1 & ~ [[[[~ [[[p3_3_4<=1 & 1<=p1_1_5] | p3_2_1<=slot_F_F_F_F_T]] & [[1<=p3_3_1 & [1<=p2_4_3 | p1_0_8<=1]] & [~ [1<=p2_1_0] | [1<=p1_3_7 | p2_4_0<=ncs_1_3]]]] | [next_2<=0 | p3_2_2<=1]] | [p1_3_0<=1 | 1<=ncs_2_4]]]]]]
normalized: ~ [E [true U [p3_3_0<=1 & ~ [[[p1_3_0<=1 | 1<=ncs_2_4] | [[next_2<=0 | p3_2_2<=1] | [[[[1<=p1_3_7 | p2_4_0<=ncs_1_3] | ~ [1<=p2_1_0]] & [1<=p3_3_1 & [1<=p2_4_3 | p1_0_8<=1]]] & ~ [[p3_2_1<=slot_F_F_F_F_T | [p3_3_4<=1 & 1<=p1_1_5]]]]]]]]]]

abstracting: (1<=p1_1_5)
states: 30,289 (4)
abstracting: (p3_3_4<=1)
states: 689,901 (5)
abstracting: (p3_2_1<=slot_F_F_F_F_T)
states: 683,956 (5)
abstracting: (p1_0_8<=1)
states: 689,901 (5)
abstracting: (1<=p2_4_3)
states: 31,309 (4)
abstracting: (1<=p3_3_1)
states: 5,945 (3)
abstracting: (1<=p2_1_0)
states: 30,545 (4)
abstracting: (p2_4_0<=ncs_1_3)
states: 661,224 (5)
abstracting: (1<=p1_3_7)
states: 17,988 (4)
abstracting: (p3_2_2<=1)
states: 689,901 (5)
abstracting: (next_2<=0)
states: 571,970 (5)
abstracting: (1<=ncs_2_4)
states: 54,689 (4)
abstracting: (p1_3_0<=1)
states: 689,901 (5)
abstracting: (p3_3_0<=1)
states: 689,901 (5)
-> the formula is TRUE

FORMULA Anderson-PT-05-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.393sec

checking: AG [[[~ [[~ [[[[[1<=p1_3_7 & 1<=p3_0_0] | [ncs_0_1<=0 & 1<=ncs_4_0]] | ~ [[p2_2_1<=ncs_4_2 | p2_0_1<=1]]] & ~ [slot_F_F_F_T_F<=p1_3_6]]] | [p1_0_5<=0 & ~ [[~ [1<=p1_0_6] | [~ [next_6<=0] & [1<=p2_2_1 & slot_F_F_F_T_F<=1]]]]]]] | ~ [[p1_3_3<=1 | [1<=p3_4_3 | p1_4_4<=1]]]] | [next_9<=0 | [~ [[~ [p1_0_1<=next_3] & p1_0_4<=1]] & [~ [[[~ [[1<=p3_1_3 & 1<=ncs_0_0]] & ~ [ncs_4_2<=p2_0_4]] | ncs_0_0<=0]] & p2_2_4<=ncs_0_4]]]]]
normalized: ~ [E [true U ~ [[[next_9<=0 | [[p2_2_4<=ncs_0_4 & ~ [[ncs_0_0<=0 | [~ [ncs_4_2<=p2_0_4] & ~ [[1<=p3_1_3 & 1<=ncs_0_0]]]]]] & ~ [[p1_0_4<=1 & ~ [p1_0_1<=next_3]]]]] | [~ [[p1_3_3<=1 | [1<=p3_4_3 | p1_4_4<=1]]] | ~ [[[p1_0_5<=0 & ~ [[[[1<=p2_2_1 & slot_F_F_F_T_F<=1] & ~ [next_6<=0]] | ~ [1<=p1_0_6]]]] | ~ [[~ [slot_F_F_F_T_F<=p1_3_6] & [~ [[p2_2_1<=ncs_4_2 | p2_0_1<=1]] | [[ncs_0_1<=0 & 1<=ncs_4_0] | [1<=p1_3_7 & 1<=p3_0_0]]]]]]]]]]]]

abstracting: (1<=p3_0_0)
states: 6,861 (3)
abstracting: (1<=p1_3_7)
states: 17,988 (4)
abstracting: (1<=ncs_4_0)
states: 52,514 (4)
abstracting: (ncs_0_1<=0)
states: 639,240 (5)
abstracting: (p2_0_1<=1)
states: 689,901 (5)
abstracting: (p2_2_1<=ncs_4_2)
states: 660,464 (5)
abstracting: (slot_F_F_F_T_F<=p1_3_6)
states: 598,229 (5)
abstracting: (1<=p1_0_6)
states: 24,946 (4)
abstracting: (next_6<=0)
states: 647,941 (5)
abstracting: (slot_F_F_F_T_F<=1)
states: 689,901 (5)
abstracting: (1<=p2_2_1)
states: 31,449 (4)
abstracting: (p1_0_5<=0)
states: 659,612 (5)
abstracting: (p1_4_4<=1)
states: 689,901 (5)
abstracting: (1<=p3_4_3)
states: 5,237 (3)
abstracting: (p1_3_3<=1)
states: 689,901 (5)
abstracting: (p1_0_1<=next_3)
states: 674,476 (5)
abstracting: (p1_0_4<=1)
states: 689,901 (5)
abstracting: (1<=ncs_0_0)
states: 52,514 (4)
abstracting: (1<=p3_1_3)
states: 5,237 (3)
abstracting: (ncs_4_2<=p2_0_4)
states: 643,010 (5)
abstracting: (ncs_0_0<=0)
states: 637,387 (5)
abstracting: (p2_2_4<=ncs_0_4)
states: 652,394 (5)
abstracting: (next_9<=0)
states: 687,981 (5)
-> the formula is FALSE

FORMULA Anderson-PT-05-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m51.627sec

checking: EF [~ [[[[[1<=ncs_4_1 & p1_0_4<=0] | [[~ [[next_2<=1 | p1_4_6<=1]] & [[~ [cs_2_3<=1] | 1<=ncs_0_1] & [~ [ncs_4_2<=cs_0_2] & ~ [ncs_0_4<=p3_1_1]]]] | ~ [1<=p1_1_5]]] | [cs_1_3<=p1_1_0 | p2_0_0<=cs_2_3]] | [[[~ [[[~ [ncs_2_0<=p2_4_1] & 1<=ncs_2_4] & [p1_1_7<=0 & [p1_4_3<=0 & 1<=p3_0_2]]]] | [[cs_2_0<=0 & [ncs_0_4<=0 & 1<=ncs_1_3]] & ~ [p1_4_6<=p3_3_1]]] | ~ [[[[[p3_1_2<=0 | 1<=p1_3_0] & [1<=p3_2_4 & p2_3_3<=1]] | [[p3_4_0<=1 & cs_4_2<=p2_3_1] | ~ [p2_1_4<=cs_2_4]]] & ~ [1<=p1_4_2]]]] | p2_2_4<=1]]]]
normalized: E [true U ~ [[[p2_2_4<=1 | [~ [[~ [1<=p1_4_2] & [[~ [p2_1_4<=cs_2_4] | [p3_4_0<=1 & cs_4_2<=p2_3_1]] | [[1<=p3_2_4 & p2_3_3<=1] & [p3_1_2<=0 | 1<=p1_3_0]]]]] | [[~ [p1_4_6<=p3_3_1] & [cs_2_0<=0 & [ncs_0_4<=0 & 1<=ncs_1_3]]] | ~ [[[p1_1_7<=0 & [p1_4_3<=0 & 1<=p3_0_2]] & [1<=ncs_2_4 & ~ [ncs_2_0<=p2_4_1]]]]]]] | [[cs_1_3<=p1_1_0 | p2_0_0<=cs_2_3] | [[~ [1<=p1_1_5] | [[[~ [ncs_0_4<=p3_1_1] & ~ [ncs_4_2<=cs_0_2]] & [1<=ncs_0_1 | ~ [cs_2_3<=1]]] & ~ [[next_2<=1 | p1_4_6<=1]]]] | [1<=ncs_4_1 & p1_0_4<=0]]]]]]

abstracting: (p1_0_4<=0)
states: 662,588 (5)
abstracting: (1<=ncs_4_1)
states: 50,661 (4)
abstracting: (p1_4_6<=1)
states: 689,901 (5)
abstracting: (next_2<=1)
states: 689,901 (5)
abstracting: (cs_2_3<=1)
states: 689,901 (5)
abstracting: (1<=ncs_0_1)
states: 50,661 (4)
abstracting: (ncs_4_2<=cs_0_2)
states: 641,159 (5)
abstracting: (ncs_0_4<=p3_1_1)
states: 635,802 (5)
abstracting: (1<=p1_1_5)
states: 30,289 (4)
abstracting: (p2_0_0<=cs_2_3)
states: 659,728 (5)
abstracting: (cs_1_3<=p1_1_0)
states: 684,664 (5)
abstracting: (ncs_2_0<=p2_4_1)
states: 639,492 (5)
abstracting: (1<=ncs_2_4)
states: 54,689 (4)
abstracting: (1<=p3_0_2)
states: 5,417 (3)
abstracting: (p1_4_3<=0)
states: 658,784 (5)
abstracting: (p1_1_7<=0)
states: 671,913 (5)
abstracting: (1<=ncs_1_3)
states: 48,381 (4)
abstracting: (ncs_0_4<=0)
states: 635,212 (5)
abstracting: (cs_2_0<=0)
states: 683,040 (5)
abstracting: (p1_4_6<=p3_3_1)
states: 664,955 (5)
abstracting: (1<=p1_3_0)
states: 15,485 (4)
abstracting: (p3_1_2<=0)
states: 684,484 (5)
abstracting: (p2_3_3<=1)
states: 689,901 (5)
abstracting: (1<=p3_2_4)
states: 8,077 (3)
abstracting: (cs_4_2<=p2_3_1)
states: 684,574 (5)
abstracting: (p3_4_0<=1)
states: 689,901 (5)
abstracting: (p2_1_4<=cs_2_4)
states: 649,896 (5)
abstracting: (1<=p1_4_2)
states: 27,489 (4)
abstracting: (p2_2_4<=1)
states: 689,901 (5)
-> the formula is FALSE

FORMULA Anderson-PT-05-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.264sec

checking: EF [[[ncs_2_3<=1 & [~ [p1_2_3<=1] | [[[[[p2_3_3<=p2_4_4 & next_2<=0] | ~ [1<=slot_T_F_F_F_F]] | [p3_0_3<=1 | [[1<=p3_3_1 | ncs_3_3<=ncs_3_1] | [1<=p3_2_3 | 1<=p1_1_1]]]] & [[[~ [p1_0_2<=p1_0_8] & ~ [ncs_4_0<=p1_1_1]] & ~ [p1_1_4<=0]] & [p1_0_2<=0 & ~ [[1<=p1_3_4 | ncs_1_4<=slot_F_F_F_F_F]]]]] & ~ [p1_2_8<=ncs_1_0]]]] & ~ [[[[[1<=p3_2_2 | ~ [1<=p2_0_0]] | ~ [ncs_3_2<=p2_0_0]] & [~ [p3_0_1<=p1_4_2] | ~ [[p3_4_4<=next_0 | slot_F_T_F_F_F<=p1_4_8]]]] | [[[cs_4_1<=1 | [1<=ncs_2_4 & p3_2_4<=p1_1_5]] & p3_2_4<=1] | [[1<=p1_2_0 & [p3_3_0<=1 | p1_0_4<=ncs_1_3]] & [1<=p2_1_4 & [p1_0_2<=p1_1_4 & p3_0_0<=p2_1_3]]]]]]]]
normalized: E [true U [~ [[[[[1<=p2_1_4 & [p1_0_2<=p1_1_4 & p3_0_0<=p2_1_3]] & [1<=p1_2_0 & [p3_3_0<=1 | p1_0_4<=ncs_1_3]]] | [p3_2_4<=1 & [cs_4_1<=1 | [1<=ncs_2_4 & p3_2_4<=p1_1_5]]]] | [[~ [[p3_4_4<=next_0 | slot_F_T_F_F_F<=p1_4_8]] | ~ [p3_0_1<=p1_4_2]] & [~ [ncs_3_2<=p2_0_0] | [1<=p3_2_2 | ~ [1<=p2_0_0]]]]]] & [ncs_2_3<=1 & [[~ [p1_2_8<=ncs_1_0] & [[[p1_0_2<=0 & ~ [[1<=p1_3_4 | ncs_1_4<=slot_F_F_F_F_F]]] & [~ [p1_1_4<=0] & [~ [ncs_4_0<=p1_1_1] & ~ [p1_0_2<=p1_0_8]]]] & [[p3_0_3<=1 | [[1<=p3_2_3 | 1<=p1_1_1] | [1<=p3_3_1 | ncs_3_3<=ncs_3_1]]] | [~ [1<=slot_T_F_F_F_F] | [p2_3_3<=p2_4_4 & next_2<=0]]]]] | ~ [p1_2_3<=1]]]]]

abstracting: (p1_2_3<=1)
states: 689,901 (5)
abstracting: (next_2<=0)
states: 571,970 (5)
abstracting: (p2_3_3<=p2_4_4)
states: 661,363 (5)
abstracting: (1<=slot_T_F_F_F_F)
states: 124,582 (5)
abstracting: (ncs_3_3<=ncs_3_1)
states: 641,520 (5)
abstracting: (1<=p3_3_1)
states: 5,945 (3)
abstracting: (1<=p1_1_1)
states: 22,305 (4)
abstracting: (1<=p3_2_3)
states: 5,237 (3)
abstracting: (p3_0_3<=1)
states: 689,901 (5)
abstracting: (p1_0_2<=p1_0_8)
states: 662,412 (5)
abstracting: (ncs_4_0<=p1_1_1)
states: 639,093 (5)
abstracting: (p1_1_4<=0)
states: 662,588 (5)
abstracting: (ncs_1_4<=slot_F_F_F_F_F)
states: 647,300 (5)
abstracting: (1<=p1_3_4)
states: 27,313 (4)
abstracting: (p1_0_2<=0)
states: 662,412 (5)
abstracting: (p1_2_8<=ncs_1_0)
states: 680,625 (5)
abstracting: (ncs_2_3<=1)
states: 689,901 (5)
abstracting: (1<=p2_0_0)
states: 30,545 (4)
abstracting: (1<=p3_2_2)
states: 5,417 (3)
abstracting: (ncs_3_2<=p2_0_0)
states: 642,638 (5)
abstracting: (p3_0_1<=p1_4_2)
states: 684,411 (5)
abstracting: (slot_F_T_F_F_F<=p1_4_8)
states: 581,975 (5)
abstracting: (p3_4_4<=next_0)
states: 682,449 (5)
abstracting: (p3_2_4<=p1_1_5)
states: 682,534 (5)
abstracting: (1<=ncs_2_4)
states: 54,689 (4)
abstracting: (cs_4_1<=1)
states: 689,901 (5)
abstracting: (p3_2_4<=1)
states: 689,901 (5)
abstracting: (p1_0_4<=ncs_1_3)
states: 664,231 (5)
abstracting: (p3_3_0<=1)
states: 689,901 (5)
abstracting: (1<=p1_2_0)
states: 15,485 (4)
abstracting: (p3_0_0<=p2_1_3)
states: 683,376 (5)
abstracting: (p1_0_2<=p1_1_4)
states: 663,318 (5)
abstracting: (1<=p2_1_4)
states: 40,005 (4)
-> the formula is FALSE

FORMULA Anderson-PT-05-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.632sec

totally nodes used: 120917428 (1.2e+08)
number of garbage collections: 1
fire ops cache: hits/miss/sum: 406910218 1105848857 1512759075
used/not used/entry size/cache size: 66822268 286596 16 1024MB
basic ops cache: hits/miss/sum: 59305122 127629556 186934678
used/not used/entry size/cache size: 16758856 18360 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: 254468 1020360 1274828
used/not used/entry size/cache size: 851665 7536943 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 29251449
1 23662606
2 10241646
3 3084980
4 711022
5 132804
6 21027
7 2933
8 350
9 43
>= 10 4

Total processing time: 7m20.068sec


BK_STOP 1680839638898

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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

72018 85209 85910 90069 97548 103176 98546 87712 92509 97784 103981 104284 100856 100448 100199
iterations count:1524211 (4175), effective:15193 (41)

initing FirstDep: 0m 0.000sec

20085 20489 20770 20906 63474 101387
iterations count:626008 (1715), effective:6782 (18)
14977 15292 15651 15910 64022 103137
iterations count:623856 (1709), effective:6777 (18)
25122 93292
iterations count:234701 (643), effective:2684 (7)
16115 16151 16171 16214 16212 81095 100339
iterations count:707616 (1938), effective:6812 (18)
2871 2913 2947 2944 3491 39580 95676
iterations count:749510 (2053), effective:7954 (21)

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="Anderson-PT-05"
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 Anderson-PT-05, 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 r522-tall-167987246800014"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-05.tgz
mv Anderson-PT-05 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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;