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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10550.399 376770.00 387746.00 1082.50 FTTTFTFTFFTFTTFT 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-167814482400210.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-d0m08, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814482400210
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 5.5K Feb 26 15:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K Feb 26 15:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 15:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 15:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 15:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 156K Feb 26 15:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 26 15:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Feb 26 15:34 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-d0m08-CTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d0m08-CTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d0m08-CTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d0m08-CTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d0m08-CTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d0m08-CTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d0m08-CTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d0m08-CTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d0m08-CTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d0m08-CTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d0m08-CTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d0m08-CTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d0m08-CTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d0m08-CTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d0m08-CTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d0m08-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678349836775

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

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

net check time: 0m 0.000sec

init dd package: 0m 2.685sec


RS generation: 0m45.935sec


-> reachability set: #nodes 27308 (2.7e+04) #states 136,861,850 (8)



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

checking: AF [AX [[1<=p18 & 1<=p52]]]
normalized: ~ [EG [EX [~ [[1<=p18 & 1<=p52]]]]]

abstracting: (1<=p52)
states: 16,748,518 (7)
abstracting: (1<=p18)
states: 3,526,938 (6)
...........................
EG iterations: 26
-> the formula is FALSE

FORMULA DBSingleClientW-PT-d0m08-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.906sec

checking: EG [[[p30<=0 | p39<=0] & [p1<=0 | p49<=0]]]
normalized: EG [[[p1<=0 | p49<=0] & [p30<=0 | p39<=0]]]

abstracting: (p39<=0)
states: 63,499,798 (7)
abstracting: (p30<=0)
states: 136,352,252 (8)
abstracting: (p49<=0)
states: 127,904,628 (8)
abstracting: (p1<=0)
states: 114,060,617 (8)
..
EG iterations: 2
-> the formula is TRUE

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

MC time: 0m 0.370sec

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

abstracting: (1<=p49)
states: 8,957,222 (6)
abstracting: (1<=p1)
states: 22,801,233 (7)
abstracting: (1<=p49)
states: 8,957,222 (6)
abstracting: (1<=p1)
states: 22,801,233 (7)
-> the formula is FALSE

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

MC time: 0m 1.198sec

checking: EF [AG [[EF [[1<=p1 & 1<=p63]] | [1<=p22 & 1<=p39]]]]
normalized: E [true U ~ [E [true U ~ [[[1<=p22 & 1<=p39] | E [true U [1<=p1 & 1<=p63]]]]]]]

abstracting: (1<=p63)
states: 7,463,767 (6)
abstracting: (1<=p1)
states: 22,801,233 (7)
abstracting: (1<=p39)
states: 73,362,052 (7)
abstracting: (1<=p22)
states: 4,734,924 (6)
-> the formula is FALSE

FORMULA DBSingleClientW-PT-d0m08-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m31.907sec

checking: EF [EX [EX [[EF [[1<=p1 & 1<=p84]] & [p1<=0 | p51<=0]]]]]
normalized: E [true U EX [EX [[[p1<=0 | p51<=0] & E [true U [1<=p1 & 1<=p84]]]]]]

abstracting: (1<=p84)
states: 2,799,558 (6)
abstracting: (1<=p1)
states: 22,801,233 (7)
abstracting: (p51<=0)
states: 128,895,190 (8)
abstracting: (p1<=0)
states: 114,060,617 (8)
..-> the formula is TRUE

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

MC time: 0m21.793sec

checking: AG [~ [A [EX [EF [[1<=p1 & 1<=p55]]] U EG [E [[1<=p1 & 1<=p63] U [1<=p25 & 1<=p39]]]]]]
normalized: ~ [E [true U [~ [EG [~ [EG [E [[1<=p1 & 1<=p63] U [1<=p25 & 1<=p39]]]]]] & ~ [E [~ [EG [E [[1<=p1 & 1<=p63] U [1<=p25 & 1<=p39]]]] U [~ [EX [E [true U [1<=p1 & 1<=p55]]]] & ~ [EG [E [[1<=p1 & 1<=p63] U [1<=p25 & 1<=p39]]]]]]]]]]

