fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r106-tall-167814482400202
Last Updated
May 14, 2023

About the Execution of Marcie+red for DBSingleClientW-PT-d0m07

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9789.163 135490.00 143790.00 628.20 TFFTFTFFFTFTTFTT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r106-tall-167814482400202.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is DBSingleClientW-PT-d0m07, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814482400202
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 572K
-rw-r--r-- 1 mcc users 5.3K Feb 26 15:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 48K Feb 26 15:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 15:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 15:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Feb 25 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 15:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K Feb 26 15:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 15:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 103K Feb 26 15:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 119K Mar 5 18:22 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 DBSingleClientW-PT-d0m07-CTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d0m07-CTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d0m07-CTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d0m07-CTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d0m07-CTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d0m07-CTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d0m07-CTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d0m07-CTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d0m07-CTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d0m07-CTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d0m07-CTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d0m07-CTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d0m07-CTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d0m07-CTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d0m07-CTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d0m07-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678349616073

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=DBSingleClientW-PT-d0m07
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-09 08:13:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 08:13:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 08:13:37] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2023-03-09 08:13:37] [INFO ] Transformed 553 places.
[2023-03-09 08:13:37] [INFO ] Transformed 150 transitions.
[2023-03-09 08:13:37] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 118 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 8 ms.
Deduced a syphon composed of 444 places in 1 ms
Reduce places removed 444 places and 0 transitions.
Support contains 64 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 150/150 transitions.
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 102 transition count 139
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 99 transition count 136
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 99 transition count 136
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 98 transition count 135
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 98 transition count 135
Applied a total of 26 rules in 20 ms. Remains 98 /109 variables (removed 11) and now considering 135/150 (removed 15) transitions.
// Phase 1: matrix 135 rows 98 cols
[2023-03-09 08:13:37] [INFO ] Computed 2 place invariants in 11 ms
[2023-03-09 08:13:38] [INFO ] Implicit Places using invariants in 408 ms returned []
[2023-03-09 08:13:38] [INFO ] Invariant cache hit.
[2023-03-09 08:13:38] [INFO ] State equation strengthened by 61 read => feed constraints.
[2023-03-09 08:13:38] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 555 ms to find 0 implicit places.
[2023-03-09 08:13:38] [INFO ] Invariant cache hit.
[2023-03-09 08:13:38] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 98/109 places, 135/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 659 ms. Remains : 98/109 places, 135/150 transitions.
Support contains 64 out of 98 places after structural reductions.
[2023-03-09 08:13:38] [INFO ] Flatten gal took : 32 ms
[2023-03-09 08:13:38] [INFO ] Flatten gal took : 13 ms
[2023-03-09 08:13:38] [INFO ] Input system was already deterministic with 135 transitions.
Incomplete random walk after 10000 steps, including 2326 resets, run finished after 521 ms. (steps per millisecond=19 ) properties (out of 58) seen :22
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 36) seen :1
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 116 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 39 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 35) seen :1
Incomplete Best-First random walk after 1001 steps, including 49 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 49 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 53 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 102 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 95 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 34) seen :2
Incomplete Best-First random walk after 1000 steps, including 111 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 57 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 32) 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 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 102 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 104 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 57 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 99 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) 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 32) 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 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 59 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 36 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 106 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 89 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 200 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 32) seen :0
Running SMT prover for 32 properties.
[2023-03-09 08:13:39] [INFO ] Invariant cache hit.
[2023-03-09 08:13:39] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-09 08:13:39] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-09 08:13:39] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:31
[2023-03-09 08:13:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-09 08:13:39] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-09 08:13:40] [INFO ] After 352ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :27
[2023-03-09 08:13:40] [INFO ] State equation strengthened by 61 read => feed constraints.
[2023-03-09 08:13:40] [INFO ] After 381ms SMT Verify possible using 61 Read/Feed constraints in natural domain returned unsat :5 sat :27
[2023-03-09 08:13:41] [INFO ] After 876ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :27
Attempting to minimize the solution found.
Minimization took 427 ms.
[2023-03-09 08:13:41] [INFO ] After 1829ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :27
Fused 32 Parikh solutions to 27 different solutions.
Parikh walk visited 0 properties in 150 ms.
Support contains 34 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 135/135 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 88 transition count 117
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 88 transition count 117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 87 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 87 transition count 116
Applied a total of 22 rules in 15 ms. Remains 87 /98 variables (removed 11) and now considering 116/135 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 87/98 places, 116/135 transitions.
Incomplete random walk after 10000 steps, including 2322 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 60 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 49 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 61 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 49 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 37 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 98 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 91 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 79 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 107 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 88 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :1
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 91 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 105 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) 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 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 49 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 58 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 106 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) 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 26) seen :0
Finished probabilistic random walk after 4616 steps, run visited all 26 properties in 67 ms. (steps per millisecond=68 )
Probabilistic random walk after 4616 steps, saw 2241 distinct states, run finished after 67 ms. (steps per millisecond=68 ) properties seen :26
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
[2023-03-09 08:13:42] [INFO ] Flatten gal took : 9 ms
[2023-03-09 08:13:42] [INFO ] Flatten gal took : 9 ms
[2023-03-09 08:13:42] [INFO ] Input system was already deterministic with 135 transitions.
Computed a total of 6 stabilizing places and 18 stable transitions
Graph (complete) has 328 edges and 98 vertex of which 97 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 135/135 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 79 transition count 102
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 79 transition count 102
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 79 transition count 100
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 47 place count 72 transition count 93
Iterating global reduction 1 with 7 rules applied. Total rules applied 54 place count 72 transition count 93
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 56 place count 72 transition count 91
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 71 transition count 88
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 71 transition count 88
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 70 transition count 87
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 70 transition count 87
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 69 transition count 86
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 69 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 64 place count 69 transition count 84
Applied a total of 64 rules in 13 ms. Remains 69 /98 variables (removed 29) and now considering 84/135 (removed 51) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 69/98 places, 84/135 transitions.
[2023-03-09 08:13:42] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:13:42] [INFO ] Flatten gal took : 5 ms
[2023-03-09 08:13:42] [INFO ] Input system was already deterministic with 84 transitions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 135/135 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 81 transition count 106
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 81 transition count 106
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 81 transition count 104
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 42 place count 75 transition count 98
Iterating global reduction 1 with 6 rules applied. Total rules applied 48 place count 75 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 50 place count 75 transition count 96
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 52 place count 73 transition count 92
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 73 transition count 92
Applied a total of 54 rules in 8 ms. Remains 73 /98 variables (removed 25) and now considering 92/135 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 73/98 places, 92/135 transitions.
[2023-03-09 08:13:42] [INFO ] Flatten gal took : 5 ms
[2023-03-09 08:13:42] [INFO ] Flatten gal took : 6 ms
[2023-03-09 08:13:42] [INFO ] Input system was already deterministic with 92 transitions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 135/135 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 80 transition count 102
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 80 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 80 transition count 101
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 46 place count 71 transition count 92
Iterating global reduction 1 with 9 rules applied. Total rules applied 55 place count 71 transition count 92
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 56 place count 71 transition count 91
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 70 transition count 88
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 70 transition count 88
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 69 transition count 87
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 69 transition count 87
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 68 transition count 86
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 68 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 64 place count 68 transition count 84
Applied a total of 64 rules in 10 ms. Remains 68 /98 variables (removed 30) and now considering 84/135 (removed 51) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 68/98 places, 84/135 transitions.
[2023-03-09 08:13:42] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:13:42] [INFO ] Flatten gal took : 5 ms
[2023-03-09 08:13:42] [INFO ] Input system was already deterministic with 84 transitions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 135/135 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 79 transition count 98
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 79 transition count 98
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 46 place count 71 transition count 90
Iterating global reduction 0 with 8 rules applied. Total rules applied 54 place count 71 transition count 90
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 56 place count 71 transition count 88
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 58 place count 69 transition count 84
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 69 transition count 84
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 61 place count 68 transition count 82
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 68 transition count 82
Applied a total of 62 rules in 7 ms. Remains 68 /98 variables (removed 30) and now considering 82/135 (removed 53) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 68/98 places, 82/135 transitions.
[2023-03-09 08:13:42] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:13:42] [INFO ] Flatten gal took : 5 ms
[2023-03-09 08:13:42] [INFO ] Input system was already deterministic with 82 transitions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 135/135 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 77 transition count 96
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 77 transition count 96
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 77 transition count 94
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 52 place count 69 transition count 86
Iterating global reduction 1 with 8 rules applied. Total rules applied 60 place count 69 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 62 place count 69 transition count 84
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 64 place count 67 transition count 81
Iterating global reduction 2 with 2 rules applied. Total rules applied 66 place count 67 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 67 place count 67 transition count 80
Applied a total of 67 rules in 5 ms. Remains 67 /98 variables (removed 31) and now considering 80/135 (removed 55) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 67/98 places, 80/135 transitions.
[2023-03-09 08:13:42] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:13:42] [INFO ] Flatten gal took : 5 ms
[2023-03-09 08:13:42] [INFO ] Input system was already deterministic with 80 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 98/98 places, 135/135 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 77 transition count 97
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 77 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 77 transition count 96
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 52 place count 68 transition count 87
Iterating global reduction 1 with 9 rules applied. Total rules applied 61 place count 68 transition count 87
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 63 place count 68 transition count 85
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 66 place count 65 transition count 79
Iterating global reduction 2 with 3 rules applied. Total rules applied 69 place count 65 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 65 transition count 78
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 72 place count 63 transition count 75
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 63 transition count 75
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 76 place count 61 transition count 73
Iterating global reduction 3 with 2 rules applied. Total rules applied 78 place count 61 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 80 place count 61 transition count 71
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 81 place count 60 transition count 70
Iterating global reduction 4 with 1 rules applied. Total rules applied 82 place count 60 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 84 place count 60 transition count 68
Applied a total of 84 rules in 17 ms. Remains 60 /98 variables (removed 38) and now considering 68/135 (removed 67) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 60/98 places, 68/135 transitions.
[2023-03-09 08:13:42] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:13:42] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:13:42] [INFO ] Input system was already deterministic with 68 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 98/98 places, 135/135 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 77 transition count 97
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 77 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 77 transition count 96
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 51 place count 69 transition count 88
Iterating global reduction 1 with 8 rules applied. Total rules applied 59 place count 69 transition count 88
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 61 place count 67 transition count 84
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 67 transition count 84
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 66 transition count 83
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 66 transition count 83
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 65 transition count 82
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 65 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 69 place count 65 transition count 80
Applied a total of 69 rules in 13 ms. Remains 65 /98 variables (removed 33) and now considering 80/135 (removed 55) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 65/98 places, 80/135 transitions.
[2023-03-09 08:13:42] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:13:42] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:13:42] [INFO ] Input system was already deterministic with 80 transitions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 135/135 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 78 transition count 98
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 78 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 78 transition count 97
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 49 place count 70 transition count 89
Iterating global reduction 1 with 8 rules applied. Total rules applied 57 place count 70 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 59 place count 70 transition count 87
Applied a total of 59 rules in 4 ms. Remains 70 /98 variables (removed 28) and now considering 87/135 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 70/98 places, 87/135 transitions.
[2023-03-09 08:13:42] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:13:42] [INFO ] Flatten gal took : 5 ms
[2023-03-09 08:13:42] [INFO ] Input system was already deterministic with 87 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 98/98 places, 135/135 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 77 transition count 99
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 77 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 77 transition count 98
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 53 place count 67 transition count 88
Iterating global reduction 1 with 10 rules applied. Total rules applied 63 place count 67 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 65 place count 67 transition count 86
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 67 place count 65 transition count 81
Iterating global reduction 2 with 2 rules applied. Total rules applied 69 place count 65 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 65 transition count 80
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 64 transition count 79
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 64 transition count 79
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 73 place count 63 transition count 78
Iterating global reduction 3 with 1 rules applied. Total rules applied 74 place count 63 transition count 78
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 76 place count 63 transition count 76
Applied a total of 76 rules in 14 ms. Remains 63 /98 variables (removed 35) and now considering 76/135 (removed 59) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 63/98 places, 76/135 transitions.
[2023-03-09 08:13:42] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:13:42] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:13:42] [INFO ] Input system was already deterministic with 76 transitions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 135/135 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 83 transition count 109
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 83 transition count 109
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 33 place count 83 transition count 106
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 81 transition count 104
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 81 transition count 104
Applied a total of 37 rules in 3 ms. Remains 81 /98 variables (removed 17) and now considering 104/135 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 81/98 places, 104/135 transitions.
[2023-03-09 08:13:42] [INFO ] Flatten gal took : 5 ms
[2023-03-09 08:13:42] [INFO ] Flatten gal took : 5 ms
[2023-03-09 08:13:42] [INFO ] Input system was already deterministic with 104 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 98/98 places, 135/135 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 77 transition count 97
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 77 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 77 transition count 96
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 52 place count 68 transition count 87
Iterating global reduction 1 with 9 rules applied. Total rules applied 61 place count 68 transition count 87
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 63 place count 68 transition count 85
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 65 place count 66 transition count 80
Iterating global reduction 2 with 2 rules applied. Total rules applied 67 place count 66 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 66 transition count 79
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 69 place count 65 transition count 78
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 place count 65 transition count 78
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 64 transition count 77
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 64 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 74 place count 64 transition count 75
Applied a total of 74 rules in 14 ms. Remains 64 /98 variables (removed 34) and now considering 75/135 (removed 60) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 64/98 places, 75/135 transitions.
[2023-03-09 08:13:42] [INFO ] Flatten gal took : 3 ms
[2023-03-09 08:13:42] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:13:42] [INFO ] Input system was already deterministic with 75 transitions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 135/135 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 78 transition count 101
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 78 transition count 101
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 50 place count 68 transition count 91
Iterating global reduction 0 with 10 rules applied. Total rules applied 60 place count 68 transition count 91
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 62 place count 68 transition count 89
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 65 place count 65 transition count 83
Iterating global reduction 1 with 3 rules applied. Total rules applied 68 place count 65 transition count 83
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 69 place count 65 transition count 82
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 71 place count 63 transition count 79
Iterating global reduction 2 with 2 rules applied. Total rules applied 73 place count 63 transition count 79
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 75 place count 61 transition count 77
Iterating global reduction 2 with 2 rules applied. Total rules applied 77 place count 61 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 79 place count 61 transition count 75
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 80 place count 60 transition count 74
Iterating global reduction 3 with 1 rules applied. Total rules applied 81 place count 60 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 83 place count 60 transition count 72
Applied a total of 83 rules in 6 ms. Remains 60 /98 variables (removed 38) and now considering 72/135 (removed 63) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 60/98 places, 72/135 transitions.
[2023-03-09 08:13:42] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:13:42] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:13:42] [INFO ] Input system was already deterministic with 72 transitions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 135/135 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 80 transition count 100
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 80 transition count 100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 80 transition count 99
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 46 place count 71 transition count 90
Iterating global reduction 1 with 9 rules applied. Total rules applied 55 place count 71 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 56 place count 71 transition count 89
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 70 transition count 87
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 70 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 59 place count 70 transition count 86
Applied a total of 59 rules in 3 ms. Remains 70 /98 variables (removed 28) and now considering 86/135 (removed 49) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 70/98 places, 86/135 transitions.
[2023-03-09 08:13:42] [INFO ] Flatten gal took : 3 ms
[2023-03-09 08:13:42] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:13:42] [INFO ] Input system was already deterministic with 86 transitions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 135/135 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 79 transition count 104
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 79 transition count 104
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 47 place count 70 transition count 95
Iterating global reduction 0 with 9 rules applied. Total rules applied 56 place count 70 transition count 95
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 70 transition count 93
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 60 place count 68 transition count 89
Iterating global reduction 1 with 2 rules applied. Total rules applied 62 place count 68 transition count 89
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 64 place count 66 transition count 86
Iterating global reduction 1 with 2 rules applied. Total rules applied 66 place count 66 transition count 86
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 67 place count 65 transition count 85
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 65 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 70 place count 65 transition count 83
Applied a total of 70 rules in 4 ms. Remains 65 /98 variables (removed 33) and now considering 83/135 (removed 52) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 65/98 places, 83/135 transitions.
[2023-03-09 08:13:42] [INFO ] Flatten gal took : 3 ms
[2023-03-09 08:13:42] [INFO ] Flatten gal took : 3 ms
[2023-03-09 08:13:42] [INFO ] Input system was already deterministic with 83 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 98/98 places, 135/135 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 78 transition count 98
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 78 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 78 transition count 97
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 50 place count 69 transition count 88
Iterating global reduction 1 with 9 rules applied. Total rules applied 59 place count 69 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 61 place count 69 transition count 86
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 64 place count 66 transition count 80
Iterating global reduction 2 with 3 rules applied. Total rules applied 67 place count 66 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 66 transition count 79
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 70 place count 64 transition count 76
Iterating global reduction 3 with 2 rules applied. Total rules applied 72 place count 64 transition count 76
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 74 place count 62 transition count 74
Iterating global reduction 3 with 2 rules applied. Total rules applied 76 place count 62 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 78 place count 62 transition count 72
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 79 place count 61 transition count 71
Iterating global reduction 4 with 1 rules applied. Total rules applied 80 place count 61 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 82 place count 61 transition count 69
Applied a total of 82 rules in 14 ms. Remains 61 /98 variables (removed 37) and now considering 69/135 (removed 66) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 61/98 places, 69/135 transitions.
[2023-03-09 08:13:42] [INFO ] Flatten gal took : 2 ms
[2023-03-09 08:13:42] [INFO ] Flatten gal took : 2 ms
[2023-03-09 08:13:42] [INFO ] Input system was already deterministic with 69 transitions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 135/135 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 80 transition count 106
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 80 transition count 106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 80 transition count 105
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 45 place count 72 transition count 97
Iterating global reduction 1 with 8 rules applied. Total rules applied 53 place count 72 transition count 97
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 70 transition count 92
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 70 transition count 92
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 58 place count 70 transition count 91
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 69 transition count 90
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 69 transition count 90
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 68 transition count 89
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 68 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 64 place count 68 transition count 87
Applied a total of 64 rules in 5 ms. Remains 68 /98 variables (removed 30) and now considering 87/135 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 68/98 places, 87/135 transitions.
[2023-03-09 08:13:42] [INFO ] Flatten gal took : 3 ms
[2023-03-09 08:13:42] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:13:42] [INFO ] Input system was already deterministic with 87 transitions.
[2023-03-09 08:13:42] [INFO ] Flatten gal took : 7 ms
[2023-03-09 08:13:42] [INFO ] Flatten gal took : 6 ms
[2023-03-09 08:13:42] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-09 08:13:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 98 places, 135 transitions and 528 arcs took 1 ms.
Total runtime 5142 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: 98 NrTr: 135 NrArc: 528)

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

