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.r490-tall-167912708500297.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 Sudoku-PT-BN04, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r490-tall-167912708500297
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.3M
-rw-r--r-- 1 mcc users 40K Feb 26 09:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 230K Feb 26 09:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 104K Feb 26 09:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 488K Feb 26 09:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 18K Feb 25 17:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 17:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 31K Feb 25 17:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 110K Feb 25 17:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 88K Feb 26 09:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 496K Feb 26 09:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 268K Feb 26 09:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.3M Feb 26 09:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 17:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 11K Feb 25 17:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 53K 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 Sudoku-PT-BN04-CTLCardinality-00
FORMULA_NAME Sudoku-PT-BN04-CTLCardinality-01
FORMULA_NAME Sudoku-PT-BN04-CTLCardinality-02
FORMULA_NAME Sudoku-PT-BN04-CTLCardinality-03
FORMULA_NAME Sudoku-PT-BN04-CTLCardinality-04
FORMULA_NAME Sudoku-PT-BN04-CTLCardinality-05
FORMULA_NAME Sudoku-PT-BN04-CTLCardinality-06
FORMULA_NAME Sudoku-PT-BN04-CTLCardinality-07
FORMULA_NAME Sudoku-PT-BN04-CTLCardinality-08
FORMULA_NAME Sudoku-PT-BN04-CTLCardinality-09
FORMULA_NAME Sudoku-PT-BN04-CTLCardinality-10
FORMULA_NAME Sudoku-PT-BN04-CTLCardinality-11
FORMULA_NAME Sudoku-PT-BN04-CTLCardinality-12
FORMULA_NAME Sudoku-PT-BN04-CTLCardinality-13
FORMULA_NAME Sudoku-PT-BN04-CTLCardinality-14
FORMULA_NAME Sudoku-PT-BN04-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679233803838

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=Sudoku-PT-BN04
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-19 13:50:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 13:50:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 13:50:05] [INFO ] Load time of PNML (sax parser for PT used): 39 ms
[2023-03-19 13:50:05] [INFO ] Transformed 128 places.
[2023-03-19 13:50:05] [INFO ] Transformed 64 transitions.
[2023-03-19 13:50:05] [INFO ] Parsed PT model containing 128 places and 64 transitions and 320 arcs in 97 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 21 ms.
Support contains 128 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 6 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 128 cols
[2023-03-19 13:50:05] [INFO ] Computed 64 place invariants in 19 ms
[2023-03-19 13:50:05] [INFO ] Implicit Places using invariants in 204 ms returned []
[2023-03-19 13:50:05] [INFO ] Invariant cache hit.
[2023-03-19 13:50:05] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
[2023-03-19 13:50:05] [INFO ] Invariant cache hit.
[2023-03-19 13:50:05] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 431 ms. Remains : 128/128 places, 64/64 transitions.
Support contains 128 out of 128 places after structural reductions.
[2023-03-19 13:50:06] [INFO ] Flatten gal took : 30 ms
[2023-03-19 13:50:06] [INFO ] Flatten gal took : 13 ms
[2023-03-19 13:50:06] [INFO ] Input system was already deterministic with 64 transitions.
Incomplete random walk after 10000 steps, including 719 resets, run finished after 845 ms. (steps per millisecond=11 ) properties (out of 94) seen :53
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 41) seen :0
Running SMT prover for 41 properties.
[2023-03-19 13:50:07] [INFO ] Invariant cache hit.
[2023-03-19 13:50:07] [INFO ] [Real]Absence check using 64 positive place invariants in 14 ms returned sat
[2023-03-19 13:50:07] [INFO ] After 374ms SMT Verify possible using all constraints in real domain returned unsat :39 sat :0 real:2
[2023-03-19 13:50:07] [INFO ] [Nat]Absence check using 64 positive place invariants in 13 ms returned sat
[2023-03-19 13:50:07] [INFO ] After 58ms SMT Verify possible using all constraints in natural domain returned unsat :41 sat :0
Fused 41 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 41 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 2 formulas.
FORMULA Sudoku-PT-BN04-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN04-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN04-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-19 13:50:07] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2023-03-19 13:50:07] [INFO ] Flatten gal took : 16 ms
FORMULA Sudoku-PT-BN04-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN04-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN04-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-19 13:50:07] [INFO ] Flatten gal took : 8 ms
[2023-03-19 13:50:08] [INFO ] Input system was already deterministic with 64 transitions.
Computed a total of 128 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 128 transition count 64
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 1 formulas.
Starting structural reductions in SI_CTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Graph (complete) has 256 edges and 128 vertex of which 64 are kept as prefixes of interest. Removing 64 places using SCC suffix rule.2 ms
Discarding 64 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 64 /128 variables (removed 64) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 64/128 places, 64/64 transitions.
[2023-03-19 13:50:08] [INFO ] Flatten gal took : 5 ms
[2023-03-19 13:50:08] [INFO ] Flatten gal took : 6 ms
[2023-03-19 13:50:08] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 128/128 places, 64/64 transitions.
[2023-03-19 13:50:08] [INFO ] Flatten gal took : 6 ms
[2023-03-19 13:50:08] [INFO ] Flatten gal took : 7 ms
[2023-03-19 13:50:08] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 64 transition count 64
Applied a total of 64 rules in 4 ms. Remains 64 /128 variables (removed 64) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 64/128 places, 64/64 transitions.
[2023-03-19 13:50:08] [INFO ] Flatten gal took : 5 ms
[2023-03-19 13:50:08] [INFO ] Flatten gal took : 5 ms
[2023-03-19 13:50:08] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 76 transition count 64
Applied a total of 52 rules in 3 ms. Remains 76 /128 variables (removed 52) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 76/128 places, 64/64 transitions.
[2023-03-19 13:50:08] [INFO ] Flatten gal took : 4 ms
[2023-03-19 13:50:08] [INFO ] Flatten gal took : 5 ms
[2023-03-19 13:50:08] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 69 transition count 64
Applied a total of 59 rules in 3 ms. Remains 69 /128 variables (removed 59) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 69/128 places, 64/64 transitions.
[2023-03-19 13:50:08] [INFO ] Flatten gal took : 4 ms
[2023-03-19 13:50:08] [INFO ] Flatten gal took : 4 ms
[2023-03-19 13:50:08] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 0 with 57 rules applied. Total rules applied 57 place count 71 transition count 64
Applied a total of 57 rules in 3 ms. Remains 71 /128 variables (removed 57) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 71/128 places, 64/64 transitions.
[2023-03-19 13:50:08] [INFO ] Flatten gal took : 5 ms
[2023-03-19 13:50:08] [INFO ] Flatten gal took : 5 ms
[2023-03-19 13:50:08] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 73 transition count 64
Applied a total of 55 rules in 5 ms. Remains 73 /128 variables (removed 55) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 73/128 places, 64/64 transitions.
[2023-03-19 13:50:08] [INFO ] Flatten gal took : 4 ms
[2023-03-19 13:50:08] [INFO ] Flatten gal took : 4 ms
[2023-03-19 13:50:08] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 67 transition count 64
Applied a total of 61 rules in 3 ms. Remains 67 /128 variables (removed 61) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 67/128 places, 64/64 transitions.
[2023-03-19 13:50:08] [INFO ] Flatten gal took : 4 ms
[2023-03-19 13:50:08] [INFO ] Flatten gal took : 5 ms
[2023-03-19 13:50:08] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Graph (complete) has 256 edges and 128 vertex of which 65 are kept as prefixes of interest. Removing 63 places using SCC suffix rule.0 ms
Discarding 63 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 65 /128 variables (removed 63) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 65/128 places, 64/64 transitions.
[2023-03-19 13:50:08] [INFO ] Flatten gal took : 5 ms
[2023-03-19 13:50:08] [INFO ] Flatten gal took : 4 ms
[2023-03-19 13:50:08] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Graph (complete) has 256 edges and 128 vertex of which 64 are kept as prefixes of interest. Removing 64 places using SCC suffix rule.1 ms
Discarding 64 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 64 /128 variables (removed 64) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 64/128 places, 64/64 transitions.
[2023-03-19 13:50:08] [INFO ] Flatten gal took : 4 ms
[2023-03-19 13:50:08] [INFO ] Flatten gal took : 4 ms
[2023-03-19 13:50:08] [INFO ] Input system was already deterministic with 64 transitions.
[2023-03-19 13:50:08] [INFO ] Flatten gal took : 5 ms
[2023-03-19 13:50:08] [INFO ] Flatten gal took : 6 ms
[2023-03-19 13:50:08] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-19 13:50:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 128 places, 64 transitions and 320 arcs took 1 ms.
Total runtime 3058 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: 128 NrTr: 64 NrArc: 320)

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