abstracting: (1<=p39)
states: 73,362,052 (7)
abstracting: (1<=p25)
states: 4,734,924 (6)
abstracting: (1<=p63)
states: 7,463,767 (6)
abstracting: (1<=p1)
states: 22,801,233 (7)
..............
EG iterations: 14
abstracting: (1<=p55)
states: 11,672,627 (7)
abstracting: (1<=p1)
states: 22,801,233 (7)
.abstracting: (1<=p39)
states: 73,362,052 (7)
abstracting: (1<=p25)
states: 4,734,924 (6)
abstracting: (1<=p63)
states: 7,463,767 (6)
abstracting: (1<=p1)
states: 22,801,233 (7)
..............
EG iterations: 14
abstracting: (1<=p39)
states: 73,362,052 (7)
abstracting: (1<=p25)
states: 4,734,924 (6)
abstracting: (1<=p63)
states: 7,463,767 (6)
abstracting: (1<=p1)
states: 22,801,233 (7)
..............
EG iterations: 14

EG iterations: 0
-> the formula is TRUE

FORMULA DBSingleClientW-PT-d0m08-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m19.614sec

checking: [E [~ [AX [AG [~ [[1<=p1 & 1<=p59]]]]] U EX [[1<=p7 & 1<=p39]]] | AF [[EX [EF [[1<=p1 & 1<=p49]]] & [1<=p20 & 1<=p52]]]]
normalized: [~ [EG [~ [[[1<=p20 & 1<=p52] & EX [E [true U [1<=p1 & 1<=p49]]]]]]] | E [EX [E [true U [1<=p1 & 1<=p59]]] U EX [[1<=p7 & 1<=p39]]]]

abstracting: (1<=p39)
states: 73,362,052 (7)
abstracting: (1<=p7)
states: 1,448,607 (6)
.abstracting: (1<=p59)
states: 6,660,520 (6)
abstracting: (1<=p1)
states: 22,801,233 (7)
.
before gc: list nodes free: 1301672

after gc: idd nodes used:116118, unused:63883882; list nodes free:326574492
abstracting: (1<=p49)
states: 8,957,222 (6)
abstracting: (1<=p1)
states: 22,801,233 (7)
.abstracting: (1<=p52)
states: 16,748,518 (7)
abstracting: (1<=p20)
states: 3,526,938 (6)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m35.438sec

checking: [AX [AF [EX [0<=0]]] & AX [EG [[[AX [[p3<=0 | p39<=0]] & EF [[p1<=0 | p76<=0]]] | [EX [[p14<=0 | p70<=0]] & [[p1<=0 | p90<=0] & [p19<=0 | p58<=0]]]]]]]
normalized: [~ [EX [~ [EG [[[[[p19<=0 | p58<=0] & [p1<=0 | p90<=0]] & EX [[p14<=0 | p70<=0]]] | [E [true U [p1<=0 | p76<=0]] & ~ [EX [~ [[p3<=0 | p39<=0]]]]]]]]]] & ~ [EX [EG [~ [EX [0<=0]]]]]]

abstracting: (0<=0)
states: 136,861,850 (8)
..
EG iterations: 1
.abstracting: (p39<=0)
states: 63,499,798 (7)
abstracting: (p3<=0)
states: 136,861,849 (8)
.abstracting: (p76<=0)
states: 112,427,103 (8)
abstracting: (p1<=0)
states: 114,060,617 (8)
abstracting: (p70<=0)
states: 133,037,856 (8)
abstracting: (p14<=0)
states: 134,499,263 (8)
.abstracting: (p90<=0)
states: 117,804,693 (8)
abstracting: (p1<=0)
states: 114,060,617 (8)
abstracting: (p58<=0)
states: 131,893,037 (8)
abstracting: (p19<=0)
states: 133,334,912 (8)

EG iterations: 0
.-> the formula is TRUE

FORMULA DBSingleClientW-PT-d0m08-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.732sec

checking: [AF [[AX [AG [[1<=p1 & 1<=p44]]] & ~ [A [A [[1<=p1 & 1<=p90] U [1<=p17 & 1<=p58]] U [1<=p1 & 1<=p87]]]]] & EF [[p33<=0 | p54<=0]]]
normalized: [E [true U [p33<=0 | p54<=0]] & ~ [EG [~ [[~ [[~ [EG [~ [[1<=p1 & 1<=p87]]]] & ~ [E [~ [[1<=p1 & 1<=p87]] U [~ [[~ [EG [~ [[1<=p17 & 1<=p58]]]] & ~ [E [~ [[1<=p17 & 1<=p58]] U [~ [[1<=p1 & 1<=p90]] & ~ [[1<=p17 & 1<=p58]]]]]]] & ~ [[1<=p1 & 1<=p87]]]]]]] & ~ [EX [E [true U ~ [[1<=p1 & 1<=p44]]]]]]]]]]

