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.r330-tall-167889203600713.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 ResAllocation-PT-R003C050, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-167889203600713
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 816K
-rw-r--r-- 1 mcc users 8.3K Feb 25 15:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 25 15:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 15:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 15:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Feb 25 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Feb 25 15:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 25 15:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 9 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 360K Mar 5 18:23 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 ResAllocation-PT-R003C050-CTLCardinality-00
FORMULA_NAME ResAllocation-PT-R003C050-CTLCardinality-01
FORMULA_NAME ResAllocation-PT-R003C050-CTLCardinality-02
FORMULA_NAME ResAllocation-PT-R003C050-CTLCardinality-03
FORMULA_NAME ResAllocation-PT-R003C050-CTLCardinality-04
FORMULA_NAME ResAllocation-PT-R003C050-CTLCardinality-05
FORMULA_NAME ResAllocation-PT-R003C050-CTLCardinality-06
FORMULA_NAME ResAllocation-PT-R003C050-CTLCardinality-07
FORMULA_NAME ResAllocation-PT-R003C050-CTLCardinality-08
FORMULA_NAME ResAllocation-PT-R003C050-CTLCardinality-09
FORMULA_NAME ResAllocation-PT-R003C050-CTLCardinality-10
FORMULA_NAME ResAllocation-PT-R003C050-CTLCardinality-11
FORMULA_NAME ResAllocation-PT-R003C050-CTLCardinality-12
FORMULA_NAME ResAllocation-PT-R003C050-CTLCardinality-13
FORMULA_NAME ResAllocation-PT-R003C050-CTLCardinality-14
FORMULA_NAME ResAllocation-PT-R003C050-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679181000963

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=ResAllocation-PT-R003C050
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 23:10:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 23:10:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 23:10:02] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2023-03-18 23:10:02] [INFO ] Transformed 300 places.
[2023-03-18 23:10:02] [INFO ] Transformed 200 transitions.
[2023-03-18 23:10:02] [INFO ] Parsed PT model containing 300 places and 200 transitions and 894 arcs in 135 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 10 ms.
Support contains 139 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 200/200 transitions.
Applied a total of 0 rules in 16 ms. Remains 300 /300 variables (removed 0) and now considering 200/200 (removed 0) transitions.
// Phase 1: matrix 200 rows 300 cols
[2023-03-18 23:10:02] [INFO ] Computed 150 place invariants in 15 ms
[2023-03-18 23:10:03] [INFO ] Implicit Places using invariants in 476 ms returned [295, 299]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 502 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 298/300 places, 200/200 transitions.
Applied a total of 0 rules in 9 ms. Remains 298 /298 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 528 ms. Remains : 298/300 places, 200/200 transitions.
Support contains 139 out of 298 places after structural reductions.
[2023-03-18 23:10:03] [INFO ] Flatten gal took : 46 ms
[2023-03-18 23:10:03] [INFO ] Flatten gal took : 25 ms
[2023-03-18 23:10:03] [INFO ] Input system was already deterministic with 200 transitions.
Incomplete random walk after 10000 steps, including 94 resets, run finished after 443 ms. (steps per millisecond=22 ) properties (out of 103) seen :76
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Running SMT prover for 27 properties.
// Phase 1: matrix 200 rows 298 cols
[2023-03-18 23:10:04] [INFO ] Computed 148 place invariants in 2 ms
[2023-03-18 23:10:04] [INFO ] [Real]Absence check using 148 positive place invariants in 26 ms returned sat
[2023-03-18 23:10:04] [INFO ] After 229ms SMT Verify possible using all constraints in real domain returned unsat :9 sat :0 real:18
[2023-03-18 23:10:04] [INFO ] [Nat]Absence check using 148 positive place invariants in 19 ms returned sat
[2023-03-18 23:10:04] [INFO ] After 90ms SMT Verify possible using state equation in natural domain returned unsat :26 sat :1
[2023-03-18 23:10:04] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 6 ms to minimize.
[2023-03-18 23:10:04] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2023-03-18 23:10:04] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2023-03-18 23:10:04] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2023-03-18 23:10:04] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2023-03-18 23:10:04] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 239 ms
[2023-03-18 23:10:04] [INFO ] After 343ms SMT Verify possible using trap constraints in natural domain returned unsat :26 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-18 23:10:04] [INFO ] After 545ms SMT Verify possible using all constraints in natural domain returned unsat :26 sat :1
Fused 27 Parikh solutions to 1 different solutions.
Finished Parikh walk after 117 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=58 )
Parikh walk visited 1 properties in 4 ms.
Successfully simplified 26 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA ResAllocation-PT-R003C050-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C050-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C050-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C050-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C050-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 23:10:04] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-18 23:10:04] [INFO ] Flatten gal took : 17 ms
[2023-03-18 23:10:04] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ResAllocation-PT-R003C050-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C050-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 23:10:04] [INFO ] Flatten gal took : 16 ms
[2023-03-18 23:10:04] [INFO ] Input system was already deterministic with 200 transitions.
Support contains 79 out of 298 places (down from 103) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 298/298 places, 200/200 transitions.
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 0 with 98 rules applied. Total rules applied 98 place count 249 transition count 151
Applied a total of 98 rules in 38 ms. Remains 249 /298 variables (removed 49) and now considering 151/200 (removed 49) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38 ms. Remains : 249/298 places, 151/200 transitions.
[2023-03-18 23:10:04] [INFO ] Flatten gal took : 9 ms
[2023-03-18 23:10:04] [INFO ] Flatten gal took : 10 ms
[2023-03-18 23:10:04] [INFO ] Input system was already deterministic with 151 transitions.
Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 200/200 transitions.
Applied a total of 0 rules in 6 ms. Remains 298 /298 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 298/298 places, 200/200 transitions.
[2023-03-18 23:10:04] [INFO ] Flatten gal took : 13 ms
[2023-03-18 23:10:05] [INFO ] Flatten gal took : 19 ms
[2023-03-18 23:10:05] [INFO ] Input system was already deterministic with 200 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 298/298 places, 200/200 transitions.
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 0 with 88 rules applied. Total rules applied 88 place count 254 transition count 156
Applied a total of 88 rules in 21 ms. Remains 254 /298 variables (removed 44) and now considering 156/200 (removed 44) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 254/298 places, 156/200 transitions.
[2023-03-18 23:10:05] [INFO ] Flatten gal took : 8 ms
[2023-03-18 23:10:05] [INFO ] Flatten gal took : 9 ms
[2023-03-18 23:10:05] [INFO ] Input system was already deterministic with 156 transitions.
Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 200/200 transitions.
Applied a total of 0 rules in 5 ms. Remains 298 /298 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 298/298 places, 200/200 transitions.
[2023-03-18 23:10:05] [INFO ] Flatten gal took : 12 ms
[2023-03-18 23:10:05] [INFO ] Flatten gal took : 12 ms
[2023-03-18 23:10:05] [INFO ] Input system was already deterministic with 200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 200/200 transitions.
Applied a total of 0 rules in 5 ms. Remains 298 /298 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 298/298 places, 200/200 transitions.
[2023-03-18 23:10:05] [INFO ] Flatten gal took : 10 ms
[2023-03-18 23:10:05] [INFO ] Flatten gal took : 11 ms
[2023-03-18 23:10:05] [INFO ] Input system was already deterministic with 200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 200/200 transitions.
Applied a total of 0 rules in 3 ms. Remains 298 /298 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 298/298 places, 200/200 transitions.
[2023-03-18 23:10:05] [INFO ] Flatten gal took : 11 ms
[2023-03-18 23:10:05] [INFO ] Flatten gal took : 16 ms
[2023-03-18 23:10:05] [INFO ] Input system was already deterministic with 200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 200/200 transitions.
Applied a total of 0 rules in 5 ms. Remains 298 /298 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 298/298 places, 200/200 transitions.
[2023-03-18 23:10:05] [INFO ] Flatten gal took : 10 ms
[2023-03-18 23:10:05] [INFO ] Flatten gal took : 10 ms
[2023-03-18 23:10:05] [INFO ] Input system was already deterministic with 200 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 298/298 places, 200/200 transitions.
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 0 with 88 rules applied. Total rules applied 88 place count 254 transition count 156
Applied a total of 88 rules in 24 ms. Remains 254 /298 variables (removed 44) and now considering 156/200 (removed 44) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 254/298 places, 156/200 transitions.
[2023-03-18 23:10:05] [INFO ] Flatten gal took : 7 ms
[2023-03-18 23:10:05] [INFO ] Flatten gal took : 8 ms
[2023-03-18 23:10:05] [INFO ] Input system was already deterministic with 156 transitions.
Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 200/200 transitions.
Applied a total of 0 rules in 3 ms. Remains 298 /298 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 298/298 places, 200/200 transitions.
[2023-03-18 23:10:05] [INFO ] Flatten gal took : 10 ms
[2023-03-18 23:10:05] [INFO ] Flatten gal took : 9 ms
[2023-03-18 23:10:05] [INFO ] Input system was already deterministic with 200 transitions.
[2023-03-18 23:10:05] [INFO ] Flatten gal took : 10 ms
[2023-03-18 23:10:05] [INFO ] Flatten gal took : 9 ms
[2023-03-18 23:10:05] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-03-18 23:10:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 298 places, 200 transitions and 890 arcs took 2 ms.
Total runtime 2992 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: 298 NrTr: 200 NrArc: 890)

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