net check time: 0m 0.000sec

init dd package: 0m 2.765sec


RS generation: 0m 6.386sec


-> reachability set: #nodes 710410 (7.1e+05) #states 61,556,225 (7)



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

checking: EX [AX [1<=0]]
normalized: EX [~ [EX [~ [1<=0]]]]

abstracting: (1<=0)
states: 0
..-> the formula is FALSE

FORMULA Sudoku-PT-BN04-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m29.324sec

checking: AF [AG [[AF [p50<=0] | [1<=p35 | 1<=p7]]]]
normalized: ~ [EG [E [true U ~ [[~ [EG [~ [p50<=0]]] | [1<=p35 | 1<=p7]]]]]]

abstracting: (1<=p7)
states: 28,662,649 (7)
abstracting: (1<=p35)
states: 8,223,394 (6)
abstracting: (p50<=0)
states: 53,332,831 (7)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA Sudoku-PT-BN04-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m13.940sec

checking: A [~ [p29<=p100] U EF [~ [[EF [1<=p7] | 1<=p98]]]]
normalized: [~ [EG [~ [E [true U ~ [[1<=p98 | E [true U 1<=p7]]]]]]] & ~ [E [~ [E [true U ~ [[1<=p98 | E [true U 1<=p7]]]]] U [p29<=p100 & ~ [E [true U ~ [[1<=p98 | E [true U 1<=p7]]]]]]]]]

