About the Execution of GreatSPN+red for Anderson-PT-07
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16207.088 | 2408639.00 | 8406532.00 | 4027.60 | TF??T?F?F?FFTT?? | 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.r003-smll-171620117500338.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 greatspnxred
Input is Anderson-PT-07, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r003-smll-171620117500338
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 920K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 17:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 15:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K Apr 12 15:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 15:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 12 15:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 461K 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-07-CTLFireability-2024-00
FORMULA_NAME Anderson-PT-07-CTLFireability-2024-01
FORMULA_NAME Anderson-PT-07-CTLFireability-2024-02
FORMULA_NAME Anderson-PT-07-CTLFireability-2024-03
FORMULA_NAME Anderson-PT-07-CTLFireability-2024-04
FORMULA_NAME Anderson-PT-07-CTLFireability-2024-05
FORMULA_NAME Anderson-PT-07-CTLFireability-2024-06
FORMULA_NAME Anderson-PT-07-CTLFireability-2024-07
FORMULA_NAME Anderson-PT-07-CTLFireability-2024-08
FORMULA_NAME Anderson-PT-07-CTLFireability-2024-09
FORMULA_NAME Anderson-PT-07-CTLFireability-2024-10
FORMULA_NAME Anderson-PT-07-CTLFireability-2024-11
FORMULA_NAME Anderson-PT-07-CTLFireability-2023-12
FORMULA_NAME Anderson-PT-07-CTLFireability-2023-13
FORMULA_NAME Anderson-PT-07-CTLFireability-2023-14
FORMULA_NAME Anderson-PT-07-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1716429930512
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 02:05:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 02:05:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 02:05:33] [INFO ] Load time of PNML (sax parser for PT used): 292 ms
[2024-05-23 02:05:33] [INFO ] Transformed 309 places.
[2024-05-23 02:05:33] [INFO ] Transformed 917 transitions.
[2024-05-23 02:05:33] [INFO ] Found NUPN structural information;
[2024-05-23 02:05:33] [INFO ] Parsed PT model containing 309 places and 917 transitions and 3500 arcs in 566 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 32 ms.
Support contains 90 out of 309 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 917/917 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 272 transition count 844
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 272 transition count 844
Applied a total of 74 rules in 203 ms. Remains 272 /309 variables (removed 37) and now considering 844/917 (removed 73) transitions.
// Phase 1: matrix 844 rows 272 cols
[2024-05-23 02:05:34] [INFO ] Computed 17 invariants in 78 ms
[2024-05-23 02:05:35] [INFO ] Implicit Places using invariants in 873 ms returned []
[2024-05-23 02:05:35] [INFO ] Invariant cache hit.
[2024-05-23 02:05:35] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-23 02:05:36] [INFO ] Implicit Places using invariants and state equation in 1598 ms returned []
Implicit Place search using SMT with State Equation took 2563 ms to find 0 implicit places.
Running 837 sub problems to find dead transitions.
[2024-05-23 02:05:36] [INFO ] Invariant cache hit.
[2024-05-23 02:05:36] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 837 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 837 unsolved
[2024-05-23 02:05:48] [INFO ] Deduced a trap composed of 82 places in 570 ms of which 50 ms to minimize.
[2024-05-23 02:05:49] [INFO ] Deduced a trap composed of 99 places in 550 ms of which 36 ms to minimize.
[2024-05-23 02:05:50] [INFO ] Deduced a trap composed of 132 places in 432 ms of which 5 ms to minimize.
[2024-05-23 02:05:50] [INFO ] Deduced a trap composed of 102 places in 364 ms of which 4 ms to minimize.
[2024-05-23 02:05:51] [INFO ] Deduced a trap composed of 104 places in 378 ms of which 4 ms to minimize.
[2024-05-23 02:05:51] [INFO ] Deduced a trap composed of 168 places in 291 ms of which 3 ms to minimize.
[2024-05-23 02:05:51] [INFO ] Deduced a trap composed of 139 places in 402 ms of which 5 ms to minimize.
[2024-05-23 02:05:52] [INFO ] Deduced a trap composed of 137 places in 305 ms of which 5 ms to minimize.
[2024-05-23 02:05:52] [INFO ] Deduced a trap composed of 135 places in 273 ms of which 3 ms to minimize.
[2024-05-23 02:05:52] [INFO ] Deduced a trap composed of 165 places in 268 ms of which 3 ms to minimize.
[2024-05-23 02:05:53] [INFO ] Deduced a trap composed of 165 places in 327 ms of which 5 ms to minimize.
[2024-05-23 02:05:53] [INFO ] Deduced a trap composed of 147 places in 447 ms of which 5 ms to minimize.
[2024-05-23 02:05:53] [INFO ] Deduced a trap composed of 124 places in 393 ms of which 5 ms to minimize.
[2024-05-23 02:05:54] [INFO ] Deduced a trap composed of 140 places in 400 ms of which 5 ms to minimize.
[2024-05-23 02:05:54] [INFO ] Deduced a trap composed of 53 places in 256 ms of which 3 ms to minimize.
[2024-05-23 02:05:54] [INFO ] Deduced a trap composed of 131 places in 266 ms of which 5 ms to minimize.
[2024-05-23 02:05:55] [INFO ] Deduced a trap composed of 156 places in 393 ms of which 5 ms to minimize.
[2024-05-23 02:05:55] [INFO ] Deduced a trap composed of 138 places in 419 ms of which 5 ms to minimize.
[2024-05-23 02:05:56] [INFO ] Deduced a trap composed of 130 places in 407 ms of which 5 ms to minimize.
[2024-05-23 02:05:56] [INFO ] Deduced a trap composed of 149 places in 409 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 837 unsolved
[2024-05-23 02:05:58] [INFO ] Deduced a trap composed of 106 places in 446 ms of which 5 ms to minimize.
[2024-05-23 02:05:58] [INFO ] Deduced a trap composed of 101 places in 352 ms of which 4 ms to minimize.
[2024-05-23 02:05:59] [INFO ] Deduced a trap composed of 115 places in 429 ms of which 5 ms to minimize.
[2024-05-23 02:05:59] [INFO ] Deduced a trap composed of 99 places in 443 ms of which 4 ms to minimize.
[2024-05-23 02:06:00] [INFO ] Deduced a trap composed of 105 places in 421 ms of which 4 ms to minimize.
[2024-05-23 02:06:00] [INFO ] Deduced a trap composed of 140 places in 431 ms of which 5 ms to minimize.
[2024-05-23 02:06:00] [INFO ] Deduced a trap composed of 46 places in 417 ms of which 4 ms to minimize.
[2024-05-23 02:06:01] [INFO ] Deduced a trap composed of 96 places in 423 ms of which 5 ms to minimize.
[2024-05-23 02:06:01] [INFO ] Deduced a trap composed of 138 places in 405 ms of which 4 ms to minimize.
[2024-05-23 02:06:02] [INFO ] Deduced a trap composed of 62 places in 439 ms of which 5 ms to minimize.
[2024-05-23 02:06:02] [INFO ] Deduced a trap composed of 142 places in 436 ms of which 5 ms to minimize.
[2024-05-23 02:06:03] [INFO ] Deduced a trap composed of 128 places in 434 ms of which 5 ms to minimize.
[2024-05-23 02:06:03] [INFO ] Deduced a trap composed of 152 places in 448 ms of which 5 ms to minimize.
[2024-05-23 02:06:04] [INFO ] Deduced a trap composed of 109 places in 435 ms of which 5 ms to minimize.
[2024-05-23 02:06:04] [INFO ] Deduced a trap composed of 77 places in 380 ms of which 4 ms to minimize.
[2024-05-23 02:06:05] [INFO ] Deduced a trap composed of 108 places in 429 ms of which 5 ms to minimize.
[2024-05-23 02:06:05] [INFO ] Deduced a trap composed of 96 places in 448 ms of which 5 ms to minimize.
[2024-05-23 02:06:06] [INFO ] Deduced a trap composed of 95 places in 464 ms of which 5 ms to minimize.
[2024-05-23 02:06:06] [INFO ] Deduced a trap composed of 98 places in 483 ms of which 5 ms to minimize.
[2024-05-23 02:06:07] [INFO ] Deduced a trap composed of 85 places in 436 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 837 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 272/1116 variables, and 57 constraints, problems are : Problem set: 0 solved, 837 unsolved in 30083 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/272 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 837/837 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 837 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 837 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 837 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 40/57 constraints. Problems are: Problem set: 0 solved, 837 unsolved
[2024-05-23 02:06:13] [INFO ] Deduced a trap composed of 172 places in 417 ms of which 5 ms to minimize.
[2024-05-23 02:06:13] [INFO ] Deduced a trap composed of 125 places in 416 ms of which 5 ms to minimize.
[2024-05-23 02:06:14] [INFO ] Deduced a trap composed of 179 places in 382 ms of which 4 ms to minimize.
[2024-05-23 02:06:14] [INFO ] Deduced a trap composed of 170 places in 371 ms of which 4 ms to minimize.
[2024-05-23 02:06:15] [INFO ] Deduced a trap composed of 104 places in 368 ms of which 4 ms to minimize.
[2024-05-23 02:06:15] [INFO ] Deduced a trap composed of 79 places in 381 ms of which 5 ms to minimize.
[2024-05-23 02:06:15] [INFO ] Deduced a trap composed of 150 places in 402 ms of which 5 ms to minimize.
[2024-05-23 02:06:16] [INFO ] Deduced a trap composed of 175 places in 395 ms of which 5 ms to minimize.
[2024-05-23 02:06:16] [INFO ] Deduced a trap composed of 152 places in 370 ms of which 4 ms to minimize.
[2024-05-23 02:06:17] [INFO ] Deduced a trap composed of 166 places in 424 ms of which 5 ms to minimize.
[2024-05-23 02:06:17] [INFO ] Deduced a trap composed of 148 places in 434 ms of which 5 ms to minimize.
[2024-05-23 02:06:18] [INFO ] Deduced a trap composed of 113 places in 408 ms of which 5 ms to minimize.
[2024-05-23 02:06:18] [INFO ] Deduced a trap composed of 134 places in 409 ms of which 5 ms to minimize.
[2024-05-23 02:06:18] [INFO ] Deduced a trap composed of 119 places in 409 ms of which 5 ms to minimize.
[2024-05-23 02:06:19] [INFO ] Deduced a trap composed of 113 places in 393 ms of which 5 ms to minimize.
[2024-05-23 02:06:19] [INFO ] Deduced a trap composed of 136 places in 414 ms of which 4 ms to minimize.
[2024-05-23 02:06:20] [INFO ] Deduced a trap composed of 171 places in 423 ms of which 7 ms to minimize.
[2024-05-23 02:06:20] [INFO ] Deduced a trap composed of 71 places in 416 ms of which 4 ms to minimize.
[2024-05-23 02:06:21] [INFO ] Deduced a trap composed of 174 places in 424 ms of which 5 ms to minimize.
[2024-05-23 02:06:21] [INFO ] Deduced a trap composed of 144 places in 404 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 837 unsolved
[2024-05-23 02:06:24] [INFO ] Deduced a trap composed of 70 places in 195 ms of which 3 ms to minimize.
[2024-05-23 02:06:24] [INFO ] Deduced a trap composed of 172 places in 311 ms of which 4 ms to minimize.
[2024-05-23 02:06:24] [INFO ] Deduced a trap composed of 152 places in 412 ms of which 5 ms to minimize.
[2024-05-23 02:06:25] [INFO ] Deduced a trap composed of 175 places in 412 ms of which 5 ms to minimize.
[2024-05-23 02:06:25] [INFO ] Deduced a trap composed of 151 places in 403 ms of which 4 ms to minimize.
[2024-05-23 02:06:26] [INFO ] Deduced a trap composed of 136 places in 404 ms of which 4 ms to minimize.
[2024-05-23 02:06:26] [INFO ] Deduced a trap composed of 137 places in 411 ms of which 4 ms to minimize.
[2024-05-23 02:06:27] [INFO ] Deduced a trap composed of 129 places in 406 ms of which 4 ms to minimize.
[2024-05-23 02:06:27] [INFO ] Deduced a trap composed of 148 places in 410 ms of which 4 ms to minimize.
[2024-05-23 02:06:27] [INFO ] Deduced a trap composed of 91 places in 415 ms of which 4 ms to minimize.
[2024-05-23 02:06:28] [INFO ] Deduced a trap composed of 93 places in 415 ms of which 4 ms to minimize.
[2024-05-23 02:06:28] [INFO ] Deduced a trap composed of 108 places in 407 ms of which 4 ms to minimize.
[2024-05-23 02:06:29] [INFO ] Deduced a trap composed of 110 places in 405 ms of which 5 ms to minimize.
[2024-05-23 02:06:29] [INFO ] Deduced a trap composed of 178 places in 412 ms of which 4 ms to minimize.
[2024-05-23 02:06:30] [INFO ] Deduced a trap composed of 75 places in 399 ms of which 4 ms to minimize.
[2024-05-23 02:06:30] [INFO ] Deduced a trap composed of 129 places in 404 ms of which 4 ms to minimize.
[2024-05-23 02:06:31] [INFO ] Deduced a trap composed of 67 places in 458 ms of which 5 ms to minimize.
[2024-05-23 02:06:31] [INFO ] Deduced a trap composed of 179 places in 441 ms of which 4 ms to minimize.
[2024-05-23 02:06:32] [INFO ] Deduced a trap composed of 153 places in 426 ms of which 5 ms to minimize.
[2024-05-23 02:06:32] [INFO ] Deduced a trap composed of 127 places in 437 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 837 unsolved
[2024-05-23 02:06:35] [INFO ] Deduced a trap composed of 83 places in 228 ms of which 2 ms to minimize.
[2024-05-23 02:06:35] [INFO ] Deduced a trap composed of 84 places in 237 ms of which 5 ms to minimize.
[2024-05-23 02:06:35] [INFO ] Deduced a trap composed of 85 places in 401 ms of which 5 ms to minimize.
[2024-05-23 02:06:36] [INFO ] Deduced a trap composed of 87 places in 388 ms of which 4 ms to minimize.
[2024-05-23 02:06:36] [INFO ] Deduced a trap composed of 109 places in 393 ms of which 4 ms to minimize.
[2024-05-23 02:06:37] [INFO ] Deduced a trap composed of 120 places in 414 ms of which 4 ms to minimize.
[2024-05-23 02:06:37] [INFO ] Deduced a trap composed of 129 places in 415 ms of which 5 ms to minimize.
[2024-05-23 02:06:37] [INFO ] Deduced a trap composed of 129 places in 406 ms of which 5 ms to minimize.
[2024-05-23 02:06:38] [INFO ] Deduced a trap composed of 95 places in 394 ms of which 4 ms to minimize.
[2024-05-23 02:06:38] [INFO ] Deduced a trap composed of 63 places in 391 ms of which 5 ms to minimize.
[2024-05-23 02:06:39] [INFO ] Deduced a trap composed of 121 places in 428 ms of which 5 ms to minimize.
[2024-05-23 02:06:39] [INFO ] Deduced a trap composed of 67 places in 435 ms of which 4 ms to minimize.
SMT process timed out in 63212ms, After SMT, problems are : Problem set: 0 solved, 837 unsolved
Search for dead transitions found 0 dead transitions in 63286ms
Starting structural reductions in LTL mode, iteration 1 : 272/309 places, 844/917 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66109 ms. Remains : 272/309 places, 844/917 transitions.
Support contains 90 out of 272 places after structural reductions.
[2024-05-23 02:06:40] [INFO ] Flatten gal took : 251 ms
[2024-05-23 02:06:40] [INFO ] Flatten gal took : 134 ms
[2024-05-23 02:06:41] [INFO ] Input system was already deterministic with 844 transitions.
Support contains 89 out of 272 places (down from 90) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2370 ms. (16 steps per ms) remains 37/88 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 34/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 56 ms. (70 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 33/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 30/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 29/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 25/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 24/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 21/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 15/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 15/15 properties
[2024-05-23 02:06:42] [INFO ] Invariant cache hit.
[2024-05-23 02:06:42] [INFO ] State equation strengthened by 42 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp3 is UNSAT
At refinement iteration 1 (OVERLAPS) 233/268 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 4/12 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 14 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp65 is UNSAT
At refinement iteration 4 (OVERLAPS) 4/272 variables, 5/17 constraints. Problems are: Problem set: 4 solved, 11 unsolved
[2024-05-23 02:06:44] [INFO ] Deduced a trap composed of 141 places in 713 ms of which 3 ms to minimize.
[2024-05-23 02:06:44] [INFO ] Deduced a trap composed of 78 places in 249 ms of which 3 ms to minimize.
[2024-05-23 02:06:44] [INFO ] Deduced a trap composed of 81 places in 267 ms of which 3 ms to minimize.
[2024-05-23 02:06:44] [INFO ] Deduced a trap composed of 109 places in 230 ms of which 5 ms to minimize.
[2024-05-23 02:06:45] [INFO ] Deduced a trap composed of 112 places in 385 ms of which 4 ms to minimize.
[2024-05-23 02:06:45] [INFO ] Deduced a trap composed of 99 places in 239 ms of which 3 ms to minimize.
[2024-05-23 02:06:45] [INFO ] Deduced a trap composed of 114 places in 255 ms of which 3 ms to minimize.
[2024-05-23 02:06:46] [INFO ] Deduced a trap composed of 97 places in 333 ms of which 5 ms to minimize.
[2024-05-23 02:06:46] [INFO ] Deduced a trap composed of 130 places in 443 ms of which 5 ms to minimize.
[2024-05-23 02:06:47] [INFO ] Deduced a trap composed of 106 places in 450 ms of which 4 ms to minimize.
[2024-05-23 02:06:47] [INFO ] Deduced a trap composed of 97 places in 398 ms of which 4 ms to minimize.
[2024-05-23 02:06:47] [INFO ] Deduced a trap composed of 109 places in 366 ms of which 3 ms to minimize.
SMT process timed out in 5249ms, After SMT, problems are : Problem set: 4 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 28 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 844/844 transitions.
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 40 Pre rules applied. Total rules applied 0 place count 272 transition count 804
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 0 with 80 rules applied. Total rules applied 80 place count 232 transition count 804
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 111 place count 201 transition count 485
Iterating global reduction 0 with 31 rules applied. Total rules applied 142 place count 201 transition count 485
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 144 place count 200 transition count 484
Applied a total of 144 rules in 79 ms. Remains 200 /272 variables (removed 72) and now considering 484/844 (removed 360) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 200/272 places, 484/844 transitions.
RANDOM walk for 40000 steps (8 resets) in 368 ms. (108 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 225 ms. (177 steps per ms) remains 8/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 192 ms. (207 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 226 ms. (176 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 177 ms. (224 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 114 ms. (347 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 138 ms. (287 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 263 ms. (151 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (8 resets) in 148 ms. (268 steps per ms) remains 6/6 properties
// Phase 1: matrix 484 rows 200 cols
[2024-05-23 02:06:48] [INFO ] Computed 17 invariants in 8 ms
[2024-05-23 02:06:48] [INFO ] State equation strengthened by 42 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 171/193 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 7/200 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 484/684 variables, 200/217 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/684 variables, 42/259 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/684 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/684 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 684/684 variables, and 259 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1015 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 200/200 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp25 is UNSAT
At refinement iteration 1 (OVERLAPS) 171/193 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 2/10 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp60 is UNSAT
At refinement iteration 4 (OVERLAPS) 7/200 variables, 7/17 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/17 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 484/684 variables, 200/217 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/684 variables, 42/259 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/684 variables, 3/262 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/684 variables, 0/262 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/684 variables, 0/262 constraints. Problems are: Problem set: 3 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 684/684 variables, and 262 constraints, problems are : Problem set: 3 solved, 3 unsolved in 1893 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 200/200 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 3/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 2960ms problems are : Problem set: 3 solved, 3 unsolved
Parikh walk visited 0 properties in 684 ms.
Support contains 6 out of 200 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 200/200 places, 484/484 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 200 transition count 483
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 2 place count 199 transition count 483
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 15 place count 186 transition count 314
Iterating global reduction 0 with 13 rules applied. Total rules applied 28 place count 186 transition count 314
Applied a total of 28 rules in 33 ms. Remains 186 /200 variables (removed 14) and now considering 314/484 (removed 170) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 186/200 places, 314/484 transitions.
RANDOM walk for 40000 steps (8 resets) in 208 ms. (191 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 142 ms. (279 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 273924 steps, run visited all 3 properties in 1556 ms. (steps per millisecond=176 )
Probabilistic random walk after 273924 steps, saw 161886 distinct states, run finished after 1564 ms. (steps per millisecond=175 ) properties seen :3
Successfully simplified 7 atomic propositions for a total of 16 simplifications.
[2024-05-23 02:06:54] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-23 02:06:54] [INFO ] Flatten gal took : 59 ms
FORMULA Anderson-PT-07-CTLFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 02:06:54] [INFO ] Flatten gal took : 56 ms
[2024-05-23 02:06:54] [INFO ] Input system was already deterministic with 844 transitions.
Support contains 83 out of 272 places (down from 87) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 272/272 places, 844/844 transitions.
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 42 Pre rules applied. Total rules applied 0 place count 272 transition count 802
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 0 with 84 rules applied. Total rules applied 84 place count 230 transition count 802
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 128 place count 186 transition count 326
Iterating global reduction 0 with 44 rules applied. Total rules applied 172 place count 186 transition count 326
Applied a total of 172 rules in 42 ms. Remains 186 /272 variables (removed 86) and now considering 326/844 (removed 518) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43 ms. Remains : 186/272 places, 326/844 transitions.
[2024-05-23 02:06:54] [INFO ] Flatten gal took : 16 ms
[2024-05-23 02:06:54] [INFO ] Flatten gal took : 20 ms
[2024-05-23 02:06:54] [INFO ] Input system was already deterministic with 326 transitions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 844/844 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 231 transition count 407
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 231 transition count 407
Applied a total of 82 rules in 14 ms. Remains 231 /272 variables (removed 41) and now considering 407/844 (removed 437) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 231/272 places, 407/844 transitions.
[2024-05-23 02:06:54] [INFO ] Flatten gal took : 20 ms
[2024-05-23 02:06:54] [INFO ] Flatten gal took : 32 ms
[2024-05-23 02:06:55] [INFO ] Input system was already deterministic with 407 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 272/272 places, 844/844 transitions.
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 41 Pre rules applied. Total rules applied 0 place count 272 transition count 803
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 0 with 82 rules applied. Total rules applied 82 place count 231 transition count 803
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 125 place count 188 transition count 328
Iterating global reduction 0 with 43 rules applied. Total rules applied 168 place count 188 transition count 328
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 170 place count 187 transition count 327
Applied a total of 170 rules in 49 ms. Remains 187 /272 variables (removed 85) and now considering 327/844 (removed 517) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 50 ms. Remains : 187/272 places, 327/844 transitions.
[2024-05-23 02:06:55] [INFO ] Flatten gal took : 42 ms
[2024-05-23 02:06:55] [INFO ] Flatten gal took : 17 ms
[2024-05-23 02:06:55] [INFO ] Input system was already deterministic with 327 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 272/272 places, 844/844 transitions.
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 42 Pre rules applied. Total rules applied 0 place count 272 transition count 802
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 0 with 84 rules applied. Total rules applied 84 place count 230 transition count 802
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 130 place count 184 transition count 300
Iterating global reduction 0 with 46 rules applied. Total rules applied 176 place count 184 transition count 300
Applied a total of 176 rules in 36 ms. Remains 184 /272 variables (removed 88) and now considering 300/844 (removed 544) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 37 ms. Remains : 184/272 places, 300/844 transitions.
[2024-05-23 02:06:55] [INFO ] Flatten gal took : 14 ms
[2024-05-23 02:06:55] [INFO ] Flatten gal took : 15 ms
[2024-05-23 02:06:55] [INFO ] Input system was already deterministic with 300 transitions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 844/844 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 227 transition count 355
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 227 transition count 355
Applied a total of 90 rules in 12 ms. Remains 227 /272 variables (removed 45) and now considering 355/844 (removed 489) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 227/272 places, 355/844 transitions.
[2024-05-23 02:06:55] [INFO ] Flatten gal took : 16 ms
[2024-05-23 02:06:55] [INFO ] Flatten gal took : 18 ms
[2024-05-23 02:06:55] [INFO ] Input system was already deterministic with 355 transitions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 844/844 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 225 transition count 329
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 225 transition count 329
Applied a total of 94 rules in 14 ms. Remains 225 /272 variables (removed 47) and now considering 329/844 (removed 515) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 225/272 places, 329/844 transitions.
[2024-05-23 02:06:55] [INFO ] Flatten gal took : 14 ms
[2024-05-23 02:06:55] [INFO ] Flatten gal took : 16 ms
[2024-05-23 02:06:55] [INFO ] Input system was already deterministic with 329 transitions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 844/844 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 235 transition count 447
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 235 transition count 447
Applied a total of 74 rules in 14 ms. Remains 235 /272 variables (removed 37) and now considering 447/844 (removed 397) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 235/272 places, 447/844 transitions.
[2024-05-23 02:06:55] [INFO ] Flatten gal took : 20 ms
[2024-05-23 02:06:55] [INFO ] Flatten gal took : 22 ms
[2024-05-23 02:06:55] [INFO ] Input system was already deterministic with 447 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 272/272 places, 844/844 transitions.
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 42 Pre rules applied. Total rules applied 0 place count 272 transition count 802
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 0 with 84 rules applied. Total rules applied 84 place count 230 transition count 802
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 130 place count 184 transition count 300
Iterating global reduction 0 with 46 rules applied. Total rules applied 176 place count 184 transition count 300
Applied a total of 176 rules in 26 ms. Remains 184 /272 variables (removed 88) and now considering 300/844 (removed 544) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 184/272 places, 300/844 transitions.
[2024-05-23 02:06:55] [INFO ] Flatten gal took : 14 ms
[2024-05-23 02:06:55] [INFO ] Flatten gal took : 17 ms
[2024-05-23 02:06:55] [INFO ] Input system was already deterministic with 300 transitions.
RANDOM walk for 40000 steps (8 resets) in 151 ms. (263 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (8 resets) in 147 ms. (270 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 111255 steps, run visited all 1 properties in 270 ms. (steps per millisecond=412 )
Probabilistic random walk after 111255 steps, saw 72149 distinct states, run finished after 270 ms. (steps per millisecond=412 ) properties seen :1
FORMULA Anderson-PT-07-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 844/844 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 237 transition count 461
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 237 transition count 461
Applied a total of 70 rules in 12 ms. Remains 237 /272 variables (removed 35) and now considering 461/844 (removed 383) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 237/272 places, 461/844 transitions.
[2024-05-23 02:06:56] [INFO ] Flatten gal took : 21 ms
[2024-05-23 02:06:56] [INFO ] Flatten gal took : 22 ms
[2024-05-23 02:06:56] [INFO ] Input system was already deterministic with 461 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 272/272 places, 844/844 transitions.
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 42 Pre rules applied. Total rules applied 0 place count 272 transition count 802
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 0 with 84 rules applied. Total rules applied 84 place count 230 transition count 802
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 130 place count 184 transition count 300
Iterating global reduction 0 with 46 rules applied. Total rules applied 176 place count 184 transition count 300
Applied a total of 176 rules in 28 ms. Remains 184 /272 variables (removed 88) and now considering 300/844 (removed 544) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 184/272 places, 300/844 transitions.
[2024-05-23 02:06:56] [INFO ] Flatten gal took : 12 ms
[2024-05-23 02:06:56] [INFO ] Flatten gal took : 14 ms
[2024-05-23 02:06:56] [INFO ] Input system was already deterministic with 300 transitions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 844/844 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 228 transition count 368
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 228 transition count 368
Applied a total of 88 rules in 13 ms. Remains 228 /272 variables (removed 44) and now considering 368/844 (removed 476) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 228/272 places, 368/844 transitions.
[2024-05-23 02:06:56] [INFO ] Flatten gal took : 16 ms
[2024-05-23 02:06:56] [INFO ] Flatten gal took : 17 ms
[2024-05-23 02:06:56] [INFO ] Input system was already deterministic with 368 transitions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 844/844 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 228 transition count 368
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 228 transition count 368
Applied a total of 88 rules in 12 ms. Remains 228 /272 variables (removed 44) and now considering 368/844 (removed 476) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 228/272 places, 368/844 transitions.
[2024-05-23 02:06:56] [INFO ] Flatten gal took : 15 ms
[2024-05-23 02:06:56] [INFO ] Flatten gal took : 17 ms
[2024-05-23 02:06:56] [INFO ] Input system was already deterministic with 368 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 272/272 places, 844/844 transitions.
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 41 Pre rules applied. Total rules applied 0 place count 272 transition count 803
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 0 with 82 rules applied. Total rules applied 82 place count 231 transition count 803
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 124 place count 189 transition count 341
Iterating global reduction 0 with 42 rules applied. Total rules applied 166 place count 189 transition count 341
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 168 place count 188 transition count 340
Applied a total of 168 rules in 32 ms. Remains 188 /272 variables (removed 84) and now considering 340/844 (removed 504) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32 ms. Remains : 188/272 places, 340/844 transitions.
[2024-05-23 02:06:56] [INFO ] Flatten gal took : 14 ms
[2024-05-23 02:06:56] [INFO ] Flatten gal took : 15 ms
[2024-05-23 02:06:56] [INFO ] Input system was already deterministic with 340 transitions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 844/844 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 232 transition count 408
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 232 transition count 408
Applied a total of 80 rules in 14 ms. Remains 232 /272 variables (removed 40) and now considering 408/844 (removed 436) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 232/272 places, 408/844 transitions.
[2024-05-23 02:06:56] [INFO ] Flatten gal took : 15 ms
[2024-05-23 02:06:56] [INFO ] Flatten gal took : 16 ms
[2024-05-23 02:06:56] [INFO ] Input system was already deterministic with 408 transitions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 844/844 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 228 transition count 368
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 228 transition count 368
Applied a total of 88 rules in 12 ms. Remains 228 /272 variables (removed 44) and now considering 368/844 (removed 476) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 228/272 places, 368/844 transitions.
[2024-05-23 02:06:56] [INFO ] Flatten gal took : 13 ms
[2024-05-23 02:06:56] [INFO ] Flatten gal took : 15 ms
[2024-05-23 02:06:56] [INFO ] Input system was already deterministic with 368 transitions.
[2024-05-23 02:06:56] [INFO ] Flatten gal took : 37 ms
[2024-05-23 02:06:56] [INFO ] Flatten gal took : 38 ms
[2024-05-23 02:06:57] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 6 ms.
[2024-05-23 02:06:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 272 places, 844 transitions and 3276 arcs took 10 ms.
Total runtime 83983 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running Anderson-PT-07
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/416/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 272
TRANSITIONS: 844
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.021s, Sys 0.003s]
SAVING FILE /home/mcc/execution/416/model (.net / .def) ...
EXPORT TIME: [User 0.004s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 889
MODEL NAME: /home/mcc/execution/416/model
272 places, 844 transitions.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA Anderson-PT-07-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Anderson-PT-07-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Anderson-PT-07-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Anderson-PT-07-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Anderson-PT-07-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Anderson-PT-07-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Anderson-PT-07-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Anderson-PT-07-CTLFireability-2024-03 CANNOT_COMPUTE
FORMULA Anderson-PT-07-CTLFireability-2024-09 CANNOT_COMPUTE
FORMULA Anderson-PT-07-CTLFireability-2023-14 CANNOT_COMPUTE
FORMULA Anderson-PT-07-CTLFireability-2023-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716432339151
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
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-07"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is Anderson-PT-07, 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 r003-smll-171620117500338"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-07.tgz
mv Anderson-PT-07 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 ;