net check time: 0m 0.000sec

init dd package: 0m 2.686sec


RS generation: 0m 0.052sec


-> reachability set: #nodes 2040 (2.0e+03) #states 48,717,538,008,124,384,423,924,727,808 (28)



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

checking: AF [AG [AF [p280<=p225]]]
normalized: ~ [EG [E [true U EG [~ [p280<=p225]]]]]

abstracting: (p280<=p225)
states: 45,855,242,192,512,137,082,299,219,968 (28)
...........................................................................
EG iterations: 75
.
EG iterations: 1
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C050-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.418sec

checking: [AX [0<=0] & EF [AX [AG [[p295<=p8 | 1<=p121]]]]]
normalized: [E [true U ~ [EX [E [true U ~ [[p295<=p8 | 1<=p121]]]]]] & ~ [EX [~ [0<=0]]]]

abstracting: (0<=0)
states: 48,717,538,008,124,384,423,924,727,808 (28)
.abstracting: (1<=p121)
states: 23,430,730,421,637,462,927,083,569,152 (28)
abstracting: (p295<=p8)
states: 32,853,532,807,526,886,561,418,313,728 (28)
.-> the formula is TRUE

FORMULA ResAllocation-PT-R003C050-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.650sec

checking: EF [EG [[AF [[AF [p226<=p66] | EX [0<=0]]] | ~ [p236<=p259]]]]
normalized: E [true U EG [[~ [EG [~ [[~ [EG [~ [p226<=p66]]] | EX [0<=0]]]]] | ~ [p236<=p259]]]]