abstracting: (1<=p44)
states: 30,017,365 (7)
abstracting: (1<=p1)
states: 22,801,233 (7)
.abstracting: (1<=p87)
states: 19,099,926 (7)
abstracting: (1<=p1)
states: 22,801,233 (7)
abstracting: (1<=p58)
states: 4,968,813 (6)
abstracting: (1<=p17)
states: 3,526,938 (6)
abstracting: (1<=p90)
states: 19,057,157 (7)
abstracting: (1<=p1)
states: 22,801,233 (7)
abstracting: (1<=p58)
states: 4,968,813 (6)
abstracting: (1<=p17)
states: 3,526,938 (6)
abstracting: (1<=p58)
states: 4,968,813 (6)
abstracting: (1<=p17)
states: 3,526,938 (6)
.
EG iterations: 1
abstracting: (1<=p87)
states: 19,099,926 (7)
abstracting: (1<=p1)
states: 22,801,233 (7)
abstracting: (1<=p87)
states: 19,099,926 (7)
abstracting: (1<=p1)
states: 22,801,233 (7)
..
EG iterations: 2
..........................
EG iterations: 26
abstracting: (p54<=0)
states: 120,030,091 (8)
abstracting: (p33<=0)
states: 133,291,118 (8)
-> the formula is FALSE

FORMULA DBSingleClientW-PT-d0m08-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 8.764sec

checking: EX [A [[1<=p1 & 1<=p90] U [~ [AF [[1<=p1 & 1<=p64]]] & [~ [[EG [[1<=p1 & 1<=p93]] | [[1<=p4 & 1<=p39] | [1<=p37 & 1<=p61]]]] | ~ [[1<=p1 & 1<=p93]]]]]]
normalized: EX [[~ [EG [~ [[[~ [[1<=p1 & 1<=p93]] | ~ [[[[1<=p37 & 1<=p61] | [1<=p4 & 1<=p39]] | EG [[1<=p1 & 1<=p93]]]]] & EG [~ [[1<=p1 & 1<=p64]]]]]]] & ~ [E [~ [[[~ [[1<=p1 & 1<=p93]] | ~ [[[[1<=p37 & 1<=p61] | [1<=p4 & 1<=p39]] | EG [[1<=p1 & 1<=p93]]]]] & EG [~ [[1<=p1 & 1<=p64]]]]] U [~ [[1<=p1 & 1<=p90]] & ~ [[[~ [[1<=p1 & 1<=p93]] | ~ [[[[1<=p37 & 1<=p61] | [1<=p4 & 1<=p39]] | EG [[1<=p1 & 1<=p93]]]]] & EG [~ [[1<=p1 & 1<=p64]]]]]]]]]]

abstracting: (1<=p64)
states: 7,534,810 (6)
abstracting: (1<=p1)
states: 22,801,233 (7)
..
EG iterations: 2
abstracting: (1<=p93)
states: 2,799,558 (6)
abstracting: (1<=p1)
states: 22,801,233 (7)
.............
EG iterations: 13
abstracting: (1<=p39)
states: 73,362,052 (7)
abstracting: (1<=p4)
states: 7,600,411 (6)
abstracting: (1<=p61)
states: 16,748,870 (7)
abstracting: (1<=p37)
states: 3,570,732 (6)
abstracting: (1<=p93)
states: 2,799,558 (6)
abstracting: (1<=p1)
states: 22,801,233 (7)
abstracting: (1<=p90)
states: 19,057,157 (7)
abstracting: (1<=p1)
states: 22,801,233 (7)
abstracting: (1<=p64)
states: 7,534,810 (6)
abstracting: (1<=p1)
states: 22,801,233 (7)
..
EG iterations: 2
abstracting: (1<=p93)
states: 2,799,558 (6)
abstracting: (1<=p1)
states: 22,801,233 (7)
.............
EG iterations: 13
abstracting: (1<=p39)
states: 73,362,052 (7)
abstracting: (1<=p4)
states: 7,600,411 (6)
abstracting: (1<=p61)
states: 16,748,870 (7)
abstracting: (1<=p37)
states: 3,570,732 (6)
abstracting: (1<=p93)
states: 2,799,558 (6)
abstracting: (1<=p1)
states: 22,801,233 (7)
abstracting: (1<=p64)
states: 7,534,810 (6)
abstracting: (1<=p1)
states: 22,801,233 (7)
..
EG iterations: 2
abstracting: (1<=p93)
states: 2,799,558 (6)
abstracting: (1<=p1)
states: 22,801,233 (7)
.............
EG iterations: 13
abstracting: (1<=p39)
states: 73,362,052 (7)
abstracting: (1<=p4)
states: 7,600,411 (6)
abstracting: (1<=p61)
states: 16,748,870 (7)
abstracting: (1<=p37)
states: 3,570,732 (6)
abstracting: (1<=p93)
states: 2,799,558 (6)
abstracting: (1<=p1)
states: 22,801,233 (7)
...........................
EG iterations: 27
.-> the formula is TRUE

