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.r234-tall-167856419900145.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 JoinFreeModules-PT-0004, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856419900145
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 8.6K Feb 25 11:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 25 11:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 11:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 25 11:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 11:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Feb 25 11:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 11:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 11:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 13K 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 JoinFreeModules-PT-0004-CTLCardinality-00
FORMULA_NAME JoinFreeModules-PT-0004-CTLCardinality-01
FORMULA_NAME JoinFreeModules-PT-0004-CTLCardinality-02
FORMULA_NAME JoinFreeModules-PT-0004-CTLCardinality-03
FORMULA_NAME JoinFreeModules-PT-0004-CTLCardinality-04
FORMULA_NAME JoinFreeModules-PT-0004-CTLCardinality-05
FORMULA_NAME JoinFreeModules-PT-0004-CTLCardinality-06
FORMULA_NAME JoinFreeModules-PT-0004-CTLCardinality-07
FORMULA_NAME JoinFreeModules-PT-0004-CTLCardinality-08
FORMULA_NAME JoinFreeModules-PT-0004-CTLCardinality-09
FORMULA_NAME JoinFreeModules-PT-0004-CTLCardinality-10
FORMULA_NAME JoinFreeModules-PT-0004-CTLCardinality-11
FORMULA_NAME JoinFreeModules-PT-0004-CTLCardinality-12
FORMULA_NAME JoinFreeModules-PT-0004-CTLCardinality-13
FORMULA_NAME JoinFreeModules-PT-0004-CTLCardinality-14
FORMULA_NAME JoinFreeModules-PT-0004-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679451979025

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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-0004
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 02:26:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 02:26:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 02:26:20] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2023-03-22 02:26:20] [INFO ] Transformed 21 places.
[2023-03-22 02:26:20] [INFO ] Transformed 33 transitions.
[2023-03-22 02:26:20] [INFO ] Parsed PT model containing 21 places and 33 transitions and 94 arcs in 74 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Initial state reduction rules removed 5 formulas.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-0004-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0004-CTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0004-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0004-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0004-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 33/33 transitions.
Applied a total of 0 rules in 8 ms. Remains 20 /20 variables (removed 0) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 20 cols
[2023-03-22 02:26:20] [INFO ] Computed 4 place invariants in 10 ms
[2023-03-22 02:26:20] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
[2023-03-22 02:26:20] [INFO ] Invariant cache hit.
[2023-03-22 02:26:20] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-22 02:26:20] [INFO ] Invariant cache hit.
[2023-03-22 02:26:20] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-22 02:26:20] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2023-03-22 02:26:20] [INFO ] Invariant cache hit.
[2023-03-22 02:26:20] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 287 ms. Remains : 20/20 places, 33/33 transitions.
Support contains 20 out of 20 places after structural reductions.
[2023-03-22 02:26:21] [INFO ] Flatten gal took : 16 ms
[2023-03-22 02:26:21] [INFO ] Flatten gal took : 8 ms
[2023-03-22 02:26:21] [INFO ] Input system was already deterministic with 33 transitions.
Incomplete random walk after 10000 steps, including 28 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 52) seen :51
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 02:26:21] [INFO ] Invariant cache hit.
[2023-03-22 02:26:21] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 02:26:21] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 02:26:21] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 02:26:21] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-22 02:26:21] [INFO ] After 5ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 02:26:21] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-03-22 02:26:21] [INFO ] After 151ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 33/33 transitions.
Graph (complete) has 48 edges and 20 vertex of which 10 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 16 output transitions
Drop transitions removed 16 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 16
Applied a total of 2 rules in 8 ms. Remains 10 /20 variables (removed 10) and now considering 16/33 (removed 17) transitions.
// Phase 1: matrix 16 rows 10 cols
[2023-03-22 02:26:21] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-22 02:26:21] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 10/20 places, 16/33 transitions.
Incomplete random walk after 10000 steps, including 82 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Probably explored full state space saw : 3844 states, properties seen :0
Probabilistic random walk after 21824 steps, saw 3844 distinct states, run finished after 39 ms. (steps per millisecond=559 ) properties seen :0
Explored full state space saw : 3844 states, properties seen :0
Exhaustive walk after 21824 steps, saw 3844 distinct states, run finished after 20 ms. (steps per millisecond=1091 ) properties seen :0
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
[2023-03-22 02:26:21] [INFO ] Flatten gal took : 5 ms
[2023-03-22 02:26:21] [INFO ] Flatten gal took : 3 ms
[2023-03-22 02:26:21] [INFO ] Input system was already deterministic with 33 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 20 cols
[2023-03-22 02:26:21] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-22 02:26:21] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41 ms. Remains : 20/20 places, 33/33 transitions.
[2023-03-22 02:26:21] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:26:21] [INFO ] Flatten gal took : 3 ms
[2023-03-22 02:26:21] [INFO ] Input system was already deterministic with 33 transitions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-03-22 02:26:21] [INFO ] Invariant cache hit.
[2023-03-22 02:26:21] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43 ms. Remains : 20/20 places, 33/33 transitions.
[2023-03-22 02:26:21] [INFO ] Flatten gal took : 5 ms
[2023-03-22 02:26:21] [INFO ] Flatten gal took : 1 ms
[2023-03-22 02:26:21] [INFO ] Input system was already deterministic with 33 transitions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 33/33 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-03-22 02:26:21] [INFO ] Invariant cache hit.
[2023-03-22 02:26:21] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 20/20 places, 33/33 transitions.
[2023-03-22 02:26:21] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:26:21] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:26:21] [INFO ] Input system was already deterministic with 33 transitions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-03-22 02:26:21] [INFO ] Invariant cache hit.
[2023-03-22 02:26:21] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52 ms. Remains : 20/20 places, 33/33 transitions.
[2023-03-22 02:26:21] [INFO ] Flatten gal took : 4 ms
[2023-03-22 02:26:21] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:26:21] [INFO ] Input system was already deterministic with 33 transitions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 33/33 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-03-22 02:26:21] [INFO ] Invariant cache hit.
[2023-03-22 02:26:21] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 20/20 places, 33/33 transitions.
[2023-03-22 02:26:21] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:26:21] [INFO ] Flatten gal took : 5 ms
[2023-03-22 02:26:21] [INFO ] Input system was already deterministic with 33 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 20/20 places, 33/33 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-03-22 02:26:21] [INFO ] Invariant cache hit.
[2023-03-22 02:26:21] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31 ms. Remains : 20/20 places, 33/33 transitions.
[2023-03-22 02:26:21] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:26:21] [INFO ] Flatten gal took : 1 ms
[2023-03-22 02:26:21] [INFO ] Input system was already deterministic with 33 transitions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 33/33 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-03-22 02:26:21] [INFO ] Invariant cache hit.
[2023-03-22 02:26:22] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 20/20 places, 33/33 transitions.
[2023-03-22 02:26:22] [INFO ] Flatten gal took : 1 ms
[2023-03-22 02:26:22] [INFO ] Flatten gal took : 1 ms
[2023-03-22 02:26:22] [INFO ] Input system was already deterministic with 33 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 20/20 places, 33/33 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-03-22 02:26:22] [INFO ] Invariant cache hit.
[2023-03-22 02:26:22] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 40 ms. Remains : 20/20 places, 33/33 transitions.
[2023-03-22 02:26:22] [INFO ] Flatten gal took : 1 ms
[2023-03-22 02:26:22] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:26:22] [INFO ] Input system was already deterministic with 33 transitions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 33/33 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-03-22 02:26:22] [INFO ] Invariant cache hit.
[2023-03-22 02:26:22] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 20/20 places, 33/33 transitions.
[2023-03-22 02:26:22] [INFO ] Flatten gal took : 1 ms
[2023-03-22 02:26:22] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:26:22] [INFO ] Input system was already deterministic with 33 transitions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-03-22 02:26:22] [INFO ] Invariant cache hit.
[2023-03-22 02:26:22] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 20/20 places, 33/33 transitions.
[2023-03-22 02:26:22] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:26:22] [INFO ] Flatten gal took : 1 ms
[2023-03-22 02:26:22] [INFO ] Input system was already deterministic with 33 transitions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 33/33 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2023-03-22 02:26:22] [INFO ] Invariant cache hit.
[2023-03-22 02:26:22] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 20/20 places, 33/33 transitions.
[2023-03-22 02:26:22] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:26:22] [INFO ] Flatten gal took : 1 ms
[2023-03-22 02:26:22] [INFO ] Input system was already deterministic with 33 transitions.
[2023-03-22 02:26:22] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:26:22] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:26:22] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-22 02:26:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 20 places, 33 transitions and 92 arcs took 0 ms.
Total runtime 1758 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 20 NrTr: 33 NrArc: 92)

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