abstracting: (p236<=p259)
states: 42,095,961,713,595,353,416,945,631,232 (28)
abstracting: (0<=0)
states: 48,717,538,008,124,384,423,924,727,808 (28)
.abstracting: (p226<=p66)
states: 32,286,881,328,422,225,828,944,805,888 (28)
.........................................................................
EG iterations: 73
.
EG iterations: 1
..........................................................................
EG iterations: 74
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C050-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 8.416sec

checking: [EX [EX [EG [[~ [1<=p232] | ~ [1<=p111]]]]] | A [A [1<=p12 U AG [p31<=0]] U [p73<=0 | ~ [p200<=p178]]]]
normalized: [EX [EX [EG [[~ [1<=p111] | ~ [1<=p232]]]]] | [~ [EG [~ [[p73<=0 | ~ [p200<=p178]]]]] & ~ [E [~ [[p73<=0 | ~ [p200<=p178]]] U [~ [[~ [EG [E [true U ~ [p31<=0]]]] & ~ [E [E [true U ~ [p31<=0]] U [E [true U ~ [p31<=0]] & ~ [1<=p12]]]]]] & ~ [[p73<=0 | ~ [p200<=p178]]]]]]]]

abstracting: (p200<=p178)
states: 41,324,794,549,177,483,530,388,635,648 (28)
abstracting: (p73<=0)
states: 25,288,123,655,664,266,088,615,510,016 (28)
abstracting: (1<=p12)
states: 20,229,394,645,900,285,530,230,226,944 (28)
abstracting: (p31<=0)
states: 25,161,166,811,520,581,189,576,425,472 (28)
abstracting: (p31<=0)
states: 25,161,166,811,520,581,189,576,425,472 (28)
abstracting: (p31<=0)
states: 25,161,166,811,520,581,189,576,425,472 (28)
...........................................................................
EG iterations: 75
abstracting: (p200<=p178)
states: 41,324,794,549,177,483,530,388,635,648 (28)
abstracting: (p73<=0)
states: 25,288,123,655,664,266,088,615,510,016 (28)
abstracting: (p200<=p178)
states: 41,324,794,549,177,483,530,388,635,648 (28)
abstracting: (p73<=0)
states: 25,288,123,655,664,266,088,615,510,016 (28)
................................................................................
EG iterations: 80
abstracting: (1<=p232)
states: 6,377,909,922,095,274,607,140,405,248 (27)
abstracting: (1<=p111)
states: 23,680,878,950,552,651,458,460,778,496 (28)
.
EG iterations: 1
..-> the formula is TRUE