abstracting: (1<=p7)
states: 28,662,649 (7)
abstracting: (1<=p98)
states: 28,662,649 (7)
abstracting: (p29<=p100)
states: 56,994,169 (7)
abstracting: (1<=p7)
states: 28,662,649 (7)
abstracting: (1<=p98)
states: 28,662,649 (7)
abstracting: (1<=p7)
states: 28,662,649 (7)
abstracting: (1<=p98)
states: 28,662,649 (7)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Sudoku-PT-BN04-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m16.859sec

checking: AG [[EF [~ [p77<=p94]] | [EX [[EG [~ [p76<=0]] | [~ [p29<=1] | ~ [1<=p95]]]] | EF [~ [1<=p106]]]]]
normalized: ~ [E [true U ~ [[[E [true U ~ [1<=p106]] | EX [[[~ [1<=p95] | ~ [p29<=1]] | EG [~ [p76<=0]]]]] | E [true U ~ [p77<=p94]]]]]]

abstracting: (p77<=p94)
states: 57,491,460 (7)
abstracting: (p76<=0)
states: 53,332,831 (7)
.
EG iterations: 1
abstracting: (p29<=1)
states: 61,556,225 (7)
abstracting: (1<=p95)
states: 28,662,649 (7)
.abstracting: (1<=p106)
states: 28,662,649 (7)
-> the formula is FALSE

FORMULA Sudoku-PT-BN04-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m29.444sec

checking: AX [[EX [AX [p61<=p113]] | A [~ [[AG [p53<=p104] | AG [p67<=p46]]] U [p9<=p58 & p48<=p19]]]]
normalized: ~ [EX [~ [[[~ [EG [~ [[p9<=p58 & p48<=p19]]]] & ~ [E [~ [[p9<=p58 & p48<=p19]] U [[~ [E [true U ~ [p67<=p46]]] | ~ [E [true U ~ [p53<=p104]]]] & ~ [[p9<=p58 & p48<=p19]]]]]] | EX [~ [EX [~ [p61<=p113]]]]]]]]