net check time: 0m 0.000sec

init dd package: 0m 2.711sec


RS generation: 0m 0.000sec


-> reachability set: #nodes 109 (1.1e+02) #states 14,776,336 (7)



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

checking: AX [[EG [1<=p16] & p9<=1]]
normalized: ~ [EX [~ [[EG [1<=p16] & p9<=1]]]]

abstracting: (p9<=1)
states: 11,916,400 (7)
abstracting: (1<=p16)
states: 9,533,120 (6)
.
EG iterations: 1
.-> the formula is TRUE

FORMULA JoinFreeModules-PT-0004-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: A [[EX [0<=0] & EF [AX [[[p14<=1 & p6<=0] | A [1<=p1 U 3<=p8]]]]] U EX [3<=p17]]
normalized: [~ [EG [~ [EX [3<=p17]]]] & ~ [E [~ [EX [3<=p17]] U [~ [[E [true U ~ [EX [~ [[[~ [EG [~ [3<=p8]]] & ~ [E [~ [3<=p8] U [~ [1<=p1] & ~ [3<=p8]]]]] | [p14<=1 & p6<=0]]]]]] & EX [0<=0]]] & ~ [EX [3<=p17]]]]]]

abstracting: (3<=p17)
states: 1,906,624 (6)
.abstracting: (0<=0)
states: 14,776,336 (7)
.abstracting: (p6<=0)
states: 5,243,216 (6)
abstracting: (p14<=1)
states: 11,916,400 (7)
abstracting: (3<=p8)
states: 5,481,544 (6)
abstracting: (1<=p1)
states: 9,533,120 (6)
abstracting: (3<=p8)
states: 5,481,544 (6)
abstracting: (3<=p8)
states: 5,481,544 (6)
..........
EG iterations: 10
.abstracting: (3<=p17)
states: 1,906,624 (6)
.abstracting: (3<=p17)
states: 1,906,624 (6)
......
EG iterations: 5
-> the formula is TRUE