FORMULA ResAllocation-PT-R003C050-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m16.519sec

checking: [EG [[[p53<=0 | AF [EG [~ [p181<=p161]]]] & A [[A [p92<=0 U 1<=p221] | ~ [1<=p142]] U A [[p32<=p216 | 1<=p292] U ~ [p131<=0]]]]] | AG [1<=p36]]
normalized: [~ [E [true U ~ [1<=p36]]] | EG [[[~ [EG [~ [[~ [EG [p131<=0]] & ~ [E [p131<=0 U [p131<=0 & ~ [[p32<=p216 | 1<=p292]]]]]]]]] & ~ [E [~ [[~ [EG [p131<=0]] & ~ [E [p131<=0 U [p131<=0 & ~ [[p32<=p216 | 1<=p292]]]]]]] U [~ [[~ [1<=p142] | [~ [EG [~ [1<=p221]]] & ~ [E [~ [1<=p221] U [~ [p92<=0] & ~ [1<=p221]]]]]]] & ~ [[~ [EG [p131<=0]] & ~ [E [p131<=0 U [p131<=0 & ~ [[p32<=p216 | 1<=p292]]]]]]]]]]] & [p53<=0 | ~ [EG [~ [EG [~ [p181<=p161]]]]]]]]]

abstracting: (p181<=p161)
states: 36,542,561,654,307,142,620,460,089,344 (28)
......................................
before gc: list nodes free: 772643

after gc: idd nodes used:140797, unused:63859203; list nodes free:288761140
........................................
EG iterations: 78
.
EG iterations: 1
abstracting: (p53<=0)
states: 25,307,157,979,480,481,730,599,583,744 (28)
abstracting: (1<=p292)
states: 3,818,370,801,320,606,588,343,418,880 (27)
abstracting: (p32<=p216)
states: 41,270,348,300,635,844,586,107,830,272 (28)
abstracting: (p131<=0)
states: 25,286,792,738,762,421,506,846,752,768 (28)
abstracting: (p131<=0)
states: 25,286,792,738,762,421,506,846,752,768 (28)
abstracting: (p131<=0)
states: 25,286,792,738,762,421,506,846,752,768 (28)
...........................................................................
EG iterations: 75
abstracting: (1<=p221)
states: 23,429,414,352,460,118,335,309,217,792 (28)
abstracting: (p92<=0)
states: 36,199,961,117,825,197,001,525,952,512 (28)
abstracting: (1<=p221)
states: 23,429,414,352,460,118,335,309,217,792 (28)
abstracting: (1<=p221)
states: 23,429,414,352,460,118,335,309,217,792 (28)
............................................................................
EG iterations: 76
abstracting: (1<=p142)
states: 18,902,547,651,157,204,466,231,410,688 (28)
abstracting: (1<=p292)
states: 3,818,370,801,320,606,588,343,418,880 (27)
abstracting: (p32<=p216)
states: 41,270,348,300,635,844,586,107,830,272 (28)
abstracting: (p131<=0)
states: 25,286,792,738,762,421,506,846,752,768 (28)
abstracting: (p131<=0)
states: 25,286,792,738,762,421,506,846,752,768 (28)
abstracting: (p131<=0)
states: 25,286,792,738,762,421,506,846,752,768 (28)
...........................................................................
EG iterations: 75
abstracting: (1<=p292)
states: 3,818,370,801,320,606,588,343,418,880 (27)
abstracting: (p32<=p216)
states: 41,270,348,300,635,844,586,107,830,272 (28)
abstracting: (p131<=0)
states: 25,286,792,738,762,421,506,846,752,768 (28)
abstracting: (p131<=0)
states: 25,286,792,738,762,421,506,846,752,768 (28)
abstracting: (p131<=0)
states: 25,286,792,738,762,421,506,846,752,768 (28)
...........................................................................
EG iterations: 75
........................................................................
EG iterations: 72
............................
before gc: list nodes free: 583671

