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-171620399700529.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 CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399700529
=====================================================================

--------------------
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-CTLCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-2023-12
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-2023-13
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-2023-14
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717225586693

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
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:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 07:06:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:06:28] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2024-06-01 07:06:28] [INFO ] Transformed 567 places.
[2024-06-01 07:06:28] [INFO ] Transformed 508 transitions.
[2024-06-01 07:06:28] [INFO ] Found NUPN structural information;
[2024-06-01 07:06:28] [INFO ] Parsed PT model containing 567 places and 508 transitions and 1512 arcs in 198 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 23 ms.
Deduced a syphon composed of 7 places in 10 ms
Reduce places removed 7 places and 7 transitions.
Support contains 113 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 58 places :
Symmetric choice reduction at 1 with 58 rule applications. Total rules 62 place count 498 transition count 443
Iterating global reduction 1 with 58 rules applied. Total rules applied 120 place count 498 transition count 443
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 144 place count 474 transition count 419
Iterating global reduction 1 with 24 rules applied. Total rules applied 168 place count 474 transition count 419
Applied a total of 168 rules in 98 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:28] [INFO ] Computed 91 invariants in 30 ms
[2024-06-01 07:06:28] [INFO ] Implicit Places using invariants in 330 ms returned []
[2024-06-01 07:06:28] [INFO ] Invariant cache hit.
[2024-06-01 07:06:29] [INFO ] Implicit Places using invariants and state equation in 482 ms returned []
Implicit Place search using SMT with State Equation took 841 ms to find 0 implicit places.
Running 418 sub problems to find dead transitions.
[2024-06-01 07:06:29] [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:38] [INFO ] Deduced a trap composed of 99 places in 161 ms of which 24 ms to minimize.
[2024-06-01 07:06:38] [INFO ] Deduced a trap composed of 79 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:06:38] [INFO ] Deduced a trap composed of 106 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:06:38] [INFO ] Deduced a trap composed of 105 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:06:39] [INFO ] Deduced a trap composed of 76 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:06:39] [INFO ] Deduced a trap composed of 95 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:06:39] [INFO ] Deduced a trap composed of 96 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:06:39] [INFO ] Deduced a trap composed of 94 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:06:39] [INFO ] Deduced a trap composed of 96 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:06:39] [INFO ] Deduced a trap composed of 97 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:06:39] [INFO ] Deduced a trap composed of 95 places in 134 ms of which 4 ms to minimize.
[2024-06-01 07:06:39] [INFO ] Deduced a trap composed of 93 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:06:40] [INFO ] Deduced a trap composed of 93 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:06:40] [INFO ] Deduced a trap composed of 97 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:06:40] [INFO ] Deduced a trap composed of 100 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:06:40] [INFO ] Deduced a trap composed of 96 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:06:40] [INFO ] Deduced a trap composed of 45 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:06:40] [INFO ] Deduced a trap composed of 92 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:06:40] [INFO ] Deduced a trap composed of 89 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:06:40] [INFO ] Deduced a trap composed of 95 places in 106 ms of which 2 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:41] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:06:41] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:06:41] [INFO ] Deduced a trap composed of 112 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:06:41] [INFO ] Deduced a trap composed of 99 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:06:41] [INFO ] Deduced a trap composed of 113 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:06:41] [INFO ] Deduced a trap composed of 99 places in 176 ms of which 6 ms to minimize.
[2024-06-01 07:06:41] [INFO ] Deduced a trap composed of 103 places in 176 ms of which 3 ms to minimize.
[2024-06-01 07:06:42] [INFO ] Deduced a trap composed of 99 places in 177 ms of which 5 ms to minimize.
[2024-06-01 07:06:42] [INFO ] Deduced a trap composed of 104 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:06:42] [INFO ] Deduced a trap composed of 101 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:06:42] [INFO ] Deduced a trap composed of 98 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:06:42] [INFO ] Deduced a trap composed of 102 places in 178 ms of which 5 ms to minimize.
[2024-06-01 07:06:42] [INFO ] Deduced a trap composed of 97 places in 176 ms of which 4 ms to minimize.
[2024-06-01 07:06:43] [INFO ] Deduced a trap composed of 109 places in 139 ms of which 7 ms to minimize.
[2024-06-01 07:06:43] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:06:43] [INFO ] Deduced a trap composed of 89 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:06:43] [INFO ] Deduced a trap composed of 95 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:06:43] [INFO ] Deduced a trap composed of 90 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:06:43] [INFO ] Deduced a trap composed of 92 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:06:43] [INFO ] Deduced a trap composed of 95 places in 100 ms of which 4 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:44] [INFO ] Deduced a trap composed of 98 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:06:44] [INFO ] Deduced a trap composed of 87 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:06:44] [INFO ] Deduced a trap composed of 97 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:06:44] [INFO ] Deduced a trap composed of 97 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:06:44] [INFO ] Deduced a trap composed of 97 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:06:44] [INFO ] Deduced a trap composed of 97 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:06:44] [INFO ] Deduced a trap composed of 77 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:06:45] [INFO ] Deduced a trap composed of 99 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:06:45] [INFO ] Deduced a trap composed of 97 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:06:45] [INFO ] Deduced a trap composed of 100 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:06:45] [INFO ] Deduced a trap composed of 99 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:06:45] [INFO ] Deduced a trap composed of 102 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:06:45] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:06:45] [INFO ] Deduced a trap composed of 102 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:06:45] [INFO ] Deduced a trap composed of 101 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:06:46] [INFO ] Deduced a trap composed of 104 places in 106 ms of which 6 ms to minimize.
[2024-06-01 07:06:46] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:06:46] [INFO ] Deduced a trap composed of 93 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:06:46] [INFO ] Deduced a trap composed of 98 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:06:46] [INFO ] Deduced a trap composed of 92 places in 110 ms of which 2 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:06:49] [INFO ] Deduced a trap composed of 79 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:06:49] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:06:50] [INFO ] Deduced a trap composed of 95 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:06:50] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:06:50] [INFO ] Deduced a trap composed of 96 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:06:50] [INFO ] Deduced a trap composed of 96 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:06:50] [INFO ] Deduced a trap composed of 102 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:06:50] [INFO ] Deduced a trap composed of 98 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:06:51] [INFO ] Deduced a trap composed of 95 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:06:51] [INFO ] Deduced a trap composed of 96 places in 160 ms of which 2 ms to minimize.
[2024-06-01 07:06:51] [INFO ] Deduced a trap composed of 92 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:06:51] [INFO ] Deduced a trap composed of 94 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:06:51] [INFO ] Deduced a trap composed of 89 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:06:51] [INFO ] Deduced a trap composed of 93 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:06:52] [INFO ] Deduced a trap composed of 95 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:06:52] [INFO ] Deduced a trap composed of 124 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:06:52] [INFO ] Deduced a trap composed of 98 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:06:52] [INFO ] Deduced a trap composed of 98 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:06:52] [INFO ] Deduced a trap composed of 97 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:06:52] [INFO ] Deduced a trap composed of 76 places in 140 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:06:53] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:06:53] [INFO ] Deduced a trap composed of 95 places in 160 ms of which 3 ms to minimize.
[2024-06-01 07:06:53] [INFO ] Deduced a trap composed of 102 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:06:53] [INFO ] Deduced a trap composed of 98 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:06:53] [INFO ] Deduced a trap composed of 100 places in 146 ms of which 2 ms to minimize.
[2024-06-01 07:06:53] [INFO ] Deduced a trap composed of 104 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:06:54] [INFO ] Deduced a trap composed of 99 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:06:54] [INFO ] Deduced a trap composed of 106 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:06:54] [INFO ] Deduced a trap composed of 100 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:06:54] [INFO ] Deduced a trap composed of 100 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:06:54] [INFO ] Deduced a trap composed of 113 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:06:54] [INFO ] Deduced a trap composed of 89 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:06:54] [INFO ] Deduced a trap composed of 112 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:06:55] [INFO ] Deduced a trap composed of 93 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:06:55] [INFO ] Deduced a trap composed of 95 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:06:55] [INFO ] Deduced a trap composed of 98 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:06:55] [INFO ] Deduced a trap composed of 107 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:06:55] [INFO ] Deduced a trap composed of 115 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:06:55] [INFO ] Deduced a trap composed of 109 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:06:56] [INFO ] Deduced a trap composed of 78 places in 125 ms of which 3 ms to minimize.
Problem TDEAD363 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD399 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/474 variables, 20/191 constraints. Problems are: Problem set: 6 solved, 412 unsolved
[2024-06-01 07:06:56] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:06:56] [INFO ] Deduced a trap composed of 104 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:06:56] [INFO ] Deduced a trap composed of 101 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:06:57] [INFO ] Deduced a trap composed of 98 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:06:57] [INFO ] Deduced a trap composed of 100 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:06:57] [INFO ] Deduced a trap composed of 98 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:06:57] [INFO ] Deduced a trap composed of 96 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:06:57] [INFO ] Deduced a trap composed of 105 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:06:57] [INFO ] Deduced a trap composed of 102 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:06:57] [INFO ] Deduced a trap composed of 104 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:06:57] [INFO ] Deduced a trap composed of 105 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:06:58] [INFO ] Deduced a trap composed of 106 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:06:58] [INFO ] Deduced a trap composed of 135 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:06:58] [INFO ] Deduced a trap composed of 116 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:06:58] [INFO ] Deduced a trap composed of 101 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:06:58] [INFO ] Deduced a trap composed of 98 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:06:58] [INFO ] Deduced a trap composed of 96 places in 145 ms of which 2 ms to minimize.
[2024-06-01 07:06:59] [INFO ] Deduced a trap composed of 97 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:06:59] [INFO ] Deduced a trap composed of 103 places in 137 ms of which 4 ms to minimize.
[2024-06-01 07:06:59] [INFO ] Deduced a trap composed of 97 places in 150 ms of which 3 ms to minimize.
SMT process timed out in 30157ms, After SMT, problems are : Problem set: 6 solved, 412 unsolved
Search for dead transitions found 6 dead transitions in 30186ms
Found 6 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 6 transitions
Dead transitions reduction (with SMT) removed 6 transitions
Starting structural reductions in LTL mode, iteration 1 : 474/560 places, 413/501 transitions.
Applied a total of 0 rules in 19 ms. Remains 474 /474 variables (removed 0) and now considering 413/413 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31169 ms. Remains : 474/560 places, 413/501 transitions.
Support contains 113 out of 474 places after structural reductions.
[2024-06-01 07:06:59] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 07:06:59] [INFO ] Flatten gal took : 119 ms
FORMULA BusinessProcesses-PT-11-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 07:06:59] [INFO ] Flatten gal took : 86 ms
[2024-06-01 07:06:59] [INFO ] Input system was already deterministic with 413 transitions.
Support contains 99 out of 474 places (down from 113) after GAL structural reductions.
RANDOM walk for 40000 steps (298 resets) in 2070 ms. (19 steps per ms) remains 32/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 9 ms. (400 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (8 resets) in 9 ms. (400 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (8 resets) in 10 ms. (363 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 8 ms. (444 steps per ms) remains 32/32 properties
// Phase 1: matrix 413 rows 474 cols
[2024-06-01 07:07:01] [INFO ] Computed 91 invariants in 8 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 169/223 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (OVERLAPS) 86/309 variables, 16/47 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 155/464 variables, 43/90 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 1/465 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/465 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 407/872 variables, 465/556 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/872 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 32 unsolved
Problem AtomicPropp51 is UNSAT
At refinement iteration 11 (OVERLAPS) 13/885 variables, 7/563 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/885 variables, 0/563 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 13 (OVERLAPS) 2/887 variables, 2/565 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/887 variables, 0/565 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 15 (OVERLAPS) 0/887 variables, 0/565 constraints. Problems are: Problem set: 1 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 887/887 variables, and 565 constraints, problems are : Problem set: 1 solved, 31 unsolved in 3436 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 474/474 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 31 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 169/220 variables, 31/31 constraints. Problems are: Problem set: 1 solved, 31 unsolved
[2024-06-01 07:07:05] [INFO ] Deduced a trap composed of 22 places in 776 ms of which 27 ms to minimize.
[2024-06-01 07:07:05] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:07:05] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:07:05] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:07:05] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:07:05] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:07:05] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 7/38 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 0/38 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 4 (OVERLAPS) 86/306 variables, 16/54 constraints. Problems are: Problem set: 1 solved, 31 unsolved
[2024-06-01 07:07:06] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:07:06] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:07:06] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:07:06] [INFO ] Deduced a trap composed of 8 places in 202 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 4/58 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 7 (OVERLAPS) 156/462 variables, 41/99 constraints. Problems are: Problem set: 1 solved, 31 unsolved
[2024-06-01 07:07:07] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:07:07] [INFO ] Deduced a trap composed of 79 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:07:07] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:07:07] [INFO ] Deduced a trap composed of 80 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:07:07] [INFO ] Deduced a trap composed of 79 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:07:07] [INFO ] Deduced a trap composed of 75 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:07:07] [INFO ] Deduced a trap composed of 77 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:07:07] [INFO ] Deduced a trap composed of 85 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:07:08] [INFO ] Deduced a trap composed of 87 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:07:08] [INFO ] Deduced a trap composed of 74 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:07:08] [INFO ] Deduced a trap composed of 104 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:07:08] [INFO ] Deduced a trap composed of 91 places in 103 ms of which 3 ms to minimize.
[2024-06-01 07:07:08] [INFO ] Deduced a trap composed of 77 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:07:08] [INFO ] Deduced a trap composed of 76 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:07:08] [INFO ] Deduced a trap composed of 72 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:07:08] [INFO ] Deduced a trap composed of 76 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:07:09] [INFO ] Deduced a trap composed of 77 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:07:09] [INFO ] Deduced a trap composed of 86 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:07:09] [INFO ] Deduced a trap composed of 77 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:07:09] [INFO ] Deduced a trap composed of 89 places in 103 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/462 variables, 20/119 constraints. Problems are: Problem set: 1 solved, 31 unsolved
[2024-06-01 07:07:09] [INFO ] Deduced a trap composed of 81 places in 111 ms of which 2 ms to minimize.
SMT process timed out in 8527ms, After SMT, problems are : Problem set: 1 solved, 31 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 51 out of 474 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 474/474 places, 413/413 transitions.
Graph (trivial) has 190 edges and 474 vertex of which 4 / 474 are part of one of the 1 SCC in 7 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1020 edges and 471 vertex of which 470 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 50 place count 470 transition count 360
Reduce places removed 48 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 51 rules applied. Total rules applied 101 place count 422 transition count 357
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 104 place count 419 transition count 357
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 76 Pre rules applied. Total rules applied 104 place count 419 transition count 281
Deduced a syphon composed of 76 places in 0 ms
Ensure Unique test removed 15 places
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 3 with 167 rules applied. Total rules applied 271 place count 328 transition count 281
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 285 place count 314 transition count 267
Iterating global reduction 3 with 14 rules applied. Total rules applied 299 place count 314 transition count 267
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 299 place count 314 transition count 265
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 303 place count 312 transition count 265
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 0 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 3 with 186 rules applied. Total rules applied 489 place count 219 transition count 172
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 491 place count 218 transition count 176
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 494 place count 218 transition count 173
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 497 place count 215 transition count 173
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 499 place count 215 transition count 173
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 500 place count 214 transition count 172
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 501 place count 213 transition count 172
Applied a total of 501 rules in 133 ms. Remains 213 /474 variables (removed 261) and now considering 172/413 (removed 241) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 213/474 places, 172/413 transitions.
RANDOM walk for 40000 steps (10 resets) in 609 ms. (65 steps per ms) remains 10/31 properties
BEST_FIRST walk for 40000 steps (8 resets) in 537 ms. (74 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (10 resets) in 104 ms. (380 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (10 resets) in 248 ms. (160 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (12 resets) in 227 ms. (175 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40000 steps (11 resets) in 183 ms. (217 steps per ms) remains 7/9 properties
BEST_FIRST walk for 40000 steps (8 resets) in 232 ms. (171 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (13 resets) in 234 ms. (170 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40000 steps (11 resets) in 147 ms. (270 steps per ms) remains 5/5 properties
// Phase 1: matrix 172 rows 213 cols
[2024-06-01 07:07:10] [INFO ] Computed 75 invariants in 6 ms
[2024-06-01 07:07:10] [INFO ] State equation strengthened by 5 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, 5 unsolved
At refinement iteration 1 (OVERLAPS) 74/88 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 07:07:11] [INFO ] Deduced a trap composed of 48 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 69/157 variables, 37/48 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 6/163 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 07:07:11] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:07:11] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:07:11] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:07:11] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:07:11] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:07:11] [INFO ] Deduced a trap composed of 48 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:07:11] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:07:11] [INFO ] Deduced a trap composed of 46 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:07:11] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 40/203 variables, 22/81 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1/204 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/204 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 171/375 variables, 204/286 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/375 variables, 5/291 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/375 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 9/384 variables, 8/299 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/384 variables, 3/302 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/384 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 1/385 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/385 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 0/385 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 385/385 variables, and 303 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1195 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 213/213 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 74/88 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 07:07:12] [INFO ] Deduced a trap composed of 50 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 69/157 variables, 37/49 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 07:07:12] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:07:12] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:07:12] [INFO ] Deduced a trap composed of 50 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:07:12] [INFO ] Deduced a trap composed of 48 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 6/163 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/163 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 40/203 variables, 22/86 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 07:07:12] [INFO ] Deduced a trap composed of 53 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:07:12] [INFO ] Deduced a trap composed of 52 places in 473 ms of which 1 ms to minimize.
[2024-06-01 07:07:13] [INFO ] Deduced a trap composed of 55 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:07:13] [INFO ] Deduced a trap composed of 52 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:07:13] [INFO ] Deduced a trap composed of 49 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:07:13] [INFO ] Deduced a trap composed of 49 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:07:13] [INFO ] Deduced a trap composed of 50 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:07:13] [INFO ] Deduced a trap composed of 49 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:07:13] [INFO ] Deduced a trap composed of 48 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:07:13] [INFO ] Deduced a trap composed of 48 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:07:13] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:07:13] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:07:13] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:07:13] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:07:14] [INFO ] Deduced a trap composed of 48 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:07:14] [INFO ] Deduced a trap composed of 51 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:07:14] [INFO ] Deduced a trap composed of 48 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:07:14] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:07:14] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:07:14] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/203 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 07:07:14] [INFO ] Deduced a trap composed of 47 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:07:14] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:07:14] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:07:14] [INFO ] Deduced a trap composed of 49 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:07:14] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:07:14] [INFO ] Deduced a trap composed of 48 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:07:14] [INFO ] Deduced a trap composed of 49 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:07:15] [INFO ] Deduced a trap composed of 49 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:07:15] [INFO ] Deduced a trap composed of 49 places in 52 ms of which 2 ms to minimize.
[2024-06-01 07:07:15] [INFO ] Deduced a trap composed of 49 places in 54 ms of which 2 ms to minimize.
[2024-06-01 07:07:15] [INFO ] Deduced a trap composed of 50 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:07:15] [INFO ] Deduced a trap composed of 48 places in 90 ms of which 12 ms to minimize.
[2024-06-01 07:07:15] [INFO ] Deduced a trap composed of 48 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:07:15] [INFO ] Deduced a trap composed of 46 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:07:15] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:07:15] [INFO ] Deduced a trap composed of 47 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:07:15] [INFO ] Deduced a trap composed of 48 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:07:15] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:07:15] [INFO ] Deduced a trap composed of 51 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:07:15] [INFO ] Deduced a trap composed of 51 places in 60 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/203 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 07:07:15] [INFO ] Deduced a trap composed of 49 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:07:15] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:07:16] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:07:16] [INFO ] Deduced a trap composed of 54 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:07:16] [INFO ] Deduced a trap composed of 49 places in 53 ms of which 2 ms to minimize.
[2024-06-01 07:07:16] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:07:16] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:07:16] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:07:16] [INFO ] Deduced a trap composed of 49 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:07:16] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:07:16] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:07:16] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:07:16] [INFO ] Deduced a trap composed of 48 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:07:16] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:07:16] [INFO ] Deduced a trap composed of 49 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:07:16] [INFO ] Deduced a trap composed of 53 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:07:17] [INFO ] Deduced a trap composed of 47 places in 87 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/203 variables, 17/143 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 07:07:17] [INFO ] Deduced a trap composed of 53 places in 149 ms of which 1 ms to minimize.
[2024-06-01 07:07:17] [INFO ] Deduced a trap composed of 51 places in 252 ms of which 1 ms to minimize.
[2024-06-01 07:07:17] [INFO ] Deduced a trap composed of 53 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:07:17] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:07:17] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:07:17] [INFO ] Deduced a trap composed of 47 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:07:17] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:07:18] [INFO ] Deduced a trap composed of 47 places in 71 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/203 variables, 8/151 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/203 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 1/204 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/204 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 171/375 variables, 204/356 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/375 variables, 5/361 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/375 variables, 5/366 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 07:07:18] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:07:18] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:07:18] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:07:18] [INFO ] Deduced a trap composed of 48 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:07:18] [INFO ] Deduced a trap composed of 50 places in 66 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/375 variables, 5/371 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 07:07:18] [INFO ] Deduced a trap composed of 50 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:07:18] [INFO ] Deduced a trap composed of 46 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:07:18] [INFO ] Deduced a trap composed of 46 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:07:19] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:07:19] [INFO ] Deduced a trap composed of 48 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:07:19] [INFO ] Deduced a trap composed of 46 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:07:19] [INFO ] Deduced a trap composed of 45 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:07:19] [INFO ] Deduced a trap composed of 52 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:07:19] [INFO ] Deduced a trap composed of 48 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:07:19] [INFO ] Deduced a trap composed of 49 places in 78 ms of which 6 ms to minimize.
[2024-06-01 07:07:19] [INFO ] Deduced a trap composed of 45 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:07:19] [INFO ] Deduced a trap composed of 46 places in 82 ms of which 3 ms to minimize.
[2024-06-01 07:07:19] [INFO ] Deduced a trap composed of 49 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:07:20] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:07:20] [INFO ] Deduced a trap composed of 48 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:07:20] [INFO ] Deduced a trap composed of 52 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:07:20] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:07:20] [INFO ] Deduced a trap composed of 50 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:07:20] [INFO ] Deduced a trap composed of 49 places in 98 ms of which 6 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/375 variables, 19/390 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/375 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (OVERLAPS) 9/384 variables, 8/398 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/384 variables, 3/401 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/384 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (OVERLAPS) 1/385 variables, 1/402 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/385 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (OVERLAPS) 0/385 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 385/385 variables, and 402 constraints, problems are : Problem set: 0 solved, 5 unsolved in 10112 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 213/213 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 104/104 constraints]
After SMT, in 11349ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 727 ms.
Support contains 14 out of 213 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 213/213 places, 172/172 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 213 transition count 165
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 206 transition count 165
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 14 place count 206 transition count 153
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 27 rules applied. Total rules applied 41 place count 191 transition count 153
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 44 place count 188 transition count 150
Iterating global reduction 2 with 3 rules applied. Total rules applied 47 place count 188 transition count 150
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 33 rules applied. Total rules applied 80 place count 170 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
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 82 place count 169 transition count 146
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 83 place count 169 transition count 146
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 168 transition count 145
Applied a total of 84 rules in 47 ms. Remains 168 /213 variables (removed 45) and now considering 145/172 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 168/213 places, 145/172 transitions.
RANDOM walk for 40000 steps (10 resets) in 218 ms. (182 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (11 resets) in 260 ms. (153 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (9 resets) in 81 ms. (487 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (9 resets) in 76 ms. (519 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (8 resets) in 199 ms. (200 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (10 resets) in 189 ms. (210 steps per ms) remains 5/5 properties
Probably explored full state space saw : 85796 states, properties seen :4
Probabilistic random walk after 424406 steps, saw 85796 distinct states, run finished after 1150 ms. (steps per millisecond=369 ) properties seen :4
Explored full state space saw : 85796 states, properties seen :0
Exhaustive walk after 424406 steps, saw 85796 distinct states, run finished after 902 ms. (steps per millisecond=470 ) properties seen :0
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
FORMULA BusinessProcesses-PT-11-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 07:07:25] [INFO ] Flatten gal took : 21 ms
[2024-06-01 07:07:25] [INFO ] Flatten gal took : 21 ms
[2024-06-01 07:07:25] [INFO ] Input system was already deterministic with 413 transitions.
Computed a total of 458 stabilizing places and 397 stable transitions
Graph (complete) has 1024 edges and 474 vertex of which 473 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.15 ms
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 413/413 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 448 transition count 387
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 448 transition count 387
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 58 place count 442 transition count 381
Iterating global reduction 0 with 6 rules applied. Total rules applied 64 place count 442 transition count 381
Applied a total of 64 rules in 27 ms. Remains 442 /474 variables (removed 32) and now considering 381/413 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 442/474 places, 381/413 transitions.
[2024-06-01 07:07:25] [INFO ] Flatten gal took : 21 ms
[2024-06-01 07:07:25] [INFO ] Flatten gal took : 22 ms
[2024-06-01 07:07:25] [INFO ] Input system was already deterministic with 381 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 413/413 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 446 transition count 385
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 446 transition count 385
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 440 transition count 379
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 440 transition count 379
Applied a total of 68 rules in 27 ms. Remains 440 /474 variables (removed 34) and now considering 379/413 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 440/474 places, 379/413 transitions.
[2024-06-01 07:07:25] [INFO ] Flatten gal took : 21 ms
[2024-06-01 07:07:25] [INFO ] Flatten gal took : 21 ms
[2024-06-01 07:07:25] [INFO ] Input system was already deterministic with 379 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 474/474 places, 413/413 transitions.
Graph (trivial) has 229 edges and 474 vertex of which 7 / 474 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1017 edges and 468 vertex of which 467 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 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 466 transition count 344
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 406 transition count 343
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 124 place count 405 transition count 343
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 405 transition count 249
Deduced a syphon composed of 94 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 3 with 205 rules applied. Total rules applied 329 place count 294 transition count 249
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 355 place count 268 transition count 223
Iterating global reduction 3 with 26 rules applied. Total rules applied 381 place count 268 transition count 223
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 381 place count 268 transition count 222
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 383 place count 267 transition count 222
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 103 places and 0 transitions.
Iterating global reduction 3 with 203 rules applied. Total rules applied 586 place count 164 transition count 122
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 587 place count 163 transition count 121
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 588 place count 162 transition count 121
Applied a total of 588 rules in 54 ms. Remains 162 /474 variables (removed 312) and now considering 121/413 (removed 292) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 54 ms. Remains : 162/474 places, 121/413 transitions.
[2024-06-01 07:07:25] [INFO ] Flatten gal took : 8 ms
[2024-06-01 07:07:25] [INFO ] Flatten gal took : 8 ms
[2024-06-01 07:07:25] [INFO ] Input system was already deterministic with 121 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 413/413 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 450 transition count 389
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 450 transition count 389
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 443 transition count 382
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 443 transition count 382
Applied a total of 62 rules in 16 ms. Remains 443 /474 variables (removed 31) and now considering 382/413 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 443/474 places, 382/413 transitions.
[2024-06-01 07:07:25] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:07:25] [INFO ] Flatten gal took : 14 ms
[2024-06-01 07:07:25] [INFO ] Input system was already deterministic with 382 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 413/413 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 448 transition count 387
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 448 transition count 387
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 58 place count 442 transition count 381
Iterating global reduction 0 with 6 rules applied. Total rules applied 64 place count 442 transition count 381
Applied a total of 64 rules in 17 ms. Remains 442 /474 variables (removed 32) and now considering 381/413 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 442/474 places, 381/413 transitions.
[2024-06-01 07:07:25] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:07:25] [INFO ] Flatten gal took : 14 ms
[2024-06-01 07:07:25] [INFO ] Input system was already deterministic with 381 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 474/474 places, 413/413 transitions.
Graph (trivial) has 231 edges and 474 vertex of which 7 / 474 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1017 edges and 468 vertex of which 467 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 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 466 transition count 342
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 126 place count 404 transition count 342
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 404 transition count 249
Deduced a syphon composed of 93 places in 0 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 293 transition count 249
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 357 place count 266 transition count 222
Iterating global reduction 2 with 27 rules applied. Total rules applied 384 place count 266 transition count 222
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 384 place count 266 transition count 220
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 388 place count 264 transition count 220
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 2 with 207 rules applied. Total rules applied 595 place count 159 transition count 118
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 601 place count 159 transition count 118
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 602 place count 158 transition count 117
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 603 place count 157 transition count 117
Applied a total of 603 rules in 88 ms. Remains 157 /474 variables (removed 317) and now considering 117/413 (removed 296) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 88 ms. Remains : 157/474 places, 117/413 transitions.
[2024-06-01 07:07:26] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:07:26] [INFO ] Flatten gal took : 19 ms
[2024-06-01 07:07:26] [INFO ] Input system was already deterministic with 117 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 413/413 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 445 transition count 384
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 445 transition count 384
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 65 place count 438 transition count 377
Iterating global reduction 0 with 7 rules applied. Total rules applied 72 place count 438 transition count 377
Applied a total of 72 rules in 17 ms. Remains 438 /474 variables (removed 36) and now considering 377/413 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 438/474 places, 377/413 transitions.
[2024-06-01 07:07:26] [INFO ] Flatten gal took : 24 ms
[2024-06-01 07:07:26] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:07:26] [INFO ] Input system was already deterministic with 377 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 413/413 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 452 transition count 391
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 452 transition count 391
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 49 place count 447 transition count 386
Iterating global reduction 0 with 5 rules applied. Total rules applied 54 place count 447 transition count 386
Applied a total of 54 rules in 17 ms. Remains 447 /474 variables (removed 27) and now considering 386/413 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 447/474 places, 386/413 transitions.
[2024-06-01 07:07:26] [INFO ] Flatten gal took : 25 ms
[2024-06-01 07:07:26] [INFO ] Flatten gal took : 24 ms
[2024-06-01 07:07:26] [INFO ] Input system was already deterministic with 386 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 413/413 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 445 transition count 384
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 445 transition count 384
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 65 place count 438 transition count 377
Iterating global reduction 0 with 7 rules applied. Total rules applied 72 place count 438 transition count 377
Applied a total of 72 rules in 32 ms. Remains 438 /474 variables (removed 36) and now considering 377/413 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 438/474 places, 377/413 transitions.
[2024-06-01 07:07:26] [INFO ] Flatten gal took : 11 ms
[2024-06-01 07:07:26] [INFO ] Flatten gal took : 22 ms
[2024-06-01 07:07:26] [INFO ] Input system was already deterministic with 377 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 474/474 places, 413/413 transitions.
Graph (trivial) has 223 edges and 474 vertex of which 7 / 474 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1017 edges and 468 vertex of which 467 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 59 place count 466 transition count 347
Reduce places removed 57 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 58 rules applied. Total rules applied 117 place count 409 transition count 346
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 118 place count 408 transition count 346
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 90 Pre rules applied. Total rules applied 118 place count 408 transition count 256
Deduced a syphon composed of 90 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 3 with 196 rules applied. Total rules applied 314 place count 302 transition count 256
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 341 place count 275 transition count 229
Iterating global reduction 3 with 27 rules applied. Total rules applied 368 place count 275 transition count 229
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 368 place count 275 transition count 227
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 372 place count 273 transition count 227
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 95
Deduced a syphon composed of 95 places in 0 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 562 place count 178 transition count 132
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 563 place count 177 transition count 131
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 564 place count 176 transition count 131
Applied a total of 564 rules in 57 ms. Remains 176 /474 variables (removed 298) and now considering 131/413 (removed 282) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 57 ms. Remains : 176/474 places, 131/413 transitions.
[2024-06-01 07:07:26] [INFO ] Flatten gal took : 5 ms
[2024-06-01 07:07:26] [INFO ] Flatten gal took : 18 ms
[2024-06-01 07:07:26] [INFO ] Input system was already deterministic with 131 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 413/413 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 446 transition count 385
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 446 transition count 385
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 63 place count 439 transition count 378
Iterating global reduction 0 with 7 rules applied. Total rules applied 70 place count 439 transition count 378
Applied a total of 70 rules in 17 ms. Remains 439 /474 variables (removed 35) and now considering 378/413 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 439/474 places, 378/413 transitions.
[2024-06-01 07:07:26] [INFO ] Flatten gal took : 10 ms
[2024-06-01 07:07:26] [INFO ] Flatten gal took : 10 ms
[2024-06-01 07:07:26] [INFO ] Input system was already deterministic with 378 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 413/413 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 448 transition count 387
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 448 transition count 387
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 59 place count 441 transition count 380
Iterating global reduction 0 with 7 rules applied. Total rules applied 66 place count 441 transition count 380
Applied a total of 66 rules in 20 ms. Remains 441 /474 variables (removed 33) and now considering 380/413 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 441/474 places, 380/413 transitions.
[2024-06-01 07:07:26] [INFO ] Flatten gal took : 11 ms
[2024-06-01 07:07:26] [INFO ] Flatten gal took : 11 ms
[2024-06-01 07:07:26] [INFO ] Input system was already deterministic with 380 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 413/413 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 449 transition count 388
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 449 transition count 388
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 56 place count 443 transition count 382
Iterating global reduction 0 with 6 rules applied. Total rules applied 62 place count 443 transition count 382
Applied a total of 62 rules in 16 ms. Remains 443 /474 variables (removed 31) and now considering 382/413 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 443/474 places, 382/413 transitions.
[2024-06-01 07:07:26] [INFO ] Flatten gal took : 10 ms
[2024-06-01 07:07:26] [INFO ] Flatten gal took : 10 ms
[2024-06-01 07:07:26] [INFO ] Input system was already deterministic with 382 transitions.
[2024-06-01 07:07:26] [INFO ] Flatten gal took : 11 ms
[2024-06-01 07:07:26] [INFO ] Flatten gal took : 10 ms
[2024-06-01 07:07:26] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-06-01 07:07:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 474 places, 413 transitions and 1294 arcs took 3 ms.
Total runtime 58940 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-CTLCardinality-2024-00
Could not compute solution for formula : BusinessProcesses-PT-11-CTLCardinality-2024-01
Could not compute solution for formula : BusinessProcesses-PT-11-CTLCardinality-2024-02
Could not compute solution for formula : BusinessProcesses-PT-11-CTLCardinality-2024-04
Could not compute solution for formula : BusinessProcesses-PT-11-CTLCardinality-2024-05
Could not compute solution for formula : BusinessProcesses-PT-11-CTLCardinality-2024-06
Could not compute solution for formula : BusinessProcesses-PT-11-CTLCardinality-2024-07
Could not compute solution for formula : BusinessProcesses-PT-11-CTLCardinality-2024-08
Could not compute solution for formula : BusinessProcesses-PT-11-CTLCardinality-2024-09
Could not compute solution for formula : BusinessProcesses-PT-11-CTLCardinality-2024-10
Could not compute solution for formula : BusinessProcesses-PT-11-CTLCardinality-2023-12
Could not compute solution for formula : BusinessProcesses-PT-11-CTLCardinality-2023-14
Could not compute solution for formula : BusinessProcesses-PT-11-CTLCardinality-2023-15

