Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 7.9K Feb 25 16:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 25 16:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 16:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 16:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Feb 25 16:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 16:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 192K 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 BusinessProcesses-PT-20-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678649910876

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-20
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 19:38:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 19:38:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 19:38:32] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2023-03-12 19:38:32] [INFO ] Transformed 782 places.
[2023-03-12 19:38:32] [INFO ] Transformed 697 transitions.
[2023-03-12 19:38:32] [INFO ] Found NUPN structural information;
[2023-03-12 19:38:32] [INFO ] Parsed PT model containing 782 places and 697 transitions and 2011 arcs in 177 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 63 places in 17 ms
Reduce places removed 63 places and 59 transitions.
FORMULA BusinessProcesses-PT-20-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 719 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 719/719 places, 638/638 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 705 transition count 638
Discarding 103 places :
Symmetric choice reduction at 1 with 103 rule applications. Total rules 117 place count 602 transition count 535
Iterating global reduction 1 with 103 rules applied. Total rules applied 220 place count 602 transition count 535
Discarding 53 places :
Symmetric choice reduction at 1 with 53 rule applications. Total rules 273 place count 549 transition count 482
Iterating global reduction 1 with 53 rules applied. Total rules applied 326 place count 549 transition count 482
Applied a total of 326 rules in 132 ms. Remains 549 /719 variables (removed 170) and now considering 482/638 (removed 156) transitions.
// Phase 1: matrix 482 rows 549 cols
[2023-03-12 19:38:33] [INFO ] Computed 107 place invariants in 26 ms
[2023-03-12 19:38:33] [INFO ] Implicit Places using invariants in 440 ms returned []
[2023-03-12 19:38:33] [INFO ] Invariant cache hit.
[2023-03-12 19:38:34] [INFO ] Implicit Places using invariants and state equation in 544 ms returned []
Implicit Place search using SMT with State Equation took 1012 ms to find 0 implicit places.
[2023-03-12 19:38:34] [INFO ] Invariant cache hit.
[2023-03-12 19:38:34] [INFO ] Dead Transitions using invariants and state equation in 409 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 549/719 places, 482/638 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1567 ms. Remains : 549/719 places, 482/638 transitions.
Support contains 35 out of 549 places after structural reductions.
[2023-03-12 19:38:34] [INFO ] Flatten gal took : 80 ms
[2023-03-12 19:38:34] [INFO ] Flatten gal took : 31 ms
[2023-03-12 19:38:34] [INFO ] Input system was already deterministic with 482 transitions.
Incomplete random walk after 10000 steps, including 51 resets, run finished after 779 ms. (steps per millisecond=12 ) properties (out of 27) seen :9
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=19 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2023-03-12 19:38:35] [INFO ] Invariant cache hit.
[2023-03-12 19:38:36] [INFO ] [Real]Absence check using 64 positive place invariants in 36 ms returned sat
[2023-03-12 19:38:36] [INFO ] [Real]Absence check using 64 positive and 43 generalized place invariants in 12 ms returned sat
[2023-03-12 19:38:36] [INFO ] After 410ms SMT Verify possible using state equation in real domain returned unsat :0 sat :8 real:10
[2023-03-12 19:38:37] [INFO ] Deduced a trap composed of 18 places in 125 ms of which 6 ms to minimize.
[2023-03-12 19:38:37] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 1 ms to minimize.
[2023-03-12 19:38:37] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 1 ms to minimize.
[2023-03-12 19:38:37] [INFO ] Deduced a trap composed of 35 places in 134 ms of which 1 ms to minimize.
[2023-03-12 19:38:37] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 0 ms to minimize.
[2023-03-12 19:38:37] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 18 ms to minimize.
[2023-03-12 19:38:37] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 0 ms to minimize.
[2023-03-12 19:38:37] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
[2023-03-12 19:38:37] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 1 ms to minimize.
[2023-03-12 19:38:38] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1056 ms
[2023-03-12 19:38:38] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 0 ms to minimize.
[2023-03-12 19:38:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2023-03-12 19:38:38] [INFO ] Deduced a trap composed of 106 places in 161 ms of which 0 ms to minimize.
[2023-03-12 19:38:38] [INFO ] Deduced a trap composed of 104 places in 145 ms of which 1 ms to minimize.
[2023-03-12 19:38:38] [INFO ] Deduced a trap composed of 101 places in 133 ms of which 1 ms to minimize.
[2023-03-12 19:38:38] [INFO ] Deduced a trap composed of 98 places in 126 ms of which 0 ms to minimize.
[2023-03-12 19:38:39] [INFO ] Deduced a trap composed of 103 places in 125 ms of which 0 ms to minimize.
[2023-03-12 19:38:39] [INFO ] Deduced a trap composed of 92 places in 118 ms of which 1 ms to minimize.
[2023-03-12 19:38:39] [INFO ] Deduced a trap composed of 93 places in 117 ms of which 1 ms to minimize.
[2023-03-12 19:38:39] [INFO ] Deduced a trap composed of 104 places in 113 ms of which 1 ms to minimize.
[2023-03-12 19:38:39] [INFO ] Deduced a trap composed of 99 places in 125 ms of which 1 ms to minimize.
[2023-03-12 19:38:39] [INFO ] Deduced a trap composed of 95 places in 115 ms of which 0 ms to minimize.
[2023-03-12 19:38:40] [INFO ] Deduced a trap composed of 99 places in 159 ms of which 1 ms to minimize.
[2023-03-12 19:38:40] [INFO ] Deduced a trap composed of 117 places in 115 ms of which 1 ms to minimize.
[2023-03-12 19:38:40] [INFO ] Deduced a trap composed of 96 places in 134 ms of which 1 ms to minimize.
[2023-03-12 19:38:40] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 1 ms to minimize.
[2023-03-12 19:38:40] [INFO ] Deduced a trap composed of 95 places in 134 ms of which 0 ms to minimize.
[2023-03-12 19:38:40] [INFO ] Deduced a trap composed of 99 places in 140 ms of which 1 ms to minimize.
[2023-03-12 19:38:41] [INFO ] Deduced a trap composed of 101 places in 114 ms of which 1 ms to minimize.
[2023-03-12 19:38:41] [INFO ] Deduced a trap composed of 104 places in 123 ms of which 1 ms to minimize.
[2023-03-12 19:38:41] [INFO ] Deduced a trap composed of 105 places in 145 ms of which 0 ms to minimize.
[2023-03-12 19:38:41] [INFO ] Deduced a trap composed of 102 places in 121 ms of which 1 ms to minimize.
[2023-03-12 19:38:41] [INFO ] Deduced a trap composed of 107 places in 150 ms of which 1 ms to minimize.
[2023-03-12 19:38:41] [INFO ] Deduced a trap composed of 110 places in 118 ms of which 0 ms to minimize.
[2023-03-12 19:38:41] [INFO ] Deduced a trap composed of 99 places in 129 ms of which 1 ms to minimize.
[2023-03-12 19:38:42] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 3708 ms
[2023-03-12 19:38:42] [INFO ] After 5539ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:18
[2023-03-12 19:38:42] [INFO ] After 6117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2023-03-12 19:38:42] [INFO ] [Nat]Absence check using 64 positive place invariants in 24 ms returned sat
[2023-03-12 19:38:42] [INFO ] [Nat]Absence check using 64 positive and 43 generalized place invariants in 13 ms returned sat
[2023-03-12 19:38:43] [INFO ] After 537ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :17
[2023-03-12 19:38:43] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 1 ms to minimize.
[2023-03-12 19:38:43] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 2 ms to minimize.
[2023-03-12 19:38:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 233 ms
[2023-03-12 19:38:43] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 1 ms to minimize.
[2023-03-12 19:38:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2023-03-12 19:38:43] [INFO ] Deduced a trap composed of 97 places in 160 ms of which 1 ms to minimize.
[2023-03-12 19:38:43] [INFO ] Deduced a trap composed of 100 places in 178 ms of which 1 ms to minimize.
[2023-03-12 19:38:44] [INFO ] Deduced a trap composed of 98 places in 170 ms of which 1 ms to minimize.
[2023-03-12 19:38:44] [INFO ] Deduced a trap composed of 46 places in 142 ms of which 2 ms to minimize.
[2023-03-12 19:38:44] [INFO ] Deduced a trap composed of 90 places in 164 ms of which 0 ms to minimize.
[2023-03-12 19:38:44] [INFO ] Deduced a trap composed of 93 places in 186 ms of which 1 ms to minimize.
[2023-03-12 19:38:44] [INFO ] Deduced a trap composed of 101 places in 152 ms of which 1 ms to minimize.
[2023-03-12 19:38:45] [INFO ] Deduced a trap composed of 95 places in 162 ms of which 1 ms to minimize.
[2023-03-12 19:38:45] [INFO ] Deduced a trap composed of 33 places in 181 ms of which 0 ms to minimize.
[2023-03-12 19:38:45] [INFO ] Deduced a trap composed of 110 places in 177 ms of which 0 ms to minimize.
[2023-03-12 19:38:45] [INFO ] Deduced a trap composed of 98 places in 145 ms of which 1 ms to minimize.
[2023-03-12 19:38:45] [INFO ] Deduced a trap composed of 94 places in 161 ms of which 1 ms to minimize.
[2023-03-12 19:38:46] [INFO ] Deduced a trap composed of 106 places in 168 ms of which 0 ms to minimize.
[2023-03-12 19:38:46] [INFO ] Deduced a trap composed of 107 places in 215 ms of which 1 ms to minimize.
[2023-03-12 19:38:46] [INFO ] Deduced a trap composed of 98 places in 205 ms of which 1 ms to minimize.
[2023-03-12 19:38:46] [INFO ] Deduced a trap composed of 95 places in 149 ms of which 1 ms to minimize.
[2023-03-12 19:38:46] [INFO ] Deduced a trap composed of 111 places in 150 ms of which 1 ms to minimize.
[2023-03-12 19:38:47] [INFO ] Deduced a trap composed of 103 places in 142 ms of which 1 ms to minimize.
[2023-03-12 19:38:47] [INFO ] Deduced a trap composed of 110 places in 149 ms of which 0 ms to minimize.
[2023-03-12 19:38:47] [INFO ] Deduced a trap composed of 102 places in 136 ms of which 1 ms to minimize.
[2023-03-12 19:38:47] [INFO ] Deduced a trap composed of 104 places in 127 ms of which 5 ms to minimize.
[2023-03-12 19:38:47] [INFO ] Deduced a trap composed of 103 places in 152 ms of which 1 ms to minimize.
[2023-03-12 19:38:47] [INFO ] Deduced a trap composed of 45 places in 133 ms of which 1 ms to minimize.
[2023-03-12 19:38:48] [INFO ] Deduced a trap composed of 98 places in 163 ms of which 1 ms to minimize.
[2023-03-12 19:38:48] [INFO ] Deduced a trap composed of 105 places in 140 ms of which 0 ms to minimize.
[2023-03-12 19:38:48] [INFO ] Deduced a trap composed of 93 places in 160 ms of which 1 ms to minimize.
[2023-03-12 19:38:48] [INFO ] Deduced a trap composed of 103 places in 132 ms of which 1 ms to minimize.
[2023-03-12 19:38:48] [INFO ] Deduced a trap composed of 120 places in 119 ms of which 1 ms to minimize.
[2023-03-12 19:38:48] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 0 ms to minimize.
[2023-03-12 19:38:48] [INFO ] Deduced a trap composed of 43 places in 118 ms of which 0 ms to minimize.
[2023-03-12 19:38:49] [INFO ] Deduced a trap composed of 100 places in 118 ms of which 0 ms to minimize.
[2023-03-12 19:38:49] [INFO ] Deduced a trap composed of 99 places in 120 ms of which 1 ms to minimize.
[2023-03-12 19:38:49] [INFO ] Deduced a trap composed of 29 places in 132 ms of which 0 ms to minimize.
[2023-03-12 19:38:49] [INFO ] Deduced a trap composed of 27 places in 153 ms of which 0 ms to minimize.
[2023-03-12 19:38:49] [INFO ] Deduced a trap composed of 99 places in 163 ms of which 0 ms to minimize.
[2023-03-12 19:38:49] [INFO ] Deduced a trap composed of 101 places in 130 ms of which 1 ms to minimize.
[2023-03-12 19:38:49] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 6350 ms
[2023-03-12 19:38:50] [INFO ] Deduced a trap composed of 11 places in 155 ms of which 1 ms to minimize.
[2023-03-12 19:38:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 221 ms
[2023-03-12 19:38:50] [INFO ] Deduced a trap composed of 92 places in 181 ms of which 1 ms to minimize.
[2023-03-12 19:38:50] [INFO ] Deduced a trap composed of 91 places in 169 ms of which 1 ms to minimize.
[2023-03-12 19:38:51] [INFO ] Deduced a trap composed of 96 places in 225 ms of which 1 ms to minimize.
[2023-03-12 19:38:51] [INFO ] Deduced a trap composed of 95 places in 226 ms of which 1 ms to minimize.
[2023-03-12 19:38:51] [INFO ] Deduced a trap composed of 89 places in 164 ms of which 1 ms to minimize.
[2023-03-12 19:38:51] [INFO ] Deduced a trap composed of 94 places in 199 ms of which 0 ms to minimize.
[2023-03-12 19:38:51] [INFO ] Deduced a trap composed of 108 places in 145 ms of which 1 ms to minimize.
[2023-03-12 19:38:52] [INFO ] Deduced a trap composed of 35 places in 181 ms of which 1 ms to minimize.
[2023-03-12 19:38:52] [INFO ] Deduced a trap composed of 103 places in 214 ms of which 1 ms to minimize.
[2023-03-12 19:38:52] [INFO ] Deduced a trap composed of 97 places in 186 ms of which 0 ms to minimize.
[2023-03-12 19:38:52] [INFO ] Deduced a trap composed of 28 places in 183 ms of which 0 ms to minimize.
[2023-03-12 19:38:52] [INFO ] Deduced a trap composed of 65 places in 185 ms of which 1 ms to minimize.
[2023-03-12 19:38:53] [INFO ] Deduced a trap composed of 96 places in 178 ms of which 0 ms to minimize.
[2023-03-12 19:38:53] [INFO ] Deduced a trap composed of 97 places in 179 ms of which 1 ms to minimize.
[2023-03-12 19:38:53] [INFO ] Deduced a trap composed of 94 places in 215 ms of which 1 ms to minimize.
[2023-03-12 19:38:53] [INFO ] Deduced a trap composed of 92 places in 193 ms of which 0 ms to minimize.
[2023-03-12 19:38:54] [INFO ] Deduced a trap composed of 103 places in 189 ms of which 0 ms to minimize.
[2023-03-12 19:38:54] [INFO ] Deduced a trap composed of 28 places in 155 ms of which 1 ms to minimize.
[2023-03-12 19:38:54] [INFO ] Deduced a trap composed of 104 places in 227 ms of which 1 ms to minimize.
[2023-03-12 19:38:54] [INFO ] Deduced a trap composed of 42 places in 132 ms of which 1 ms to minimize.
[2023-03-12 19:38:55] [INFO ] Deduced a trap composed of 100 places in 177 ms of which 1 ms to minimize.
[2023-03-12 19:38:55] [INFO ] Deduced a trap composed of 102 places in 167 ms of which 1 ms to minimize.
[2023-03-12 19:38:55] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 4893 ms
[2023-03-12 19:38:55] [INFO ] After 12894ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :17
Attempting to minimize the solution found.
Minimization took 440 ms.
[2023-03-12 19:38:55] [INFO ] After 13755ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :17
Fused 18 Parikh solutions to 16 different solutions.
Parikh walk visited 2 properties in 339 ms.
Support contains 17 out of 549 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 549/549 places, 482/482 transitions.
Graph (trivial) has 249 edges and 549 vertex of which 6 / 549 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1222 edges and 544 vertex of which 542 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 542 transition count 405
Reduce places removed 68 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 69 rules applied. Total rules applied 139 place count 474 transition count 404
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 140 place count 473 transition count 404
Performed 107 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 107 Pre rules applied. Total rules applied 140 place count 473 transition count 297
Deduced a syphon composed of 107 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 234 rules applied. Total rules applied 374 place count 346 transition count 297
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 376 place count 344 transition count 295
Iterating global reduction 3 with 2 rules applied. Total rules applied 378 place count 344 transition count 295
Performed 138 Post agglomeration using F-continuation condition.Transition count delta: 138
Deduced a syphon composed of 138 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 3 with 279 rules applied. Total rules applied 657 place count 203 transition count 157
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 13 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 661 place count 201 transition count 164
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 663 place count 201 transition count 162
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 665 place count 199 transition count 162
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 670 place count 199 transition count 162
Applied a total of 670 rules in 191 ms. Remains 199 /549 variables (removed 350) and now considering 162/482 (removed 320) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 192 ms. Remains : 199/549 places, 162/482 transitions.
Incomplete random walk after 10000 steps, including 445 resets, run finished after 302 ms. (steps per millisecond=33 ) properties (out of 15) seen :13
Finished Best-First random walk after 1802 steps, including 20 resets, run visited all 2 properties in 20 ms. (steps per millisecond=90 )
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA BusinessProcesses-PT-20-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 481 stabilizing places and 424 stable transitions
Graph (complete) has 1229 edges and 549 vertex of which 547 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.26 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 2 out of 549 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 549/549 places, 482/482 transitions.
Graph (trivial) has 260 edges and 549 vertex of which 6 / 549 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1223 edges and 544 vertex of which 542 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 72 place count 541 transition count 403
Reduce places removed 70 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 71 rules applied. Total rules applied 143 place count 471 transition count 402
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 144 place count 470 transition count 402
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 111 Pre rules applied. Total rules applied 144 place count 470 transition count 291
Deduced a syphon composed of 111 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 3 with 244 rules applied. Total rules applied 388 place count 337 transition count 291
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 395 place count 330 transition count 284
Ensure Unique test removed 1 places
Iterating global reduction 3 with 8 rules applied. Total rules applied 403 place count 329 transition count 284
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 403 place count 329 transition count 283
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 405 place count 328 transition count 283
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 140
Deduced a syphon composed of 140 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 3 with 283 rules applied. Total rules applied 688 place count 185 transition count 143
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 692 place count 183 transition count 150
Applied a total of 692 rules in 95 ms. Remains 183 /549 variables (removed 366) and now considering 150/482 (removed 332) transitions.
[2023-03-12 19:38:57] [INFO ] Flow matrix only has 149 transitions (discarded 1 similar events)
// Phase 1: matrix 149 rows 183 cols
[2023-03-12 19:38:57] [INFO ] Computed 81 place invariants in 5 ms
[2023-03-12 19:38:57] [INFO ] Implicit Places using invariants in 227 ms returned [27, 28, 29, 30, 31, 36, 37, 41, 42, 43, 44, 45, 46, 47, 48, 51, 52, 53, 54, 55, 56, 57, 58]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 230 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 160/549 places, 150/482 transitions.
Applied a total of 0 rules in 20 ms. Remains 160 /160 variables (removed 0) and now considering 150/150 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 345 ms. Remains : 160/549 places, 150/482 transitions.
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s63 1), p1:(EQ s35 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 3 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-00 finished in 667 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0&&F(p1))||(p2&&X(G(p3))))))'
Support contains 6 out of 549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 549/549 places, 482/482 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 540 transition count 473
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 540 transition count 473
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 538 transition count 471
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 538 transition count 471
Applied a total of 22 rules in 115 ms. Remains 538 /549 variables (removed 11) and now considering 471/482 (removed 11) transitions.
// Phase 1: matrix 471 rows 538 cols
[2023-03-12 19:38:58] [INFO ] Computed 107 place invariants in 6 ms
[2023-03-12 19:38:58] [INFO ] Implicit Places using invariants in 334 ms returned []
[2023-03-12 19:38:58] [INFO ] Invariant cache hit.
[2023-03-12 19:38:58] [INFO ] Implicit Places using invariants and state equation in 543 ms returned []
Implicit Place search using SMT with State Equation took 879 ms to find 0 implicit places.
[2023-03-12 19:38:58] [INFO ] Invariant cache hit.
[2023-03-12 19:38:59] [INFO ] Dead Transitions using invariants and state equation in 387 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 538/549 places, 471/482 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1383 ms. Remains : 538/549 places, 471/482 transitions.
Stuttering acceptance computed with spot in 258 ms :[true, (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p3), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 5}], [{ cond=(NOT p3), acceptance={} source=4 dest: 0}, { cond=p3, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) p3), acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(AND (EQ s84 1) (EQ s338 1) (EQ s523 1)), p0:(EQ s64 1), p2:(EQ s277 0), p3:(EQ s102 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-02 finished in 1694 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(G((p1&&F(G(p2))))))))'
Support contains 2 out of 549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 549/549 places, 482/482 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 540 transition count 473
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 540 transition count 473
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 538 transition count 471
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 538 transition count 471
Applied a total of 22 rules in 51 ms. Remains 538 /549 variables (removed 11) and now considering 471/482 (removed 11) transitions.
[2023-03-12 19:38:59] [INFO ] Invariant cache hit.
[2023-03-12 19:38:59] [INFO ] Implicit Places using invariants in 360 ms returned []
[2023-03-12 19:38:59] [INFO ] Invariant cache hit.
[2023-03-12 19:39:00] [INFO ] Implicit Places using invariants and state equation in 748 ms returned []
Implicit Place search using SMT with State Equation took 1110 ms to find 0 implicit places.
[2023-03-12 19:39:00] [INFO ] Invariant cache hit.
[2023-03-12 19:39:01] [INFO ] Dead Transitions using invariants and state equation in 472 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 538/549 places, 471/482 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1636 ms. Remains : 538/549 places, 471/482 transitions.
Stuttering acceptance computed with spot in 155 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s287 1), p1:(EQ s203 0), p2:(EQ s203 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 207 steps with 0 reset in 3 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-03 finished in 1821 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(F(p1)))))'
Support contains 1 out of 549 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 549/549 places, 482/482 transitions.
Graph (trivial) has 261 edges and 549 vertex of which 6 / 549 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1223 edges and 544 vertex of which 542 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 73 place count 541 transition count 402
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 1 with 71 rules applied. Total rules applied 144 place count 470 transition count 402
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 112 Pre rules applied. Total rules applied 144 place count 470 transition count 290
Deduced a syphon composed of 112 places in 1 ms
Ensure Unique test removed 22 places
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 2 with 246 rules applied. Total rules applied 390 place count 336 transition count 290
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 397 place count 329 transition count 283
Ensure Unique test removed 1 places
Iterating global reduction 2 with 8 rules applied. Total rules applied 405 place count 328 transition count 283
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 405 place count 328 transition count 282
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 407 place count 327 transition count 282
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 140
Deduced a syphon composed of 140 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 283 rules applied. Total rules applied 690 place count 184 transition count 142
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 694 place count 182 transition count 149
Applied a total of 694 rules in 64 ms. Remains 182 /549 variables (removed 367) and now considering 149/482 (removed 333) transitions.
[2023-03-12 19:39:01] [INFO ] Flow matrix only has 148 transitions (discarded 1 similar events)
// Phase 1: matrix 148 rows 182 cols
[2023-03-12 19:39:01] [INFO ] Computed 81 place invariants in 2 ms
[2023-03-12 19:39:01] [INFO ] Implicit Places using invariants in 195 ms returned [29, 30, 31, 32, 33, 38, 39, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 197 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 158/549 places, 149/482 transitions.
Applied a total of 0 rules in 7 ms. Remains 158 /158 variables (removed 0) and now considering 149/149 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 269 ms. Remains : 158/549 places, 149/482 transitions.
Stuttering acceptance computed with spot in 295 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s6 0), p1:(EQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 15642 reset in 554 ms.
Stuttering criterion allowed to conclude after 7773 steps with 1224 reset in 27 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-04 finished in 1159 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(p0))&&G(p1))))'
Support contains 2 out of 549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 549/549 places, 482/482 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 542 transition count 475
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 542 transition count 475
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 541 transition count 474
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 541 transition count 474
Applied a total of 16 rules in 49 ms. Remains 541 /549 variables (removed 8) and now considering 474/482 (removed 8) transitions.
// Phase 1: matrix 474 rows 541 cols
[2023-03-12 19:39:02] [INFO ] Computed 107 place invariants in 7 ms
[2023-03-12 19:39:03] [INFO ] Implicit Places using invariants in 388 ms returned []
[2023-03-12 19:39:03] [INFO ] Invariant cache hit.
[2023-03-12 19:39:04] [INFO ] Implicit Places using invariants and state equation in 1000 ms returned []
Implicit Place search using SMT with State Equation took 1420 ms to find 0 implicit places.
[2023-03-12 19:39:04] [INFO ] Invariant cache hit.
[2023-03-12 19:39:04] [INFO ] Dead Transitions using invariants and state equation in 357 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 541/549 places, 474/482 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1840 ms. Remains : 541/549 places, 474/482 transitions.
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 3}, { cond=p1, acceptance={0} source=1 dest: 4}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 2}]], initial=0, aps=[p1:(NEQ s464 1), p0:(EQ s166 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 503 reset in 410 ms.
Product exploration explored 100000 steps with 510 reset in 326 ms.
Computed a total of 473 stabilizing places and 416 stable transitions
Graph (complete) has 1213 edges and 541 vertex of which 539 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Computed a total of 473 stabilizing places and 416 stable transitions
Detected a total of 473/541 stabilizing places and 416/474 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 521 ms. Reduced automaton from 6 states, 16 edges and 2 AP (stutter sensitive) to 6 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 324 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 48 resets, run finished after 287 ms. (steps per millisecond=34 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 19:39:06] [INFO ] Invariant cache hit.
[2023-03-12 19:39:06] [INFO ] [Real]Absence check using 64 positive place invariants in 20 ms returned sat
[2023-03-12 19:39:06] [INFO ] [Real]Absence check using 64 positive and 43 generalized place invariants in 19 ms returned sat
[2023-03-12 19:39:07] [INFO ] After 214ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-12 19:39:07] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 1 ms to minimize.
[2023-03-12 19:39:07] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 1 ms to minimize.
[2023-03-12 19:39:07] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 0 ms to minimize.
[2023-03-12 19:39:07] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 0 ms to minimize.
[2023-03-12 19:39:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 523 ms
[2023-03-12 19:39:07] [INFO ] After 766ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 19:39:07] [INFO ] After 924ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 19:39:07] [INFO ] [Nat]Absence check using 64 positive place invariants in 20 ms returned sat
[2023-03-12 19:39:07] [INFO ] [Nat]Absence check using 64 positive and 43 generalized place invariants in 12 ms returned sat
[2023-03-12 19:39:07] [INFO ] After 199ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 19:39:08] [INFO ] Deduced a trap composed of 94 places in 183 ms of which 1 ms to minimize.
[2023-03-12 19:39:08] [INFO ] Deduced a trap composed of 36 places in 131 ms of which 1 ms to minimize.
[2023-03-12 19:39:08] [INFO ] Deduced a trap composed of 95 places in 180 ms of which 1 ms to minimize.
[2023-03-12 19:39:08] [INFO ] Deduced a trap composed of 87 places in 191 ms of which 0 ms to minimize.
[2023-03-12 19:39:08] [INFO ] Deduced a trap composed of 91 places in 140 ms of which 0 ms to minimize.
[2023-03-12 19:39:09] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 1 ms to minimize.
[2023-03-12 19:39:09] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 0 ms to minimize.
[2023-03-12 19:39:09] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 0 ms to minimize.
[2023-03-12 19:39:09] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2023-03-12 19:39:09] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 0 ms to minimize.
[2023-03-12 19:39:09] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 0 ms to minimize.
[2023-03-12 19:39:09] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1621 ms
[2023-03-12 19:39:09] [INFO ] After 1876ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-03-12 19:39:09] [INFO ] After 2059ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 16 ms.
Support contains 2 out of 541 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 541/541 places, 474/474 transitions.
Graph (trivial) has 252 edges and 541 vertex of which 6 / 541 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1206 edges and 536 vertex of which 534 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 71 place count 534 transition count 396
Reduce places removed 69 places and 0 transitions.
Iterating post reduction 1 with 69 rules applied. Total rules applied 140 place count 465 transition count 396
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 111 Pre rules applied. Total rules applied 140 place count 465 transition count 285
Deduced a syphon composed of 111 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 244 rules applied. Total rules applied 384 place count 332 transition count 285
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 2 with 289 rules applied. Total rules applied 673 place count 186 transition count 142
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 677 place count 184 transition count 149
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 679 place count 184 transition count 147
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 681 place count 182 transition count 147
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 682 place count 182 transition count 147
Applied a total of 682 rules in 70 ms. Remains 182 /541 variables (removed 359) and now considering 147/474 (removed 327) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 182/541 places, 147/474 transitions.
Finished random walk after 101 steps, including 3 resets, run visited all 2 properties in 2 ms. (steps per millisecond=50 )
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 7 factoid took 1069 ms. Reduced automaton from 6 states, 16 edges and 2 AP (stutter sensitive) to 6 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 528 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 316 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
[2023-03-12 19:39:11] [INFO ] Invariant cache hit.
[2023-03-12 19:39:11] [INFO ] [Real]Absence check using 64 positive place invariants in 28 ms returned sat
[2023-03-12 19:39:11] [INFO ] [Real]Absence check using 64 positive and 43 generalized place invariants in 3 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) (NOT p0))), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 7 factoid took 197 ms. Reduced automaton from 6 states, 16 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-20-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-20-LTLFireability-05 finished in 9575 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 2 out of 549 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 549/549 places, 482/482 transitions.
Graph (trivial) has 261 edges and 549 vertex of which 6 / 549 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1223 edges and 544 vertex of which 542 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 74 place count 541 transition count 401
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 146 place count 469 transition count 401
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 112 Pre rules applied. Total rules applied 146 place count 469 transition count 289
Deduced a syphon composed of 112 places in 1 ms
Ensure Unique test removed 22 places
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 2 with 246 rules applied. Total rules applied 392 place count 335 transition count 289
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 398 place count 329 transition count 283
Ensure Unique test removed 1 places
Iterating global reduction 2 with 7 rules applied. Total rules applied 405 place count 328 transition count 283
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 405 place count 328 transition count 282
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 407 place count 327 transition count 282
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 140
Deduced a syphon composed of 140 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 283 rules applied. Total rules applied 690 place count 184 transition count 142
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 694 place count 182 transition count 149
Applied a total of 694 rules in 54 ms. Remains 182 /549 variables (removed 367) and now considering 149/482 (removed 333) transitions.
[2023-03-12 19:39:12] [INFO ] Flow matrix only has 148 transitions (discarded 1 similar events)
// Phase 1: matrix 148 rows 182 cols
[2023-03-12 19:39:12] [INFO ] Computed 81 place invariants in 1 ms
[2023-03-12 19:39:12] [INFO ] Implicit Places using invariants in 137 ms returned [27, 28, 29, 30, 31, 36, 37, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 140 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 158/549 places, 149/482 transitions.
Applied a total of 0 rules in 5 ms. Remains 158 /158 variables (removed 0) and now considering 149/149 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 199 ms. Remains : 158/549 places, 149/482 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(EQ s107 1), p0:(EQ s133 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-07 finished in 309 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 549/549 places, 482/482 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 541 transition count 474
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 541 transition count 474
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 539 transition count 472
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 539 transition count 472
Applied a total of 20 rules in 36 ms. Remains 539 /549 variables (removed 10) and now considering 472/482 (removed 10) transitions.
// Phase 1: matrix 472 rows 539 cols
[2023-03-12 19:39:12] [INFO ] Computed 107 place invariants in 4 ms
[2023-03-12 19:39:12] [INFO ] Implicit Places using invariants in 217 ms returned []
[2023-03-12 19:39:12] [INFO ] Invariant cache hit.
[2023-03-12 19:39:13] [INFO ] Implicit Places using invariants and state equation in 591 ms returned []
Implicit Place search using SMT with State Equation took 812 ms to find 0 implicit places.
[2023-03-12 19:39:13] [INFO ] Invariant cache hit.
[2023-03-12 19:39:13] [INFO ] Dead Transitions using invariants and state equation in 341 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 539/549 places, 472/482 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1191 ms. Remains : 539/549 places, 472/482 transitions.
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s480 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 24399 steps with 122 reset in 47 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-08 finished in 1340 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))&&(p1||X(p2)))))'
Support contains 6 out of 549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 549/549 places, 482/482 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 540 transition count 473
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 540 transition count 473
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 538 transition count 471
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 538 transition count 471
Applied a total of 22 rules in 44 ms. Remains 538 /549 variables (removed 11) and now considering 471/482 (removed 11) transitions.
// Phase 1: matrix 471 rows 538 cols
[2023-03-12 19:39:13] [INFO ] Computed 107 place invariants in 4 ms
[2023-03-12 19:39:14] [INFO ] Implicit Places using invariants in 193 ms returned []
[2023-03-12 19:39:14] [INFO ] Invariant cache hit.
[2023-03-12 19:39:14] [INFO ] Implicit Places using invariants and state equation in 551 ms returned []
Implicit Place search using SMT with State Equation took 746 ms to find 0 implicit places.
[2023-03-12 19:39:14] [INFO ] Invariant cache hit.
[2023-03-12 19:39:14] [INFO ] Dead Transitions using invariants and state equation in 284 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 538/549 places, 471/482 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1075 ms. Remains : 538/549 places, 471/482 transitions.
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(AND (EQ s189 1) (EQ s345 1) (EQ s503 1)), p2:(AND (EQ s225 1) (EQ s425 1) (EQ s503 1)), p1:(EQ s29 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-10 finished in 1284 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((p0&&X(X(X(p1)))))||G(p2))))'
Support contains 6 out of 549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 549/549 places, 482/482 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 541 transition count 474
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 541 transition count 474
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 539 transition count 472
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 539 transition count 472
Applied a total of 20 rules in 38 ms. Remains 539 /549 variables (removed 10) and now considering 472/482 (removed 10) transitions.
// Phase 1: matrix 472 rows 539 cols
[2023-03-12 19:39:15] [INFO ] Computed 107 place invariants in 4 ms
[2023-03-12 19:39:15] [INFO ] Implicit Places using invariants in 178 ms returned []
[2023-03-12 19:39:15] [INFO ] Invariant cache hit.
[2023-03-12 19:39:15] [INFO ] Implicit Places using invariants and state equation in 564 ms returned []
Implicit Place search using SMT with State Equation took 746 ms to find 0 implicit places.
[2023-03-12 19:39:15] [INFO ] Invariant cache hit.
[2023-03-12 19:39:16] [INFO ] Dead Transitions using invariants and state equation in 269 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 539/549 places, 472/482 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1058 ms. Remains : 539/549 places, 472/482 transitions.
Stuttering acceptance computed with spot in 413 ms :[(NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), true, (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 8}], [{ cond=true, acceptance={} source=1 dest: 10}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 8}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 11}], [{ cond=true, acceptance={} source=4 dest: 0}], [{ cond=p2, acceptance={} source=5 dest: 2}, { cond=(NOT p2), acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 4}], [{ cond=(AND p2 p0), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p2) p0), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=7 dest: 8}, { cond=(AND p2 (NOT p0)), acceptance={} source=7 dest: 11}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=p0, acceptance={} source=9 dest: 6}, { cond=(NOT p0), acceptance={} source=9 dest: 8}], [{ cond=p2, acceptance={} source=10 dest: 7}, { cond=(NOT p2), acceptance={} source=10 dest: 9}], [{ cond=(NOT p2), acceptance={} source=11 dest: 8}, { cond=p2, acceptance={} source=11 dest: 11}]], initial=1, aps=[p1:(EQ s467 1), p2:(EQ s395 1), p0:(OR (EQ s225 0) (EQ s425 0) (EQ s504 0) (EQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-11 finished in 1490 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 549/549 places, 482/482 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 540 transition count 473
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 540 transition count 473
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 538 transition count 471
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 538 transition count 471
Applied a total of 22 rules in 33 ms. Remains 538 /549 variables (removed 11) and now considering 471/482 (removed 11) transitions.
// Phase 1: matrix 471 rows 538 cols
[2023-03-12 19:39:16] [INFO ] Computed 107 place invariants in 3 ms
[2023-03-12 19:39:16] [INFO ] Implicit Places using invariants in 175 ms returned []
[2023-03-12 19:39:16] [INFO ] Invariant cache hit.
[2023-03-12 19:39:17] [INFO ] Implicit Places using invariants and state equation in 667 ms returned []
Implicit Place search using SMT with State Equation took 850 ms to find 0 implicit places.
[2023-03-12 19:39:17] [INFO ] Invariant cache hit.
[2023-03-12 19:39:17] [INFO ] Dead Transitions using invariants and state equation in 259 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 538/549 places, 471/482 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1148 ms. Remains : 538/549 places, 471/482 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s491 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 177 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-12 finished in 1234 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G((X(X(!F(p0))) U p0)))))'
Support contains 2 out of 549 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 549/549 places, 482/482 transitions.
Graph (trivial) has 261 edges and 549 vertex of which 6 / 549 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1223 edges and 544 vertex of which 542 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 74 place count 541 transition count 401
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 146 place count 469 transition count 401
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 112 Pre rules applied. Total rules applied 146 place count 469 transition count 289
Deduced a syphon composed of 112 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 2 with 246 rules applied. Total rules applied 392 place count 335 transition count 289
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 400 place count 327 transition count 281
Ensure Unique test removed 1 places
Iterating global reduction 2 with 9 rules applied. Total rules applied 409 place count 326 transition count 281
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 409 place count 326 transition count 280
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 411 place count 325 transition count 280
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 140
Deduced a syphon composed of 140 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 283 rules applied. Total rules applied 694 place count 182 transition count 140
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 696 place count 181 transition count 143
Applied a total of 696 rules in 47 ms. Remains 181 /549 variables (removed 368) and now considering 143/482 (removed 339) transitions.
// Phase 1: matrix 143 rows 181 cols
[2023-03-12 19:39:17] [INFO ] Computed 81 place invariants in 2 ms
[2023-03-12 19:39:17] [INFO ] Implicit Places using invariants in 155 ms returned [28, 29, 30, 31, 32, 37, 38, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 157 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 157/549 places, 143/482 transitions.
Applied a total of 0 rules in 6 ms. Remains 157 /157 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 211 ms. Remains : 157/549 places, 143/482 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s3 1) (EQ s107 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-13 finished in 265 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((!p0||X(F(p0))))||((!p0||X(F(p0)))&&F(G(p1))))))'
Support contains 4 out of 549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 549/549 places, 482/482 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 541 transition count 474
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 541 transition count 474
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 539 transition count 472
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 539 transition count 472
Applied a total of 20 rules in 41 ms. Remains 539 /549 variables (removed 10) and now considering 472/482 (removed 10) transitions.
// Phase 1: matrix 472 rows 539 cols
[2023-03-12 19:39:18] [INFO ] Computed 107 place invariants in 6 ms
[2023-03-12 19:39:18] [INFO ] Implicit Places using invariants in 216 ms returned []
[2023-03-12 19:39:18] [INFO ] Invariant cache hit.
[2023-03-12 19:39:18] [INFO ] Implicit Places using invariants and state equation in 532 ms returned []
Implicit Place search using SMT with State Equation took 751 ms to find 0 implicit places.
[2023-03-12 19:39:18] [INFO ] Invariant cache hit.
[2023-03-12 19:39:19] [INFO ] Dead Transitions using invariants and state equation in 293 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 539/549 places, 472/482 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1087 ms. Remains : 539/549 places, 472/482 transitions.
Stuttering acceptance computed with spot in 211 ms :[false, false, (NOT p0), false, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s82 1) (EQ s331 1) (EQ s521 1)), p1:(NEQ s51 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 508 reset in 240 ms.
Product exploration explored 100000 steps with 503 reset in 243 ms.
Computed a total of 471 stabilizing places and 414 stable transitions
Graph (complete) has 1212 edges and 539 vertex of which 537 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Computed a total of 471 stabilizing places and 414 stable transitions
Detected a total of 471/539 stabilizing places and 414/472 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 268 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[false, false, (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 48 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 656965 steps, run timeout after 3001 ms. (steps per millisecond=218 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 656965 steps, saw 106307 distinct states, run finished after 3002 ms. (steps per millisecond=218 ) properties seen :2
Running SMT prover for 1 properties.
[2023-03-12 19:39:23] [INFO ] Invariant cache hit.
[2023-03-12 19:39:23] [INFO ] [Real]Absence check using 64 positive place invariants in 19 ms returned sat
[2023-03-12 19:39:23] [INFO ] [Real]Absence check using 64 positive and 43 generalized place invariants in 14 ms returned sat
[2023-03-12 19:39:23] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 19:39:23] [INFO ] [Nat]Absence check using 64 positive place invariants in 22 ms returned sat
[2023-03-12 19:39:23] [INFO ] [Nat]Absence check using 64 positive and 43 generalized place invariants in 27 ms returned sat
[2023-03-12 19:39:24] [INFO ] After 206ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 19:39:24] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 1 ms to minimize.
[2023-03-12 19:39:24] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 0 ms to minimize.
[2023-03-12 19:39:24] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2023-03-12 19:39:24] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 1 ms to minimize.
[2023-03-12 19:39:24] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 0 ms to minimize.
[2023-03-12 19:39:24] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 0 ms to minimize.
[2023-03-12 19:39:24] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 0 ms to minimize.
[2023-03-12 19:39:24] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 0 ms to minimize.
[2023-03-12 19:39:24] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 794 ms
[2023-03-12 19:39:24] [INFO ] After 1039ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-12 19:39:24] [INFO ] After 1241ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 539 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 539/539 places, 472/472 transitions.
Graph (trivial) has 251 edges and 539 vertex of which 6 / 539 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1205 edges and 534 vertex of which 532 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 69 place count 532 transition count 396
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 1 with 67 rules applied. Total rules applied 136 place count 465 transition count 396
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 111 Pre rules applied. Total rules applied 136 place count 465 transition count 285
Deduced a syphon composed of 111 places in 1 ms
Ensure Unique test removed 22 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 244 rules applied. Total rules applied 380 place count 332 transition count 285
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 142
Deduced a syphon composed of 142 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 2 with 288 rules applied. Total rules applied 668 place count 186 transition count 143
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 672 place count 184 transition count 150
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 674 place count 184 transition count 148
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 676 place count 182 transition count 148
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 677 place count 182 transition count 148
Applied a total of 677 rules in 54 ms. Remains 182 /539 variables (removed 357) and now considering 148/472 (removed 324) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 182/539 places, 148/472 transitions.
Incomplete random walk after 10000 steps, including 489 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 163 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 877503 steps, run timeout after 3001 ms. (steps per millisecond=292 ) properties seen :{}
Probabilistic random walk after 877503 steps, saw 260835 distinct states, run finished after 3001 ms. (steps per millisecond=292 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 19:39:28] [INFO ] Flow matrix only has 147 transitions (discarded 1 similar events)
// Phase 1: matrix 147 rows 182 cols
[2023-03-12 19:39:28] [INFO ] Computed 81 place invariants in 3 ms
[2023-03-12 19:39:28] [INFO ] [Real]Absence check using 64 positive place invariants in 9 ms returned sat
[2023-03-12 19:39:28] [INFO ] [Real]Absence check using 64 positive and 17 generalized place invariants in 4 ms returned sat
[2023-03-12 19:39:28] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 19:39:28] [INFO ] [Nat]Absence check using 64 positive place invariants in 12 ms returned sat
[2023-03-12 19:39:28] [INFO ] [Nat]Absence check using 64 positive and 17 generalized place invariants in 6 ms returned sat
[2023-03-12 19:39:28] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 19:39:28] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-12 19:39:28] [INFO ] After 22ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 19:39:28] [INFO ] After 40ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-12 19:39:28] [INFO ] After 205ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 19 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=19 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 6 factoid took 299 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[false, false, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 128 ms :[false, false, (AND (NOT p0) (NOT p1))]
Support contains 4 out of 539 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 539/539 places, 472/472 transitions.
Applied a total of 0 rules in 11 ms. Remains 539 /539 variables (removed 0) and now considering 472/472 (removed 0) transitions.
// Phase 1: matrix 472 rows 539 cols
[2023-03-12 19:39:28] [INFO ] Computed 107 place invariants in 7 ms
[2023-03-12 19:39:29] [INFO ] Implicit Places using invariants in 230 ms returned []
[2023-03-12 19:39:29] [INFO ] Invariant cache hit.
[2023-03-12 19:39:29] [INFO ] Implicit Places using invariants and state equation in 577 ms returned []
Implicit Place search using SMT with State Equation took 809 ms to find 0 implicit places.
[2023-03-12 19:39:29] [INFO ] Invariant cache hit.
[2023-03-12 19:39:29] [INFO ] Dead Transitions using invariants and state equation in 278 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1099 ms. Remains : 539/539 places, 472/472 transitions.
Computed a total of 471 stabilizing places and 414 stable transitions
Graph (complete) has 1212 edges and 539 vertex of which 537 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Computed a total of 471 stabilizing places and 414 stable transitions
Detected a total of 471/539 stabilizing places and 414/472 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 244 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[false, false, (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 50 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 519450 steps, run timeout after 3001 ms. (steps per millisecond=173 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 519450 steps, saw 87316 distinct states, run finished after 3001 ms. (steps per millisecond=173 ) properties seen :2
Running SMT prover for 1 properties.
[2023-03-12 19:39:33] [INFO ] Invariant cache hit.
[2023-03-12 19:39:33] [INFO ] [Real]Absence check using 64 positive place invariants in 20 ms returned sat
[2023-03-12 19:39:33] [INFO ] [Real]Absence check using 64 positive and 43 generalized place invariants in 15 ms returned sat
[2023-03-12 19:39:33] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 19:39:33] [INFO ] [Nat]Absence check using 64 positive place invariants in 24 ms returned sat
[2023-03-12 19:39:33] [INFO ] [Nat]Absence check using 64 positive and 43 generalized place invariants in 18 ms returned sat
[2023-03-12 19:39:34] [INFO ] After 196ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 19:39:34] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 0 ms to minimize.
[2023-03-12 19:39:34] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 0 ms to minimize.
[2023-03-12 19:39:34] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2023-03-12 19:39:34] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 0 ms to minimize.
[2023-03-12 19:39:34] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 1 ms to minimize.
[2023-03-12 19:39:34] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2023-03-12 19:39:34] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 0 ms to minimize.
[2023-03-12 19:39:34] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 1 ms to minimize.
[2023-03-12 19:39:34] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 792 ms
[2023-03-12 19:39:34] [INFO ] After 1016ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-03-12 19:39:34] [INFO ] After 1210ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 4 out of 539 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 539/539 places, 472/472 transitions.
Graph (trivial) has 251 edges and 539 vertex of which 6 / 539 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1205 edges and 534 vertex of which 532 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 69 place count 532 transition count 396
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 1 with 67 rules applied. Total rules applied 136 place count 465 transition count 396
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 111 Pre rules applied. Total rules applied 136 place count 465 transition count 285
Deduced a syphon composed of 111 places in 1 ms
Ensure Unique test removed 22 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 244 rules applied. Total rules applied 380 place count 332 transition count 285
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 142
Deduced a syphon composed of 142 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 2 with 288 rules applied. Total rules applied 668 place count 186 transition count 143
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 672 place count 184 transition count 150
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 674 place count 184 transition count 148
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 676 place count 182 transition count 148
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 677 place count 182 transition count 148
Applied a total of 677 rules in 63 ms. Remains 182 /539 variables (removed 357) and now considering 148/472 (removed 324) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 182/539 places, 148/472 transitions.
Incomplete random walk after 10000 steps, including 506 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 170 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 980347 steps, run timeout after 3001 ms. (steps per millisecond=326 ) properties seen :{}
Probabilistic random walk after 980347 steps, saw 289471 distinct states, run finished after 3004 ms. (steps per millisecond=326 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 19:39:38] [INFO ] Flow matrix only has 147 transitions (discarded 1 similar events)
// Phase 1: matrix 147 rows 182 cols
[2023-03-12 19:39:38] [INFO ] Computed 81 place invariants in 3 ms
[2023-03-12 19:39:38] [INFO ] [Real]Absence check using 64 positive place invariants in 10 ms returned sat
[2023-03-12 19:39:38] [INFO ] [Real]Absence check using 64 positive and 17 generalized place invariants in 4 ms returned sat
[2023-03-12 19:39:38] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 19:39:38] [INFO ] [Nat]Absence check using 64 positive place invariants in 10 ms returned sat
[2023-03-12 19:39:38] [INFO ] [Nat]Absence check using 64 positive and 17 generalized place invariants in 4 ms returned sat
[2023-03-12 19:39:38] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 19:39:38] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-12 19:39:38] [INFO ] After 15ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 19:39:38] [INFO ] After 29ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-12 19:39:38] [INFO ] After 158ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 19 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=19 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 8 factoid took 377 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[false, false, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 143 ms :[false, false, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 155 ms :[false, false, (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 505 reset in 239 ms.
Product exploration explored 100000 steps with 499 reset in 231 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 116 ms :[false, false, (AND (NOT p0) (NOT p1))]
Support contains 4 out of 539 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 539/539 places, 472/472 transitions.
Graph (trivial) has 251 edges and 539 vertex of which 6 / 539 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1206 edges and 534 vertex of which 532 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 61 rules applied. Total rules applied 63 place count 532 transition count 464
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 86 Pre rules applied. Total rules applied 63 place count 532 transition count 524
Deduced a syphon composed of 147 places in 1 ms
Iterating global reduction 1 with 86 rules applied. Total rules applied 149 place count 532 transition count 524
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 176 place count 505 transition count 479
Deduced a syphon composed of 120 places in 1 ms
Iterating global reduction 1 with 27 rules applied. Total rules applied 203 place count 505 transition count 479
Performed 172 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 292 places in 0 ms
Iterating global reduction 1 with 172 rules applied. Total rules applied 375 place count 505 transition count 479
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 419 place count 461 transition count 435
Deduced a syphon composed of 248 places in 0 ms
Iterating global reduction 1 with 44 rules applied. Total rules applied 463 place count 461 transition count 435
Deduced a syphon composed of 248 places in 0 ms
Applied a total of 463 rules in 108 ms. Remains 461 /539 variables (removed 78) and now considering 435/472 (removed 37) transitions.
[2023-03-12 19:39:40] [INFO ] Redundant transitions in 32 ms returned []
// Phase 1: matrix 435 rows 461 cols
[2023-03-12 19:39:40] [INFO ] Computed 107 place invariants in 5 ms
[2023-03-12 19:39:40] [INFO ] Dead Transitions using invariants and state equation in 303 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 461/539 places, 435/472 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 450 ms. Remains : 461/539 places, 435/472 transitions.
Support contains 4 out of 539 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 539/539 places, 472/472 transitions.
Applied a total of 0 rules in 23 ms. Remains 539 /539 variables (removed 0) and now considering 472/472 (removed 0) transitions.
// Phase 1: matrix 472 rows 539 cols
[2023-03-12 19:39:40] [INFO ] Computed 107 place invariants in 7 ms
[2023-03-12 19:39:40] [INFO ] Implicit Places using invariants in 241 ms returned []
[2023-03-12 19:39:40] [INFO ] Invariant cache hit.
[2023-03-12 19:39:41] [INFO ] Implicit Places using invariants and state equation in 577 ms returned []
Implicit Place search using SMT with State Equation took 823 ms to find 0 implicit places.
[2023-03-12 19:39:41] [INFO ] Invariant cache hit.
[2023-03-12 19:39:41] [INFO ] Dead Transitions using invariants and state equation in 273 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1121 ms. Remains : 539/539 places, 472/472 transitions.
Treatment of property BusinessProcesses-PT-20-LTLFireability-14 finished in 23610 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((!p0||X(F(p0))))||((!p0||X(F(p0)))&&F(G(p1))))))'
[2023-03-12 19:39:41] [INFO ] Flatten gal took : 54 ms
[2023-03-12 19:39:41] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-12 19:39:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 549 places, 482 transitions and 1533 arcs took 6 ms.
Total runtime 69230 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1622/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : BusinessProcesses-PT-20-LTLFireability-14

BK_STOP 1678649982341

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name BusinessProcesses-PT-20-LTLFireability-14
ltl formula formula --ltl=/tmp/1622/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 549 places, 482 transitions and 1533 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.030 user 0.030 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1622/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1622/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1622/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1622/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted

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="BusinessProcesses-PT-20"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is BusinessProcesses-PT-20, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r041-tajo-167813694900604"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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