after gc: idd nodes used:644204, unused:63355796; list nodes free:286453021
...................................................
EG iterations: 79
abstracting: (1<=p36)
states: 19,029,262,263,322,728,965,368,446,976 (28)
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C050-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m 4.367sec

checking: AF [[EX [[[p169<=p131 & [p53<=0 | p169<=p275]] | [~ [1<=p270] | ~ [1<=p124]]]] & [p201<=0 & [AF [EG [p44<=0]] | A [[[p242<=1 & 1<=p22] | ~ [p169<=p233]] U ~ [[p126<=1 & p124<=0]]]]]]]
normalized: ~ [EG [~ [[[p201<=0 & [[~ [EG [[p126<=1 & p124<=0]]] & ~ [E [[p126<=1 & p124<=0] U [~ [[~ [p169<=p233] | [p242<=1 & 1<=p22]]] & [p126<=1 & p124<=0]]]]] | ~ [EG [~ [EG [p44<=0]]]]]] & EX [[[~ [1<=p124] | ~ [1<=p270]] | [p169<=p131 & [p53<=0 | p169<=p275]]]]]]]]

abstracting: (p169<=p275)
states: 36,753,976,432,513,429,610,050,879,488 (28)
abstracting: (p53<=0)
states: 25,307,157,979,480,481,730,599,583,744 (28)
abstracting: (p169<=p131)
states: 36,566,752,174,411,740,148,012,154,880 (28)
abstracting: (1<=p270)
states: 6,883,331,793,171,245,379,245,572,096 (27)
abstracting: (1<=p124)
states: 6,384,271,711,212,458,170,090,782,720 (27)
.abstracting: (p44<=0)
states: 36,301,000,963,694,155,347,687,112,704 (28)
.........................................................................
EG iterations: 73
.
EG iterations: 1
abstracting: (p124<=0)
states: 42,333,266,296,911,926,253,833,945,088 (28)
abstracting: (p126<=1)
states: 48,717,538,008,124,384,423,924,727,808 (28)
abstracting: (1<=p22)
states: 17,996,558,192,222,903,448,587,206,656 (28)
abstracting: (p242<=1)
states: 48,717,538,008,124,384,423,924,727,808 (28)
abstracting: (p169<=p233)
states: 36,551,222,626,480,568,591,452,209,152 (28)
abstracting: (p124<=0)
states: 42,333,266,296,911,926,253,833,945,088 (28)
abstracting: (p126<=1)
states: 48,717,538,008,124,384,423,924,727,808 (28)
abstracting: (p124<=0)
states: 42,333,266,296,911,926,253,833,945,088 (28)
abstracting: (p126<=1)
states: 48,717,538,008,124,384,423,924,727,808 (28)
.
EG iterations: 1
abstracting: (p201<=0)
states: 25,036,271,809,538,719,998,728,470,528 (28)
..........................................................................
EG iterations: 74
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C050-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m16.476sec

checking: AG [[EF [[[E [p88<=0 U p72<=p9] | EF [p66<=p280]] | [[~ [p108<=p168] & ~ [p274<=1]] | p159<=p65]]] & AG [A [EF [p15<=p69] U [AF [p54<=p269] | [1<=p260 | 1<=p104]]]]]]
normalized: ~ [E [true U ~ [[~ [E [true U ~ [[~ [EG [~ [[[1<=p260 | 1<=p104] | ~ [EG [~ [p54<=p269]]]]]]] & ~ [E [~ [[[1<=p260 | 1<=p104] | ~ [EG [~ [p54<=p269]]]]] U [~ [E [true U p15<=p69]] & ~ [[[1<=p260 | 1<=p104] | ~ [EG [~ [p54<=p269]]]]]]]]]]]] & E [true U [[p159<=p65 | [~ [p274<=1] & ~ [p108<=p168]]] | [E [true U p66<=p280] | E [p88<=0 U p72<=p9]]]]]]]]

