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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 660K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K 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:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 16:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Apr 11 16:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 11 16:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 11 16:34 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 161K 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-17-CTLCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-2023-12
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-2023-13
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-2023-14
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717226000984

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-17
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:13:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 07:13:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:13:22] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2024-06-01 07:13:22] [INFO ] Transformed 650 places.
[2024-06-01 07:13:22] [INFO ] Transformed 580 transitions.
[2024-06-01 07:13:22] [INFO ] Found NUPN structural information;
[2024-06-01 07:13:22] [INFO ] Parsed PT model containing 650 places and 580 transitions and 1709 arcs in 210 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Deduced a syphon composed of 4 places in 12 ms
Reduce places removed 4 places and 4 transitions.
Support contains 131 out of 646 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 646/646 places, 576/576 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 644 transition count 576
Discarding 70 places :
Symmetric choice reduction at 1 with 70 rule applications. Total rules 72 place count 574 transition count 506
Iterating global reduction 1 with 70 rules applied. Total rules applied 142 place count 574 transition count 506
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 168 place count 548 transition count 480
Iterating global reduction 1 with 26 rules applied. Total rules applied 194 place count 548 transition count 480
Applied a total of 194 rules in 122 ms. Remains 548 /646 variables (removed 98) and now considering 480/576 (removed 96) transitions.
// Phase 1: matrix 480 rows 548 cols
[2024-06-01 07:13:22] [INFO ] Computed 106 invariants in 29 ms
[2024-06-01 07:13:23] [INFO ] Implicit Places using invariants in 378 ms returned []
[2024-06-01 07:13:23] [INFO ] Invariant cache hit.
[2024-06-01 07:13:23] [INFO ] Implicit Places using invariants and state equation in 627 ms returned []
Implicit Place search using SMT with State Equation took 1034 ms to find 0 implicit places.
Running 479 sub problems to find dead transitions.
[2024-06-01 07:13:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/546 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/546 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 2 (OVERLAPS) 2/548 variables, 60/102 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/548 variables, 4/106 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-06-01 07:13:35] [INFO ] Deduced a trap composed of 114 places in 162 ms of which 25 ms to minimize.
[2024-06-01 07:13:35] [INFO ] Deduced a trap composed of 91 places in 164 ms of which 4 ms to minimize.
[2024-06-01 07:13:35] [INFO ] Deduced a trap composed of 92 places in 233 ms of which 3 ms to minimize.
[2024-06-01 07:13:35] [INFO ] Deduced a trap composed of 87 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:13:35] [INFO ] Deduced a trap composed of 88 places in 119 ms of which 12 ms to minimize.
[2024-06-01 07:13:36] [INFO ] Deduced a trap composed of 93 places in 102 ms of which 3 ms to minimize.
[2024-06-01 07:13:36] [INFO ] Deduced a trap composed of 86 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:13:36] [INFO ] Deduced a trap composed of 95 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:13:36] [INFO ] Deduced a trap composed of 88 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:13:36] [INFO ] Deduced a trap composed of 120 places in 99 ms of which 3 ms to minimize.
[2024-06-01 07:13:36] [INFO ] Deduced a trap composed of 106 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:13:36] [INFO ] Deduced a trap composed of 133 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:13:36] [INFO ] Deduced a trap composed of 118 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:13:36] [INFO ] Deduced a trap composed of 96 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:13:37] [INFO ] Deduced a trap composed of 133 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:13:37] [INFO ] Deduced a trap composed of 93 places in 103 ms of which 3 ms to minimize.
[2024-06-01 07:13:37] [INFO ] Deduced a trap composed of 135 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:13:37] [INFO ] Deduced a trap composed of 135 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:13:37] [INFO ] Deduced a trap composed of 91 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:13:37] [INFO ] Deduced a trap composed of 139 places in 102 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/548 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-06-01 07:13:37] [INFO ] Deduced a trap composed of 102 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:13:38] [INFO ] Deduced a trap composed of 107 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:13:38] [INFO ] Deduced a trap composed of 112 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:13:38] [INFO ] Deduced a trap composed of 92 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:13:38] [INFO ] Deduced a trap composed of 112 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:13:38] [INFO ] Deduced a trap composed of 86 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:13:38] [INFO ] Deduced a trap composed of 101 places in 100 ms of which 3 ms to minimize.
[2024-06-01 07:13:38] [INFO ] Deduced a trap composed of 119 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:13:38] [INFO ] Deduced a trap composed of 91 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:13:39] [INFO ] Deduced a trap composed of 90 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:13:39] [INFO ] Deduced a trap composed of 89 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:13:39] [INFO ] Deduced a trap composed of 93 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:13:39] [INFO ] Deduced a trap composed of 91 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:13:39] [INFO ] Deduced a trap composed of 94 places in 105 ms of which 6 ms to minimize.
[2024-06-01 07:13:39] [INFO ] Deduced a trap composed of 91 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:13:39] [INFO ] Deduced a trap composed of 91 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:13:39] [INFO ] Deduced a trap composed of 95 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:13:40] [INFO ] Deduced a trap composed of 117 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:13:40] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:13:40] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-06-01 07:13:40] [INFO ] Deduced a trap composed of 120 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:13:40] [INFO ] Deduced a trap composed of 90 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:13:41] [INFO ] Deduced a trap composed of 94 places in 167 ms of which 4 ms to minimize.
[2024-06-01 07:13:41] [INFO ] Deduced a trap composed of 97 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:13:41] [INFO ] Deduced a trap composed of 104 places in 164 ms of which 4 ms to minimize.
[2024-06-01 07:13:41] [INFO ] Deduced a trap composed of 120 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:13:41] [INFO ] Deduced a trap composed of 94 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:13:41] [INFO ] Deduced a trap composed of 94 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:13:41] [INFO ] Deduced a trap composed of 116 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:13:42] [INFO ] Deduced a trap composed of 115 places in 163 ms of which 3 ms to minimize.
[2024-06-01 07:13:42] [INFO ] Deduced a trap composed of 127 places in 152 ms of which 4 ms to minimize.
[2024-06-01 07:13:42] [INFO ] Deduced a trap composed of 117 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:13:42] [INFO ] Deduced a trap composed of 120 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:13:42] [INFO ] Deduced a trap composed of 119 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:13:43] [INFO ] Deduced a trap composed of 121 places in 185 ms of which 4 ms to minimize.
[2024-06-01 07:13:43] [INFO ] Deduced a trap composed of 117 places in 178 ms of which 7 ms to minimize.
[2024-06-01 07:13:43] [INFO ] Deduced a trap composed of 116 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:13:43] [INFO ] Deduced a trap composed of 22 places in 149 ms of which 2 ms to minimize.
[2024-06-01 07:13:43] [INFO ] Deduced a trap composed of 111 places in 144 ms of which 2 ms to minimize.
[2024-06-01 07:13:43] [INFO ] Deduced a trap composed of 117 places in 186 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 20/166 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-06-01 07:13:48] [INFO ] Deduced a trap composed of 126 places in 169 ms of which 3 ms to minimize.
[2024-06-01 07:13:48] [INFO ] Deduced a trap composed of 115 places in 124 ms of which 4 ms to minimize.
[2024-06-01 07:13:48] [INFO ] Deduced a trap composed of 115 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:13:48] [INFO ] Deduced a trap composed of 122 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:13:48] [INFO ] Deduced a trap composed of 117 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:13:48] [INFO ] Deduced a trap composed of 120 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:13:48] [INFO ] Deduced a trap composed of 122 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:13:49] [INFO ] Deduced a trap composed of 132 places in 155 ms of which 4 ms to minimize.
[2024-06-01 07:13:49] [INFO ] Deduced a trap composed of 110 places in 166 ms of which 3 ms to minimize.
[2024-06-01 07:13:49] [INFO ] Deduced a trap composed of 116 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:13:49] [INFO ] Deduced a trap composed of 120 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:13:49] [INFO ] Deduced a trap composed of 116 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:13:50] [INFO ] Deduced a trap composed of 104 places in 177 ms of which 3 ms to minimize.
[2024-06-01 07:13:50] [INFO ] Deduced a trap composed of 114 places in 160 ms of which 3 ms to minimize.
[2024-06-01 07:13:50] [INFO ] Deduced a trap composed of 102 places in 160 ms of which 3 ms to minimize.
[2024-06-01 07:13:50] [INFO ] Deduced a trap composed of 118 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:13:50] [INFO ] Deduced a trap composed of 109 places in 148 ms of which 4 ms to minimize.
[2024-06-01 07:13:50] [INFO ] Deduced a trap composed of 85 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:13:51] [INFO ] Deduced a trap composed of 89 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:13:51] [INFO ] Deduced a trap composed of 115 places in 132 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/548 variables, 20/186 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-06-01 07:13:51] [INFO ] Deduced a trap composed of 111 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:13:51] [INFO ] Deduced a trap composed of 125 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:13:51] [INFO ] Deduced a trap composed of 116 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:13:52] [INFO ] Deduced a trap composed of 112 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:13:52] [INFO ] Deduced a trap composed of 118 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:13:52] [INFO ] Deduced a trap composed of 118 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:13:52] [INFO ] Deduced a trap composed of 111 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:13:52] [INFO ] Deduced a trap composed of 90 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:13:52] [INFO ] Deduced a trap composed of 82 places in 172 ms of which 3 ms to minimize.
[2024-06-01 07:13:53] [INFO ] Deduced a trap composed of 86 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:13:53] [INFO ] Deduced a trap composed of 88 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:13:53] [INFO ] Deduced a trap composed of 96 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:13:53] [INFO ] Deduced a trap composed of 88 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:13:53] [INFO ] Deduced a trap composed of 87 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:13:53] [INFO ] Deduced a trap composed of 107 places in 152 ms of which 3 ms to minimize.
SMT process timed out in 30188ms, After SMT, problems are : Problem set: 0 solved, 479 unsolved
Search for dead transitions found 0 dead transitions in 30206ms
Starting structural reductions in LTL mode, iteration 1 : 548/646 places, 480/576 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31384 ms. Remains : 548/646 places, 480/576 transitions.
Support contains 131 out of 548 places after structural reductions.
[2024-06-01 07:13:54] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 07:13:54] [INFO ] Flatten gal took : 64 ms
[2024-06-01 07:13:54] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA BusinessProcesses-PT-17-CTLCardinality-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 07:13:54] [INFO ] Flatten gal took : 27 ms
[2024-06-01 07:13:54] [INFO ] Input system was already deterministic with 480 transitions.
Support contains 108 out of 548 places (down from 131) after GAL structural reductions.
RANDOM walk for 40000 steps (262 resets) in 2172 ms. (18 steps per ms) remains 33/64 properties
BEST_FIRST walk for 4003 steps (8 resets) in 54 ms. (72 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 60 ms. (65 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 61 ms. (64 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 60 ms. (65 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 59 ms. (66 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 53 ms. (74 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 33/33 properties
[2024-06-01 07:13:55] [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, 33 unsolved
At refinement iteration 1 (OVERLAPS) 288/354 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (OVERLAPS) 66/420 variables, 19/60 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/420 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 122/542 variables, 45/105 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 1/543 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/543 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 477/1020 variables, 543/649 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1020 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 11 (OVERLAPS) 8/1028 variables, 5/654 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1028 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 13 (OVERLAPS) 0/1028 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1028/1028 variables, and 654 constraints, problems are : Problem set: 0 solved, 33 unsolved in 2832 ms.
Refiners :[Positive P Invariants (semi-flows): 60/60 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 548/548 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 288/354 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-01 07:13:58] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:13:58] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:13:58] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:13:58] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:13:58] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:13:58] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:13:58] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:13:58] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:13:59] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:13:59] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 2 ms to minimize.
[2024-06-01 07:13:59] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:13:59] [INFO ] Deduced a trap composed of 78 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:13:59] [INFO ] Deduced a trap composed of 103 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:13:59] [INFO ] Deduced a trap composed of 89 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:13:59] [INFO ] Deduced a trap composed of 98 places in 102 ms of which 3 ms to minimize.
[2024-06-01 07:13:59] [INFO ] Deduced a trap composed of 83 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:13:59] [INFO ] Deduced a trap composed of 86 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:13:59] [INFO ] Deduced a trap composed of 90 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:13:59] [INFO ] Deduced a trap composed of 93 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:14:00] [INFO ] Deduced a trap composed of 82 places in 110 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-01 07:14:00] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:14:00] [INFO ] Deduced a trap composed of 37 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:14:00] [INFO ] Deduced a trap composed of 87 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:14:00] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:14:00] [INFO ] Deduced a trap composed of 85 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:14:00] [INFO ] Deduced a trap composed of 89 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:14:00] [INFO ] Deduced a trap composed of 92 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:14:00] [INFO ] Deduced a trap composed of 111 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:14:00] [INFO ] Deduced a trap composed of 85 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:14:00] [INFO ] Deduced a trap composed of 82 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:14:01] [INFO ] Deduced a trap composed of 84 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:14:01] [INFO ] Deduced a trap composed of 86 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:14:01] [INFO ] Deduced a trap composed of 86 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:14:01] [INFO ] Deduced a trap composed of 102 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:14:01] [INFO ] Deduced a trap composed of 86 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:14:01] [INFO ] Deduced a trap composed of 89 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:14:01] [INFO ] Deduced a trap composed of 85 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:14:01] [INFO ] Deduced a trap composed of 85 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:14:01] [INFO ] Deduced a trap composed of 84 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:14:01] [INFO ] Deduced a trap composed of 81 places in 92 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 38 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 105 places in 93 ms of which 3 ms to minimize.
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 96 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 103 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 97 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 113 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 103 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 96 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 103 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 101 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:14:03] [INFO ] Deduced a trap composed of 119 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:14:03] [INFO ] Deduced a trap composed of 107 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:14:03] [INFO ] Deduced a trap composed of 102 places in 100 ms of which 3 ms to minimize.
SMT process timed out in 7943ms, After SMT, problems are : Problem set: 0 solved, 33 unsolved
Fused 33 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 66 out of 548 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 548/548 places, 480/480 transitions.
Graph (trivial) has 207 edges and 548 vertex of which 4 / 548 are part of one of the 1 SCC in 3 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1194 edges and 545 vertex of which 544 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 48 place count 544 transition count 429
Reduce places removed 46 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 52 rules applied. Total rules applied 100 place count 498 transition count 423
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 106 place count 492 transition count 423
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 83 Pre rules applied. Total rules applied 106 place count 492 transition count 340
Deduced a syphon composed of 83 places in 1 ms
Ensure Unique test removed 11 places
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 3 with 177 rules applied. Total rules applied 283 place count 398 transition count 340
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 297 place count 384 transition count 326
Iterating global reduction 3 with 14 rules applied. Total rules applied 311 place count 384 transition count 326
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 2 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 3 with 240 rules applied. Total rules applied 551 place count 263 transition count 207
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 553 place count 262 transition count 211
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 555 place count 262 transition count 209
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 557 place count 260 transition count 209
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 562 place count 260 transition count 209
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 563 place count 259 transition count 208
Applied a total of 563 rules in 130 ms. Remains 259 /548 variables (removed 289) and now considering 208/480 (removed 272) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 259/548 places, 208/480 transitions.
RANDOM walk for 40000 steps (12 resets) in 766 ms. (52 steps per ms) remains 8/33 properties
BEST_FIRST walk for 40000 steps (12 resets) in 241 ms. (165 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 236 ms. (168 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 111 ms. (357 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (13 resets) in 113 ms. (350 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40000 steps (11 resets) in 274 ms. (145 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (11 resets) in 188 ms. (211 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40001 steps (13 resets) in 129 ms. (307 steps per ms) remains 4/5 properties
// Phase 1: matrix 208 rows 259 cols
[2024-06-01 07:14:04] [INFO ] Computed 93 invariants in 4 ms
[2024-06-01 07:14:04] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 77/87 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 87/174 variables, 46/53 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 66/240 variables, 32/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2/242 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 203/445 variables, 242/329 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/445 variables, 3/332 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/445 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 18/463 variables, 14/346 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/463 variables, 5/351 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/463 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 2/465 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/465 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 2/467 variables, 3/355 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/467 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/467 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 467/467 variables, and 355 constraints, problems are : Problem set: 0 solved, 4 unsolved in 343 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 259/259 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 77/87 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 63 places in 58 ms of which 3 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 87/174 variables, 46/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 59 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:14:05] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:14:05] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:14:05] [INFO ] Deduced a trap composed of 60 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:14:05] [INFO ] Deduced a trap composed of 63 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:14:05] [INFO ] Deduced a trap composed of 61 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:14:05] [INFO ] Deduced a trap composed of 62 places in 52 ms of which 2 ms to minimize.
[2024-06-01 07:14:05] [INFO ] Deduced a trap composed of 62 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:14:05] [INFO ] Deduced a trap composed of 62 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:14:05] [INFO ] Deduced a trap composed of 63 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:14:05] [INFO ] Deduced a trap composed of 67 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:14:05] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:14:05] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:14:05] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:14:05] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 18/74 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:14:05] [INFO ] Deduced a trap composed of 60 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:14:05] [INFO ] Deduced a trap composed of 61 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:14:05] [INFO ] Deduced a trap composed of 62 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:14:06] [INFO ] Deduced a trap composed of 58 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:14:06] [INFO ] Deduced a trap composed of 59 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:14:06] [INFO ] Deduced a trap composed of 61 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:14:06] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:14:06] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 8/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp20 is UNSAT
At refinement iteration 8 (OVERLAPS) 66/240 variables, 32/114 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-01 07:14:06] [INFO ] Deduced a trap composed of 61 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:14:06] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:14:06] [INFO ] Deduced a trap composed of 61 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:14:06] [INFO ] Deduced a trap composed of 66 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:14:06] [INFO ] Deduced a trap composed of 61 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:14:06] [INFO ] Deduced a trap composed of 65 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:14:06] [INFO ] Deduced a trap composed of 63 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:14:06] [INFO ] Deduced a trap composed of 61 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:14:06] [INFO ] Deduced a trap composed of 67 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:14:07] [INFO ] Deduced a trap composed of 62 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:14:07] [INFO ] Deduced a trap composed of 62 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:14:07] [INFO ] Deduced a trap composed of 67 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:14:07] [INFO ] Deduced a trap composed of 60 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:14:07] [INFO ] Deduced a trap composed of 61 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:14:07] [INFO ] Deduced a trap composed of 59 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:14:07] [INFO ] Deduced a trap composed of 55 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:14:07] [INFO ] Deduced a trap composed of 54 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:14:07] [INFO ] Deduced a trap composed of 59 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:14:07] [INFO ] Deduced a trap composed of 58 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:14:07] [INFO ] Deduced a trap composed of 60 places in 67 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 20/134 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-01 07:14:07] [INFO ] Deduced a trap composed of 56 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:14:07] [INFO ] Deduced a trap composed of 51 places in 78 ms of which 3 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 58 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 59 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 55 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 58 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 58 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 61 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 65 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 59 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 58 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 57 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 60 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 58 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 61 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 59 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 57 places in 119 ms of which 1 ms to minimize.
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 20/154 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 60 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:14:10] [INFO ] Deduced a trap composed of 66 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:14:10] [INFO ] Deduced a trap composed of 68 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:14:10] [INFO ] Deduced a trap composed of 60 places in 103 ms of which 1 ms to minimize.
[2024-06-01 07:14:10] [INFO ] Deduced a trap composed of 61 places in 107 ms of which 1 ms to minimize.
[2024-06-01 07:14:10] [INFO ] Deduced a trap composed of 58 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:14:10] [INFO ] Deduced a trap composed of 57 places in 121 ms of which 1 ms to minimize.
[2024-06-01 07:14:10] [INFO ] Deduced a trap composed of 62 places in 99 ms of which 3 ms to minimize.
[2024-06-01 07:14:10] [INFO ] Deduced a trap composed of 65 places in 98 ms of which 1 ms to minimize.
[2024-06-01 07:14:13] [INFO ] Deduced a trap composed of 6 places in 2290 ms of which 27 ms to minimize.
[2024-06-01 07:14:13] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:14:13] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 12/166 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/240 variables, 0/166 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2/242 variables, 2/168 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/242 variables, 0/168 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 203/445 variables, 242/410 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/445 variables, 3/413 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/445 variables, 3/416 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-01 07:14:13] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 1 ms to minimize.
[2024-06-01 07:14:13] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:14:13] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/445 variables, 3/419 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/445 variables, 0/419 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 18/463 variables, 14/433 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/463 variables, 5/438 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/463 variables, 0/438 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 2/465 variables, 1/439 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/465 variables, 0/439 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp19 is UNSAT
At refinement iteration 25 (OVERLAPS) 2/467 variables, 3/442 constraints. Problems are: Problem set: 3 solved, 1 unsolved
[2024-06-01 07:14:14] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:14:14] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/467 variables, 2/444 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/467 variables, 0/444 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/467 variables, 0/444 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 467/467 variables, and 444 constraints, problems are : Problem set: 3 solved, 1 unsolved in 9761 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 259/259 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 86/86 constraints]
After SMT, in 10124ms problems are : Problem set: 3 solved, 1 unsolved
Parikh walk visited 0 properties in 25 ms.
Support contains 1 out of 259 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 259/259 places, 208/208 transitions.
Graph (trivial) has 66 edges and 259 vertex of which 4 / 259 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 818 edges and 256 vertex of which 255 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 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 16 place count 255 transition count 190
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 30 place count 241 transition count 190
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 30 place count 241 transition count 165
Deduced a syphon composed of 25 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 59 rules applied. Total rules applied 89 place count 207 transition count 165
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 97 place count 199 transition count 156
Iterating global reduction 2 with 8 rules applied. Total rules applied 105 place count 199 transition count 156
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 147 place count 176 transition count 137
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 149 place count 175 transition count 137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 150 place count 174 transition count 136
Applied a total of 150 rules in 61 ms. Remains 174 /259 variables (removed 85) and now considering 136/208 (removed 72) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 174/259 places, 136/208 transitions.
RANDOM walk for 40000 steps (1120 resets) in 330 ms. (120 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (617 resets) in 177 ms. (224 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2004 steps, run visited all 1 properties in 30 ms. (steps per millisecond=66 )
Probabilistic random walk after 2004 steps, saw 900 distinct states, run finished after 34 ms. (steps per millisecond=58 ) properties seen :1
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
[2024-06-01 07:14:14] [INFO ] Flatten gal took : 48 ms
[2024-06-01 07:14:14] [INFO ] Flatten gal took : 49 ms
[2024-06-01 07:14:14] [INFO ] Input system was already deterministic with 480 transitions.
Support contains 100 out of 548 places (down from 103) after GAL structural reductions.
Computed a total of 233 stabilizing places and 204 stable transitions
Graph (complete) has 1198 edges and 548 vertex of which 546 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.38 ms
Starting structural reductions in LTL mode, iteration 0 : 548/548 places, 480/480 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 547 transition count 480
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 34 place count 514 transition count 447
Iterating global reduction 1 with 33 rules applied. Total rules applied 67 place count 514 transition count 447
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 78 place count 503 transition count 436
Iterating global reduction 1 with 11 rules applied. Total rules applied 89 place count 503 transition count 436
Applied a total of 89 rules in 122 ms. Remains 503 /548 variables (removed 45) and now considering 436/480 (removed 44) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 124 ms. Remains : 503/548 places, 436/480 transitions.
[2024-06-01 07:14:15] [INFO ] Flatten gal took : 31 ms
[2024-06-01 07:14:15] [INFO ] Flatten gal took : 44 ms
[2024-06-01 07:14:15] [INFO ] Input system was already deterministic with 436 transitions.
Starting structural reductions in LTL mode, iteration 0 : 548/548 places, 480/480 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 547 transition count 480
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 35 place count 513 transition count 446
Iterating global reduction 1 with 34 rules applied. Total rules applied 69 place count 513 transition count 446
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 81 place count 501 transition count 434
Iterating global reduction 1 with 12 rules applied. Total rules applied 93 place count 501 transition count 434
Applied a total of 93 rules in 106 ms. Remains 501 /548 variables (removed 47) and now considering 434/480 (removed 46) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 107 ms. Remains : 501/548 places, 434/480 transitions.
[2024-06-01 07:14:15] [INFO ] Flatten gal took : 38 ms
[2024-06-01 07:14:15] [INFO ] Flatten gal took : 32 ms
[2024-06-01 07:14:15] [INFO ] Input system was already deterministic with 434 transitions.
Starting structural reductions in LTL mode, iteration 0 : 548/548 places, 480/480 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 547 transition count 480
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 35 place count 513 transition count 446
Iterating global reduction 1 with 34 rules applied. Total rules applied 69 place count 513 transition count 446
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 81 place count 501 transition count 434
Iterating global reduction 1 with 12 rules applied. Total rules applied 93 place count 501 transition count 434
Applied a total of 93 rules in 114 ms. Remains 501 /548 variables (removed 47) and now considering 434/480 (removed 46) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 115 ms. Remains : 501/548 places, 434/480 transitions.
[2024-06-01 07:14:15] [INFO ] Flatten gal took : 28 ms
[2024-06-01 07:14:15] [INFO ] Flatten gal took : 29 ms
[2024-06-01 07:14:15] [INFO ] Input system was already deterministic with 434 transitions.
Starting structural reductions in LTL mode, iteration 0 : 548/548 places, 480/480 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 547 transition count 480
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 29 place count 519 transition count 452
Iterating global reduction 1 with 28 rules applied. Total rules applied 57 place count 519 transition count 452
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 66 place count 510 transition count 443
Iterating global reduction 1 with 9 rules applied. Total rules applied 75 place count 510 transition count 443
Applied a total of 75 rules in 128 ms. Remains 510 /548 variables (removed 38) and now considering 443/480 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 128 ms. Remains : 510/548 places, 443/480 transitions.
[2024-06-01 07:14:15] [INFO ] Flatten gal took : 40 ms
[2024-06-01 07:14:15] [INFO ] Flatten gal took : 29 ms
[2024-06-01 07:14:15] [INFO ] Input system was already deterministic with 443 transitions.
Starting structural reductions in LTL mode, iteration 0 : 548/548 places, 480/480 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 547 transition count 480
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 34 place count 514 transition count 447
Iterating global reduction 1 with 33 rules applied. Total rules applied 67 place count 514 transition count 447
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 78 place count 503 transition count 436
Iterating global reduction 1 with 11 rules applied. Total rules applied 89 place count 503 transition count 436
Applied a total of 89 rules in 128 ms. Remains 503 /548 variables (removed 45) and now considering 436/480 (removed 44) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 128 ms. Remains : 503/548 places, 436/480 transitions.
[2024-06-01 07:14:16] [INFO ] Flatten gal took : 42 ms
[2024-06-01 07:14:16] [INFO ] Flatten gal took : 29 ms
[2024-06-01 07:14:16] [INFO ] Input system was already deterministic with 436 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 548/548 places, 480/480 transitions.
Graph (trivial) has 271 edges and 548 vertex of which 7 / 548 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 1191 edges and 542 vertex of which 540 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 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 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 71 place count 539 transition count 402
Reduce places removed 69 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 70 rules applied. Total rules applied 141 place count 470 transition count 401
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 142 place count 469 transition count 401
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 108 Pre rules applied. Total rules applied 142 place count 469 transition count 293
Deduced a syphon composed of 108 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 3 with 234 rules applied. Total rules applied 376 place count 343 transition count 293
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 407 place count 312 transition count 262
Iterating global reduction 3 with 31 rules applied. Total rules applied 438 place count 312 transition count 262
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 438 place count 312 transition count 261
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 440 place count 311 transition count 261
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 255 rules applied. Total rules applied 695 place count 181 transition count 136
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 696 place count 180 transition count 135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 697 place count 179 transition count 135
Applied a total of 697 rules in 130 ms. Remains 179 /548 variables (removed 369) and now considering 135/480 (removed 345) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 130 ms. Remains : 179/548 places, 135/480 transitions.
[2024-06-01 07:14:16] [INFO ] Flatten gal took : 7 ms
[2024-06-01 07:14:16] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:14:16] [INFO ] Input system was already deterministic with 135 transitions.
Starting structural reductions in LTL mode, iteration 0 : 548/548 places, 480/480 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 547 transition count 480
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 32 place count 516 transition count 449
Iterating global reduction 1 with 31 rules applied. Total rules applied 63 place count 516 transition count 449
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 74 place count 505 transition count 438
Iterating global reduction 1 with 11 rules applied. Total rules applied 85 place count 505 transition count 438
Applied a total of 85 rules in 112 ms. Remains 505 /548 variables (removed 43) and now considering 438/480 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 113 ms. Remains : 505/548 places, 438/480 transitions.
[2024-06-01 07:14:16] [INFO ] Flatten gal took : 27 ms
[2024-06-01 07:14:16] [INFO ] Flatten gal took : 28 ms
[2024-06-01 07:14:16] [INFO ] Input system was already deterministic with 438 transitions.
Starting structural reductions in LTL mode, iteration 0 : 548/548 places, 480/480 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 547 transition count 480
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 34 place count 514 transition count 447
Iterating global reduction 1 with 33 rules applied. Total rules applied 67 place count 514 transition count 447
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 79 place count 502 transition count 435
Iterating global reduction 1 with 12 rules applied. Total rules applied 91 place count 502 transition count 435
Applied a total of 91 rules in 74 ms. Remains 502 /548 variables (removed 46) and now considering 435/480 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 74 ms. Remains : 502/548 places, 435/480 transitions.
[2024-06-01 07:14:16] [INFO ] Flatten gal took : 25 ms
[2024-06-01 07:14:16] [INFO ] Flatten gal took : 25 ms
[2024-06-01 07:14:16] [INFO ] Input system was already deterministic with 435 transitions.
Starting structural reductions in LTL mode, iteration 0 : 548/548 places, 480/480 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 547 transition count 480
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 32 place count 516 transition count 449
Iterating global reduction 1 with 31 rules applied. Total rules applied 63 place count 516 transition count 449
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 74 place count 505 transition count 438
Iterating global reduction 1 with 11 rules applied. Total rules applied 85 place count 505 transition count 438
Applied a total of 85 rules in 76 ms. Remains 505 /548 variables (removed 43) and now considering 438/480 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 77 ms. Remains : 505/548 places, 438/480 transitions.
[2024-06-01 07:14:16] [INFO ] Flatten gal took : 28 ms
[2024-06-01 07:14:16] [INFO ] Flatten gal took : 28 ms
[2024-06-01 07:14:17] [INFO ] Input system was already deterministic with 438 transitions.
Starting structural reductions in LTL mode, iteration 0 : 548/548 places, 480/480 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 547 transition count 480
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 28 place count 520 transition count 453
Iterating global reduction 1 with 27 rules applied. Total rules applied 55 place count 520 transition count 453
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 63 place count 512 transition count 445
Iterating global reduction 1 with 8 rules applied. Total rules applied 71 place count 512 transition count 445
Applied a total of 71 rules in 53 ms. Remains 512 /548 variables (removed 36) and now considering 445/480 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53 ms. Remains : 512/548 places, 445/480 transitions.
[2024-06-01 07:14:17] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:14:17] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:14:17] [INFO ] Input system was already deterministic with 445 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 548/548 places, 480/480 transitions.
Graph (trivial) has 266 edges and 548 vertex of which 7 / 548 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 1191 edges and 542 vertex of which 540 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 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 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 539 transition count 403
Reduce places removed 68 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 69 rules applied. Total rules applied 139 place count 471 transition count 402
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 140 place count 470 transition count 402
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 106 Pre rules applied. Total rules applied 140 place count 470 transition count 296
Deduced a syphon composed of 106 places in 0 ms
Ensure Unique test removed 19 places
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 3 with 231 rules applied. Total rules applied 371 place count 345 transition count 296
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 400 place count 316 transition count 267
Iterating global reduction 3 with 29 rules applied. Total rules applied 429 place count 316 transition count 267
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 429 place count 316 transition count 266
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 431 place count 315 transition count 266
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: 124
Deduced a syphon composed of 124 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 253 rules applied. Total rules applied 684 place count 186 transition count 142
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 685 place count 185 transition count 141
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 686 place count 184 transition count 141
Applied a total of 686 rules in 117 ms. Remains 184 /548 variables (removed 364) and now considering 141/480 (removed 339) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 118 ms. Remains : 184/548 places, 141/480 transitions.
[2024-06-01 07:14:17] [INFO ] Flatten gal took : 19 ms
[2024-06-01 07:14:17] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:14:17] [INFO ] Input system was already deterministic with 141 transitions.
Starting structural reductions in LTL mode, iteration 0 : 548/548 places, 480/480 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 547 transition count 480
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 29 place count 519 transition count 452
Iterating global reduction 1 with 28 rules applied. Total rules applied 57 place count 519 transition count 452
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 69 place count 507 transition count 440
Iterating global reduction 1 with 12 rules applied. Total rules applied 81 place count 507 transition count 440
Applied a total of 81 rules in 78 ms. Remains 507 /548 variables (removed 41) and now considering 440/480 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 78 ms. Remains : 507/548 places, 440/480 transitions.
[2024-06-01 07:14:17] [INFO ] Flatten gal took : 23 ms
[2024-06-01 07:14:17] [INFO ] Flatten gal took : 24 ms
[2024-06-01 07:14:17] [INFO ] Input system was already deterministic with 440 transitions.
Starting structural reductions in LTL mode, iteration 0 : 548/548 places, 480/480 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 547 transition count 480
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 34 place count 514 transition count 447
Iterating global reduction 1 with 33 rules applied. Total rules applied 67 place count 514 transition count 447
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 78 place count 503 transition count 436
Iterating global reduction 1 with 11 rules applied. Total rules applied 89 place count 503 transition count 436
Applied a total of 89 rules in 60 ms. Remains 503 /548 variables (removed 45) and now considering 436/480 (removed 44) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61 ms. Remains : 503/548 places, 436/480 transitions.
[2024-06-01 07:14:17] [INFO ] Flatten gal took : 10 ms
[2024-06-01 07:14:17] [INFO ] Flatten gal took : 25 ms
[2024-06-01 07:14:17] [INFO ] Input system was already deterministic with 436 transitions.
[2024-06-01 07:14:17] [INFO ] Flatten gal took : 26 ms
[2024-06-01 07:14:17] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:14:17] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-06-01 07:14:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 548 places, 480 transitions and 1507 arcs took 4 ms.
Total runtime 55645 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-17-CTLCardinality-2024-00
Could not compute solution for formula : BusinessProcesses-PT-17-CTLCardinality-2024-01
Could not compute solution for formula : BusinessProcesses-PT-17-CTLCardinality-2024-02
Could not compute solution for formula : BusinessProcesses-PT-17-CTLCardinality-2024-03
Could not compute solution for formula : BusinessProcesses-PT-17-CTLCardinality-2024-04
Could not compute solution for formula : BusinessProcesses-PT-17-CTLCardinality-2024-05
Could not compute solution for formula : BusinessProcesses-PT-17-CTLCardinality-2024-08
Could not compute solution for formula : BusinessProcesses-PT-17-CTLCardinality-2024-09
Could not compute solution for formula : BusinessProcesses-PT-17-CTLCardinality-2024-10
Could not compute solution for formula : BusinessProcesses-PT-17-CTLCardinality-2024-11
Could not compute solution for formula : BusinessProcesses-PT-17-CTLCardinality-2023-13
Could not compute solution for formula : BusinessProcesses-PT-17-CTLCardinality-2023-14
Could not compute solution for formula : BusinessProcesses-PT-17-CTLCardinality-2023-15