FORMULA DBSingleClientW-PT-d0m08-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.324sec

checking: AF [[1<=p1 & [1<=p64 & [[[p1<=0 | p90<=0] & [[p1<=0 | p79<=0] & [p1<=0 | p44<=0]]] | [AF [[1<=p1 & 1<=p98]] & ~ [E [[1<=p1 & 1<=p41] U ~ [[p74<=0 | p1<=0]]]]]]]]]
normalized: ~ [EG [~ [[1<=p1 & [1<=p64 & [[~ [E [[1<=p1 & 1<=p41] U ~ [[p74<=0 | p1<=0]]]] & ~ [EG [~ [[1<=p1 & 1<=p98]]]]] | [[[p1<=0 | p44<=0] & [p1<=0 | p79<=0]] & [p1<=0 | p90<=0]]]]]]]]

abstracting: (p90<=0)
states: 117,804,693 (8)
abstracting: (p1<=0)
states: 114,060,617 (8)
abstracting: (p79<=0)
states: 112,427,103 (8)
abstracting: (p1<=0)
states: 114,060,617 (8)
abstracting: (p44<=0)
states: 106,844,485 (8)
abstracting: (p1<=0)
states: 114,060,617 (8)
abstracting: (1<=p98)
states: 17,484,816 (7)
abstracting: (1<=p1)
states: 22,801,233 (7)
...
EG iterations: 3
abstracting: (p1<=0)
states: 114,060,617 (8)
abstracting: (p74<=0)
states: 119,480,960 (8)
abstracting: (1<=p41)
states: 2
abstracting: (1<=p1)
states: 22,801,233 (7)
abstracting: (1<=p64)
states: 7,534,810 (6)
abstracting: (1<=p1)
states: 22,801,233 (7)
..
EG iterations: 2
-> the formula is FALSE

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

MC time: 0m 1.149sec

checking: EF [[EX [AX [EF [[p1<=0 | p74<=0]]]] & [AX [[[p1<=0 | p90<=0] & [1<=p1 & 1<=p60]]] & [[AX [[p1<=0 | p83<=0]] | p1<=0] | [p40<=0 | [~ [A [[1<=p1 & 1<=p42] U [1<=p1 & 1<=p63]]] & E [[1<=p1 & 1<=p88] U [1<=p1 & 1<=p64]]]]]]]]
normalized: E [true U [EX [~ [EX [~ [E [true U [p1<=0 | p74<=0]]]]]] & [[[p40<=0 | [E [[1<=p1 & 1<=p88] U [1<=p1 & 1<=p64]] & ~ [[~ [EG [~ [[1<=p1 & 1<=p63]]]] & ~ [E [~ [[1<=p1 & 1<=p63]] U [~ [[1<=p1 & 1<=p42]] & ~ [[1<=p1 & 1<=p63]]]]]]]]] | [p1<=0 | ~ [EX [~ [[p1<=0 | p83<=0]]]]]] & ~ [EX [~ [[[1<=p1 & 1<=p60] & [p1<=0 | p90<=0]]]]]]]]

abstracting: (p90<=0)
states: 117,804,693 (8)
abstracting: (p1<=0)
states: 114,060,617 (8)
abstracting: (1<=p60)
states: 7,996,802 (6)
abstracting: (1<=p1)
states: 22,801,233 (7)
.abstracting: (p83<=0)
states: 134,062,292 (8)
abstracting: (p1<=0)
states: 114,060,617 (8)
.abstracting: (p1<=0)
states: 114,060,617 (8)
abstracting: (1<=p63)
states: 7,463,767 (6)
abstracting: (1<=p1)
states: 22,801,233 (7)
abstracting: (1<=p42)
states: 43,087,147 (7)
abstracting: (1<=p1)
states: 22,801,233 (7)
abstracting: (1<=p63)
states: 7,463,767 (6)
abstracting: (1<=p1)
states: 22,801,233 (7)
abstracting: (1<=p63)
states: 7,463,767 (6)
abstracting: (1<=p1)
states: 22,801,233 (7)
..
EG iterations: 2
abstracting: (1<=p64)
states: 7,534,810 (6)
abstracting: (1<=p1)
states: 22,801,233 (7)
abstracting: (1<=p88)
states: 19,099,926 (7)
abstracting: (1<=p1)
states: 22,801,233 (7)
abstracting: (p40<=0)
states: 136,861,848 (8)
abstracting: (p74<=0)
states: 119,480,960 (8)
abstracting: (p1<=0)
states: 114,060,617 (8)
..-> the formula is TRUE

