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-167905978900386.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-d0m64, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978900386
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 6.0K Feb 26 10:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 26 10:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 10:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 10:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 10:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 10:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 10:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 10:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:05 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 57K 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-d0m64-CTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-CTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-CTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-CTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-CTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-CTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-CTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-CTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-CTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-CTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-CTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-CTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-CTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-CTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-CTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679351341647

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=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d0m64
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 22:29:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 22:29:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 22:29:03] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2023-03-20 22:29:03] [INFO ] Transformed 262 places.
[2023-03-20 22:29:03] [INFO ] Transformed 73 transitions.
[2023-03-20 22:29:03] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 145 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 25 ms.
Deduced a syphon composed of 190 places in 1 ms
Reduce places removed 190 places and 0 transitions.
Support contains 55 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 73/73 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 70 transition count 73
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 69 transition count 72
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 69 transition count 72
Applied a total of 4 rules in 17 ms. Remains 69 /72 variables (removed 3) and now considering 72/73 (removed 1) transitions.
// Phase 1: matrix 72 rows 69 cols
[2023-03-20 22:29:03] [INFO ] Computed 5 place invariants in 7 ms
[2023-03-20 22:29:03] [INFO ] Implicit Places using invariants in 192 ms returned []
[2023-03-20 22:29:03] [INFO ] Invariant cache hit.
[2023-03-20 22:29:04] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-20 22:29:04] [INFO ] Implicit Places using invariants and state equation in 740 ms returned []
Implicit Place search using SMT with State Equation took 972 ms to find 0 implicit places.
[2023-03-20 22:29:04] [INFO ] Invariant cache hit.
[2023-03-20 22:29:04] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 69/72 places, 72/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1117 ms. Remains : 69/72 places, 72/73 transitions.
Support contains 55 out of 69 places after structural reductions.
[2023-03-20 22:29:04] [INFO ] Flatten gal took : 26 ms
[2023-03-20 22:29:05] [INFO ] Flatten gal took : 11 ms
[2023-03-20 22:29:05] [INFO ] Input system was already deterministic with 72 transitions.
Incomplete random walk after 10000 steps, including 2250 resets, run finished after 636 ms. (steps per millisecond=15 ) properties (out of 58) seen :24
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 104 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 104 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 36 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 200 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 57 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 58 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 200 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 100 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 34) seen :3
Incomplete Best-First random walk after 1000 steps, including 119 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 57 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 103 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 93 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 94 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 103 resets, run finished after 49 ms. (steps per millisecond=20 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 97 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 200 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 61 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 31) seen :0
Running SMT prover for 31 properties.
[2023-03-20 22:29:06] [INFO ] Invariant cache hit.
[2023-03-20 22:29:06] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 22:29:06] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 22:29:06] [INFO ] After 259ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:29
[2023-03-20 22:29:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-20 22:29:06] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-20 22:29:07] [INFO ] After 327ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :26
[2023-03-20 22:29:07] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-20 22:29:07] [INFO ] After 235ms SMT Verify possible using 31 Read/Feed constraints in natural domain returned unsat :5 sat :26
[2023-03-20 22:29:07] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 13 ms to minimize.
[2023-03-20 22:29:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2023-03-20 22:29:08] [INFO ] After 1226ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :26
Attempting to minimize the solution found.
Minimization took 530 ms.
[2023-03-20 22:29:08] [INFO ] After 2284ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :26
Fused 31 Parikh solutions to 26 different solutions.
Parikh walk visited 5 properties in 438 ms.
Support contains 27 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 72/72 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 67 transition count 70
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 67 transition count 70
Applied a total of 4 rules in 10 ms. Remains 67 /69 variables (removed 2) and now considering 70/72 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 67/69 places, 70/72 transitions.
Incomplete random walk after 10000 steps, including 2276 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 109 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 52 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 46 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 38 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 200 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 77 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 105 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 97 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 84 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 105 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 200 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Interrupted probabilistic random walk after 484706 steps, run timeout after 3001 ms. (steps per millisecond=161 ) properties seen :{0=1, 1=1, 2=1, 3=1, 4=1, 5=1, 6=1, 8=1, 10=1, 11=1, 12=1, 13=1, 14=1, 16=1, 17=1, 18=1, 19=1, 20=1}
Probabilistic random walk after 484706 steps, saw 250079 distinct states, run finished after 3003 ms. (steps per millisecond=161 ) properties seen :18
Running SMT prover for 3 properties.
// Phase 1: matrix 70 rows 67 cols
[2023-03-20 22:29:12] [INFO ] Computed 5 place invariants in 7 ms
[2023-03-20 22:29:12] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 22:29:12] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-20 22:29:12] [INFO ] After 158ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 22:29:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 22:29:12] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 22:29:12] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 22:29:12] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-20 22:29:12] [INFO ] After 33ms SMT Verify possible using 29 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-20 22:29:12] [INFO ] After 72ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-20 22:29:12] [INFO ] After 205ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 932 steps, including 77 resets, run visited all 3 properties in 21 ms. (steps per millisecond=44 )
Parikh walk visited 3 properties in 23 ms.
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
[2023-03-20 22:29:12] [INFO ] Flatten gal took : 5 ms
[2023-03-20 22:29:13] [INFO ] Flatten gal took : 7 ms
[2023-03-20 22:29:13] [INFO ] Input system was already deterministic with 72 transitions.
Computed a total of 10 stabilizing places and 13 stable transitions
Graph (complete) has 210 edges and 69 vertex of which 68 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 72/72 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 63 transition count 66
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 63 transition count 66
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 62 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 61 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 61 transition count 63
Applied a total of 17 rules in 8 ms. Remains 61 /69 variables (removed 8) and now considering 63/72 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 61/69 places, 63/72 transitions.
[2023-03-20 22:29:13] [INFO ] Flatten gal took : 4 ms
[2023-03-20 22:29:13] [INFO ] Flatten gal took : 4 ms
[2023-03-20 22:29:13] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 72/72 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 61 transition count 64
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 59 transition count 61
Applied a total of 21 rules in 7 ms. Remains 59 /69 variables (removed 10) and now considering 61/72 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 59/69 places, 61/72 transitions.
[2023-03-20 22:29:13] [INFO ] Flatten gal took : 3 ms
[2023-03-20 22:29:13] [INFO ] Flatten gal took : 3 ms
[2023-03-20 22:29:13] [INFO ] Input system was already deterministic with 61 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 69/69 places, 72/72 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 61 transition count 64
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 59 transition count 61
Applied a total of 21 rules in 11 ms. Remains 59 /69 variables (removed 10) and now considering 61/72 (removed 11) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 59/69 places, 61/72 transitions.
[2023-03-20 22:29:13] [INFO ] Flatten gal took : 3 ms
[2023-03-20 22:29:13] [INFO ] Flatten gal took : 4 ms
[2023-03-20 22:29:13] [INFO ] Input system was already deterministic with 61 transitions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 72/72 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 61 transition count 64
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 61 transition count 64
Applied a total of 16 rules in 3 ms. Remains 61 /69 variables (removed 8) and now considering 64/72 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 61/69 places, 64/72 transitions.
[2023-03-20 22:29:13] [INFO ] Flatten gal took : 3 ms
[2023-03-20 22:29:13] [INFO ] Flatten gal took : 3 ms
[2023-03-20 22:29:13] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 72/72 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 63 transition count 66
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 63 transition count 66
Applied a total of 12 rules in 3 ms. Remains 63 /69 variables (removed 6) and now considering 66/72 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 63/69 places, 66/72 transitions.
[2023-03-20 22:29:13] [INFO ] Flatten gal took : 3 ms
[2023-03-20 22:29:13] [INFO ] Flatten gal took : 3 ms
[2023-03-20 22:29:13] [INFO ] Input system was already deterministic with 66 transitions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 72/72 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 61 transition count 64
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 59 transition count 61
Applied a total of 21 rules in 6 ms. Remains 59 /69 variables (removed 10) and now considering 61/72 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 59/69 places, 61/72 transitions.
[2023-03-20 22:29:13] [INFO ] Flatten gal took : 2 ms
[2023-03-20 22:29:13] [INFO ] Flatten gal took : 36 ms
[2023-03-20 22:29:13] [INFO ] Input system was already deterministic with 61 transitions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 72/72 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 63 transition count 66
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 63 transition count 66
Applied a total of 12 rules in 3 ms. Remains 63 /69 variables (removed 6) and now considering 66/72 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 63/69 places, 66/72 transitions.
[2023-03-20 22:29:13] [INFO ] Flatten gal took : 3 ms
[2023-03-20 22:29:13] [INFO ] Flatten gal took : 4 ms
[2023-03-20 22:29:13] [INFO ] Input system was already deterministic with 66 transitions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 72/72 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 61 transition count 64
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 61 transition count 64
Applied a total of 16 rules in 2 ms. Remains 61 /69 variables (removed 8) and now considering 64/72 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 61/69 places, 64/72 transitions.
[2023-03-20 22:29:13] [INFO ] Flatten gal took : 3 ms
[2023-03-20 22:29:13] [INFO ] Flatten gal took : 3 ms
[2023-03-20 22:29:13] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 72/72 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 61 transition count 64
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 61 transition count 64
Applied a total of 16 rules in 1 ms. Remains 61 /69 variables (removed 8) and now considering 64/72 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 61/69 places, 64/72 transitions.
[2023-03-20 22:29:13] [INFO ] Flatten gal took : 3 ms
[2023-03-20 22:29:13] [INFO ] Flatten gal took : 5 ms
[2023-03-20 22:29:13] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 72/72 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 65 transition count 68
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 65 transition count 68
Applied a total of 8 rules in 2 ms. Remains 65 /69 variables (removed 4) and now considering 68/72 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 65/69 places, 68/72 transitions.
[2023-03-20 22:29:13] [INFO ] Flatten gal took : 2 ms
[2023-03-20 22:29:13] [INFO ] Flatten gal took : 3 ms
[2023-03-20 22:29:13] [INFO ] Input system was already deterministic with 68 transitions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 72/72 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 63 transition count 66
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 63 transition count 66
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 62 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 61 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 61 transition count 63
Applied a total of 17 rules in 4 ms. Remains 61 /69 variables (removed 8) and now considering 63/72 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 61/69 places, 63/72 transitions.
[2023-03-20 22:29:13] [INFO ] Flatten gal took : 3 ms
[2023-03-20 22:29:13] [INFO ] Flatten gal took : 3 ms
[2023-03-20 22:29:13] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 69/69 places, 72/72 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 61 transition count 64
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 59 transition count 61
Applied a total of 21 rules in 6 ms. Remains 59 /69 variables (removed 10) and now considering 61/72 (removed 11) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 59/69 places, 61/72 transitions.
[2023-03-20 22:29:13] [INFO ] Flatten gal took : 3 ms
[2023-03-20 22:29:13] [INFO ] Flatten gal took : 3 ms
[2023-03-20 22:29:13] [INFO ] Input system was already deterministic with 61 transitions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 72/72 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 63 transition count 66
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 63 transition count 66
Applied a total of 12 rules in 1 ms. Remains 63 /69 variables (removed 6) and now considering 66/72 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 63/69 places, 66/72 transitions.
[2023-03-20 22:29:13] [INFO ] Flatten gal took : 4 ms
[2023-03-20 22:29:13] [INFO ] Flatten gal took : 4 ms
[2023-03-20 22:29:13] [INFO ] Input system was already deterministic with 66 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 69/69 places, 72/72 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 62 transition count 65
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 60 transition count 62
Applied a total of 19 rules in 7 ms. Remains 60 /69 variables (removed 9) and now considering 62/72 (removed 10) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 60/69 places, 62/72 transitions.
[2023-03-20 22:29:13] [INFO ] Flatten gal took : 3 ms
[2023-03-20 22:29:13] [INFO ] Flatten gal took : 3 ms
[2023-03-20 22:29:13] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 72/72 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 63 transition count 66
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 63 transition count 66
Applied a total of 12 rules in 2 ms. Remains 63 /69 variables (removed 6) and now considering 66/72 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 63/69 places, 66/72 transitions.
[2023-03-20 22:29:13] [INFO ] Flatten gal took : 3 ms
[2023-03-20 22:29:13] [INFO ] Flatten gal took : 4 ms
[2023-03-20 22:29:13] [INFO ] Input system was already deterministic with 66 transitions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 72/72 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 62 transition count 65
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 60 transition count 62
Applied a total of 19 rules in 3 ms. Remains 60 /69 variables (removed 9) and now considering 62/72 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 60/69 places, 62/72 transitions.
[2023-03-20 22:29:13] [INFO ] Flatten gal took : 3 ms
[2023-03-20 22:29:13] [INFO ] Flatten gal took : 3 ms
[2023-03-20 22:29:13] [INFO ] Input system was already deterministic with 62 transitions.
[2023-03-20 22:29:13] [INFO ] Flatten gal took : 5 ms
[2023-03-20 22:29:13] [INFO ] Flatten gal took : 5 ms
[2023-03-20 22:29:13] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-20 22:29:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 69 places, 72 transitions and 285 arcs took 1 ms.
Total runtime 10066 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=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 69 NrTr: 72 NrArc: 285)

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