net check time: 0m 0.000sec

init dd package: 0m 2.968sec


RS generation: 0m20.141sec


-> reachability set: #nodes 13910 (1.4e+04) #states 17,964,041 (7)



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

checking: AG [EF [[p1<=0 | p85<=0]]]
normalized: ~ [E [true U ~ [E [true U [p1<=0 | p85<=0]]]]]

abstracting: (p85<=0)
states: 15,912,691 (7)
abstracting: (p1<=0)
states: 14,833,658 (7)
-> the formula is TRUE

FORMULA DBSingleClientW-PT-d0m07-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.744sec

checking: EG [AX [EF [[EG [[1<=p34 & 1<=p60]] & AG [[1<=p1 & 1<=p81]]]]]]
normalized: EG [~ [EX [~ [E [true U [~ [E [true U ~ [[1<=p1 & 1<=p81]]]] & EG [[1<=p34 & 1<=p60]]]]]]]]

abstracting: (1<=p60)
states: 1,713,819 (6)
abstracting: (1<=p34)
states: 428,949 (5)
..
EG iterations: 2
abstracting: (1<=p81)
states: 342,644 (5)
abstracting: (1<=p1)
states: 3,130,383 (6)
..
EG iterations: 1
-> the formula is FALSE

FORMULA DBSingleClientW-PT-d0m07-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.057sec

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

