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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K 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 May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15: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 9.6K Apr 11 16:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 11 16:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 11 16:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 16:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 156K 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-14-CTLCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-14-CTLCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-14-CTLCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-14-CTLCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-14-CTLCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-14-CTLCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-14-CTLCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-14-CTLCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-14-CTLCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-14-CTLCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-14-CTLCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-14-CTLCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-14-CTLCardinality-2023-12
FORMULA_NAME BusinessProcesses-PT-14-CTLCardinality-2023-13
FORMULA_NAME BusinessProcesses-PT-14-CTLCardinality-2023-14
FORMULA_NAME BusinessProcesses-PT-14-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717225819224

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-14
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:10:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 07:10:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:10:20] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2024-06-01 07:10:20] [INFO ] Transformed 624 places.
[2024-06-01 07:10:20] [INFO ] Transformed 564 transitions.
[2024-06-01 07:10:20] [INFO ] Found NUPN structural information;
[2024-06-01 07:10:20] [INFO ] Parsed PT model containing 624 places and 564 transitions and 1657 arcs in 213 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 24 ms.
Deduced a syphon composed of 8 places in 10 ms
Reduce places removed 8 places and 8 transitions.
Support contains 106 out of 616 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 616/616 places, 556/556 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 613 transition count 556
Discarding 75 places :
Symmetric choice reduction at 1 with 75 rule applications. Total rules 78 place count 538 transition count 481
Iterating global reduction 1 with 75 rules applied. Total rules applied 153 place count 538 transition count 481
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 184 place count 507 transition count 450
Iterating global reduction 1 with 31 rules applied. Total rules applied 215 place count 507 transition count 450
Applied a total of 215 rules in 123 ms. Remains 507 /616 variables (removed 109) and now considering 450/556 (removed 106) transitions.
// Phase 1: matrix 450 rows 507 cols
[2024-06-01 07:10:21] [INFO ] Computed 96 invariants in 33 ms
[2024-06-01 07:10:21] [INFO ] Implicit Places using invariants in 378 ms returned []
[2024-06-01 07:10:21] [INFO ] Invariant cache hit.
[2024-06-01 07:10:22] [INFO ] Implicit Places using invariants and state equation in 588 ms returned []
Implicit Place search using SMT with State Equation took 1014 ms to find 0 implicit places.
Running 449 sub problems to find dead transitions.
[2024-06-01 07:10:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/504 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/504 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 2 (OVERLAPS) 3/507 variables, 59/93 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/507 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-01 07:10:33] [INFO ] Deduced a trap composed of 114 places in 166 ms of which 22 ms to minimize.
[2024-06-01 07:10:33] [INFO ] Deduced a trap composed of 102 places in 154 ms of which 4 ms to minimize.
[2024-06-01 07:10:33] [INFO ] Deduced a trap composed of 106 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:10:33] [INFO ] Deduced a trap composed of 98 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:10:33] [INFO ] Deduced a trap composed of 116 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:10:33] [INFO ] Deduced a trap composed of 115 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:10:34] [INFO ] Deduced a trap composed of 111 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:10:34] [INFO ] Deduced a trap composed of 114 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:10:34] [INFO ] Deduced a trap composed of 95 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:10:34] [INFO ] Deduced a trap composed of 88 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:10:34] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 3 ms to minimize.
[2024-06-01 07:10:34] [INFO ] Deduced a trap composed of 111 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:10:34] [INFO ] Deduced a trap composed of 104 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:10:34] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 3 ms to minimize.
[2024-06-01 07:10:35] [INFO ] Deduced a trap composed of 117 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:10:35] [INFO ] Deduced a trap composed of 103 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:10:35] [INFO ] Deduced a trap composed of 104 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:10:35] [INFO ] Deduced a trap composed of 114 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:10:35] [INFO ] Deduced a trap composed of 91 places in 249 ms of which 7 ms to minimize.
[2024-06-01 07:10:35] [INFO ] Deduced a trap composed of 96 places in 130 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/507 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-01 07:10:36] [INFO ] Deduced a trap composed of 102 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:10:36] [INFO ] Deduced a trap composed of 106 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:10:36] [INFO ] Deduced a trap composed of 119 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:10:36] [INFO ] Deduced a trap composed of 103 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:10:36] [INFO ] Deduced a trap composed of 103 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:10:36] [INFO ] Deduced a trap composed of 110 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:10:37] [INFO ] Deduced a trap composed of 118 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:10:37] [INFO ] Deduced a trap composed of 106 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:10:37] [INFO ] Deduced a trap composed of 115 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:10:37] [INFO ] Deduced a trap composed of 94 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:10:37] [INFO ] Deduced a trap composed of 109 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:10:37] [INFO ] Deduced a trap composed of 105 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:10:37] [INFO ] Deduced a trap composed of 113 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:10:37] [INFO ] Deduced a trap composed of 113 places in 107 ms of which 7 ms to minimize.
[2024-06-01 07:10:38] [INFO ] Deduced a trap composed of 117 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:10:38] [INFO ] Deduced a trap composed of 116 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:10:38] [INFO ] Deduced a trap composed of 100 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:10:38] [INFO ] Deduced a trap composed of 112 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:10:38] [INFO ] Deduced a trap composed of 99 places in 130 ms of which 5 ms to minimize.
[2024-06-01 07:10:38] [INFO ] Deduced a trap composed of 107 places in 145 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/507 variables, 20/136 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-01 07:10:39] [INFO ] Deduced a trap composed of 96 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:10:39] [INFO ] Deduced a trap composed of 113 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:10:39] [INFO ] Deduced a trap composed of 110 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:10:39] [INFO ] Deduced a trap composed of 105 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:10:39] [INFO ] Deduced a trap composed of 103 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:10:39] [INFO ] Deduced a trap composed of 108 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:10:39] [INFO ] Deduced a trap composed of 114 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:10:40] [INFO ] Deduced a trap composed of 103 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:10:40] [INFO ] Deduced a trap composed of 107 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:10:40] [INFO ] Deduced a trap composed of 100 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:10:40] [INFO ] Deduced a trap composed of 106 places in 153 ms of which 4 ms to minimize.
[2024-06-01 07:10:40] [INFO ] Deduced a trap composed of 117 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:10:40] [INFO ] Deduced a trap composed of 105 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:10:41] [INFO ] Deduced a trap composed of 103 places in 150 ms of which 2 ms to minimize.
[2024-06-01 07:10:41] [INFO ] Deduced a trap composed of 113 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:10:41] [INFO ] Deduced a trap composed of 102 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:10:41] [INFO ] Deduced a trap composed of 116 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:10:41] [INFO ] Deduced a trap composed of 106 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:10:41] [INFO ] Deduced a trap composed of 91 places in 164 ms of which 3 ms to minimize.
[2024-06-01 07:10:41] [INFO ] Deduced a trap composed of 104 places in 154 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/507 variables, 20/156 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-01 07:10:45] [INFO ] Deduced a trap composed of 105 places in 212 ms of which 3 ms to minimize.
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 104 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 103 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 108 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 104 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 113 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 106 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 101 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 102 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:10:47] [INFO ] Deduced a trap composed of 115 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:10:47] [INFO ] Deduced a trap composed of 105 places in 103 ms of which 3 ms to minimize.
[2024-06-01 07:10:47] [INFO ] Deduced a trap composed of 109 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:10:47] [INFO ] Deduced a trap composed of 102 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:10:47] [INFO ] Deduced a trap composed of 104 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:10:47] [INFO ] Deduced a trap composed of 112 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:10:47] [INFO ] Deduced a trap composed of 115 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:10:47] [INFO ] Deduced a trap composed of 111 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:10:48] [INFO ] Deduced a trap composed of 115 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:10:51] [INFO ] Deduced a trap composed of 111 places in 3397 ms of which 4 ms to minimize.
[2024-06-01 07:10:51] [INFO ] Deduced a trap composed of 105 places in 155 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/507 variables, 20/176 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-01 07:10:52] [INFO ] Deduced a trap composed of 96 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:10:52] [INFO ] Deduced a trap composed of 105 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:10:52] [INFO ] Deduced a trap composed of 123 places in 160 ms of which 2 ms to minimize.
SMT process timed out in 30358ms, After SMT, problems are : Problem set: 0 solved, 449 unsolved
Search for dead transitions found 0 dead transitions in 30394ms
Starting structural reductions in LTL mode, iteration 1 : 507/616 places, 450/556 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31562 ms. Remains : 507/616 places, 450/556 transitions.
Support contains 106 out of 507 places after structural reductions.
[2024-06-01 07:10:52] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-06-01 07:10:52] [INFO ] Flatten gal took : 135 ms
[2024-06-01 07:10:52] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA BusinessProcesses-PT-14-CTLCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 07:10:52] [INFO ] Flatten gal took : 66 ms
[2024-06-01 07:10:53] [INFO ] Input system was already deterministic with 450 transitions.
Support contains 91 out of 507 places (down from 106) after GAL structural reductions.
RANDOM walk for 40000 steps (272 resets) in 2884 ms. (13 steps per ms) remains 34/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (8 resets) in 20 ms. (190 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
[2024-06-01 07:10:54] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 309/375 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/375 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (OVERLAPS) 36/411 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/411 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (OVERLAPS) 90/501 variables, 37/96 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (OVERLAPS) 446/947 variables, 501/597 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/947 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (OVERLAPS) 9/956 variables, 5/602 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/956 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 11 (OVERLAPS) 1/957 variables, 1/603 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/957 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 13 (OVERLAPS) 0/957 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 957/957 variables, and 603 constraints, problems are : Problem set: 0 solved, 34 unsolved in 3357 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 507/507 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
Problem AtomicPropp10 is UNSAT
At refinement iteration 1 (OVERLAPS) 309/375 variables, 50/50 constraints. Problems are: Problem set: 1 solved, 33 unsolved
[2024-06-01 07:10:58] [INFO ] Deduced a trap composed of 95 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:10:58] [INFO ] Deduced a trap composed of 94 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:10:58] [INFO ] Deduced a trap composed of 91 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:10:58] [INFO ] Deduced a trap composed of 98 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:10:58] [INFO ] Deduced a trap composed of 94 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:10:58] [INFO ] Deduced a trap composed of 94 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:10:58] [INFO ] Deduced a trap composed of 98 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:10:58] [INFO ] Deduced a trap composed of 99 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:10:58] [INFO ] Deduced a trap composed of 103 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:10:59] [INFO ] Deduced a trap composed of 97 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:10:59] [INFO ] Deduced a trap composed of 109 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:10:59] [INFO ] Deduced a trap composed of 106 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:10:59] [INFO ] Deduced a trap composed of 100 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:10:59] [INFO ] Deduced a trap composed of 91 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:10:59] [INFO ] Deduced a trap composed of 113 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:10:59] [INFO ] Deduced a trap composed of 99 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:10:59] [INFO ] Deduced a trap composed of 90 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:10:59] [INFO ] Deduced a trap composed of 93 places in 90 ms of which 3 ms to minimize.
[2024-06-01 07:11:00] [INFO ] Deduced a trap composed of 98 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:11:00] [INFO ] Deduced a trap composed of 114 places in 100 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/375 variables, 20/70 constraints. Problems are: Problem set: 1 solved, 33 unsolved
[2024-06-01 07:11:00] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:11:00] [INFO ] Deduced a trap composed of 99 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:11:00] [INFO ] Deduced a trap composed of 92 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:11:00] [INFO ] Deduced a trap composed of 94 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:11:00] [INFO ] Deduced a trap composed of 95 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:11:00] [INFO ] Deduced a trap composed of 97 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:11:00] [INFO ] Deduced a trap composed of 93 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:11:01] [INFO ] Deduced a trap composed of 94 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:11:01] [INFO ] Deduced a trap composed of 98 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:11:01] [INFO ] Deduced a trap composed of 93 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:11:01] [INFO ] Deduced a trap composed of 95 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:11:01] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:11:01] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:11:01] [INFO ] Deduced a trap composed of 108 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:11:01] [INFO ] Deduced a trap composed of 92 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:11:01] [INFO ] Deduced a trap composed of 95 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:11:01] [INFO ] Deduced a trap composed of 96 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:11:02] [INFO ] Deduced a trap composed of 92 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:11:02] [INFO ] Deduced a trap composed of 98 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:11:02] [INFO ] Deduced a trap composed of 99 places in 78 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 20/90 constraints. Problems are: Problem set: 1 solved, 33 unsolved
[2024-06-01 07:11:02] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 3 ms to minimize.
[2024-06-01 07:11:02] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:11:02] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:11:02] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:11:02] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:11:02] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:11:02] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:11:02] [INFO ] Deduced a trap composed of 101 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:11:02] [INFO ] Deduced a trap composed of 96 places in 103 ms of which 2 ms to minimize.
SMT process timed out in 8490ms, After SMT, problems are : Problem set: 1 solved, 33 unsolved
Fused 33 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 62 out of 507 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 507/507 places, 450/450 transitions.
Graph (trivial) has 194 edges and 507 vertex of which 6 / 507 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1128 edges and 502 vertex of which 500 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output 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 500 transition count 402
Reduce places removed 40 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 46 rules applied. Total rules applied 88 place count 460 transition count 396
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 94 place count 454 transition count 396
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 83 Pre rules applied. Total rules applied 94 place count 454 transition count 313
Deduced a syphon composed of 83 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 270 place count 361 transition count 313
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 275 place count 356 transition count 308
Iterating global reduction 3 with 5 rules applied. Total rules applied 280 place count 356 transition count 308
Performed 109 Post agglomeration using F-continuation condition.Transition count delta: 109
Deduced a syphon composed of 109 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 3 with 220 rules applied. Total rules applied 500 place count 245 transition count 199
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 502 place count 244 transition count 203
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 504 place count 244 transition count 201
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 506 place count 242 transition count 201
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 507 place count 242 transition count 201
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 508 place count 241 transition count 200
Applied a total of 508 rules in 136 ms. Remains 241 /507 variables (removed 266) and now considering 200/450 (removed 250) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 241/507 places, 200/450 transitions.
RANDOM walk for 40000 steps (703 resets) in 699 ms. (57 steps per ms) remains 4/33 properties
BEST_FIRST walk for 40003 steps (163 resets) in 193 ms. (206 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (209 resets) in 146 ms. (272 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (240 resets) in 172 ms. (231 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (165 resets) in 120 ms. (330 steps per ms) remains 2/3 properties
// Phase 1: matrix 200 rows 241 cols
[2024-06-01 07:11:03] [INFO ] Computed 83 invariants in 7 ms
[2024-06-01 07:11:03] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 82/89 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 82/171 variables, 37/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 44/215 variables, 27/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 3/218 variables, 3/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 196/414 variables, 218/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/414 variables, 3/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/414 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 25/439 variables, 21/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/439 variables, 8/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/439 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1/440 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/440 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/440 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1/441 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/441 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/441 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 441/441 variables, and 327 constraints, problems are : Problem set: 0 solved, 2 unsolved in 205 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 241/241 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 82/89 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 82/171 variables, 37/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:11:03] [INFO ] Deduced a trap composed of 60 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 44/215 variables, 27/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 3/218 variables, 3/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/218 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 196/414 variables, 218/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/414 variables, 3/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:11:04] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/414 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/414 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 25/439 variables, 21/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/439 variables, 8/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/439 variables, 2/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:11:04] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:11:04] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:11:04] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 4 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/439 variables, 3/331 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/439 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/440 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/440 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/440 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 1/441 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:11:04] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/441 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/441 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/441 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 441/441 variables, and 335 constraints, problems are : Problem set: 0 solved, 2 unsolved in 613 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 241/241 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 833ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 85 ms.
Support contains 5 out of 241 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 241/241 places, 200/200 transitions.
Graph (complete) has 799 edges and 241 vertex of which 240 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 240 transition count 188
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 228 transition count 188
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 25 place count 228 transition count 173
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 61 place count 207 transition count 173
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 71 place count 197 transition count 161
Iterating global reduction 2 with 10 rules applied. Total rules applied 81 place count 197 transition count 161
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 133 place count 170 transition count 136
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 2 with 2 rules applied. Total rules applied 135 place count 169 transition count 137
Applied a total of 135 rules in 28 ms. Remains 169 /241 variables (removed 72) and now considering 137/200 (removed 63) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 169/241 places, 137/200 transitions.
RANDOM walk for 40000 steps (1545 resets) in 281 ms. (141 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (690 resets) in 133 ms. (298 steps per ms) remains 1/1 properties
Probably explored full state space saw : 16088 states, properties seen :0
Probabilistic random walk after 66565 steps, saw 16088 distinct states, run finished after 201 ms. (steps per millisecond=331 ) properties seen :0
Explored full state space saw : 16088 states, properties seen :0
Exhaustive walk after 66565 steps, saw 16088 distinct states, run finished after 143 ms. (steps per millisecond=465 ) properties seen :0
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
[2024-06-01 07:11:05] [INFO ] Flatten gal took : 21 ms
[2024-06-01 07:11:05] [INFO ] Flatten gal took : 23 ms
[2024-06-01 07:11:05] [INFO ] Input system was already deterministic with 450 transitions.
Computed a total of 134 stabilizing places and 125 stable transitions
Graph (complete) has 1135 edges and 507 vertex of which 504 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.14 ms
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 450/450 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 506 transition count 450
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 19 place count 488 transition count 432
Iterating global reduction 1 with 18 rules applied. Total rules applied 37 place count 488 transition count 432
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 44 place count 481 transition count 425
Iterating global reduction 1 with 7 rules applied. Total rules applied 51 place count 481 transition count 425
Applied a total of 51 rules in 49 ms. Remains 481 /507 variables (removed 26) and now considering 425/450 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49 ms. Remains : 481/507 places, 425/450 transitions.
[2024-06-01 07:11:05] [INFO ] Flatten gal took : 19 ms
[2024-06-01 07:11:05] [INFO ] Flatten gal took : 19 ms
[2024-06-01 07:11:05] [INFO ] Input system was already deterministic with 425 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 507/507 places, 450/450 transitions.
Graph (trivial) has 249 edges and 507 vertex of which 6 / 507 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1129 edges and 502 vertex of which 499 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 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 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 66 place count 498 transition count 378
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 130 place count 434 transition count 378
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 98 Pre rules applied. Total rules applied 130 place count 434 transition count 280
Deduced a syphon composed of 98 places in 2 ms
Ensure Unique test removed 15 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 211 rules applied. Total rules applied 341 place count 321 transition count 280
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 365 place count 297 transition count 256
Iterating global reduction 2 with 24 rules applied. Total rules applied 389 place count 297 transition count 256
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 389 place count 297 transition count 253
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 396 place count 293 transition count 253
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 118
Deduced a syphon composed of 118 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 2 with 240 rules applied. Total rules applied 636 place count 171 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 637 place count 170 transition count 134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 638 place count 169 transition count 134
Applied a total of 638 rules in 61 ms. Remains 169 /507 variables (removed 338) and now considering 134/450 (removed 316) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 62 ms. Remains : 169/507 places, 134/450 transitions.
[2024-06-01 07:11:05] [INFO ] Flatten gal took : 8 ms
[2024-06-01 07:11:05] [INFO ] Flatten gal took : 9 ms
[2024-06-01 07:11:05] [INFO ] Input system was already deterministic with 134 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 507/507 places, 450/450 transitions.
Graph (trivial) has 251 edges and 507 vertex of which 6 / 507 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1129 edges and 502 vertex of which 499 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 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 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 66 place count 498 transition count 378
Reduce places removed 64 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 65 rules applied. Total rules applied 131 place count 434 transition count 377
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 132 place count 433 transition count 377
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 98 Pre rules applied. Total rules applied 132 place count 433 transition count 279
Deduced a syphon composed of 98 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 3 with 213 rules applied. Total rules applied 345 place count 318 transition count 279
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 368 place count 295 transition count 256
Iterating global reduction 3 with 23 rules applied. Total rules applied 391 place count 295 transition count 256
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 391 place count 295 transition count 253
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 398 place count 291 transition count 253
Performed 121 Post agglomeration using F-continuation condition.Transition count delta: 121
Deduced a syphon composed of 121 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 3 with 245 rules applied. Total rules applied 643 place count 167 transition count 132
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 644 place count 166 transition count 131
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 645 place count 165 transition count 131
Applied a total of 645 rules in 58 ms. Remains 165 /507 variables (removed 342) and now considering 131/450 (removed 319) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 59 ms. Remains : 165/507 places, 131/450 transitions.
[2024-06-01 07:11:05] [INFO ] Flatten gal took : 8 ms
[2024-06-01 07:11:05] [INFO ] Flatten gal took : 8 ms
[2024-06-01 07:11:05] [INFO ] Input system was already deterministic with 131 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 507/507 places, 450/450 transitions.
Graph (trivial) has 251 edges and 507 vertex of which 6 / 507 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1129 edges and 502 vertex of which 499 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 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 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 66 place count 498 transition count 378
Reduce places removed 64 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 65 rules applied. Total rules applied 131 place count 434 transition count 377
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 132 place count 433 transition count 377
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 98 Pre rules applied. Total rules applied 132 place count 433 transition count 279
Deduced a syphon composed of 98 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 3 with 212 rules applied. Total rules applied 344 place count 319 transition count 279
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 368 place count 295 transition count 255
Iterating global reduction 3 with 24 rules applied. Total rules applied 392 place count 295 transition count 255
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 392 place count 295 transition count 252
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 399 place count 291 transition count 252
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 118
Deduced a syphon composed of 118 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 3 with 240 rules applied. Total rules applied 639 place count 169 transition count 134
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 640 place count 168 transition count 133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 641 place count 167 transition count 133
Applied a total of 641 rules in 60 ms. Remains 167 /507 variables (removed 340) and now considering 133/450 (removed 317) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60 ms. Remains : 167/507 places, 133/450 transitions.
[2024-06-01 07:11:05] [INFO ] Flatten gal took : 7 ms
[2024-06-01 07:11:05] [INFO ] Flatten gal took : 8 ms
[2024-06-01 07:11:05] [INFO ] Input system was already deterministic with 133 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 507/507 places, 450/450 transitions.
Graph (trivial) has 248 edges and 507 vertex of which 6 / 507 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1129 edges and 502 vertex of which 499 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 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 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 66 place count 498 transition count 378
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 130 place count 434 transition count 378
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 130 place count 434 transition count 281
Deduced a syphon composed of 97 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 210 rules applied. Total rules applied 340 place count 321 transition count 281
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 364 place count 297 transition count 257
Iterating global reduction 2 with 24 rules applied. Total rules applied 388 place count 297 transition count 257
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 388 place count 297 transition count 254
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 395 place count 293 transition count 254
Performed 119 Post agglomeration using F-continuation condition.Transition count delta: 119
Deduced a syphon composed of 119 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 2 with 242 rules applied. Total rules applied 637 place count 170 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 638 place count 169 transition count 134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 639 place count 168 transition count 134
Applied a total of 639 rules in 50 ms. Remains 168 /507 variables (removed 339) and now considering 134/450 (removed 316) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 50 ms. Remains : 168/507 places, 134/450 transitions.
[2024-06-01 07:11:05] [INFO ] Flatten gal took : 8 ms
[2024-06-01 07:11:05] [INFO ] Flatten gal took : 8 ms
[2024-06-01 07:11:05] [INFO ] Input system was already deterministic with 134 transitions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 450/450 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 506 transition count 450
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 26 place count 481 transition count 425
Iterating global reduction 1 with 25 rules applied. Total rules applied 51 place count 481 transition count 425
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 61 place count 471 transition count 415
Iterating global reduction 1 with 10 rules applied. Total rules applied 71 place count 471 transition count 415
Applied a total of 71 rules in 50 ms. Remains 471 /507 variables (removed 36) and now considering 415/450 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50 ms. Remains : 471/507 places, 415/450 transitions.
[2024-06-01 07:11:05] [INFO ] Flatten gal took : 16 ms
[2024-06-01 07:11:05] [INFO ] Flatten gal took : 16 ms
[2024-06-01 07:11:05] [INFO ] Input system was already deterministic with 415 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 507/507 places, 450/450 transitions.
Graph (trivial) has 247 edges and 507 vertex of which 6 / 507 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1129 edges and 502 vertex of which 499 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 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 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 63 place count 498 transition count 381
Reduce places removed 61 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 64 rules applied. Total rules applied 127 place count 437 transition count 378
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 130 place count 434 transition count 378
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 98 Pre rules applied. Total rules applied 130 place count 434 transition count 280
Deduced a syphon composed of 98 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 3 with 212 rules applied. Total rules applied 342 place count 320 transition count 280
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 364 place count 298 transition count 258
Iterating global reduction 3 with 22 rules applied. Total rules applied 386 place count 298 transition count 258
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 386 place count 298 transition count 255
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 393 place count 294 transition count 255
Performed 115 Post agglomeration using F-continuation condition.Transition count delta: 115
Deduced a syphon composed of 115 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 3 with 234 rules applied. Total rules applied 627 place count 175 transition count 140
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 628 place count 174 transition count 139
Applied a total of 628 rules in 44 ms. Remains 174 /507 variables (removed 333) and now considering 139/450 (removed 311) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 45 ms. Remains : 174/507 places, 139/450 transitions.
[2024-06-01 07:11:05] [INFO ] Flatten gal took : 7 ms
[2024-06-01 07:11:05] [INFO ] Flatten gal took : 7 ms
[2024-06-01 07:11:05] [INFO ] Input system was already deterministic with 139 transitions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 450/450 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 505 transition count 450
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 26 place count 481 transition count 426
Iterating global reduction 1 with 24 rules applied. Total rules applied 50 place count 481 transition count 426
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 59 place count 472 transition count 417
Iterating global reduction 1 with 9 rules applied. Total rules applied 68 place count 472 transition count 417
Applied a total of 68 rules in 25 ms. Remains 472 /507 variables (removed 35) and now considering 417/450 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 472/507 places, 417/450 transitions.
[2024-06-01 07:11:05] [INFO ] Flatten gal took : 15 ms
[2024-06-01 07:11:05] [INFO ] Flatten gal took : 16 ms
[2024-06-01 07:11:05] [INFO ] Input system was already deterministic with 417 transitions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 450/450 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 505 transition count 450
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 27 place count 480 transition count 425
Iterating global reduction 1 with 25 rules applied. Total rules applied 52 place count 480 transition count 425
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 64 place count 468 transition count 413
Iterating global reduction 1 with 12 rules applied. Total rules applied 76 place count 468 transition count 413
Applied a total of 76 rules in 29 ms. Remains 468 /507 variables (removed 39) and now considering 413/450 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 468/507 places, 413/450 transitions.
[2024-06-01 07:11:05] [INFO ] Flatten gal took : 14 ms
[2024-06-01 07:11:06] [INFO ] Flatten gal took : 14 ms
[2024-06-01 07:11:06] [INFO ] Input system was already deterministic with 413 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 507/507 places, 450/450 transitions.
Graph (trivial) has 249 edges and 507 vertex of which 6 / 507 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1129 edges and 502 vertex of which 499 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 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 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 67 place count 498 transition count 377
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 132 place count 433 transition count 377
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 132 place count 433 transition count 280
Deduced a syphon composed of 97 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 210 rules applied. Total rules applied 342 place count 320 transition count 280
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 365 place count 297 transition count 257
Iterating global reduction 2 with 23 rules applied. Total rules applied 388 place count 297 transition count 257
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 388 place count 297 transition count 254
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 395 place count 293 transition count 254
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 2 with 244 rules applied. Total rules applied 639 place count 169 transition count 134
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 640 place count 168 transition count 133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 641 place count 167 transition count 133
Applied a total of 641 rules in 40 ms. Remains 167 /507 variables (removed 340) and now considering 133/450 (removed 317) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 40 ms. Remains : 167/507 places, 133/450 transitions.
[2024-06-01 07:11:06] [INFO ] Flatten gal took : 7 ms
[2024-06-01 07:11:06] [INFO ] Flatten gal took : 7 ms
[2024-06-01 07:11:06] [INFO ] Input system was already deterministic with 133 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 507/507 places, 450/450 transitions.
Graph (trivial) has 239 edges and 507 vertex of which 6 / 507 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1129 edges and 502 vertex of which 499 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 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 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 60 place count 498 transition count 384
Reduce places removed 58 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 60 rules applied. Total rules applied 120 place count 440 transition count 382
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 122 place count 438 transition count 382
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 122 place count 438 transition count 282
Deduced a syphon composed of 100 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 3 with 217 rules applied. Total rules applied 339 place count 321 transition count 282
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 359 place count 301 transition count 262
Iterating global reduction 3 with 20 rules applied. Total rules applied 379 place count 301 transition count 262
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 3 with 243 rules applied. Total rules applied 622 place count 178 transition count 142
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 623 place count 177 transition count 141
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 624 place count 176 transition count 141
Applied a total of 624 rules in 40 ms. Remains 176 /507 variables (removed 331) and now considering 141/450 (removed 309) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 40 ms. Remains : 176/507 places, 141/450 transitions.
[2024-06-01 07:11:06] [INFO ] Flatten gal took : 7 ms
[2024-06-01 07:11:06] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:11:06] [INFO ] Input system was already deterministic with 141 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 507/507 places, 450/450 transitions.
Graph (trivial) has 249 edges and 507 vertex of which 6 / 507 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1129 edges and 502 vertex of which 499 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 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 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 66 place count 498 transition count 378
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 130 place count 434 transition count 378
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 130 place count 434 transition count 279
Deduced a syphon composed of 99 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 2 with 215 rules applied. Total rules applied 345 place count 318 transition count 279
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 368 place count 295 transition count 256
Iterating global reduction 2 with 23 rules applied. Total rules applied 391 place count 295 transition count 256
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 391 place count 295 transition count 253
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 398 place count 291 transition count 253
Performed 119 Post agglomeration using F-continuation condition.Transition count delta: 119
Deduced a syphon composed of 119 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 2 with 242 rules applied. Total rules applied 640 place count 168 transition count 134
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 641 place count 167 transition count 133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 642 place count 166 transition count 133
Applied a total of 642 rules in 41 ms. Remains 166 /507 variables (removed 341) and now considering 133/450 (removed 317) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 42 ms. Remains : 166/507 places, 133/450 transitions.
[2024-06-01 07:11:06] [INFO ] Flatten gal took : 7 ms
[2024-06-01 07:11:06] [INFO ] Flatten gal took : 7 ms
[2024-06-01 07:11:06] [INFO ] Input system was already deterministic with 133 transitions.
[2024-06-01 07:11:06] [INFO ] Flatten gal took : 16 ms
[2024-06-01 07:11:06] [INFO ] Flatten gal took : 16 ms
[2024-06-01 07:11:06] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-06-01 07:11:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 507 places, 450 transitions and 1426 arcs took 4 ms.
Total runtime 45745 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-14-CTLCardinality-2024-00
Could not compute solution for formula : BusinessProcesses-PT-14-CTLCardinality-2024-02
Could not compute solution for formula : BusinessProcesses-PT-14-CTLCardinality-2024-03
Could not compute solution for formula : BusinessProcesses-PT-14-CTLCardinality-2024-04
Could not compute solution for formula : BusinessProcesses-PT-14-CTLCardinality-2024-05
Could not compute solution for formula : BusinessProcesses-PT-14-CTLCardinality-2024-06
Could not compute solution for formula : BusinessProcesses-PT-14-CTLCardinality-2024-09
Could not compute solution for formula : BusinessProcesses-PT-14-CTLCardinality-2024-10
Could not compute solution for formula : BusinessProcesses-PT-14-CTLCardinality-2024-11
Could not compute solution for formula : BusinessProcesses-PT-14-CTLCardinality-2023-12
Could not compute solution for formula : BusinessProcesses-PT-14-CTLCardinality-2023-13
Could not compute solution for formula : BusinessProcesses-PT-14-CTLCardinality-2023-15

BK_STOP 1717225866730

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-14-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/965/ctl_0_
ctl formula name BusinessProcesses-PT-14-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/965/ctl_1_
ctl formula name BusinessProcesses-PT-14-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/965/ctl_2_
ctl formula name BusinessProcesses-PT-14-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/965/ctl_3_
ctl formula name BusinessProcesses-PT-14-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/965/ctl_4_
ctl formula name BusinessProcesses-PT-14-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/965/ctl_5_
ctl formula name BusinessProcesses-PT-14-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/965/ctl_6_
ctl formula name BusinessProcesses-PT-14-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/965/ctl_7_
ctl formula name BusinessProcesses-PT-14-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/965/ctl_8_
ctl formula name BusinessProcesses-PT-14-CTLCardinality-2023-12
ctl formula formula --ctl=/tmp/965/ctl_9_
ctl formula name BusinessProcesses-PT-14-CTLCardinality-2023-13
ctl formula formula --ctl=/tmp/965/ctl_10_
ctl formula name BusinessProcesses-PT-14-CTLCardinality-2023-15
ctl formula formula --ctl=/tmp/965/ctl_11_
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-14"
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-14, 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-171620399700553"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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