net check time: 0m 0.000sec

init dd package: 0m 3.135sec


before gc: list nodes free: 1636402

after gc: idd nodes used:1349781, unused:62650219; list nodes free:459117972

RS generation: 45m21.411sec


-> reachability set: #nodes 630476 (6.3e+05) #states 1,239,894,495,293 (12)



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

checking: EF [AG [[1<=p1 & 1<=p26]]]
normalized: E [true U ~ [E [true U ~ [[1<=p1 & 1<=p26]]]]]

abstracting: (1<=p26)
states: 8
abstracting: (1<=p1)
states: 190,885,280,024 (11)
-> the formula is FALSE

FORMULA SieveSingleMsgMbox-PT-d0m64-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m30.209sec

checking: A [[AX [[1<=p7 & 1<=p22]] | [1<=p2 & 1<=p39]] U EF [AG [~ [[1<=p1 & 1<=p57]]]]]
normalized: [~ [EG [~ [E [true U ~ [E [true U [1<=p1 & 1<=p57]]]]]]] & ~ [E [~ [E [true U ~ [E [true U [1<=p1 & 1<=p57]]]]] U [~ [[[1<=p2 & 1<=p39] | ~ [EX [~ [[1<=p7 & 1<=p22]]]]]] & ~ [E [true U ~ [E [true U [1<=p1 & 1<=p57]]]]]]]]]

