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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K 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.8K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 16:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Apr 11 16:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 16:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 11 16:38 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 59K 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-02-CTLCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-02-CTLCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-02-CTLCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-02-CTLCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-02-CTLCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-02-CTLCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-02-CTLCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-02-CTLCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-02-CTLCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-02-CTLCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-02-CTLCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-02-CTLCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-02-CTLCardinality-2023-12
FORMULA_NAME BusinessProcesses-PT-02-CTLCardinality-2023-13
FORMULA_NAME BusinessProcesses-PT-02-CTLCardinality-2023-14
FORMULA_NAME BusinessProcesses-PT-02-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717224955791

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:55:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 06:55:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:55:57] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2024-06-01 06:55:57] [INFO ] Transformed 262 places.
[2024-06-01 06:55:57] [INFO ] Transformed 219 transitions.
[2024-06-01 06:55:57] [INFO ] Found NUPN structural information;
[2024-06-01 06:55:57] [INFO ] Parsed PT model containing 262 places and 219 transitions and 576 arcs in 202 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
Deduced a syphon composed of 17 places in 4 ms
Reduce places removed 17 places and 15 transitions.
FORMULA BusinessProcesses-PT-02-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 117 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 204/204 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 241 transition count 204
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 16 place count 229 transition count 192
Iterating global reduction 1 with 12 rules applied. Total rules applied 28 place count 229 transition count 192
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 32 place count 225 transition count 188
Iterating global reduction 1 with 4 rules applied. Total rules applied 36 place count 225 transition count 188
Applied a total of 36 rules in 46 ms. Remains 225 /245 variables (removed 20) and now considering 188/204 (removed 16) transitions.
// Phase 1: matrix 188 rows 225 cols
[2024-06-01 06:55:57] [INFO ] Computed 39 invariants in 24 ms
[2024-06-01 06:55:57] [INFO ] Implicit Places using invariants in 270 ms returned []
[2024-06-01 06:55:57] [INFO ] Invariant cache hit.
[2024-06-01 06:55:58] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 483 ms to find 0 implicit places.
Running 187 sub problems to find dead transitions.
[2024-06-01 06:55:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (OVERLAPS) 3/225 variables, 30/37 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/225 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-06-01 06:56:00] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 17 ms to minimize.
[2024-06-01 06:56:01] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 2 ms to minimize.
[2024-06-01 06:56:01] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 2 ms to minimize.
[2024-06-01 06:56:01] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 2 ms to minimize.
[2024-06-01 06:56:01] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 2 ms to minimize.
[2024-06-01 06:56:01] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 2 ms to minimize.
[2024-06-01 06:56:01] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2024-06-01 06:56:01] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 1 ms to minimize.
[2024-06-01 06:56:01] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 2 ms to minimize.
[2024-06-01 06:56:01] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 2 ms to minimize.
[2024-06-01 06:56:02] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 2 ms to minimize.
[2024-06-01 06:56:02] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 4 ms to minimize.
[2024-06-01 06:56:02] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 5 ms to minimize.
[2024-06-01 06:56:02] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 1 ms to minimize.
[2024-06-01 06:56:02] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 2 ms to minimize.
[2024-06-01 06:56:02] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 2 ms to minimize.
[2024-06-01 06:56:02] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2024-06-01 06:56:02] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 1 ms to minimize.
[2024-06-01 06:56:03] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:56:03] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-06-01 06:56:03] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 1 ms to minimize.
[2024-06-01 06:56:03] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 2 ms to minimize.
[2024-06-01 06:56:03] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-06-01 06:56:03] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:56:04] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:56:04] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 ms to minimize.
[2024-06-01 06:56:04] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 2 ms to minimize.
[2024-06-01 06:56:04] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 2 ms to minimize.
[2024-06-01 06:56:04] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 2 ms to minimize.
[2024-06-01 06:56:04] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 2 ms to minimize.
[2024-06-01 06:56:04] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 2 ms to minimize.
[2024-06-01 06:56:04] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 2 ms to minimize.
[2024-06-01 06:56:04] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 2 ms to minimize.
[2024-06-01 06:56:04] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 2 ms to minimize.
[2024-06-01 06:56:05] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 2 ms to minimize.
[2024-06-01 06:56:05] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 2 ms to minimize.
[2024-06-01 06:56:05] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 2 ms to minimize.
[2024-06-01 06:56:05] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:56:05] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:56:05] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-06-01 06:56:06] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:56:06] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2024-06-01 06:56:06] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-06-01 06:56:08] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 2 ms to minimize.
[2024-06-01 06:56:08] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 2 ms to minimize.
[2024-06-01 06:56:09] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 3/85 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-06-01 06:56:09] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 1 ms to minimize.
[2024-06-01 06:56:10] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 2 ms to minimize.
[2024-06-01 06:56:10] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 2 ms to minimize.
[2024-06-01 06:56:10] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:56:10] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/225 variables, 5/90 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/225 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 10 (OVERLAPS) 188/413 variables, 225/315 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-06-01 06:56:12] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 2 ms to minimize.
[2024-06-01 06:56:13] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:56:13] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:56:13] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2024-06-01 06:56:13] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 2 ms to minimize.
[2024-06-01 06:56:13] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 2 ms to minimize.
[2024-06-01 06:56:13] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 2 ms to minimize.
[2024-06-01 06:56:13] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2024-06-01 06:56:13] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/413 variables, 9/324 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/413 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 13 (OVERLAPS) 0/413 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Real declared 413/413 variables, and 324 constraints, problems are : Problem set: 0 solved, 187 unsolved in 20378 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 225/225 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 187 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (OVERLAPS) 3/225 variables, 30/37 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/225 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 60/99 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-06-01 06:56:20] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:56:20] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-06-01 06:56:21] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-06-01 06:56:22] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 2 ms to minimize.
[2024-06-01 06:56:22] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:56:22] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 3/105 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-06-01 06:56:23] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 6 ms to minimize.
[2024-06-01 06:56:23] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 0 ms to minimize.
[2024-06-01 06:56:23] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:56:23] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:56:23] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:56:23] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/225 variables, 6/111 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-06-01 06:56:24] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/225 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/225 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 11 (OVERLAPS) 188/413 variables, 225/337 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/413 variables, 187/524 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-06-01 06:56:26] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 5 ms to minimize.
[2024-06-01 06:56:27] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:56:27] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:56:27] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:56:29] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/413 variables, 5/529 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-06-01 06:56:32] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 2 ms to minimize.
[2024-06-01 06:56:33] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 2 ms to minimize.
[2024-06-01 06:56:33] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 1 ms to minimize.
[2024-06-01 06:56:33] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 1 ms to minimize.
[2024-06-01 06:56:34] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:56:34] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:56:34] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:56:34] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 2 ms to minimize.
[2024-06-01 06:56:34] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/413 variables, 9/538 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/413 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 16 (OVERLAPS) 0/413 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Int declared 413/413 variables, and 538 constraints, problems are : Problem set: 0 solved, 187 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 225/225 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 87/87 constraints]
After SMT, in 50504ms problems are : Problem set: 0 solved, 187 unsolved
Search for dead transitions found 0 dead transitions in 50540ms
Starting structural reductions in LTL mode, iteration 1 : 225/245 places, 188/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51088 ms. Remains : 225/245 places, 188/204 transitions.
Support contains 117 out of 225 places after structural reductions.
[2024-06-01 06:56:48] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-06-01 06:56:48] [INFO ] Flatten gal took : 77 ms
[2024-06-01 06:56:48] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BusinessProcesses-PT-02-CTLCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-CTLCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 06:56:48] [INFO ] Flatten gal took : 45 ms
[2024-06-01 06:56:49] [INFO ] Input system was already deterministic with 188 transitions.
Support contains 96 out of 225 places (down from 117) after GAL structural reductions.
RANDOM walk for 40000 steps (540 resets) in 2344 ms. (17 steps per ms) remains 12/53 properties
BEST_FIRST walk for 40004 steps (101 resets) in 250 ms. (159 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (103 resets) in 308 ms. (129 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (98 resets) in 139 ms. (285 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (92 resets) in 107 ms. (370 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (99 resets) in 242 ms. (164 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (100 resets) in 95 ms. (416 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (98 resets) in 151 ms. (263 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (102 resets) in 133 ms. (298 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (99 resets) in 108 ms. (367 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (101 resets) in 75 ms. (526 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (103 resets) in 61 ms. (645 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (101 resets) in 69 ms. (571 steps per ms) remains 12/12 properties
[2024-06-01 06:56:50] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 94/130 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 51/181 variables, 12/30 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 15/196 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 160/356 variables, 196/235 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 41/397 variables, 18/253 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/397 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 14/411 variables, 10/263 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/411 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 2/413 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/413 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (OVERLAPS) 0/413 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 413/413 variables, and 264 constraints, problems are : Problem set: 0 solved, 12 unsolved in 764 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 225/225 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 94/130 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-01 06:56:51] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 51/181 variables, 12/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-01 06:56:51] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 0 ms to minimize.
[2024-06-01 06:56:51] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:56:51] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-01 06:56:52] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:56:52] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 15/196 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 160/356 variables, 196/241 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/356 variables, 2/243 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-01 06:56:52] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:56:52] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:56:52] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:56:52] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/356 variables, 4/247 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/356 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem AtomicPropp42 is UNSAT
At refinement iteration 14 (OVERLAPS) 41/397 variables, 18/265 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/397 variables, 9/274 constraints. Problems are: Problem set: 1 solved, 11 unsolved
[2024-06-01 06:56:53] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:56:53] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-06-01 06:56:53] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-06-01 06:56:53] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:56:53] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 0 ms to minimize.
[2024-06-01 06:56:53] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:56:53] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 14 ms to minimize.
[2024-06-01 06:56:54] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 1 ms to minimize.
[2024-06-01 06:56:54] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 1 ms to minimize.
[2024-06-01 06:56:54] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/397 variables, 10/284 constraints. Problems are: Problem set: 1 solved, 11 unsolved
[2024-06-01 06:56:54] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-06-01 06:56:54] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/397 variables, 2/286 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/397 variables, 0/286 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 19 (OVERLAPS) 14/411 variables, 10/296 constraints. Problems are: Problem set: 1 solved, 11 unsolved
[2024-06-01 06:56:54] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/411 variables, 1/297 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/411 variables, 0/297 constraints. Problems are: Problem set: 1 solved, 11 unsolved
Problem AtomicPropp17 is UNSAT
At refinement iteration 22 (OVERLAPS) 2/413 variables, 1/298 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/413 variables, 0/298 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 24 (OVERLAPS) 0/413 variables, 0/298 constraints. Problems are: Problem set: 2 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 413/413 variables, and 298 constraints, problems are : Problem set: 2 solved, 10 unsolved in 3921 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 225/225 constraints, PredecessorRefiner: 11/12 constraints, Known Traps: 23/23 constraints]
After SMT, in 4695ms problems are : Problem set: 2 solved, 10 unsolved
Parikh walk visited 4 properties in 2408 ms.
Support contains 16 out of 225 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 225/225 places, 188/188 transitions.
Graph (trivial) has 112 edges and 225 vertex of which 7 / 225 are part of one of the 1 SCC in 2 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 415 edges and 219 vertex of which 213 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 37 place count 213 transition count 139
Reduce places removed 35 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 39 rules applied. Total rules applied 76 place count 178 transition count 135
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 80 place count 174 transition count 135
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 80 place count 174 transition count 104
Deduced a syphon composed of 31 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 148 place count 137 transition count 104
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 165 place count 120 transition count 87
Iterating global reduction 3 with 17 rules applied. Total rules applied 182 place count 120 transition count 87
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 266 place count 77 transition count 46
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 267 place count 77 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 268 place count 76 transition count 45
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 269 place count 75 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 270 place count 74 transition count 44
Applied a total of 270 rules in 105 ms. Remains 74 /225 variables (removed 151) and now considering 44/188 (removed 144) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 74/225 places, 44/188 transitions.
RANDOM walk for 504 steps (11 resets) in 12 ms. (38 steps per ms) remains 0/6 properties
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
[2024-06-01 06:56:57] [INFO ] Flatten gal took : 24 ms
[2024-06-01 06:56:57] [INFO ] Flatten gal took : 25 ms
[2024-06-01 06:56:58] [INFO ] Input system was already deterministic with 188 transitions.
Computed a total of 217 stabilizing places and 178 stable transitions
Graph (complete) has 423 edges and 225 vertex of which 217 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.5 ms
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 188/188 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 224 transition count 188
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 25 place count 200 transition count 164
Iterating global reduction 1 with 24 rules applied. Total rules applied 49 place count 200 transition count 164
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 60 place count 189 transition count 153
Iterating global reduction 1 with 11 rules applied. Total rules applied 71 place count 189 transition count 153
Applied a total of 71 rules in 27 ms. Remains 189 /225 variables (removed 36) and now considering 153/188 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 189/225 places, 153/188 transitions.
[2024-06-01 06:56:58] [INFO ] Flatten gal took : 21 ms
[2024-06-01 06:56:58] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:56:58] [INFO ] Input system was already deterministic with 153 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 225/225 places, 188/188 transitions.
Graph (trivial) has 121 edges and 225 vertex of which 7 / 225 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 416 edges and 219 vertex of which 211 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 41 place count 210 transition count 135
Reduce places removed 39 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 40 rules applied. Total rules applied 81 place count 171 transition count 134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 82 place count 170 transition count 134
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 82 place count 170 transition count 97
Deduced a syphon composed of 37 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 164 place count 125 transition count 97
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 183 place count 106 transition count 78
Iterating global reduction 3 with 19 rules applied. Total rules applied 202 place count 106 transition count 78
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 282 place count 66 transition count 38
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 283 place count 65 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 284 place count 64 transition count 37
Applied a total of 284 rules in 22 ms. Remains 64 /225 variables (removed 161) and now considering 37/188 (removed 151) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 64/225 places, 37/188 transitions.
[2024-06-01 06:56:58] [INFO ] Flatten gal took : 3 ms
[2024-06-01 06:56:58] [INFO ] Flatten gal took : 3 ms
[2024-06-01 06:56:58] [INFO ] Input system was already deterministic with 37 transitions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 188/188 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 223 transition count 188
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 24 place count 201 transition count 166
Iterating global reduction 1 with 22 rules applied. Total rules applied 46 place count 201 transition count 166
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 54 place count 193 transition count 158
Iterating global reduction 1 with 8 rules applied. Total rules applied 62 place count 193 transition count 158
Applied a total of 62 rules in 11 ms. Remains 193 /225 variables (removed 32) and now considering 158/188 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 193/225 places, 158/188 transitions.
[2024-06-01 06:56:58] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:56:58] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:56:58] [INFO ] Input system was already deterministic with 158 transitions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 188/188 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 224 transition count 188
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 24 place count 201 transition count 165
Iterating global reduction 1 with 23 rules applied. Total rules applied 47 place count 201 transition count 165
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 57 place count 191 transition count 155
Iterating global reduction 1 with 10 rules applied. Total rules applied 67 place count 191 transition count 155
Applied a total of 67 rules in 32 ms. Remains 191 /225 variables (removed 34) and now considering 155/188 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 191/225 places, 155/188 transitions.
[2024-06-01 06:56:58] [INFO ] Flatten gal took : 7 ms
[2024-06-01 06:56:58] [INFO ] Flatten gal took : 7 ms
[2024-06-01 06:56:58] [INFO ] Input system was already deterministic with 155 transitions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 188/188 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 224 transition count 188
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 17 place count 208 transition count 172
Iterating global reduction 1 with 16 rules applied. Total rules applied 33 place count 208 transition count 172
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 42 place count 199 transition count 163
Iterating global reduction 1 with 9 rules applied. Total rules applied 51 place count 199 transition count 163
Applied a total of 51 rules in 10 ms. Remains 199 /225 variables (removed 26) and now considering 163/188 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 199/225 places, 163/188 transitions.
[2024-06-01 06:56:58] [INFO ] Flatten gal took : 7 ms
[2024-06-01 06:56:58] [INFO ] Flatten gal took : 7 ms
[2024-06-01 06:56:58] [INFO ] Input system was already deterministic with 163 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 225/225 places, 188/188 transitions.
Graph (trivial) has 118 edges and 225 vertex of which 7 / 225 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 416 edges and 219 vertex of which 212 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 42 place count 211 transition count 135
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 82 place count 171 transition count 135
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 82 place count 171 transition count 102
Deduced a syphon composed of 33 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 154 place count 132 transition count 102
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 174 place count 112 transition count 82
Iterating global reduction 2 with 20 rules applied. Total rules applied 194 place count 112 transition count 82
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 280 place count 68 transition count 40
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 281 place count 67 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 282 place count 66 transition count 39
Applied a total of 282 rules in 18 ms. Remains 66 /225 variables (removed 159) and now considering 39/188 (removed 149) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 66/225 places, 39/188 transitions.
[2024-06-01 06:56:58] [INFO ] Flatten gal took : 2 ms
[2024-06-01 06:56:58] [INFO ] Flatten gal took : 2 ms
[2024-06-01 06:56:58] [INFO ] Input system was already deterministic with 39 transitions.
RANDOM walk for 40000 steps (12379 resets) in 324 ms. (123 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (4468 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 152 steps, run visited all 1 properties in 8 ms. (steps per millisecond=19 )
Probabilistic random walk after 152 steps, saw 90 distinct states, run finished after 11 ms. (steps per millisecond=13 ) properties seen :1
FORMULA BusinessProcesses-PT-02-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 225/225 places, 188/188 transitions.
Graph (trivial) has 115 edges and 225 vertex of which 7 / 225 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 416 edges and 219 vertex of which 211 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 38 place count 210 transition count 138
Reduce places removed 36 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 37 rules applied. Total rules applied 75 place count 174 transition count 137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 76 place count 173 transition count 137
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 76 place count 173 transition count 100
Deduced a syphon composed of 37 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 156 place count 130 transition count 100
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 175 place count 111 transition count 81
Iterating global reduction 3 with 19 rules applied. Total rules applied 194 place count 111 transition count 81
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 268 place count 73 transition count 45
Applied a total of 268 rules in 29 ms. Remains 73 /225 variables (removed 152) and now considering 45/188 (removed 143) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 42 ms. Remains : 73/225 places, 45/188 transitions.
[2024-06-01 06:56:58] [INFO ] Flatten gal took : 3 ms
[2024-06-01 06:56:58] [INFO ] Flatten gal took : 3 ms
[2024-06-01 06:56:58] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 225/225 places, 188/188 transitions.
Graph (complete) has 423 edges and 225 vertex of which 217 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 216 transition count 149
Reduce places removed 32 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 34 rules applied. Total rules applied 67 place count 184 transition count 147
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 69 place count 182 transition count 147
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 69 place count 182 transition count 106
Deduced a syphon composed of 41 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 159 place count 133 transition count 106
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 176 place count 116 transition count 89
Iterating global reduction 3 with 17 rules applied. Total rules applied 193 place count 116 transition count 89
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 283 place count 70 transition count 45
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 284 place count 69 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 285 place count 68 transition count 44
Applied a total of 285 rules in 43 ms. Remains 68 /225 variables (removed 157) and now considering 44/188 (removed 144) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43 ms. Remains : 68/225 places, 44/188 transitions.
[2024-06-01 06:56:58] [INFO ] Flatten gal took : 3 ms
[2024-06-01 06:56:58] [INFO ] Flatten gal took : 3 ms
[2024-06-01 06:56:58] [INFO ] Input system was already deterministic with 44 transitions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 188/188 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 223 transition count 188
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 24 place count 201 transition count 166
Iterating global reduction 1 with 22 rules applied. Total rules applied 46 place count 201 transition count 166
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 55 place count 192 transition count 157
Iterating global reduction 1 with 9 rules applied. Total rules applied 64 place count 192 transition count 157
Applied a total of 64 rules in 10 ms. Remains 192 /225 variables (removed 33) and now considering 157/188 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 192/225 places, 157/188 transitions.
[2024-06-01 06:56:58] [INFO ] Flatten gal took : 6 ms
[2024-06-01 06:56:58] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:56:58] [INFO ] Input system was already deterministic with 157 transitions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 188/188 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 223 transition count 188
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 26 place count 199 transition count 164
Iterating global reduction 1 with 24 rules applied. Total rules applied 50 place count 199 transition count 164
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 61 place count 188 transition count 153
Iterating global reduction 1 with 11 rules applied. Total rules applied 72 place count 188 transition count 153
Applied a total of 72 rules in 10 ms. Remains 188 /225 variables (removed 37) and now considering 153/188 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 188/225 places, 153/188 transitions.
[2024-06-01 06:56:58] [INFO ] Flatten gal took : 6 ms
[2024-06-01 06:56:58] [INFO ] Flatten gal took : 6 ms
[2024-06-01 06:56:58] [INFO ] Input system was already deterministic with 153 transitions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 188/188 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 223 transition count 188
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 23 place count 202 transition count 167
Iterating global reduction 1 with 21 rules applied. Total rules applied 44 place count 202 transition count 167
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 52 place count 194 transition count 159
Iterating global reduction 1 with 8 rules applied. Total rules applied 60 place count 194 transition count 159
Applied a total of 60 rules in 11 ms. Remains 194 /225 variables (removed 31) and now considering 159/188 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 194/225 places, 159/188 transitions.
[2024-06-01 06:56:58] [INFO ] Flatten gal took : 7 ms
[2024-06-01 06:56:58] [INFO ] Flatten gal took : 6 ms
[2024-06-01 06:56:58] [INFO ] Input system was already deterministic with 159 transitions.
[2024-06-01 06:56:58] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:56:58] [INFO ] Flatten gal took : 15 ms
[2024-06-01 06:56:58] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2024-06-01 06:56:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 225 places, 188 transitions and 510 arcs took 2 ms.
Total runtime 61701 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-02-CTLCardinality-2024-00
Could not compute solution for formula : BusinessProcesses-PT-02-CTLCardinality-2024-01
Could not compute solution for formula : BusinessProcesses-PT-02-CTLCardinality-2024-02
Could not compute solution for formula : BusinessProcesses-PT-02-CTLCardinality-2024-03
Could not compute solution for formula : BusinessProcesses-PT-02-CTLCardinality-2024-04
Could not compute solution for formula : BusinessProcesses-PT-02-CTLCardinality-2024-09
Could not compute solution for formula : BusinessProcesses-PT-02-CTLCardinality-2024-10
Could not compute solution for formula : BusinessProcesses-PT-02-CTLCardinality-2024-11
Could not compute solution for formula : BusinessProcesses-PT-02-CTLCardinality-2023-12
Could not compute solution for formula : BusinessProcesses-PT-02-CTLCardinality-2023-13

BK_STOP 1717225019193

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name BusinessProcesses-PT-02-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/878/ctl_0_
ctl formula name BusinessProcesses-PT-02-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/878/ctl_1_
ctl formula name BusinessProcesses-PT-02-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/878/ctl_2_
ctl formula name BusinessProcesses-PT-02-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/878/ctl_3_
ctl formula name BusinessProcesses-PT-02-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/878/ctl_4_
ctl formula name BusinessProcesses-PT-02-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/878/ctl_5_
ctl formula name BusinessProcesses-PT-02-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/878/ctl_6_
ctl formula name BusinessProcesses-PT-02-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/878/ctl_7_
ctl formula name BusinessProcesses-PT-02-CTLCardinality-2023-12
ctl formula formula --ctl=/tmp/878/ctl_8_
ctl formula name BusinessProcesses-PT-02-CTLCardinality-2023-13
ctl formula formula --ctl=/tmp/878/ctl_9_
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-02"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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