abstracting: (p61<=p113)
states: 57,376,253 (7)

before gc: list nodes free: 2058473

after gc: idd nodes used:3818998, unused:60181002; list nodes free:266413111
..abstracting: (p48<=p19)
states: 54,695,794 (7)
abstracting: (p9<=p58)
states: 37,050,055 (7)
abstracting: (p53<=p104)
states: 57,533,258 (7)
abstracting: (p67<=p46)
states: 54,419,697 (7)
abstracting: (p48<=p19)
states: 54,695,794 (7)
abstracting: (p9<=p58)
states: 37,050,055 (7)
abstracting: (p48<=p19)
states: 54,695,794 (7)
abstracting: (p9<=p58)
states: 37,050,055 (7)
....
before gc: list nodes free: 2058188

after gc: idd nodes used:11194435, unused:52805565; list nodes free:234208105
...
before gc: list nodes free: 374719

after gc: idd nodes used:10023719, unused:53976281; list nodes free:239260826
.......
EG iterations: 14
.-> the formula is TRUE

FORMULA Sudoku-PT-BN04-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 7m45.965sec

checking: AX [AX [[A [AF [1<=p14] U [p41<=0 | EF [p117<=p98]]] & [E [[p84<=0 & p84<=p62] U 1<=p87] | [1<=p4 | [[p44<=1 | p23<=p127] & [1<=p7 | p16<=0]]]]]]]
normalized: ~ [EX [EX [~ [[[[1<=p4 | [[1<=p7 | p16<=0] & [p44<=1 | p23<=p127]]] | E [[p84<=0 & p84<=p62] U 1<=p87]] & [~ [EG [~ [[p41<=0 | E [true U p117<=p98]]]]] & ~ [E [~ [[p41<=0 | E [true U p117<=p98]]] U [EG [~ [1<=p14]] & ~ [[p41<=0 | E [true U p117<=p98]]]]]]]]]]]]

abstracting: (p117<=p98)
states: 46,128,256 (7)
abstracting: (p41<=0)
states: 53,332,831 (7)
abstracting: (1<=p14)
states: 28,662,649 (7)

before gc: list nodes free: 566561

after gc: idd nodes used:4785954, unused:59214046; list nodes free:262200638
.
EG iterations: 1
abstracting: (p117<=p98)
states: 46,128,256 (7)
abstracting: (p41<=0)
states: 53,332,831 (7)
abstracting: (p117<=p98)
states: 46,128,256 (7)
abstracting: (p41<=0)
states: 53,332,831 (7)
.
EG iterations: 1
abstracting: (1<=p87)
states: 28,662,649 (7)
abstracting: (p84<=p62)
states: 36,607,344 (7)
abstracting: (p84<=0)
states: 32,893,576 (7)
abstracting: (p23<=p127)
states: 57,376,253 (7)
abstracting: (p44<=1)
states: 61,556,225 (7)
abstracting: (p16<=0)
states: 53,332,831 (7)
abstracting: (1<=p7)
states: 28,662,649 (7)
abstracting: (1<=p4)
states: 28,662,649 (7)
..-> the formula is TRUE

FORMULA Sudoku-PT-BN04-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m 1.788sec

checking: AF [EG [13<=sum(p111, p110, p109, p108, p107, p106, p105, p104, p103, p102, p101, p100, p99, p98, p97, p96)]]
normalized: ~ [EG [~ [EG [13<=sum(p111, p110, p109, p108, p107, p106, p105, p104, p103, p102, p101, p100, p99, p98, p97, p96)]]]]

abstracting: (13<=sum(p111, p110, p109, p108, p107, p106, p105, p104, p103, p102, p101, p100, p99, p98, p97, p96))
states: 26,209 (4)
.....
EG iterations: 5