abstracting: (1<=p57)
states: 58,350,505,408 (10)
abstracting: (1<=p1)
states: 190,885,280,024 (11)
MC time: 0m57.033sec

checking: AG [A [[1<=p7 & 1<=p22] U EF [AX [[[1<=p1 & 1<=p66] | [1<=p1 & 1<=p51]]]]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [E [true U ~ [EX [~ [[[1<=p1 & 1<=p51] | [1<=p1 & 1<=p66]]]]]]]]] & ~ [E [~ [E [true U ~ [EX [~ [[[1<=p1 & 1<=p51] | [1<=p1 & 1<=p66]]]]]]] U [~ [[1<=p7 & 1<=p22]] & ~ [E [true U ~ [EX [~ [[[1<=p1 & 1<=p51] | [1<=p1 & 1<=p66]]]]]]]]]]]]]]

abstracting: (1<=p66)
states: 58,350,505,408 (10)
abstracting: (1<=p1)
states: 190,885,280,024 (11)
abstracting: (1<=p51)
states: 19,419,507,456 (10)
abstracting: (1<=p1)
states: 190,885,280,024 (11)
.MC time: 0m53.034sec

checking: AF [[AF [[AG [[1<=p1 & 1<=p61]] | E [[1<=p1 & 1<=p62] U [1<=p1 & 1<=p26]]]] & [1<=p1 & 1<=p35]]]
normalized: ~ [EG [~ [[[1<=p1 & 1<=p35] & ~ [EG [~ [[E [[1<=p1 & 1<=p62] U [1<=p1 & 1<=p26]] | ~ [E [true U ~ [[1<=p1 & 1<=p61]]]]]]]]]]]]

