Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r426-tajo-167905979000471.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is SieveSingleMsgMbox-PT-d2m18, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905979000471
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.1K Feb 26 10:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 10:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 10:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 10:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 17:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 10:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 10:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 26 10:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 10:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.1M 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 SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679355940880

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m18
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 23:45:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 23:45:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 23:45:42] [INFO ] Load time of PNML (sax parser for PT used): 139 ms
[2023-03-20 23:45:42] [INFO ] Transformed 2398 places.
[2023-03-20 23:45:42] [INFO ] Transformed 1954 transitions.
[2023-03-20 23:45:42] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 215 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1984 places in 15 ms
Reduce places removed 1984 places and 0 transitions.
Incomplete random walk after 10000 steps, including 2210 resets, run finished after 624 ms. (steps per millisecond=16 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 37 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 43 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 40 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 49 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 34 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 39 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 37 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 152338 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :{1=1, 2=1, 11=1, 12=1}
Probabilistic random walk after 152338 steps, saw 69877 distinct states, run finished after 3002 ms. (steps per millisecond=50 ) properties seen :4
FORMULA SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 12 properties.
// Phase 1: matrix 1954 rows 414 cols
[2023-03-20 23:45:46] [INFO ] Computed 6 place invariants in 34 ms
[2023-03-20 23:45:47] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-20 23:45:47] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 12 ms returned sat
[2023-03-20 23:45:48] [INFO ] After 1322ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:11
[2023-03-20 23:45:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 23:45:48] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 13 ms returned sat
[2023-03-20 23:45:50] [INFO ] After 2164ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :7
[2023-03-20 23:45:50] [INFO ] State equation strengthened by 1674 read => feed constraints.
[2023-03-20 23:45:55] [INFO ] After 4801ms SMT Verify possible using 1674 Read/Feed constraints in natural domain returned unsat :5 sat :7
[2023-03-20 23:45:56] [INFO ] Deduced a trap composed of 234 places in 287 ms of which 8 ms to minimize.
[2023-03-20 23:45:57] [INFO ] Deduced a trap composed of 281 places in 288 ms of which 3 ms to minimize.
[2023-03-20 23:45:57] [INFO ] Deduced a trap composed of 167 places in 153 ms of which 1 ms to minimize.
[2023-03-20 23:45:57] [INFO ] Deduced a trap composed of 164 places in 146 ms of which 1 ms to minimize.
[2023-03-20 23:45:58] [INFO ] Deduced a trap composed of 159 places in 157 ms of which 1 ms to minimize.
[2023-03-20 23:45:58] [INFO ] Deduced a trap composed of 139 places in 136 ms of which 1 ms to minimize.
[2023-03-20 23:45:58] [INFO ] Deduced a trap composed of 141 places in 133 ms of which 0 ms to minimize.
[2023-03-20 23:45:59] [INFO ] Deduced a trap composed of 103 places in 142 ms of which 1 ms to minimize.
[2023-03-20 23:45:59] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3045 ms
[2023-03-20 23:46:03] [INFO ] Deduced a trap composed of 122 places in 115 ms of which 1 ms to minimize.
[2023-03-20 23:46:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 372 ms
[2023-03-20 23:46:04] [INFO ] After 13415ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :7
Attempting to minimize the solution found.
Minimization took 4304 ms.
[2023-03-20 23:46:08] [INFO ] After 20236ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :7
FORMULA SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 189 ms.
Support contains 42 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Graph (complete) has 2618 edges and 414 vertex of which 388 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.4 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 830 transitions.
Iterating post reduction 0 with 830 rules applied. Total rules applied 831 place count 388 transition count 1124
Discarding 87 places :
Symmetric choice reduction at 1 with 87 rule applications. Total rules 918 place count 301 transition count 849
Iterating global reduction 1 with 87 rules applied. Total rules applied 1005 place count 301 transition count 849
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 1016 place count 301 transition count 838
Discarding 60 places :
Symmetric choice reduction at 2 with 60 rule applications. Total rules 1076 place count 241 transition count 778
Iterating global reduction 2 with 60 rules applied. Total rules applied 1136 place count 241 transition count 778
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 1169 place count 241 transition count 745
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 1190 place count 220 transition count 721
Iterating global reduction 3 with 21 rules applied. Total rules applied 1211 place count 220 transition count 721
Ensure Unique test removed 93 transitions
Reduce isomorphic transitions removed 93 transitions.
Iterating post reduction 3 with 93 rules applied. Total rules applied 1304 place count 220 transition count 628
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1309 place count 215 transition count 619
Iterating global reduction 4 with 5 rules applied. Total rules applied 1314 place count 215 transition count 619
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1319 place count 210 transition count 614
Iterating global reduction 4 with 5 rules applied. Total rules applied 1324 place count 210 transition count 614
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1326 place count 208 transition count 612
Iterating global reduction 4 with 2 rules applied. Total rules applied 1328 place count 208 transition count 612
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1329 place count 207 transition count 611
Iterating global reduction 4 with 1 rules applied. Total rules applied 1330 place count 207 transition count 611
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1331 place count 206 transition count 610
Iterating global reduction 4 with 1 rules applied. Total rules applied 1332 place count 206 transition count 610
Applied a total of 1332 rules in 150 ms. Remains 206 /414 variables (removed 208) and now considering 610/1954 (removed 1344) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 151 ms. Remains : 206/414 places, 610/1954 transitions.
Incomplete random walk after 10000 steps, including 2217 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 503 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 446 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 488 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 467 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 439 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 483 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 458 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 270678 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :{6=1}
Probabilistic random walk after 270678 steps, saw 126467 distinct states, run finished after 3001 ms. (steps per millisecond=90 ) properties seen :1
FORMULA SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 6 properties.
// Phase 1: matrix 610 rows 206 cols
[2023-03-20 23:46:12] [INFO ] Computed 4 place invariants in 8 ms
[2023-03-20 23:46:12] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 23:46:12] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-20 23:46:12] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-20 23:46:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 23:46:12] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-20 23:46:13] [INFO ] After 652ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-20 23:46:13] [INFO ] State equation strengthened by 453 read => feed constraints.
[2023-03-20 23:46:14] [INFO ] After 1148ms SMT Verify possible using 453 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-20 23:46:16] [INFO ] Deduced a trap composed of 48 places in 55 ms of which 0 ms to minimize.
[2023-03-20 23:46:16] [INFO ] Deduced a trap composed of 53 places in 46 ms of which 1 ms to minimize.
[2023-03-20 23:46:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 257 ms
[2023-03-20 23:46:16] [INFO ] After 2828ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 747 ms.
[2023-03-20 23:46:17] [INFO ] After 4340ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 75 ms.
Support contains 40 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 610/610 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 204 transition count 595
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 204 transition count 595
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 202 transition count 593
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 202 transition count 593
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 200 transition count 591
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 200 transition count 591
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 199 transition count 589
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 199 transition count 589
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 198 transition count 588
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 198 transition count 588
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 197 transition count 587
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 197 transition count 587
Applied a total of 18 rules in 77 ms. Remains 197 /206 variables (removed 9) and now considering 587/610 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 197/206 places, 587/610 transitions.
Incomplete random walk after 10000 steps, including 2227 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 484 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 487 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 498 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 526 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 458 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 436 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 274640 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :{}
Probabilistic random walk after 274640 steps, saw 128306 distinct states, run finished after 3007 ms. (steps per millisecond=91 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 587 rows 197 cols
[2023-03-20 23:46:21] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-20 23:46:21] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 23:46:21] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-20 23:46:21] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-20 23:46:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 23:46:21] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-20 23:46:22] [INFO ] After 781ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-20 23:46:22] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-03-20 23:46:22] [INFO ] After 787ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-20 23:46:24] [INFO ] After 1796ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 956 ms.
[2023-03-20 23:46:24] [INFO ] After 3644ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 56 ms.
Support contains 40 out of 197 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 587/587 transitions.
Applied a total of 0 rules in 29 ms. Remains 197 /197 variables (removed 0) and now considering 587/587 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 197/197 places, 587/587 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 587/587 transitions.
Applied a total of 0 rules in 29 ms. Remains 197 /197 variables (removed 0) and now considering 587/587 (removed 0) transitions.
[2023-03-20 23:46:25] [INFO ] Invariant cache hit.
[2023-03-20 23:46:25] [INFO ] Implicit Places using invariants in 518 ms returned []
[2023-03-20 23:46:25] [INFO ] Invariant cache hit.
[2023-03-20 23:46:25] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-03-20 23:46:26] [INFO ] Implicit Places using invariants and state equation in 946 ms returned []
Implicit Place search using SMT with State Equation took 1466 ms to find 0 implicit places.
[2023-03-20 23:46:26] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-20 23:46:26] [INFO ] Invariant cache hit.
[2023-03-20 23:46:26] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1732 ms. Remains : 197/197 places, 587/587 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 197 transition count 581
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 192 transition count 581
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 11 place count 192 transition count 565
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 43 place count 176 transition count 565
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 67 place count 164 transition count 553
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 69 place count 163 transition count 553
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 71 place count 163 transition count 551
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 75 place count 163 transition count 547
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 80 place count 159 transition count 546
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 92 place count 159 transition count 546
Applied a total of 92 rules in 50 ms. Remains 159 /197 variables (removed 38) and now considering 546/587 (removed 41) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 546 rows 159 cols
[2023-03-20 23:46:26] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-20 23:46:26] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 23:46:26] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-20 23:46:26] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-20 23:46:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 23:46:27] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 23:46:27] [INFO ] After 432ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-20 23:46:27] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 1 ms to minimize.
[2023-03-20 23:46:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2023-03-20 23:46:27] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 14 ms to minimize.
[2023-03-20 23:46:27] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 1 ms to minimize.
[2023-03-20 23:46:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 224 ms
[2023-03-20 23:46:28] [INFO ] Deduced a trap composed of 33 places in 139 ms of which 2 ms to minimize.
[2023-03-20 23:46:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 189 ms
[2023-03-20 23:46:28] [INFO ] After 1407ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 507 ms.
[2023-03-20 23:46:28] [INFO ] After 2003ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2023-03-20 23:46:28] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2023-03-20 23:46:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 197 places, 587 transitions and 2320 arcs took 11 ms.
[2023-03-20 23:46:29] [INFO ] Flatten gal took : 99 ms
Total runtime 46780 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=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: SieveSingleMsgMbox_PT_d2m18
(NrP: 197 NrTr: 587 NrArc: 2320)

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

net check time: 0m 0.000sec

init dd package: 0m 3.189sec


before gc: list nodes free: 1081109

after gc: idd nodes used:181021, unused:63818979; list nodes free:525262836

RS generation: 27m59.969sec


-> reachability set: #nodes 108991 (1.1e+05) #states 198,756,234,314,374 (14)



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

checking: EF [[1<=p182 & 1<=p1]]
normalized: E [true U [1<=p182 & 1<=p1]]

abstracting: (1<=p1)
states: 12,109,948,001,462 (13)
abstracting: (1<=p182)
states: 2,141,390,933,440 (12)
-> the formula is TRUE

FORMULA SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 4m13.072sec

checking: EF [[1<=p1 & 1<=p169]]
normalized: E [true U [1<=p1 & 1<=p169]]

abstracting: (1<=p169)
states: 2,141,861,187,312 (12)
abstracting: (1<=p1)
states: 12,109,948,001,462 (13)

before gc: list nodes free: 21305805

after gc: idd nodes used:246665, unused:63753335; list nodes free:524911817
-> the formula is TRUE

FORMULA SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m 9.183sec

checking: EF [[1<=p173 & 1<=p1]]
normalized: E [true U [1<=p173 & 1<=p1]]

abstracting: (1<=p1)
states: 12,109,948,001,462 (13)
abstracting: (1<=p173)
states: 2,141,390,933,440 (12)
-> the formula is TRUE

FORMULA SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 4m10.679sec

checking: EF [[1<=p95 & 1<=p1]]
normalized: E [true U [1<=p95 & 1<=p1]]

abstracting: (1<=p1)
states: 12,109,948,001,462 (13)
abstracting: (1<=p95)
states: 0
-> the formula is FALSE

FORMULA SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.057sec

checking: AG [[[[1<=p185 & 1<=p1] | p171<=0] | p1<=0]]
normalized: ~ [E [true U ~ [[[[1<=p185 & 1<=p1] | p171<=0] | p1<=0]]]]

abstracting: (p1<=0)
states: 186,646,286,312,912 (14)
abstracting: (p171<=0)
states: 196,614,373,127,062 (14)
abstracting: (1<=p1)
states: 12,109,948,001,462 (13)
abstracting: (1<=p185)
states: 2,048,598,605,760 (12)

before gc: list nodes free: 23923204

after gc: idd nodes used:254906, unused:63745094; list nodes free:524855030
-> the formula is FALSE

FORMULA SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m12.192sec

checking: EF [[[1<=p1 & 1<=p173] | [[[[1<=p171 & 1<=p145] & 1<=p1] & [[[p1<=0 | [p183<=0 | [[[[1<=p66 & 1<=p52] | p181<=0] | [p1<=0 | p152<=0]] & [p1<=0 | [p187<=0 | [[p188<=0 | p1<=0] & [p181<=0 | p1<=0]]]]]]] & 1<=p190] & [[[1<=p66 & 1<=p28] | 1<=p185] & [p1<=0 | [p168<=0 | [1<=p169 & 1<=p183]]]]]] | [[[[1<=p174 & 1<=p170] & 1<=p1] & [1<=p176 & [1<=p177 & 1<=p63]]] & [[1<=p154 & [1<=p165 & [1<=p186 | 1<=p167]]] & [[[p172<=0 | [[p128<=0 | p1<=0] & [1<=p179 | [1<=p184 & 1<=p191]]]] | p1<=0] & [[[[[[p189<=0 | p1<=0] & [1<=p178 | 1<=p94]] & 1<=p110] | 1<=p68] | [p1<=0 | p188<=0]] & [1<=p187 | [1<=p180 | [[p135<=0 | p1<=0] & [[p1<=0 | p175<=0] & [p1<=0 | [p185<=0 | p182<=0]]]]]]]]]]]]]
normalized: E [true U [[[[[[[1<=p187 | [1<=p180 | [[[p1<=0 | [p185<=0 | p182<=0]] & [p1<=0 | p175<=0]] & [p135<=0 | p1<=0]]]] & [[p1<=0 | p188<=0] | [1<=p68 | [1<=p110 & [[1<=p178 | 1<=p94] & [p189<=0 | p1<=0]]]]]] & [p1<=0 | [p172<=0 | [[1<=p179 | [1<=p184 & 1<=p191]] & [p128<=0 | p1<=0]]]]] & [1<=p154 & [1<=p165 & [1<=p186 | 1<=p167]]]] & [[1<=p176 & [1<=p177 & 1<=p63]] & [1<=p1 & [1<=p174 & 1<=p170]]]] | [[[[p1<=0 | [p168<=0 | [1<=p169 & 1<=p183]]] & [1<=p185 | [1<=p66 & 1<=p28]]] & [1<=p190 & [p1<=0 | [p183<=0 | [[p1<=0 | [p187<=0 | [[p181<=0 | p1<=0] & [p188<=0 | p1<=0]]]] & [[p1<=0 | p152<=0] | [p181<=0 | [1<=p66 & 1<=p52]]]]]]]] & [1<=p1 & [1<=p171 & 1<=p145]]]] | [1<=p1 & 1<=p173]]]

abstracting: (1<=p173)
states: 2,141,390,933,440 (12)
abstracting: (1<=p1)
states: 12,109,948,001,462 (13)
abstracting: (1<=p145)
states: 65,728,835,641,320 (13)
abstracting: (1<=p171)
states: 2,141,861,187,312 (12)
abstracting: (1<=p1)
states: 12,109,948,001,462 (13)
abstracting: (1<=p52)
states: 129,745,121,184 (11)
abstracting: (1<=p66)
states: 194,877,890,956,398 (14)
abstracting: (p181<=0)
states: 196,614,843,380,934 (14)
abstracting: (p152<=0)
states: 133,016,515,744,138 (14)
abstracting: (p1<=0)
states: 186,646,286,312,912 (14)
abstracting: (p1<=0)
states: 186,646,286,312,912 (14)
abstracting: (p188<=0)
states: 196,707,635,708,614 (14)
abstracting: (p1<=0)
states: 186,646,286,312,912 (14)
abstracting: (p181<=0)
states: 196,614,843,380,934 (14)
abstracting: (p187<=0)
states: 196,707,635,708,614 (14)
abstracting: (p1<=0)
states: 186,646,286,312,912 (14)
abstracting: (p183<=0)
states: 196,614,843,380,934 (14)
abstracting: (p1<=0)
states: 186,646,286,312,912 (14)
abstracting: (1<=p190)
states: 2,048,598,605,760 (12)
abstracting: (1<=p28)
states: 129,745,121,184 (11)
abstracting: (1<=p66)
states: 194,877,890,956,398 (14)
abstracting: (1<=p185)
states: 2,048,598,605,760 (12)
abstracting: (1<=p183)
states: 2,141,390,933,440 (12)
abstracting: (1<=p169)
states: 2,141,861,187,312 (12)
abstracting: (p168<=0)
states: 196,614,843,380,934 (14)
abstracting: (p1<=0)
states: 186,646,286,312,912 (14)
abstracting: (1<=p170)
states: 2,141,861,187,312 (12)
abstracting: (1<=p174)
states: 2,141,861,187,312 (12)
abstracting: (1<=p1)
states: 12,109,948,001,462 (13)
abstracting: (1<=p63)
states: 4,295,596,111,012 (12)
abstracting: (1<=p177)
states: 2,141,390,933,440 (12)
abstracting: (1<=p176)
states: 2,141,390,933,440 (12)
abstracting: (1<=p167)
states: 2,141,390,933,440 (12)
abstracting: (1<=p186)
states: 2,048,598,605,760 (12)
abstracting: (1<=p165)
states: 2,141,861,187,312 (12)
abstracting: (1<=p154)
states: 6,241,402,625,128 (12)
abstracting: (p1<=0)
states: 186,646,286,312,912 (14)
abstracting: (p128<=0)
states: 151,335,555,178,173 (14)
abstracting: (1<=p191)
states: 2,048,598,605,760 (12)
abstracting: (1<=p184)
states: 2,048,598,605,760 (12)
abstracting: (1<=p179)
states: 2,141,861,187,312 (12)
abstracting: (p172<=0)
states: 196,614,843,380,934 (14)
abstracting: (p1<=0)
states: 186,646,286,312,912 (14)
abstracting: (p1<=0)
states: 186,646,286,312,912 (14)
abstracting: (p189<=0)
states: 196,707,635,708,614 (14)
abstracting: (1<=p94)
states: 0
abstracting: (1<=p178)
states: 2,141,861,187,312 (12)
abstracting: (1<=p110)
states: 0
abstracting: (1<=p68)
states: 2
abstracting: (p188<=0)
states: 196,707,635,708,614 (14)
abstracting: (p1<=0)
states: 186,646,286,312,912 (14)
abstracting: (p1<=0)
states: 186,646,286,312,912 (14)
abstracting: (p135<=0)
states: 196,614,373,127,062 (14)
abstracting: (p175<=0)
states: 196,614,373,127,062 (14)
abstracting: (p1<=0)
states: 186,646,286,312,912 (14)
abstracting: (p182<=0)
states: 196,614,843,380,934 (14)
abstracting: (p185<=0)
states: 196,707,635,708,614 (14)
abstracting: (p1<=0)
states: 186,646,286,312,912 (14)
abstracting: (1<=p180)
states: 2,141,861,187,312 (12)
abstracting: (1<=p187)
states: 2,048,598,605,760 (12)
-> the formula is TRUE

FORMULA SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 4m30.532sec

totally nodes used: 244663695 (2.4e+08)
number of garbage collections: 3
fire ops cache: hits/miss/sum: 4282863667 1237182107 1225078478
used/not used/entry size/cache size: 67014963 93901 16 1024MB
basic ops cache: hits/miss/sum: 639559707 236686523 876246230
used/not used/entry size/cache size: 16757507 19709 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: 749177 399000 1148177
used/not used/entry size/cache size: 178466 8210142 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 31102067
1 23228666
2 9359855
3 2663336
4 596100
5 113884
6 21548
7 5809
8 2713
9 1964
>= 10 12922

Total processing time: 45m27.908sec


BK_STOP 1679358717683

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -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

11875 13234 12886 21055 28079 29613 29992 25018 24540 44191 49150 54232 51723 41620 40314 65976 74299 84082 80222 62187 58977 95388 106039 119480 115579 86664 82929 129740 145333 162407 158498 116018 115477 154097 174137 188564 185250 132885 127358 160059 177287 193681 189349 136998 132078 160888 175700 194781 191087 140694 137136 160868 171716 193400 188967 143554 135228 157810 168300 190449 183591 144731 133305 152625 162723 185666 177137 142026 130171 147020 157323 177730 167630 138791 163594 118359 173156 225361 255817 258405 198653 182363 172031 233183 208239 237674 249051 193716 184129 190803 208345 198577 221670 229492 207480 182666 173376 167821 187936 195242 214975 213055 181934 170789 169537 179212 190069 199798 200122 176699 170569 172293 174119 180289 183752 186472 171231 168347 167722 161414 115060
iterations count:12120272 (20647), effective:118389 (201)

initing FirstDep: 0m 0.000sec

213612 182160
iterations count:269981 (459), effective:3016 (5)
154673
iterations count:149052 (253), effective:1677 (2)
213884 179934
iterations count:269104 (458), effective:3006 (5)
153190
iterations count:149020 (253), effective:1677 (2)
213884 179934
iterations count:269104 (458), effective:3006 (5)

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="SieveSingleMsgMbox-PT-d2m18"
export BK_EXAMINATION="ReachabilityFireability"
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 SieveSingleMsgMbox-PT-d2m18, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r426-tajo-167905979000471"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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