Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 11 16:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 11 16:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 11 16:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 141K May 18 16:42 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-11-CTLFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-2023-12
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-2023-13
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-2023-14
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717225600977

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-11
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:06:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 07:06:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:06:42] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2024-06-01 07:06:42] [INFO ] Transformed 567 places.
[2024-06-01 07:06:42] [INFO ] Transformed 508 transitions.
[2024-06-01 07:06:42] [INFO ] Found NUPN structural information;
[2024-06-01 07:06:42] [INFO ] Parsed PT model containing 567 places and 508 transitions and 1512 arcs in 203 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 21 ms.
Deduced a syphon composed of 7 places in 7 ms
Reduce places removed 7 places and 7 transitions.
Support contains 129 out of 560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 560/560 places, 501/501 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 556 transition count 501
Discarding 57 places :
Symmetric choice reduction at 1 with 57 rule applications. Total rules 61 place count 499 transition count 444
Iterating global reduction 1 with 57 rules applied. Total rules applied 118 place count 499 transition count 444
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 143 place count 474 transition count 419
Iterating global reduction 1 with 25 rules applied. Total rules applied 168 place count 474 transition count 419
Applied a total of 168 rules in 106 ms. Remains 474 /560 variables (removed 86) and now considering 419/501 (removed 82) transitions.
// Phase 1: matrix 419 rows 474 cols
[2024-06-01 07:06:42] [INFO ] Computed 91 invariants in 31 ms
[2024-06-01 07:06:43] [INFO ] Implicit Places using invariants in 339 ms returned []
[2024-06-01 07:06:43] [INFO ] Invariant cache hit.
[2024-06-01 07:06:43] [INFO ] Implicit Places using invariants and state equation in 352 ms returned []
Implicit Place search using SMT with State Equation took 720 ms to find 0 implicit places.
Running 418 sub problems to find dead transitions.
[2024-06-01 07:06:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/473 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/473 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 2 (OVERLAPS) 1/474 variables, 49/87 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/474 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 418 unsolved
[2024-06-01 07:06:52] [INFO ] Deduced a trap composed of 70 places in 145 ms of which 26 ms to minimize.
[2024-06-01 07:06:52] [INFO ] Deduced a trap composed of 69 places in 166 ms of which 3 ms to minimize.
[2024-06-01 07:06:53] [INFO ] Deduced a trap composed of 69 places in 749 ms of which 16 ms to minimize.
[2024-06-01 07:06:53] [INFO ] Deduced a trap composed of 70 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:06:53] [INFO ] Deduced a trap composed of 74 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:06:54] [INFO ] Deduced a trap composed of 91 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:06:54] [INFO ] Deduced a trap composed of 70 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:06:54] [INFO ] Deduced a trap composed of 91 places in 187 ms of which 2 ms to minimize.
[2024-06-01 07:06:54] [INFO ] Deduced a trap composed of 71 places in 103 ms of which 3 ms to minimize.
[2024-06-01 07:06:54] [INFO ] Deduced a trap composed of 68 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:06:54] [INFO ] Deduced a trap composed of 70 places in 87 ms of which 3 ms to minimize.
[2024-06-01 07:06:54] [INFO ] Deduced a trap composed of 72 places in 158 ms of which 28 ms to minimize.
[2024-06-01 07:06:55] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:06:55] [INFO ] Deduced a trap composed of 68 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:06:55] [INFO ] Deduced a trap composed of 68 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:06:55] [INFO ] Deduced a trap composed of 68 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:06:55] [INFO ] Deduced a trap composed of 89 places in 203 ms of which 2 ms to minimize.
[2024-06-01 07:06:55] [INFO ] Deduced a trap composed of 68 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:06:55] [INFO ] Deduced a trap composed of 71 places in 165 ms of which 2 ms to minimize.
[2024-06-01 07:06:56] [INFO ] Deduced a trap composed of 70 places in 169 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/474 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 418 unsolved
[2024-06-01 07:06:56] [INFO ] Deduced a trap composed of 70 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:06:56] [INFO ] Deduced a trap composed of 72 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:06:56] [INFO ] Deduced a trap composed of 72 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:06:56] [INFO ] Deduced a trap composed of 71 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:06:56] [INFO ] Deduced a trap composed of 75 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:06:57] [INFO ] Deduced a trap composed of 72 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:06:57] [INFO ] Deduced a trap composed of 69 places in 89 ms of which 3 ms to minimize.
[2024-06-01 07:06:57] [INFO ] Deduced a trap composed of 73 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:06:57] [INFO ] Deduced a trap composed of 71 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:06:57] [INFO ] Deduced a trap composed of 69 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:06:57] [INFO ] Deduced a trap composed of 97 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:06:57] [INFO ] Deduced a trap composed of 69 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:06:57] [INFO ] Deduced a trap composed of 92 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:06:57] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 8 ms to minimize.
[2024-06-01 07:06:58] [INFO ] Deduced a trap composed of 87 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:06:58] [INFO ] Deduced a trap composed of 67 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:06:58] [INFO ] Deduced a trap composed of 90 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:06:58] [INFO ] Deduced a trap composed of 73 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:06:58] [INFO ] Deduced a trap composed of 68 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:06:58] [INFO ] Deduced a trap composed of 100 places in 115 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/474 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 418 unsolved
[2024-06-01 07:06:59] [INFO ] Deduced a trap composed of 74 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:06:59] [INFO ] Deduced a trap composed of 68 places in 98 ms of which 3 ms to minimize.
[2024-06-01 07:06:59] [INFO ] Deduced a trap composed of 67 places in 92 ms of which 3 ms to minimize.
[2024-06-01 07:06:59] [INFO ] Deduced a trap composed of 92 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:06:59] [INFO ] Deduced a trap composed of 80 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:06:59] [INFO ] Deduced a trap composed of 95 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:07:00] [INFO ] Deduced a trap composed of 94 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:07:00] [INFO ] Deduced a trap composed of 83 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:07:00] [INFO ] Deduced a trap composed of 70 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:07:00] [INFO ] Deduced a trap composed of 74 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:07:00] [INFO ] Deduced a trap composed of 91 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:07:00] [INFO ] Deduced a trap composed of 70 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:07:00] [INFO ] Deduced a trap composed of 75 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:07:01] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:07:01] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:07:01] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 10 ms to minimize.
[2024-06-01 07:07:01] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:07:01] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:07:01] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:07:02] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/474 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 418 unsolved
[2024-06-01 07:07:05] [INFO ] Deduced a trap composed of 90 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:07:05] [INFO ] Deduced a trap composed of 70 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:07:05] [INFO ] Deduced a trap composed of 71 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:07:05] [INFO ] Deduced a trap composed of 69 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:07:05] [INFO ] Deduced a trap composed of 90 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:07:05] [INFO ] Deduced a trap composed of 89 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:07:05] [INFO ] Deduced a trap composed of 71 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:07:06] [INFO ] Deduced a trap composed of 73 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:07:06] [INFO ] Deduced a trap composed of 71 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:07:06] [INFO ] Deduced a trap composed of 90 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:07:06] [INFO ] Deduced a trap composed of 66 places in 125 ms of which 10 ms to minimize.
[2024-06-01 07:07:06] [INFO ] Deduced a trap composed of 72 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:07:06] [INFO ] Deduced a trap composed of 75 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:07:07] [INFO ] Deduced a trap composed of 93 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:07:07] [INFO ] Deduced a trap composed of 76 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:07:07] [INFO ] Deduced a trap composed of 71 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:07:07] [INFO ] Deduced a trap composed of 68 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:07:07] [INFO ] Deduced a trap composed of 74 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:07:07] [INFO ] Deduced a trap composed of 84 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:07:08] [INFO ] Deduced a trap composed of 83 places in 122 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/474 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 418 unsolved
[2024-06-01 07:07:08] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:07:08] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:07:09] [INFO ] Deduced a trap composed of 80 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:07:09] [INFO ] Deduced a trap composed of 79 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:07:09] [INFO ] Deduced a trap composed of 91 places in 151 ms of which 2 ms to minimize.
[2024-06-01 07:07:09] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:07:09] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:07:10] [INFO ] Deduced a trap composed of 43 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:07:10] [INFO ] Deduced a trap composed of 72 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:07:10] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:07:10] [INFO ] Deduced a trap composed of 85 places in 150 ms of which 25 ms to minimize.
[2024-06-01 07:07:10] [INFO ] Deduced a trap composed of 71 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:07:10] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:07:11] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:07:11] [INFO ] Deduced a trap composed of 86 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:07:11] [INFO ] Deduced a trap composed of 53 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:07:11] [INFO ] Deduced a trap composed of 79 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:07:11] [INFO ] Deduced a trap composed of 88 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:07:11] [INFO ] Deduced a trap composed of 79 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:07:11] [INFO ] Deduced a trap composed of 82 places in 97 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/474 variables, 20/191 constraints. Problems are: Problem set: 0 solved, 418 unsolved
[2024-06-01 07:07:12] [INFO ] Deduced a trap composed of 72 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:07:12] [INFO ] Deduced a trap composed of 99 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:07:12] [INFO ] Deduced a trap composed of 92 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:07:12] [INFO ] Deduced a trap composed of 110 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:07:13] [INFO ] Deduced a trap composed of 93 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:07:13] [INFO ] Deduced a trap composed of 73 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:07:13] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:07:13] [INFO ] Deduced a trap composed of 98 places in 146 ms of which 3 ms to minimize.
SMT process timed out in 30187ms, After SMT, problems are : Problem set: 0 solved, 418 unsolved
Search for dead transitions found 0 dead transitions in 30216ms
Starting structural reductions in LTL mode, iteration 1 : 474/560 places, 419/501 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31064 ms. Remains : 474/560 places, 419/501 transitions.
Support contains 129 out of 474 places after structural reductions.
[2024-06-01 07:07:13] [INFO ] Flatten gal took : 72 ms
[2024-06-01 07:07:13] [INFO ] Flatten gal took : 33 ms
[2024-06-01 07:07:14] [INFO ] Input system was already deterministic with 419 transitions.
RANDOM walk for 40000 steps (300 resets) in 2181 ms. (18 steps per ms) remains 45/77 properties
BEST_FIRST walk for 4002 steps (8 resets) in 62 ms. (63 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
[2024-06-01 07:07:15] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 45 unsolved
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp41 is UNSAT
At refinement iteration 1 (OVERLAPS) 242/328 variables, 38/38 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/328 variables, 0/38 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 3 (OVERLAPS) 38/366 variables, 11/49 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 0/49 constraints. Problems are: Problem set: 2 solved, 43 unsolved
Problem AtomicPropp6 is UNSAT
At refinement iteration 5 (OVERLAPS) 99/465 variables, 42/91 constraints. Problems are: Problem set: 3 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/465 variables, 0/91 constraints. Problems are: Problem set: 3 solved, 42 unsolved
At refinement iteration 7 (OVERLAPS) 413/878 variables, 465/556 constraints. Problems are: Problem set: 3 solved, 42 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/878 variables, 0/556 constraints. Problems are: Problem set: 3 solved, 42 unsolved
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp65 is UNSAT
At refinement iteration 9 (OVERLAPS) 13/891 variables, 7/563 constraints. Problems are: Problem set: 9 solved, 36 unsolved
[2024-06-01 07:07:17] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:07:18] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:07:18] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:07:18] [INFO ] Deduced a trap composed of 82 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:07:18] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:07:18] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:07:18] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:07:18] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:07:18] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:07:18] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:07:18] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:07:19] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:07:19] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:07:19] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:07:19] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:07:19] [INFO ] Deduced a trap composed of 48 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:07:19] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:07:19] [INFO ] Deduced a trap composed of 52 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:07:19] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 3 ms to minimize.
[2024-06-01 07:07:19] [INFO ] Deduced a trap composed of 76 places in 100 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/891 variables, 20/583 constraints. Problems are: Problem set: 9 solved, 36 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 891/893 variables, and 583 constraints, problems are : Problem set: 9 solved, 36 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 472/474 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 9 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 201/272 variables, 26/26 constraints. Problems are: Problem set: 9 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 2/28 constraints. Problems are: Problem set: 9 solved, 36 unsolved
[2024-06-01 07:07:20] [INFO ] Deduced a trap composed of 85 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:07:20] [INFO ] Deduced a trap composed of 83 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:07:20] [INFO ] Deduced a trap composed of 85 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:07:20] [INFO ] Deduced a trap composed of 88 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:07:20] [INFO ] Deduced a trap composed of 89 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:07:21] [INFO ] Deduced a trap composed of 39 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:07:21] [INFO ] Deduced a trap composed of 79 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:07:21] [INFO ] Deduced a trap composed of 82 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:07:21] [INFO ] Deduced a trap composed of 84 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:07:21] [INFO ] Deduced a trap composed of 78 places in 51 ms of which 2 ms to minimize.
[2024-06-01 07:07:21] [INFO ] Deduced a trap composed of 102 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:07:21] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:07:21] [INFO ] Deduced a trap composed of 85 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:07:21] [INFO ] Deduced a trap composed of 82 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:07:21] [INFO ] Deduced a trap composed of 83 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:07:21] [INFO ] Deduced a trap composed of 82 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:07:21] [INFO ] Deduced a trap composed of 82 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:07:21] [INFO ] Deduced a trap composed of 82 places in 55 ms of which 2 ms to minimize.
[2024-06-01 07:07:21] [INFO ] Deduced a trap composed of 26 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:07:21] [INFO ] Deduced a trap composed of 77 places in 54 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 20/48 constraints. Problems are: Problem set: 9 solved, 36 unsolved
[2024-06-01 07:07:22] [INFO ] Deduced a trap composed of 84 places in 82 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 1/49 constraints. Problems are: Problem set: 9 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 0/49 constraints. Problems are: Problem set: 9 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 88/360 variables, 23/72 constraints. Problems are: Problem set: 9 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 3/75 constraints. Problems are: Problem set: 9 solved, 36 unsolved
[2024-06-01 07:07:22] [INFO ] Deduced a trap composed of 65 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:07:22] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:07:22] [INFO ] Deduced a trap composed of 63 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:07:22] [INFO ] Deduced a trap composed of 64 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:07:23] [INFO ] Deduced a trap composed of 65 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:07:23] [INFO ] Deduced a trap composed of 63 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:07:23] [INFO ] Deduced a trap composed of 63 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:07:23] [INFO ] Deduced a trap composed of 66 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:07:23] [INFO ] Deduced a trap composed of 63 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:07:23] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:07:23] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:07:23] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:07:23] [INFO ] Deduced a trap composed of 86 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:07:23] [INFO ] Deduced a trap composed of 74 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:07:23] [INFO ] Deduced a trap composed of 79 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:07:24] [INFO ] Deduced a trap composed of 76 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:07:24] [INFO ] Deduced a trap composed of 81 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:07:24] [INFO ] Deduced a trap composed of 77 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:07:24] [INFO ] Deduced a trap composed of 79 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:07:24] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/360 variables, 20/95 constraints. Problems are: Problem set: 9 solved, 36 unsolved
[2024-06-01 07:07:24] [INFO ] Deduced a trap composed of 85 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:07:24] [INFO ] Deduced a trap composed of 82 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:07:24] [INFO ] Deduced a trap composed of 83 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:07:24] [INFO ] Deduced a trap composed of 84 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:07:25] [INFO ] Deduced a trap composed of 83 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:07:25] [INFO ] Deduced a trap composed of 82 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:07:25] [INFO ] Deduced a trap composed of 83 places in 110 ms of which 2 ms to minimize.
SMT process timed out in 10085ms, After SMT, problems are : Problem set: 9 solved, 36 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 71 out of 474 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 474/474 places, 419/419 transitions.
Graph (complete) has 1045 edges and 474 vertex of which 473 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 473 transition count 374
Reduce places removed 44 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 50 rules applied. Total rules applied 95 place count 429 transition count 368
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 101 place count 423 transition count 368
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 71 Pre rules applied. Total rules applied 101 place count 423 transition count 297
Deduced a syphon composed of 71 places in 2 ms
Ensure Unique test removed 14 places
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 257 place count 338 transition count 297
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 270 place count 325 transition count 284
Iterating global reduction 3 with 13 rules applied. Total rules applied 283 place count 325 transition count 284
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 187 rules applied. Total rules applied 470 place count 230 transition count 192
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 471 place count 230 transition count 191
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 472 place count 230 transition count 190
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 473 place count 229 transition count 190
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 480 place count 229 transition count 190
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 481 place count 228 transition count 189
Applied a total of 481 rules in 162 ms. Remains 228 /474 variables (removed 246) and now considering 189/419 (removed 230) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 162 ms. Remains : 228/474 places, 189/419 transitions.
RANDOM walk for 40000 steps (1641 resets) in 1240 ms. (32 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (30 resets) in 22 ms. (174 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (28 resets) in 23 ms. (166 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (29 resets) in 35 ms. (111 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (28 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (30 resets) in 26 ms. (148 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (29 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (29 resets) in 20 ms. (190 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (28 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (27 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (29 resets) in 25 ms. (154 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (28 resets) in 25 ms. (154 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (29 resets) in 13 ms. (286 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (31 resets) in 26 ms. (148 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (30 resets) in 24 ms. (160 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (27 resets) in 23 ms. (166 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (28 resets) in 36 ms. (108 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (30 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (29 resets) in 23 ms. (166 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (20 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (21 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (30 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (30 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (22 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (30 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (26 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (30 resets) in 27 ms. (143 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (28 resets) in 29 ms. (133 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (29 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (28 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (28 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (30 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (31 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (30 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (30 resets) in 23 ms. (166 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (29 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (29 resets) in 13 ms. (285 steps per ms) remains 36/36 properties
Interrupted probabilistic random walk after 651004 steps, run timeout after 3001 ms. (steps per millisecond=216 ) properties seen :33 out of 36
Probabilistic random walk after 651004 steps, saw 105845 distinct states, run finished after 3010 ms. (steps per millisecond=216 ) properties seen :33
// Phase 1: matrix 189 rows 228 cols
[2024-06-01 07:07:29] [INFO ] Computed 74 invariants in 10 ms
[2024-06-01 07:07:29] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 72/86 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 35/121 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 63/184 variables, 23/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 6/190 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2/192 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 182/374 variables, 192/253 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/374 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/374 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 40/414 variables, 34/288 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/414 variables, 12/300 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/414 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 2/416 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/416 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 1/417 variables, 2/303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/417 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/417 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 417/417 variables, and 303 constraints, problems are : Problem set: 0 solved, 3 unsolved in 304 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 228/228 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 72/86 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:07:29] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 35/121 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp74 is UNSAT
At refinement iteration 6 (OVERLAPS) 63/184 variables, 23/54 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 0/54 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/190 variables, 6/60 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 0/60 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/192 variables, 2/62 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/192 variables, 0/62 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 182/374 variables, 192/254 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/374 variables, 1/255 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/374 variables, 0/255 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 40/414 variables, 34/289 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/414 variables, 12/301 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/414 variables, 1/302 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/414 variables, 0/302 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/416 variables, 1/303 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/416 variables, 0/303 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1/417 variables, 2/305 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/417 variables, 0/305 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/417 variables, 0/305 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 417/417 variables, and 305 constraints, problems are : Problem set: 2 solved, 1 unsolved in 264 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 228/228 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 589ms problems are : Problem set: 2 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 5 out of 228 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 228/228 places, 189/189 transitions.
Graph (trivial) has 54 edges and 228 vertex of which 2 / 228 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 227 transition count 178
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 218 transition count 178
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 19 place count 218 transition count 155
Deduced a syphon composed of 23 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 49 rules applied. Total rules applied 68 place count 192 transition count 155
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 75 place count 185 transition count 148
Iterating global reduction 2 with 7 rules applied. Total rules applied 82 place count 185 transition count 148
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 120 place count 166 transition count 129
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
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 122 place count 165 transition count 146
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 125 place count 165 transition count 143
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 128 place count 162 transition count 143
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 130 place count 162 transition count 143
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 131 place count 161 transition count 142
Iterating global reduction 3 with 1 rules applied. Total rules applied 132 place count 161 transition count 142
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 134 place count 159 transition count 140
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 136 place count 157 transition count 140
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 137 place count 157 transition count 139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 138 place count 156 transition count 139
Applied a total of 138 rules in 99 ms. Remains 156 /228 variables (removed 72) and now considering 139/189 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 156/228 places, 139/189 transitions.
RANDOM walk for 40000 steps (2142 resets) in 780 ms. (51 steps per ms) remains 1/1 properties
BEST_FIRST walk for 548 steps (5 resets) in 6 ms. (78 steps per ms) remains 0/1 properties
Successfully simplified 11 atomic propositions for a total of 16 simplifications.
[2024-06-01 07:07:30] [INFO ] Flatten gal took : 28 ms
[2024-06-01 07:07:30] [INFO ] Flatten gal took : 30 ms
[2024-06-01 07:07:30] [INFO ] Input system was already deterministic with 419 transitions.
Support contains 100 out of 474 places (down from 105) after GAL structural reductions.
Computed a total of 459 stabilizing places and 404 stable transitions
Graph (complete) has 1045 edges and 474 vertex of which 473 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.14 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 474/474 places, 419/419 transitions.
Graph (complete) has 1045 edges and 474 vertex of which 473 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 56 place count 472 transition count 362
Reduce places removed 55 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 57 rules applied. Total rules applied 113 place count 417 transition count 360
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 115 place count 415 transition count 360
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 90 Pre rules applied. Total rules applied 115 place count 415 transition count 270
Deduced a syphon composed of 90 places in 2 ms
Ensure Unique test removed 17 places
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 3 with 197 rules applied. Total rules applied 312 place count 308 transition count 270
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 334 place count 286 transition count 248
Iterating global reduction 3 with 22 rules applied. Total rules applied 356 place count 286 transition count 248
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 356 place count 286 transition count 247
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 358 place count 285 transition count 247
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 95
Deduced a syphon composed of 95 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 3 with 193 rules applied. Total rules applied 551 place count 187 transition count 152
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 557 place count 187 transition count 152
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 558 place count 186 transition count 151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 559 place count 185 transition count 151
Applied a total of 559 rules in 81 ms. Remains 185 /474 variables (removed 289) and now considering 151/419 (removed 268) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 81 ms. Remains : 185/474 places, 151/419 transitions.
[2024-06-01 07:07:30] [INFO ] Flatten gal took : 11 ms
[2024-06-01 07:07:30] [INFO ] Flatten gal took : 11 ms
[2024-06-01 07:07:30] [INFO ] Input system was already deterministic with 151 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 419/419 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 447 transition count 392
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 447 transition count 392
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 61 place count 440 transition count 385
Iterating global reduction 0 with 7 rules applied. Total rules applied 68 place count 440 transition count 385
Applied a total of 68 rules in 36 ms. Remains 440 /474 variables (removed 34) and now considering 385/419 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 440/474 places, 385/419 transitions.
[2024-06-01 07:07:30] [INFO ] Flatten gal took : 17 ms
[2024-06-01 07:07:30] [INFO ] Flatten gal took : 18 ms
[2024-06-01 07:07:30] [INFO ] Input system was already deterministic with 385 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 474/474 places, 419/419 transitions.
Graph (trivial) has 227 edges and 474 vertex of which 6 / 474 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 1039 edges and 469 vertex of which 468 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 64 place count 467 transition count 349
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 126 place count 405 transition count 349
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 93 Pre rules applied. Total rules applied 126 place count 405 transition count 256
Deduced a syphon composed of 93 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 204 rules applied. Total rules applied 330 place count 294 transition count 256
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 354 place count 270 transition count 232
Iterating global reduction 2 with 24 rules applied. Total rules applied 378 place count 270 transition count 232
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 378 place count 270 transition count 230
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 382 place count 268 transition count 230
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 2 with 185 rules applied. Total rules applied 567 place count 174 transition count 139
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 573 place count 174 transition count 139
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 574 place count 173 transition count 138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 575 place count 172 transition count 138
Applied a total of 575 rules in 58 ms. Remains 172 /474 variables (removed 302) and now considering 138/419 (removed 281) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 58 ms. Remains : 172/474 places, 138/419 transitions.
[2024-06-01 07:07:30] [INFO ] Flatten gal took : 9 ms
[2024-06-01 07:07:30] [INFO ] Flatten gal took : 8 ms
[2024-06-01 07:07:30] [INFO ] Input system was already deterministic with 138 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 419/419 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 447 transition count 392
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 447 transition count 392
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 61 place count 440 transition count 385
Iterating global reduction 0 with 7 rules applied. Total rules applied 68 place count 440 transition count 385
Applied a total of 68 rules in 38 ms. Remains 440 /474 variables (removed 34) and now considering 385/419 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38 ms. Remains : 440/474 places, 385/419 transitions.
[2024-06-01 07:07:30] [INFO ] Flatten gal took : 14 ms
[2024-06-01 07:07:30] [INFO ] Flatten gal took : 15 ms
[2024-06-01 07:07:30] [INFO ] Input system was already deterministic with 385 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 419/419 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 447 transition count 392
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 447 transition count 392
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 62 place count 439 transition count 384
Iterating global reduction 0 with 8 rules applied. Total rules applied 70 place count 439 transition count 384
Applied a total of 70 rules in 37 ms. Remains 439 /474 variables (removed 35) and now considering 384/419 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 439/474 places, 384/419 transitions.
[2024-06-01 07:07:30] [INFO ] Flatten gal took : 15 ms
[2024-06-01 07:07:30] [INFO ] Flatten gal took : 15 ms
[2024-06-01 07:07:30] [INFO ] Input system was already deterministic with 384 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 419/419 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 446 transition count 391
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 446 transition count 391
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 64 place count 438 transition count 383
Iterating global reduction 0 with 8 rules applied. Total rules applied 72 place count 438 transition count 383
Applied a total of 72 rules in 27 ms. Remains 438 /474 variables (removed 36) and now considering 383/419 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 438/474 places, 383/419 transitions.
[2024-06-01 07:07:30] [INFO ] Flatten gal took : 14 ms
[2024-06-01 07:07:30] [INFO ] Flatten gal took : 14 ms
[2024-06-01 07:07:30] [INFO ] Input system was already deterministic with 383 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 419/419 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 448 transition count 393
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 448 transition count 393
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 60 place count 440 transition count 385
Iterating global reduction 0 with 8 rules applied. Total rules applied 68 place count 440 transition count 385
Applied a total of 68 rules in 51 ms. Remains 440 /474 variables (removed 34) and now considering 385/419 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51 ms. Remains : 440/474 places, 385/419 transitions.
[2024-06-01 07:07:31] [INFO ] Flatten gal took : 14 ms
[2024-06-01 07:07:31] [INFO ] Flatten gal took : 14 ms
[2024-06-01 07:07:31] [INFO ] Input system was already deterministic with 385 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 419/419 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 448 transition count 393
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 448 transition count 393
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 59 place count 441 transition count 386
Iterating global reduction 0 with 7 rules applied. Total rules applied 66 place count 441 transition count 386
Applied a total of 66 rules in 38 ms. Remains 441 /474 variables (removed 33) and now considering 386/419 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38 ms. Remains : 441/474 places, 386/419 transitions.
[2024-06-01 07:07:31] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:07:31] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:07:31] [INFO ] Input system was already deterministic with 386 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 474/474 places, 419/419 transitions.
Graph (trivial) has 224 edges and 474 vertex of which 6 / 474 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 1039 edges and 469 vertex of which 468 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 62 place count 467 transition count 351
Reduce places removed 60 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 61 rules applied. Total rules applied 123 place count 407 transition count 350
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 124 place count 406 transition count 350
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 94 Pre rules applied. Total rules applied 124 place count 406 transition count 256
Deduced a syphon composed of 94 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 3 with 206 rules applied. Total rules applied 330 place count 294 transition count 256
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 352 place count 272 transition count 234
Iterating global reduction 3 with 22 rules applied. Total rules applied 374 place count 272 transition count 234
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 374 place count 272 transition count 233
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 376 place count 271 transition count 233
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Deduced a syphon composed of 102 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 3 with 207 rules applied. Total rules applied 583 place count 166 transition count 131
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 589 place count 166 transition count 131
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 590 place count 165 transition count 130
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 591 place count 164 transition count 130
Applied a total of 591 rules in 46 ms. Remains 164 /474 variables (removed 310) and now considering 130/419 (removed 289) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 46 ms. Remains : 164/474 places, 130/419 transitions.
[2024-06-01 07:07:31] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:07:31] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:07:31] [INFO ] Input system was already deterministic with 130 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 419/419 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 448 transition count 393
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 448 transition count 393
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 59 place count 441 transition count 386
Iterating global reduction 0 with 7 rules applied. Total rules applied 66 place count 441 transition count 386
Applied a total of 66 rules in 47 ms. Remains 441 /474 variables (removed 33) and now considering 386/419 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47 ms. Remains : 441/474 places, 386/419 transitions.
[2024-06-01 07:07:31] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:07:31] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:07:31] [INFO ] Input system was already deterministic with 386 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 419/419 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 448 transition count 393
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 448 transition count 393
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 60 place count 440 transition count 385
Iterating global reduction 0 with 8 rules applied. Total rules applied 68 place count 440 transition count 385
Applied a total of 68 rules in 33 ms. Remains 440 /474 variables (removed 34) and now considering 385/419 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 440/474 places, 385/419 transitions.
[2024-06-01 07:07:31] [INFO ] Flatten gal took : 11 ms
[2024-06-01 07:07:31] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:07:31] [INFO ] Input system was already deterministic with 385 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 419/419 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 446 transition count 391
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 446 transition count 391
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 64 place count 438 transition count 383
Iterating global reduction 0 with 8 rules applied. Total rules applied 72 place count 438 transition count 383
Applied a total of 72 rules in 28 ms. Remains 438 /474 variables (removed 36) and now considering 383/419 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 438/474 places, 383/419 transitions.
[2024-06-01 07:07:31] [INFO ] Flatten gal took : 15 ms
[2024-06-01 07:07:31] [INFO ] Flatten gal took : 11 ms
[2024-06-01 07:07:31] [INFO ] Input system was already deterministic with 383 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 419/419 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 447 transition count 392
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 447 transition count 392
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 60 place count 441 transition count 386
Iterating global reduction 0 with 6 rules applied. Total rules applied 66 place count 441 transition count 386
Applied a total of 66 rules in 37 ms. Remains 441 /474 variables (removed 33) and now considering 386/419 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 441/474 places, 386/419 transitions.
[2024-06-01 07:07:31] [INFO ] Flatten gal took : 11 ms
[2024-06-01 07:07:31] [INFO ] Flatten gal took : 11 ms
[2024-06-01 07:07:31] [INFO ] Input system was already deterministic with 386 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 474/474 places, 419/419 transitions.
Graph (complete) has 1045 edges and 474 vertex of which 473 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 472 transition count 360
Reduce places removed 57 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 59 rules applied. Total rules applied 117 place count 415 transition count 358
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 119 place count 413 transition count 358
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 98 Pre rules applied. Total rules applied 119 place count 413 transition count 260
Deduced a syphon composed of 98 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 3 with 214 rules applied. Total rules applied 333 place count 297 transition count 260
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 356 place count 274 transition count 237
Iterating global reduction 3 with 23 rules applied. Total rules applied 379 place count 274 transition count 237
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 379 place count 274 transition count 235
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 383 place count 272 transition count 235
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 3 with 201 rules applied. Total rules applied 584 place count 170 transition count 136
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 590 place count 170 transition count 136
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 591 place count 169 transition count 135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 592 place count 168 transition count 135
Applied a total of 592 rules in 46 ms. Remains 168 /474 variables (removed 306) and now considering 135/419 (removed 284) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 46 ms. Remains : 168/474 places, 135/419 transitions.
[2024-06-01 07:07:31] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:07:31] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:07:31] [INFO ] Input system was already deterministic with 135 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 419/419 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 446 transition count 391
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 446 transition count 391
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 64 place count 438 transition count 383
Iterating global reduction 0 with 8 rules applied. Total rules applied 72 place count 438 transition count 383
Applied a total of 72 rules in 31 ms. Remains 438 /474 variables (removed 36) and now considering 383/419 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 438/474 places, 383/419 transitions.
[2024-06-01 07:07:31] [INFO ] Flatten gal took : 10 ms
[2024-06-01 07:07:31] [INFO ] Flatten gal took : 11 ms
[2024-06-01 07:07:31] [INFO ] Input system was already deterministic with 383 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 419/419 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 446 transition count 391
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 446 transition count 391
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 64 place count 438 transition count 383
Iterating global reduction 0 with 8 rules applied. Total rules applied 72 place count 438 transition count 383
Applied a total of 72 rules in 33 ms. Remains 438 /474 variables (removed 36) and now considering 383/419 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 438/474 places, 383/419 transitions.
[2024-06-01 07:07:31] [INFO ] Flatten gal took : 10 ms
[2024-06-01 07:07:31] [INFO ] Flatten gal took : 10 ms
[2024-06-01 07:07:31] [INFO ] Input system was already deterministic with 383 transitions.
[2024-06-01 07:07:31] [INFO ] Flatten gal took : 11 ms
[2024-06-01 07:07:31] [INFO ] Flatten gal took : 11 ms
[2024-06-01 07:07:31] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-06-01 07:07:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 474 places, 419 transitions and 1330 arcs took 3 ms.
Total runtime 49728 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : BusinessProcesses-PT-11-CTLFireability-2024-00
Could not compute solution for formula : BusinessProcesses-PT-11-CTLFireability-2024-01
Could not compute solution for formula : BusinessProcesses-PT-11-CTLFireability-2024-02
Could not compute solution for formula : BusinessProcesses-PT-11-CTLFireability-2024-03
Could not compute solution for formula : BusinessProcesses-PT-11-CTLFireability-2024-04
Could not compute solution for formula : BusinessProcesses-PT-11-CTLFireability-2024-05
Could not compute solution for formula : BusinessProcesses-PT-11-CTLFireability-2024-06
Could not compute solution for formula : BusinessProcesses-PT-11-CTLFireability-2024-07
Could not compute solution for formula : BusinessProcesses-PT-11-CTLFireability-2024-08
Could not compute solution for formula : BusinessProcesses-PT-11-CTLFireability-2024-09
Could not compute solution for formula : BusinessProcesses-PT-11-CTLFireability-2024-10
Could not compute solution for formula : BusinessProcesses-PT-11-CTLFireability-2024-11
Could not compute solution for formula : BusinessProcesses-PT-11-CTLFireability-2023-12
Could not compute solution for formula : BusinessProcesses-PT-11-CTLFireability-2023-13
Could not compute solution for formula : BusinessProcesses-PT-11-CTLFireability-2023-14
Could not compute solution for formula : BusinessProcesses-PT-11-CTLFireability-2023-15

BK_STOP 1717225652303

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name BusinessProcesses-PT-11-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/1081/ctl_0_
ctl formula name BusinessProcesses-PT-11-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/1081/ctl_1_
ctl formula name BusinessProcesses-PT-11-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/1081/ctl_2_
ctl formula name BusinessProcesses-PT-11-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/1081/ctl_3_
ctl formula name BusinessProcesses-PT-11-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/1081/ctl_4_
ctl formula name BusinessProcesses-PT-11-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/1081/ctl_5_
ctl formula name BusinessProcesses-PT-11-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/1081/ctl_6_
ctl formula name BusinessProcesses-PT-11-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/1081/ctl_7_
ctl formula name BusinessProcesses-PT-11-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/1081/ctl_8_
ctl formula name BusinessProcesses-PT-11-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/1081/ctl_9_
ctl formula name BusinessProcesses-PT-11-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/1081/ctl_10_
ctl formula name BusinessProcesses-PT-11-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/1081/ctl_11_
ctl formula name BusinessProcesses-PT-11-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/1081/ctl_12_
ctl formula name BusinessProcesses-PT-11-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/1081/ctl_13_
ctl formula name BusinessProcesses-PT-11-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/1081/ctl_14_
ctl formula name BusinessProcesses-PT-11-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/1081/ctl_15_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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-11"
export BK_EXAMINATION="CTLFireability"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is BusinessProcesses-PT-11, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r472-tajo-171620399700530"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-11.tgz
mv BusinessProcesses-PT-11 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;