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.r010-oct2-167813598500014.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 ASLink-PT-01a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813598500014
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 660K
-rw-r--r-- 1 mcc users 7.1K Feb 26 13:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 13:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 13:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 13:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 13:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 13:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Feb 26 13:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Feb 26 13:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 201K 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 ASLink-PT-01a-ReachabilityCardinality-00
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-01
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-02
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-03
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-04
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-05
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-06
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-07
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-08
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-09
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-10
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-11
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-12
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-13
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-14
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678655296663

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=ASLink-PT-01a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-12 21:08:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 21:08:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 21:08:19] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2023-03-12 21:08:19] [INFO ] Transformed 431 places.
[2023-03-12 21:08:19] [INFO ] Transformed 735 transitions.
[2023-03-12 21:08:19] [INFO ] Found NUPN structural information;
[2023-03-12 21:08:19] [INFO ] Parsed PT model containing 431 places and 735 transitions and 2801 arcs in 214 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 7 transitions
Reduce redundant transitions removed 7 transitions.
FORMULA ASLink-PT-01a-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 188 resets, run finished after 392 ms. (steps per millisecond=25 ) properties (out of 13) seen :8
FORMULA ASLink-PT-01a-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 54 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 728 rows 431 cols
[2023-03-12 21:08:20] [INFO ] Computed 80 place invariants in 24 ms
[2023-03-12 21:08:20] [INFO ] After 280ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 21:08:20] [INFO ] [Nat]Absence check using 19 positive place invariants in 55 ms returned sat
[2023-03-12 21:08:20] [INFO ] [Nat]Absence check using 19 positive and 61 generalized place invariants in 45 ms returned sat
[2023-03-12 21:08:31] [INFO ] After 10016ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :1
[2023-03-12 21:08:31] [INFO ] Deduced a trap composed of 119 places in 780 ms of which 6 ms to minimize.
[2023-03-12 21:08:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 951 ms
[2023-03-12 21:08:32] [INFO ] After 11115ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :1
Attempting to minimize the solution found.
Minimization took 116 ms.
[2023-03-12 21:08:32] [INFO ] After 11497ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :1
FORMULA ASLink-PT-01a-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-01a-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-01a-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 15 ms.
Support contains 52 out of 431 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 431/431 places, 728/728 transitions.
Ensure Unique test removed 4 places
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 426 transition count 712
Reduce places removed 16 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 24 rules applied. Total rules applied 45 place count 410 transition count 704
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 53 place count 402 transition count 704
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 53 place count 402 transition count 680
Deduced a syphon composed of 24 places in 4 ms
Ensure Unique test removed 7 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 55 rules applied. Total rules applied 108 place count 371 transition count 680
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 111 place count 368 transition count 669
Ensure Unique test removed 1 places
Iterating global reduction 3 with 4 rules applied. Total rules applied 115 place count 367 transition count 669
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 5 rules applied. Total rules applied 120 place count 366 transition count 665
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 122 place count 364 transition count 665
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 123 place count 363 transition count 657
Iterating global reduction 5 with 1 rules applied. Total rules applied 124 place count 363 transition count 657
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 125 place count 362 transition count 649
Iterating global reduction 5 with 1 rules applied. Total rules applied 126 place count 362 transition count 649
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 127 place count 361 transition count 641
Iterating global reduction 5 with 1 rules applied. Total rules applied 128 place count 361 transition count 641
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 140 place count 355 transition count 635
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 141 place count 355 transition count 634
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 142 place count 354 transition count 634
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 143 place count 354 transition count 633
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 144 place count 353 transition count 633
Applied a total of 144 rules in 236 ms. Remains 353 /431 variables (removed 78) and now considering 633/728 (removed 95) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 237 ms. Remains : 353/431 places, 633/728 transitions.
Incomplete random walk after 10000 steps, including 187 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Finished probabilistic random walk after 43337 steps, run visited all 2 properties in 385 ms. (steps per millisecond=112 )
Probabilistic random walk after 43337 steps, saw 18525 distinct states, run finished after 398 ms. (steps per millisecond=108 ) properties seen :2
FORMULA ASLink-PT-01a-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ASLink-PT-01a-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 13987 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: ASLink_PT_01a
(NrP: 431 NrTr: 735 NrArc: 2801)

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

net check time: 0m 0.000sec

init dd package: 0m 2.942sec


RS generation: 1m 8.968sec


-> reachability set: #nodes 22241 (2.2e+04) #states 189,402,887 (8)



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

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

abstracting: (p256<=1)
states: 189,402,887 (8)
-> the formula is FALSE

FORMULA ASLink-PT-01a-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

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

abstracting: (p195<=1)
states: 189,402,887 (8)
-> the formula is TRUE

FORMULA ASLink-PT-01a-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

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

abstracting: (1<=p368)
states: 434,436 (5)
-> the formula is TRUE

FORMULA ASLink-PT-01a-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m35.777sec

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

abstracting: (1<=p350)
states: 5,440,025 (6)
-> the formula is FALSE

FORMULA ASLink-PT-01a-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m47.225sec

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

abstracting: (1<=p361)
states: 434,436 (5)
-> the formula is FALSE

FORMULA ASLink-PT-01a-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m34.510sec

checking: EF [~ [p37<=p165]]
normalized: E [true U ~ [p37<=p165]]

abstracting: (p37<=p165)
states: 133,089,369 (8)
-> the formula is TRUE

FORMULA ASLink-PT-01a-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m32.603sec

checking: EF [~ [p269<=p62]]
normalized: E [true U ~ [p269<=p62]]

abstracting: (p269<=p62)
states: 184,214,457 (8)
-> the formula is TRUE

FORMULA ASLink-PT-01a-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m35.738sec

checking: AG [[1<=p315 | p404<=1]]
normalized: ~ [E [true U ~ [[1<=p315 | p404<=1]]]]

abstracting: (p404<=1)
states: 189,402,887 (8)
abstracting: (1<=p315)
states: 37,649 (4)
-> the formula is TRUE

FORMULA ASLink-PT-01a-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.028sec

checking: EF [[[1<=p258 | p154<=0] & 1<=p230]]
normalized: E [true U [1<=p230 & [1<=p258 | p154<=0]]]

abstracting: (p154<=0)
states: 188,371,763 (8)
abstracting: (1<=p258)
states: 270,522 (5)
abstracting: (1<=p230)
states: 5,249,222 (6)
-> the formula is TRUE

FORMULA ASLink-PT-01a-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m37.465sec

checking: AG [[[[[~ [p351<=p166] | p0<=p350] & p313<=1] | p302<=p186] & p380<=1]]
normalized: ~ [E [true U ~ [[p380<=1 & [p302<=p186 | [p313<=1 & [p0<=p350 | ~ [p351<=p166]]]]]]]]

abstracting: (p351<=p166)
states: 188,631,979 (8)
abstracting: (p0<=p350)
states: 189,402,886 (8)
abstracting: (p313<=1)
states: 189,402,887 (8)
abstracting: (p302<=p186)
states: 188,990,267 (8)
abstracting: (p380<=1)
states: 189,402,887 (8)
-> the formula is TRUE

FORMULA ASLink-PT-01a-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.089sec

checking: AG [~ [[1<=p311 & [[[~ [p307<=p428] | p395<=p89] | [[p290<=p19 | [[p161<=1 | 1<=p304] | [p70<=p312 | p107<=0]]] | [1<=p261 & p351<=1]]] | [[~ [[~ [p304<=p165] & 1<=p387]] | ~ [[[1<=p269 | 1<=p158] | 1<=p354]]] | 1<=p164]]]]]
normalized: ~ [E [true U [1<=p311 & [[1<=p164 | [~ [[1<=p354 | [1<=p269 | 1<=p158]]] | ~ [[1<=p387 & ~ [p304<=p165]]]]] | [[[1<=p261 & p351<=1] | [p290<=p19 | [[p70<=p312 | p107<=0] | [p161<=1 | 1<=p304]]]] | [p395<=p89 | ~ [p307<=p428]]]]]]]

abstracting: (p307<=p428)
states: 188,968,451 (8)
abstracting: (p395<=p89)
states: 184,782,763 (8)
abstracting: (1<=p304)
states: 434,436 (5)
abstracting: (p161<=1)
states: 189,402,887 (8)
abstracting: (p107<=0)
states: 189,368,044 (8)
abstracting: (p70<=p312)
states: 178,388,687 (8)
abstracting: (p290<=p19)
states: 176,326,301 (8)
abstracting: (p351<=1)
states: 189,402,887 (8)
abstracting: (1<=p261)
states: 270,522 (5)
abstracting: (p304<=p165)
states: 189,006,467 (8)
abstracting: (1<=p387)
states: 13,862,292 (7)
abstracting: (1<=p158)
states: 1,843,500 (6)
abstracting: (1<=p269)
states: 5,505,110 (6)
abstracting: (1<=p354)
states: 423,470 (5)
abstracting: (1<=p164)
states: 16,591,500 (7)
abstracting: (1<=p311)
states: 163,865 (5)

before gc: list nodes free: 621784

after gc: idd nodes used:179238, unused:63820762; list nodes free:282343096
-> the formula is FALSE

FORMULA ASLink-PT-01a-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m47.902sec

checking: EF [[~ [[[~ [[~ [[~ [1<=p269] | [p288<=p401 & 1<=p304]]] & [[p163<=p326 | p75<=p80] | ~ [p102<=1]]]] & [1<=p232 | [[[p308<=0 | p190<=p47] & [1<=p127 | p148<=p390]] | p53<=0]]] | [p83<=p37 | 1<=p43]]] | ~ [[~ [p261<=1] | ~ [[~ [p60<=0] & p280<=p289]]]]]]
normalized: E [true U [~ [[~ [[p280<=p289 & ~ [p60<=0]]] | ~ [p261<=1]]] | ~ [[[p83<=p37 | 1<=p43] | [[1<=p232 | [p53<=0 | [[1<=p127 | p148<=p390] & [p308<=0 | p190<=p47]]]] & ~ [[[~ [p102<=1] | [p163<=p326 | p75<=p80]] & ~ [[[p288<=p401 & 1<=p304] | ~ [1<=p269]]]]]]]]]]

abstracting: (1<=p269)
states: 5,505,110 (6)
abstracting: (1<=p304)
states: 434,436 (5)
abstracting: (p288<=p401)
states: 180,161,359 (8)
abstracting: (p75<=p80)
states: 189,383,056 (8)
abstracting: (p163<=p326)
states: 173,299,439 (8)
abstracting: (p102<=1)
states: 189,402,887 (8)
abstracting: (p190<=p47)
states: 189,293,273 (8)
abstracting: (p308<=0)
states: 188,964,201 (8)
abstracting: (p148<=p390)
states: 188,393,687 (8)
abstracting: (1<=p127)
states: 21,492,828 (7)
abstracting: (p53<=0)
states: 138,547,192 (8)
abstracting: (1<=p232)
states: 4,790,412 (6)
abstracting: (1<=p43)
states: 5,060,934 (6)
abstracting: (p83<=p37)
states: 189,383,056 (8)
abstracting: (p261<=1)
states: 189,402,887 (8)
abstracting: (p60<=0)
states: 178,477,427 (8)
abstracting: (p280<=p289)
states: 189,402,887 (8)
-> the formula is TRUE

FORMULA ASLink-PT-01a-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m29.980sec

checking: EF [~ [[[~ [[[p321<=1 & 1<=p406] & ~ [p32<=0]]] | [[[~ [[~ [p362<=0] | ~ [1<=p206]]] & p118<=0] | p251<=0] & [[[1<=p404 | ~ [[p287<=p34 & p213<=p407]]] | [[[p9<=0 | 1<=p199] & p29<=p422] & [~ [p322<=0] & p294<=p395]]] & [[[p26<=p320 & [p378<=0 | 1<=p1]] & 1<=p136] & [[[p393<=0 & p109<=0] & p316<=p350] | ~ [p391<=p221]]]]]] | ~ [p135<=1]]]]
normalized: E [true U ~ [[~ [p135<=1] | [[[[[~ [p391<=p221] | [p316<=p350 & [p393<=0 & p109<=0]]] & [1<=p136 & [p26<=p320 & [p378<=0 | 1<=p1]]]] & [[[p294<=p395 & ~ [p322<=0]] & [p29<=p422 & [p9<=0 | 1<=p199]]] | [1<=p404 | ~ [[p287<=p34 & p213<=p407]]]]] & [p251<=0 | [p118<=0 & ~ [[~ [1<=p206] | ~ [p362<=0]]]]]] | ~ [[~ [p32<=0] & [p321<=1 & 1<=p406]]]]]]]

abstracting: (1<=p406)
states: 954,404 (5)
abstracting: (p321<=1)
states: 189,402,887 (8)
abstracting: (p32<=0)
states: 184,072,001 (8)
abstracting: (p362<=0)
states: 188,979,417 (8)
abstracting: (1<=p206)
states: 31,151,484 (7)
abstracting: (p118<=0)
states: 187,965,281 (8)
abstracting: (p251<=0)
states: 189,132,365 (8)
abstracting: (p213<=p407)
states: 176,330,477 (8)
abstracting: (p287<=p34)
states: 162,464,009 (8)
abstracting: (1<=p404)
states: 11,830,431 (7)
abstracting: (1<=p199)
states: 126,623 (5)
abstracting: (p9<=0)
states: 189,383,056 (8)
abstracting: (p29<=p422)
states: 178,778,849 (8)
abstracting: (p322<=0)
states: 188,979,417 (8)
abstracting: (p294<=p395)
states: 189,065,077 (8)
abstracting: (1<=p1)
states: 31,971,528 (7)
abstracting: (p378<=0)
states: 183,909,272 (8)
abstracting: (p26<=p320)
states: 178,762,557 (8)
abstracting: (1<=p136)
states: 3,395,100 (6)
abstracting: (p109<=0)
states: 189,368,386 (8)
abstracting: (p393<=0)
states: 184,782,123 (8)
abstracting: (p316<=p350)
states: 189,326,663 (8)
abstracting: (p391<=p221)
states: 187,260,770 (8)
abstracting: (p135<=1)
states: 189,402,887 (8)
-> the formula is TRUE

FORMULA ASLink-PT-01a-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m 0.018sec

checking: AG [[[[1<=p112 | ~ [[[[p400<=1 | p33<=p411] | ~ [1<=p233]] & ~ [p20<=p122]]]] & [[~ [1<=p210] | [[~ [p86<=p56] & [[1<=p278 & [1<=p414 | p357<=0]] & [[1<=p365 & p25<=p28] | ~ [p211<=1]]]] | p376<=p26]] | [~ [1<=p116] & [[p379<=p224 | [[[p160<=1 | 1<=p28] & ~ [p257<=p415]] & [[p42<=1 | p300<=0] & [p95<=0 & 1<=p71]]]] | ~ [[~ [p121<=1] | ~ [p142<=p36]]]]]]] | p96<=0]]
normalized: ~ [E [true U ~ [[p96<=0 | [[[[~ [[~ [p142<=p36] | ~ [p121<=1]]] | [p379<=p224 | [[[p95<=0 & 1<=p71] & [p42<=1 | p300<=0]] & [~ [p257<=p415] & [p160<=1 | 1<=p28]]]]] & ~ [1<=p116]] | [[p376<=p26 | [[[~ [p211<=1] | [1<=p365 & p25<=p28]] & [1<=p278 & [1<=p414 | p357<=0]]] & ~ [p86<=p56]]] | ~ [1<=p210]]] & [1<=p112 | ~ [[~ [p20<=p122] & [~ [1<=p233] | [p400<=1 | p33<=p411]]]]]]]]]]

abstracting: (p33<=p411)
states: 184,202,952 (8)
abstracting: (p400<=1)
states: 189,402,887 (8)
abstracting: (1<=p233)
states: 4,790,412 (6)
abstracting: (p20<=p122)
states: 162,868,657 (8)
abstracting: (1<=p112)
states: 1,437,606 (6)
abstracting: (1<=p210)
states: 65,755,494 (7)
abstracting: (p86<=p56)
states: 189,383,056 (8)
abstracting: (p357<=0)
states: 182,692,452 (8)
abstracting: (1<=p414)
states: 4,620,764 (6)
abstracting: (1<=p278)
states: 4,357,498 (6)
abstracting: (p25<=p28)
states: 178,738,463 (8)
abstracting: (1<=p365)
states: 1,006,385 (6)
abstracting: (p211<=1)
states: 189,402,887 (8)
abstracting: (p376<=p26)
states: 189,003,511 (8)
abstracting: (1<=p116)
states: 1,437,606 (6)
abstracting: (1<=p28)
states: 10,664,424 (7)
abstracting: (p160<=1)
states: 189,402,887 (8)
abstracting: (p257<=p415)
states: 189,132,365 (8)
abstracting: (p300<=0)
states: 185,459,410 (8)
abstracting: (p42<=1)
states: 189,402,887 (8)
abstracting: (1<=p71)
states: 7,114,860 (6)
abstracting: (p95<=0)
states: 189,390,725 (8)
abstracting: (p379<=p224)
states: 188,563,099 (8)
abstracting: (p121<=1)
states: 189,402,887 (8)
abstracting: (p142<=p36)
states: 158,846,987 (8)
abstracting: (p96<=0)
states: 189,362,183 (8)
-> the formula is FALSE

FORMULA ASLink-PT-01a-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m56.437sec

checking: AG [~ [[[[[[[[1<=p215 | ~ [p268<=p56]] | [[p186<=p401 | 1<=p379] | ~ [p313<=p310]]] & ~ [[[1<=p391 | p284<=p328] | ~ [1<=p93]]]] & [[1<=p83 & ~ [p266<=p94]] | 1<=p329]] & [[[~ [1<=p252] & [[p54<=p318 & 1<=p91] & 1<=p211]] | p54<=p16] & [[p353<=0 & p378<=p288] | 1<=p221]]] & [p341<=1 | [~ [[~ [p293<=1] & ~ [1<=p351]]] | ~ [[[[p423<=p25 & p314<=1] | [p369<=p332 & p122<=0]] & 1<=p331]]]]] & [[p189<=1 & p65<=p134] | p209<=p145]]]]
normalized: ~ [E [true U [[[[[[[1<=p215 | ~ [p268<=p56]] | [~ [p313<=p310] | [p186<=p401 | 1<=p379]]] & ~ [[~ [1<=p93] | [1<=p391 | p284<=p328]]]] & [1<=p329 | [1<=p83 & ~ [p266<=p94]]]] & [[1<=p221 | [p353<=0 & p378<=p288]] & [p54<=p16 | [[1<=p211 & [p54<=p318 & 1<=p91]] & ~ [1<=p252]]]]] & [p341<=1 | [~ [[1<=p331 & [[p369<=p332 & p122<=0] | [p423<=p25 & p314<=1]]]] | ~ [[~ [1<=p351] & ~ [p293<=1]]]]]] & [p209<=p145 | [p189<=1 & p65<=p134]]]]]

abstracting: (p65<=p134)
states: 182,325,611 (8)
abstracting: (p189<=1)
states: 189,402,887 (8)
abstracting: (p209<=p145)
states: 164,486,233 (8)
abstracting: (p293<=1)
states: 189,402,887 (8)
abstracting: (1<=p351)
states: 846,940 (5)
abstracting: (p314<=1)
states: 189,402,887 (8)
abstracting: (p423<=p25)
states: 178,243,814 (8)
abstracting: (p122<=0)
states: 188,371,763 (8)
abstracting: (p369<=p332)
states: 183,638,496 (8)
abstracting: (1<=p331)
states: 5,863,495 (6)
abstracting: (p341<=1)
states: 189,402,887 (8)
abstracting: (1<=p252)
states: 270,522 (5)
abstracting: (1<=p91)
states: 12,162 (4)
abstracting: (p54<=p318)
states: 152,119,242 (8)
abstracting: (1<=p211)
states: 13,146,867 (7)
abstracting: (p54<=p16)
states: 151,256,804 (8)
abstracting: (p378<=p288)
states: 183,909,272 (8)
abstracting: (p353<=0)
states: 188,979,417 (8)
abstracting: (1<=p221)
states: 223,596 (5)
abstracting: (p266<=p94)
states: 188,956,121 (8)
abstracting: (1<=p83)
states: 19,831 (4)
abstracting: (1<=p329)
states: 423,470 (5)
abstracting: (p284<=p328)
states: 185,048,967 (8)
abstracting: (1<=p391)
states: 2,147,409 (6)
abstracting: (1<=p93)
states: 12,162 (4)
abstracting: (1<=p379)
states: 1,006,385 (6)
abstracting: (p186<=p401)
states: 180,024,707 (8)
abstracting: (p313<=p310)
states: 189,391,470 (8)
abstracting: (p268<=p56)
states: 185,302,665 (8)
abstracting: (1<=p215)
states: 9,500,400 (6)
-> the formula is TRUE

FORMULA ASLink-PT-01a-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.381sec

checking: AG [[~ [[[~ [[[[[p314<=0 | p426<=1] & [1<=p184 & p392<=1]] | [[p371<=p275 | p412<=0] & [p203<=p185 | p67<=1]]] | [~ [p259<=0] | [[1<=p54 & 1<=p127] | [1<=p95 | p158<=p74]]]]] & ~ [[~ [[p161<=0 | p364<=0]] | [1<=p290 & [p310<=p163 & 1<=p303]]]]] & ~ [[[~ [[1<=p275 & [1<=p377 | p314<=1]]] | [~ [p257<=p284] | [~ [p53<=1] & [1<=p305 & p42<=1]]]] & ~ [[[p306<=1 | p85<=1] | ~ [1<=p333]]]]]]] | [[[[[~ [p272<=p269] & [~ [[p39<=p223 & p86<=0]] & [[1<=p323 & 1<=p90] & ~ [1<=p350]]]] | [p388<=p65 & [[[p38<=0 | p87<=p208] | ~ [p167<=p82]] & [[1<=p358 | p230<=p340] & p388<=p230]]]] & [~ [[[[1<=p74 & p13<=p34] | ~ [p320<=1]] & ~ [[p232<=p62 & 1<=p225]]]] | [~ [[~ [1<=p102] | ~ [p96<=p64]]] & p273<=p370]]] & p324<=p141] & [[[~ [p341<=p184] & [~ [[p353<=p246 & 1<=p332]] | [p418<=1 | [[p107<=p146 | p378<=p245] | [p257<=0 | p413<=p130]]]]] | [[[[[p395<=p82 | 1<=p78] & 1<=p251] | [p31<=0 | [1<=p425 & p197<=0]]] | ~ [[~ [p325<=1] & ~ [p172<=0]]]] & 1<=p384]] | [1<=p361 | ~ [p326<=0]]]]]]
normalized: ~ [E [true U ~ [[[[[1<=p361 | ~ [p326<=0]] | [[1<=p384 & [~ [[~ [p172<=0] & ~ [p325<=1]]] | [[p31<=0 | [1<=p425 & p197<=0]] | [1<=p251 & [p395<=p82 | 1<=p78]]]]] | [[[p418<=1 | [[p257<=0 | p413<=p130] | [p107<=p146 | p378<=p245]]] | ~ [[p353<=p246 & 1<=p332]]] & ~ [p341<=p184]]]] & [p324<=p141 & [[[p273<=p370 & ~ [[~ [p96<=p64] | ~ [1<=p102]]]] | ~ [[~ [[p232<=p62 & 1<=p225]] & [~ [p320<=1] | [1<=p74 & p13<=p34]]]]] & [[p388<=p65 & [[p388<=p230 & [1<=p358 | p230<=p340]] & [~ [p167<=p82] | [p38<=0 | p87<=p208]]]] | [[[~ [1<=p350] & [1<=p323 & 1<=p90]] & ~ [[p39<=p223 & p86<=0]]] & ~ [p272<=p269]]]]]] | ~ [[~ [[~ [[~ [1<=p333] | [p306<=1 | p85<=1]]] & [[[[1<=p305 & p42<=1] & ~ [p53<=1]] | ~ [p257<=p284]] | ~ [[1<=p275 & [1<=p377 | p314<=1]]]]]] & [~ [[[1<=p290 & [p310<=p163 & 1<=p303]] | ~ [[p161<=0 | p364<=0]]]] & ~ [[[[[1<=p95 | p158<=p74] | [1<=p54 & 1<=p127]] | ~ [p259<=0]] | [[[p203<=p185 | p67<=1] & [p371<=p275 | p412<=0]] | [[1<=p184 & p392<=1] & [p314<=0 | p426<=1]]]]]]]]]]]]

abstracting: (p426<=1)
states: 189,402,887 (8)
abstracting: (p314<=0)
states: 189,391,470 (8)
abstracting: (p392<=1)
states: 189,402,887 (8)
abstracting: (1<=p184)
states: 9,609,300 (6)
abstracting: (p412<=0)
states: 184,782,123 (8)
abstracting: (p371<=p275)
states: 188,555,947 (8)
abstracting: (p67<=1)
states: 189,402,887 (8)
abstracting: (p203<=p185)
states: 189,368,811 (8)
abstracting: (p259<=0)
states: 189,132,365 (8)
abstracting: (1<=p127)
states: 21,492,828 (7)
abstracting: (1<=p54)
states: 38,165,914 (7)
abstracting: (p158<=p74)
states: 187,559,387 (8)
abstracting: (1<=p95)
states: 12,162 (4)
abstracting: (p364<=0)
states: 183,909,272 (8)
abstracting: (p161<=0)
states: 172,811,387 (8)
abstracting: (1<=p303)
states: 434,436 (5)
abstracting: (p310<=p163)
states: 188,116,910 (8)
abstracting: (1<=p290)
states: 13,862,292 (7)
abstracting: (p314<=1)
states: 189,402,887 (8)
abstracting: (1<=p377)
states: 6,728,067 (6)
abstracting: (1<=p275)
states: 1,382,695 (6)
abstracting: (p257<=p284)
states: 189,132,365 (8)
abstracting: (p53<=1)
states: 189,402,887 (8)
abstracting: (p42<=1)
states: 189,402,887 (8)
abstracting: (1<=p305)
states: 434,436 (5)
abstracting: (p85<=1)
states: 189,402,887 (8)
abstracting: (p306<=1)
states: 189,402,887 (8)
abstracting: (1<=p333)
states: 846,940 (5)
abstracting: (p272<=p269)
states: 184,992,145 (8)
abstracting: (p86<=0)
states: 189,383,056 (8)
abstracting: (p39<=p223)
states: 184,341,953 (8)
abstracting: (1<=p90)
states: 12,162 (4)
abstracting: (1<=p323)
states: 423,470 (5)
abstracting: (1<=p350)
states: 5,440,025 (6)
abstracting: (p87<=p208)
states: 189,386,070 (8)
abstracting: (p38<=0)
states: 184,341,953 (8)
abstracting: (p167<=p82)
states: 172,811,387 (8)
abstracting: (p230<=p340)
states: 184,153,665 (8)
abstracting: (1<=p358)
states: 5,468,623 (6)
abstracting: (p388<=p230)
states: 176,256,398 (8)
abstracting: (p388<=p65)
states: 176,077,733 (8)
abstracting: (p13<=p34)
states: 189,383,056 (8)
abstracting: (1<=p74)
states: 19,831 (4)
abstracting: (p320<=1)
states: 189,402,887 (8)
abstracting: (1<=p225)
states: 9,752 (3)
abstracting: (p232<=p62)
states: 184,880,435 (8)
abstracting: (1<=p102)
states: 211,740 (5)
abstracting: (p96<=p64)
states: 189,362,183 (8)
abstracting: (p273<=p370)
states: 188,147,853 (8)
abstracting: (p324<=p141)
states: 189,049,833 (8)
abstracting: (p341<=p184)
states: 188,990,267 (8)
abstracting: (1<=p332)
states: 5,440,025 (6)
abstracting: (p353<=p246)
states: 188,979,417 (8)
abstracting: (p378<=p245)
states: 183,909,272 (8)
abstracting: (p107<=p146)
states: 189,368,044 (8)
abstracting: (p413<=p130)
states: 184,807,701 (8)
abstracting: (p257<=0)
states: 189,132,365 (8)
abstracting: (p418<=1)
states: 189,402,887 (8)
abstracting: (1<=p78)
states: 19,831 (4)
abstracting: (p395<=p82)
states: 184,782,395 (8)
abstracting: (1<=p251)
states: 270,522 (5)
abstracting: (p197<=0)
states: 189,354,239 (8)
abstracting: (1<=p425)
states: 1,754,744 (6)
abstracting: (p31<=0)
states: 178,731,569 (8)
abstracting: (p325<=1)
states: 189,402,887 (8)
abstracting: (p172<=0)
states: 188,397,515 (8)
abstracting: (1<=p384)
states: 13,862,292 (7)
abstracting: (p326<=0)
states: 183,962,862 (8)
abstracting: (1<=p361)
states: 434,436 (5)
-> the formula is TRUE

FORMULA ASLink-PT-01a-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.790sec

totally nodes used: 94091775 (9.4e+07)
number of garbage collections: 1
fire ops cache: hits/miss/sum: 612890959 1986762157 2599653116
used/not used/entry size/cache size: 67086219 22645 16 1024MB
basic ops cache: hits/miss/sum: 38443899 97709039 136152938
used/not used/entry size/cache size: 16135070 642146 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: 163089 799963 963052
used/not used/entry size/cache size: 618223 7770385 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 44857398
1 16053011
2 4728295
3 1177739
4 242553
5 42383
6 6472
7 882
8 117
9 14
>= 10 0

Total processing time: 8m14.856sec


BK_STOP 1678655808436

--------------------
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.002sec

10344 12252 12976 12998 14204 17743 15931 16998 17015 17443 18111 28183 22918 23983 24471 24509 24585 24430 25043 25076 25538 35846 25456 24834 24017 24410 24444 24313 23995 23452
iterations count:3076780 (4186), effective:68168 (92)

initing FirstDep: 0m 0.002sec

26930 29854 30538
iterations count:396834 (539), effective:9042 (12)
27706 29370 30394 30393 30483 28140
iterations count:694719 (945), effective:16600 (22)
26941 29855 30264
iterations count:386495 (525), effective:8818 (11)
33376 31570
iterations count:287849 (391), effective:7447 (10)
20308 25805 26355 26555 24519
iterations count:543127 (738), effective:11518 (15)
26497 29100 28670 27422 24356
iterations count:513418 (698), effective:13514 (18)
22898 21923 23891 23937 23530 24024 23646
iterations count:705684 (960), effective:16711 (22)
26930 32531 33483
iterations count:330642 (449), effective:7260 (9)
18662 19498 20014 23413 31760 24378 24858 24386 24881 24334 24841 29494 23957 24394 24480
iterations count:1520773 (2069), effective:36375 (49)
15541 17376 17581 27099 35995 31916 34350 34476 34985 34650 42441 43888 38403 38573 38536 38561 38566
iterations count:1768946 (2406), effective:40542 (55)

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="ASLink-PT-01a"
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 ASLink-PT-01a, 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 r010-oct2-167813598500014"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-01a.tgz
mv ASLink-PT-01a 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 ;