FORMULA DBSingleClientW-PT-d0m08-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m13.568sec

checking: EG [A [~ [[[[[[1<=p36 & 1<=p54] & [1<=p1 & 1<=p49]] | [[1<=p1 & 1<=p90] & [1<=p1 & 1<=p84]]] & E [[1<=p1 & 1<=p91] U [1<=p1 & 1<=p97]]] | ~ [[[1<=p1 & 1<=p87] | [[1<=p1 & 1<=p50] | [1<=p1 & 1<=p63]]]]]] U [AF [~ [AG [~ [[p1<=0 | p74<=0]]]]] | [1<=p1 & 1<=p82]]]]
normalized: EG [[~ [EG [~ [[[1<=p1 & 1<=p82] | ~ [EG [~ [E [true U [p1<=0 | p74<=0]]]]]]]]] & ~ [E [~ [[[1<=p1 & 1<=p82] | ~ [EG [~ [E [true U [p1<=0 | p74<=0]]]]]]] U [[~ [[[[1<=p1 & 1<=p63] | [1<=p1 & 1<=p50]] | [1<=p1 & 1<=p87]]] | [E [[1<=p1 & 1<=p91] U [1<=p1 & 1<=p97]] & [[[1<=p1 & 1<=p84] & [1<=p1 & 1<=p90]] | [[1<=p1 & 1<=p49] & [1<=p36 & 1<=p54]]]]] & ~ [[[1<=p1 & 1<=p82] | ~ [EG [~ [E [true U [p1<=0 | p74<=0]]]]]]]]]]]]

abstracting: (p74<=0)
states: 119,480,960 (8)
abstracting: (p1<=0)
states: 114,060,617 (8)
.
EG iterations: 1
abstracting: (1<=p82)
states: 2,799,558 (6)
abstracting: (1<=p1)
states: 22,801,233 (7)
abstracting: (1<=p54)
states: 16,831,759 (7)
abstracting: (1<=p36)
states: 3,570,732 (6)
abstracting: (1<=p49)
states: 8,957,222 (6)
abstracting: (1<=p1)
states: 22,801,233 (7)
abstracting: (1<=p90)
states: 19,057,157 (7)
abstracting: (1<=p1)
states: 22,801,233 (7)
abstracting: (1<=p84)
states: 2,799,558 (6)
abstracting: (1<=p1)
states: 22,801,233 (7)
abstracting: (1<=p97)
states: 19,039,262 (7)
abstracting: (1<=p1)
states: 22,801,233 (7)
abstracting: (1<=p91)
states: 19,057,157 (7)
abstracting: (1<=p1)
states: 22,801,233 (7)
abstracting: (1<=p87)
states: 19,099,926 (7)
abstracting: (1<=p1)
states: 22,801,233 (7)
abstracting: (1<=p50)
states: 7,763,123 (6)
abstracting: (1<=p1)
states: 22,801,233 (7)
abstracting: (1<=p63)
states: 7,463,767 (6)
abstracting: (1<=p1)
states: 22,801,233 (7)
abstracting: (p74<=0)
states: 119,480,960 (8)
abstracting: (p1<=0)
states: 114,060,617 (8)
.
EG iterations: 1
abstracting: (1<=p82)
states: 2,799,558 (6)
abstracting: (1<=p1)
states: 22,801,233 (7)
abstracting: (p74<=0)
states: 119,480,960 (8)
abstracting: (p1<=0)
states: 114,060,617 (8)
.
EG iterations: 1
abstracting: (1<=p82)
states: 2,799,558 (6)
abstracting: (1<=p1)
states: 22,801,233 (7)
.
EG iterations: 1

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m 0.297sec