abstracting: (1<=p54)
states: 1,425,566 (6)
abstracting: (1<=p1)
states: 3,130,383 (6)
abstracting: (1<=p92)
states: 2,047,696 (6)
abstracting: (1<=p1)
states: 3,130,383 (6)
-> the formula is FALSE

FORMULA DBSingleClientW-PT-d0m07-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.382sec

checking: AG [AF [[EG [AF [[p1<=0 | p85<=0]]] | EG [[1<=p1 & 1<=p45]]]]]
normalized: ~ [E [true U EG [~ [[EG [[1<=p1 & 1<=p45]] | EG [~ [EG [~ [[p1<=0 | p85<=0]]]]]]]]]]

abstracting: (p85<=0)
states: 15,912,691 (7)
abstracting: (p1<=0)
states: 14,833,658 (7)
...........
EG iterations: 11

EG iterations: 0
abstracting: (1<=p45)
states: 27,678 (4)
abstracting: (1<=p1)
states: 3,130,383 (6)
........
EG iterations: 8
.
EG iterations: 1
-> the formula is TRUE

FORMULA DBSingleClientW-PT-d0m07-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.651sec

checking: AF [[EG [AX [[[p1<=0 | p83<=0] & [p1<=0 | p85<=0]]]] & [p1<=0 | p94<=0]]]
normalized: ~ [EG [~ [[[p1<=0 | p94<=0] & EG [~ [EX [~ [[[p1<=0 | p85<=0] & [p1<=0 | p83<=0]]]]]]]]]]