FORMULA JoinFreeModules-PT-0004-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.022sec

checking: AG [EX [[[EX [~ [p13<=p14]] | p16<=0] | [AF [~ [p18<=2]] | E [p19<=2 U ~ [1<=p15]]]]]]
normalized: ~ [E [true U ~ [EX [[[E [p19<=2 U ~ [1<=p15]] | ~ [EG [p18<=2]]] | [EX [~ [p13<=p14]] | p16<=0]]]]]]

abstracting: (p16<=0)
states: 5,243,216 (6)
abstracting: (p13<=p14)
states: 9,294,792 (6)
.abstracting: (p18<=2)
states: 9,294,792 (6)
..........
EG iterations: 10
abstracting: (1<=p15)
states: 10,724,760 (7)
abstracting: (p19<=2)
states: 12,631,384 (7)
.-> the formula is FALSE

FORMULA JoinFreeModules-PT-0004-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: [EF [[~ [p10<=p2] | ~ [p12<=2]]] & AG [~ [E [p3<=p4 U 1<=p3]]]]
normalized: [~ [E [true U E [p3<=p4 U 1<=p3]]] & E [true U [~ [p12<=2] | ~ [p10<=p2]]]]

abstracting: (p10<=p2)
states: 6,619,368 (6)
abstracting: (p12<=2)
states: 12,869,712 (7)
abstracting: (1<=p3)
states: 8,818,136 (6)
abstracting: (p3<=p4)
states: 9,294,792 (6)
-> the formula is FALSE

FORMULA JoinFreeModules-PT-0004-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EG [~ [E [A [AG [1<=p16] U [p13<=p8 & [p16<=3 | p8<=1]]] U ~ [[1<=p11 | 4<=p2]]]]]
normalized: EG [~ [E [[~ [EG [~ [[[p16<=3 | p8<=1] & p13<=p8]]]] & ~ [E [~ [[[p16<=3 | p8<=1] & p13<=p8]] U [E [true U ~ [1<=p16]] & ~ [[[p16<=3 | p8<=1] & p13<=p8]]]]]] U ~ [[1<=p11 | 4<=p2]]]]]