checking: [EG [AG [E [[~ [[1<=p1 & 1<=p64]] | ~ [[1<=p87 & 1<=p1]]] U E [[1<=p1 & 1<=p98] U [1<=p11 & 1<=p68]]]]] | A [[~ [[1<=p1 & 1<=p80]] & [~ [[1<=p26 & 1<=p39]] | [[[~ [[1<=p1 & 1<=p92]] | AX [[1<=p1 & 1<=p95]]] & E [[1<=p1 & 1<=p96] U [1<=p5 & 1<=p39]]] | AG [~ [[1<=p1 & 1<=p78]]]]]] U A [[1<=p1 & 1<=p80] U ~ [EF [[1<=p18 & 1<=p52]]]]]]
normalized: [[~ [EG [~ [[~ [EG [E [true U [1<=p18 & 1<=p52]]]] & ~ [E [E [true U [1<=p18 & 1<=p52]] U [~ [[1<=p1 & 1<=p80]] & E [true U [1<=p18 & 1<=p52]]]]]]]]] & ~ [E [~ [[~ [EG [E [true U [1<=p18 & 1<=p52]]]] & ~ [E [E [true U [1<=p18 & 1<=p52]] U [~ [[1<=p1 & 1<=p80]] & E [true U [1<=p18 & 1<=p52]]]]]]] U [~ [[[[~ [E [true U [1<=p1 & 1<=p78]]] | [E [[1<=p1 & 1<=p96] U [1<=p5 & 1<=p39]] & [~ [EX [~ [[1<=p1 & 1<=p95]]]] | ~ [[1<=p1 & 1<=p92]]]]] | ~ [[1<=p26 & 1<=p39]]] & ~ [[1<=p1 & 1<=p80]]]] & ~ [[~ [EG [E [true U [1<=p18 & 1<=p52]]]] & ~ [E [E [true U [1<=p18 & 1<=p52]] U [~ [[1<=p1 & 1<=p80]] & E [true U [1<=p18 & 1<=p52]]]]]]]]]]] | EG [~ [E [true U ~ [E [[~ [[1<=p87 & 1<=p1]] | ~ [[1<=p1 & 1<=p64]]] U E [[1<=p1 & 1<=p98] U [1<=p11 & 1<=p68]]]]]]]]

abstracting: (1<=p68)
states: 27,340,670 (7)
abstracting: (1<=p11)
states: 1,943,345 (6)
abstracting: (1<=p98)
states: 17,484,816 (7)
abstracting: (1<=p1)
states: 22,801,233 (7)
abstracting: (1<=p64)
states: 7,534,810 (6)
abstracting: (1<=p1)
states: 22,801,233 (7)
abstracting: (1<=p1)
states: 22,801,233 (7)
abstracting: (1<=p87)
states: 19,099,926 (7)
.
EG iterations: 1
abstracting: (1<=p52)
states: 16,748,518 (7)
abstracting: (1<=p18)
states: 3,526,938 (6)
abstracting: (1<=p80)
states: 19,375,679 (7)
abstracting: (1<=p1)
states: 22,801,233 (7)
abstracting: (1<=p52)
states: 16,748,518 (7)
abstracting: (1<=p18)
states: 3,526,938 (6)
abstracting: (1<=p52)
states: 16,748,518 (7)
abstracting: (1<=p18)
states: 3,526,938 (6)
...................
EG iterations: 19
abstracting: (1<=p80)
states: 19,375,679 (7)
abstracting: (1<=p1)
states: 22,801,233 (7)
abstracting: (1<=p39)
states: 73,362,052 (7)
abstracting: (1<=p26)
states: 4,734,924 (6)
abstracting: (1<=p92)
states: 2,799,558 (6)
abstracting: (1<=p1)
states: 22,801,233 (7)
abstracting: (1<=p95)
states: 19,039,262 (7)
abstracting: (1<=p1)
states: 22,801,233 (7)
.abstracting: (1<=p39)
states: 73,362,052 (7)
abstracting: (1<=p5)
states: 1,448,607 (6)
abstracting: (1<=p96)
states: 19,039,262 (7)
abstracting: (1<=p1)
states: 22,801,233 (7)
abstracting: (1<=p78)
states: 17,484,816 (7)
abstracting: (1<=p1)
states: 22,801,233 (7)

before gc: list nodes free: 1451467

after gc: idd nodes used:390618, unused:63609382; list nodes free:325142118
abstracting: (1<=p52)
states: 16,748,518 (7)
abstracting: (1<=p18)
states: 3,526,938 (6)
abstracting: (1<=p80)
states: 19,375,679 (7)
abstracting: (1<=p1)
states: 22,801,233 (7)
abstracting: (1<=p52)
states: 16,748,518 (7)
abstracting: (1<=p18)
states: 3,526,938 (6)
abstracting: (1<=p52)
states: 16,748,518 (7)
abstracting: (1<=p18)
states: 3,526,938 (6)
...................
EG iterations: 19
abstracting: (1<=p52)
states: 16,748,518 (7)
abstracting: (1<=p18)
states: 3,526,938 (6)
abstracting: (1<=p80)
states: 19,375,679 (7)
abstracting: (1<=p1)
states: 22,801,233 (7)
abstracting: (1<=p52)
states: 16,748,518 (7)
abstracting: (1<=p18)
states: 3,526,938 (6)
abstracting: (1<=p52)
states: 16,748,518 (7)
abstracting: (1<=p18)
states: 3,526,938 (6)
...................
EG iterations: 19
...................
EG iterations: 19
-> the formula is FALSE