abstracting: (p83<=0)
states: 17,621,397 (7)
abstracting: (p1<=0)
states: 14,833,658 (7)
abstracting: (p85<=0)
states: 15,912,691 (7)
abstracting: (p1<=0)
states: 14,833,658 (7)
...
EG iterations: 2
abstracting: (p94<=0)
states: 15,916,345 (7)
abstracting: (p1<=0)
states: 14,833,658 (7)
.......................
EG iterations: 23
-> the formula is TRUE

FORMULA DBSingleClientW-PT-d0m07-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.492sec

checking: EG [E [~ [EG [[~ [[1<=p14 & 1<=p51]] | AG [[1<=p1 & 1<=p41]]]]] U [1<=p1 & 1<=p62]]]
normalized: EG [E [~ [EG [[~ [E [true U ~ [[1<=p1 & 1<=p41]]]] | ~ [[1<=p14 & 1<=p51]]]]] U [1<=p1 & 1<=p62]]]

abstracting: (1<=p62)
states: 1,008,131 (6)
abstracting: (1<=p1)
states: 3,130,383 (6)
abstracting: (1<=p51)
states: 1,694,649 (6)
abstracting: (1<=p14)
states: 422,139 (5)
abstracting: (1<=p41)
states: 5,640,194 (6)
abstracting: (1<=p1)
states: 3,130,383 (6)
.
EG iterations: 1
............
EG iterations: 12
-> the formula is FALSE

FORMULA DBSingleClientW-PT-d0m07-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.487sec

checking: E [EX [~ [EX [[~ [[1<=p1 & 1<=p94]] & [[1<=p22 & 1<=p38] | [1<=p31 & 1<=p38]]]]]] U [1<=p35 & 1<=p52]]
normalized: E [EX [~ [EX [[[[1<=p31 & 1<=p38] | [1<=p22 & 1<=p38]] & ~ [[1<=p1 & 1<=p94]]]]]] U [1<=p35 & 1<=p52]]

abstracting: (1<=p52)
states: 1,694,649 (6)
abstracting: (1<=p35)
states: 428,949 (5)
abstracting: (1<=p94)
states: 2,047,696 (6)
abstracting: (1<=p1)
states: 3,130,383 (6)
abstracting: (1<=p38)
states: 9,249,861 (6)
abstracting: (1<=p22)
states: 608,106 (5)
abstracting: (1<=p38)
states: 9,249,861 (6)
abstracting: (1<=p31)
states: 67,074 (4)
..-> the formula is TRUE

FORMULA DBSingleClientW-PT-d0m07-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 8.761sec

checking: EF [[AX [[[1<=p21 & 1<=p38] | [[EF [[1<=p1 & 1<=p92]] | [p17<=0 | p56<=0]] & [1<=p7 & 1<=p63]]]] & EX [EF [EG [[p1<=0 | p97<=0]]]]]]
normalized: E [true U [EX [E [true U EG [[p1<=0 | p97<=0]]]] & ~ [EX [~ [[[[1<=p7 & 1<=p63] & [[p17<=0 | p56<=0] | E [true U [1<=p1 & 1<=p92]]]] | [1<=p21 & 1<=p38]]]]]]]

abstracting: (1<=p38)
states: 9,249,861 (6)
abstracting: (1<=p21)
states: 608,106 (5)
abstracting: (1<=p92)
states: 2,047,696 (6)
abstracting: (1<=p1)
states: 3,130,383 (6)
abstracting: (p56<=0)
states: 17,288,138 (7)
abstracting: (p17<=0)
states: 17,541,902 (7)
abstracting: (1<=p63)
states: 3,158,147 (6)
abstracting: (1<=p7)
states: 316,169 (5)
.abstracting: (p97<=0)
states: 16,007,750 (7)
abstracting: (p1<=0)
states: 14,833,658 (7)
...
EG iterations: 3
.-> the formula is FALSE

FORMULA DBSingleClientW-PT-d0m07-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.728sec

checking: EG [[EG [A [[~ [[1<=p17 & 1<=p56]] | [[1<=p1 & 1<=p47] | [1<=p1 & 1<=p93]]] U ~ [AF [[1<=p27 & 1<=p38]]]]] | [EG [[p1<=0 | p89<=0]] & EX [[p1<=0 | p76<=0]]]]]
normalized: EG [[[EX [[p1<=0 | p76<=0]] & EG [[p1<=0 | p89<=0]]] | EG [[~ [EG [~ [EG [~ [[1<=p27 & 1<=p38]]]]]] & ~ [E [~ [EG [~ [[1<=p27 & 1<=p38]]]] U [~ [[[[1<=p1 & 1<=p93] | [1<=p1 & 1<=p47]] | ~ [[1<=p17 & 1<=p56]]]] & ~ [EG [~ [[1<=p27 & 1<=p38]]]]]]]]]]]

abstracting: (1<=p38)
states: 9,249,861 (6)
abstracting: (1<=p27)
states: 608,106 (5)
.
EG iterations: 1
abstracting: (1<=p56)
states: 675,903 (5)
abstracting: (1<=p17)
states: 422,139 (5)
abstracting: (1<=p47)
states: 1,121,953 (6)
abstracting: (1<=p1)
states: 3,130,383 (6)
abstracting: (1<=p93)
states: 2,047,696 (6)
abstracting: (1<=p1)
states: 3,130,383 (6)
abstracting: (1<=p38)
states: 9,249,861 (6)
abstracting: (1<=p27)
states: 608,106 (5)
.
EG iterations: 1
abstracting: (1<=p38)
states: 9,249,861 (6)
abstracting: (1<=p27)
states: 608,106 (5)
.
EG iterations: 1
..
EG iterations: 2