abstracting: (4<=p2)
states: 714,984 (5)
abstracting: (1<=p11)
states: 9,533,120 (6)
abstracting: (p13<=p8)
states: 9,267,884 (6)
abstracting: (p8<=1)
states: 8,341,480 (6)
abstracting: (p16<=3)
states: 13,823,024 (7)
abstracting: (1<=p16)
states: 9,533,120 (6)
abstracting: (p13<=p8)
states: 9,267,884 (6)
abstracting: (p8<=1)
states: 8,341,480 (6)
abstracting: (p16<=3)
states: 13,823,024 (7)
abstracting: (p13<=p8)
states: 9,267,884 (6)
abstracting: (p8<=1)
states: 8,341,480 (6)
abstracting: (p16<=3)
states: 13,823,024 (7)
..............
EG iterations: 14
..................
EG iterations: 18
-> the formula is FALSE

FORMULA JoinFreeModules-PT-0004-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.024sec

checking: AX [EF [[~ [E [[2<=p5 | p10<=p6] U EF [p9<=p0]]] & EF [[[p13<=0 & 4<=p10] | AX [2<=p4]]]]]]
normalized: ~ [EX [~ [E [true U [~ [E [[2<=p5 | p10<=p6] U E [true U p9<=p0]]] & E [true U [~ [EX [~ [2<=p4]]] | [p13<=0 & 4<=p10]]]]]]]]

abstracting: (4<=p10)
states: 2,859,936 (6)
abstracting: (p13<=0)
states: 5,958,200 (6)
abstracting: (2<=p4)
states: 2,859,936 (6)
.abstracting: (p9<=p0)
states: 11,601,192 (7)
abstracting: (p10<=p6)
states: 6,942,264 (6)
abstracting: (2<=p5)
states: 8,818,136 (6)
.-> the formula is TRUE

FORMULA JoinFreeModules-PT-0004-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.019sec

checking: EX [[[AX [~ [p6<=p11]] & ~ [E [AF [p13<=p6] U p17<=p19]]] & [~ [p14<=1] & ~ [p16<=3]]]]
normalized: EX [[[~ [p16<=3] & ~ [p14<=1]] & [~ [E [~ [EG [~ [p13<=p6]]] U p17<=p19]] & ~ [EX [p6<=p11]]]]]

abstracting: (p6<=p11)
states: 9,333,232 (6)
.abstracting: (p17<=p19)
states: 8,103,152 (6)
abstracting: (p13<=p6)
states: 8,452,956 (6)
.......
EG iterations: 7
abstracting: (p14<=1)
states: 11,916,400 (7)
abstracting: (p16<=3)
states: 13,823,024 (7)
.-> the formula is FALSE

FORMULA JoinFreeModules-PT-0004-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: A [~ [p4<=p2] U [EX [[AG [A [p16<=3 U p10<=0]] | ~ [1<=p6]]] | [E [[AF [1<=p3] | ~ [p5<=3]] U [~ [4<=p7] | ~ [p8<=2]]] & EG [~ [AG [p9<=p14]]]]]]
normalized: [~ [EG [~ [[[EG [E [true U ~ [p9<=p14]]] & E [[~ [p5<=3] | ~ [EG [~ [1<=p3]]]] U [~ [p8<=2] | ~ [4<=p7]]]] | EX [[~ [E [true U ~ [[~ [E [~ [p10<=0] U [~ [p16<=3] & ~ [p10<=0]]]] & ~ [EG [~ [p10<=0]]]]]]] | ~ [1<=p6]]]]]]] & ~ [E [~ [[[EG [E [true U ~ [p9<=p14]]] & E [[~ [p5<=3] | ~ [EG [~ [1<=p3]]]] U [~ [p8<=2] | ~ [4<=p7]]]] | EX [[~ [E [true U ~ [[~ [E [~ [p10<=0] U [~ [p16<=3] & ~ [p10<=0]]]] & ~ [EG [~ [p10<=0]]]]]]] | ~ [1<=p6]]]]] U [~ [[[EG [E [true U ~ [p9<=p14]]] & E [[~ [p5<=3] | ~ [EG [~ [1<=p3]]]] U [~ [p8<=2] | ~ [4<=p7]]]] | EX [[~ [E [true U ~ [[~ [E [~ [p10<=0] U [~ [p16<=3] & ~ [p10<=0]]]] & ~ [EG [~ [p10<=0]]]]]]] | ~ [1<=p6]]]]] & p4<=p2]]]]