FORMULA DBSingleClientW-PT-d0m08-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m21.012sec

checking: [AF [[1<=p1 & 1<=p57]] | [AX [[E [EG [[1<=p13 & 1<=p69]] U AF [[1<=p1 & 1<=p46]]] | [[1<=p1 & 1<=p63] | EG [A [[1<=p31 & 1<=p39] U [1<=p1 & 1<=p85]]]]]] | EG [[[[A [~ [[1<=p1 & 1<=p77]] U [[1<=p1 & 1<=p64] | [1<=p20 & 1<=p52]]] & A [[1<=p1 & 1<=p95] U [1<=p1 & 1<=p44]]] | [AF [[1<=p33 & 1<=p54]] | EX [[1<=p1 & 1<=p85]]]] | [[[1<=p1 & 1<=p79] & [1<=p1 & 1<=p63]] | [p16<=0 | p52<=0]]]]]]
normalized: [[EG [[[[p16<=0 | p52<=0] | [[1<=p1 & 1<=p63] & [1<=p1 & 1<=p79]]] | [[EX [[1<=p1 & 1<=p85]] | ~ [EG [~ [[1<=p33 & 1<=p54]]]]] | [[~ [EG [~ [[1<=p1 & 1<=p44]]]] & ~ [E [~ [[1<=p1 & 1<=p44]] U [~ [[1<=p1 & 1<=p95]] & ~ [[1<=p1 & 1<=p44]]]]]] & [~ [EG [~ [[[1<=p20 & 1<=p52] | [1<=p1 & 1<=p64]]]]] & ~ [E [~ [[[1<=p20 & 1<=p52] | [1<=p1 & 1<=p64]]] U [[1<=p1 & 1<=p77] & ~ [[[1<=p20 & 1<=p52] | [1<=p1 & 1<=p64]]]]]]]]]]] | ~ [EX [~ [[[EG [[~ [EG [~ [[1<=p1 & 1<=p85]]]] & ~ [E [~ [[1<=p1 & 1<=p85]] U [~ [[1<=p31 & 1<=p39]] & ~ [[1<=p1 & 1<=p85]]]]]]] | [1<=p1 & 1<=p63]] | E [EG [[1<=p13 & 1<=p69]] U ~ [EG [~ [[1<=p1 & 1<=p46]]]]]]]]]] | ~ [EG [~ [[1<=p1 & 1<=p57]]]]]

abstracting: (1<=p57)
states: 7,966,660 (6)
abstracting: (1<=p1)
states: 22,801,233 (7)
..
EG iterations: 2
abstracting: (1<=p46)
states: 89,331 (4)
abstracting: (1<=p1)
states: 22,801,233 (7)
..
EG iterations: 2
abstracting: (1<=p69)
states: 3,823,994 (6)
abstracting: (1<=p13)
states: 2,362,587 (6)
..
EG iterations: 2
abstracting: (1<=p63)
states: 7,463,767 (6)
abstracting: (1<=p1)
states: 22,801,233 (7)
abstracting: (1<=p85)
states: 2,799,558 (6)
abstracting: (1<=p1)
states: 22,801,233 (7)
abstracting: (1<=p39)
states: 73,362,052 (7)
abstracting: (1<=p31)
states: 509,598 (5)
abstracting: (1<=p85)
states: 2,799,558 (6)
abstracting: (1<=p1)
states: 22,801,233 (7)
abstracting: (1<=p85)
states: 2,799,558 (6)
abstracting: (1<=p1)
states: 22,801,233 (7)
..
EG iterations: 2
.............
EG iterations: 13
.abstracting: (1<=p64)
states: 7,534,810 (6)
abstracting: (1<=p1)
states: 22,801,233 (7)
abstracting: (1<=p52)
states: 16,748,518 (7)
abstracting: (1<=p20)
states: 3,526,938 (6)
abstracting: (1<=p77)
states: 17,484,816 (7)
abstracting: (1<=p1)
states: 22,801,233 (7)
abstracting: (1<=p64)
states: 7,534,810 (6)
abstracting: (1<=p1)
states: 22,801,233 (7)
abstracting: (1<=p52)
states: 16,748,518 (7)
abstracting: (1<=p20)
states: 3,526,938 (6)
abstracting: (1<=p64)
states: 7,534,810 (6)
abstracting: (1<=p1)
states: 22,801,233 (7)
abstracting: (1<=p52)
states: 16,748,518 (7)
abstracting: (1<=p20)
states: 3,526,938 (6)
..
EG iterations: 2
abstracting: (1<=p44)
states: 30,017,365 (7)
abstracting: (1<=p1)
states: 22,801,233 (7)
abstracting: (1<=p95)
states: 19,039,262 (7)
abstracting: (1<=p1)
states: 22,801,233 (7)
abstracting: (1<=p44)
states: 30,017,365 (7)
abstracting: (1<=p1)
states: 22,801,233 (7)
abstracting: (1<=p44)
states: 30,017,365 (7)
abstracting: (1<=p1)
states: 22,801,233 (7)
..
EG iterations: 2
abstracting: (1<=p54)
states: 16,831,759 (7)
abstracting: (1<=p33)
states: 3,570,732 (6)
.
EG iterations: 1
abstracting: (1<=p85)
states: 2,799,558 (6)
abstracting: (1<=p1)
states: 22,801,233 (7)
.abstracting: (1<=p79)
states: 24,434,747 (7)
abstracting: (1<=p1)
states: 22,801,233 (7)
abstracting: (1<=p63)
states: 7,463,767 (6)
abstracting: (1<=p1)
states: 22,801,233 (7)
abstracting: (p52<=0)
states: 120,113,332 (8)
abstracting: (p16<=0)
states: 133,334,912 (8)
.
EG iterations: 1
-> the formula is TRUE