EG iterations: 0
abstracting: (p89<=0)
states: 17,621,397 (7)
abstracting: (p1<=0)
states: 14,833,658 (7)
..
EG iterations: 2
abstracting: (p76<=0)
states: 16,007,750 (7)
abstracting: (p1<=0)
states: 14,833,658 (7)
.
EG iterations: 0
-> the formula is TRUE

FORMULA DBSingleClientW-PT-d0m07-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.196sec

checking: A [EX [0<=0] U EX [[E [AX [[1<=p1 & 1<=p61]] U [~ [[1<=p1 & 1<=p83]] | [[1<=p15 & 1<=p56] | [1<=p1 & 1<=p75]]]] & [AF [[1<=p1 & 1<=p85]] | [EX [[1<=p1 & 1<=p93]] | EG [[1<=p26 & 1<=p38]]]]]]]
normalized: [~ [EG [~ [EX [[[[EG [[1<=p26 & 1<=p38]] | EX [[1<=p1 & 1<=p93]]] | ~ [EG [~ [[1<=p1 & 1<=p85]]]]] & E [~ [EX [~ [[1<=p1 & 1<=p61]]]] U [[[1<=p1 & 1<=p75] | [1<=p15 & 1<=p56]] | ~ [[1<=p1 & 1<=p83]]]]]]]]] & ~ [E [~ [EX [[[[EG [[1<=p26 & 1<=p38]] | EX [[1<=p1 & 1<=p93]]] | ~ [EG [~ [[1<=p1 & 1<=p85]]]]] & E [~ [EX [~ [[1<=p1 & 1<=p61]]]] U [[[1<=p1 & 1<=p75] | [1<=p15 & 1<=p56]] | ~ [[1<=p1 & 1<=p83]]]]]]] U [~ [EX [0<=0]] & ~ [EX [[[[EG [[1<=p26 & 1<=p38]] | EX [[1<=p1 & 1<=p93]]] | ~ [EG [~ [[1<=p1 & 1<=p85]]]]] & E [~ [EX [~ [[1<=p1 & 1<=p61]]]] U [[[1<=p1 & 1<=p75] | [1<=p15 & 1<=p56]] | ~ [[1<=p1 & 1<=p83]]]]]]]]]]]

abstracting: (1<=p83)
states: 342,644 (5)
abstracting: (1<=p1)
states: 3,130,383 (6)
abstracting: (1<=p56)
states: 675,903 (5)
abstracting: (1<=p15)
states: 422,139 (5)
abstracting: (1<=p75)
states: 1,956,291 (6)
abstracting: (1<=p1)
states: 3,130,383 (6)
abstracting: (1<=p61)
states: 986,153 (5)
abstracting: (1<=p1)
states: 3,130,383 (6)
.abstracting: (1<=p85)
states: 2,051,350 (6)
abstracting: (1<=p1)
states: 3,130,383 (6)
..
EG iterations: 2
abstracting: (1<=p93)
states: 2,047,696 (6)
abstracting: (1<=p1)
states: 3,130,383 (6)
.abstracting: (1<=p38)
states: 9,249,861 (6)
abstracting: (1<=p26)
states: 608,106 (5)
..
EG iterations: 2
.abstracting: (0<=0)
states: 17,964,041 (7)
.abstracting: (1<=p83)
states: 342,644 (5)
abstracting: (1<=p1)
states: 3,130,383 (6)
abstracting: (1<=p56)
states: 675,903 (5)
abstracting: (1<=p15)
states: 422,139 (5)
abstracting: (1<=p75)
states: 1,956,291 (6)
abstracting: (1<=p1)
states: 3,130,383 (6)
abstracting: (1<=p61)
states: 986,153 (5)
abstracting: (1<=p1)
states: 3,130,383 (6)
.abstracting: (1<=p85)
states: 2,051,350 (6)
abstracting: (1<=p1)
states: 3,130,383 (6)
..
EG iterations: 2
abstracting: (1<=p93)
states: 2,047,696 (6)
abstracting: (1<=p1)
states: 3,130,383 (6)
.abstracting: (1<=p38)
states: 9,249,861 (6)
abstracting: (1<=p26)
states: 608,106 (5)
..
EG iterations: 2
.abstracting: (1<=p83)
states: 342,644 (5)
abstracting: (1<=p1)
states: 3,130,383 (6)
abstracting: (1<=p56)
states: 675,903 (5)
abstracting: (1<=p15)
states: 422,139 (5)
abstracting: (1<=p75)
states: 1,956,291 (6)
abstracting: (1<=p1)
states: 3,130,383 (6)
abstracting: (1<=p61)
states: 986,153 (5)
abstracting: (1<=p1)
states: 3,130,383 (6)
.abstracting: (1<=p85)
states: 2,051,350 (6)
abstracting: (1<=p1)
states: 3,130,383 (6)
..
EG iterations: 2
abstracting: (1<=p93)
states: 2,047,696 (6)
abstracting: (1<=p1)
states: 3,130,383 (6)
.abstracting: (1<=p38)
states: 9,249,861 (6)
abstracting: (1<=p26)
states: 608,106 (5)
..
EG iterations: 2
...
EG iterations: 2
-> the formula is FALSE

FORMULA DBSingleClientW-PT-d0m07-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m10.595sec

checking: AF [[[AG [EF [[p1<=0 | p54<=0]]] & 1<=p12] & [1<=p68 & [[1<=p1 & 1<=p74] | [AG [[1<=p1 & 1<=p73]] & [E [[1<=p16 & 1<=p51] U [1<=p1 & 1<=p48]] | [1<=p1 & 1<=p79]]]]]]]
normalized: ~ [EG [~ [[[1<=p68 & [[[[1<=p1 & 1<=p79] | E [[1<=p16 & 1<=p51] U [1<=p1 & 1<=p48]]] & ~ [E [true U ~ [[1<=p1 & 1<=p73]]]]] | [1<=p1 & 1<=p74]]] & [1<=p12 & ~ [E [true U ~ [E [true U [p1<=0 | p54<=0]]]]]]]]]]

abstracting: (p54<=0)
states: 16,538,475 (7)
abstracting: (p1<=0)
states: 14,833,658 (7)
abstracting: (1<=p12)
states: 313,899 (5)
abstracting: (1<=p74)
states: 2,913,217 (6)
abstracting: (1<=p1)
states: 3,130,383 (6)
abstracting: (1<=p73)
states: 1,939,819 (6)
abstracting: (1<=p1)
states: 3,130,383 (6)
abstracting: (1<=p48)
states: 1,333,960 (6)
abstracting: (1<=p1)
states: 3,130,383 (6)
abstracting: (1<=p51)
states: 1,694,649 (6)
abstracting: (1<=p16)
states: 422,139 (5)
abstracting: (1<=p79)
states: 2,110,104 (6)
abstracting: (1<=p1)
states: 3,130,383 (6)
abstracting: (1<=p68)
states: 475,220 (5)

