About the Execution of LTSMin+red for Anderson-PT-06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 668.859 | 51041.00 | 87908.00 | 364.10 | ???????????T???? | 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.r464-smll-171620118300330.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 Anderson-PT-06, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r464-smll-171620118300330
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 732K
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Apr 22 14:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 22 14:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 15:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 12 15:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 15:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 12 15:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:27 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 302K 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 Anderson-PT-06-CTLFireability-2024-00
FORMULA_NAME Anderson-PT-06-CTLFireability-2024-01
FORMULA_NAME Anderson-PT-06-CTLFireability-2024-02
FORMULA_NAME Anderson-PT-06-CTLFireability-2024-03
FORMULA_NAME Anderson-PT-06-CTLFireability-2024-04
FORMULA_NAME Anderson-PT-06-CTLFireability-2024-05
FORMULA_NAME Anderson-PT-06-CTLFireability-2024-06
FORMULA_NAME Anderson-PT-06-CTLFireability-2024-07
FORMULA_NAME Anderson-PT-06-CTLFireability-2024-08
FORMULA_NAME Anderson-PT-06-CTLFireability-2024-09
FORMULA_NAME Anderson-PT-06-CTLFireability-2024-10
FORMULA_NAME Anderson-PT-06-CTLFireability-2024-11
FORMULA_NAME Anderson-PT-06-CTLFireability-2023-12
FORMULA_NAME Anderson-PT-06-CTLFireability-2023-13
FORMULA_NAME Anderson-PT-06-CTLFireability-2023-14
FORMULA_NAME Anderson-PT-06-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1717255354807
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:22:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 15:22:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:22:37] [INFO ] Load time of PNML (sax parser for PT used): 319 ms
[2024-06-01 15:22:37] [INFO ] Transformed 229 places.
[2024-06-01 15:22:37] [INFO ] Transformed 600 transitions.
[2024-06-01 15:22:37] [INFO ] Found NUPN structural information;
[2024-06-01 15:22:37] [INFO ] Parsed PT model containing 229 places and 600 transitions and 2280 arcs in 549 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 31 ms.
Support contains 93 out of 229 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 600/600 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 209 transition count 580
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 209 transition count 580
Applied a total of 40 rules in 95 ms. Remains 209 /229 variables (removed 20) and now considering 580/600 (removed 20) transitions.
// Phase 1: matrix 580 rows 209 cols
[2024-06-01 15:22:38] [INFO ] Computed 15 invariants in 70 ms
[2024-06-01 15:22:38] [INFO ] Implicit Places using invariants in 627 ms returned []
[2024-06-01 15:22:38] [INFO ] Invariant cache hit.
[2024-06-01 15:22:39] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-06-01 15:22:39] [INFO ] Implicit Places using invariants and state equation in 903 ms returned []
Implicit Place search using SMT with State Equation took 1596 ms to find 0 implicit places.
Running 574 sub problems to find dead transitions.
[2024-06-01 15:22:39] [INFO ] Invariant cache hit.
[2024-06-01 15:22:39] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/209 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 574 unsolved
[2024-06-01 15:22:46] [INFO ] Deduced a trap composed of 88 places in 326 ms of which 45 ms to minimize.
[2024-06-01 15:22:46] [INFO ] Deduced a trap composed of 140 places in 298 ms of which 5 ms to minimize.
[2024-06-01 15:22:47] [INFO ] Deduced a trap composed of 87 places in 269 ms of which 5 ms to minimize.
[2024-06-01 15:22:47] [INFO ] Deduced a trap composed of 123 places in 261 ms of which 4 ms to minimize.
[2024-06-01 15:22:47] [INFO ] Deduced a trap composed of 112 places in 274 ms of which 4 ms to minimize.
[2024-06-01 15:22:48] [INFO ] Deduced a trap composed of 115 places in 248 ms of which 4 ms to minimize.
[2024-06-01 15:22:48] [INFO ] Deduced a trap composed of 133 places in 243 ms of which 4 ms to minimize.
[2024-06-01 15:22:48] [INFO ] Deduced a trap composed of 105 places in 308 ms of which 4 ms to minimize.
[2024-06-01 15:22:49] [INFO ] Deduced a trap composed of 114 places in 244 ms of which 4 ms to minimize.
[2024-06-01 15:22:49] [INFO ] Deduced a trap composed of 111 places in 309 ms of which 4 ms to minimize.
[2024-06-01 15:22:49] [INFO ] Deduced a trap composed of 87 places in 339 ms of which 4 ms to minimize.
[2024-06-01 15:22:50] [INFO ] Deduced a trap composed of 148 places in 346 ms of which 4 ms to minimize.
[2024-06-01 15:22:50] [INFO ] Deduced a trap composed of 65 places in 308 ms of which 3 ms to minimize.
[2024-06-01 15:22:50] [INFO ] Deduced a trap composed of 75 places in 329 ms of which 3 ms to minimize.
[2024-06-01 15:22:51] [INFO ] Deduced a trap composed of 90 places in 298 ms of which 3 ms to minimize.
[2024-06-01 15:22:51] [INFO ] Deduced a trap composed of 104 places in 248 ms of which 3 ms to minimize.
[2024-06-01 15:22:51] [INFO ] Deduced a trap composed of 48 places in 223 ms of which 3 ms to minimize.
[2024-06-01 15:22:51] [INFO ] Deduced a trap composed of 132 places in 229 ms of which 3 ms to minimize.
[2024-06-01 15:22:52] [INFO ] Deduced a trap composed of 121 places in 226 ms of which 3 ms to minimize.
[2024-06-01 15:22:52] [INFO ] Deduced a trap composed of 118 places in 242 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 574 unsolved
[2024-06-01 15:22:53] [INFO ] Deduced a trap composed of 98 places in 237 ms of which 3 ms to minimize.
[2024-06-01 15:22:53] [INFO ] Deduced a trap composed of 114 places in 155 ms of which 2 ms to minimize.
[2024-06-01 15:22:53] [INFO ] Deduced a trap composed of 107 places in 153 ms of which 3 ms to minimize.
[2024-06-01 15:22:53] [INFO ] Deduced a trap composed of 128 places in 145 ms of which 2 ms to minimize.
[2024-06-01 15:22:53] [INFO ] Deduced a trap composed of 134 places in 151 ms of which 2 ms to minimize.
[2024-06-01 15:22:53] [INFO ] Deduced a trap composed of 131 places in 156 ms of which 3 ms to minimize.
[2024-06-01 15:22:54] [INFO ] Deduced a trap composed of 115 places in 154 ms of which 2 ms to minimize.
[2024-06-01 15:22:54] [INFO ] Deduced a trap composed of 84 places in 162 ms of which 2 ms to minimize.
[2024-06-01 15:22:54] [INFO ] Deduced a trap composed of 87 places in 252 ms of which 3 ms to minimize.
[2024-06-01 15:22:54] [INFO ] Deduced a trap composed of 112 places in 250 ms of which 4 ms to minimize.
[2024-06-01 15:22:54] [INFO ] Deduced a trap composed of 99 places in 160 ms of which 2 ms to minimize.
[2024-06-01 15:22:55] [INFO ] Deduced a trap composed of 123 places in 227 ms of which 2 ms to minimize.
[2024-06-01 15:22:55] [INFO ] Deduced a trap composed of 115 places in 210 ms of which 2 ms to minimize.
[2024-06-01 15:22:55] [INFO ] Deduced a trap composed of 86 places in 217 ms of which 3 ms to minimize.
[2024-06-01 15:22:55] [INFO ] Deduced a trap composed of 53 places in 239 ms of which 7 ms to minimize.
[2024-06-01 15:22:56] [INFO ] Deduced a trap composed of 119 places in 225 ms of which 3 ms to minimize.
[2024-06-01 15:22:56] [INFO ] Deduced a trap composed of 91 places in 227 ms of which 2 ms to minimize.
[2024-06-01 15:22:56] [INFO ] Deduced a trap composed of 87 places in 239 ms of which 2 ms to minimize.
[2024-06-01 15:22:56] [INFO ] Deduced a trap composed of 120 places in 238 ms of which 2 ms to minimize.
[2024-06-01 15:22:57] [INFO ] Deduced a trap composed of 119 places in 234 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 574 unsolved
[2024-06-01 15:23:01] [INFO ] Deduced a trap composed of 69 places in 256 ms of which 4 ms to minimize.
[2024-06-01 15:23:01] [INFO ] Deduced a trap composed of 51 places in 226 ms of which 2 ms to minimize.
[2024-06-01 15:23:02] [INFO ] Deduced a trap composed of 56 places in 250 ms of which 3 ms to minimize.
[2024-06-01 15:23:02] [INFO ] Deduced a trap composed of 131 places in 232 ms of which 3 ms to minimize.
[2024-06-01 15:23:02] [INFO ] Deduced a trap composed of 51 places in 243 ms of which 3 ms to minimize.
[2024-06-01 15:23:02] [INFO ] Deduced a trap composed of 45 places in 237 ms of which 2 ms to minimize.
[2024-06-01 15:23:03] [INFO ] Deduced a trap composed of 41 places in 241 ms of which 2 ms to minimize.
[2024-06-01 15:23:03] [INFO ] Deduced a trap composed of 46 places in 176 ms of which 2 ms to minimize.
[2024-06-01 15:23:03] [INFO ] Deduced a trap composed of 74 places in 235 ms of which 3 ms to minimize.
[2024-06-01 15:23:03] [INFO ] Deduced a trap composed of 99 places in 251 ms of which 4 ms to minimize.
[2024-06-01 15:23:04] [INFO ] Deduced a trap composed of 105 places in 163 ms of which 3 ms to minimize.
[2024-06-01 15:23:04] [INFO ] Deduced a trap composed of 123 places in 224 ms of which 3 ms to minimize.
[2024-06-01 15:23:04] [INFO ] Deduced a trap composed of 116 places in 234 ms of which 3 ms to minimize.
[2024-06-01 15:23:04] [INFO ] Deduced a trap composed of 95 places in 234 ms of which 3 ms to minimize.
[2024-06-01 15:23:05] [INFO ] Deduced a trap composed of 58 places in 231 ms of which 3 ms to minimize.
[2024-06-01 15:23:05] [INFO ] Deduced a trap composed of 127 places in 233 ms of which 2 ms to minimize.
[2024-06-01 15:23:05] [INFO ] Deduced a trap composed of 84 places in 224 ms of which 2 ms to minimize.
[2024-06-01 15:23:05] [INFO ] Deduced a trap composed of 112 places in 222 ms of which 3 ms to minimize.
[2024-06-01 15:23:06] [INFO ] Deduced a trap composed of 99 places in 228 ms of which 3 ms to minimize.
[2024-06-01 15:23:06] [INFO ] Deduced a trap composed of 44 places in 222 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 574 unsolved
[2024-06-01 15:23:07] [INFO ] Deduced a trap composed of 101 places in 219 ms of which 2 ms to minimize.
[2024-06-01 15:23:07] [INFO ] Deduced a trap composed of 91 places in 213 ms of which 2 ms to minimize.
[2024-06-01 15:23:07] [INFO ] Deduced a trap composed of 83 places in 214 ms of which 3 ms to minimize.
[2024-06-01 15:23:08] [INFO ] Deduced a trap composed of 83 places in 228 ms of which 3 ms to minimize.
[2024-06-01 15:23:08] [INFO ] Deduced a trap composed of 110 places in 241 ms of which 2 ms to minimize.
[2024-06-01 15:23:08] [INFO ] Deduced a trap composed of 87 places in 247 ms of which 3 ms to minimize.
[2024-06-01 15:23:08] [INFO ] Deduced a trap composed of 134 places in 244 ms of which 3 ms to minimize.
[2024-06-01 15:23:09] [INFO ] Deduced a trap composed of 93 places in 163 ms of which 2 ms to minimize.
[2024-06-01 15:23:09] [INFO ] Deduced a trap composed of 80 places in 263 ms of which 4 ms to minimize.
[2024-06-01 15:23:09] [INFO ] Deduced a trap composed of 58 places in 224 ms of which 2 ms to minimize.
[2024-06-01 15:23:09] [INFO ] Deduced a trap composed of 97 places in 248 ms of which 4 ms to minimize.
[2024-06-01 15:23:10] [INFO ] Deduced a trap composed of 104 places in 298 ms of which 3 ms to minimize.
[2024-06-01 15:23:10] [INFO ] Deduced a trap composed of 86 places in 256 ms of which 4 ms to minimize.
[2024-06-01 15:23:10] [INFO ] Deduced a trap composed of 108 places in 243 ms of which 4 ms to minimize.
[2024-06-01 15:23:11] [INFO ] Deduced a trap composed of 122 places in 301 ms of which 4 ms to minimize.
[2024-06-01 15:23:11] [INFO ] Deduced a trap composed of 87 places in 283 ms of which 3 ms to minimize.
[2024-06-01 15:23:11] [INFO ] Deduced a trap composed of 96 places in 291 ms of which 4 ms to minimize.
SMT process timed out in 31832ms, After SMT, problems are : Problem set: 0 solved, 574 unsolved
Search for dead transitions found 0 dead transitions in 31881ms
Starting structural reductions in LTL mode, iteration 1 : 209/229 places, 580/600 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33647 ms. Remains : 209/229 places, 580/600 transitions.
Support contains 93 out of 209 places after structural reductions.
[2024-06-01 15:23:12] [INFO ] Flatten gal took : 180 ms
[2024-06-01 15:23:12] [INFO ] Flatten gal took : 65 ms
[2024-06-01 15:23:12] [INFO ] Input system was already deterministic with 580 transitions.
RANDOM walk for 40000 steps (8 resets) in 3942 ms. (10 steps per ms) remains 34/97 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 87 ms. (45 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 67 ms. (58 steps per ms) remains 28/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 77 ms. (51 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 24/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 23/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 21/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 18/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 13/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4001 steps (8 resets) in 20 ms. (190 steps per ms) remains 13/13 properties
[2024-06-01 15:23:14] [INFO ] Invariant cache hit.
[2024-06-01 15:23:14] [INFO ] State equation strengthened by 30 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem AtomicPropp79 is UNSAT
At refinement iteration 1 (OVERLAPS) 170/206 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 4/11 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 12 unsolved
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp40 is UNSAT
At refinement iteration 4 (OVERLAPS) 3/209 variables, 4/15 constraints. Problems are: Problem set: 3 solved, 10 unsolved
[2024-06-01 15:23:14] [INFO ] Deduced a trap composed of 105 places in 273 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 1/16 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 0/16 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 580/789 variables, 209/225 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/789 variables, 30/255 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/789 variables, 0/255 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 0/789 variables, 0/255 constraints. Problems are: Problem set: 3 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 789/789 variables, and 255 constraints, problems are : Problem set: 3 solved, 10 unsolved in 1506 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 209/209 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 10 unsolved
Problem AtomicPropp62 is UNSAT
At refinement iteration 1 (OVERLAPS) 179/205 variables, 7/7 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 3/10 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/10 constraints. Problems are: Problem set: 4 solved, 9 unsolved
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp58 is UNSAT
At refinement iteration 4 (OVERLAPS) 4/209 variables, 5/15 constraints. Problems are: Problem set: 7 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 1/16 constraints. Problems are: Problem set: 7 solved, 6 unsolved
[2024-06-01 15:23:16] [INFO ] Deduced a trap composed of 98 places in 164 ms of which 3 ms to minimize.
[2024-06-01 15:23:16] [INFO ] Deduced a trap composed of 77 places in 158 ms of which 2 ms to minimize.
[2024-06-01 15:23:16] [INFO ] Deduced a trap composed of 84 places in 182 ms of which 4 ms to minimize.
[2024-06-01 15:23:16] [INFO ] Deduced a trap composed of 83 places in 238 ms of which 4 ms to minimize.
[2024-06-01 15:23:16] [INFO ] Deduced a trap composed of 101 places in 214 ms of which 2 ms to minimize.
[2024-06-01 15:23:17] [INFO ] Deduced a trap composed of 84 places in 262 ms of which 2 ms to minimize.
[2024-06-01 15:23:17] [INFO ] Deduced a trap composed of 138 places in 180 ms of which 4 ms to minimize.
[2024-06-01 15:23:17] [INFO ] Deduced a trap composed of 85 places in 328 ms of which 4 ms to minimize.
[2024-06-01 15:23:18] [INFO ] Deduced a trap composed of 94 places in 292 ms of which 3 ms to minimize.
[2024-06-01 15:23:18] [INFO ] Deduced a trap composed of 87 places in 277 ms of which 4 ms to minimize.
[2024-06-01 15:23:18] [INFO ] Deduced a trap composed of 133 places in 243 ms of which 4 ms to minimize.
[2024-06-01 15:23:18] [INFO ] Deduced a trap composed of 78 places in 305 ms of which 4 ms to minimize.
[2024-06-01 15:23:19] [INFO ] Deduced a trap composed of 74 places in 322 ms of which 3 ms to minimize.
[2024-06-01 15:23:19] [INFO ] Deduced a trap composed of 68 places in 308 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 14/30 constraints. Problems are: Problem set: 7 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 0/30 constraints. Problems are: Problem set: 7 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 580/789 variables, 209/239 constraints. Problems are: Problem set: 7 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/789 variables, 30/269 constraints. Problems are: Problem set: 7 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/789 variables, 6/275 constraints. Problems are: Problem set: 7 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 789/789 variables, and 275 constraints, problems are : Problem set: 7 solved, 6 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 209/209 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 6/13 constraints, Known Traps: 15/15 constraints]
After SMT, in 6610ms problems are : Problem set: 7 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 15 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 580/580 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 0 place count 209 transition count 551
Deduced a syphon composed of 29 places in 2 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 58 place count 180 transition count 551
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 89 place count 149 transition count 300
Iterating global reduction 0 with 31 rules applied. Total rules applied 120 place count 149 transition count 300
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 122 place count 148 transition count 299
Applied a total of 122 rules in 113 ms. Remains 148 /209 variables (removed 61) and now considering 299/580 (removed 281) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 148/209 places, 299/580 transitions.
RANDOM walk for 40000 steps (8 resets) in 596 ms. (67 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 155 ms. (256 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 245 ms. (162 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 107 ms. (370 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 133 ms. (298 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 146 ms. (272 steps per ms) remains 3/3 properties
// Phase 1: matrix 299 rows 148 cols
[2024-06-01 15:23:21] [INFO ] Computed 15 invariants in 13 ms
[2024-06-01 15:23:21] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 41/45 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 30/75 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 61/136 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 12/148 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 15:23:21] [INFO ] Deduced a trap composed of 58 places in 136 ms of which 2 ms to minimize.
[2024-06-01 15:23:21] [INFO ] Deduced a trap composed of 73 places in 152 ms of which 2 ms to minimize.
[2024-06-01 15:23:21] [INFO ] Deduced a trap composed of 53 places in 147 ms of which 2 ms to minimize.
[2024-06-01 15:23:22] [INFO ] Deduced a trap composed of 34 places in 140 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/148 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 299/447 variables, 148/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/447 variables, 30/197 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/447 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/447 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 447/447 variables, and 197 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1078 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 148/148 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 41/45 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 30/75 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 61/136 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 12/148 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/148 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 299/447 variables, 148/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/447 variables, 30/197 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/447 variables, 3/200 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/447 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/447 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 447/447 variables, and 200 constraints, problems are : Problem set: 0 solved, 3 unsolved in 516 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 148/148 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints]
After SMT, in 1626ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 5137 steps, including 168 resets, run visited all 1 properties in 26 ms. (steps per millisecond=197 )
Parikh walk visited 3 properties in 549 ms.
Successfully simplified 7 atomic propositions for a total of 16 simplifications.
FORMULA Anderson-PT-06-CTLFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 15:23:23] [INFO ] Flatten gal took : 73 ms
[2024-06-01 15:23:23] [INFO ] Flatten gal took : 76 ms
[2024-06-01 15:23:23] [INFO ] Input system was already deterministic with 580 transitions.
Support contains 84 out of 209 places (down from 85) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 580/580 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 172 transition count 263
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 172 transition count 263
Applied a total of 74 rules in 14 ms. Remains 172 /209 variables (removed 37) and now considering 263/580 (removed 317) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 172/209 places, 263/580 transitions.
[2024-06-01 15:23:23] [INFO ] Flatten gal took : 22 ms
[2024-06-01 15:23:23] [INFO ] Flatten gal took : 22 ms
[2024-06-01 15:23:23] [INFO ] Input system was already deterministic with 263 transitions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 580/580 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 171 transition count 252
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 171 transition count 252
Applied a total of 76 rules in 12 ms. Remains 171 /209 variables (removed 38) and now considering 252/580 (removed 328) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 171/209 places, 252/580 transitions.
[2024-06-01 15:23:24] [INFO ] Flatten gal took : 18 ms
[2024-06-01 15:23:24] [INFO ] Flatten gal took : 19 ms
[2024-06-01 15:23:24] [INFO ] Input system was already deterministic with 252 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 209/209 places, 580/580 transitions.
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 28 Pre rules applied. Total rules applied 0 place count 209 transition count 552
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 0 with 56 rules applied. Total rules applied 56 place count 181 transition count 552
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 94 place count 143 transition count 224
Iterating global reduction 0 with 38 rules applied. Total rules applied 132 place count 143 transition count 224
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 134 place count 142 transition count 223
Applied a total of 134 rules in 45 ms. Remains 142 /209 variables (removed 67) and now considering 223/580 (removed 357) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 45 ms. Remains : 142/209 places, 223/580 transitions.
[2024-06-01 15:23:24] [INFO ] Flatten gal took : 16 ms
[2024-06-01 15:23:24] [INFO ] Flatten gal took : 18 ms
[2024-06-01 15:23:24] [INFO ] Input system was already deterministic with 223 transitions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 580/580 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 173 transition count 284
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 173 transition count 284
Applied a total of 72 rules in 12 ms. Remains 173 /209 variables (removed 36) and now considering 284/580 (removed 296) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 173/209 places, 284/580 transitions.
[2024-06-01 15:23:24] [INFO ] Flatten gal took : 20 ms
[2024-06-01 15:23:24] [INFO ] Flatten gal took : 21 ms
[2024-06-01 15:23:24] [INFO ] Input system was already deterministic with 284 transitions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 580/580 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 171 transition count 262
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 171 transition count 262
Applied a total of 76 rules in 11 ms. Remains 171 /209 variables (removed 38) and now considering 262/580 (removed 318) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 171/209 places, 262/580 transitions.
[2024-06-01 15:23:24] [INFO ] Flatten gal took : 19 ms
[2024-06-01 15:23:24] [INFO ] Flatten gal took : 19 ms
[2024-06-01 15:23:24] [INFO ] Input system was already deterministic with 262 transitions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 580/580 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 174 transition count 285
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 174 transition count 285
Applied a total of 70 rules in 8 ms. Remains 174 /209 variables (removed 35) and now considering 285/580 (removed 295) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 174/209 places, 285/580 transitions.
[2024-06-01 15:23:24] [INFO ] Flatten gal took : 13 ms
[2024-06-01 15:23:24] [INFO ] Flatten gal took : 14 ms
[2024-06-01 15:23:24] [INFO ] Input system was already deterministic with 285 transitions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 580/580 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 174 transition count 295
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 174 transition count 295
Applied a total of 70 rules in 7 ms. Remains 174 /209 variables (removed 35) and now considering 295/580 (removed 285) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 174/209 places, 295/580 transitions.
[2024-06-01 15:23:24] [INFO ] Flatten gal took : 12 ms
[2024-06-01 15:23:24] [INFO ] Flatten gal took : 13 ms
[2024-06-01 15:23:24] [INFO ] Input system was already deterministic with 295 transitions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 580/580 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 176 transition count 307
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 176 transition count 307
Applied a total of 66 rules in 8 ms. Remains 176 /209 variables (removed 33) and now considering 307/580 (removed 273) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 176/209 places, 307/580 transitions.
[2024-06-01 15:23:24] [INFO ] Flatten gal took : 12 ms
[2024-06-01 15:23:24] [INFO ] Flatten gal took : 13 ms
[2024-06-01 15:23:24] [INFO ] Input system was already deterministic with 307 transitions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 580/580 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 170 transition count 251
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 170 transition count 251
Applied a total of 78 rules in 7 ms. Remains 170 /209 variables (removed 39) and now considering 251/580 (removed 329) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 170/209 places, 251/580 transitions.
[2024-06-01 15:23:24] [INFO ] Flatten gal took : 10 ms
[2024-06-01 15:23:24] [INFO ] Flatten gal took : 11 ms
[2024-06-01 15:23:24] [INFO ] Input system was already deterministic with 251 transitions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 580/580 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 173 transition count 274
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 173 transition count 274
Applied a total of 72 rules in 7 ms. Remains 173 /209 variables (removed 36) and now considering 274/580 (removed 306) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 173/209 places, 274/580 transitions.
[2024-06-01 15:23:24] [INFO ] Flatten gal took : 11 ms
[2024-06-01 15:23:24] [INFO ] Flatten gal took : 11 ms
[2024-06-01 15:23:24] [INFO ] Input system was already deterministic with 274 transitions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 580/580 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 172 transition count 273
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 172 transition count 273
Applied a total of 74 rules in 8 ms. Remains 172 /209 variables (removed 37) and now considering 273/580 (removed 307) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 172/209 places, 273/580 transitions.
[2024-06-01 15:23:24] [INFO ] Flatten gal took : 10 ms
[2024-06-01 15:23:24] [INFO ] Flatten gal took : 11 ms
[2024-06-01 15:23:24] [INFO ] Input system was already deterministic with 273 transitions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 580/580 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 179 transition count 340
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 179 transition count 340
Applied a total of 60 rules in 9 ms. Remains 179 /209 variables (removed 30) and now considering 340/580 (removed 240) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 179/209 places, 340/580 transitions.
[2024-06-01 15:23:24] [INFO ] Flatten gal took : 13 ms
[2024-06-01 15:23:24] [INFO ] Flatten gal took : 14 ms
[2024-06-01 15:23:24] [INFO ] Input system was already deterministic with 340 transitions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 580/580 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 172 transition count 273
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 172 transition count 273
Applied a total of 74 rules in 9 ms. Remains 172 /209 variables (removed 37) and now considering 273/580 (removed 307) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 172/209 places, 273/580 transitions.
[2024-06-01 15:23:24] [INFO ] Flatten gal took : 10 ms
[2024-06-01 15:23:24] [INFO ] Flatten gal took : 11 ms
[2024-06-01 15:23:24] [INFO ] Input system was already deterministic with 273 transitions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 580/580 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 179 transition count 330
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 179 transition count 330
Applied a total of 60 rules in 8 ms. Remains 179 /209 variables (removed 30) and now considering 330/580 (removed 250) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 179/209 places, 330/580 transitions.
[2024-06-01 15:23:24] [INFO ] Flatten gal took : 11 ms
[2024-06-01 15:23:25] [INFO ] Flatten gal took : 13 ms
[2024-06-01 15:23:25] [INFO ] Input system was already deterministic with 330 transitions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 580/580 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 174 transition count 295
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 174 transition count 295
Applied a total of 70 rules in 10 ms. Remains 174 /209 variables (removed 35) and now considering 295/580 (removed 285) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 174/209 places, 295/580 transitions.
[2024-06-01 15:23:25] [INFO ] Flatten gal took : 17 ms
[2024-06-01 15:23:25] [INFO ] Flatten gal took : 11 ms
[2024-06-01 15:23:25] [INFO ] Input system was already deterministic with 295 transitions.
[2024-06-01 15:23:25] [INFO ] Flatten gal took : 23 ms
[2024-06-01 15:23:25] [INFO ] Flatten gal took : 24 ms
[2024-06-01 15:23:25] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 6 ms.
[2024-06-01 15:23:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 209 places, 580 transitions and 2240 arcs took 5 ms.
Total runtime 47877 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : Anderson-PT-06-CTLFireability-2024-00
Could not compute solution for formula : Anderson-PT-06-CTLFireability-2024-01
Could not compute solution for formula : Anderson-PT-06-CTLFireability-2024-02
Could not compute solution for formula : Anderson-PT-06-CTLFireability-2024-03
Could not compute solution for formula : Anderson-PT-06-CTLFireability-2024-04
Could not compute solution for formula : Anderson-PT-06-CTLFireability-2024-05
Could not compute solution for formula : Anderson-PT-06-CTLFireability-2024-06
Could not compute solution for formula : Anderson-PT-06-CTLFireability-2024-07
Could not compute solution for formula : Anderson-PT-06-CTLFireability-2024-08
Could not compute solution for formula : Anderson-PT-06-CTLFireability-2024-09
Could not compute solution for formula : Anderson-PT-06-CTLFireability-2024-10
Could not compute solution for formula : Anderson-PT-06-CTLFireability-2023-12
Could not compute solution for formula : Anderson-PT-06-CTLFireability-2023-13
Could not compute solution for formula : Anderson-PT-06-CTLFireability-2023-14
Could not compute solution for formula : Anderson-PT-06-CTLFireability-2023-15
BK_STOP 1717255405848
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name Anderson-PT-06-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/824/ctl_0_
ctl formula name Anderson-PT-06-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/824/ctl_1_
ctl formula name Anderson-PT-06-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/824/ctl_2_
ctl formula name Anderson-PT-06-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/824/ctl_3_
ctl formula name Anderson-PT-06-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/824/ctl_4_
ctl formula name Anderson-PT-06-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/824/ctl_5_
ctl formula name Anderson-PT-06-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/824/ctl_6_
ctl formula name Anderson-PT-06-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/824/ctl_7_
ctl formula name Anderson-PT-06-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/824/ctl_8_
ctl formula name Anderson-PT-06-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/824/ctl_9_
ctl formula name Anderson-PT-06-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/824/ctl_10_
ctl formula name Anderson-PT-06-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/824/ctl_11_
ctl formula name Anderson-PT-06-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/824/ctl_12_
ctl formula name Anderson-PT-06-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/824/ctl_13_
ctl formula name Anderson-PT-06-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/824/ctl_14_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Anderson-PT-06"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is Anderson-PT-06, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r464-smll-171620118300330"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-06.tgz
mv Anderson-PT-06 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;