About the Execution of LTSMin+red for MedleyA-PT-08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 630.308 | 61414.00 | 88397.00 | 276.90 | 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r579-smll-171734921200061.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is MedleyA-PT-08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r579-smll-171734921200061
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 6.6K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 90K Jun 2 16:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME MedleyA-PT-08-UpperBounds-00
FORMULA_NAME MedleyA-PT-08-UpperBounds-01
FORMULA_NAME MedleyA-PT-08-UpperBounds-02
FORMULA_NAME MedleyA-PT-08-UpperBounds-03
FORMULA_NAME MedleyA-PT-08-UpperBounds-04
FORMULA_NAME MedleyA-PT-08-UpperBounds-05
FORMULA_NAME MedleyA-PT-08-UpperBounds-06
FORMULA_NAME MedleyA-PT-08-UpperBounds-07
FORMULA_NAME MedleyA-PT-08-UpperBounds-08
FORMULA_NAME MedleyA-PT-08-UpperBounds-09
FORMULA_NAME MedleyA-PT-08-UpperBounds-10
FORMULA_NAME MedleyA-PT-08-UpperBounds-11
FORMULA_NAME MedleyA-PT-08-UpperBounds-12
FORMULA_NAME MedleyA-PT-08-UpperBounds-13
FORMULA_NAME MedleyA-PT-08-UpperBounds-14
FORMULA_NAME MedleyA-PT-08-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717354264997
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:51:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-02 18:51:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:51:07] [INFO ] Load time of PNML (sax parser for PT used): 186 ms
[2024-06-02 18:51:07] [INFO ] Transformed 147 places.
[2024-06-02 18:51:07] [INFO ] Transformed 312 transitions.
[2024-06-02 18:51:07] [INFO ] Found NUPN structural information;
[2024-06-02 18:51:08] [INFO ] Parsed PT model containing 147 places and 312 transitions and 1378 arcs in 425 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 17 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 312 rows 147 cols
[2024-06-02 18:51:08] [INFO ] Computed 11 invariants in 41 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (501 resets) in 88 ms. (112 steps per ms)
FORMULA MedleyA-PT-08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-08-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-08-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90006 steps (1189 resets) in 236 ms. (379 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-02 18:51:08] [INFO ] Invariant cache hit.
[2024-06-02 18:51:08] [INFO ] [Real]Absence check using 6 positive place invariants in 14 ms returned sat
[2024-06-02 18:51:08] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 4 ms returned sat
[2024-06-02 18:51:09] [INFO ] [Real]Absence check using state equation in 220 ms returned sat
[2024-06-02 18:51:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:51:09] [INFO ] [Nat]Absence check using 6 positive place invariants in 10 ms returned sat
[2024-06-02 18:51:09] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 4 ms returned sat
[2024-06-02 18:51:09] [INFO ] [Nat]Absence check using state equation in 209 ms returned sat
[2024-06-02 18:51:09] [INFO ] Computed and/alt/rep : 141/562/141 causal constraints (skipped 170 transitions) in 97 ms.
[2024-06-02 18:51:10] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 24 ms to minimize.
[2024-06-02 18:51:10] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 2 ms to minimize.
[2024-06-02 18:51:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 377 ms
[2024-06-02 18:51:10] [INFO ] Added : 78 causal constraints over 16 iterations in 1009 ms. Result :sat
Minimization took 358 ms.
[2024-06-02 18:51:11] [INFO ] [Real]Absence check using 6 positive place invariants in 9 ms returned sat
[2024-06-02 18:51:11] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 5 ms returned sat
[2024-06-02 18:51:11] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2024-06-02 18:51:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:51:11] [INFO ] [Nat]Absence check using 6 positive place invariants in 9 ms returned sat
[2024-06-02 18:51:11] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 5 ms returned sat
[2024-06-02 18:51:11] [INFO ] [Nat]Absence check using state equation in 187 ms returned sat
[2024-06-02 18:51:11] [INFO ] Deduced a trap composed of 25 places in 213 ms of which 3 ms to minimize.
[2024-06-02 18:51:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 256 ms
[2024-06-02 18:51:12] [INFO ] Computed and/alt/rep : 141/562/141 causal constraints (skipped 170 transitions) in 65 ms.
[2024-06-02 18:51:12] [INFO ] Deduced a trap composed of 53 places in 214 ms of which 5 ms to minimize.
[2024-06-02 18:51:13] [INFO ] Deduced a trap composed of 32 places in 139 ms of which 3 ms to minimize.
[2024-06-02 18:51:13] [INFO ] Deduced a trap composed of 33 places in 152 ms of which 2 ms to minimize.
[2024-06-02 18:51:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 674 ms
[2024-06-02 18:51:13] [INFO ] Added : 79 causal constraints over 16 iterations in 1363 ms. Result :sat
Minimization took 326 ms.
[2024-06-02 18:51:13] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2024-06-02 18:51:13] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 28 ms returned sat
[2024-06-02 18:51:13] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2024-06-02 18:51:14] [INFO ] Computed and/alt/rep : 141/562/141 causal constraints (skipped 170 transitions) in 59 ms.
[2024-06-02 18:51:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:51:14] [INFO ] [Nat]Absence check using 6 positive place invariants in 9 ms returned sat
[2024-06-02 18:51:14] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 5 ms returned sat
[2024-06-02 18:51:14] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2024-06-02 18:51:14] [INFO ] Computed and/alt/rep : 141/562/141 causal constraints (skipped 170 transitions) in 53 ms.
[2024-06-02 18:51:15] [INFO ] Deduced a trap composed of 33 places in 194 ms of which 3 ms to minimize.
[2024-06-02 18:51:15] [INFO ] Deduced a trap composed of 49 places in 148 ms of which 2 ms to minimize.
[2024-06-02 18:51:15] [INFO ] Deduced a trap composed of 30 places in 157 ms of which 3 ms to minimize.
[2024-06-02 18:51:15] [INFO ] Deduced a trap composed of 31 places in 126 ms of which 2 ms to minimize.
[2024-06-02 18:51:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 808 ms
[2024-06-02 18:51:15] [INFO ] Added : 76 causal constraints over 16 iterations in 1492 ms. Result :sat
Minimization took 337 ms.
[2024-06-02 18:51:16] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2024-06-02 18:51:16] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 4 ms returned sat
[2024-06-02 18:51:16] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2024-06-02 18:51:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:51:16] [INFO ] [Nat]Absence check using 6 positive place invariants in 9 ms returned sat
[2024-06-02 18:51:16] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 4 ms returned sat
[2024-06-02 18:51:16] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2024-06-02 18:51:16] [INFO ] Deduced a trap composed of 35 places in 156 ms of which 3 ms to minimize.
[2024-06-02 18:51:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
[2024-06-02 18:51:16] [INFO ] Computed and/alt/rep : 141/562/141 causal constraints (skipped 170 transitions) in 31 ms.
[2024-06-02 18:51:17] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 1 ms to minimize.
[2024-06-02 18:51:17] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 2 ms to minimize.
[2024-06-02 18:51:17] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 15 ms to minimize.
[2024-06-02 18:51:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 439 ms
[2024-06-02 18:51:17] [INFO ] Added : 77 causal constraints over 17 iterations in 960 ms. Result :sat
Minimization took 248 ms.
[2024-06-02 18:51:18] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-06-02 18:51:18] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 4 ms returned sat
[2024-06-02 18:51:18] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2024-06-02 18:51:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:51:18] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2024-06-02 18:51:18] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 18:51:18] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2024-06-02 18:51:18] [INFO ] Computed and/alt/rep : 141/562/141 causal constraints (skipped 170 transitions) in 26 ms.
[2024-06-02 18:51:19] [INFO ] Deduced a trap composed of 28 places in 165 ms of which 2 ms to minimize.
[2024-06-02 18:51:19] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 1 ms to minimize.
[2024-06-02 18:51:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 332 ms
[2024-06-02 18:51:19] [INFO ] Added : 83 causal constraints over 18 iterations in 927 ms. Result :sat
Minimization took 350 ms.
[2024-06-02 18:51:19] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2024-06-02 18:51:19] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 4 ms returned sat
[2024-06-02 18:51:20] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2024-06-02 18:51:20] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:51:20] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-06-02 18:51:20] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 18:51:20] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2024-06-02 18:51:20] [INFO ] Deduced a trap composed of 39 places in 127 ms of which 3 ms to minimize.
[2024-06-02 18:51:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2024-06-02 18:51:20] [INFO ] Computed and/alt/rep : 141/562/141 causal constraints (skipped 170 transitions) in 21 ms.
[2024-06-02 18:51:21] [INFO ] Deduced a trap composed of 28 places in 137 ms of which 2 ms to minimize.
[2024-06-02 18:51:21] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 2 ms to minimize.
[2024-06-02 18:51:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 337 ms
[2024-06-02 18:51:21] [INFO ] Added : 87 causal constraints over 18 iterations in 832 ms. Result :sat
Minimization took 351 ms.
[2024-06-02 18:51:21] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-06-02 18:51:21] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 18:51:21] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2024-06-02 18:51:22] [INFO ] Computed and/alt/rep : 141/562/141 causal constraints (skipped 170 transitions) in 40 ms.
[2024-06-02 18:51:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:51:22] [INFO ] [Nat]Absence check using 6 positive place invariants in 9 ms returned sat
[2024-06-02 18:51:22] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 5 ms returned sat
[2024-06-02 18:51:22] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2024-06-02 18:51:22] [INFO ] Computed and/alt/rep : 141/562/141 causal constraints (skipped 170 transitions) in 38 ms.
[2024-06-02 18:51:23] [INFO ] Deduced a trap composed of 33 places in 162 ms of which 3 ms to minimize.
[2024-06-02 18:51:23] [INFO ] Deduced a trap composed of 30 places in 135 ms of which 3 ms to minimize.
[2024-06-02 18:51:23] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 3 ms to minimize.
[2024-06-02 18:51:23] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 2 ms to minimize.
[2024-06-02 18:51:23] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 2 ms to minimize.
[2024-06-02 18:51:23] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 797 ms
[2024-06-02 18:51:23] [INFO ] Added : 75 causal constraints over 16 iterations in 1427 ms. Result :sat
Minimization took 306 ms.
[2024-06-02 18:51:24] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-06-02 18:51:24] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 18:51:24] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2024-06-02 18:51:24] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 3 ms to minimize.
[2024-06-02 18:51:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:51:24] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2024-06-02 18:51:24] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 8 ms returned sat
[2024-06-02 18:51:24] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2024-06-02 18:51:24] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 2 ms to minimize.
[2024-06-02 18:51:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2024-06-02 18:51:24] [INFO ] Computed and/alt/rep : 141/562/141 causal constraints (skipped 170 transitions) in 31 ms.
[2024-06-02 18:51:25] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 1 ms to minimize.
[2024-06-02 18:51:25] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 1 ms to minimize.
[2024-06-02 18:51:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 221 ms
[2024-06-02 18:51:25] [INFO ] Added : 80 causal constraints over 17 iterations in 793 ms. Result :sat
Minimization took 256 ms.
[2024-06-02 18:51:26] [INFO ] [Real]Absence check using 6 positive place invariants in 9 ms returned sat
[2024-06-02 18:51:26] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 4 ms returned sat
[2024-06-02 18:51:26] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2024-06-02 18:51:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:51:26] [INFO ] [Nat]Absence check using 6 positive place invariants in 9 ms returned sat
[2024-06-02 18:51:26] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 12 ms returned sat
[2024-06-02 18:51:26] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2024-06-02 18:51:26] [INFO ] Computed and/alt/rep : 141/562/141 causal constraints (skipped 170 transitions) in 38 ms.
[2024-06-02 18:51:27] [INFO ] Added : 71 causal constraints over 15 iterations in 585 ms. Result :sat
Minimization took 327 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA MedleyA-PT-08-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 312/312 transitions.
Graph (complete) has 508 edges and 147 vertex of which 140 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.5 ms
Discarding 7 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 140 transition count 275
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 29 rules applied. Total rules applied 64 place count 117 transition count 269
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 66 place count 116 transition count 268
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 66 place count 116 transition count 265
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 72 place count 113 transition count 265
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 100 place count 85 transition count 230
Iterating global reduction 3 with 28 rules applied. Total rules applied 128 place count 85 transition count 230
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 128 place count 85 transition count 228
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 132 place count 83 transition count 228
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 140 place count 75 transition count 210
Iterating global reduction 3 with 8 rules applied. Total rules applied 148 place count 75 transition count 210
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 151 place count 72 transition count 202
Iterating global reduction 3 with 3 rules applied. Total rules applied 154 place count 72 transition count 202
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 155 place count 71 transition count 199
Iterating global reduction 3 with 1 rules applied. Total rules applied 156 place count 71 transition count 199
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 180 place count 59 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 181 place count 59 transition count 186
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 183 place count 57 transition count 184
Iterating global reduction 4 with 2 rules applied. Total rules applied 185 place count 57 transition count 184
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 195 place count 52 transition count 205
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 4 with 23 rules applied. Total rules applied 218 place count 52 transition count 182
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 218 place count 52 transition count 181
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 220 place count 51 transition count 181
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 224 place count 49 transition count 204
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 229 place count 49 transition count 199
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 234 place count 44 transition count 199
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 236 place count 44 transition count 198
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 238 place count 42 transition count 198
Applied a total of 238 rules in 259 ms. Remains 42 /147 variables (removed 105) and now considering 198/312 (removed 114) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 282 ms. Remains : 42/147 places, 198/312 transitions.
[2024-06-02 18:51:28] [INFO ] Flow matrix only has 162 transitions (discarded 36 similar events)
// Phase 1: matrix 162 rows 42 cols
[2024-06-02 18:51:28] [INFO ] Computed 11 invariants in 11 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (15 resets) in 1011 ms. (988 steps per ms)
FORMULA MedleyA-PT-08-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4000002 steps (121 resets) in 1887 ms. (2118 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2024-06-02 18:51:31] [INFO ] Flow matrix only has 162 transitions (discarded 36 similar events)
[2024-06-02 18:51:31] [INFO ] Invariant cache hit.
[2024-06-02 18:51:31] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-06-02 18:51:31] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 18:51:31] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-06-02 18:51:31] [INFO ] State equation strengthened by 86 read => feed constraints.
[2024-06-02 18:51:31] [INFO ] [Real]Added 86 Read/Feed constraints in 10 ms returned sat
[2024-06-02 18:51:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:51:31] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-02 18:51:31] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-02 18:51:31] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-06-02 18:51:31] [INFO ] [Nat]Added 86 Read/Feed constraints in 13 ms returned sat
[2024-06-02 18:51:31] [INFO ] Computed and/alt/rep : 12/68/12 causal constraints (skipped 146 transitions) in 14 ms.
[2024-06-02 18:51:31] [INFO ] Added : 0 causal constraints over 0 iterations in 32 ms. Result :sat
Minimization took 64 ms.
[2024-06-02 18:51:31] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-06-02 18:51:31] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 18:51:31] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2024-06-02 18:51:32] [INFO ] [Real]Added 86 Read/Feed constraints in 16 ms returned sat
[2024-06-02 18:51:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:51:32] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-06-02 18:51:32] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-02 18:51:32] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-06-02 18:51:32] [INFO ] [Nat]Added 86 Read/Feed constraints in 13 ms returned sat
[2024-06-02 18:51:32] [INFO ] Computed and/alt/rep : 12/68/12 causal constraints (skipped 146 transitions) in 12 ms.
[2024-06-02 18:51:32] [INFO ] Added : 0 causal constraints over 0 iterations in 29 ms. Result :sat
Minimization took 59 ms.
[2024-06-02 18:51:32] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-06-02 18:51:32] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-02 18:51:32] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2024-06-02 18:51:32] [INFO ] [Real]Added 86 Read/Feed constraints in 18 ms returned sat
[2024-06-02 18:51:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:51:32] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-06-02 18:51:32] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 18:51:32] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-06-02 18:51:32] [INFO ] [Nat]Added 86 Read/Feed constraints in 23 ms returned sat
[2024-06-02 18:51:32] [INFO ] Computed and/alt/rep : 12/68/12 causal constraints (skipped 146 transitions) in 21 ms.
[2024-06-02 18:51:32] [INFO ] Added : 0 causal constraints over 0 iterations in 45 ms. Result :sat
Minimization took 105 ms.
[2024-06-02 18:51:32] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-06-02 18:51:32] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-02 18:51:32] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2024-06-02 18:51:32] [INFO ] [Real]Added 86 Read/Feed constraints in 20 ms returned sat
[2024-06-02 18:51:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:51:32] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-06-02 18:51:32] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 18:51:32] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-06-02 18:51:32] [INFO ] [Nat]Added 86 Read/Feed constraints in 24 ms returned sat
[2024-06-02 18:51:32] [INFO ] Computed and/alt/rep : 12/68/12 causal constraints (skipped 146 transitions) in 21 ms.
[2024-06-02 18:51:32] [INFO ] Added : 1 causal constraints over 1 iterations in 71 ms. Result :sat
Minimization took 106 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
FORMULA MedleyA-PT-08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-08-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 42 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 42/42 places, 198/198 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 40 transition count 196
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 39 transition count 194
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 39 transition count 194
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 39 transition count 192
Applied a total of 8 rules in 32 ms. Remains 39 /42 variables (removed 3) and now considering 192/198 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 39/42 places, 192/198 transitions.
[2024-06-02 18:51:33] [INFO ] Flow matrix only has 157 transitions (discarded 35 similar events)
// Phase 1: matrix 157 rows 39 cols
[2024-06-02 18:51:33] [INFO ] Computed 11 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (92 resets) in 904 ms. (1104 steps per ms)
BEST_FIRST walk for 2000001 steps (29 resets) in 873 ms. (2288 steps per ms)
FORMULA MedleyA-PT-08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-02 18:51:34] [INFO ] Flow matrix only has 157 transitions (discarded 35 similar events)
[2024-06-02 18:51:34] [INFO ] Invariant cache hit.
[2024-06-02 18:51:35] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-06-02 18:51:35] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 18:51:35] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2024-06-02 18:51:35] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-06-02 18:51:35] [INFO ] [Real]Added 85 Read/Feed constraints in 17 ms returned sat
[2024-06-02 18:51:35] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:51:35] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-02 18:51:35] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2024-06-02 18:51:35] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-06-02 18:51:35] [INFO ] [Nat]Added 85 Read/Feed constraints in 16 ms returned sat
[2024-06-02 18:51:35] [INFO ] Computed and/alt/rep : 11/64/11 causal constraints (skipped 142 transitions) in 19 ms.
[2024-06-02 18:51:35] [INFO ] Added : 0 causal constraints over 0 iterations in 37 ms. Result :sat
Minimization took 143 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 39 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p56) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 39/39 places, 190/190 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 39 transition count 189
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 38 transition count 189
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 38 transition count 187
Applied a total of 4 rules in 37 ms. Remains 38 /39 variables (removed 1) and now considering 187/190 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 38/39 places, 187/190 transitions.
[2024-06-02 18:51:35] [INFO ] Flow matrix only has 153 transitions (discarded 34 similar events)
// Phase 1: matrix 153 rows 38 cols
[2024-06-02 18:51:35] [INFO ] Computed 11 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (17 resets) in 1016 ms. (983 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 460 ms. (2169 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-02 18:51:36] [INFO ] Flow matrix only has 153 transitions (discarded 34 similar events)
[2024-06-02 18:51:36] [INFO ] Invariant cache hit.
[2024-06-02 18:51:36] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-06-02 18:51:36] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-02 18:51:37] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-06-02 18:51:37] [INFO ] State equation strengthened by 84 read => feed constraints.
[2024-06-02 18:51:37] [INFO ] [Real]Added 84 Read/Feed constraints in 11 ms returned sat
[2024-06-02 18:51:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:51:37] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-06-02 18:51:37] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 18:51:37] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-06-02 18:51:37] [INFO ] [Nat]Added 84 Read/Feed constraints in 20 ms returned sat
[2024-06-02 18:51:37] [INFO ] Computed and/alt/rep : 9/52/9 causal constraints (skipped 140 transitions) in 21 ms.
[2024-06-02 18:51:37] [INFO ] Added : 0 causal constraints over 0 iterations in 38 ms. Result :sat
Minimization took 113 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 38 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 38/38 places, 187/187 transitions.
Applied a total of 0 rules in 10 ms. Remains 38 /38 variables (removed 0) and now considering 187/187 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 38/38 places, 187/187 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 38/38 places, 187/187 transitions.
Applied a total of 0 rules in 8 ms. Remains 38 /38 variables (removed 0) and now considering 187/187 (removed 0) transitions.
[2024-06-02 18:51:37] [INFO ] Flow matrix only has 153 transitions (discarded 34 similar events)
[2024-06-02 18:51:37] [INFO ] Invariant cache hit.
[2024-06-02 18:51:37] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-02 18:51:37] [INFO ] Flow matrix only has 153 transitions (discarded 34 similar events)
[2024-06-02 18:51:37] [INFO ] Invariant cache hit.
[2024-06-02 18:51:37] [INFO ] State equation strengthened by 84 read => feed constraints.
[2024-06-02 18:51:37] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
[2024-06-02 18:51:37] [INFO ] Redundant transitions in 13 ms returned []
Running 183 sub problems to find dead transitions.
[2024-06-02 18:51:37] [INFO ] Flow matrix only has 153 transitions (discarded 34 similar events)
[2024-06-02 18:51:37] [INFO ] Invariant cache hit.
[2024-06-02 18:51:37] [INFO ] State equation strengthened by 84 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
At refinement iteration 2 (OVERLAPS) 2/38 variables, 6/9 constraints. Problems are: Problem set: 35 solved, 148 unsolved
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 2/11 constraints. Problems are: Problem set: 46 solved, 137 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/11 constraints. Problems are: Problem set: 46 solved, 137 unsolved
At refinement iteration 5 (OVERLAPS) 153/191 variables, 38/49 constraints. Problems are: Problem set: 46 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 84/133 constraints. Problems are: Problem set: 46 solved, 137 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/133 constraints. Problems are: Problem set: 46 solved, 137 unsolved
At refinement iteration 8 (OVERLAPS) 0/191 variables, 0/133 constraints. Problems are: Problem set: 46 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 133 constraints, problems are : Problem set: 46 solved, 137 unsolved in 4290 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 38/38 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 46 solved, 137 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 3/3 constraints. Problems are: Problem set: 46 solved, 137 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/3 constraints. Problems are: Problem set: 46 solved, 137 unsolved
At refinement iteration 2 (OVERLAPS) 2/38 variables, 6/9 constraints. Problems are: Problem set: 46 solved, 137 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 2/11 constraints. Problems are: Problem set: 46 solved, 137 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/11 constraints. Problems are: Problem set: 46 solved, 137 unsolved
At refinement iteration 5 (OVERLAPS) 153/191 variables, 38/49 constraints. Problems are: Problem set: 46 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 84/133 constraints. Problems are: Problem set: 46 solved, 137 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 137/270 constraints. Problems are: Problem set: 46 solved, 137 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/270 constraints. Problems are: Problem set: 46 solved, 137 unsolved
At refinement iteration 9 (OVERLAPS) 0/191 variables, 0/270 constraints. Problems are: Problem set: 46 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 270 constraints, problems are : Problem set: 46 solved, 137 unsolved in 9128 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 38/38 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 137/183 constraints, Known Traps: 0/0 constraints]
After SMT, in 13990ms problems are : Problem set: 46 solved, 137 unsolved
Search for dead transitions found 46 dead transitions in 14013ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 38/38 places, 141/187 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 36 transition count 141
Applied a total of 2 rules in 6 ms. Remains 36 /38 variables (removed 2) and now considering 141/141 (removed 0) transitions.
// Phase 1: matrix 141 rows 36 cols
[2024-06-02 18:51:51] [INFO ] Computed 9 invariants in 1 ms
[2024-06-02 18:51:51] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-02 18:51:51] [INFO ] Invariant cache hit.
[2024-06-02 18:51:51] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-02 18:51:51] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 36/38 places, 141/187 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 14611 ms. Remains : 36/38 places, 141/187 transitions.
[2024-06-02 18:51:51] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (47 resets) in 775 ms. (1288 steps per ms)
BEST_FIRST walk for 1000000 steps (22 resets) in 394 ms. (2531 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-02 18:51:53] [INFO ] Invariant cache hit.
[2024-06-02 18:51:53] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 18:51:53] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 18:51:53] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2024-06-02 18:51:53] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-02 18:51:53] [INFO ] [Real]Added 72 Read/Feed constraints in 10 ms returned sat
[2024-06-02 18:51:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:51:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 18:51:53] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-02 18:51:53] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-06-02 18:51:53] [INFO ] [Nat]Added 72 Read/Feed constraints in 13 ms returned sat
[2024-06-02 18:51:53] [INFO ] Computed and/alt/rep : 11/58/11 causal constraints (skipped 126 transitions) in 20 ms.
[2024-06-02 18:51:53] [INFO ] Added : 0 causal constraints over 0 iterations in 41 ms. Result :sat
Minimization took 70 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 36 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 36/36 places, 141/141 transitions.
Applied a total of 0 rules in 5 ms. Remains 36 /36 variables (removed 0) and now considering 141/141 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 36/36 places, 141/141 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 36/36 places, 141/141 transitions.
Applied a total of 0 rules in 5 ms. Remains 36 /36 variables (removed 0) and now considering 141/141 (removed 0) transitions.
[2024-06-02 18:51:53] [INFO ] Invariant cache hit.
[2024-06-02 18:51:53] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-02 18:51:53] [INFO ] Invariant cache hit.
[2024-06-02 18:51:53] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-02 18:51:53] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
[2024-06-02 18:51:53] [INFO ] Redundant transitions in 6 ms returned []
Running 137 sub problems to find dead transitions.
[2024-06-02 18:51:53] [INFO ] Invariant cache hit.
[2024-06-02 18:51:53] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (OVERLAPS) 2/36 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (OVERLAPS) 141/177 variables, 36/45 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 72/117 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (OVERLAPS) 0/177 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/177 variables, and 117 constraints, problems are : Problem set: 0 solved, 137 unsolved in 4443 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 36/36 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 137 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (OVERLAPS) 2/36 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (OVERLAPS) 141/177 variables, 36/45 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 72/117 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 137/254 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 8 (OVERLAPS) 0/177 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/177 variables, and 254 constraints, problems are : Problem set: 0 solved, 137 unsolved in 7230 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 36/36 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 0/0 constraints]
After SMT, in 11929ms problems are : Problem set: 0 solved, 137 unsolved
Search for dead transitions found 0 dead transitions in 11933ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12229 ms. Remains : 36/36 places, 141/141 transitions.
RANDOM walk for 30552 steps (248 resets) in 1382 ms. (22 steps per ms) remains 0/2 properties
FORMULA MedleyA-PT-08-UpperBounds-00 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 58758 ms.
ITS solved all properties within timeout
BK_STOP 1717354326411
--------------------
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 UpperBounds -timeout 360 -rebuildPNML
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="MedleyA-PT-08"
export BK_EXAMINATION="UpperBounds"
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 MedleyA-PT-08, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r579-smll-171734921200061"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-08.tgz
mv MedleyA-PT-08 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;