EG iterations: 0
-> the formula is FALSE

FORMULA DBSingleClientW-PT-d0m07-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.524sec

checking: AG [[A [[~ [[AG [[1<=p1 & 1<=p58]] & [1<=p7 & 1<=p63]]] | EG [[1<=p1 & 1<=p80]]] U [1<=p30 & 1<=p38]] | E [EG [[EX [[1<=p1 & 1<=p62]] & [1<=p1 & 1<=p57]]] U [EX [[1<=p1 & 1<=p73]] & AF [~ [[1<=p14 & 1<=p51]]]]]]]
normalized: ~ [E [true U ~ [[E [EG [[[1<=p1 & 1<=p57] & EX [[1<=p1 & 1<=p62]]]] U [~ [EG [[1<=p14 & 1<=p51]]] & EX [[1<=p1 & 1<=p73]]]] | [~ [EG [~ [[1<=p30 & 1<=p38]]]] & ~ [E [~ [[1<=p30 & 1<=p38]] U [~ [[EG [[1<=p1 & 1<=p80]] | ~ [[[1<=p7 & 1<=p63] & ~ [E [true U ~ [[1<=p1 & 1<=p58]]]]]]]] & ~ [[1<=p30 & 1<=p38]]]]]]]]]]

abstracting: (1<=p38)
states: 9,249,861 (6)
abstracting: (1<=p30)
states: 67,074 (4)
abstracting: (1<=p58)
states: 1,117,342 (6)
abstracting: (1<=p1)
states: 3,130,383 (6)
abstracting: (1<=p63)
states: 3,158,147 (6)
abstracting: (1<=p7)
states: 316,169 (5)
abstracting: (1<=p80)
states: 342,644 (5)
abstracting: (1<=p1)
states: 3,130,383 (6)
...........
EG iterations: 11
abstracting: (1<=p38)
states: 9,249,861 (6)
abstracting: (1<=p30)
states: 67,074 (4)
abstracting: (1<=p38)
states: 9,249,861 (6)
abstracting: (1<=p30)
states: 67,074 (4)
.
EG iterations: 1
abstracting: (1<=p73)
states: 1,939,819 (6)
abstracting: (1<=p1)
states: 3,130,383 (6)
.abstracting: (1<=p51)
states: 1,694,649 (6)
abstracting: (1<=p14)
states: 422,139 (5)
..
EG iterations: 2
abstracting: (1<=p62)
states: 1,008,131 (6)
abstracting: (1<=p1)
states: 3,130,383 (6)
.abstracting: (1<=p57)
states: 885,243 (5)
abstracting: (1<=p1)
states: 3,130,383 (6)
.
EG iterations: 1
-> the formula is FALSE

FORMULA DBSingleClientW-PT-d0m07-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.085sec

checking: A [[~ [[[1<=p1 & 1<=p62] | EG [EF [[1<=p1 & 1<=p53]]]]] & [1<=p4 & 1<=p38]] U [E [[~ [AF [[1<=p1 & 1<=p77]]] | AX [[1<=p1 & 1<=p38]]] U [EF [[[1<=p1 & 1<=p90] | [1<=p1 & 1<=p80]]] | ~ [AF [[1<=p1 & 1<=p90]]]]] | [1<=p1 & 1<=p62]]]
normalized: [~ [EG [~ [[[1<=p1 & 1<=p62] | E [[~ [EX [~ [[1<=p1 & 1<=p38]]]] | EG [~ [[1<=p1 & 1<=p77]]]] U [E [true U [[1<=p1 & 1<=p80] | [1<=p1 & 1<=p90]]] | EG [~ [[1<=p1 & 1<=p90]]]]]]]]] & ~ [E [~ [[[1<=p1 & 1<=p62] | E [[~ [EX [~ [[1<=p1 & 1<=p38]]]] | EG [~ [[1<=p1 & 1<=p77]]]] U [E [true U [[1<=p1 & 1<=p80] | [1<=p1 & 1<=p90]]] | EG [~ [[1<=p1 & 1<=p90]]]]]]] U [~ [[~ [[EG [E [true U [1<=p1 & 1<=p53]]] | [1<=p1 & 1<=p62]]] & [1<=p4 & 1<=p38]]] & ~ [[[1<=p1 & 1<=p62] | E [[~ [EX [~ [[1<=p1 & 1<=p38]]]] | EG [~ [[1<=p1 & 1<=p77]]]] U [E [true U [[1<=p1 & 1<=p80] | [1<=p1 & 1<=p90]]] | EG [~ [[1<=p1 & 1<=p90]]]]]]]]]]]

abstracting: (1<=p90)
states: 342,644 (5)
abstracting: (1<=p1)
states: 3,130,383 (6)
..
EG iterations: 2
abstracting: (1<=p90)
states: 342,644 (5)
abstracting: (1<=p1)
states: 3,130,383 (6)
abstracting: (1<=p80)
states: 342,644 (5)
abstracting: (1<=p1)
states: 3,130,383 (6)
abstracting: (1<=p77)
states: 2,913,217 (6)
abstracting: (1<=p1)
states: 3,130,383 (6)
..
EG iterations: 2
abstracting: (1<=p38)
states: 9,249,861 (6)
abstracting: (1<=p1)
states: 3,130,383 (6)
.abstracting: (1<=p62)
states: 1,008,131 (6)
abstracting: (1<=p1)
states: 3,130,383 (6)
abstracting: (1<=p38)
states: 9,249,861 (6)
abstracting: (1<=p4)
states: 1,043,461 (6)
abstracting: (1<=p62)
states: 1,008,131 (6)
abstracting: (1<=p1)
states: 3,130,383 (6)
abstracting: (1<=p53)
states: 1,425,566 (6)
abstracting: (1<=p1)
states: 3,130,383 (6)
..................
EG iterations: 18
abstracting: (1<=p90)
states: 342,644 (5)
abstracting: (1<=p1)
states: 3,130,383 (6)
..
EG iterations: 2
abstracting: (1<=p90)
states: 342,644 (5)
abstracting: (1<=p1)
states: 3,130,383 (6)
abstracting: (1<=p80)
states: 342,644 (5)
abstracting: (1<=p1)
states: 3,130,383 (6)
abstracting: (1<=p77)
states: 2,913,217 (6)
abstracting: (1<=p1)
states: 3,130,383 (6)
..
EG iterations: 2
abstracting: (1<=p38)
states: 9,249,861 (6)
abstracting: (1<=p1)
states: 3,130,383 (6)
.abstracting: (1<=p62)
states: 1,008,131 (6)
abstracting: (1<=p1)
states: 3,130,383 (6)
abstracting: (1<=p90)
states: 342,644 (5)
abstracting: (1<=p1)
states: 3,130,383 (6)
..
EG iterations: 2
abstracting: (1<=p90)
states: 342,644 (5)
abstracting: (1<=p1)
states: 3,130,383 (6)
abstracting: (1<=p80)
states: 342,644 (5)
abstracting: (1<=p1)
states: 3,130,383 (6)
abstracting: (1<=p77)
states: 2,913,217 (6)
abstracting: (1<=p1)
states: 3,130,383 (6)
..
EG iterations: 2
abstracting: (1<=p38)
states: 9,249,861 (6)
abstracting: (1<=p1)
states: 3,130,383 (6)
.abstracting: (1<=p62)
states: 1,008,131 (6)
abstracting: (1<=p1)
states: 3,130,383 (6)
.
EG iterations: 1
-> the formula is TRUE