EG iterations: 0
-> the formula is FALSE

FORMULA Sudoku-PT-BN04-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.817sec

checking: [~ [A [AF [~ [[1<=p109 | p71<=p4]]] U A [p45<=p73 U 1<=p43]]] & [EX [[~ [1<=p17] & [~ [p113<=p110] & ~ [p60<=p2]]]] | [AF [p56<=p122] | [EX [~ [p67<=p87]] & ~ [A [p100<=0 U p112<=p30]]]]]]
normalized: [[[[~ [[~ [EG [~ [p112<=p30]]] & ~ [E [~ [p112<=p30] U [~ [p100<=0] & ~ [p112<=p30]]]]]] & EX [~ [p67<=p87]]] | ~ [EG [~ [p56<=p122]]]] | EX [[[~ [p60<=p2] & ~ [p113<=p110]] & ~ [1<=p17]]]] & ~ [[~ [EG [~ [[~ [EG [~ [1<=p43]]] & ~ [E [~ [1<=p43] U [~ [p45<=p73] & ~ [1<=p43]]]]]]]] & ~ [E [~ [[~ [EG [~ [1<=p43]]] & ~ [E [~ [1<=p43] U [~ [p45<=p73] & ~ [1<=p43]]]]]] U [EG [[1<=p109 | p71<=p4]] & ~ [[~ [EG [~ [1<=p43]]] & ~ [E [~ [1<=p43] U [~ [p45<=p73] & ~ [1<=p43]]]]]]]]]]]]

abstracting: (1<=p43)
states: 8,223,394 (6)
abstracting: (p45<=p73)
states: 55,219,337 (7)
abstracting: (1<=p43)
states: 8,223,394 (6)
abstracting: (1<=p43)
states: 8,223,394 (6)
......
before gc: list nodes free: 1869610

after gc: idd nodes used:8250030, unused:55749970; list nodes free:246956915
......
EG iterations: 12
abstracting: (p71<=p4)
states: 57,127,680 (7)
abstracting: (1<=p109)
states: 28,662,649 (7)
.....
before gc: list nodes free: 1353888

after gc: idd nodes used:9999573, unused:54000427; list nodes free:239355910
........
EG iterations: 13
abstracting: (1<=p43)
states: 8,223,394 (6)
abstracting: (p45<=p73)
states: 55,219,337 (7)
abstracting: (1<=p43)
states: 8,223,394 (6)
abstracting: (1<=p43)
states: 8,223,394 (6)
....
before gc: list nodes free: 787896

after gc: idd nodes used:9300803, unused:54699197; list nodes free:242337470
........
EG iterations: 12
abstracting: (1<=p43)
states: 8,223,394 (6)
abstracting: (p45<=p73)
states: 55,219,337 (7)
abstracting: (1<=p43)
states: 8,223,394 (6)
abstracting: (1<=p43)
states: 8,223,394 (6)
............
EG iterations: 12
............
EG iterations: 12
abstracting: (1<=p17)
states: 8,223,394 (6)
abstracting: (p113<=p110)
states: 46,128,256 (7)
abstracting: (p60<=p2)
states: 57,127,680 (7)
.abstracting: (p56<=p122)
states: 57,489,310 (7)

before gc: list nodes free: 1370533

after gc: idd nodes used:8471958, unused:55528042; list nodes free:246070663
.
EG iterations: 1
abstracting: (p67<=p87)
states: 56,969,293 (7)
.abstracting: (p112<=p30)
states: 36,688,425 (7)
abstracting: (p100<=0)
states: 32,893,576 (7)
abstracting: (p112<=p30)
states: 36,688,425 (7)
abstracting: (p112<=p30)
states: 36,688,425 (7)
.....
before gc: list nodes free: 1805457

after gc: idd nodes used:14302353, unused:49697647; list nodes free:220484622
........
EG iterations: 13
-> the formula is TRUE

FORMULA Sudoku-PT-BN04-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 15m21.107sec

