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

About the Execution of LTSMin+red for Anderson-PT-05

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
612.636 42356.00 72948.00 287.30 [undef] Cannot compute

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r464-smll-171620118300322.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is Anderson-PT-05, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r464-smll-171620118300322
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 712K
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 12 15:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Apr 12 15:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Apr 12 15:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K Apr 12 15:35 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 185K 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-05-CTLFireability-2024-00
FORMULA_NAME Anderson-PT-05-CTLFireability-2024-01
FORMULA_NAME Anderson-PT-05-CTLFireability-2024-02
FORMULA_NAME Anderson-PT-05-CTLFireability-2024-03
FORMULA_NAME Anderson-PT-05-CTLFireability-2024-04
FORMULA_NAME Anderson-PT-05-CTLFireability-2024-05
FORMULA_NAME Anderson-PT-05-CTLFireability-2024-06
FORMULA_NAME Anderson-PT-05-CTLFireability-2024-07
FORMULA_NAME Anderson-PT-05-CTLFireability-2024-08
FORMULA_NAME Anderson-PT-05-CTLFireability-2024-09
FORMULA_NAME Anderson-PT-05-CTLFireability-2024-10
FORMULA_NAME Anderson-PT-05-CTLFireability-2024-11
FORMULA_NAME Anderson-PT-05-CTLFireability-2023-12
FORMULA_NAME Anderson-PT-05-CTLFireability-2023-13
FORMULA_NAME Anderson-PT-05-CTLFireability-2023-14
FORMULA_NAME Anderson-PT-05-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717254882710

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:14:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 15:14:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:14:45] [INFO ] Load time of PNML (sax parser for PT used): 165 ms
[2024-06-01 15:14:45] [INFO ] Transformed 161 places.
[2024-06-01 15:14:45] [INFO ] Transformed 365 transitions.
[2024-06-01 15:14:45] [INFO ] Found NUPN structural information;
[2024-06-01 15:14:45] [INFO ] Parsed PT model containing 161 places and 365 transitions and 1380 arcs in 349 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 36 ms.
Support contains 86 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 365/365 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 152 transition count 356
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 152 transition count 356
Applied a total of 18 rules in 51 ms. Remains 152 /161 variables (removed 9) and now considering 356/365 (removed 9) transitions.
// Phase 1: matrix 356 rows 152 cols
[2024-06-01 15:14:45] [INFO ] Computed 13 invariants in 45 ms
[2024-06-01 15:14:46] [INFO ] Implicit Places using invariants in 532 ms returned []
[2024-06-01 15:14:46] [INFO ] Invariant cache hit.
[2024-06-01 15:14:46] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 15:14:46] [INFO ] Implicit Places using invariants and state equation in 462 ms returned []
Implicit Place search using SMT with State Equation took 1050 ms to find 0 implicit places.
Running 351 sub problems to find dead transitions.
[2024-06-01 15:14:46] [INFO ] Invariant cache hit.
[2024-06-01 15:14:46] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 351 unsolved
[2024-06-01 15:14:50] [INFO ] Deduced a trap composed of 57 places in 313 ms of which 40 ms to minimize.
[2024-06-01 15:14:51] [INFO ] Deduced a trap composed of 58 places in 281 ms of which 4 ms to minimize.
[2024-06-01 15:14:51] [INFO ] Deduced a trap composed of 56 places in 200 ms of which 3 ms to minimize.
[2024-06-01 15:14:51] [INFO ] Deduced a trap composed of 99 places in 241 ms of which 4 ms to minimize.
[2024-06-01 15:14:51] [INFO ] Deduced a trap composed of 100 places in 209 ms of which 3 ms to minimize.
[2024-06-01 15:14:52] [INFO ] Deduced a trap composed of 111 places in 193 ms of which 3 ms to minimize.
[2024-06-01 15:14:52] [INFO ] Deduced a trap composed of 88 places in 192 ms of which 3 ms to minimize.
[2024-06-01 15:14:52] [INFO ] Deduced a trap composed of 61 places in 167 ms of which 4 ms to minimize.
[2024-06-01 15:14:52] [INFO ] Deduced a trap composed of 91 places in 186 ms of which 3 ms to minimize.
[2024-06-01 15:14:52] [INFO ] Deduced a trap composed of 97 places in 170 ms of which 3 ms to minimize.
[2024-06-01 15:14:53] [INFO ] Deduced a trap composed of 72 places in 196 ms of which 2 ms to minimize.
[2024-06-01 15:14:53] [INFO ] Deduced a trap composed of 61 places in 144 ms of which 2 ms to minimize.
[2024-06-01 15:14:53] [INFO ] Deduced a trap composed of 107 places in 155 ms of which 3 ms to minimize.
[2024-06-01 15:14:53] [INFO ] Deduced a trap composed of 78 places in 151 ms of which 2 ms to minimize.
[2024-06-01 15:14:53] [INFO ] Deduced a trap composed of 85 places in 154 ms of which 2 ms to minimize.
[2024-06-01 15:14:54] [INFO ] Deduced a trap composed of 47 places in 146 ms of which 2 ms to minimize.
[2024-06-01 15:14:54] [INFO ] Deduced a trap composed of 47 places in 148 ms of which 2 ms to minimize.
[2024-06-01 15:14:54] [INFO ] Deduced a trap composed of 42 places in 142 ms of which 2 ms to minimize.
[2024-06-01 15:14:54] [INFO ] Deduced a trap composed of 92 places in 137 ms of which 2 ms to minimize.
[2024-06-01 15:14:54] [INFO ] Deduced a trap composed of 80 places in 172 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 351 unsolved
[2024-06-01 15:14:55] [INFO ] Deduced a trap composed of 77 places in 141 ms of which 2 ms to minimize.
[2024-06-01 15:14:55] [INFO ] Deduced a trap composed of 38 places in 161 ms of which 9 ms to minimize.
[2024-06-01 15:14:55] [INFO ] Deduced a trap composed of 55 places in 194 ms of which 3 ms to minimize.
[2024-06-01 15:14:56] [INFO ] Deduced a trap composed of 92 places in 187 ms of which 3 ms to minimize.
[2024-06-01 15:14:56] [INFO ] Deduced a trap composed of 95 places in 162 ms of which 2 ms to minimize.
[2024-06-01 15:14:56] [INFO ] Deduced a trap composed of 45 places in 121 ms of which 3 ms to minimize.
[2024-06-01 15:14:56] [INFO ] Deduced a trap composed of 78 places in 131 ms of which 2 ms to minimize.
[2024-06-01 15:14:56] [INFO ] Deduced a trap composed of 83 places in 190 ms of which 3 ms to minimize.
[2024-06-01 15:14:57] [INFO ] Deduced a trap composed of 38 places in 206 ms of which 3 ms to minimize.
[2024-06-01 15:14:57] [INFO ] Deduced a trap composed of 73 places in 182 ms of which 3 ms to minimize.
[2024-06-01 15:14:57] [INFO ] Deduced a trap composed of 48 places in 174 ms of which 3 ms to minimize.
[2024-06-01 15:14:57] [INFO ] Deduced a trap composed of 86 places in 175 ms of which 3 ms to minimize.
[2024-06-01 15:14:58] [INFO ] Deduced a trap composed of 75 places in 185 ms of which 3 ms to minimize.
[2024-06-01 15:14:58] [INFO ] Deduced a trap composed of 58 places in 203 ms of which 3 ms to minimize.
[2024-06-01 15:14:58] [INFO ] Deduced a trap composed of 56 places in 206 ms of which 14 ms to minimize.
[2024-06-01 15:14:58] [INFO ] Deduced a trap composed of 69 places in 182 ms of which 3 ms to minimize.
[2024-06-01 15:14:59] [INFO ] Deduced a trap composed of 73 places in 185 ms of which 3 ms to minimize.
[2024-06-01 15:14:59] [INFO ] Deduced a trap composed of 75 places in 176 ms of which 3 ms to minimize.
[2024-06-01 15:14:59] [INFO ] Deduced a trap composed of 79 places in 187 ms of which 3 ms to minimize.
[2024-06-01 15:14:59] [INFO ] Deduced a trap composed of 48 places in 124 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 351 unsolved
[2024-06-01 15:15:02] [INFO ] Deduced a trap composed of 102 places in 202 ms of which 3 ms to minimize.
[2024-06-01 15:15:02] [INFO ] Deduced a trap composed of 98 places in 179 ms of which 2 ms to minimize.
[2024-06-01 15:15:03] [INFO ] Deduced a trap composed of 81 places in 196 ms of which 3 ms to minimize.
[2024-06-01 15:15:03] [INFO ] Deduced a trap composed of 63 places in 202 ms of which 3 ms to minimize.
[2024-06-01 15:15:03] [INFO ] Deduced a trap composed of 41 places in 184 ms of which 3 ms to minimize.
[2024-06-01 15:15:03] [INFO ] Deduced a trap composed of 53 places in 203 ms of which 3 ms to minimize.
[2024-06-01 15:15:04] [INFO ] Deduced a trap composed of 75 places in 204 ms of which 3 ms to minimize.
[2024-06-01 15:15:04] [INFO ] Deduced a trap composed of 64 places in 196 ms of which 3 ms to minimize.
[2024-06-01 15:15:04] [INFO ] Deduced a trap composed of 71 places in 202 ms of which 3 ms to minimize.
[2024-06-01 15:15:04] [INFO ] Deduced a trap composed of 54 places in 174 ms of which 3 ms to minimize.
[2024-06-01 15:15:05] [INFO ] Deduced a trap composed of 41 places in 184 ms of which 4 ms to minimize.
[2024-06-01 15:15:05] [INFO ] Deduced a trap composed of 69 places in 192 ms of which 3 ms to minimize.
[2024-06-01 15:15:05] [INFO ] Deduced a trap composed of 63 places in 172 ms of which 3 ms to minimize.
[2024-06-01 15:15:05] [INFO ] Deduced a trap composed of 58 places in 174 ms of which 3 ms to minimize.
[2024-06-01 15:15:05] [INFO ] Deduced a trap composed of 55 places in 191 ms of which 3 ms to minimize.
[2024-06-01 15:15:06] [INFO ] Deduced a trap composed of 96 places in 162 ms of which 3 ms to minimize.
[2024-06-01 15:15:06] [INFO ] Deduced a trap composed of 83 places in 193 ms of which 3 ms to minimize.
[2024-06-01 15:15:06] [INFO ] Deduced a trap composed of 75 places in 197 ms of which 3 ms to minimize.
[2024-06-01 15:15:06] [INFO ] Deduced a trap composed of 54 places in 176 ms of which 2 ms to minimize.
[2024-06-01 15:15:07] [INFO ] Deduced a trap composed of 71 places in 197 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 351 unsolved
[2024-06-01 15:15:08] [INFO ] Deduced a trap composed of 76 places in 180 ms of which 3 ms to minimize.
[2024-06-01 15:15:08] [INFO ] Deduced a trap composed of 90 places in 191 ms of which 4 ms to minimize.
[2024-06-01 15:15:08] [INFO ] Deduced a trap composed of 70 places in 182 ms of which 3 ms to minimize.
[2024-06-01 15:15:08] [INFO ] Deduced a trap composed of 83 places in 99 ms of which 2 ms to minimize.
[2024-06-01 15:15:08] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 1 ms to minimize.
[2024-06-01 15:15:08] [INFO ] Deduced a trap composed of 69 places in 107 ms of which 2 ms to minimize.
[2024-06-01 15:15:09] [INFO ] Deduced a trap composed of 40 places in 113 ms of which 2 ms to minimize.
[2024-06-01 15:15:09] [INFO ] Deduced a trap composed of 55 places in 129 ms of which 3 ms to minimize.
[2024-06-01 15:15:09] [INFO ] Deduced a trap composed of 59 places in 116 ms of which 2 ms to minimize.
[2024-06-01 15:15:09] [INFO ] Deduced a trap composed of 54 places in 113 ms of which 1 ms to minimize.
[2024-06-01 15:15:09] [INFO ] Deduced a trap composed of 58 places in 133 ms of which 3 ms to minimize.
[2024-06-01 15:15:09] [INFO ] Deduced a trap composed of 97 places in 199 ms of which 3 ms to minimize.
[2024-06-01 15:15:10] [INFO ] Deduced a trap composed of 50 places in 164 ms of which 2 ms to minimize.
[2024-06-01 15:15:10] [INFO ] Deduced a trap composed of 96 places in 192 ms of which 3 ms to minimize.
[2024-06-01 15:15:10] [INFO ] Deduced a trap composed of 83 places in 200 ms of which 3 ms to minimize.
[2024-06-01 15:15:10] [INFO ] Deduced a trap composed of 74 places in 164 ms of which 3 ms to minimize.
[2024-06-01 15:15:11] [INFO ] Deduced a trap composed of 65 places in 199 ms of which 3 ms to minimize.
[2024-06-01 15:15:11] [INFO ] Deduced a trap composed of 51 places in 164 ms of which 3 ms to minimize.
[2024-06-01 15:15:11] [INFO ] Deduced a trap composed of 86 places in 206 ms of which 3 ms to minimize.
[2024-06-01 15:15:11] [INFO ] Deduced a trap composed of 61 places in 202 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 351 unsolved
[2024-06-01 15:15:12] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 2 ms to minimize.
[2024-06-01 15:15:13] [INFO ] Deduced a trap composed of 88 places in 179 ms of which 3 ms to minimize.
[2024-06-01 15:15:13] [INFO ] Deduced a trap composed of 90 places in 200 ms of which 3 ms to minimize.
[2024-06-01 15:15:13] [INFO ] Deduced a trap composed of 63 places in 189 ms of which 3 ms to minimize.
[2024-06-01 15:15:14] [INFO ] Deduced a trap composed of 80 places in 203 ms of which 3 ms to minimize.
[2024-06-01 15:15:14] [INFO ] Deduced a trap composed of 47 places in 180 ms of which 3 ms to minimize.
[2024-06-01 15:15:14] [INFO ] Deduced a trap composed of 102 places in 202 ms of which 3 ms to minimize.
[2024-06-01 15:15:15] [INFO ] Deduced a trap composed of 54 places in 216 ms of which 3 ms to minimize.
[2024-06-01 15:15:15] [INFO ] Deduced a trap composed of 92 places in 200 ms of which 3 ms to minimize.
[2024-06-01 15:15:15] [INFO ] Deduced a trap composed of 101 places in 209 ms of which 3 ms to minimize.
[2024-06-01 15:15:15] [INFO ] Deduced a trap composed of 67 places in 207 ms of which 3 ms to minimize.
[2024-06-01 15:15:16] [INFO ] Deduced a trap composed of 89 places in 198 ms of which 3 ms to minimize.
[2024-06-01 15:15:16] [INFO ] Deduced a trap composed of 42 places in 181 ms of which 3 ms to minimize.
[2024-06-01 15:15:17] [INFO ] Deduced a trap composed of 57 places in 202 ms of which 3 ms to minimize.
[2024-06-01 15:15:17] [INFO ] Deduced a trap composed of 83 places in 166 ms of which 2 ms to minimize.
SMT process timed out in 30779ms, After SMT, problems are : Problem set: 0 solved, 351 unsolved
Search for dead transitions found 0 dead transitions in 30833ms
Starting structural reductions in LTL mode, iteration 1 : 152/161 places, 356/365 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31975 ms. Remains : 152/161 places, 356/365 transitions.
Support contains 86 out of 152 places after structural reductions.
[2024-06-01 15:15:18] [INFO ] Flatten gal took : 127 ms
[2024-06-01 15:15:18] [INFO ] Flatten gal took : 70 ms
[2024-06-01 15:15:18] [INFO ] Input system was already deterministic with 356 transitions.
Support contains 84 out of 152 places (down from 86) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2684 ms. (14 steps per ms) remains 29/89 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 27/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 23/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 21/23 properties
BEST_FIRST walk for 4001 steps (8 resets) in 32 ms. (121 steps per ms) remains 16/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 14/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 13/14 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 12/13 properties
BEST_FIRST walk for 4001 steps (8 resets) in 35 ms. (111 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 12/12 properties
[2024-06-01 15:15:19] [INFO ] Invariant cache hit.
[2024-06-01 15:15:19] [INFO ] State equation strengthened by 20 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp80 is UNSAT
At refinement iteration 1 (OVERLAPS) 118/150 variables, 6/6 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 3/9 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 9 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp79 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/152 variables, 4/13 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 0/13 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 356/508 variables, 152/165 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/508 variables, 20/185 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/508 variables, 0/185 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/508 variables, 0/185 constraints. Problems are: Problem set: 9 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 508/508 variables, and 185 constraints, problems are : Problem set: 9 solved, 3 unsolved in 611 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 152/152 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 69/77 variables, 3/3 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/3 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 66/143 variables, 3/6 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/6 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 9/152 variables, 7/13 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/13 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 356/508 variables, 152/165 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/508 variables, 20/185 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/508 variables, 3/188 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/508 variables, 0/188 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/508 variables, 0/188 constraints. Problems are: Problem set: 9 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 508/508 variables, and 188 constraints, problems are : Problem set: 9 solved, 3 unsolved in 869 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 152/152 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 3/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 1543ms problems are : Problem set: 9 solved, 3 unsolved
Parikh walk visited 0 properties in 1181 ms.
Support contains 8 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 356/356 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 152 transition count 338
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 134 transition count 338
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 63 place count 107 transition count 167
Iterating global reduction 0 with 27 rules applied. Total rules applied 90 place count 107 transition count 167
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 94 place count 105 transition count 165
Applied a total of 94 rules in 60 ms. Remains 105 /152 variables (removed 47) and now considering 165/356 (removed 191) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 105/152 places, 165/356 transitions.
RANDOM walk for 40000 steps (8 resets) in 359 ms. (111 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 131 ms. (303 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 71 ms. (555 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
// Phase 1: matrix 165 rows 105 cols
[2024-06-01 15:15:22] [INFO ] Computed 13 invariants in 5 ms
[2024-06-01 15:15:22] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 93/96 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/99 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/105 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 165/270 variables, 105/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 20/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/270 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/270 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 138 constraints, problems are : Problem set: 0 solved, 1 unsolved in 217 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 105/105 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 93/96 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/99 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/105 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 165/270 variables, 105/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 20/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/270 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/270 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/270 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 270/270 variables, and 139 constraints, problems are : Problem set: 0 solved, 1 unsolved in 236 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 105/105 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 465ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 3 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 165/165 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 103 transition count 147
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 103 transition count 147
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 6 place count 102 transition count 146
Applied a total of 6 rules in 33 ms. Remains 102 /105 variables (removed 3) and now considering 146/165 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 102/105 places, 146/165 transitions.
RANDOM walk for 40000 steps (8 resets) in 132 ms. (300 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 86 ms. (459 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 5748 steps, run visited all 1 properties in 49 ms. (steps per millisecond=117 )
Probabilistic random walk after 5748 steps, saw 3055 distinct states, run finished after 55 ms. (steps per millisecond=104 ) properties seen :1
Successfully simplified 9 atomic propositions for a total of 16 simplifications.
[2024-06-01 15:15:23] [INFO ] Flatten gal took : 48 ms
[2024-06-01 15:15:23] [INFO ] Flatten gal took : 51 ms
[2024-06-01 15:15:23] [INFO ] Input system was already deterministic with 356 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 356/356 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 128 transition count 228
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 128 transition count 228
Applied a total of 48 rules in 11 ms. Remains 128 /152 variables (removed 24) and now considering 228/356 (removed 128) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 128/152 places, 228/356 transitions.
[2024-06-01 15:15:23] [INFO ] Flatten gal took : 26 ms
[2024-06-01 15:15:23] [INFO ] Flatten gal took : 27 ms
[2024-06-01 15:15:23] [INFO ] Input system was already deterministic with 228 transitions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 356/356 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 122 transition count 166
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 122 transition count 166
Applied a total of 60 rules in 12 ms. Remains 122 /152 variables (removed 30) and now considering 166/356 (removed 190) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 122/152 places, 166/356 transitions.
[2024-06-01 15:15:23] [INFO ] Flatten gal took : 16 ms
[2024-06-01 15:15:23] [INFO ] Flatten gal took : 18 ms
[2024-06-01 15:15:23] [INFO ] Input system was already deterministic with 166 transitions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 356/356 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 122 transition count 166
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 122 transition count 166
Applied a total of 60 rules in 7 ms. Remains 122 /152 variables (removed 30) and now considering 166/356 (removed 190) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 122/152 places, 166/356 transitions.
[2024-06-01 15:15:23] [INFO ] Flatten gal took : 16 ms
[2024-06-01 15:15:23] [INFO ] Flatten gal took : 18 ms
[2024-06-01 15:15:23] [INFO ] Input system was already deterministic with 166 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 152/152 places, 356/356 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 152 transition count 336
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 132 transition count 336
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 71 place count 101 transition count 145
Iterating global reduction 0 with 31 rules applied. Total rules applied 102 place count 101 transition count 145
Applied a total of 102 rules in 23 ms. Remains 101 /152 variables (removed 51) and now considering 145/356 (removed 211) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 101/152 places, 145/356 transitions.
[2024-06-01 15:15:23] [INFO ] Flatten gal took : 9 ms
[2024-06-01 15:15:23] [INFO ] Flatten gal took : 9 ms
[2024-06-01 15:15:23] [INFO ] Input system was already deterministic with 145 transitions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 356/356 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 128 transition count 228
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 128 transition count 228
Applied a total of 48 rules in 5 ms. Remains 128 /152 variables (removed 24) and now considering 228/356 (removed 128) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 128/152 places, 228/356 transitions.
[2024-06-01 15:15:23] [INFO ] Flatten gal took : 12 ms
[2024-06-01 15:15:23] [INFO ] Flatten gal took : 14 ms
[2024-06-01 15:15:23] [INFO ] Input system was already deterministic with 228 transitions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 356/356 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 122 transition count 174
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 122 transition count 174
Applied a total of 60 rules in 4 ms. Remains 122 /152 variables (removed 30) and now considering 174/356 (removed 182) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 122/152 places, 174/356 transitions.
[2024-06-01 15:15:23] [INFO ] Flatten gal took : 9 ms
[2024-06-01 15:15:23] [INFO ] Flatten gal took : 11 ms
[2024-06-01 15:15:23] [INFO ] Input system was already deterministic with 174 transitions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 356/356 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 127 transition count 203
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 127 transition count 203
Applied a total of 50 rules in 4 ms. Remains 127 /152 variables (removed 25) and now considering 203/356 (removed 153) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 127/152 places, 203/356 transitions.
[2024-06-01 15:15:23] [INFO ] Flatten gal took : 10 ms
[2024-06-01 15:15:23] [INFO ] Flatten gal took : 12 ms
[2024-06-01 15:15:23] [INFO ] Input system was already deterministic with 203 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 152/152 places, 356/356 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 152 transition count 336
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 132 transition count 336
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 69 place count 103 transition count 163
Iterating global reduction 0 with 29 rules applied. Total rules applied 98 place count 103 transition count 163
Applied a total of 98 rules in 16 ms. Remains 103 /152 variables (removed 49) and now considering 163/356 (removed 193) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 103/152 places, 163/356 transitions.
[2024-06-01 15:15:23] [INFO ] Flatten gal took : 9 ms
[2024-06-01 15:15:23] [INFO ] Flatten gal took : 9 ms
[2024-06-01 15:15:23] [INFO ] Input system was already deterministic with 163 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 152/152 places, 356/356 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 152 transition count 336
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 132 transition count 336
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 64 place count 108 transition count 208
Iterating global reduction 0 with 24 rules applied. Total rules applied 88 place count 108 transition count 208
Applied a total of 88 rules in 18 ms. Remains 108 /152 variables (removed 44) and now considering 208/356 (removed 148) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 108/152 places, 208/356 transitions.
[2024-06-01 15:15:23] [INFO ] Flatten gal took : 11 ms
[2024-06-01 15:15:23] [INFO ] Flatten gal took : 12 ms
[2024-06-01 15:15:23] [INFO ] Input system was already deterministic with 208 transitions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 356/356 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 127 transition count 219
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 127 transition count 219
Applied a total of 50 rules in 4 ms. Remains 127 /152 variables (removed 25) and now considering 219/356 (removed 137) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 127/152 places, 219/356 transitions.
[2024-06-01 15:15:24] [INFO ] Flatten gal took : 11 ms
[2024-06-01 15:15:24] [INFO ] Flatten gal took : 13 ms
[2024-06-01 15:15:24] [INFO ] Input system was already deterministic with 219 transitions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 356/356 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 124 transition count 192
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 124 transition count 192
Applied a total of 56 rules in 4 ms. Remains 124 /152 variables (removed 28) and now considering 192/356 (removed 164) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 124/152 places, 192/356 transitions.
[2024-06-01 15:15:24] [INFO ] Flatten gal took : 9 ms
[2024-06-01 15:15:24] [INFO ] Flatten gal took : 10 ms
[2024-06-01 15:15:24] [INFO ] Input system was already deterministic with 192 transitions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 356/356 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 133 transition count 257
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 133 transition count 257
Applied a total of 38 rules in 5 ms. Remains 133 /152 variables (removed 19) and now considering 257/356 (removed 99) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 133/152 places, 257/356 transitions.
[2024-06-01 15:15:24] [INFO ] Flatten gal took : 12 ms
[2024-06-01 15:15:24] [INFO ] Flatten gal took : 14 ms
[2024-06-01 15:15:24] [INFO ] Input system was already deterministic with 257 transitions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 356/356 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 126 transition count 194
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 126 transition count 194
Applied a total of 52 rules in 4 ms. Remains 126 /152 variables (removed 26) and now considering 194/356 (removed 162) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 126/152 places, 194/356 transitions.
[2024-06-01 15:15:24] [INFO ] Flatten gal took : 9 ms
[2024-06-01 15:15:24] [INFO ] Flatten gal took : 10 ms
[2024-06-01 15:15:24] [INFO ] Input system was already deterministic with 194 transitions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 356/356 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 125 transition count 201
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 125 transition count 201
Applied a total of 54 rules in 4 ms. Remains 125 /152 variables (removed 27) and now considering 201/356 (removed 155) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 125/152 places, 201/356 transitions.
[2024-06-01 15:15:24] [INFO ] Flatten gal took : 10 ms
[2024-06-01 15:15:24] [INFO ] Flatten gal took : 11 ms
[2024-06-01 15:15:24] [INFO ] Input system was already deterministic with 201 transitions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 356/356 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 122 transition count 174
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 122 transition count 174
Applied a total of 60 rules in 4 ms. Remains 122 /152 variables (removed 30) and now considering 174/356 (removed 182) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 122/152 places, 174/356 transitions.
[2024-06-01 15:15:24] [INFO ] Flatten gal took : 9 ms
[2024-06-01 15:15:24] [INFO ] Flatten gal took : 10 ms
[2024-06-01 15:15:24] [INFO ] Input system was already deterministic with 174 transitions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 356/356 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 123 transition count 175
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 123 transition count 175
Applied a total of 58 rules in 4 ms. Remains 123 /152 variables (removed 29) and now considering 175/356 (removed 181) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 123/152 places, 175/356 transitions.
[2024-06-01 15:15:24] [INFO ] Flatten gal took : 8 ms
[2024-06-01 15:15:24] [INFO ] Flatten gal took : 8 ms
[2024-06-01 15:15:24] [INFO ] Input system was already deterministic with 175 transitions.
[2024-06-01 15:15:24] [INFO ] Flatten gal took : 19 ms
[2024-06-01 15:15:24] [INFO ] Flatten gal took : 19 ms
[2024-06-01 15:15:24] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 6 ms.
[2024-06-01 15:15:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 152 places, 356 transitions and 1362 arcs took 5 ms.
Total runtime 39505 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : Anderson-PT-05-CTLFireability-2024-00
Could not compute solution for formula : Anderson-PT-05-CTLFireability-2024-01
Could not compute solution for formula : Anderson-PT-05-CTLFireability-2024-02
Could not compute solution for formula : Anderson-PT-05-CTLFireability-2024-03
Could not compute solution for formula : Anderson-PT-05-CTLFireability-2024-04
Could not compute solution for formula : Anderson-PT-05-CTLFireability-2024-05
Could not compute solution for formula : Anderson-PT-05-CTLFireability-2024-06
Could not compute solution for formula : Anderson-PT-05-CTLFireability-2024-07
Could not compute solution for formula : Anderson-PT-05-CTLFireability-2024-08
Could not compute solution for formula : Anderson-PT-05-CTLFireability-2024-09
Could not compute solution for formula : Anderson-PT-05-CTLFireability-2024-10
Could not compute solution for formula : Anderson-PT-05-CTLFireability-2024-11
Could not compute solution for formula : Anderson-PT-05-CTLFireability-2023-12
Could not compute solution for formula : Anderson-PT-05-CTLFireability-2023-13
Could not compute solution for formula : Anderson-PT-05-CTLFireability-2023-14
Could not compute solution for formula : Anderson-PT-05-CTLFireability-2023-15

BK_STOP 1717254925066

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name Anderson-PT-05-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/809/ctl_0_
ctl formula name Anderson-PT-05-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/809/ctl_1_
ctl formula name Anderson-PT-05-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/809/ctl_2_
ctl formula name Anderson-PT-05-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/809/ctl_3_
ctl formula name Anderson-PT-05-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/809/ctl_4_
ctl formula name Anderson-PT-05-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/809/ctl_5_
ctl formula name Anderson-PT-05-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/809/ctl_6_
ctl formula name Anderson-PT-05-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/809/ctl_7_
ctl formula name Anderson-PT-05-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/809/ctl_8_
ctl formula name Anderson-PT-05-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/809/ctl_9_
ctl formula name Anderson-PT-05-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/809/ctl_10_
ctl formula name Anderson-PT-05-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/809/ctl_11_
ctl formula name Anderson-PT-05-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/809/ctl_12_
ctl formula name Anderson-PT-05-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/809/ctl_13_
ctl formula name Anderson-PT-05-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/809/ctl_14_
ctl formula name Anderson-PT-05-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/809/ctl_15_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Anderson-PT-05"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is Anderson-PT-05, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r464-smll-171620118300322"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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