FORMULA DBSingleClientW-PT-d0m07-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m10.692sec

checking: E [[E [[1<=p1 & 1<=p77] U A [EF [[1<=p1 & 1<=p77]] U [[1<=p1 & 1<=p78] | [1<=p22 & 1<=p38]]]] | ~ [A [[[1<=p1 & 1<=p61] | [1<=p1 & 1<=p92]] U [EX [[1<=p1 & 1<=p77]] & [1<=p1 & 1<=p47]]]]] U [1<=p1 & 1<=p53]]
normalized: E [[~ [[~ [EG [~ [[[1<=p1 & 1<=p47] & EX [[1<=p1 & 1<=p77]]]]]] & ~ [E [~ [[[1<=p1 & 1<=p47] & EX [[1<=p1 & 1<=p77]]]] U [~ [[[1<=p1 & 1<=p92] | [1<=p1 & 1<=p61]]] & ~ [[[1<=p1 & 1<=p47] & EX [[1<=p1 & 1<=p77]]]]]]]]] | E [[1<=p1 & 1<=p77] U [~ [EG [~ [[[1<=p22 & 1<=p38] | [1<=p1 & 1<=p78]]]]] & ~ [E [~ [[[1<=p22 & 1<=p38] | [1<=p1 & 1<=p78]]] U [~ [E [true U [1<=p1 & 1<=p77]]] & ~ [[[1<=p22 & 1<=p38] | [1<=p1 & 1<=p78]]]]]]]]] U [1<=p1 & 1<=p53]]

abstracting: (1<=p53)
states: 1,425,566 (6)
abstracting: (1<=p1)
states: 3,130,383 (6)
abstracting: (1<=p78)
states: 2,110,104 (6)
abstracting: (1<=p1)
states: 3,130,383 (6)
abstracting: (1<=p38)
states: 9,249,861 (6)
abstracting: (1<=p22)
states: 608,106 (5)
abstracting: (1<=p77)
states: 2,913,217 (6)
abstracting: (1<=p1)
states: 3,130,383 (6)
abstracting: (1<=p78)
states: 2,110,104 (6)
abstracting: (1<=p1)
states: 3,130,383 (6)
abstracting: (1<=p38)
states: 9,249,861 (6)
abstracting: (1<=p22)
states: 608,106 (5)
abstracting: (1<=p78)
states: 2,110,104 (6)
abstracting: (1<=p1)
states: 3,130,383 (6)
abstracting: (1<=p38)
states: 9,249,861 (6)
abstracting: (1<=p22)
states: 608,106 (5)
..
EG iterations: 2
abstracting: (1<=p77)
states: 2,913,217 (6)
abstracting: (1<=p1)
states: 3,130,383 (6)
abstracting: (1<=p77)
states: 2,913,217 (6)
abstracting: (1<=p1)
states: 3,130,383 (6)
.abstracting: (1<=p47)
states: 1,121,953 (6)
abstracting: (1<=p1)
states: 3,130,383 (6)
abstracting: (1<=p61)
states: 986,153 (5)
abstracting: (1<=p1)
states: 3,130,383 (6)
abstracting: (1<=p92)
states: 2,047,696 (6)
abstracting: (1<=p1)
states: 3,130,383 (6)
abstracting: (1<=p77)
states: 2,913,217 (6)
abstracting: (1<=p1)
states: 3,130,383 (6)
.abstracting: (1<=p47)
states: 1,121,953 (6)
abstracting: (1<=p1)
states: 3,130,383 (6)
abstracting: (1<=p77)
states: 2,913,217 (6)
abstracting: (1<=p1)
states: 3,130,383 (6)
.abstracting: (1<=p47)
states: 1,121,953 (6)
abstracting: (1<=p1)
states: 3,130,383 (6)
..
EG iterations: 2
-> the formula is TRUE

FORMULA DBSingleClientW-PT-d0m07-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m19.355sec

checking: EG [[EF [[p1<=0 | p80<=0]] & [EX [[[E [[1<=p1 & 1<=p80] U [1<=p2 & 1<=p90]] | AF [[1<=p4 & 1<=p38]]] | [[1<=p1 & 1<=p87] | [1<=p1 & 1<=p74]]]] & EF [[[[p1<=0 | p42<=0] & [p1<=0 | p87<=0]] | ~ [A [[1<=p1 & 1<=p72] U [1<=p1 & 1<=p61]]]]]]]]
normalized: EG [[[E [true U [~ [[~ [EG [~ [[1<=p1 & 1<=p61]]]] & ~ [E [~ [[1<=p1 & 1<=p61]] U [~ [[1<=p1 & 1<=p72]] & ~ [[1<=p1 & 1<=p61]]]]]]] | [[p1<=0 | p87<=0] & [p1<=0 | p42<=0]]]] & EX [[[[1<=p1 & 1<=p74] | [1<=p1 & 1<=p87]] | [~ [EG [~ [[1<=p4 & 1<=p38]]]] | E [[1<=p1 & 1<=p80] U [1<=p2 & 1<=p90]]]]]] & E [true U [p1<=0 | p80<=0]]]]

abstracting: (p80<=0)
states: 17,621,397 (7)
abstracting: (p1<=0)
states: 14,833,658 (7)
abstracting: (1<=p90)
states: 342,644 (5)
abstracting: (1<=p2)
states: 599,424 (5)
abstracting: (1<=p80)
states: 342,644 (5)
abstracting: (1<=p1)
states: 3,130,383 (6)
abstracting: (1<=p38)
states: 9,249,861 (6)
abstracting: (1<=p4)
states: 1,043,461 (6)
.
EG iterations: 1
abstracting: (1<=p87)
states: 2,062,368 (6)
abstracting: (1<=p1)
states: 3,130,383 (6)
abstracting: (1<=p74)
states: 2,913,217 (6)
abstracting: (1<=p1)
states: 3,130,383 (6)
.abstracting: (p42<=0)
states: 12,323,855 (7)
abstracting: (p1<=0)
states: 14,833,658 (7)
abstracting: (p87<=0)
states: 15,901,673 (7)
abstracting: (p1<=0)
states: 14,833,658 (7)
abstracting: (1<=p61)
states: 986,153 (5)
abstracting: (1<=p1)
states: 3,130,383 (6)
abstracting: (1<=p72)
states: 1,939,819 (6)
abstracting: (1<=p1)
states: 3,130,383 (6)
abstracting: (1<=p61)
states: 986,153 (5)
abstracting: (1<=p1)
states: 3,130,383 (6)
abstracting: (1<=p61)
states: 986,153 (5)
abstracting: (1<=p1)
states: 3,130,383 (6)
..
EG iterations: 2
..................
EG iterations: 18
-> the formula is FALSE