checking: [A [[[~ [AG [p27<=p66]] | E [~ [1<=p60] U AX [1<=p4]]] | [~ [p74<=p67] | [p51<=0 & ~ [[p49<=0 & [AG [p86<=p126] & EG [1<=p37]]]]]]] U E [~ [EG [AX [1<=p110]]] U AG [AX [1<=p30]]]] | EX [~ [A [[EG [1<=p96] | p96<=0] U [~ [[1<=p50 & p18<=p31]] | ~ [EF [1<=p122]]]]]]]
normalized: [EX [~ [[~ [EG [~ [[~ [E [true U 1<=p122]] | ~ [[1<=p50 & p18<=p31]]]]]] & ~ [E [~ [[~ [E [true U 1<=p122]] | ~ [[1<=p50 & p18<=p31]]]] U [~ [[p96<=0 | EG [1<=p96]]] & ~ [[~ [E [true U 1<=p122]] | ~ [[1<=p50 & p18<=p31]]]]]]]]]] | [~ [EG [~ [E [~ [EG [~ [EX [~ [1<=p110]]]]] U ~ [E [true U EX [~ [1<=p30]]]]]]]] & ~ [E [~ [E [~ [EG [~ [EX [~ [1<=p110]]]]] U ~ [E [true U EX [~ [1<=p30]]]]]] U [~ [[[[p51<=0 & ~ [[p49<=0 & [EG [1<=p37] & ~ [E [true U ~ [p86<=p126]]]]]]] | ~ [p74<=p67]] | [E [~ [1<=p60] U ~ [EX [~ [1<=p4]]]] | E [true U ~ [p27<=p66]]]]] & ~ [E [~ [EG [~ [EX [~ [1<=p110]]]]] U ~ [E [true U EX [~ [1<=p30]]]]]]]]]]]

abstracting: (1<=p30)
states: 8,223,394 (6)

before gc: list nodes free: 545336

after gc: idd nodes used:10366860, unused:53633140; list nodes free:237747154
.abstracting: (1<=p110)
states: 28,662,649 (7)
..
EG iterations: 1

before gc: list nodes free: 2393589

after gc: idd nodes used:12079194, unused:51920806; list nodes free:230288685
abstracting: (p27<=p66)
states: 54,419,697 (7)
abstracting: (1<=p4)
states: 28,662,649 (7)
.abstracting: (1<=p60)
states: 8,223,394 (6)
abstracting: (p74<=p67)
states: 54,695,794 (7)
abstracting: (p86<=p126)
states: 52,655,461 (7)
abstracting: (1<=p37)
states: 8,223,394 (6)
.
EG iterations: 1
abstracting: (p49<=0)
states: 53,332,831 (7)
abstracting: (p51<=0)
states: 53,332,831 (7)
abstracting: (1<=p30)
states: 8,223,394 (6)

before gc: list nodes free: 1861924

after gc: idd nodes used:9824316, unused:54175684; list nodes free:240167480
.MC time: 15m36.422sec

checking: EF [EX [EG [[3<=sum(p95, p94, p93, p92, p91, p90, p89, p88, p87, p86, p85, p84, p83, p82, p81, p80) | 68<=sum(p79, p78, p77, p76, p75, p74, p73, p72, p71, p70, p69, p68, p67, p66, p65, p64, p63, p62, p61, p60, p59, p58, p57, p56, p55, p54, p53, p52, p51, p50, p49, p48, p47, p46, p45, p44, p43, p42, p41, p40, p39, p38, p37, p36, p35, p34, p33, p32, p31, p30, p29, p28, p27, p26, p25, p24, p23, p22, p21, p20, p19, p18, p17, p16)]]]]
normalized: E [true U EX [EG [[3<=sum(p95, p94, p93, p92, p91, p90, p89, p88, p87, p86, p85, p84, p83, p82, p81, p80) | 68<=sum(p79, p78, p77, p76, p75, p74, p73, p72, p71, p70, p69, p68, p67, p66, p65, p64, p63, p62, p61, p60, p59, p58, p57, p56, p55, p54, p53, p52, p51, p50, p49, p48, p47, p46, p45, p44, p43, p42, p41, p40, p39, p38, p37, p36, p35, p34, p33, p32, p31, p30, p29, p28, p27, p26, p25, p24, p23, p22, p21, p20, p19, p18, p17, p16)]]]]