FORMULA DBSingleClientW-PT-d0m08-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m26.487sec

totally nodes used: 175736792 (1.8e+08)
number of garbage collections: 2
fire ops cache: hits/miss/sum: 573124319 658685791 1231810110
used/not used/entry size/cache size: 62521416 4587448 16 1024MB
basic ops cache: hits/miss/sum: 171430493 195765413 367195906
used/not used/entry size/cache size: 16716206 61010 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: 362395 561671 924066
used/not used/entry size/cache size: 144532 8244076 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 33603506
1 22432079
2 8286231
3 2191526
4 466945
5 88862
6 18982
7 6516
8 3614
9 2266
>= 10 8337

Total processing time: 6m 8.565sec


BK_STOP 1678350213545

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

10077 43668 24243 35656 30310 29380 21134 37394 27125 30937 26066
iterations count:1151106 (8526), effective:25068 (185)

initing FirstDep: 0m 0.000sec


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

iterations count:135 (1), effective:0 (0)
26324
iterations count:119722 (886), effective:3022 (22)

iterations count:23644 (175), effective:913 (6)
30155
iterations count:106039 (785), effective:2664 (19)

iterations count:1699 (12), effective:35 (0)

iterations count:924 (6), effective:14 (0)

iterations count:69217 (512), effective:1651 (12)

iterations count:924 (6), effective:14 (0)

iterations count:24380 (180), effective:946 (7)

iterations count:924 (6), effective:14 (0)

iterations count:84796 (628), effective:2076 (15)

iterations count:70657 (523), effective:1636 (12)

iterations count:34792 (257), effective:757 (5)

iterations count:1253 (9), effective:22 (0)

iterations count:186 (1), effective:8 (0)

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

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

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

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

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

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

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

iterations count:961 (7), effective:18 (0)

iterations count:74737 (553), effective:1864 (13)

iterations count:961 (7), effective:18 (0)

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

iterations count:961 (7), effective:18 (0)

iterations count:961 (7), effective:18 (0)

iterations count:549 (4), effective:6 (0)
42923
iterations count:143179 (1060), effective:3750 (27)

iterations count:23383 (173), effective:899 (6)

iterations count:87198 (645), effective:2090 (15)

iterations count:87198 (645), effective:2090 (15)

iterations count:533 (3), effective:11 (0)

iterations count:87198 (645), effective:2090 (15)

iterations count:234 (1), effective:3 (0)

iterations count:85547 (633), effective:2093 (15)

iterations count:87198 (645), effective:2090 (15)

iterations count:87198 (645), effective:2090 (15)

iterations count:533 (3), effective:11 (0)

iterations count:87198 (645), effective:2090 (15)
29289
iterations count:123510 (914), effective:3157 (23)

iterations count:87198 (645), effective:2090 (15)

iterations count:87198 (645), effective:2090 (15)

iterations count:533 (3), effective:11 (0)

iterations count:87198 (645), effective:2090 (15)

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

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

iterations count:51924 (384), effective:1062 (7)

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DBSingleClientW-PT-d0m08"
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-d0m08, 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-167814482400210"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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