abstracting: (p4<=p2)
states: 10,248,104 (7)
abstracting: (1<=p6)
states: 9,533,120 (6)
abstracting: (p10<=0)
states: 4,051,576 (6)
.....
EG iterations: 5
abstracting: (p10<=0)
states: 4,051,576 (6)
abstracting: (p16<=3)
states: 13,823,024 (7)
abstracting: (p10<=0)
states: 4,051,576 (6)
.abstracting: (4<=p7)
states: 714,984 (5)
abstracting: (p8<=2)
states: 9,294,792 (6)
abstracting: (1<=p3)
states: 8,818,136 (6)
.
EG iterations: 1
abstracting: (p5<=3)
states: 11,916,400 (7)
abstracting: (p9<=p14)
states: 10,271,168 (7)
.
EG iterations: 1
abstracting: (1<=p6)
states: 9,533,120 (6)
abstracting: (p10<=0)
states: 4,051,576 (6)
.....
EG iterations: 5
abstracting: (p10<=0)
states: 4,051,576 (6)
abstracting: (p16<=3)
states: 13,823,024 (7)
abstracting: (p10<=0)
states: 4,051,576 (6)
.abstracting: (4<=p7)
states: 714,984 (5)
abstracting: (p8<=2)
states: 9,294,792 (6)
abstracting: (1<=p3)
states: 8,818,136 (6)
.
EG iterations: 1
abstracting: (p5<=3)
states: 11,916,400 (7)
abstracting: (p9<=p14)
states: 10,271,168 (7)
.
EG iterations: 1
abstracting: (1<=p6)
states: 9,533,120 (6)
abstracting: (p10<=0)
states: 4,051,576 (6)
.....
EG iterations: 5
abstracting: (p10<=0)
states: 4,051,576 (6)
abstracting: (p16<=3)
states: 13,823,024 (7)
abstracting: (p10<=0)
states: 4,051,576 (6)
.abstracting: (4<=p7)
states: 714,984 (5)
abstracting: (p8<=2)
states: 9,294,792 (6)
abstracting: (1<=p3)
states: 8,818,136 (6)
.
EG iterations: 1
abstracting: (p5<=3)
states: 11,916,400 (7)
abstracting: (p9<=p14)
states: 10,271,168 (7)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA JoinFreeModules-PT-0004-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.017sec

checking: E [~ [p6<=p10] U AX [A [[~ [3<=p13] & [p2<=p16 & [p5<=p0 | p12<=1]]] U E [EX [p1<=1] U A [3<=p17 U 2<=p15]]]]]
normalized: E [~ [p6<=p10] U ~ [EX [~ [[~ [EG [~ [E [EX [p1<=1] U [~ [EG [~ [2<=p15]]] & ~ [E [~ [2<=p15] U [~ [3<=p17] & ~ [2<=p15]]]]]]]]] & ~ [E [~ [E [EX [p1<=1] U [~ [EG [~ [2<=p15]]] & ~ [E [~ [2<=p15] U [~ [3<=p17] & ~ [2<=p15]]]]]]] U [~ [[[p2<=p16 & [p5<=p0 | p12<=1]] & ~ [3<=p13]]] & ~ [E [EX [p1<=1] U [~ [EG [~ [2<=p15]]] & ~ [E [~ [2<=p15] U [~ [3<=p17] & ~ [2<=p15]]]]]]]]]]]]]]]

abstracting: (2<=p15)
states: 8,818,136 (6)
abstracting: (3<=p17)
states: 1,906,624 (6)
abstracting: (2<=p15)
states: 8,818,136 (6)
abstracting: (2<=p15)
states: 8,818,136 (6)
...........
EG iterations: 11
abstracting: (p1<=1)
states: 9,771,448 (6)
.abstracting: (3<=p13)
states: 5,481,544 (6)
abstracting: (p12<=1)
states: 10,248,104 (7)
abstracting: (p5<=p0)
states: 8,783,540 (6)
abstracting: (p2<=p16)
states: 9,852,172 (6)
abstracting: (2<=p15)
states: 8,818,136 (6)
abstracting: (3<=p17)
states: 1,906,624 (6)
abstracting: (2<=p15)
states: 8,818,136 (6)
abstracting: (2<=p15)
states: 8,818,136 (6)
...........
EG iterations: 11
abstracting: (p1<=1)
states: 9,771,448 (6)
.abstracting: (2<=p15)
states: 8,818,136 (6)
abstracting: (3<=p17)
states: 1,906,624 (6)
abstracting: (2<=p15)
states: 8,818,136 (6)
abstracting: (2<=p15)
states: 8,818,136 (6)
...........
EG iterations: 11
abstracting: (p1<=1)
states: 9,771,448 (6)
............
EG iterations: 11
.abstracting: (p6<=p10)
states: 10,786,264 (7)
-> the formula is TRUE

