fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r003-smll-171620117500330
Last Updated
July 7, 2024

About the Execution of GreatSPN+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
9368.228 530392.00 1676908.00 663.00 TTTTTFFFTFFTTTFT 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-171620117500330.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-06, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r003-smll-171620117500330
=====================================================================

--------------------
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 1716429081503

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-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 01:51:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 01:51:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 01:51:24] [INFO ] Load time of PNML (sax parser for PT used): 281 ms
[2024-05-23 01:51:24] [INFO ] Transformed 229 places.
[2024-05-23 01:51:24] [INFO ] Transformed 600 transitions.
[2024-05-23 01:51:24] [INFO ] Found NUPN structural information;
[2024-05-23 01:51:24] [INFO ] Parsed PT model containing 229 places and 600 transitions and 2280 arcs in 627 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 29 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 94 ms. Remains 209 /229 variables (removed 20) and now considering 580/600 (removed 20) transitions.
// Phase 1: matrix 580 rows 209 cols
[2024-05-23 01:51:24] [INFO ] Computed 15 invariants in 53 ms
[2024-05-23 01:51:25] [INFO ] Implicit Places using invariants in 664 ms returned []
[2024-05-23 01:51:25] [INFO ] Invariant cache hit.
[2024-05-23 01:51:25] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-23 01:51:26] [INFO ] Implicit Places using invariants and state equation in 1008 ms returned []
Implicit Place search using SMT with State Equation took 1736 ms to find 0 implicit places.
Running 574 sub problems to find dead transitions.
[2024-05-23 01:51:26] [INFO ] Invariant cache hit.
[2024-05-23 01:51:26] [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-05-23 01:51:33] [INFO ] Deduced a trap composed of 88 places in 405 ms of which 46 ms to minimize.
[2024-05-23 01:51:33] [INFO ] Deduced a trap composed of 140 places in 304 ms of which 5 ms to minimize.
[2024-05-23 01:51:34] [INFO ] Deduced a trap composed of 87 places in 296 ms of which 4 ms to minimize.
[2024-05-23 01:51:34] [INFO ] Deduced a trap composed of 123 places in 235 ms of which 3 ms to minimize.
[2024-05-23 01:51:34] [INFO ] Deduced a trap composed of 112 places in 224 ms of which 3 ms to minimize.
[2024-05-23 01:51:35] [INFO ] Deduced a trap composed of 115 places in 247 ms of which 8 ms to minimize.
[2024-05-23 01:51:35] [INFO ] Deduced a trap composed of 133 places in 298 ms of which 4 ms to minimize.
[2024-05-23 01:51:35] [INFO ] Deduced a trap composed of 105 places in 314 ms of which 4 ms to minimize.
[2024-05-23 01:51:36] [INFO ] Deduced a trap composed of 114 places in 324 ms of which 4 ms to minimize.
[2024-05-23 01:51:36] [INFO ] Deduced a trap composed of 111 places in 246 ms of which 4 ms to minimize.
[2024-05-23 01:51:36] [INFO ] Deduced a trap composed of 87 places in 322 ms of which 3 ms to minimize.
[2024-05-23 01:51:37] [INFO ] Deduced a trap composed of 148 places in 337 ms of which 5 ms to minimize.
[2024-05-23 01:51:37] [INFO ] Deduced a trap composed of 65 places in 326 ms of which 3 ms to minimize.
[2024-05-23 01:51:37] [INFO ] Deduced a trap composed of 75 places in 259 ms of which 3 ms to minimize.
[2024-05-23 01:51:38] [INFO ] Deduced a trap composed of 90 places in 307 ms of which 4 ms to minimize.
[2024-05-23 01:51:38] [INFO ] Deduced a trap composed of 104 places in 320 ms of which 3 ms to minimize.
[2024-05-23 01:51:38] [INFO ] Deduced a trap composed of 48 places in 345 ms of which 4 ms to minimize.
[2024-05-23 01:51:39] [INFO ] Deduced a trap composed of 132 places in 200 ms of which 4 ms to minimize.
[2024-05-23 01:51:39] [INFO ] Deduced a trap composed of 121 places in 329 ms of which 4 ms to minimize.
[2024-05-23 01:51:39] [INFO ] Deduced a trap composed of 118 places in 246 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-05-23 01:51:40] [INFO ] Deduced a trap composed of 98 places in 220 ms of which 3 ms to minimize.
[2024-05-23 01:51:40] [INFO ] Deduced a trap composed of 114 places in 279 ms of which 4 ms to minimize.
[2024-05-23 01:51:41] [INFO ] Deduced a trap composed of 107 places in 278 ms of which 3 ms to minimize.
[2024-05-23 01:51:41] [INFO ] Deduced a trap composed of 128 places in 271 ms of which 4 ms to minimize.
[2024-05-23 01:51:41] [INFO ] Deduced a trap composed of 134 places in 335 ms of which 3 ms to minimize.
[2024-05-23 01:51:42] [INFO ] Deduced a trap composed of 131 places in 304 ms of which 4 ms to minimize.
[2024-05-23 01:51:42] [INFO ] Deduced a trap composed of 115 places in 294 ms of which 4 ms to minimize.
[2024-05-23 01:51:42] [INFO ] Deduced a trap composed of 84 places in 318 ms of which 5 ms to minimize.
[2024-05-23 01:51:43] [INFO ] Deduced a trap composed of 87 places in 305 ms of which 4 ms to minimize.
[2024-05-23 01:51:43] [INFO ] Deduced a trap composed of 112 places in 314 ms of which 4 ms to minimize.
[2024-05-23 01:51:43] [INFO ] Deduced a trap composed of 99 places in 253 ms of which 3 ms to minimize.
[2024-05-23 01:51:44] [INFO ] Deduced a trap composed of 123 places in 332 ms of which 4 ms to minimize.
[2024-05-23 01:51:44] [INFO ] Deduced a trap composed of 115 places in 298 ms of which 4 ms to minimize.
[2024-05-23 01:51:44] [INFO ] Deduced a trap composed of 86 places in 326 ms of which 4 ms to minimize.
[2024-05-23 01:51:45] [INFO ] Deduced a trap composed of 53 places in 312 ms of which 4 ms to minimize.
[2024-05-23 01:51:45] [INFO ] Deduced a trap composed of 119 places in 327 ms of which 4 ms to minimize.
[2024-05-23 01:51:45] [INFO ] Deduced a trap composed of 91 places in 269 ms of which 4 ms to minimize.
[2024-05-23 01:51:46] [INFO ] Deduced a trap composed of 87 places in 321 ms of which 3 ms to minimize.
[2024-05-23 01:51:46] [INFO ] Deduced a trap composed of 120 places in 253 ms of which 4 ms to minimize.
[2024-05-23 01:51:46] [INFO ] Deduced a trap composed of 119 places in 274 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 574 unsolved
[2024-05-23 01:51:52] [INFO ] Deduced a trap composed of 69 places in 170 ms of which 2 ms to minimize.
[2024-05-23 01:51:52] [INFO ] Deduced a trap composed of 51 places in 156 ms of which 3 ms to minimize.
[2024-05-23 01:51:52] [INFO ] Deduced a trap composed of 56 places in 274 ms of which 3 ms to minimize.
[2024-05-23 01:51:52] [INFO ] Deduced a trap composed of 131 places in 299 ms of which 4 ms to minimize.
[2024-05-23 01:51:53] [INFO ] Deduced a trap composed of 51 places in 299 ms of which 3 ms to minimize.
[2024-05-23 01:51:53] [INFO ] Deduced a trap composed of 45 places in 301 ms of which 4 ms to minimize.
[2024-05-23 01:51:53] [INFO ] Deduced a trap composed of 41 places in 301 ms of which 4 ms to minimize.
[2024-05-23 01:51:54] [INFO ] Deduced a trap composed of 46 places in 293 ms of which 5 ms to minimize.
[2024-05-23 01:51:54] [INFO ] Deduced a trap composed of 74 places in 192 ms of which 2 ms to minimize.
[2024-05-23 01:51:54] [INFO ] Deduced a trap composed of 99 places in 213 ms of which 3 ms to minimize.
[2024-05-23 01:51:54] [INFO ] Deduced a trap composed of 105 places in 203 ms of which 4 ms to minimize.
[2024-05-23 01:51:55] [INFO ] Deduced a trap composed of 123 places in 277 ms of which 4 ms to minimize.
[2024-05-23 01:51:55] [INFO ] Deduced a trap composed of 116 places in 302 ms of which 3 ms to minimize.
[2024-05-23 01:51:55] [INFO ] Deduced a trap composed of 95 places in 302 ms of which 4 ms to minimize.
[2024-05-23 01:51:56] [INFO ] Deduced a trap composed of 58 places in 266 ms of which 4 ms to minimize.
[2024-05-23 01:51:56] [INFO ] Deduced a trap composed of 127 places in 320 ms of which 4 ms to minimize.
[2024-05-23 01:51:56] [INFO ] Deduced a trap composed of 84 places in 309 ms of which 5 ms to minimize.
[2024-05-23 01:51:57] [INFO ] Deduced a trap composed of 112 places in 302 ms of which 4 ms to minimize.
[2024-05-23 01:51:57] [INFO ] Deduced a trap composed of 99 places in 288 ms of which 4 ms to minimize.
[2024-05-23 01:51:57] [INFO ] Deduced a trap composed of 44 places in 244 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 574 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 209/789 variables, and 75 constraints, problems are : Problem set: 0 solved, 574 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/209 constraints, ReadFeed: 0/30 constraints, PredecessorRefiner: 574/574 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 574 unsolved
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
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 60/75 constraints. Problems are: Problem set: 0 solved, 574 unsolved
[2024-05-23 01:52:00] [INFO ] Deduced a trap composed of 102 places in 190 ms of which 2 ms to minimize.
[2024-05-23 01:52:01] [INFO ] Deduced a trap composed of 98 places in 182 ms of which 3 ms to minimize.
[2024-05-23 01:52:01] [INFO ] Deduced a trap composed of 115 places in 151 ms of which 2 ms to minimize.
[2024-05-23 01:52:01] [INFO ] Deduced a trap composed of 84 places in 165 ms of which 3 ms to minimize.
[2024-05-23 01:52:01] [INFO ] Deduced a trap composed of 92 places in 193 ms of which 3 ms to minimize.
[2024-05-23 01:52:02] [INFO ] Deduced a trap composed of 140 places in 249 ms of which 3 ms to minimize.
[2024-05-23 01:52:02] [INFO ] Deduced a trap composed of 139 places in 286 ms of which 4 ms to minimize.
[2024-05-23 01:52:02] [INFO ] Deduced a trap composed of 120 places in 293 ms of which 4 ms to minimize.
[2024-05-23 01:52:03] [INFO ] Deduced a trap composed of 111 places in 292 ms of which 4 ms to minimize.
[2024-05-23 01:52:03] [INFO ] Deduced a trap composed of 109 places in 299 ms of which 4 ms to minimize.
[2024-05-23 01:52:03] [INFO ] Deduced a trap composed of 133 places in 269 ms of which 4 ms to minimize.
[2024-05-23 01:52:04] [INFO ] Deduced a trap composed of 114 places in 289 ms of which 3 ms to minimize.
[2024-05-23 01:52:04] [INFO ] Deduced a trap composed of 95 places in 266 ms of which 3 ms to minimize.
[2024-05-23 01:52:04] [INFO ] Deduced a trap composed of 154 places in 246 ms of which 3 ms to minimize.
[2024-05-23 01:52:04] [INFO ] Deduced a trap composed of 138 places in 259 ms of which 3 ms to minimize.
[2024-05-23 01:52:05] [INFO ] Deduced a trap composed of 119 places in 285 ms of which 3 ms to minimize.
[2024-05-23 01:52:05] [INFO ] Deduced a trap composed of 99 places in 278 ms of which 4 ms to minimize.
[2024-05-23 01:52:05] [INFO ] Deduced a trap composed of 53 places in 299 ms of which 3 ms to minimize.
[2024-05-23 01:52:06] [INFO ] Deduced a trap composed of 52 places in 275 ms of which 4 ms to minimize.
[2024-05-23 01:52:06] [INFO ] Deduced a trap composed of 130 places in 281 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 574 unsolved
[2024-05-23 01:52:09] [INFO ] Deduced a trap composed of 85 places in 144 ms of which 2 ms to minimize.
[2024-05-23 01:52:09] [INFO ] Deduced a trap composed of 88 places in 148 ms of which 2 ms to minimize.
[2024-05-23 01:52:09] [INFO ] Deduced a trap composed of 83 places in 244 ms of which 3 ms to minimize.
[2024-05-23 01:52:10] [INFO ] Deduced a trap composed of 83 places in 245 ms of which 4 ms to minimize.
[2024-05-23 01:52:10] [INFO ] Deduced a trap composed of 109 places in 266 ms of which 4 ms to minimize.
[2024-05-23 01:52:10] [INFO ] Deduced a trap composed of 52 places in 249 ms of which 3 ms to minimize.
[2024-05-23 01:52:10] [INFO ] Deduced a trap composed of 55 places in 256 ms of which 3 ms to minimize.
[2024-05-23 01:52:11] [INFO ] Deduced a trap composed of 77 places in 276 ms of which 3 ms to minimize.
[2024-05-23 01:52:11] [INFO ] Deduced a trap composed of 72 places in 289 ms of which 4 ms to minimize.
[2024-05-23 01:52:11] [INFO ] Deduced a trap composed of 97 places in 209 ms of which 3 ms to minimize.
[2024-05-23 01:52:11] [INFO ] Deduced a trap composed of 93 places in 262 ms of which 4 ms to minimize.
[2024-05-23 01:52:12] [INFO ] Deduced a trap composed of 86 places in 285 ms of which 4 ms to minimize.
[2024-05-23 01:52:12] [INFO ] Deduced a trap composed of 51 places in 278 ms of which 3 ms to minimize.
[2024-05-23 01:52:12] [INFO ] Deduced a trap composed of 79 places in 273 ms of which 3 ms to minimize.
[2024-05-23 01:52:13] [INFO ] Deduced a trap composed of 78 places in 279 ms of which 3 ms to minimize.
[2024-05-23 01:52:13] [INFO ] Deduced a trap composed of 85 places in 273 ms of which 3 ms to minimize.
[2024-05-23 01:52:13] [INFO ] Deduced a trap composed of 115 places in 283 ms of which 4 ms to minimize.
[2024-05-23 01:52:14] [INFO ] Deduced a trap composed of 62 places in 295 ms of which 4 ms to minimize.
[2024-05-23 01:52:14] [INFO ] Deduced a trap composed of 86 places in 314 ms of which 4 ms to minimize.
[2024-05-23 01:52:15] [INFO ] Deduced a trap composed of 126 places in 334 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 574 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 209/789 variables, and 115 constraints, problems are : Problem set: 0 solved, 574 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/209 constraints, ReadFeed: 0/30 constraints, PredecessorRefiner: 0/574 constraints, Known Traps: 100/100 constraints]
After SMT, in 61766ms problems are : Problem set: 0 solved, 574 unsolved
Search for dead transitions found 0 dead transitions in 61820ms
Starting structural reductions in LTL mode, iteration 1 : 209/229 places, 580/600 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63706 ms. Remains : 209/229 places, 580/600 transitions.
Support contains 93 out of 209 places after structural reductions.
[2024-05-23 01:52:28] [INFO ] Flatten gal took : 167 ms
[2024-05-23 01:52:28] [INFO ] Flatten gal took : 100 ms
[2024-05-23 01:52:29] [INFO ] Input system was already deterministic with 580 transitions.
RANDOM walk for 40000 steps (8 resets) in 4448 ms. (8 steps per ms) remains 27/97 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 26/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 72 ms. (54 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 24/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 22/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 20/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 15/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 12/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 12/12 properties
[2024-05-23 01:52:30] [INFO ] Invariant cache hit.
[2024-05-23 01:52:30] [INFO ] State equation strengthened by 30 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, 12 unsolved
Problem AtomicPropp79 is UNSAT
At refinement iteration 1 (OVERLAPS) 171/206 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 4/11 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 11 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, 9 unsolved
[2024-05-23 01:52:31] [INFO ] Deduced a trap composed of 99 places in 349 ms of which 5 ms to minimize.
[2024-05-23 01:52:31] [INFO ] Deduced a trap composed of 99 places in 336 ms of which 3 ms to minimize.
[2024-05-23 01:52:32] [INFO ] Deduced a trap composed of 50 places in 328 ms of which 3 ms to minimize.
[2024-05-23 01:52:32] [INFO ] Deduced a trap composed of 115 places in 214 ms of which 3 ms to minimize.
[2024-05-23 01:52:32] [INFO ] Deduced a trap composed of 70 places in 301 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 5/20 constraints. Problems are: Problem set: 3 solved, 9 unsolved
[2024-05-23 01:52:32] [INFO ] Deduced a trap composed of 131 places in 294 ms of which 4 ms to minimize.
[2024-05-23 01:52:33] [INFO ] Deduced a trap composed of 103 places in 282 ms of which 4 ms to minimize.
[2024-05-23 01:52:33] [INFO ] Deduced a trap composed of 115 places in 277 ms of which 4 ms to minimize.
[2024-05-23 01:52:33] [INFO ] Deduced a trap composed of 77 places in 280 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 4/24 constraints. Problems are: Problem set: 3 solved, 9 unsolved
[2024-05-23 01:52:34] [INFO ] Deduced a trap composed of 40 places in 194 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 1/25 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 0/25 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 580/789 variables, 209/234 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/789 variables, 30/264 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/789 variables, 0/264 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 0/789 variables, 0/264 constraints. Problems are: Problem set: 3 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 789/789 variables, and 264 constraints, problems are : Problem set: 3 solved, 9 unsolved in 4181 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: 12/12 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 3 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 9 unsolved
Problem AtomicPropp62 is UNSAT
At refinement iteration 1 (OVERLAPS) 180/205 variables, 7/7 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 3/10 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/10 constraints. Problems are: Problem set: 4 solved, 8 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, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 10/25 constraints. Problems are: Problem set: 7 solved, 5 unsolved
[2024-05-23 01:52:35] [INFO ] Deduced a trap composed of 71 places in 302 ms of which 4 ms to minimize.
[2024-05-23 01:52:35] [INFO ] Deduced a trap composed of 60 places in 309 ms of which 5 ms to minimize.
[2024-05-23 01:52:36] [INFO ] Deduced a trap composed of 83 places in 324 ms of which 4 ms to minimize.
[2024-05-23 01:52:36] [INFO ] Deduced a trap composed of 70 places in 319 ms of which 4 ms to minimize.
[2024-05-23 01:52:36] [INFO ] Deduced a trap composed of 68 places in 279 ms of which 3 ms to minimize.
[2024-05-23 01:52:37] [INFO ] Deduced a trap composed of 72 places in 270 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 6/31 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 0/31 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 580/789 variables, 209/240 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/789 variables, 30/270 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/789 variables, 5/275 constraints. Problems are: Problem set: 7 solved, 5 unsolved
[2024-05-23 01:52:38] [INFO ] Deduced a trap composed of 106 places in 295 ms of which 4 ms to minimize.
[2024-05-23 01:52:38] [INFO ] Deduced a trap composed of 42 places in 229 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/789 variables, 2/277 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/789 variables, 0/277 constraints. Problems are: Problem set: 7 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 789/789 variables, and 277 constraints, problems are : Problem set: 7 solved, 5 unsolved in 5010 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: 5/12 constraints, Known Traps: 18/18 constraints]
After SMT, in 9279ms problems are : Problem set: 7 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 14 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 1 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 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 90 place count 148 transition count 289
Iterating global reduction 0 with 32 rules applied. Total rules applied 122 place count 148 transition count 289
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 124 place count 147 transition count 288
Applied a total of 124 rules in 92 ms. Remains 147 /209 variables (removed 62) and now considering 288/580 (removed 292) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 147/209 places, 288/580 transitions.
RANDOM walk for 40000 steps (8 resets) in 490 ms. (81 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 135 ms. (294 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 110 ms. (360 steps per ms) remains 2/2 properties
// Phase 1: matrix 288 rows 147 cols
[2024-05-23 01:52:40] [INFO ] Computed 15 invariants in 10 ms
[2024-05-23 01:52:40] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 41/44 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/74 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 61/135 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 12/147 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 01:52:40] [INFO ] Deduced a trap composed of 83 places in 175 ms of which 3 ms to minimize.
[2024-05-23 01:52:40] [INFO ] Deduced a trap composed of 74 places in 171 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 01:52:41] [INFO ] Deduced a trap composed of 90 places in 194 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 01:52:41] [INFO ] Deduced a trap composed of 64 places in 173 ms of which 3 ms to minimize.
[2024-05-23 01:52:41] [INFO ] Deduced a trap composed of 84 places in 166 ms of which 3 ms to minimize.
[2024-05-23 01:52:41] [INFO ] Deduced a trap composed of 68 places in 169 ms of which 3 ms to minimize.
[2024-05-23 01:52:41] [INFO ] Deduced a trap composed of 62 places in 165 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/147 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 01:52:42] [INFO ] Deduced a trap composed of 67 places in 199 ms of which 3 ms to minimize.
[2024-05-23 01:52:42] [INFO ] Deduced a trap composed of 97 places in 189 ms of which 2 ms to minimize.
[2024-05-23 01:52:42] [INFO ] Deduced a trap composed of 69 places in 191 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/147 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/147 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 288/435 variables, 147/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/435 variables, 30/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/435 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/435 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 435/435 variables, and 202 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2310 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 147/147 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 41/44 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/74 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 61/135 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 12/147 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 10/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 288/435 variables, 147/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/435 variables, 30/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/435 variables, 2/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/435 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/435 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 435/435 variables, and 204 constraints, problems are : Problem set: 0 solved, 2 unsolved in 553 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 147/147 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 10/10 constraints]
After SMT, in 2894ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 3 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 288/288 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 142 transition count 233
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 142 transition count 233
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 12 place count 141 transition count 232
Applied a total of 12 rules in 24 ms. Remains 141 /147 variables (removed 6) and now considering 232/288 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 141/147 places, 232/288 transitions.
RANDOM walk for 40000 steps (8 resets) in 134 ms. (296 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (8 resets) in 130 ms. (305 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 137 ms. (289 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 39997 steps, run visited all 2 properties in 383 ms. (steps per millisecond=104 )
Probabilistic random walk after 39997 steps, saw 23331 distinct states, run finished after 389 ms. (steps per millisecond=102 ) properties seen :2
Successfully simplified 7 atomic propositions for a total of 16 simplifications.
FORMULA Anderson-PT-06-CTLFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 01:52:44] [INFO ] Flatten gal took : 42 ms
[2024-05-23 01:52:44] [INFO ] Flatten gal took : 50 ms
[2024-05-23 01:52:44] [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 10 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 10 ms. Remains : 172/209 places, 263/580 transitions.
[2024-05-23 01:52:44] [INFO ] Flatten gal took : 13 ms
[2024-05-23 01:52:44] [INFO ] Flatten gal took : 14 ms
[2024-05-23 01:52:44] [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 8 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 9 ms. Remains : 171/209 places, 252/580 transitions.
[2024-05-23 01:52:44] [INFO ] Flatten gal took : 12 ms
[2024-05-23 01:52:44] [INFO ] Flatten gal took : 13 ms
[2024-05-23 01:52:44] [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 0 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 33 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 33 ms. Remains : 142/209 places, 223/580 transitions.
[2024-05-23 01:52:44] [INFO ] Flatten gal took : 11 ms
[2024-05-23 01:52:44] [INFO ] Flatten gal took : 11 ms
[2024-05-23 01:52:44] [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 11 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 11 ms. Remains : 173/209 places, 284/580 transitions.
[2024-05-23 01:52:44] [INFO ] Flatten gal took : 21 ms
[2024-05-23 01:52:44] [INFO ] Flatten gal took : 23 ms
[2024-05-23 01:52:44] [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 12 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 13 ms. Remains : 171/209 places, 262/580 transitions.
[2024-05-23 01:52:44] [INFO ] Flatten gal took : 19 ms
[2024-05-23 01:52:44] [INFO ] Flatten gal took : 20 ms
[2024-05-23 01:52:44] [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 12 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 12 ms. Remains : 174/209 places, 285/580 transitions.
[2024-05-23 01:52:44] [INFO ] Flatten gal took : 20 ms
[2024-05-23 01:52:44] [INFO ] Flatten gal took : 21 ms
[2024-05-23 01:52:44] [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 12 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 13 ms. Remains : 174/209 places, 295/580 transitions.
[2024-05-23 01:52:44] [INFO ] Flatten gal took : 19 ms
[2024-05-23 01:52:44] [INFO ] Flatten gal took : 20 ms
[2024-05-23 01:52:44] [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 13 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 13 ms. Remains : 176/209 places, 307/580 transitions.
[2024-05-23 01:52:44] [INFO ] Flatten gal took : 20 ms
[2024-05-23 01:52:44] [INFO ] Flatten gal took : 22 ms
[2024-05-23 01:52:44] [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 8 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 12 ms. Remains : 170/209 places, 251/580 transitions.
[2024-05-23 01:52:44] [INFO ] Flatten gal took : 10 ms
[2024-05-23 01:52:44] [INFO ] Flatten gal took : 11 ms
[2024-05-23 01:52:45] [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 7 ms. Remains : 173/209 places, 274/580 transitions.
[2024-05-23 01:52:45] [INFO ] Flatten gal took : 12 ms
[2024-05-23 01:52:45] [INFO ] Flatten gal took : 13 ms
[2024-05-23 01:52:45] [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 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-05-23 01:52:45] [INFO ] Flatten gal took : 11 ms
[2024-05-23 01:52:45] [INFO ] Flatten gal took : 12 ms
[2024-05-23 01:52:45] [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-05-23 01:52:45] [INFO ] Flatten gal took : 14 ms
[2024-05-23 01:52:45] [INFO ] Flatten gal took : 27 ms
[2024-05-23 01:52:45] [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 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-05-23 01:52:45] [INFO ] Flatten gal took : 11 ms
[2024-05-23 01:52:45] [INFO ] Flatten gal took : 12 ms
[2024-05-23 01:52:45] [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-05-23 01:52:45] [INFO ] Flatten gal took : 13 ms
[2024-05-23 01:52:45] [INFO ] Flatten gal took : 14 ms
[2024-05-23 01:52:45] [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 8 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-05-23 01:52:45] [INFO ] Flatten gal took : 15 ms
[2024-05-23 01:52:45] [INFO ] Flatten gal took : 19 ms
[2024-05-23 01:52:45] [INFO ] Input system was already deterministic with 295 transitions.
[2024-05-23 01:52:45] [INFO ] Flatten gal took : 39 ms
[2024-05-23 01:52:45] [INFO ] Flatten gal took : 39 ms
[2024-05-23 01:52:45] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 10 ms.
[2024-05-23 01:52:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 209 places, 580 transitions and 2240 arcs took 8 ms.
Total runtime 81951 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Anderson-PT-06

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 209
TRANSITIONS: 580
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.025s, Sys 0.000s]


SAVING FILE /home/mcc/execution/412/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: 957
MODEL NAME: /home/mcc/execution/412/model
209 places, 580 transitions.

No place bound informations found.
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..
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-06-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Anderson-PT-06-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Anderson-PT-06-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Anderson-PT-06-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Anderson-PT-06-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Anderson-PT-06-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Anderson-PT-06-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Anderson-PT-06-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Anderson-PT-06-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Anderson-PT-06-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Anderson-PT-06-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Anderson-PT-06-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Anderson-PT-06-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Anderson-PT-06-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Anderson-PT-06-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716429611895

--------------------
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

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="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-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 r003-smll-171620117500330"
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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;