BK_STOP 1717225647209

--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name BusinessProcesses-PT-11-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/1324/ctl_0_
ctl formula name BusinessProcesses-PT-11-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/1324/ctl_1_
ctl formula name BusinessProcesses-PT-11-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/1324/ctl_2_
ctl formula name BusinessProcesses-PT-11-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/1324/ctl_3_
ctl formula name BusinessProcesses-PT-11-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/1324/ctl_4_
ctl formula name BusinessProcesses-PT-11-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/1324/ctl_5_
ctl formula name BusinessProcesses-PT-11-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/1324/ctl_6_
ctl formula name BusinessProcesses-PT-11-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/1324/ctl_7_
ctl formula name BusinessProcesses-PT-11-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/1324/ctl_8_
ctl formula name BusinessProcesses-PT-11-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/1324/ctl_9_
ctl formula name BusinessProcesses-PT-11-CTLCardinality-2023-12
ctl formula formula --ctl=/tmp/1324/ctl_10_
ctl formula name BusinessProcesses-PT-11-CTLCardinality-2023-14
ctl formula formula --ctl=/tmp/1324/ctl_11_
ctl formula name BusinessProcesses-PT-11-CTLCardinality-2023-15
ctl formula formula --ctl=/tmp/1324/ctl_12_
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="CTLCardinality"
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 CTLCardinality"
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-171620399700529"
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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;