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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K 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.3K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K 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 16K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 16:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Apr 11 16:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 11 16:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 11 16:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 63K 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-03-CTLFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-2023-12
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-2023-13
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-2023-14
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717225032296

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-03
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:57:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 06:57:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:57:14] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2024-06-01 06:57:14] [INFO ] Transformed 274 places.
[2024-06-01 06:57:14] [INFO ] Transformed 237 transitions.
[2024-06-01 06:57:14] [INFO ] Found NUPN structural information;
[2024-06-01 06:57:14] [INFO ] Parsed PT model containing 274 places and 237 transitions and 632 arcs in 220 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 17 ms.
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 1 transitions.
Support contains 114 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 236/236 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 271 transition count 236
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 24 place count 249 transition count 214
Iterating global reduction 1 with 22 rules applied. Total rules applied 46 place count 249 transition count 214
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 47 place count 249 transition count 213
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 55 place count 241 transition count 205
Iterating global reduction 2 with 8 rules applied. Total rules applied 63 place count 241 transition count 205
Applied a total of 63 rules in 73 ms. Remains 241 /273 variables (removed 32) and now considering 205/236 (removed 31) transitions.
// Phase 1: matrix 205 rows 241 cols
[2024-06-01 06:57:14] [INFO ] Computed 41 invariants in 24 ms
[2024-06-01 06:57:14] [INFO ] Implicit Places using invariants in 303 ms returned []
[2024-06-01 06:57:14] [INFO ] Invariant cache hit.
[2024-06-01 06:57:14] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
Running 204 sub problems to find dead transitions.
[2024-06-01 06:57:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (OVERLAPS) 1/241 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-06-01 06:57:16] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 19 ms to minimize.
[2024-06-01 06:57:17] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 2 ms to minimize.
[2024-06-01 06:57:17] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 2 ms to minimize.
[2024-06-01 06:57:17] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 2 ms to minimize.
[2024-06-01 06:57:17] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:57:17] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:57:17] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:57:17] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:57:17] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:57:17] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:57:17] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:57:17] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:57:17] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 2 ms to minimize.
[2024-06-01 06:57:17] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:57:17] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:57:17] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:57:17] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:57:17] [INFO ] Deduced a trap composed of 51 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:57:18] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:57:18] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-06-01 06:57:18] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:57:18] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:57:18] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:57:18] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:57:18] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:57:18] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:57:18] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:57:18] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 2 ms to minimize.
[2024-06-01 06:57:18] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 2 ms to minimize.
[2024-06-01 06:57:19] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-06-01 06:57:19] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-06-01 06:57:19] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:57:19] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 2 ms to minimize.
[2024-06-01 06:57:19] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 2 ms to minimize.
[2024-06-01 06:57:19] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 5 ms to minimize.
[2024-06-01 06:57:19] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 2 ms to minimize.
[2024-06-01 06:57:19] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 2 ms to minimize.
[2024-06-01 06:57:19] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:57:19] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 2 ms to minimize.
[2024-06-01 06:57:19] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-06-01 06:57:20] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-06-01 06:57:21] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 2 ms to minimize.
[2024-06-01 06:57:21] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 2 ms to minimize.
[2024-06-01 06:57:21] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-06-01 06:57:21] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:57:21] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 2 ms to minimize.
[2024-06-01 06:57:21] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:57:21] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:57:21] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:57:21] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:57:21] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 2 ms to minimize.
[2024-06-01 06:57:21] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:57:21] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:57:21] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:57:21] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:57:22] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:57:22] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 13 ms to minimize.
[2024-06-01 06:57:22] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:57:22] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:57:22] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-06-01 06:57:22] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:57:22] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:57:22] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:57:23] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:57:23] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:57:23] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:57:23] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:57:23] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:57:23] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
[2024-06-01 06:57:23] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:57:23] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:57:23] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:57:23] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:57:23] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:57:23] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 15/116 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-06-01 06:57:24] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:57:24] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:57:24] [INFO ] Deduced a trap composed of 48 places in 65 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-06-01 06:57:26] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 2 ms to minimize.
[2024-06-01 06:57:26] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:57:26] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:57:26] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:57:26] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:57:26] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:57:26] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 7/126 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-06-01 06:57:27] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 10 (OVERLAPS) 205/446 variables, 241/368 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-06-01 06:57:30] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:57:30] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:57:30] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:57:30] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 2 ms to minimize.
[2024-06-01 06:57:31] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:57:31] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2024-06-01 06:57:31] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:57:31] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/446 variables, 8/376 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-06-01 06:57:33] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/446 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-06-01 06:57:35] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/446 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-06-01 06:57:37] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:57:37] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:57:37] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:57:37] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:57:37] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 0 ms to minimize.
[2024-06-01 06:57:38] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 2 ms to minimize.
[2024-06-01 06:57:38] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:57:38] [INFO ] Deduced a trap composed of 51 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:57:38] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:57:38] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:57:38] [INFO ] Deduced a trap composed of 47 places in 58 ms of which 2 ms to minimize.
[2024-06-01 06:57:38] [INFO ] Deduced a trap composed of 50 places in 48 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/446 variables, 12/390 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-06-01 06:57:39] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/446 variables, 1/391 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-06-01 06:57:42] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:57:43] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/446 variables, 2/393 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-06-01 06:57:44] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:57:44] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:57:44] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 446/446 variables, and 396 constraints, problems are : Problem set: 0 solved, 204 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 114/114 constraints]
Escalating to Integer solving :Problem set: 0 solved, 204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (OVERLAPS) 1/241 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 114/155 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-06-01 06:57:48] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 2 ms to minimize.
[2024-06-01 06:57:48] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:57:48] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 3/158 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-06-01 06:57:53] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 2 ms to minimize.
[2024-06-01 06:57:53] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 1 ms to minimize.
[2024-06-01 06:57:53] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:57:53] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 2 ms to minimize.
[2024-06-01 06:57:53] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:57:53] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 2 ms to minimize.
[2024-06-01 06:57:53] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 2 ms to minimize.
[2024-06-01 06:57:53] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:57:53] [INFO ] Deduced a trap composed of 28 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:57:53] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:57:53] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 11/169 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-06-01 06:57:54] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (OVERLAPS) 205/446 variables, 241/411 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/446 variables, 204/615 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-06-01 06:57:57] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 2 ms to minimize.
[2024-06-01 06:57:57] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 2 ms to minimize.
[2024-06-01 06:57:57] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:57:57] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 2 ms to minimize.
[2024-06-01 06:57:57] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 2 ms to minimize.
[2024-06-01 06:57:57] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 2 ms to minimize.
[2024-06-01 06:57:58] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:57:58] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 2 ms to minimize.
[2024-06-01 06:57:58] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
[2024-06-01 06:57:58] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:57:59] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:57:59] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:57:59] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:57:59] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 2 ms to minimize.
[2024-06-01 06:57:59] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:57:59] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 1 ms to minimize.
[2024-06-01 06:57:59] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 2 ms to minimize.
[2024-06-01 06:57:59] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 2 ms to minimize.
[2024-06-01 06:57:59] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 2 ms to minimize.
[2024-06-01 06:58:00] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/446 variables, 20/635 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-06-01 06:58:03] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 2 ms to minimize.
[2024-06-01 06:58:03] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2024-06-01 06:58:05] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 1 ms to minimize.
[2024-06-01 06:58:05] [INFO ] Deduced a trap composed of 42 places in 68 ms of which 2 ms to minimize.
[2024-06-01 06:58:05] [INFO ] Deduced a trap composed of 53 places in 73 ms of which 2 ms to minimize.
[2024-06-01 06:58:05] [INFO ] Deduced a trap composed of 53 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:58:05] [INFO ] Deduced a trap composed of 50 places in 66 ms of which 2 ms to minimize.
[2024-06-01 06:58:05] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2024-06-01 06:58:07] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 2 ms to minimize.
[2024-06-01 06:58:07] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 1 ms to minimize.
[2024-06-01 06:58:07] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:58:07] [INFO ] Deduced a trap composed of 46 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:58:09] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:58:09] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 1 ms to minimize.
[2024-06-01 06:58:09] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/446 variables, 15/650 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 446/446 variables, and 650 constraints, problems are : Problem set: 0 solved, 204 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 164/164 constraints]
After SMT, in 60132ms problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 60152ms
Starting structural reductions in LTL mode, iteration 1 : 241/273 places, 205/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60768 ms. Remains : 241/273 places, 205/236 transitions.
Support contains 114 out of 241 places after structural reductions.
[2024-06-01 06:58:15] [INFO ] Flatten gal took : 58 ms
[2024-06-01 06:58:15] [INFO ] Flatten gal took : 21 ms
[2024-06-01 06:58:15] [INFO ] Input system was already deterministic with 205 transitions.
RANDOM walk for 40000 steps (473 resets) in 1775 ms. (22 steps per ms) remains 26/83 properties
BEST_FIRST walk for 4004 steps (9 resets) in 35 ms. (111 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (10 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (10 resets) in 13 ms. (286 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (9 resets) in 23 ms. (166 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (10 resets) in 13 ms. (285 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (9 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (9 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (9 resets) in 13 ms. (285 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (9 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (9 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (9 resets) in 8 ms. (444 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (9 resets) in 30 ms. (129 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (9 resets) in 12 ms. (308 steps per ms) remains 26/26 properties
[2024-06-01 06:58:16] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
Problem AtomicPropp31 is UNSAT
At refinement iteration 1 (OVERLAPS) 134/178 variables, 32/32 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 41/219 variables, 9/41 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 190/409 variables, 219/260 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 0/260 constraints. Problems are: Problem set: 1 solved, 25 unsolved
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp34 is UNSAT
At refinement iteration 7 (OVERLAPS) 34/443 variables, 20/280 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 0/280 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 9 (OVERLAPS) 3/446 variables, 2/282 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/446 variables, 0/282 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 11 (OVERLAPS) 0/446 variables, 0/282 constraints. Problems are: Problem set: 3 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 446/446 variables, and 282 constraints, problems are : Problem set: 3 solved, 23 unsolved in 2033 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 106/142 variables, 23/23 constraints. Problems are: Problem set: 3 solved, 23 unsolved
[2024-06-01 06:58:18] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:58:18] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 0 ms to minimize.
[2024-06-01 06:58:18] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:58:18] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 4/27 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/27 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 76/218 variables, 18/45 constraints. Problems are: Problem set: 3 solved, 23 unsolved
[2024-06-01 06:58:19] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2024-06-01 06:58:19] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-06-01 06:58:19] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 1 ms to minimize.
[2024-06-01 06:58:19] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 4/49 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/49 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 189/407 variables, 218/267 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/407 variables, 15/282 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/407 variables, 0/282 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 10 (OVERLAPS) 36/443 variables, 21/303 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 8/311 constraints. Problems are: Problem set: 3 solved, 23 unsolved
[2024-06-01 06:58:20] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 1 ms to minimize.
[2024-06-01 06:58:20] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:58:20] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:58:20] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:58:20] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:58:20] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:58:20] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 1 ms to minimize.
[2024-06-01 06:58:20] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 1 ms to minimize.
Problem AtomicPropp46 is UNSAT
[2024-06-01 06:58:22] [INFO ] Deduced a trap composed of 25 places in 1892 ms of which 1 ms to minimize.
[2024-06-01 06:58:22] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:58:22] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:58:23] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:58:23] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:58:23] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 443/446 variables, and 325 constraints, problems are : Problem set: 4 solved, 22 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 239/241 constraints, PredecessorRefiner: 23/26 constraints, Known Traps: 22/22 constraints]
After SMT, in 7058ms problems are : Problem set: 4 solved, 22 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 33 out of 241 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 241/241 places, 205/205 transitions.
Graph (complete) has 481 edges and 241 vertex of which 240 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
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 240 transition count 172
Reduce places removed 31 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 34 rules applied. Total rules applied 67 place count 209 transition count 169
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 71 place count 206 transition count 168
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 71 place count 206 transition count 133
Deduced a syphon composed of 35 places in 1 ms
Ensure Unique test removed 7 places
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 77 rules applied. Total rules applied 148 place count 164 transition count 133
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 166 place count 146 transition count 115
Iterating global reduction 3 with 18 rules applied. Total rules applied 184 place count 146 transition count 115
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 272 place count 102 transition count 71
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 273 place count 101 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 274 place count 100 transition count 70
Applied a total of 274 rules in 77 ms. Remains 100 /241 variables (removed 141) and now considering 70/205 (removed 135) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 100/241 places, 70/205 transitions.
RANDOM walk for 40000 steps (8 resets) in 1324 ms. (30 steps per ms) remains 1/22 properties
BEST_FIRST walk for 4475 steps (1 resets) in 30 ms. (144 steps per ms) remains 0/1 properties
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
[2024-06-01 06:58:23] [INFO ] Flatten gal took : 13 ms
[2024-06-01 06:58:23] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BusinessProcesses-PT-03-CTLFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 06:58:23] [INFO ] Flatten gal took : 13 ms
[2024-06-01 06:58:23] [INFO ] Input system was already deterministic with 205 transitions.
Support contains 103 out of 241 places (down from 105) after GAL structural reductions.
Computed a total of 235 stabilizing places and 197 stable transitions
Graph (complete) has 481 edges and 241 vertex of which 240 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 205/205 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 214 transition count 178
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 214 transition count 178
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 61 place count 207 transition count 171
Iterating global reduction 0 with 7 rules applied. Total rules applied 68 place count 207 transition count 171
Applied a total of 68 rules in 15 ms. Remains 207 /241 variables (removed 34) and now considering 171/205 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 207/241 places, 171/205 transitions.
[2024-06-01 06:58:23] [INFO ] Flatten gal took : 9 ms
[2024-06-01 06:58:23] [INFO ] Flatten gal took : 9 ms
[2024-06-01 06:58:23] [INFO ] Input system was already deterministic with 171 transitions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 205/205 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 211 transition count 175
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 211 transition count 175
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 68 place count 203 transition count 167
Iterating global reduction 0 with 8 rules applied. Total rules applied 76 place count 203 transition count 167
Applied a total of 76 rules in 15 ms. Remains 203 /241 variables (removed 38) and now considering 167/205 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 203/241 places, 167/205 transitions.
[2024-06-01 06:58:23] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:58:23] [INFO ] Flatten gal took : 9 ms
[2024-06-01 06:58:23] [INFO ] Input system was already deterministic with 167 transitions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 205/205 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 213 transition count 177
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 213 transition count 177
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 207 transition count 171
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 207 transition count 171
Applied a total of 68 rules in 13 ms. Remains 207 /241 variables (removed 34) and now considering 171/205 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 207/241 places, 171/205 transitions.
[2024-06-01 06:58:23] [INFO ] Flatten gal took : 9 ms
[2024-06-01 06:58:23] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:58:23] [INFO ] Input system was already deterministic with 171 transitions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 205/205 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 213 transition count 177
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 213 transition count 177
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 64 place count 205 transition count 169
Iterating global reduction 0 with 8 rules applied. Total rules applied 72 place count 205 transition count 169
Applied a total of 72 rules in 13 ms. Remains 205 /241 variables (removed 36) and now considering 169/205 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 205/241 places, 169/205 transitions.
[2024-06-01 06:58:23] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:58:23] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:58:23] [INFO ] Input system was already deterministic with 169 transitions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 205/205 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 212 transition count 176
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 212 transition count 176
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 66 place count 204 transition count 168
Iterating global reduction 0 with 8 rules applied. Total rules applied 74 place count 204 transition count 168
Applied a total of 74 rules in 14 ms. Remains 204 /241 variables (removed 37) and now considering 168/205 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 204/241 places, 168/205 transitions.
[2024-06-01 06:58:23] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:58:23] [INFO ] Flatten gal took : 9 ms
[2024-06-01 06:58:24] [INFO ] Input system was already deterministic with 168 transitions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 205/205 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 212 transition count 176
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 212 transition count 176
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 66 place count 204 transition count 168
Iterating global reduction 0 with 8 rules applied. Total rules applied 74 place count 204 transition count 168
Applied a total of 74 rules in 13 ms. Remains 204 /241 variables (removed 37) and now considering 168/205 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 204/241 places, 168/205 transitions.
[2024-06-01 06:58:24] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:58:24] [INFO ] Flatten gal took : 12 ms
[2024-06-01 06:58:24] [INFO ] Input system was already deterministic with 168 transitions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 205/205 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 212 transition count 176
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 212 transition count 176
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 66 place count 204 transition count 168
Iterating global reduction 0 with 8 rules applied. Total rules applied 74 place count 204 transition count 168
Applied a total of 74 rules in 12 ms. Remains 204 /241 variables (removed 37) and now considering 168/205 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 204/241 places, 168/205 transitions.
[2024-06-01 06:58:24] [INFO ] Flatten gal took : 7 ms
[2024-06-01 06:58:24] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:58:24] [INFO ] Input system was already deterministic with 168 transitions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 205/205 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 213 transition count 177
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 213 transition count 177
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 63 place count 206 transition count 170
Iterating global reduction 0 with 7 rules applied. Total rules applied 70 place count 206 transition count 170
Applied a total of 70 rules in 12 ms. Remains 206 /241 variables (removed 35) and now considering 170/205 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 206/241 places, 170/205 transitions.
[2024-06-01 06:58:24] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:58:24] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:58:24] [INFO ] Input system was already deterministic with 170 transitions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 205/205 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 217 transition count 181
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 217 transition count 181
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 210 transition count 174
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 210 transition count 174
Applied a total of 62 rules in 13 ms. Remains 210 /241 variables (removed 31) and now considering 174/205 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 210/241 places, 174/205 transitions.
[2024-06-01 06:58:24] [INFO ] Flatten gal took : 7 ms
[2024-06-01 06:58:24] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:58:24] [INFO ] Input system was already deterministic with 174 transitions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 205/205 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 210 transition count 174
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 210 transition count 174
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 70 place count 202 transition count 166
Iterating global reduction 0 with 8 rules applied. Total rules applied 78 place count 202 transition count 166
Applied a total of 78 rules in 14 ms. Remains 202 /241 variables (removed 39) and now considering 166/205 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 202/241 places, 166/205 transitions.
[2024-06-01 06:58:24] [INFO ] Flatten gal took : 6 ms
[2024-06-01 06:58:24] [INFO ] Flatten gal took : 6 ms
[2024-06-01 06:58:24] [INFO ] Input system was already deterministic with 166 transitions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 205/205 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 210 transition count 174
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 210 transition count 174
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 70 place count 202 transition count 166
Iterating global reduction 0 with 8 rules applied. Total rules applied 78 place count 202 transition count 166
Applied a total of 78 rules in 13 ms. Remains 202 /241 variables (removed 39) and now considering 166/205 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 202/241 places, 166/205 transitions.
[2024-06-01 06:58:24] [INFO ] Flatten gal took : 6 ms
[2024-06-01 06:58:24] [INFO ] Flatten gal took : 7 ms
[2024-06-01 06:58:24] [INFO ] Input system was already deterministic with 166 transitions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 205/205 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 211 transition count 175
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 211 transition count 175
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 68 place count 203 transition count 167
Iterating global reduction 0 with 8 rules applied. Total rules applied 76 place count 203 transition count 167
Applied a total of 76 rules in 21 ms. Remains 203 /241 variables (removed 38) and now considering 167/205 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 203/241 places, 167/205 transitions.
[2024-06-01 06:58:24] [INFO ] Flatten gal took : 6 ms
[2024-06-01 06:58:24] [INFO ] Flatten gal took : 7 ms
[2024-06-01 06:58:24] [INFO ] Input system was already deterministic with 167 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 241/241 places, 205/205 transitions.
Graph (trivial) has 138 edges and 241 vertex of which 6 / 241 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 475 edges and 236 vertex of which 235 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 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 234 transition count 155
Reduce places removed 42 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 43 rules applied. Total rules applied 87 place count 192 transition count 154
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 88 place count 191 transition count 154
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 88 place count 191 transition count 115
Deduced a syphon composed of 39 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 176 place count 142 transition count 115
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 204 place count 114 transition count 87
Ensure Unique test removed 2 places
Iterating global reduction 3 with 30 rules applied. Total rules applied 234 place count 112 transition count 87
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 234 place count 112 transition count 85
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 238 place count 110 transition count 85
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 328 place count 65 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 330 place count 64 transition count 39
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 331 place count 63 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 332 place count 62 transition count 38
Applied a total of 332 rules in 37 ms. Remains 62 /241 variables (removed 179) and now considering 38/205 (removed 167) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 37 ms. Remains : 62/241 places, 38/205 transitions.
[2024-06-01 06:58:24] [INFO ] Flatten gal took : 2 ms
[2024-06-01 06:58:24] [INFO ] Flatten gal took : 3 ms
[2024-06-01 06:58:24] [INFO ] Input system was already deterministic with 38 transitions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 205/205 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 213 transition count 177
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 213 transition count 177
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 207 transition count 171
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 207 transition count 171
Applied a total of 68 rules in 12 ms. Remains 207 /241 variables (removed 34) and now considering 171/205 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 207/241 places, 171/205 transitions.
[2024-06-01 06:58:24] [INFO ] Flatten gal took : 7 ms
[2024-06-01 06:58:24] [INFO ] Flatten gal took : 7 ms
[2024-06-01 06:58:24] [INFO ] Input system was already deterministic with 171 transitions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 205/205 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 211 transition count 175
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 211 transition count 175
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 67 place count 204 transition count 168
Iterating global reduction 0 with 7 rules applied. Total rules applied 74 place count 204 transition count 168
Applied a total of 74 rules in 13 ms. Remains 204 /241 variables (removed 37) and now considering 168/205 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 204/241 places, 168/205 transitions.
[2024-06-01 06:58:24] [INFO ] Flatten gal took : 6 ms
[2024-06-01 06:58:24] [INFO ] Flatten gal took : 6 ms
[2024-06-01 06:58:24] [INFO ] Input system was already deterministic with 168 transitions.
[2024-06-01 06:58:24] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:58:24] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:58:24] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2024-06-01 06:58:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 241 places, 205 transitions and 566 arcs took 2 ms.
Total runtime 70748 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-03-CTLFireability-2024-00
Could not compute solution for formula : BusinessProcesses-PT-03-CTLFireability-2024-01
Could not compute solution for formula : BusinessProcesses-PT-03-CTLFireability-2024-02
Could not compute solution for formula : BusinessProcesses-PT-03-CTLFireability-2024-03
Could not compute solution for formula : BusinessProcesses-PT-03-CTLFireability-2024-05
Could not compute solution for formula : BusinessProcesses-PT-03-CTLFireability-2024-06
Could not compute solution for formula : BusinessProcesses-PT-03-CTLFireability-2024-07
Could not compute solution for formula : BusinessProcesses-PT-03-CTLFireability-2024-08
Could not compute solution for formula : BusinessProcesses-PT-03-CTLFireability-2024-09
Could not compute solution for formula : BusinessProcesses-PT-03-CTLFireability-2024-10
Could not compute solution for formula : BusinessProcesses-PT-03-CTLFireability-2024-11
Could not compute solution for formula : BusinessProcesses-PT-03-CTLFireability-2023-12
Could not compute solution for formula : BusinessProcesses-PT-03-CTLFireability-2023-13
Could not compute solution for formula : BusinessProcesses-PT-03-CTLFireability-2023-14
Could not compute solution for formula : BusinessProcesses-PT-03-CTLFireability-2023-15

BK_STOP 1717225104867

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

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