abstracting: (1<=p61)
states: 1,112,003,748,832 (12)
abstracting: (1<=p1)
states: 190,885,280,024 (11)
abstracting: (1<=p26)
states: 8
abstracting: (1<=p1)
states: 190,885,280,024 (11)
abstracting: (1<=p62)
states: 1,112,003,748,832 (12)
abstracting: (1<=p1)
states: 190,885,280,024 (11)
..
EG iterations: 2
abstracting: (1<=p35)
states: 32,659,914,096 (10)
abstracting: (1<=p1)
states: 190,885,280,024 (11)

EG iterations: 0
-> the formula is FALSE

FORMULA SieveSingleMsgMbox-PT-d0m64-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m13.289sec

checking: [EF [EG [[p13<=0 | p39<=0]]] & E [AX [A [[1<=p1 & 1<=p48] U EF [[1<=p1 & 1<=p56]]]] U ~ [AF [~ [AX [[1<=p0 & 1<=p22]]]]]]]
normalized: [E [~ [EX [~ [[~ [EG [~ [E [true U [1<=p1 & 1<=p56]]]]] & ~ [E [~ [E [true U [1<=p1 & 1<=p56]]] U [~ [[1<=p1 & 1<=p48]] & ~ [E [true U [1<=p1 & 1<=p56]]]]]]]]]] U EG [~ [EX [~ [[1<=p0 & 1<=p22]]]]]] & E [true U EG [[p13<=0 | p39<=0]]]]

abstracting: (p39<=0)
states: 1,170,212,100,291 (12)
abstracting: (p13<=0)
states: 1,179,677,876,171 (12)
.
EG iterations: 1
abstracting: (1<=p22)
states: 1,227,821,756,837 (12)
abstracting: (1<=p0)
states: 1
..
EG iterations: 1
abstracting: (1<=p56)
states: 351,459,706,523 (11)
abstracting: (1<=p1)
states: 190,885,280,024 (11)
MC time: 0m52.001sec

checking: AF [[[AX [[1<=p6 & 1<=p22]] | AX [[1<=p1 & 1<=p66]]] & [[p1<=0 | p35<=0] & [p4<=0 | p22<=0]]]]
normalized: ~ [EG [~ [[[[p4<=0 | p22<=0] & [p1<=0 | p35<=0]] & [~ [EX [~ [[1<=p1 & 1<=p66]]]] | ~ [EX [~ [[1<=p6 & 1<=p22]]]]]]]]]

abstracting: (1<=p22)
states: 1,227,821,756,837 (12)
abstracting: (1<=p6)
states: 5,117,717,088 (9)
.abstracting: (1<=p66)
states: 58,350,505,408 (10)
abstracting: (1<=p1)
states: 190,885,280,024 (11)
.abstracting: (p35<=0)
states: 1,207,234,581,197 (12)
abstracting: (p1<=0)
states: 1,049,009,215,269 (12)
abstracting: (p22<=0)
states: 12,072,738,456 (10)
abstracting: (p4<=0)
states: 1,239,894,495,290 (12)
...............................MC time: 0m48.002sec

checking: AG [EF [[EG [[1<=p1 & 1<=p66]] | [[1<=p2 & 1<=p55] | [[1<=p19 & 1<=p22] & [1<=p1 & 1<=p57]]]]]]
normalized: ~ [E [true U ~ [E [true U [EG [[1<=p1 & 1<=p66]] | [[[1<=p1 & 1<=p57] & [1<=p19 & 1<=p22]] | [1<=p2 & 1<=p55]]]]]]]

abstracting: (1<=p55)
states: 72,692,025,984 (10)
abstracting: (1<=p2)
states: 180,531,434,356 (11)
abstracting: (1<=p22)
states: 1,227,821,756,837 (12)
abstracting: (1<=p19)
states: 9,184,084,800 (9)
abstracting: (1<=p57)
states: 58,350,505,408 (10)
abstracting: (1<=p1)
states: 190,885,280,024 (11)
abstracting: (1<=p66)
states: 58,350,505,408 (10)
abstracting: (1<=p1)
states: 190,885,280,024 (11)
............................................................................................................................
EG iterations: 124
MC time: 0m45.179sec

checking: EG [E [~ [[[AG [[1<=p1 & 1<=p54]] & [EG [[1<=p1 & 1<=p25]] | EG [[1<=p1 & 1<=p24]]]] | AX [AG [[1<=p4 & 1<=p22]]]]] U [1<=p1 & 1<=p66]]]
normalized: EG [E [~ [[[~ [E [true U ~ [[1<=p1 & 1<=p54]]]] & [EG [[1<=p1 & 1<=p24]] | EG [[1<=p1 & 1<=p25]]]] | ~ [EX [E [true U ~ [[1<=p4 & 1<=p22]]]]]]] U [1<=p1 & 1<=p66]]]

abstracting: (1<=p66)
states: 58,350,505,408 (10)
abstracting: (1<=p1)
states: 190,885,280,024 (11)
abstracting: (1<=p22)
states: 1,227,821,756,837 (12)
abstracting: (1<=p4)
states: 3
.abstracting: (1<=p25)
states: 8
abstracting: (1<=p1)
states: 190,885,280,024 (11)
....
EG iterations: 4
abstracting: (1<=p24)
states: 2
abstracting: (1<=p1)
states: 190,885,280,024 (11)
..
EG iterations: 2
abstracting: (1<=p54)
states: 351,459,706,523 (11)
abstracting: (1<=p1)
states: 190,885,280,024 (11)
MC time: 0m42.126sec