BK_STOP 1717226058280

--------------------
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-17-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/1252/ctl_0_
ctl formula name BusinessProcesses-PT-17-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/1252/ctl_1_
ctl formula name BusinessProcesses-PT-17-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/1252/ctl_2_
ctl formula name BusinessProcesses-PT-17-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/1252/ctl_3_
ctl formula name BusinessProcesses-PT-17-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/1252/ctl_4_
ctl formula name BusinessProcesses-PT-17-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/1252/ctl_5_
ctl formula name BusinessProcesses-PT-17-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/1252/ctl_6_
ctl formula name BusinessProcesses-PT-17-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/1252/ctl_7_
ctl formula name BusinessProcesses-PT-17-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/1252/ctl_8_
ctl formula name BusinessProcesses-PT-17-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/1252/ctl_9_
ctl formula name BusinessProcesses-PT-17-CTLCardinality-2023-13
ctl formula formula --ctl=/tmp/1252/ctl_10_
ctl formula name BusinessProcesses-PT-17-CTLCardinality-2023-14
ctl formula formula --ctl=/tmp/1252/ctl_11_
ctl formula name BusinessProcesses-PT-17-CTLCardinality-2023-15
ctl formula formula --ctl=/tmp/1252/ctl_12_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-17"
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-17, 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-171620399800577"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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