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.r512-smll-171654407200257.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 Peterson-PT-3, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r512-smll-171654407200257
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 27K Apr 12 02:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 143K Apr 12 02:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 27K Apr 12 02:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 134K Apr 12 02:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 17K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 108K Apr 12 02:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 511K Apr 12 02:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 71K Apr 12 02:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 344K Apr 12 02:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.5K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 12K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 143K May 18 16:43 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 Peterson-PT-3-CTLCardinality-2024-00
FORMULA_NAME Peterson-PT-3-CTLCardinality-2024-01
FORMULA_NAME Peterson-PT-3-CTLCardinality-2024-02
FORMULA_NAME Peterson-PT-3-CTLCardinality-2024-03
FORMULA_NAME Peterson-PT-3-CTLCardinality-2024-04
FORMULA_NAME Peterson-PT-3-CTLCardinality-2024-05
FORMULA_NAME Peterson-PT-3-CTLCardinality-2024-06
FORMULA_NAME Peterson-PT-3-CTLCardinality-2024-07
FORMULA_NAME Peterson-PT-3-CTLCardinality-2024-08
FORMULA_NAME Peterson-PT-3-CTLCardinality-2024-09
FORMULA_NAME Peterson-PT-3-CTLCardinality-2024-10
FORMULA_NAME Peterson-PT-3-CTLCardinality-2024-11
FORMULA_NAME Peterson-PT-3-CTLCardinality-2024-12
FORMULA_NAME Peterson-PT-3-CTLCardinality-2024-13
FORMULA_NAME Peterson-PT-3-CTLCardinality-2024-14
FORMULA_NAME Peterson-PT-3-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717269596336

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-3
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 19:19:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 19:19:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 19:19:58] [INFO ] Load time of PNML (sax parser for PT used): 136 ms
[2024-06-01 19:19:58] [INFO ] Transformed 244 places.
[2024-06-01 19:19:58] [INFO ] Transformed 332 transitions.
[2024-06-01 19:19:58] [INFO ] Found NUPN structural information;
[2024-06-01 19:19:58] [INFO ] Parsed PT model containing 244 places and 332 transitions and 1016 arcs in 304 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 36 ms.
Support contains 230 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 17 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-06-01 19:19:58] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2024-06-01 19:19:58] [INFO ] Computed 15 invariants in 27 ms
[2024-06-01 19:19:58] [INFO ] Implicit Places using invariants in 418 ms returned []
[2024-06-01 19:19:58] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-06-01 19:19:58] [INFO ] Invariant cache hit.
[2024-06-01 19:19:59] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-06-01 19:19:59] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 863 ms to find 0 implicit places.
Running 328 sub problems to find dead transitions.
[2024-06-01 19:19:59] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-06-01 19:19:59] [INFO ] Invariant cache hit.
[2024-06-01 19:19:59] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 5/245 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 2/247 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 19:20:02] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 13 ms to minimize.
[2024-06-01 19:20:02] [INFO ] Deduced a trap composed of 89 places in 70 ms of which 4 ms to minimize.
[2024-06-01 19:20:02] [INFO ] Deduced a trap composed of 97 places in 76 ms of which 2 ms to minimize.
[2024-06-01 19:20:03] [INFO ] Deduced a trap composed of 53 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:20:04] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 2 ms to minimize.
[2024-06-01 19:20:04] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 6/253 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 19:20:08] [INFO ] Deduced a trap composed of 50 places in 71 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 19:20:10] [INFO ] Deduced a trap composed of 53 places in 79 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (OVERLAPS) 4/244 variables, 6/261 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 4/265 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 19:20:16] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 4 ms to minimize.
[2024-06-01 19:20:16] [INFO ] Deduced a trap composed of 34 places in 91 ms of which 8 ms to minimize.
[2024-06-01 19:20:16] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 4 ms to minimize.
[2024-06-01 19:20:16] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 2 ms to minimize.
[2024-06-01 19:20:16] [INFO ] Deduced a trap composed of 52 places in 68 ms of which 1 ms to minimize.
[2024-06-01 19:20:16] [INFO ] Deduced a trap composed of 49 places in 82 ms of which 2 ms to minimize.
[2024-06-01 19:20:16] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 2 ms to minimize.
[2024-06-01 19:20:17] [INFO ] Deduced a trap composed of 45 places in 112 ms of which 2 ms to minimize.
[2024-06-01 19:20:17] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 2 ms to minimize.
[2024-06-01 19:20:17] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 2 ms to minimize.
[2024-06-01 19:20:17] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 2 ms to minimize.
[2024-06-01 19:20:17] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 3 ms to minimize.
[2024-06-01 19:20:17] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 2 ms to minimize.
[2024-06-01 19:20:17] [INFO ] Deduced a trap composed of 45 places in 104 ms of which 3 ms to minimize.
[2024-06-01 19:20:17] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 2 ms to minimize.
[2024-06-01 19:20:17] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 1 ms to minimize.
[2024-06-01 19:20:17] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 1 ms to minimize.
[2024-06-01 19:20:18] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 2 ms to minimize.
[2024-06-01 19:20:18] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 2 ms to minimize.
[2024-06-01 19:20:18] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/244 variables, 20/287 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 19:20:18] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 3 ms to minimize.
[2024-06-01 19:20:19] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 2 ms to minimize.
[2024-06-01 19:20:19] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 3 ms to minimize.
[2024-06-01 19:20:19] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 2 ms to minimize.
[2024-06-01 19:20:19] [INFO ] Deduced a trap composed of 81 places in 66 ms of which 2 ms to minimize.
[2024-06-01 19:20:19] [INFO ] Deduced a trap composed of 83 places in 71 ms of which 3 ms to minimize.
[2024-06-01 19:20:19] [INFO ] Deduced a trap composed of 48 places in 74 ms of which 6 ms to minimize.
[2024-06-01 19:20:19] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:20:19] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 2 ms to minimize.
[2024-06-01 19:20:19] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 2 ms to minimize.
[2024-06-01 19:20:20] [INFO ] Deduced a trap composed of 61 places in 103 ms of which 2 ms to minimize.
[2024-06-01 19:20:20] [INFO ] Deduced a trap composed of 56 places in 104 ms of which 4 ms to minimize.
[2024-06-01 19:20:20] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 2 ms to minimize.
[2024-06-01 19:20:20] [INFO ] Deduced a trap composed of 49 places in 78 ms of which 1 ms to minimize.
[2024-06-01 19:20:20] [INFO ] Deduced a trap composed of 73 places in 103 ms of which 2 ms to minimize.
[2024-06-01 19:20:20] [INFO ] Deduced a trap composed of 74 places in 71 ms of which 2 ms to minimize.
[2024-06-01 19:20:20] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 2 ms to minimize.
[2024-06-01 19:20:20] [INFO ] Deduced a trap composed of 49 places in 80 ms of which 2 ms to minimize.
[2024-06-01 19:20:20] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 2 ms to minimize.
[2024-06-01 19:20:21] [INFO ] Deduced a trap composed of 86 places in 75 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/244 variables, 20/307 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 19:20:21] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 2 ms to minimize.
[2024-06-01 19:20:21] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 1 ms to minimize.
[2024-06-01 19:20:22] [INFO ] Deduced a trap composed of 69 places in 71 ms of which 2 ms to minimize.
[2024-06-01 19:20:22] [INFO ] Deduced a trap composed of 73 places in 91 ms of which 2 ms to minimize.
[2024-06-01 19:20:22] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
[2024-06-01 19:20:22] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 3 ms to minimize.
[2024-06-01 19:20:23] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 2 ms to minimize.
[2024-06-01 19:20:23] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 5 ms to minimize.
[2024-06-01 19:20:23] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-06-01 19:20:23] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 2 ms to minimize.
[2024-06-01 19:20:24] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 2 ms to minimize.
[2024-06-01 19:20:24] [INFO ] Deduced a trap composed of 50 places in 69 ms of which 2 ms to minimize.
[2024-06-01 19:20:25] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/244 variables, 13/320 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 19:20:28] [INFO ] Deduced a trap composed of 49 places in 98 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 244/552 variables, and 321 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30032 ms.
Refiners :[Domain max(s): 244/244 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/244 constraints, ReadFeed: 0/57 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 62/62 constraints]
Escalating to Integer solving :Problem set: 0 solved, 328 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 5/245 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 2/247 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 60/307 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 5 (OVERLAPS) 4/244 variables, 6/313 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 4/317 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 2/319 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 2/321 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 19:20:34] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 2 ms to minimize.
[2024-06-01 19:20:35] [INFO ] Deduced a trap composed of 86 places in 109 ms of which 2 ms to minimize.
[2024-06-01 19:20:35] [INFO ] Deduced a trap composed of 59 places in 136 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 3/324 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 19:20:38] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 2 ms to minimize.
[2024-06-01 19:20:38] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 2 ms to minimize.
[2024-06-01 19:20:38] [INFO ] Deduced a trap composed of 85 places in 100 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/244 variables, 3/327 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 19:20:43] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/244 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/244 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 13 (OVERLAPS) 308/552 variables, 244/572 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/552 variables, 57/629 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/552 variables, 328/957 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 552/552 variables, and 957 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30016 ms.
Refiners :[Domain max(s): 244/244 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 244/244 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 69/69 constraints]
After SMT, in 60220ms problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 60284ms
Finished structural reductions in LTL mode , in 1 iterations and 61200 ms. Remains : 244/244 places, 332/332 transitions.
Support contains 230 out of 244 places after structural reductions.
[2024-06-01 19:20:59] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-06-01 19:21:00] [INFO ] Flatten gal took : 69 ms
FORMULA Peterson-PT-3-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 19:21:00] [INFO ] Flatten gal took : 31 ms
[2024-06-01 19:21:00] [INFO ] Input system was already deterministic with 332 transitions.
RANDOM walk for 40000 steps (8 resets) in 3556 ms. (11 steps per ms) remains 25/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 25/25 properties
[2024-06-01 19:21:01] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-06-01 19:21:01] [INFO ] Invariant cache hit.
[2024-06-01 19:21:01] [INFO ] State equation strengthened by 57 read => feed constraints.
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 220/220 constraints. Problems are: Problem set: 13 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/220 constraints. Problems are: Problem set: 13 solved, 12 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp23 is UNSAT
At refinement iteration 2 (OVERLAPS) 6/226 variables, 6/226 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 6/232 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 0/232 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 2/228 variables, 2/234 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 2/236 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 0/236 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 4/232 variables, 4/240 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/232 variables, 4/244 constraints. Problems are: Problem set: 17 solved, 8 unsolved
[2024-06-01 19:21:02] [INFO ] Deduced a trap composed of 49 places in 93 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 1/245 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/232 variables, 0/245 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 308/540 variables, 232/477 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/540 variables, 57/534 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/540 variables, 0/534 constraints. Problems are: Problem set: 17 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 12/552 variables, 12/546 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/552 variables, 12/558 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/552 variables, 3/561 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/552 variables, 0/561 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 0/552 variables, 0/561 constraints. Problems are: Problem set: 17 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 552/552 variables, and 561 constraints, problems are : Problem set: 17 solved, 8 unsolved in 1445 ms.
Refiners :[Domain max(s): 244/244 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 244/244 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 17 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 14/14 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/14 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 212/226 variables, 6/20 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 212/232 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 0/232 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 2/228 variables, 2/234 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 2/236 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 0/236 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 4/232 variables, 4/240 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/232 variables, 4/244 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 1/245 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/232 variables, 0/245 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 308/540 variables, 232/477 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/540 variables, 57/534 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/540 variables, 8/542 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/540 variables, 0/542 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 12/552 variables, 12/554 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/552 variables, 12/566 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/552 variables, 3/569 constraints. Problems are: Problem set: 17 solved, 8 unsolved
[2024-06-01 19:21:04] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 2 ms to minimize.
[2024-06-01 19:21:04] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 2 ms to minimize.
[2024-06-01 19:21:04] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 2 ms to minimize.
[2024-06-01 19:21:04] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 2 ms to minimize.
Problem AtomicPropp10 is UNSAT
[2024-06-01 19:21:04] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 3 ms to minimize.
[2024-06-01 19:21:04] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 3 ms to minimize.
[2024-06-01 19:21:04] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 2 ms to minimize.
[2024-06-01 19:21:05] [INFO ] Deduced a trap composed of 49 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:21:05] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 2 ms to minimize.
[2024-06-01 19:21:05] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/552 variables, 10/579 constraints. Problems are: Problem set: 18 solved, 7 unsolved
[2024-06-01 19:21:05] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 2 ms to minimize.
[2024-06-01 19:21:05] [INFO ] Deduced a trap composed of 49 places in 83 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/552 variables, 2/581 constraints. Problems are: Problem set: 18 solved, 7 unsolved
[2024-06-01 19:21:05] [INFO ] Deduced a trap composed of 48 places in 82 ms of which 2 ms to minimize.
[2024-06-01 19:21:06] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 2 ms to minimize.
[2024-06-01 19:21:06] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/552 variables, 3/584 constraints. Problems are: Problem set: 18 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/552 variables, 0/584 constraints. Problems are: Problem set: 18 solved, 7 unsolved
At refinement iteration 23 (OVERLAPS) 0/552 variables, 0/584 constraints. Problems are: Problem set: 18 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 552/552 variables, and 584 constraints, problems are : Problem set: 18 solved, 7 unsolved in 3490 ms.
Refiners :[Domain max(s): 244/244 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 244/244 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 8/25 constraints, Known Traps: 16/16 constraints]
After SMT, in 5030ms problems are : Problem set: 18 solved, 7 unsolved
Parikh walk visited 3 properties in 2148 ms.
Support contains 6 out of 244 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 88 rules applied. Total rules applied 88 place count 244 transition count 244
Reduce places removed 88 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 89 rules applied. Total rules applied 177 place count 156 transition count 243
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 178 place count 155 transition count 243
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 178 place count 155 transition count 196
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 272 place count 108 transition count 196
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 294 place count 97 transition count 185
Applied a total of 294 rules in 58 ms. Remains 97 /244 variables (removed 147) and now considering 185/332 (removed 147) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 97/244 places, 185/332 transitions.
RANDOM walk for 40000 steps (8 resets) in 358 ms. (111 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 196535 steps, run visited all 4 properties in 869 ms. (steps per millisecond=226 )
Probabilistic random walk after 196535 steps, saw 39506 distinct states, run finished after 879 ms. (steps per millisecond=223 ) properties seen :4
Successfully simplified 18 atomic propositions for a total of 14 simplifications.
FORMULA Peterson-PT-3-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 19:21:10] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-06-01 19:21:10] [INFO ] Flatten gal took : 22 ms
[2024-06-01 19:21:10] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA Peterson-PT-3-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 19:21:10] [INFO ] Flatten gal took : 26 ms
[2024-06-01 19:21:10] [INFO ] Input system was already deterministic with 332 transitions.
Support contains 124 out of 244 places (down from 215) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 20 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 244/244 places, 332/332 transitions.
[2024-06-01 19:21:10] [INFO ] Flatten gal took : 19 ms
[2024-06-01 19:21:10] [INFO ] Flatten gal took : 23 ms
[2024-06-01 19:21:10] [INFO ] Input system was already deterministic with 332 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 244 transition count 296
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 208 transition count 296
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 72 place count 208 transition count 272
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 120 place count 184 transition count 272
Applied a total of 120 rules in 52 ms. Remains 184 /244 variables (removed 60) and now considering 272/332 (removed 60) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 54 ms. Remains : 184/244 places, 272/332 transitions.
[2024-06-01 19:21:10] [INFO ] Flatten gal took : 18 ms
[2024-06-01 19:21:10] [INFO ] Flatten gal took : 16 ms
[2024-06-01 19:21:10] [INFO ] Input system was already deterministic with 272 transitions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 5 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 244/244 places, 332/332 transitions.
[2024-06-01 19:21:10] [INFO ] Flatten gal took : 17 ms
[2024-06-01 19:21:10] [INFO ] Flatten gal took : 18 ms
[2024-06-01 19:21:10] [INFO ] Input system was already deterministic with 332 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 0 with 92 rules applied. Total rules applied 92 place count 244 transition count 240
Reduce places removed 92 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 93 rules applied. Total rules applied 185 place count 152 transition count 239
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 186 place count 151 transition count 239
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 186 place count 151 transition count 193
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 278 place count 105 transition count 193
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 302 place count 93 transition count 181
Applied a total of 302 rules in 26 ms. Remains 93 /244 variables (removed 151) and now considering 181/332 (removed 151) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27 ms. Remains : 93/244 places, 181/332 transitions.
[2024-06-01 19:21:10] [INFO ] Flatten gal took : 9 ms
[2024-06-01 19:21:10] [INFO ] Flatten gal took : 14 ms
[2024-06-01 19:21:10] [INFO ] Input system was already deterministic with 181 transitions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 5 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 244/244 places, 332/332 transitions.
[2024-06-01 19:21:10] [INFO ] Flatten gal took : 14 ms
[2024-06-01 19:21:10] [INFO ] Flatten gal took : 15 ms
[2024-06-01 19:21:10] [INFO ] Input system was already deterministic with 332 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 244 transition count 236
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 192 place count 148 transition count 236
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 192 place count 148 transition count 188
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 288 place count 100 transition count 188
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 312 place count 88 transition count 176
Applied a total of 312 rules in 21 ms. Remains 88 /244 variables (removed 156) and now considering 176/332 (removed 156) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 88/244 places, 176/332 transitions.
[2024-06-01 19:21:10] [INFO ] Flatten gal took : 7 ms
[2024-06-01 19:21:10] [INFO ] Flatten gal took : 8 ms
[2024-06-01 19:21:10] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 0 with 92 rules applied. Total rules applied 92 place count 244 transition count 240
Reduce places removed 92 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 93 rules applied. Total rules applied 185 place count 152 transition count 239
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 186 place count 151 transition count 239
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 186 place count 151 transition count 193
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 278 place count 105 transition count 193
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 302 place count 93 transition count 181
Applied a total of 302 rules in 24 ms. Remains 93 /244 variables (removed 151) and now considering 181/332 (removed 151) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 93/244 places, 181/332 transitions.
[2024-06-01 19:21:10] [INFO ] Flatten gal took : 7 ms
[2024-06-01 19:21:10] [INFO ] Flatten gal took : 9 ms
[2024-06-01 19:21:10] [INFO ] Input system was already deterministic with 181 transitions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 244/244 places, 332/332 transitions.
[2024-06-01 19:21:10] [INFO ] Flatten gal took : 12 ms
[2024-06-01 19:21:10] [INFO ] Flatten gal took : 14 ms
[2024-06-01 19:21:10] [INFO ] Input system was already deterministic with 332 transitions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 244/244 places, 332/332 transitions.
[2024-06-01 19:21:11] [INFO ] Flatten gal took : 13 ms
[2024-06-01 19:21:11] [INFO ] Flatten gal took : 17 ms
[2024-06-01 19:21:11] [INFO ] Input system was already deterministic with 332 transitions.
[2024-06-01 19:21:11] [INFO ] Flatten gal took : 15 ms
[2024-06-01 19:21:11] [INFO ] Flatten gal took : 14 ms
[2024-06-01 19:21:11] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2024-06-01 19:21:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 244 places, 332 transitions and 1016 arcs took 5 ms.
Total runtime 73104 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 : Peterson-PT-3-CTLCardinality-2024-02
Could not compute solution for formula : Peterson-PT-3-CTLCardinality-2024-05
Could not compute solution for formula : Peterson-PT-3-CTLCardinality-2024-08
Could not compute solution for formula : Peterson-PT-3-CTLCardinality-2024-10
Could not compute solution for formula : Peterson-PT-3-CTLCardinality-2024-11
Could not compute solution for formula : Peterson-PT-3-CTLCardinality-2024-12
Could not compute solution for formula : Peterson-PT-3-CTLCardinality-2024-13
Could not compute solution for formula : Peterson-PT-3-CTLCardinality-2024-14
Could not compute solution for formula : Peterson-PT-3-CTLCardinality-2024-15

BK_STOP 1717269671485

--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name Peterson-PT-3-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/782/ctl_0_
ctl formula name Peterson-PT-3-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/782/ctl_1_
ctl formula name Peterson-PT-3-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/782/ctl_2_
ctl formula name Peterson-PT-3-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/782/ctl_3_
ctl formula name Peterson-PT-3-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/782/ctl_4_
ctl formula name Peterson-PT-3-CTLCardinality-2024-12
ctl formula formula --ctl=/tmp/782/ctl_5_
ctl formula name Peterson-PT-3-CTLCardinality-2024-13
ctl formula formula --ctl=/tmp/782/ctl_6_
ctl formula name Peterson-PT-3-CTLCardinality-2024-14
ctl formula formula --ctl=/tmp/782/ctl_7_
ctl formula name Peterson-PT-3-CTLCardinality-2024-15
ctl formula formula --ctl=/tmp/782/ctl_8_
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="Peterson-PT-3"
export BK_EXAMINATION="CTLCardinality"
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 Peterson-PT-3, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r512-smll-171654407200257"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-3.tgz
mv Peterson-PT-3 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;