FORMULA JoinFreeModules-PT-0004-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.031sec

checking: EF [[[AX [4<=p18] | p6<=0] | [[~ [1<=p8] & E [[4<=p2 | p7<=p16] U [3<=p8 & p6<=p17]]] | [~ [p9<=p19] & 2<=p14]]]]
normalized: E [true U [[[2<=p14 & ~ [p9<=p19]] | [E [[4<=p2 | p7<=p16] U [3<=p8 & p6<=p17]] & ~ [1<=p8]]] | [p6<=0 | ~ [EX [~ [4<=p18]]]]]]

abstracting: (4<=p18)
states: 2,144,952 (6)
.abstracting: (p6<=0)
states: 5,243,216 (6)
abstracting: (1<=p8)
states: 8,818,136 (6)
abstracting: (p6<=p17)
states: 8,968,052 (6)
abstracting: (3<=p8)
states: 5,481,544 (6)
abstracting: (p7<=p16)
states: 9,852,172 (6)
abstracting: (4<=p2)
states: 714,984 (5)
abstracting: (p9<=p19)
states: 10,271,168 (7)
abstracting: (2<=p14)
states: 2,859,936 (6)
-> the formula is TRUE

FORMULA JoinFreeModules-PT-0004-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.047sec

checking: [[EF [[p7<=p6 | [A [p14<=2 U 2<=p2] | AX [2<=p15]]]] & AG [EX [0<=0]]] & [AX [E [EF [2<=p9] U [AG [2<=p7] | [1<=p7 & p11<=p7]]]] & [AX [[AG [1<=p18] | A [~ [E [p1<=2 U p1<=2]] U [p14<=p8 | [2<=p12 | [p15<=p6 & 4<=p19]]]]]] & [AG [p13<=p3] | AX [[[3<=p0 & [p2<=0 | p3<=p6]] | [[[~ [p0<=p18] | ~ [4<=p1]] & ~ [p7<=p16]] | [~ [p1<=p0] & p13<=3]]]]]]]]
normalized: [[[[~ [EX [~ [[[[p13<=3 & ~ [p1<=p0]] | [~ [p7<=p16] & [~ [4<=p1] | ~ [p0<=p18]]]] | [3<=p0 & [p2<=0 | p3<=p6]]]]]] | ~ [E [true U ~ [p13<=p3]]]] & ~ [EX [~ [[[~ [EG [~ [[p14<=p8 | [2<=p12 | [p15<=p6 & 4<=p19]]]]]] & ~ [E [~ [[p14<=p8 | [2<=p12 | [p15<=p6 & 4<=p19]]]] U [E [p1<=2 U p1<=2] & ~ [[p14<=p8 | [2<=p12 | [p15<=p6 & 4<=p19]]]]]]]] | ~ [E [true U ~ [1<=p18]]]]]]]] & ~ [EX [~ [E [E [true U 2<=p9] U [[1<=p7 & p11<=p7] | ~ [E [true U ~ [2<=p7]]]]]]]]] & [~ [E [true U ~ [EX [0<=0]]]] & E [true U [p7<=p6 | [~ [EX [~ [2<=p15]]] | [~ [EG [~ [2<=p2]]] & ~ [E [~ [2<=p2] U [~ [p14<=2] & ~ [2<=p2]]]]]]]]]]