FORMULA DBSingleClientW-PT-d0m07-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.848sec

checking: E [[EF [AX [[1<=p1 & 1<=p82]]] | EG [AF [[1<=p16 & 1<=p51]]]] U [~ [EF [[1<=p27 & 1<=p38]]] & [[A [AF [[1<=p1 & 1<=p77]] U [1<=p1 & 1<=p85]] | AX [AX [[1<=p1 & 1<=p88]]]] | [[EF [[1<=p1 & 1<=p92]] & ~ [[A [[1<=p1 & 1<=p79] U [1<=p1 & 1<=p81]] | [1<=p1 & 1<=p41]]]] | [[1<=p1 & 1<=p79] | [1<=p1 & 1<=p46]]]]]]
normalized: E [[EG [~ [EG [~ [[1<=p16 & 1<=p51]]]]] | E [true U ~ [EX [~ [[1<=p1 & 1<=p82]]]]]] U [[[[[1<=p1 & 1<=p46] | [1<=p1 & 1<=p79]] | [~ [[[1<=p1 & 1<=p41] | [~ [EG [~ [[1<=p1 & 1<=p81]]]] & ~ [E [~ [[1<=p1 & 1<=p81]] U [~ [[1<=p1 & 1<=p79]] & ~ [[1<=p1 & 1<=p81]]]]]]]] & E [true U [1<=p1 & 1<=p92]]]] | [~ [EX [EX [~ [[1<=p1 & 1<=p88]]]]] | [~ [EG [~ [[1<=p1 & 1<=p85]]]] & ~ [E [~ [[1<=p1 & 1<=p85]] U [EG [~ [[1<=p1 & 1<=p77]]] & ~ [[1<=p1 & 1<=p85]]]]]]]] & ~ [E [true U [1<=p27 & 1<=p38]]]]]

abstracting: (1<=p38)
states: 9,249,861 (6)
abstracting: (1<=p27)
states: 608,106 (5)
abstracting: (1<=p85)
states: 2,051,350 (6)
abstracting: (1<=p1)
states: 3,130,383 (6)
abstracting: (1<=p77)
states: 2,913,217 (6)
abstracting: (1<=p1)
states: 3,130,383 (6)
..
EG iterations: 2
abstracting: (1<=p85)
states: 2,051,350 (6)
abstracting: (1<=p1)
states: 3,130,383 (6)
abstracting: (1<=p85)
states: 2,051,350 (6)
abstracting: (1<=p1)
states: 3,130,383 (6)
..
EG iterations: 2
abstracting: (1<=p88)
states: 2,062,368 (6)
abstracting: (1<=p1)
states: 3,130,383 (6)
..abstracting: (1<=p92)
states: 2,047,696 (6)
abstracting: (1<=p1)
states: 3,130,383 (6)
abstracting: (1<=p81)
states: 342,644 (5)
abstracting: (1<=p1)
states: 3,130,383 (6)
abstracting: (1<=p79)
states: 2,110,104 (6)
abstracting: (1<=p1)
states: 3,130,383 (6)
abstracting: (1<=p81)
states: 342,644 (5)
abstracting: (1<=p1)
states: 3,130,383 (6)
abstracting: (1<=p81)
states: 342,644 (5)
abstracting: (1<=p1)
states: 3,130,383 (6)
..
EG iterations: 2
abstracting: (1<=p41)
states: 5,640,194 (6)
abstracting: (1<=p1)
states: 3,130,383 (6)
abstracting: (1<=p79)
states: 2,110,104 (6)
abstracting: (1<=p1)
states: 3,130,383 (6)
abstracting: (1<=p46)
states: 1,121,953 (6)
abstracting: (1<=p1)
states: 3,130,383 (6)
abstracting: (1<=p82)
states: 342,644 (5)
abstracting: (1<=p1)
states: 3,130,383 (6)
.abstracting: (1<=p51)
states: 1,694,649 (6)
abstracting: (1<=p16)
states: 422,139 (5)
.
EG iterations: 1
..
EG iterations: 2
-> the formula is TRUE

FORMULA DBSingleClientW-PT-d0m07-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m22.543sec

totally nodes used: 56300252 (5.6e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 157620474 214623238 372243712
used/not used/entry size/cache size: 65846389 1262475 16 1024MB
basic ops cache: hits/miss/sum: 40053787 55302511 95356298
used/not used/entry size/cache size: 16716104 61112 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: 102682 185846 288528
used/not used/entry size/cache size: 183870 8204738 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 29683120
1 23580630
2 9995324
3 2977417
4 693337
5 137139
6 25513
7 5701
8 2212
9 1539
>= 10 6932

Total processing time: 2m 7.732sec


BK_STOP 1678349751563

--------------------
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

7115 9150 10697 10938 14755 13355 13594
iterations count:776805 (5754), effective:16880 (125)

initing FirstDep: 0m 0.001sec


iterations count:176 (1), effective:6 (0)

iterations count:1686 (12), effective:28 (0)

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

iterations count:65689 (486), effective:1551 (11)

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

iterations count:150 (1), effective:1 (0)
13863
iterations count:112444 (832), effective:2600 (19)

iterations count:65689 (486), effective:1551 (11)

iterations count:4514 (33), effective:108 (0)

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

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

iterations count:12682 (93), effective:390 (2)

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

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

iterations count:992 (7), effective:19 (0)

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

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

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

iterations count:9167 (67), effective:298 (2)

iterations count:61777 (457), effective:1508 (11)

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

iterations count:53228 (394), effective:1256 (9)

iterations count:61777 (457), effective:1508 (11)

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

iterations count:61777 (457), effective:1508 (11)

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

iterations count:46506 (344), effective:865 (6)

iterations count:19103 (141), effective:795 (5)

iterations count:1526 (11), effective:19 (0)

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

iterations count:55157 (408), effective:1320 (9)

iterations count:1686 (12), effective:28 (0)

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

iterations count:896 (6), effective:17 (0)

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

iterations count:61554 (455), effective:1297 (9)

iterations count:12130 (89), effective:395 (2)

iterations count:65689 (486), effective:1551 (11)

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

iterations count:12897 (95), effective:418 (3)

iterations count:19897 (147), effective:760 (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="DBSingleClientW-PT-d0m07"
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 DBSingleClientW-PT-d0m07, 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 r106-tall-167814482400202"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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