checking: AG [[EX [[1<=p1 & 1<=p66]] | AF [EG [[[[1<=p1 & 1<=p49] | [1<=p1 & 1<=p29]] & E [[1<=p6 & 1<=p22] U [1<=p1 & 1<=p33]]]]]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [EG [[E [[1<=p6 & 1<=p22] U [1<=p1 & 1<=p33]] & [[1<=p1 & 1<=p29] | [1<=p1 & 1<=p49]]]]]]] | EX [[1<=p1 & 1<=p66]]]]]]

abstracting: (1<=p66)
states: 58,350,505,408 (10)
abstracting: (1<=p1)
states: 190,885,280,024 (11)
.abstracting: (1<=p49)
states: 351,459,706,468 (11)
abstracting: (1<=p1)
states: 190,885,280,024 (11)
abstracting: (1<=p29)
states: 22
abstracting: (1<=p1)
states: 190,885,280,024 (11)
abstracting: (1<=p33)
states: 29,982,231,312 (10)
abstracting: (1<=p1)
states: 190,885,280,024 (11)
abstracting: (1<=p22)
states: 1,227,821,756,837 (12)
abstracting: (1<=p6)
states: 5,117,717,088 (9)
...........................................................................................................................
EG iterations: 123

EG iterations: 0
-> the formula is FALSE

FORMULA SieveSingleMsgMbox-PT-d0m64-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m34.010sec

checking: A [EF [~ [AX [[~ [[1<=p1 & 1<=p66]] & AX [[1<=p19 & 1<=p22]]]]]] U [AG [AX [[[[1<=p1 & 1<=p36] & [1<=p10 & 1<=p22]] | [1<=p6 & 1<=p22]]]] | [EG [[AX [[1<=p1 & 1<=p66]] | [1<=p6 & 1<=p22]]] & EX [EG [[1<=p8 & 1<=p22]]]]]]
normalized: [~ [EG [~ [[[EX [EG [[1<=p8 & 1<=p22]]] & EG [[[1<=p6 & 1<=p22] | ~ [EX [~ [[1<=p1 & 1<=p66]]]]]]] | ~ [E [true U EX [~ [[[1<=p6 & 1<=p22] | [[1<=p10 & 1<=p22] & [1<=p1 & 1<=p36]]]]]]]]]]] & ~ [E [~ [[[EX [EG [[1<=p8 & 1<=p22]]] & EG [[[1<=p6 & 1<=p22] | ~ [EX [~ [[1<=p1 & 1<=p66]]]]]]] | ~ [E [true U EX [~ [[[1<=p6 & 1<=p22] | [[1<=p10 & 1<=p22] & [1<=p1 & 1<=p36]]]]]]]]] U [~ [E [true U EX [~ [[~ [EX [~ [[1<=p19 & 1<=p22]]]] & ~ [[1<=p1 & 1<=p66]]]]]]] & ~ [[[EX [EG [[1<=p8 & 1<=p22]]] & EG [[[1<=p6 & 1<=p22] | ~ [EX [~ [[1<=p1 & 1<=p66]]]]]]] | ~ [E [true U EX [~ [[[1<=p6 & 1<=p22] | [[1<=p10 & 1<=p22] & [1<=p1 & 1<=p36]]]]]]]]]]]]]

abstracting: (1<=p36)
states: 412,706,685,344 (11)
abstracting: (1<=p1)
states: 190,885,280,024 (11)
abstracting: (1<=p22)
states: 1,227,821,756,837 (12)
abstracting: (1<=p10)
states: 5,701,266,054 (9)
abstracting: (1<=p22)
states: 1,227,821,756,837 (12)
abstracting: (1<=p6)
states: 5,117,717,088 (9)
.abstracting: (1<=p66)
states: 58,350,505,408 (10)
abstracting: (1<=p1)
states: 190,885,280,024 (11)
.abstracting: (1<=p22)
states: 1,227,821,756,837 (12)
abstracting: (1<=p6)
states: 5,117,717,088 (9)
.MC time: 0m39.588sec

checking: AG [E [[A [~ [[1<=p17 & 1<=p52]] U EF [[1<=p1 & 1<=p53]]] | [~ [[1<=p1 & 1<=p44]] | [1<=p21 & 1<=p65]]] U EG [[EX [[1<=p2 & 1<=p39]] & [[[1<=p1 & 1<=p26] | [1<=p1 & 1<=p66]] | [[1<=p1 & 1<=p54] | [1<=p1 & 1<=p49]]]]]]]
normalized: ~ [E [true U ~ [E [[[[1<=p21 & 1<=p65] | ~ [[1<=p1 & 1<=p44]]] | [~ [EG [~ [E [true U [1<=p1 & 1<=p53]]]]] & ~ [E [~ [E [true U [1<=p1 & 1<=p53]]] U [[1<=p17 & 1<=p52] & ~ [E [true U [1<=p1 & 1<=p53]]]]]]]] U EG [[[[[1<=p1 & 1<=p49] | [1<=p1 & 1<=p54]] | [[1<=p1 & 1<=p66] | [1<=p1 & 1<=p26]]] & EX [[1<=p2 & 1<=p39]]]]]]]]