abstracting: (68<=sum(p79, p78, p77, p76, p75, p74, p73, p72, p71, p70, p69, p68, p67, p66, p65, p64, p63, p62, p61, p60, p59, p58, p57, p56, p55, p54, p53, p52, p51, p50, p49, p48, p47, p46, p45, p44, p43, p42, p41, p40, p39, p38, p37, p36, p35, p34, p33, p32, p31, p30, p29, p28, p27, p26, p25, p24, p23, p22, p21, p20, p19, p18, p17, p16))
MC time: 7m48.000sec

checking: [A [[[~ [AG [p27<=p66]] | E [~ [1<=p60] U AX [1<=p4]]] | [~ [p74<=p67] | [p51<=0 & ~ [[p49<=0 & [AG [p86<=p126] & EG [1<=p37]]]]]]] U E [~ [EG [AX [1<=p110]]] U AG [AX [1<=p30]]]] | EX [~ [A [[EG [1<=p96] | p96<=0] U [~ [[1<=p50 & p18<=p31]] | ~ [EF [1<=p122]]]]]]]
normalized: [EX [~ [[~ [EG [~ [[~ [E [true U 1<=p122]] | ~ [[1<=p50 & p18<=p31]]]]]] & ~ [E [~ [[~ [E [true U 1<=p122]] | ~ [[1<=p50 & p18<=p31]]]] U [~ [[p96<=0 | EG [1<=p96]]] & ~ [[~ [E [true U 1<=p122]] | ~ [[1<=p50 & p18<=p31]]]]]]]]]] | [~ [EG [~ [E [~ [EG [~ [EX [~ [1<=p110]]]]] U ~ [E [true U EX [~ [1<=p30]]]]]]]] & ~ [E [~ [E [~ [EG [~ [EX [~ [1<=p110]]]]] U ~ [E [true U EX [~ [1<=p30]]]]]] U [~ [[[[p51<=0 & ~ [[p49<=0 & [EG [1<=p37] & ~ [E [true U ~ [p86<=p126]]]]]]] | ~ [p74<=p67]] | [E [~ [1<=p60] U ~ [EX [~ [1<=p4]]]] | E [true U ~ [p27<=p66]]]]] & ~ [E [~ [EG [~ [EX [~ [1<=p110]]]]] U ~ [E [true U EX [~ [1<=p30]]]]]]]]]]]

abstracting: (1<=p30)
states: 8,223,394 (6)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6127320 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16099296 kB

BK_TIME_CONFINEMENT_REACHED

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


iterations count:1554 (24), effective:64 (1)

initing FirstDep: 0m 0.000sec


iterations count:134 (2), effective:4 (0)

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

iterations count:174 (2), effective:8 (0)

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

iterations count:174 (2), effective:8 (0)

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

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

iterations count:174 (2), effective:8 (0)

iterations count:184 (2), effective:4 (0)

iterations count:158 (2), effective:4 (0)

iterations count:1460 (22), effective:60 (0)

iterations count:184 (2), effective:4 (0)

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

iterations count:742 (11), effective:27 (0)

iterations count:154 (2), effective:4 (0)

iterations count:154 (2), effective:4 (0)

iterations count:229 (3), effective:4 (0)

iterations count:154 (2), effective:4 (0)

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

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

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

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

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

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

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

iterations count:15087 (235), effective:921 (14)

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

iterations count:2143 (33), effective:103 (1)

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

sat_reach.icc:155: Timeout: after 935 sec


idd.h:1025: Timeout: after 467 sec


iterations count:64 (1), effective:0 (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="Sudoku-PT-BN04"
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 Sudoku-PT-BN04, 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 r490-tall-167912708500297"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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