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-171620399700506.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-08, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399700506
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K 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.7K 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.4K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 16:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 161K Apr 11 16:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 11 16:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Apr 11 16:26 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 91K 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-08-CTLFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-08-CTLFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-08-CTLFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-08-CTLFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-08-CTLFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-08-CTLFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-08-CTLFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-08-CTLFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-08-CTLFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-08-CTLFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-08-CTLFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-08-CTLFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-08-CTLFireability-2023-12
FORMULA_NAME BusinessProcesses-PT-08-CTLFireability-2023-13
FORMULA_NAME BusinessProcesses-PT-08-CTLFireability-2023-14
FORMULA_NAME BusinessProcesses-PT-08-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717225340056

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-08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:02:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 07:02:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:02:21] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2024-06-01 07:02:21] [INFO ] Transformed 393 places.
[2024-06-01 07:02:21] [INFO ] Transformed 344 transitions.
[2024-06-01 07:02:21] [INFO ] Found NUPN structural information;
[2024-06-01 07:02:21] [INFO ] Parsed PT model containing 393 places and 344 transitions and 911 arcs in 232 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 17 ms.
Deduced a syphon composed of 13 places in 16 ms
Reduce places removed 13 places and 13 transitions.
Support contains 102 out of 380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 331/331 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 372 transition count 331
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 54 place count 326 transition count 285
Iterating global reduction 1 with 46 rules applied. Total rules applied 100 place count 326 transition count 285
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 101 place count 326 transition count 284
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 123 place count 304 transition count 262
Iterating global reduction 2 with 22 rules applied. Total rules applied 145 place count 304 transition count 262
Applied a total of 145 rules in 95 ms. Remains 304 /380 variables (removed 76) and now considering 262/331 (removed 69) transitions.
// Phase 1: matrix 262 rows 304 cols
[2024-06-01 07:02:21] [INFO ] Computed 50 invariants in 26 ms
[2024-06-01 07:02:22] [INFO ] Implicit Places using invariants in 306 ms returned []
[2024-06-01 07:02:22] [INFO ] Invariant cache hit.
[2024-06-01 07:02:22] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 574 ms to find 0 implicit places.
Running 261 sub problems to find dead transitions.
[2024-06-01 07:02:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (OVERLAPS) 1/304 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-06-01 07:02:25] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 26 ms to minimize.
[2024-06-01 07:02:25] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 7 ms to minimize.
[2024-06-01 07:02:25] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:02:25] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 3 ms to minimize.
[2024-06-01 07:02:26] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:02:26] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:02:26] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:02:26] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:02:26] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:02:26] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:02:26] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:02:26] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:02:26] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:02:26] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:02:26] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:02:26] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:02:27] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:02:27] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:02:27] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:02:27] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/304 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-06-01 07:02:28] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:02:28] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 3 ms to minimize.
[2024-06-01 07:02:28] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:02:28] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:02:28] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:02:28] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:02:28] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:02:28] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:02:28] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:02:29] [INFO ] Deduced a trap composed of 57 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:02:29] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:02:29] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:02:29] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 3 ms to minimize.
[2024-06-01 07:02:29] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:02:29] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 3 ms to minimize.
[2024-06-01 07:02:29] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:02:29] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:02:29] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:02:30] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:02:30] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/304 variables, 20/90 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-06-01 07:02:31] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:02:31] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:02:32] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:02:32] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 3 ms to minimize.
[2024-06-01 07:02:32] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:02:33] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:02:33] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:02:33] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:02:33] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:02:33] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 10/100 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-06-01 07:02:34] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:02:35] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:02:35] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 3/103 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-06-01 07:02:36] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (OVERLAPS) 262/566 variables, 304/408 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-06-01 07:02:40] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:02:40] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:02:40] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 4 ms to minimize.
[2024-06-01 07:02:40] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:02:40] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:02:40] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:02:41] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:02:41] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:02:41] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 3 ms to minimize.
[2024-06-01 07:02:42] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:02:42] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:02:42] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:02:42] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:02:42] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:02:42] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:02:42] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 2 ms to minimize.
[2024-06-01 07:02:42] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:02:43] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:02:43] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:02:43] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/566 variables, 20/428 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/566 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 11 (OVERLAPS) 0/566 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 428 constraints, problems are : Problem set: 0 solved, 261 unsolved in 28135 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 304/304 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 74/74 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (OVERLAPS) 1/304 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/304 variables, 74/124 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-06-01 07:02:53] [INFO ] Deduced a trap composed of 36 places in 90 ms of which 3 ms to minimize.
[2024-06-01 07:02:53] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:02:53] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:02:53] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/304 variables, 4/128 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-06-01 07:02:55] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (OVERLAPS) 262/566 variables, 304/433 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 261/694 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-06-01 07:02:58] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:02:59] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:02:59] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:02:59] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:03:00] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:03:00] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:03:00] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:03:00] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:03:00] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 3 ms to minimize.
[2024-06-01 07:03:01] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:03:01] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:03:01] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:03:01] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:03:01] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:03:01] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:03:02] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:03:02] [INFO ] Deduced a trap composed of 51 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:03:03] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:03:04] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/566 variables, 19/713 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-06-01 07:03:11] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:03:11] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:03:12] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:03:12] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:03:13] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/566 variables, 5/718 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 566/566 variables, and 718 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 304/304 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 103/103 constraints]
After SMT, in 58254ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 58275ms
Starting structural reductions in LTL mode, iteration 1 : 304/380 places, 262/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58965 ms. Remains : 304/380 places, 262/331 transitions.
Support contains 102 out of 304 places after structural reductions.
[2024-06-01 07:03:21] [INFO ] Flatten gal took : 56 ms
[2024-06-01 07:03:21] [INFO ] Flatten gal took : 26 ms
[2024-06-01 07:03:21] [INFO ] Input system was already deterministic with 262 transitions.
Support contains 97 out of 304 places (down from 102) after GAL structural reductions.
RANDOM walk for 40000 steps (337 resets) in 2880 ms. (13 steps per ms) remains 11/59 properties
BEST_FIRST walk for 40003 steps (60 resets) in 280 ms. (142 steps per ms) remains 9/11 properties
BEST_FIRST walk for 40003 steps (60 resets) in 207 ms. (192 steps per ms) remains 6/9 properties
BEST_FIRST walk for 40004 steps (64 resets) in 156 ms. (254 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (64 resets) in 120 ms. (330 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (55 resets) in 149 ms. (266 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (60 resets) in 85 ms. (465 steps per ms) remains 4/6 properties
[2024-06-01 07:03:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 68/77 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 196/273 variables, 41/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 241/514 variables, 273/323 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 47/561 variables, 27/350 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:03:23] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:03:23] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:03:23] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:03:23] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/561 variables, 4/354 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/561 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 5/566 variables, 4/358 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/566 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/566 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 358 constraints, problems are : Problem set: 0 solved, 4 unsolved in 859 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 304/304 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 68/77 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 196/273 variables, 41/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:03:23] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:03:23] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:03:23] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:03:23] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 241/514 variables, 273/328 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/514 variables, 3/331 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 0 ms to minimize.
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/514 variables, 4/335 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/514 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 47/561 variables, 27/362 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/561 variables, 1/363 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/561 variables, 3/366 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:03:25] [INFO ] Deduced a trap composed of 26 places in 488 ms of which 1 ms to minimize.
[2024-06-01 07:03:25] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:03:25] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/561 variables, 6/372 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/561 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 5/566 variables, 4/376 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/566 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/566 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 566/566 variables, and 376 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2201 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 304/304 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 18/18 constraints]
After SMT, in 3065ms problems are : Problem set: 0 solved, 4 unsolved
Finished Parikh walk after 14430 steps, including 130 resets, run visited all 1 properties in 33 ms. (steps per millisecond=437 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 194 ms.
[2024-06-01 07:03:25] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:03:25] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:03:25] [INFO ] Input system was already deterministic with 262 transitions.
Computed a total of 103 stabilizing places and 99 stable transitions
Graph (complete) has 630 edges and 304 vertex of which 303 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Starting structural reductions in LTL mode, iteration 0 : 304/304 places, 262/262 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 273 transition count 231
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 273 transition count 231
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 75 place count 260 transition count 218
Iterating global reduction 0 with 13 rules applied. Total rules applied 88 place count 260 transition count 218
Applied a total of 88 rules in 33 ms. Remains 260 /304 variables (removed 44) and now considering 218/262 (removed 44) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 260/304 places, 218/262 transitions.
[2024-06-01 07:03:26] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:03:26] [INFO ] Flatten gal took : 11 ms
[2024-06-01 07:03:26] [INFO ] Input system was already deterministic with 218 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 304/304 places, 262/262 transitions.
Graph (trivial) has 174 edges and 304 vertex of which 6 / 304 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 623 edges and 299 vertex of which 298 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 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 297 transition count 203
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 104 place count 246 transition count 203
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 53 Pre rules applied. Total rules applied 104 place count 246 transition count 150
Deduced a syphon composed of 53 places in 1 ms
Ensure Unique test removed 11 places
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 117 rules applied. Total rules applied 221 place count 182 transition count 150
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 250 place count 153 transition count 121
Iterating global reduction 2 with 29 rules applied. Total rules applied 279 place count 153 transition count 121
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 279 place count 153 transition count 118
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 285 place count 150 transition count 118
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 141 rules applied. Total rules applied 426 place count 78 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 427 place count 77 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 428 place count 76 transition count 48
Applied a total of 428 rules in 48 ms. Remains 76 /304 variables (removed 228) and now considering 48/262 (removed 214) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 48 ms. Remains : 76/304 places, 48/262 transitions.
[2024-06-01 07:03:26] [INFO ] Flatten gal took : 4 ms
[2024-06-01 07:03:26] [INFO ] Flatten gal took : 4 ms
[2024-06-01 07:03:26] [INFO ] Input system was already deterministic with 48 transitions.
RANDOM walk for 10517 steps (2995 resets) in 92 ms. (113 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-08-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 304/304 places, 262/262 transitions.
Graph (trivial) has 167 edges and 304 vertex of which 6 / 304 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 623 edges and 299 vertex of which 298 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 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 49 place count 297 transition count 207
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 96 place count 250 transition count 207
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 53 Pre rules applied. Total rules applied 96 place count 250 transition count 154
Deduced a syphon composed of 53 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 117 rules applied. Total rules applied 213 place count 186 transition count 154
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 239 place count 160 transition count 128
Iterating global reduction 2 with 26 rules applied. Total rules applied 265 place count 160 transition count 128
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 265 place count 160 transition count 125
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 271 place count 157 transition count 125
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 137 rules applied. Total rules applied 408 place count 87 transition count 58
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 409 place count 86 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 410 place count 85 transition count 57
Applied a total of 410 rules in 65 ms. Remains 85 /304 variables (removed 219) and now considering 57/262 (removed 205) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 65 ms. Remains : 85/304 places, 57/262 transitions.
[2024-06-01 07:03:26] [INFO ] Flatten gal took : 4 ms
[2024-06-01 07:03:26] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:03:26] [INFO ] Input system was already deterministic with 57 transitions.
Starting structural reductions in LTL mode, iteration 0 : 304/304 places, 262/262 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 278 transition count 236
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 278 transition count 236
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 62 place count 268 transition count 226
Iterating global reduction 0 with 10 rules applied. Total rules applied 72 place count 268 transition count 226
Applied a total of 72 rules in 37 ms. Remains 268 /304 variables (removed 36) and now considering 226/262 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38 ms. Remains : 268/304 places, 226/262 transitions.
[2024-06-01 07:03:26] [INFO ] Flatten gal took : 9 ms
[2024-06-01 07:03:26] [INFO ] Flatten gal took : 10 ms
[2024-06-01 07:03:26] [INFO ] Input system was already deterministic with 226 transitions.
Starting structural reductions in LTL mode, iteration 0 : 304/304 places, 262/262 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 277 transition count 235
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 277 transition count 235
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 65 place count 266 transition count 224
Iterating global reduction 0 with 11 rules applied. Total rules applied 76 place count 266 transition count 224
Applied a total of 76 rules in 17 ms. Remains 266 /304 variables (removed 38) and now considering 224/262 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 266/304 places, 224/262 transitions.
[2024-06-01 07:03:26] [INFO ] Flatten gal took : 9 ms
[2024-06-01 07:03:26] [INFO ] Flatten gal took : 22 ms
[2024-06-01 07:03:26] [INFO ] Input system was already deterministic with 224 transitions.
Starting structural reductions in LTL mode, iteration 0 : 304/304 places, 262/262 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 275 transition count 233
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 275 transition count 233
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 71 place count 262 transition count 220
Iterating global reduction 0 with 13 rules applied. Total rules applied 84 place count 262 transition count 220
Applied a total of 84 rules in 21 ms. Remains 262 /304 variables (removed 42) and now considering 220/262 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 262/304 places, 220/262 transitions.
[2024-06-01 07:03:26] [INFO ] Flatten gal took : 10 ms
[2024-06-01 07:03:26] [INFO ] Flatten gal took : 10 ms
[2024-06-01 07:03:26] [INFO ] Input system was already deterministic with 220 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 304/304 places, 262/262 transitions.
Graph (trivial) has 175 edges and 304 vertex of which 6 / 304 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 623 edges and 299 vertex of which 298 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 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 297 transition count 203
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 104 place count 246 transition count 203
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 54 Pre rules applied. Total rules applied 104 place count 246 transition count 149
Deduced a syphon composed of 54 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 119 rules applied. Total rules applied 223 place count 181 transition count 149
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 253 place count 151 transition count 119
Iterating global reduction 2 with 30 rules applied. Total rules applied 283 place count 151 transition count 119
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 283 place count 151 transition count 116
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 289 place count 148 transition count 116
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 131 rules applied. Total rules applied 420 place count 81 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 421 place count 80 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 422 place count 79 transition count 51
Applied a total of 422 rules in 60 ms. Remains 79 /304 variables (removed 225) and now considering 51/262 (removed 211) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60 ms. Remains : 79/304 places, 51/262 transitions.
[2024-06-01 07:03:26] [INFO ] Flatten gal took : 3 ms
[2024-06-01 07:03:26] [INFO ] Flatten gal took : 4 ms
[2024-06-01 07:03:26] [INFO ] Input system was already deterministic with 51 transitions.
RANDOM walk for 16 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-08-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 304/304 places, 262/262 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 273 transition count 231
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 273 transition count 231
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 76 place count 259 transition count 217
Iterating global reduction 0 with 14 rules applied. Total rules applied 90 place count 259 transition count 217
Applied a total of 90 rules in 24 ms. Remains 259 /304 variables (removed 45) and now considering 217/262 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 259/304 places, 217/262 transitions.
[2024-06-01 07:03:26] [INFO ] Flatten gal took : 8 ms
[2024-06-01 07:03:26] [INFO ] Flatten gal took : 8 ms
[2024-06-01 07:03:26] [INFO ] Input system was already deterministic with 217 transitions.
Starting structural reductions in LTL mode, iteration 0 : 304/304 places, 262/262 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 280 transition count 238
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 280 transition count 238
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 61 place count 267 transition count 225
Iterating global reduction 0 with 13 rules applied. Total rules applied 74 place count 267 transition count 225
Applied a total of 74 rules in 12 ms. Remains 267 /304 variables (removed 37) and now considering 225/262 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 267/304 places, 225/262 transitions.
[2024-06-01 07:03:26] [INFO ] Flatten gal took : 8 ms
[2024-06-01 07:03:26] [INFO ] Flatten gal took : 17 ms
[2024-06-01 07:03:26] [INFO ] Input system was already deterministic with 225 transitions.
Starting structural reductions in LTL mode, iteration 0 : 304/304 places, 262/262 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 275 transition count 233
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 275 transition count 233
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 71 place count 262 transition count 220
Iterating global reduction 0 with 13 rules applied. Total rules applied 84 place count 262 transition count 220
Applied a total of 84 rules in 10 ms. Remains 262 /304 variables (removed 42) and now considering 220/262 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 262/304 places, 220/262 transitions.
[2024-06-01 07:03:26] [INFO ] Flatten gal took : 7 ms
[2024-06-01 07:03:26] [INFO ] Flatten gal took : 20 ms
[2024-06-01 07:03:26] [INFO ] Input system was already deterministic with 220 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 304/304 places, 262/262 transitions.
Graph (trivial) has 171 edges and 304 vertex of which 6 / 304 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 623 edges and 299 vertex of which 298 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 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 297 transition count 203
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 104 place count 246 transition count 203
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 104 place count 246 transition count 152
Deduced a syphon composed of 51 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 216 place count 185 transition count 152
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 243 place count 158 transition count 125
Iterating global reduction 2 with 27 rules applied. Total rules applied 270 place count 158 transition count 125
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 270 place count 158 transition count 122
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 276 place count 155 transition count 122
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 143 rules applied. Total rules applied 419 place count 82 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 420 place count 81 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 421 place count 80 transition count 51
Applied a total of 421 rules in 38 ms. Remains 80 /304 variables (removed 224) and now considering 51/262 (removed 211) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38 ms. Remains : 80/304 places, 51/262 transitions.
[2024-06-01 07:03:26] [INFO ] Flatten gal took : 4 ms
[2024-06-01 07:03:26] [INFO ] Flatten gal took : 3 ms
[2024-06-01 07:03:26] [INFO ] Input system was already deterministic with 51 transitions.
Starting structural reductions in LTL mode, iteration 0 : 304/304 places, 262/262 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 275 transition count 233
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 275 transition count 233
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 71 place count 262 transition count 220
Iterating global reduction 0 with 13 rules applied. Total rules applied 84 place count 262 transition count 220
Applied a total of 84 rules in 10 ms. Remains 262 /304 variables (removed 42) and now considering 220/262 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 262/304 places, 220/262 transitions.
[2024-06-01 07:03:26] [INFO ] Flatten gal took : 8 ms
[2024-06-01 07:03:26] [INFO ] Flatten gal took : 8 ms
[2024-06-01 07:03:26] [INFO ] Input system was already deterministic with 220 transitions.
Starting structural reductions in LTL mode, iteration 0 : 304/304 places, 262/262 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 273 transition count 231
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 273 transition count 231
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 76 place count 259 transition count 217
Iterating global reduction 0 with 14 rules applied. Total rules applied 90 place count 259 transition count 217
Applied a total of 90 rules in 8 ms. Remains 259 /304 variables (removed 45) and now considering 217/262 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 259/304 places, 217/262 transitions.
[2024-06-01 07:03:27] [INFO ] Flatten gal took : 7 ms
[2024-06-01 07:03:27] [INFO ] Flatten gal took : 7 ms
[2024-06-01 07:03:27] [INFO ] Input system was already deterministic with 217 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 304/304 places, 262/262 transitions.
Graph (complete) has 630 edges and 304 vertex of which 303 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 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 302 transition count 217
Reduce places removed 43 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 46 rules applied. Total rules applied 90 place count 259 transition count 214
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 93 place count 256 transition count 214
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 93 place count 256 transition count 154
Deduced a syphon composed of 60 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 131 rules applied. Total rules applied 224 place count 185 transition count 154
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 253 place count 156 transition count 125
Iterating global reduction 3 with 29 rules applied. Total rules applied 282 place count 156 transition count 125
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 282 place count 156 transition count 122
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 288 place count 153 transition count 122
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 422 place count 85 transition count 56
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 423 place count 85 transition count 55
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 424 place count 84 transition count 54
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 425 place count 83 transition count 54
Applied a total of 425 rules in 23 ms. Remains 83 /304 variables (removed 221) and now considering 54/262 (removed 208) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 83/304 places, 54/262 transitions.
[2024-06-01 07:03:27] [INFO ] Flatten gal took : 3 ms
[2024-06-01 07:03:27] [INFO ] Flatten gal took : 3 ms
[2024-06-01 07:03:27] [INFO ] Input system was already deterministic with 54 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 304/304 places, 262/262 transitions.
Graph (complete) has 630 edges and 304 vertex of which 303 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 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 302 transition count 216
Reduce places removed 44 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 46 rules applied. Total rules applied 91 place count 258 transition count 214
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 93 place count 256 transition count 214
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 61 Pre rules applied. Total rules applied 93 place count 256 transition count 153
Deduced a syphon composed of 61 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 133 rules applied. Total rules applied 226 place count 184 transition count 153
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 257 place count 153 transition count 122
Iterating global reduction 3 with 31 rules applied. Total rules applied 288 place count 153 transition count 122
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 288 place count 153 transition count 119
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 294 place count 150 transition count 119
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 3 with 135 rules applied. Total rules applied 429 place count 81 transition count 53
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 430 place count 81 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 431 place count 80 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 432 place count 79 transition count 51
Applied a total of 432 rules in 36 ms. Remains 79 /304 variables (removed 225) and now considering 51/262 (removed 211) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 36 ms. Remains : 79/304 places, 51/262 transitions.
[2024-06-01 07:03:27] [INFO ] Flatten gal took : 3 ms
[2024-06-01 07:03:27] [INFO ] Flatten gal took : 2 ms
[2024-06-01 07:03:27] [INFO ] Input system was already deterministic with 51 transitions.
RANDOM walk for 3922 steps (276 resets) in 11 ms. (326 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-08-CTLFireability-2023-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 304/304 places, 262/262 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 273 transition count 231
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 273 transition count 231
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 76 place count 259 transition count 217
Iterating global reduction 0 with 14 rules applied. Total rules applied 90 place count 259 transition count 217
Applied a total of 90 rules in 24 ms. Remains 259 /304 variables (removed 45) and now considering 217/262 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 259/304 places, 217/262 transitions.
[2024-06-01 07:03:27] [INFO ] Flatten gal took : 20 ms
[2024-06-01 07:03:27] [INFO ] Flatten gal took : 8 ms
[2024-06-01 07:03:27] [INFO ] Input system was already deterministic with 217 transitions.
[2024-06-01 07:03:27] [INFO ] Flatten gal took : 9 ms
[2024-06-01 07:03:27] [INFO ] Flatten gal took : 8 ms
[2024-06-01 07:03:27] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 7 ms.
[2024-06-01 07:03:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 304 places, 262 transitions and 739 arcs took 3 ms.
Total runtime 65853 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-08-CTLFireability-2024-00
Could not compute solution for formula : BusinessProcesses-PT-08-CTLFireability-2024-02
Could not compute solution for formula : BusinessProcesses-PT-08-CTLFireability-2024-03
Could not compute solution for formula : BusinessProcesses-PT-08-CTLFireability-2024-04
Could not compute solution for formula : BusinessProcesses-PT-08-CTLFireability-2024-05
Could not compute solution for formula : BusinessProcesses-PT-08-CTLFireability-2024-07
Could not compute solution for formula : BusinessProcesses-PT-08-CTLFireability-2024-08
Could not compute solution for formula : BusinessProcesses-PT-08-CTLFireability-2024-09
Could not compute solution for formula : BusinessProcesses-PT-08-CTLFireability-2024-10
Could not compute solution for formula : BusinessProcesses-PT-08-CTLFireability-2024-11
Could not compute solution for formula : BusinessProcesses-PT-08-CTLFireability-2023-12
Could not compute solution for formula : BusinessProcesses-PT-08-CTLFireability-2023-13
Could not compute solution for formula : BusinessProcesses-PT-08-CTLFireability-2023-15

BK_STOP 1717225407712

--------------------
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-08-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/905/ctl_0_
ctl formula name BusinessProcesses-PT-08-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/905/ctl_1_
ctl formula name BusinessProcesses-PT-08-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/905/ctl_2_
ctl formula name BusinessProcesses-PT-08-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/905/ctl_3_
ctl formula name BusinessProcesses-PT-08-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/905/ctl_4_
ctl formula name BusinessProcesses-PT-08-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/905/ctl_5_
ctl formula name BusinessProcesses-PT-08-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/905/ctl_6_
ctl formula name BusinessProcesses-PT-08-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/905/ctl_7_
ctl formula name BusinessProcesses-PT-08-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/905/ctl_8_
ctl formula name BusinessProcesses-PT-08-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/905/ctl_9_
ctl formula name BusinessProcesses-PT-08-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/905/ctl_10_
ctl formula name BusinessProcesses-PT-08-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/905/ctl_11_
ctl formula name BusinessProcesses-PT-08-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/905/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-08"
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-08, 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-171620399700506"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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