abstracting: (1<=p39)
states: 69,682,395,002 (10)
abstracting: (1<=p2)
states: 180,531,434,356 (11)
.abstracting: (1<=p26)
states: 8
abstracting: (1<=p1)
states: 190,885,280,024 (11)
abstracting: (1<=p66)
states: 58,350,505,408 (10)
abstracting: (1<=p1)
states: 190,885,280,024 (11)
abstracting: (1<=p54)
states: 351,459,706,523 (11)
abstracting: (1<=p1)
states: 190,885,280,024 (11)
abstracting: (1<=p49)
states: 351,459,706,468 (11)
abstracting: (1<=p1)
states: 190,885,280,024 (11)
.............................................MC time: 0m36.025sec

checking: EX [AG [[A [[1<=p1 & 1<=p23] U [[[1<=p1 & 1<=p30] & [1<=p1 & 1<=p61]] | EF [[1<=p10 & 1<=p22]]]] | [A [~ [[1<=p2 & 1<=p55]] U A [[1<=p1 & 1<=p43] U [1<=p1 & 1<=p28]]] & [[p4<=0 | p22<=0] & [p16<=0 | p22<=0]]]]]]
normalized: EX [~ [E [true U ~ [[[[[p16<=0 | p22<=0] & [p4<=0 | p22<=0]] & [~ [EG [~ [[~ [EG [~ [[1<=p1 & 1<=p28]]]] & ~ [E [~ [[1<=p1 & 1<=p28]] U [~ [[1<=p1 & 1<=p43]] & ~ [[1<=p1 & 1<=p28]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[1<=p1 & 1<=p28]]]] & ~ [E [~ [[1<=p1 & 1<=p28]] U [~ [[1<=p1 & 1<=p43]] & ~ [[1<=p1 & 1<=p28]]]]]]] U [[1<=p2 & 1<=p55] & ~ [[~ [EG [~ [[1<=p1 & 1<=p28]]]] & ~ [E [~ [[1<=p1 & 1<=p28]] U [~ [[1<=p1 & 1<=p43]] & ~ [[1<=p1 & 1<=p28]]]]]]]]]]]] | [~ [EG [~ [[E [true U [1<=p10 & 1<=p22]] | [[1<=p1 & 1<=p61] & [1<=p1 & 1<=p30]]]]]] & ~ [E [~ [[E [true U [1<=p10 & 1<=p22]] | [[1<=p1 & 1<=p61] & [1<=p1 & 1<=p30]]]] U [~ [[1<=p1 & 1<=p23]] & ~ [[E [true U [1<=p10 & 1<=p22]] | [[1<=p1 & 1<=p61] & [1<=p1 & 1<=p30]]]]]]]]]]]]]

abstracting: (1<=p30)
states: 572,221,058,238 (11)
abstracting: (1<=p1)
states: 190,885,280,024 (11)
abstracting: (1<=p61)
states: 1,112,003,748,832 (12)
abstracting: (1<=p1)
states: 190,885,280,024 (11)
abstracting: (1<=p22)
states: 1,227,821,756,837 (12)
abstracting: (1<=p10)
states: 5,701,266,054 (9)
MC time: 0m32.998sec

checking: EX [[EF [EG [[p1<=0 | p43<=0]]] & [AG [E [EF [[1<=p1 & 1<=p48]] U AX [[1<=p1 & 1<=p64]]]] & [[AF [[p1<=0 | p51<=0]] | [AF [[1<=p1 & 1<=p37]] & [[1<=p18 & 1<=p22] | [1<=p1 & 1<=p38]]]] | [[1<=p1 & 1<=p54] | [[p1<=0 | p48<=0] & [p1<=0 | p62<=0]]]]]]]
normalized: EX [[[[[[[p1<=0 | p62<=0] & [p1<=0 | p48<=0]] | [1<=p1 & 1<=p54]] | [[[[1<=p1 & 1<=p38] | [1<=p18 & 1<=p22]] & ~ [EG [~ [[1<=p1 & 1<=p37]]]]] | ~ [EG [~ [[p1<=0 | p51<=0]]]]]] & ~ [E [true U ~ [E [E [true U [1<=p1 & 1<=p48]] U ~ [EX [~ [[1<=p1 & 1<=p64]]]]]]]]] & E [true U EG [[p1<=0 | p43<=0]]]]]

abstracting: (p43<=0)
states: 1,207,234,581,197 (12)
abstracting: (p1<=0)
states: 1,049,009,215,269 (12)
..
EG iterations: 2
abstracting: (1<=p64)
states: 58,350,505,408 (10)
abstracting: (1<=p1)
states: 190,885,280,024 (11)
.abstracting: (1<=p48)
states: 32,846,156,163 (10)
abstracting: (1<=p1)
states: 190,885,280,024 (11)
MC time: 0m31.012sec

checking: EG [E [[EX [E [[1<=p16 & 1<=p22] U [1<=p1 & 1<=p51]]] | [EF [~ [[1<=p15 & 1<=p22]]] | [AG [[1<=p1 & 1<=p35]] & EG [[1<=p1 & 1<=p53]]]]] U [[1<=p16 & 1<=p22] | [~ [[[1<=p1 & 1<=p51] | [1<=p1 & 1<=p59]]] & [AX [[1<=p1 & 1<=p26]] | A [[1<=p1 & 1<=p28] U [1<=p1 & 1<=p24]]]]]]]
normalized: EG [E [[[[EG [[1<=p1 & 1<=p53]] & ~ [E [true U ~ [[1<=p1 & 1<=p35]]]]] | E [true U ~ [[1<=p15 & 1<=p22]]]] | EX [E [[1<=p16 & 1<=p22] U [1<=p1 & 1<=p51]]]] U [[[[~ [EG [~ [[1<=p1 & 1<=p24]]]] & ~ [E [~ [[1<=p1 & 1<=p24]] U [~ [[1<=p1 & 1<=p28]] & ~ [[1<=p1 & 1<=p24]]]]]] | ~ [EX [~ [[1<=p1 & 1<=p26]]]]] & ~ [[[1<=p1 & 1<=p59] | [1<=p1 & 1<=p51]]]] | [1<=p16 & 1<=p22]]]]

abstracting: (1<=p22)
states: 1,227,821,756,837 (12)
abstracting: (1<=p16)
states: 9,184,084,800 (9)
abstracting: (1<=p51)
states: 19,419,507,456 (10)
abstracting: (1<=p1)
states: 190,885,280,024 (11)
abstracting: (1<=p59)
states: 58,350,505,408 (10)
abstracting: (1<=p1)
states: 190,885,280,024 (11)
abstracting: (1<=p26)
states: 8
abstracting: (1<=p1)
states: 190,885,280,024 (11)
.abstracting: (1<=p24)
states: 2
abstracting: (1<=p1)
states: 190,885,280,024 (11)
abstracting: (1<=p28)
states: 1,210,916,372 (9)
abstracting: (1<=p1)
states: 190,885,280,024 (11)
abstracting: (1<=p24)
states: 2
abstracting: (1<=p1)
states: 190,885,280,024 (11)
abstracting: (1<=p24)
states: 2
abstracting: (1<=p1)
states: 190,885,280,024 (11)
.
EG iterations: 1
abstracting: (1<=p51)
states: 19,419,507,456 (10)
abstracting: (1<=p1)
states: 190,885,280,024 (11)
abstracting: (1<=p22)
states: 1,227,821,756,837 (12)
abstracting: (1<=p16)
states: 9,184,084,800 (9)
.abstracting: (1<=p22)
states: 1,227,821,756,837 (12)
abstracting: (1<=p15)
states: 9,184,084,800 (9)
abstracting: (1<=p35)
states: 32,659,914,096 (10)
abstracting: (1<=p1)
states: 190,885,280,024 (11)
abstracting: (1<=p53)
states: 19,419,507,456 (10)
abstracting: (1<=p1)
states: 190,885,280,024 (11)
.......MC time: 0m28.011sec

checking: [EF [[AX [EG [AG [[1<=p1 & 1<=p28]]]] & AG [[1<=p1 & 1<=p57]]]] & AF [[[[p1<=0 | p22<=0] & [~ [E [[1<=p1 & 1<=p66] U [1<=p1 & 1<=p25]]] & EF [[[p1<=0 | p66<=0] & [p1<=0 | p60<=0]]]]] | ~ [A [~ [[1<=p1 & 1<=p63]] U [EG [[1<=p1 & 1<=p38]] & E [[1<=p1 & 1<=p24] U [1<=p1 & 1<=p66]]]]]]]]
normalized: [~ [EG [~ [[~ [[~ [EG [~ [[E [[1<=p1 & 1<=p24] U [1<=p1 & 1<=p66]] & EG [[1<=p1 & 1<=p38]]]]]] & ~ [E [~ [[E [[1<=p1 & 1<=p24] U [1<=p1 & 1<=p66]] & EG [[1<=p1 & 1<=p38]]]] U [~ [[E [[1<=p1 & 1<=p24] U [1<=p1 & 1<=p66]] & EG [[1<=p1 & 1<=p38]]]] & [1<=p1 & 1<=p63]]]]]] | [[E [true U [[p1<=0 | p60<=0] & [p1<=0 | p66<=0]]] & ~ [E [[1<=p1 & 1<=p66] U [1<=p1 & 1<=p25]]]] & [p1<=0 | p22<=0]]]]]] & E [true U [~ [E [true U ~ [[1<=p1 & 1<=p57]]]] & ~ [EX [~ [EG [~ [E [true U ~ [[1<=p1 & 1<=p28]]]]]]]]]]]

abstracting: (1<=p28)
states: 1,210,916,372 (9)
abstracting: (1<=p1)
states: 190,885,280,024 (11)
.
EG iterations: 1
.abstracting: (1<=p57)
states: 58,350,505,408 (10)
abstracting: (1<=p1)
states: 190,885,280,024 (11)
abstracting: (p22<=0)
states: 12,072,738,456 (10)
abstracting: (p1<=0)
states: 1,049,009,215,269 (12)
abstracting: (1<=p25)
states: 8
abstracting: (1<=p1)
states: 190,885,280,024 (11)
abstracting: (1<=p66)
states: 58,350,505,408 (10)
abstracting: (1<=p1)
states: 190,885,280,024 (11)
abstracting: (p66<=0)
states: 1,181,543,989,885 (12)
abstracting: (p1<=0)
states: 1,049,009,215,269 (12)
abstracting: (p60<=0)
states: 1,181,543,989,885 (12)
abstracting: (p1<=0)
states: 1,049,009,215,269 (12)
abstracting: (1<=p63)
states: 58,350,505,408 (10)
abstracting: (1<=p1)
states: 190,885,280,024 (11)
abstracting: (1<=p38)
states: 32,846,156,163 (10)
abstracting: (1<=p1)
states: 190,885,280,024 (11)
.............MC time: 0m26.359sec

checking: A [[~ [[1<=p1 & 1<=p25]] & [AG [~ [AF [[1<=p1 & 1<=p57]]]] | [AF [[1<=p1 & 1<=p51]] | [EX [EF [[1<=p1 & 1<=p45]]] & EF [[A [[1<=p2 & 1<=p55] U [1<=p1 & 1<=p24]] & [1<=p1 & 1<=p42]]]]]]] U ~ [EF [[~ [[1<=p1 & 1<=p66]] & [[~ [[1<=p1 & 1<=p66]] | AF [[1<=p1 & 1<=p61]]] & EG [[[1<=p7 & 1<=p22] | [1<=p6 & 1<=p22]]]]]]]]
normalized: [~ [EG [E [true U [[EG [[[1<=p6 & 1<=p22] | [1<=p7 & 1<=p22]]] & [~ [EG [~ [[1<=p1 & 1<=p61]]]] | ~ [[1<=p1 & 1<=p66]]]] & ~ [[1<=p1 & 1<=p66]]]]]] & ~ [E [E [true U [[EG [[[1<=p6 & 1<=p22] | [1<=p7 & 1<=p22]]] & [~ [EG [~ [[1<=p1 & 1<=p61]]]] | ~ [[1<=p1 & 1<=p66]]]] & ~ [[1<=p1 & 1<=p66]]]] U [~ [[[[[E [true U [[1<=p1 & 1<=p42] & [~ [EG [~ [[1<=p1 & 1<=p24]]]] & ~ [E [~ [[1<=p1 & 1<=p24]] U [~ [[1<=p2 & 1<=p55]] & ~ [[1<=p1 & 1<=p24]]]]]]]] & EX [E [true U [1<=p1 & 1<=p45]]]] | ~ [EG [~ [[1<=p1 & 1<=p51]]]]] | ~ [E [true U ~ [EG [~ [[1<=p1 & 1<=p57]]]]]]] & ~ [[1<=p1 & 1<=p25]]]] & E [true U [[EG [[[1<=p6 & 1<=p22] | [1<=p7 & 1<=p22]]] & [~ [EG [~ [[1<=p1 & 1<=p61]]]] | ~ [[1<=p1 & 1<=p66]]]] & ~ [[1<=p1 & 1<=p66]]]]]]]]

abstracting: (1<=p66)
states: 58,350,505,408 (10)
abstracting: (1<=p1)
states: 190,885,280,024 (11)
abstracting: (1<=p66)
states: 58,350,505,408 (10)
abstracting: (1<=p1)
states: 190,885,280,024 (11)
abstracting: (1<=p61)
states: 1,112,003,748,832 (12)
abstracting: (1<=p1)
states: 190,885,280,024 (11)
MC time: 0m24.745sec

checking: A [[AX [[1<=p7 & 1<=p22]] | [1<=p2 & 1<=p39]] U EF [AG [~ [[1<=p1 & 1<=p57]]]]]
normalized: [~ [EG [~ [E [true U ~ [E [true U [1<=p1 & 1<=p57]]]]]]] & ~ [E [~ [E [true U ~ [E [true U [1<=p1 & 1<=p57]]]]] U [~ [[[1<=p2 & 1<=p39] | ~ [EX [~ [[1<=p7 & 1<=p22]]]]]] & ~ [E [true U ~ [E [true U [1<=p1 & 1<=p57]]]]]]]]]

abstracting: (1<=p57)
states: 58,350,505,408 (10)
abstracting: (1<=p1)
states: 190,885,280,024 (11)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393356 kB
MemFree: 158952 kB
After kill :
MemTotal: 16393356 kB
MemFree: 16310260 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 CTLFireability -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

637254 682454 1338516 1372004 1004784 750986 632648
iterations count:738724 (10260), effective:42124 (585)

initing FirstDep: 0m 0.000sec


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

iterations count:4441 (61), effective:130 (1)

sat_reach.icc:155: Timeout: after 56 sec


sat_reach.icc:155: Timeout: after 52 sec


iterations count:168 (2), effective:7 (0)

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

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

sat_reach.icc:155: Timeout: after 51 sec


net_ddint.h:600: Timeout: after 47 sec


iterations count:4440 (61), effective:128 (1)

sat_reach.icc:155: Timeout: after 44 sec


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

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

iterations count:5007 (69), effective:148 (2)

net_ddint.h:600: Timeout: after 41 sec


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

iterations count:207 (2), effective:6 (0)

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

ctl_mc.icc:221: Timeout: after 38 sec


ctl_mc.icc:221: Timeout: after 35 sec


sat_reach.icc:155: Timeout: after 32 sec


iterations count:208 (2), effective:6 (0)

sat_reach.icc:155: Timeout: after 30 sec


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

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

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

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

net_ddint.h:600: Timeout: after 27 sec


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

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

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

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

ctl_mc.icc:221: Timeout: after 25 sec


net_ddint.h:600: Timeout: after 23 sec


iterations count:4441 (61), effective:130 (1)

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-d0m64"
export BK_EXAMINATION="CTLFireability"
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-d0m64, 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 r426-tajo-167905978900386"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d0m64.tgz
mv SieveSingleMsgMbox-PT-d0m64 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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;