abstracting: (p72<=p9)
states: 39,744,935,754,621,683,105,615,839,232 (28)
abstracting: (p88<=0)
states: 42,332,295,924,722,554,534,851,772,416 (28)
abstracting: (p66<=p280)
states: 43,066,274,266,310,154,918,538,772,480 (28)
abstracting: (p108<=p168)
states: 37,153,786,104,569,221,326,005,338,112 (28)
abstracting: (p274<=1)
states: 48,717,538,008,124,384,423,924,727,808 (28)
abstracting: (p159<=p65)
states: 36,423,048,167,992,530,702,929,231,872 (28)
abstracting: (p54<=p269)
states: 45,392,953,942,067,109,752,997,937,152 (28)
...............
before gc: list nodes free: 424378

after gc: idd nodes used:111213, unused:63888787; list nodes free:288898955
..............................................................
EG iterations: 77
abstracting: (1<=p104)
states: 12,518,092,120,215,958,063,304,146,944 (28)
abstracting: (1<=p260)
states: 12,706,370,574,551,152,760,734,089,216 (28)
abstracting: (p15<=p69)
states: 37,044,847,570,936,676,144,054,796,288 (28)
abstracting: (p54<=p269)
states: 45,392,953,942,067,109,752,997,937,152 (28)
.............................................................................
EG iterations: 77
abstracting: (1<=p104)
states: 12,518,092,120,215,958,063,304,146,944 (28)
abstracting: (1<=p260)
states: 12,706,370,574,551,152,760,734,089,216 (28)
abstracting: (p54<=p269)
states: 45,392,953,942,067,109,752,997,937,152 (28)
.............................................................................
EG iterations: 77
abstracting: (1<=p104)
states: 12,518,092,120,215,958,063,304,146,944 (28)
abstracting: (1<=p260)
states: 12,706,370,574,551,152,760,734,089,216 (28)
............................................................................
EG iterations: 76
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C050-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m31.796sec

checking: [EG [[1<=p23 | p22<=0]] | E [E [E [EG [p61<=p79] U [[p23<=0 | p272<=0] & ~ [p259<=p288]]] U 1<=p247] U [~ [[EF [p280<=p211] | [EF [p123<=p239] & [[~ [1<=p81] | p73<=p169] & 1<=p297]]]] & ~ [AF [AX [p146<=p96]]]]]]
normalized: [E [E [E [EG [p61<=p79] U [~ [p259<=p288] & [p23<=0 | p272<=0]]] U 1<=p247] U [EG [EX [~ [p146<=p96]]] & ~ [[[[1<=p297 & [p73<=p169 | ~ [1<=p81]]] & E [true U p123<=p239]] | E [true U p280<=p211]]]]] | EG [[1<=p23 | p22<=0]]]

abstracting: (p22<=0)
states: 30,720,979,815,901,480,975,337,521,152 (28)
abstracting: (1<=p23)
states: 23,837,648,022,730,235,596,091,949,056 (28)
..............................................................................
EG iterations: 78
abstracting: (p280<=p211)
states: 45,834,801,481,216,838,337,233,420,288 (28)
abstracting: (p123<=p239)
states: 36,431,272,207,080,420,210,726,928,384 (28)
abstracting: (1<=p81)
states: 23,682,082,968,374,647,969,948,893,184 (28)
abstracting: (p73<=p169)
states: 36,556,466,913,168,281,210,145,734,656 (28)
abstracting: (1<=p297)
states: 22,449,583,603,401,888,917,790,654,464 (28)
abstracting: (p146<=p96)
states: 41,079,391,052,664,864,988,150,628,352 (28)
.............
before gc: list nodes free: 783387

after gc: idd nodes used:125132, unused:63874868; list nodes free:288835661
..............................................................
EG iterations: 74
abstracting: (1<=p247)
states: 23,460,494,110,927,206,045,343,285,248 (28)
abstracting: (p272<=0)
states: 35,556,538,238,795,240,103,374,487,552 (28)
abstracting: (p23<=0)
states: 24,879,889,985,394,148,827,832,778,752 (28)
abstracting: (p259<=p288)
states: 32,416,222,235,100,846,242,958,147,584 (28)
abstracting: (p61<=p79)
states: 36,842,719,025,596,724,280,127,651,840 (28)
..........................................................................
EG iterations: 74
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C050-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m27.699sec