abstracting: (2<=p2)
states: 4,528,232 (6)
abstracting: (p14<=2)
states: 12,631,384 (7)
abstracting: (2<=p2)
states: 4,528,232 (6)
abstracting: (2<=p2)
states: 4,528,232 (6)
........
EG iterations: 8
abstracting: (2<=p15)
states: 8,818,136 (6)
.abstracting: (p7<=p6)
states: 9,294,792 (6)
abstracting: (0<=0)
states: 14,776,336 (7)
.abstracting: (2<=p7)
states: 4,528,232 (6)
abstracting: (p11<=p7)
states: 8,968,052 (6)
abstracting: (1<=p7)
states: 8,818,136 (6)
abstracting: (2<=p9)
states: 2,859,936 (6)
.abstracting: (1<=p18)
states: 8,818,136 (6)
abstracting: (4<=p19)
states: 2,144,952 (6)
abstracting: (p15<=p6)
states: 6,942,264 (6)
abstracting: (2<=p12)
states: 4,528,232 (6)
abstracting: (p14<=p8)
states: 10,932,336 (7)
abstracting: (p1<=2)
states: 12,393,056 (7)
abstracting: (p1<=2)
states: 12,393,056 (7)
abstracting: (4<=p19)
states: 2,144,952 (6)
abstracting: (p15<=p6)
states: 6,942,264 (6)
abstracting: (2<=p12)
states: 4,528,232 (6)
abstracting: (p14<=p8)
states: 10,932,336 (7)
abstracting: (4<=p19)
states: 2,144,952 (6)
abstracting: (p15<=p6)
states: 6,942,264 (6)
abstracting: (2<=p12)
states: 4,528,232 (6)
abstracting: (p14<=p8)
states: 10,932,336 (7)
..........
EG iterations: 10
.abstracting: (p13<=p3)
states: 9,267,884 (6)
abstracting: (p3<=p6)
states: 8,452,956 (6)
abstracting: (p2<=0)
states: 5,958,200 (6)
abstracting: (3<=p0)
states: 5,481,544 (6)
abstracting: (p0<=p18)
states: 7,884,044 (6)
abstracting: (4<=p1)
states: 953,312 (5)
abstracting: (p7<=p16)
states: 9,852,172 (6)
abstracting: (p1<=p0)
states: 10,724,760 (7)
abstracting: (p13<=3)
states: 12,631,384 (7)
.-> the formula is FALSE

FORMULA JoinFreeModules-PT-0004-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.039sec

totally nodes used: 235028 (2.4e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 346907 305580 652487
used/not used/entry size/cache size: 478354 66630510 16 1024MB
basic ops cache: hits/miss/sum: 232446 181561 414007
used/not used/entry size/cache size: 371503 16405713 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: 6930 4820 11750
used/not used/entry size/cache size: 4820 8383788 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 66895304
1 203005
2 7450
3 1208
4 565
5 356
6 334
7 119
8 97
9 106
>= 10 320

Total processing time: 0m 4.493sec


BK_STOP 1679451987857

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -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:217 (6), effective:68 (2)

initing FirstDep: 0m 0.000sec


iterations count:66 (2), effective:10 (0)

iterations count:371 (11), effective:105 (3)

iterations count:310 (9), effective:82 (2)

iterations count:64 (1), effective:12 (0)

iterations count:338 (10), effective:95 (2)

iterations count:51 (1), effective:9 (0)

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

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

iterations count:70 (2), effective:10 (0)

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

iterations count:147 (4), effective:32 (0)

iterations count:112 (3), effective:22 (0)

iterations count:127 (3), effective:29 (0)

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

iterations count:201 (6), effective:50 (1)

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

iterations count:96 (2), effective:18 (0)

iterations count:56 (1), effective:7 (0)

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

iterations count:190 (5), effective:51 (1)

iterations count:96 (2), effective:18 (0)

iterations count:56 (1), effective:7 (0)

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

iterations count:190 (5), effective:51 (1)

iterations count:56 (1), effective:6 (0)

iterations count:96 (2), effective:18 (0)

iterations count:56 (1), effective:7 (0)

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

iterations count:190 (5), effective:51 (1)

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

iterations count:58 (1), effective:8 (0)

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

iterations count:58 (1), effective:8 (0)

iterations count:136 (4), effective:37 (1)

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

iterations count:58 (1), effective:8 (0)

iterations count:149 (4), effective:35 (1)

iterations count:103 (3), effective:23 (0)

iterations count:264 (8), effective:74 (2)

iterations count:61 (1), effective:14 (0)

iterations count:69 (2), effective:12 (0)

iterations count:314 (9), effective:84 (2)

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

iterations count:73 (2), effective:15 (0)

iterations count:126 (3), effective:32 (0)

iterations count:70 (2), effective:9 (0)

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

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

iterations count:87 (2), effective:14 (0)

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="JoinFreeModules-PT-0004"
export BK_EXAMINATION="CTLCardinality"
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 JoinFreeModules-PT-0004, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r234-tall-167856419900145"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-0004.tgz
mv JoinFreeModules-PT-0004 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;