About the Execution of LTSMin+red for Murphy-PT-D3N050
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
16005.783 | 3583354.00 | 14279706.00 | 381.90 | ???????????F???? | normal |
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.r521-tall-167987246600354.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 ltsminxred
Input is Murphy-PT-D3N050, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r521-tall-167987246600354
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 6.0K Mar 23 15:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Mar 23 15:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 34K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 12K Mar 23 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Mar 23 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 23 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 15K Mar 31 16:48 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Murphy-PT-D3N050-CTLFireability-00
FORMULA_NAME Murphy-PT-D3N050-CTLFireability-01
FORMULA_NAME Murphy-PT-D3N050-CTLFireability-02
FORMULA_NAME Murphy-PT-D3N050-CTLFireability-03
FORMULA_NAME Murphy-PT-D3N050-CTLFireability-04
FORMULA_NAME Murphy-PT-D3N050-CTLFireability-05
FORMULA_NAME Murphy-PT-D3N050-CTLFireability-06
FORMULA_NAME Murphy-PT-D3N050-CTLFireability-07
FORMULA_NAME Murphy-PT-D3N050-CTLFireability-08
FORMULA_NAME Murphy-PT-D3N050-CTLFireability-09
FORMULA_NAME Murphy-PT-D3N050-CTLFireability-10
FORMULA_NAME Murphy-PT-D3N050-CTLFireability-11
FORMULA_NAME Murphy-PT-D3N050-CTLFireability-12
FORMULA_NAME Murphy-PT-D3N050-CTLFireability-13
FORMULA_NAME Murphy-PT-D3N050-CTLFireability-14
FORMULA_NAME Murphy-PT-D3N050-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1680906303069
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=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Murphy-PT-D3N050
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 22:25:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 22:25:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 22:25:04] [INFO ] Load time of PNML (sax parser for PT used): 22 ms
[2023-04-07 22:25:04] [INFO ] Transformed 24 places.
[2023-04-07 22:25:04] [INFO ] Transformed 28 transitions.
[2023-04-07 22:25:04] [INFO ] Parsed PT model containing 24 places and 28 transitions and 108 arcs in 81 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Murphy-PT-D3N050-CTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 8 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 24 cols
[2023-04-07 22:25:04] [INFO ] Computed 5 invariants in 8 ms
[2023-04-07 22:25:05] [INFO ] Dead Transitions using invariants and state equation in 387 ms found 0 transitions.
[2023-04-07 22:25:05] [INFO ] Invariant cache hit.
[2023-04-07 22:25:05] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-04-07 22:25:05] [INFO ] Invariant cache hit.
[2023-04-07 22:25:05] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-07 22:25:05] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-04-07 22:25:05] [INFO ] Invariant cache hit.
[2023-04-07 22:25:05] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 543 ms. Remains : 24/24 places, 28/28 transitions.
Support contains 24 out of 24 places after structural reductions.
[2023-04-07 22:25:05] [INFO ] Flatten gal took : 16 ms
[2023-04-07 22:25:05] [INFO ] Flatten gal took : 6 ms
[2023-04-07 22:25:05] [INFO ] Input system was already deterministic with 28 transitions.
Incomplete random walk after 10015 steps, including 2 resets, run finished after 276 ms. (steps per millisecond=36 ) properties (out of 47) seen :38
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-04-07 22:25:05] [INFO ] Invariant cache hit.
[2023-04-07 22:25:06] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 22:25:06] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2023-04-07 22:25:06] [INFO ] After 134ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-04-07 22:25:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 22:25:06] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-07 22:25:06] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-04-07 22:25:06] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-07 22:25:06] [INFO ] After 18ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-04-07 22:25:06] [INFO ] After 61ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-04-07 22:25:06] [INFO ] After 230ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 11 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 4 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 22:25:06] [INFO ] Invariant cache hit.
[2023-04-07 22:25:06] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 24/24 places, 28/28 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 350350 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :{}
Probabilistic random walk after 350350 steps, saw 237781 distinct states, run finished after 3002 ms. (steps per millisecond=116 ) properties seen :0
Running SMT prover for 9 properties.
[2023-04-07 22:25:09] [INFO ] Invariant cache hit.
[2023-04-07 22:25:09] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 22:25:09] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2023-04-07 22:25:09] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-04-07 22:25:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 22:25:09] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2023-04-07 22:25:09] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-04-07 22:25:09] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-07 22:25:09] [INFO ] After 15ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-04-07 22:25:09] [INFO ] After 36ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-04-07 22:25:09] [INFO ] After 127ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 21 ms.
Support contains 11 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 24/24 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 22:25:09] [INFO ] Invariant cache hit.
[2023-04-07 22:25:09] [INFO ] Implicit Places using invariants in 34 ms returned [8, 10, 11]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 37 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 21/24 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 40 ms. Remains : 21/24 places, 28/28 transitions.
Incomplete random walk after 10044 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=286 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 314800 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :{}
Probabilistic random walk after 314800 steps, saw 214248 distinct states, run finished after 3001 ms. (steps per millisecond=104 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 28 rows 21 cols
[2023-04-07 22:25:12] [INFO ] Computed 2 invariants in 2 ms
[2023-04-07 22:25:13] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 22:25:13] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-04-07 22:25:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 22:25:13] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-04-07 22:25:13] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-07 22:25:13] [INFO ] After 16ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-04-07 22:25:13] [INFO ] After 40ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-04-07 22:25:13] [INFO ] After 111ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 12 ms.
Support contains 11 out of 21 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21/21 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 21/21 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21/21 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 22:25:13] [INFO ] Invariant cache hit.
[2023-04-07 22:25:13] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-04-07 22:25:13] [INFO ] Invariant cache hit.
[2023-04-07 22:25:13] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-07 22:25:13] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-04-07 22:25:13] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 22:25:13] [INFO ] Invariant cache hit.
[2023-04-07 22:25:13] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 21/21 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Running SMT prover for 9 properties.
[2023-04-07 22:25:13] [INFO ] Invariant cache hit.
[2023-04-07 22:25:13] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 22:25:13] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-04-07 22:25:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 22:25:13] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-04-07 22:25:13] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-07 22:25:13] [INFO ] After 14ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-04-07 22:25:13] [INFO ] After 41ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-04-07 22:25:13] [INFO ] After 113ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
[2023-04-07 22:25:13] [INFO ] Flatten gal took : 5 ms
[2023-04-07 22:25:13] [INFO ] Flatten gal took : 5 ms
[2023-04-07 22:25:13] [INFO ] Input system was already deterministic with 28 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 24 cols
[2023-04-07 22:25:13] [INFO ] Computed 5 invariants in 2 ms
[2023-04-07 22:25:13] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 24/24 places, 28/28 transitions.
[2023-04-07 22:25:13] [INFO ] Flatten gal took : 3 ms
[2023-04-07 22:25:13] [INFO ] Flatten gal took : 3 ms
[2023-04-07 22:25:13] [INFO ] Input system was already deterministic with 28 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 22:25:13] [INFO ] Invariant cache hit.
[2023-04-07 22:25:13] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 24/24 places, 28/28 transitions.
[2023-04-07 22:25:13] [INFO ] Flatten gal took : 2 ms
[2023-04-07 22:25:13] [INFO ] Flatten gal took : 2 ms
[2023-04-07 22:25:13] [INFO ] Input system was already deterministic with 28 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 22:25:13] [INFO ] Invariant cache hit.
[2023-04-07 22:25:13] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31 ms. Remains : 24/24 places, 28/28 transitions.
[2023-04-07 22:25:13] [INFO ] Flatten gal took : 2 ms
[2023-04-07 22:25:13] [INFO ] Flatten gal took : 2 ms
[2023-04-07 22:25:13] [INFO ] Input system was already deterministic with 28 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 22:25:13] [INFO ] Invariant cache hit.
[2023-04-07 22:25:13] [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 : 24/24 places, 28/28 transitions.
[2023-04-07 22:25:13] [INFO ] Flatten gal took : 2 ms
[2023-04-07 22:25:13] [INFO ] Flatten gal took : 2 ms
[2023-04-07 22:25:13] [INFO ] Input system was already deterministic with 28 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 22:25:13] [INFO ] Invariant cache hit.
[2023-04-07 22:25:13] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 24/24 places, 28/28 transitions.
[2023-04-07 22:25:13] [INFO ] Flatten gal took : 2 ms
[2023-04-07 22:25:13] [INFO ] Flatten gal took : 2 ms
[2023-04-07 22:25:13] [INFO ] Input system was already deterministic with 28 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 22:25:13] [INFO ] Invariant cache hit.
[2023-04-07 22:25:13] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 24/24 places, 28/28 transitions.
[2023-04-07 22:25:13] [INFO ] Flatten gal took : 2 ms
[2023-04-07 22:25:13] [INFO ] Flatten gal took : 2 ms
[2023-04-07 22:25:13] [INFO ] Input system was already deterministic with 28 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 22:25:13] [INFO ] Invariant cache hit.
[2023-04-07 22:25:13] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 24/24 places, 28/28 transitions.
[2023-04-07 22:25:13] [INFO ] Flatten gal took : 1 ms
[2023-04-07 22:25:13] [INFO ] Flatten gal took : 1 ms
[2023-04-07 22:25:13] [INFO ] Input system was already deterministic with 28 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 22:25:13] [INFO ] Invariant cache hit.
[2023-04-07 22:25:13] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 24/24 places, 28/28 transitions.
[2023-04-07 22:25:13] [INFO ] Flatten gal took : 1 ms
[2023-04-07 22:25:13] [INFO ] Flatten gal took : 1 ms
[2023-04-07 22:25:13] [INFO ] Input system was already deterministic with 28 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 22:25:13] [INFO ] Invariant cache hit.
[2023-04-07 22:25:13] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 24/24 places, 28/28 transitions.
[2023-04-07 22:25:13] [INFO ] Flatten gal took : 2 ms
[2023-04-07 22:25:13] [INFO ] Flatten gal took : 2 ms
[2023-04-07 22:25:13] [INFO ] Input system was already deterministic with 28 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 22:25:13] [INFO ] Invariant cache hit.
[2023-04-07 22:25:13] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 24/24 places, 28/28 transitions.
[2023-04-07 22:25:13] [INFO ] Flatten gal took : 2 ms
[2023-04-07 22:25:13] [INFO ] Flatten gal took : 2 ms
[2023-04-07 22:25:13] [INFO ] Input system was already deterministic with 28 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 22:25:13] [INFO ] Invariant cache hit.
[2023-04-07 22:25:13] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 24/24 places, 28/28 transitions.
[2023-04-07 22:25:13] [INFO ] Flatten gal took : 1 ms
[2023-04-07 22:25:13] [INFO ] Flatten gal took : 1 ms
[2023-04-07 22:25:13] [INFO ] Input system was already deterministic with 28 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 22:25:13] [INFO ] Invariant cache hit.
[2023-04-07 22:25:13] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 24/24 places, 28/28 transitions.
[2023-04-07 22:25:13] [INFO ] Flatten gal took : 1 ms
[2023-04-07 22:25:13] [INFO ] Flatten gal took : 2 ms
[2023-04-07 22:25:13] [INFO ] Input system was already deterministic with 28 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 22:25:13] [INFO ] Invariant cache hit.
[2023-04-07 22:25:13] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 24/24 places, 28/28 transitions.
[2023-04-07 22:25:13] [INFO ] Flatten gal took : 1 ms
[2023-04-07 22:25:13] [INFO ] Flatten gal took : 4 ms
[2023-04-07 22:25:13] [INFO ] Input system was already deterministic with 28 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 22:25:13] [INFO ] Invariant cache hit.
[2023-04-07 22:25:13] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40 ms. Remains : 24/24 places, 28/28 transitions.
[2023-04-07 22:25:13] [INFO ] Flatten gal took : 1 ms
[2023-04-07 22:25:13] [INFO ] Flatten gal took : 2 ms
[2023-04-07 22:25:13] [INFO ] Input system was already deterministic with 28 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 22:25:13] [INFO ] Invariant cache hit.
[2023-04-07 22:25:14] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 24/24 places, 28/28 transitions.
[2023-04-07 22:25:14] [INFO ] Flatten gal took : 1 ms
[2023-04-07 22:25:14] [INFO ] Flatten gal took : 1 ms
[2023-04-07 22:25:14] [INFO ] Input system was already deterministic with 28 transitions.
[2023-04-07 22:25:14] [INFO ] Flatten gal took : 3 ms
[2023-04-07 22:25:14] [INFO ] Flatten gal took : 2 ms
[2023-04-07 22:25:14] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-04-07 22:25:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 24 places, 28 transitions and 108 arcs took 0 ms.
Total runtime 9533 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/576/ctl_0_ --ctl=/tmp/576/ctl_1_ --ctl=/tmp/576/ctl_2_ --ctl=/tmp/576/ctl_3_ --ctl=/tmp/576/ctl_4_ --ctl=/tmp/576/ctl_5_ --ctl=/tmp/576/ctl_6_ --ctl=/tmp/576/ctl_7_ --ctl=/tmp/576/ctl_8_ --ctl=/tmp/576/ctl_9_ --ctl=/tmp/576/ctl_10_ --ctl=/tmp/576/ctl_11_ --ctl=/tmp/576/ctl_12_ --ctl=/tmp/576/ctl_13_ --ctl=/tmp/576/ctl_14_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393216 kB
MemFree: 160440 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16107488 kB
Could not compute solution for formula : Murphy-PT-D3N050-CTLFireability-00
Could not compute solution for formula : Murphy-PT-D3N050-CTLFireability-01
Could not compute solution for formula : Murphy-PT-D3N050-CTLFireability-02
Could not compute solution for formula : Murphy-PT-D3N050-CTLFireability-03
Could not compute solution for formula : Murphy-PT-D3N050-CTLFireability-04
Could not compute solution for formula : Murphy-PT-D3N050-CTLFireability-05
Could not compute solution for formula : Murphy-PT-D3N050-CTLFireability-06
Could not compute solution for formula : Murphy-PT-D3N050-CTLFireability-07
Could not compute solution for formula : Murphy-PT-D3N050-CTLFireability-08
Could not compute solution for formula : Murphy-PT-D3N050-CTLFireability-09
Could not compute solution for formula : Murphy-PT-D3N050-CTLFireability-10
Could not compute solution for formula : Murphy-PT-D3N050-CTLFireability-12
Could not compute solution for formula : Murphy-PT-D3N050-CTLFireability-13
Could not compute solution for formula : Murphy-PT-D3N050-CTLFireability-14
Could not compute solution for formula : Murphy-PT-D3N050-CTLFireability-15
BK_STOP 1680909886423
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2023
ctl formula name Murphy-PT-D3N050-CTLFireability-00
ctl formula formula --ctl=/tmp/576/ctl_0_
ctl formula name Murphy-PT-D3N050-CTLFireability-01
ctl formula formula --ctl=/tmp/576/ctl_1_
ctl formula name Murphy-PT-D3N050-CTLFireability-02
ctl formula formula --ctl=/tmp/576/ctl_2_
ctl formula name Murphy-PT-D3N050-CTLFireability-03
ctl formula formula --ctl=/tmp/576/ctl_3_
ctl formula name Murphy-PT-D3N050-CTLFireability-04
ctl formula formula --ctl=/tmp/576/ctl_4_
ctl formula name Murphy-PT-D3N050-CTLFireability-05
ctl formula formula --ctl=/tmp/576/ctl_5_
ctl formula name Murphy-PT-D3N050-CTLFireability-06
ctl formula formula --ctl=/tmp/576/ctl_6_
ctl formula name Murphy-PT-D3N050-CTLFireability-07
ctl formula formula --ctl=/tmp/576/ctl_7_
ctl formula name Murphy-PT-D3N050-CTLFireability-08
ctl formula formula --ctl=/tmp/576/ctl_8_
ctl formula name Murphy-PT-D3N050-CTLFireability-09
ctl formula formula --ctl=/tmp/576/ctl_9_
ctl formula name Murphy-PT-D3N050-CTLFireability-10
ctl formula formula --ctl=/tmp/576/ctl_10_
ctl formula name Murphy-PT-D3N050-CTLFireability-12
ctl formula formula --ctl=/tmp/576/ctl_11_
ctl formula name Murphy-PT-D3N050-CTLFireability-13
ctl formula formula --ctl=/tmp/576/ctl_12_
ctl formula name Murphy-PT-D3N050-CTLFireability-14
ctl formula formula --ctl=/tmp/576/ctl_13_
ctl formula name Murphy-PT-D3N050-CTLFireability-15
ctl formula formula --ctl=/tmp/576/ctl_14_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 24 places, 28 transitions and 108 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.010 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 28->12 groups
pnml2lts-sym: Regrouping took 0.010 real 0.000 user 0.000 sys
pnml2lts-sym: state vector length is 24; there are 12 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
Killing (15) : 582
Killing (9) : 582
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="Murphy-PT-D3N050"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is Murphy-PT-D3N050, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r521-tall-167987246600354"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Murphy-PT-D3N050.tgz
mv Murphy-PT-D3N050 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;