checking: EG [[[AX [~ [1<=p240]] & [~ [p162<=p260] & [p44<=p274 | p95<=1]]] | [E [[E [p1<=0 U p79<=p69] & [A [1<=p204 U p46<=p252] | p290<=p197]] U EG [p0<=p284]] & AX [EF [[p266<=p195 | p273<=p99]]]]]]
normalized: EG [[[~ [EX [~ [E [true U [p266<=p195 | p273<=p99]]]]] & E [[[p290<=p197 | [~ [EG [~ [p46<=p252]]] & ~ [E [~ [p46<=p252] U [~ [1<=p204] & ~ [p46<=p252]]]]]] & E [p1<=0 U p79<=p69]] U EG [p0<=p284]]] | [[[p44<=p274 | p95<=1] & ~ [p162<=p260]] & ~ [EX [1<=p240]]]]]

abstracting: (1<=p240)
states: 18,882,229,919,897,076,525,938,245,632 (28)
.abstracting: (p162<=p260)
states: 43,998,584,510,117,139,598,198,964,224 (28)
abstracting: (p95<=1)
states: 48,717,538,008,124,384,423,924,727,808 (28)
abstracting: (p44<=p274)
states: 41,226,172,953,629,586,598,639,173,632 (28)
abstracting: (p0<=p284)
states: 33,030,326,644,264,884,628,877,213,696 (28)
............................................................................
EG iterations: 76
abstracting: (p79<=p69)
states: 36,308,831,512,284,778,258,516,410,368 (28)
abstracting: (p1<=0)
states: 26,267,954,404,722,495,506,134,073,344 (28)
abstracting: (p46<=p252)
states: 37,165,112,429,452,707,092,745,945,088 (28)
abstracting: (1<=p204)
states: 18,902,053,313,150,653,501,240,508,416 (28)
abstracting: (p46<=p252)
states: 37,165,112,429,452,707,092,745,945,088 (28)
abstracting: (p46<=p252)
states: 37,165,112,429,452,707,092,745,945,088 (28)
.................................................................................
EG iterations: 81
abstracting: (p290<=p197)
states: 44,339,010,222,583,055,314,111,692,800 (28)
abstracting: (p273<=p99)
states: 36,258,771,311,462,585,566,872,207,360 (28)
abstracting: (p266<=p195)
states: 42,466,597,738,085,895,644,272,132,096 (28)
.........
before gc: list nodes free: 602378

after gc: idd nodes used:261019, unused:63738981; list nodes free:288224576
......................................
before gc: list nodes free: 395144

after gc: idd nodes used:1045047, unused:62954953; list nodes free:284605939
..........................
EG iterations: 72
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C050-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m36.475sec

totally nodes used: 416466104 (4.2e+08)
number of garbage collections: 6
fire ops cache: hits/miss/sum: 132639751 454571041 587210792
used/not used/entry size/cache size: 43416928 23691936 16 1024MB
basic ops cache: hits/miss/sum: 14941312 46755027 61696339
used/not used/entry size/cache size: 7007944 9769272 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: 14461 84628 99089
used/not used/entry size/cache size: 0 8388608 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 41118775
1 18991484
2 5500540
3 1235397
4 223990
5 33841
6 4315
7 474
8 44
9 4
>= 10 0

Total processing time: 4m35.060sec


BK_STOP 1679181281519

--------------------
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 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:1524 (7), effective:300 (1)

initing FirstDep: 0m 0.000sec


iterations count:485 (2), effective:43 (0)

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

iterations count:2115 (10), effective:337 (1)

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

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

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

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

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

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

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

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

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

iterations count:400 (2), effective:31 (0)

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

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

iterations count:230 (1), effective:5 (0)

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

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

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

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

iterations count:409 (2), effective:35 (0)

iterations count:525 (2), effective:48 (0)

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

iterations count:235 (1), effective:5 (0)

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

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

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

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

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

iterations count:264 (1), effective:11 (0)

iterations count:305 (1), effective:15 (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="ResAllocation-PT-R003C050"
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 ResAllocation-PT-R003C050, 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 r330-tall-167889203600713"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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